IOSR Journal of Computer Engineering (IOSR-JCE)

International Conference on Emerging Trends in Engineering & Management (ICETEM-2016)

Volume-1 Issue-1

Paper Type : Research Paper
Title : Survey on Efficient Keyword Search Scheme over Encrypted Data on Mobile Cloud
Country : India
Authors : Anju Chandran || Asso. Prof. P Krishna kumaran Thampi

Abstract: Mobile cloud storage is a service model in which data are maintained, managed and backup remotely on the cloud side and meanwhile data keeps available to the user over network. To store data on data storage servers such as mail servers and file servers in encrypted form to reduce security and privacy risk. Encryption and decryption are overhead for mobile devices because it is very small and have low computation power. TEES (Traffic and Energy Efficient Storage) offloads computation from mobile devices to cloud to reduce the power consumption and bandwidth. Data privacy does not degrade when the performance enhancement methods are applied. The network traffic also significantly reduced during file retrieval. This paper presents a study on Traffic and Energy Efficient Search over encrypted data on mobile cloud. Keywords:TEES, Mobile Cloud Storage, Energy Efficient, Traffic Efficient

[1] D. Huang, "Mobile cloud computing," IEEE COMSOC Multimedia Communications Technical Committee (MMTC) E-Letter, 2011.
[2] D. Song, D. Wagner, and A. Perrig, "Practical techniques for searches on encrypted data," in Security and Privacy, 2000. S&P 2000. Proceedings. 2000 IEEE Symposium on. IEEE, 2000, pp. 44– 55. [3] Y. Chang and M. Mitzenmacher, "Privacy preserving keyword searches on remote encrypted data," in Applied Cryptography and Network Security. Springer, 2005, pp. 391–421. [4] C. Wang, N. Cao, K. Ren, and W. Lou, "Enabling secure and efficient ranked keyword search over outsourced cloud data," Parallel and Distributed Systems, IEEE Transactions on, vol. 23, no. 8, pp. 1467–1479, 2012.
[5] R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, "Order preserving encryption for numeric data," in Proceedings of the 2004 ACM SIGMOD international conference on Management of data. ACM, 2004, pp. 563–574.
[6] K. Kumar and Y. Lu, "Cloud computing for mobile users: Can offloading computation save energy?" Computer, vol. 43, no. 4,pp. 51–56, 2010.


Paper Type : Research Paper
Title : Survey on Different Watchdog Systems to Deal with Selfish Nodes In MANETs
Country : India
Authors : Anju Markose || Asst. Prof. Vidhya P.M

Abstract: The use of mobile ad hoc networks (MANETs) has been widely spread in many applications, including some mission critical applications. Security has become one of the major concerns in MANETs. Mobile Ad-hoc Networks (MANETs) assume that mobile nodes voluntary cooperate in order to work properly. MANET nodes rely on network cooperation schemes to work properly, forwarding traffic unrelated to its own use. This cooperation is a cost-intensive activity and some nodes may refuse to cooperate, leading to selfish node behaviour. Watchdogs are used to detect selfish nodes in computer networks. Different types of watchdog mechanisms are available. This paper presents a study on various watchdog mechanisms focusing on their features

Keywords: Selfish node; Watchdog; Isolation; MANET, Route Request, Watchdog

[1]. FarzanehPakzad andMarjanKuchaki Rafsanjani "Intrusion Detection Techniques for Detecting Misbehaving Nodes", in Computer and Information Science Vol. 4,-1; January 2011.
[2]. Kachirski O, Guha R. (2003). "Effective Intrusion Detection Using Multiple Sensors in Wireless Ad Hoc Networks", in Proceeding IEEE, (HICSS'03), pp 57.1.
[3]. Buchegger S, Le Boudec J. (2002). "Performance analysis of the CONFIDANT protocol (Cooperation of nodes fairness in dynamic ad-hoc network)", in Proceeding 3rd ACM (MobiHoc'02), pp 226–336.
[4]. Michiardi P, Molva R. (2002). "Core: A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks", in International Conference on (CMS'02).
[5]. Bansal S, Baker M. (2003). "Observation-based cooperation enforcement in ad hoc networks", in Technical Paper on Network and Internet Architecture (cs.NI / 0307012). [6]. Hongxun Liu, José G. Delgado-Frias, and SirishaMedidi "USING A TWO-TIMER SCHEME TO DETECTSELFISH NODES IN MOBILE AD- HOC NETWORKS" in Proceeding of the sixth IASTED July 2-4, 2007


Paper Type : Research Paper
Title : A Survey on Improving the Capacity of Hybrid Wireless Networks by Using Distributed Three-Hop Routing Protocol
Country : India
Authors : Anju Prabha || Asst.Prof. Silpa Muraliraj

Abstract:A routing protocol is a critical component that affects the throughput capacity of a wireless network in data transmission. The routing protocols in hybrid wireless networks combine the cellular transmission mode (i.e. transmission mode) in infrastructure wireless networks and the ad-hoc transmission mode in mobile ad-hoc networks. The protocols use the multi-hop routing to forward a message to the mobile gateway nodes that are closest to the base station or have the highest bandwidth to the base stations. The widespread base station, the mobile nodes have a high probability of encountering a BS while moving. Existing Two-Hop Routing protocols are produce High overhead and Low Reliability. Taking advantage of this feature, we propose a Distributed Three-hop Data Routing protocol (DTR). In DTR a source node divides a message stream into a number of segments. The proposed DTR protocol compare to Two-Hop Routing protocol improve the Network Efficiency and reduce the Overhead.

Keywords: Hybrid wireless Network, Three-Hop, Distributing, Throughput, Overhead..

[1] H Luo, R. Ramjee, P. Sinha, L. Li, and S. Lu. Ucan: A unified cell and ad-hoc network architecture. In Proc. of MOBICOM, 2003. H. Wu, C. Qiao, S. De, and O. Tonguz, "Integrated cell and ad hoc relaying systems: iCAR," IEEE J. Sel. Areas Commun., vol. 19, no. 10, pp. 2105–2115, Oct. 2001.
[2] Y. D. Lin and Y. C. Hsu, "Multi-hop cellular: A new architecture for wireless communications," in Proc. IEEE Conf. Comput.
Commun ,2000, pp. 1273–1282.
[3] P. Thiran, O. Dousse, and M. Hasler, "Connectivity in ad hoc and hybrid networks," in Proc. IEEE Conf. Comput. Commun.,
2002, pp. 1079–1088
[4] V. D. Park and M. Scott Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks," in Proc. IEEE
Conf. Comput. Commun., 1997, p. 1405
D. Johnson and D. Maltz, "Dynamic source routing in ad hoc wireless networks," T. Imielinski and H. Korth, eds. Mobile Computing,
volume 353 of The Kluwer International Series in Engineering and Computer Science, Springer US, pp. 153–181, 1996.


Paper Type : Research Paper
Title : Efficient Semantic Search over Encrypted Data in cloud
Country : India
Authors : Anju T R || Sangeeta Srinivas

Abstract: Semantic search enable to improve search efficiency by understanding searcher intent and the contextual meaning as they appear in searchable space, whether on the web or within a closed system. semantic search generate synonyms set to provide relevant search results. Cloud storage has become more and more popular as it provides many benefits over traditional storage solutions. Despite the many benefits provided by cloud storage, many security problems have also arisen in cloud storage, which prevents companies from migrate their data to cloud storage. As a result, the owners encrypt their sensitive data before storing it in cloud storage. While encryption increases the security of the data, it also reduces the search ability of the data and thus, the Efficiency of the search.

[1] L. Gravano, P. G. Ipeirotis, H. V. Jagadish N. Koudas, S. Muthukrishnan and D. Srivastava, "Approximate String Joins in a Database (Almost) for Free," Proc. Int‟l Conf. Very Large Data Bases (VLDB), pp. 491-500, 2001.
[2] J. Wang, G. Li and J. Feng, "Can We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search," Proc. ACM SIGMOD Int‟l Conf. Management of Data (SIGMOD), pp.85-96, 2012.
[3] Haoji Hu, Kai Zheng, Xiaoling Wang, and Aoying Zhou "GFilter: A General Gram Filter for String Similarity Search"21pp 1041-4347 2013
[4] F. Rocha, M. Correia, "Lucy in the Sky without Diamonds: Stealing Confidential Data in the Cloud," Dependable Systems and Networks Workshops (DSN-W), 2011 IEEE/IFIP 41st International Conference on, 2011, pp 129-134.


Paper Type : Research Paper
Title : Public Auditing Mechanisms to Protect the Integrity of Data Shared in the Cloud
Country : India
Authors : Gayathri Dili || Assoc. Prof. Anu V.R

Abstract: Clients are capable of storing large amount of data on a storage space that can be either a trusted or untrusted server. This storage outsourcing has resulted in a number of security issues. This could happen at the time when the data shared by one user is being used by another user and modify it and again the data. Cloud offers data storage and sharing facilities that provides better scalability. Apart from share the advantages offered by Cloud it find difficulties in maintaining the integrity of the shared data. Public auditing is a mechanism by which the integrity of data could be maintained so that the correctness of data could be verified. In this paper, we discuss about the different Public auditing mechanisms that has contributed towards the maintenance of integrity of data and the use of public auditing for data shared in the cloud.

Keywords: Shared data, Public auditing, User-revocation, Cloud computing

1] M. Blaze, G. Bleumer, and M. Strauss, ―Divertible Protocols and Atomic Proxy Cryptography,‖ Proc. Int'l Conf. the Theory and Application of Cryptographic Techniques (EUROCRYPT'98), pp. 127-144, 1998.
[2] G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, ―Provable Data Possession at Untrusted Stores,‖ Proc. 14th ACM Conf. Computer and Comm. Security (CCS'07),pp. 598-610, 2007.
[3] G. Ateniese, R.D. Pietro, L.V. Mancini, and G. Tsudik, ―Scalable and Efficient Provable Data Possession, ‖Proc. Fourth Int'l Conf. Security and Privacy in Comm. Networks (ICST SecureComm'08),2008.
[4] Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou, ―Enabling Public Verifiability and Data Dynamic for Storage Security in Cloud Computing,‖ Proc. 14th European Conf. Research in Compute Security(ESORICS'09, 2009.
[5] Wang, Q. Wang, K. Ren, and W. Lou, ―Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing,‖ Proc IEEE INFOCOM, pp. 525-533, 2010.
[6] B. Wang, B. Li, and H. Li, ―Oruta: Privacy-Preserving Public Auditing for Shared Data in the Cloud,‖ Proc. IEEE CLOUD, pp. 295-302, 2012.

Paper Type : Research Paper
Title : Efficient Technique for Privacy Preserving and Detection of Malicious Packet Dropping In Wireless Adhoc Networks
Country : India
Authors : Hridya V Devaraj || Asst. Prof. Jinu Mohan

Abstract: In a Wireless Ad Hoc Network, nodes collaborate in supporting the network functionality. The effect of malicious nodes can lead to Packet Dropping, which disrupt the communications of potentially any node within the ad hoc networking domain. Link errors cause packet dropping, so does the insider attack, or the combined effect of link errors and malicious nodes cause packet dropping. In the most severe form, the malicious node simply stops forwarding every packet received from upstream nodes, completely disrupting the path between the source and the destination. Conventional algorithms based on detecting the packet loss rate cannot achieve satisfactory detection accuracy because the packet dropping rate is comparable to the channel error rate. Hence to improve the detection accuracy, the correlations between lost packets is identified. This paper presents a study on packet dropping attacks and their detection based on auto correlation function.

Keywords: Packet Dropping, Link Errors, Wireless adhoc networks, auto correlation function

[1]. "Robust routing in wireless Ad hoc Networks", University of Maryland, 2002
[2]. R. Rao and G. Kesidis, "Detecting malicious packet dropping using statistically regular traffic patterns in multihop wireless networks that are not bandwidth limited," in Proc. IEEE GLOBECOM Conf., 2003.
[3]. K. Balakrishnan, J. Deng, and P. K. Varshney,
[4]. "TWOACK: Preventing selfishness in mobile ad hoc networks," in Proc. IEEE Wireless Commun. Netw. Conf., 2005.
[5]. K. Liu, J. Deng, P. Varshney, and K. Balakrishnan, "An acknowledgement-based approach for the detection of routing misbehavior in MANETs," IEEE Trans. Mobile Comput., vol. 6, no. 5, pp. 536–550, May 2006.
[6]. G. Ateniese, S. Kamara, and J. Katz, "Proofs of storage from homomorphic identification protocols," in Proc. Int. Conf. Theory Appl.Cryptol. Inf. Security, 2009
[7]. W. Kozma Jr. and L. Lazos, "Dealing with liars: Misbehavior identification via Renyi-Ulam games," presented at the Int. ICST Conf. Security Privacy in Commun. Networks, Athens, Greece, 2009.
[8]. W. Kozma Jr., and L. Lazos, "REAct: Resource-efficient accountability for node misbehavior in ad hoc networks based on random audits," in Proc. ACM Conf. Wireless Netw. Secur., 2009


Paper Type : Research Paper
Title : Securing Phr Using Different Attribute Based Encryption
Country : India
Authors : Jeena Kuriakose || Gayathry K. V || Dr Suvanam Sasidhar Babu

Abstract: PHR system allows patient to share their personal health records in a centralized way. PHR records are outsourced to any third party server so that these will be easily accessible to the users. Patients normally share the records with wide range of users including relatives, friends, doctors, nurses and so on. In order to avoid the complexity of handling users, the system divides the users into two different domains namely personal domain and public domain. The former consists of family and friends while the latter consists of doctors, pharmacists, researchers etc. Since the data is outsourced to third party such as cloud providers, data security and privacy remains main issue. Security of data is enhanced by encrypting the data before being outsourced. In this paper two types of encryption were proposed, HMASBE to encrypt the records shared to public domain users and AMIRBE to encrypt records shared to personal domain users. Data anonymization is used to ensure the privacy of shared data.

Keywords: Anonymization, Encryption, Personal domain, Public domain, PHR, Privacy, Security

[1]. D. C. Kaelber, A. K. Jha, D. Johnston, B. Middleton, and D. W. Bates, "Viewpoint paper:Aresearch agenda for personal health records (PHRs)," J. Amer. Med. Inform. Assoc., vol. 15, no. 6, pp. 729–736, 2008.
[2]. "At Risk of Exposure - in the Push for Electronic Medical Records, Concern Is Growing About How Well Privacy Can Be Safeguarded," http://articles.latimes.com/2006/jun/26 /health/ he-privacy26, 2006.
[3] E. Smith and J. Eloff, "Security in health-care information systems - current trends," International Journal of Medical Informatics, vol. 54, no. 1, pp. 39–54, April 1999
[4]. A. Boldyreva, V. Goyal, and V. Kumar, "Identity-Based Encryption with Efficient Revocation," Proc. 15th ACM Conf. Computer and Comm. Security (CCS), pp. 417-426, 2008. [5]. S. Yu, C. Wang, K. Ren, and W. Lou, "Attribute Based Data Sharing with Attribute Revocation," Proc. Fifth ACM Symp. Information, Computer and Comm. Security (ASIACCS '10), 2010. [6]. A. Lewko and B. Waters, "Decentralizing Attribute-Based Encryption," EUROCRYPT: Proc. 30th Ann. Int'l Conf. Theory and Applications of Cryptographic Techniques: Advances in Cryptology, pp. 568-588, 2011..


Paper Type : Research Paper
Title : Authentication and Revocation Of Roaming Users
Country : India
Authors : Jini Kuriakose || Silpa Kamalan || Dr Suvanam Sasidhar Babu

Abstract: Roaming means a mobile device moving from home location to a foreign location. The paper mainly focuses on the authentication and revocation of roaming users. User revocation can occur in two ways such as natural revocation and premature revocation. Natural revocation occurs due to the expiration of the secret key and premature revocation is mainly due to the unauthorized activities such as hacking. The system make use of group signature for authentication and revocation is efficient. Keywords: Roaming, Group Signature, Revocation, Secret key, Anonymity.

[1]. Hyo Jin Jo,Jung Ha Paik, Dong Hoon Lee, ―Efficient Privacy-Preserving Authentication in Wireless Mobile Networks‖, IEEE Trans. Mobile Coputing,vol.13,no.7,July 2014.
[2]. Joseph K. Liu, Cheng-kang Chu, Sherman S. M. Chow, Xinyi Huang, Man Ho Au, Jianying Zhou ―Time-Bound Anonymous Authentication for Roaming Networks,‖ IEEE Trans. Information Forensics and Security,vol.10,no.1,January 2015.
[3]. D. He, J. Bu, S. Chan, C. Chen, and M. Yin, ―Privacy-preserving universal authentication protocol for wireless communications,‖ IEEE Trans. Wireless Commun., vol. 10, no. 2, pp. 431–436, Feb. 2011.
[4]. L. Chen and J. Li, ―VLR group signatures with indisputable exculpability and efficient revocation,‖ in Proc. IEEE 2nd Int. Conf. SocialCom, Aug. 2010, pp. 727–734.
[5]. M. H. Au, J. K. Liu, W. Susilo, and T. H. Yuen, ―Secure ID-based linkable and revocable-iff-linked ring signature with constant-size construction,‖ Theoretical Comput. Sci., vol. 469, pp. 1–14, Jan. 2013.
[6]. D. Boneh and H. Shacham, ―Group signatures with verifier-local revocation,‖ in Proc. 11th ACM Conf. CCS, 2004, pp. 168–177.
[7]. L. Chen, S.-L. Ng, and G. Wang, ―Threshold anonymous announcement in VANETs,‖ IEEE J. Sel. Areas Commun., vol. 29, no. 3, pp. 605–615, Mar. 2011.


Paper Type : Research Paper
Title : Real –Time Video Recommendation System in Hadoop with User Contextual Information
Country : India
Authors : Lakshmi Prakash AV || Saini Jacob Soman

Abstract: By the end of 2015, 90% of global consumer traffic is being videos that make people hard to obtain their desired content over internet. So the video recommendation system has to take its full potential to provide people with desired items. On behalf of that advanced technologies has to be utilized in existing recommendation system where most of the existing systems suffer from performance as well as scalability problems while dealing with larger datasets. This paper proposed a Hadoop based real–time recommending and recommendation training of a video recommendation system. In real-time recommending section, initially the real-time component accepts the user's request and then process the request and finally returns an individualized recommendation to the user.

[1]. M. J. Pazzani and D. Billsus, "Content-based recommendatiosystems,"TheAdaptiveWeb.Berlin,Germany:Springer-Verlag, 2007, pp. 325–341.

[2]. Z.-D. Zhao and M.-S. Shang, "User-based collaborative-filtering recommendation algorithms on Hadoop," in Proc. WKDD, 2010, pp. 478–481

[3]. P. Pawar and A. Tokmakoff, "Ontology-based context-aware service discovery for pervasive environments," in Proc. IEEE Int. Workshop Service Integr. Pervasive Environ. Jun. 2006, pp. 1–7.


Paper Type : Research Paper
Title : An efficient Secure Video Transmission using Secret-Fragment-Visible Mosaic Images
Country : India
Authors : Lakshmi Priya K.M || Smitha Suresh || Deepak P || Swapna Sasikumar

Abstract: Nowadays videos from different sources are required to transmit through the web for very pertinent applications .These videos may contain confidential data so they must be protected during transmission to avoid leakage. To ensure the confidentiality of such videos an SVTSM system is proposed. The main essence of this methodology is taken from an existing image transmission technique called secret-fragment-visible mosaic image, which is created using small fragments of a given image to get a target image called as mosaic image. In the proposed system that actual video is embedded in to the mosaic video. The risk of transmitting a secret video data inside another video is very high. In the existing system, secret-fragment-visible mosaic image method applies only for the image data.

[1] I-Jen Lai and Wen-Hsiang Tsai,‖ ] Secret-Fragment-Visible Mosaic Image–A New Computer Art and Its Application to Information Hiding‖, IEEE transactions on information forensics and security, vol. 6, no. 3, September 2011 [2] Howard Cheng and Xiaobo Li, Senior Member, IEEE, ―Partial Encryption of Compressed Images and Videos‖, IEEE transactions on signal processing, vol. 48, no. 8, august 2000 [3] Zhenfei Zhao and HaoLuo, Zhe-Ming Lu, ―Joint Secret Image Sharing and Progressive Transmission Based on Integer Discrete Cosine Transform‖, 2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing [4] J.K. Mandal#1, S. Ghatak, ―Secret Image / Message Transmission through Meaningful Shares using (2, 2) Visual Cryptography (SITMSVC)‖, IEEE-International Conference on Recent Trends in Information Technology, ICRTIT 2011 978-1-4577-0590-8/11/$26.00 ©2011 Ieee Mit, Anna University, Chennai. June 3-5, 2011 [5] Wei-Jen Wang, Cheng-Ta Huang, and Shiuh-Jeng Wang, Member, IEEE, ―VQ Applications in Steganographic Data Hiding Upon Multimedia Images‖, Ieee Systems Journal, Vol. 5, No. 4, December 2011


Paper Type : Research Paper
Title : A Comparative Study of Machine Learning Approaches for Text Classification
Country : India
Authors : Lino Murali || Anjali A || Athira Raj

Abstract: Perhaps the single largest data source in the world is the world wide web. Heterogeneous and unstructured nature of the data on web has challenged mining the web. Practical needs to extract textual information and unseen patterns continue to drive the research interest in text mining. Faultless categorization of texts can be better performed by machine learning techniques. In this paper we present a review of various text classification approaches under machine learning paradigm. Existing classification algorithms including Decision Tree, Naive Bayes, Support Vector Machine and k-Nearest Neighbors are compared based on speed, accuracy, interpretability and multi-class support.

Keywords: Text classification; Machine Learning; Naive Bayes; k-Nearest Neighbour; Support Vector Machine; Decision Tree.

[1] Iswarya, Radha V, "Ensemble learning approach in improved K Nearest Neighbor algorithm for Text categorization" ,IEEE International Conference on Innovations in Information, Embedded and Communication Systems (ICIIECS), 2015 .
[2] Lilleberg J, Marshall,Yun Zhu, Yanqing Zhang,"Support vector machines and Word2vec for text classification with semantic features", IEEE 14th International Conference on Cognitive Informatics & Cognitive Computing (ICCICC), 2015.
[3] Pratiksha Y. Pawar and S. H. Gawande, "A Comparative Study on Different Types of Approaches to Text Categorization", International Journal of Machine Learning and Computing vol. 2, no. 4, pp. 423-426, 2012.
[4] Holts A, Riquelme C, Alfaro R, "Automated Text Binary Classificationusing Machine Learning Approach" ,IEEE XXIX International Conference of the Chilean Computer Science Society (SCCC), 2010.
[5] Vandana KordeC, Namrata Mahender,"Textclassificationandclassifiers: ASURVEY",International Journal of Artificial Intelligence & Applications (IJAIA), Vol.3, No.2, March 2012.


Paper Type : Research Paper
Title : Identification of Malicious Node in Top-K Query Processing In Manet
Country : India
Authors : Nayana Santhosh || Arun R || Ancy A

Abstract: It is effective to retrieve only the most important data from the large amount of information available in the MANET. Top-K query processing can be used to retrieve the most important data, in which the data items are assigned with a particular score based on their attribute values and up on issuing a query the data items with highest scores are retrieved. If malicious nodes are present, it may replace the high score data with lower ones which affect the accuracy of the query result. So, in this paper it is discussing a method to identify the malicious nodes that perform data replacement and identity replacement attacks. The query result is send through multiple routes along with the path information.

[1] W.-T. Balke, W. Nejdl, W. Siberski, and U. Thaden. "Progressive Distributed Top-k Retrieval in Peer-to-Peer Networks," Proc. Int'l Conf. on Data Engineering, pp.174–185, 2005.
[2] P. Kalnis, W.S. Ng, B.C. Ooi, and K.-L. Tan, "Answering Similarity Queries in Peer-to-Peer Networks," Information Systems, vol.31, no.1, pp.57–72, 2006.
[3] Qunhua Pan', Shuwang Li2 ,Minglu Li', Min-You Wu', "Energy-Efficient Top-k Query Processing in Dynamic Sensor Networks," Conf. on Information and Knowledge Management, pp.329-338, 2009.
[4] B. Malhotra, M.A. Nascimento, and I. Nikoladis, "Exact Top-k Queries in Wireless Sensor Networks," IEEE Trans. Knowledge and Data Engineering, vol.23, no.10, pp.1513–1525, 2011.
[5] M. Wu, J. Xu, X. Tang, and W.-C. Lee, "Top-k Monitoring in Wireless Sensor Networks," IEEE Trans. Knowledge and Data Engineering, vol.19, no.7, pp.962–976, 2007.




IOSR Journals are published both in online and print versions.