iosr-JCE   Volume-16 ~ Issue-2 ~ March-April 2014

Paper Type	:	Research Paper
Title	:	Optimal and Efficient Energy Utilization Using the Dual Mode Energy Driven Routing Protocol for Wireless Planetary Exploration
Country	:	India
Authors	:	S.Saravana Kumar, Neethu Prabhakaran.P
	:	10.9790/0661-16240110

Abstract: Wireless Sensor Network is the sensing network which is most useful for detecting the environmental conditions such as pressure, temperature, density. Different autonomous sensors are contained in the Wireless Sensor Network; each sensor node is sensing and detecting the environmental conditions. Planetary Exploration is the process of searching the information about the planets and its physical and chemical and biological characteristics of each and every part of the planetary system.

[1] Dargie,W(2011)," dynamic power management in wireless snesornetworks:state of the art " IEEE sensors Journal 12(5),1518-1528.
[2] Dubois,p..Botteron,c.,Mitev.,et al(2009) "Adhoc wireless sensor networks for exploration of solar system bodies" ,Acta Astronautica,64(5-6),626-643
[3] Durga Prasad, K., &Murty, S. V. S. (2011)."Wireless sensor networks a potential tool to probe for water on Moon. Advances in Space Research", 48(3), 601–612
[4] Marina, M. K., & Das, S. R. (2006). "Ad hoc on-demand multipath distance vector routing. Wireless Communications and Mobile Computing", 6, 969–988.
[5] Zarifzadeh, S., Nayyeri, A., Yazdani, N., et al. (2009). "Joint range assignment and routing to conserveenergy in wireless ad hoc networks".Computer Networks, 53(11), 1812–1829.
[6] Vidhyapriya, R., &Vanathi, P. T. (2007)."Energy aware routing for wireless sensor networks".InProceedings of international conference on signal processing, communications and networking (pp. 545–550).

Paper Type	:	Research Paper
Title	:	Securing Multi-Path Routing Using Trust Management in Heterogeneous Wsn
Country	:	India
Authors	:	B. Sathiyaprasad , C.L.Stefi Sterlin
	:	10.9790/0661-16241118

Abstract: In this paper we propose a hierarchical dynamic trust management protocol for cluster-based wireless sensor networks. A highly scalable Cluster based trust Management Protocol is implemented to avoid malicious users in sensor nodes. This can be achieved by using Data Aggregation Protocol. The proposed protocol relies on a novel trust development algorithm (SELDA) is used by data aggregators and sensor nodes to select secure and reliable paths. The key concept of this paper is to maximize the system lifetime. Furthermore, a voting-based IDS algorithm is applied to detect malicious nodes in a heterogeneous wireless sensor network to analyze redundancy level in term of both source and path redundancy.

Index Terms: Heterogeneous WSN, multipath routing, intrusion detection, reliability, security.

[1] O.Younisand S.Fahmy, "HEED:a hybrid, energy-efficient, distributed clustering approach for adhoc sensor networks," IEEE Trans .Mobile Comput.,vol.3,no.4,pp.366–379,2004.
[2] E.Felemban, L.Chang-Gun,and E.Ekici, "MMSPEED: multipath multi SPEED protocol for QoS guarantee of reliability and timeliness in wireless sensor networks," IEEETrans.MobileComput.,vol.5,no.6,pp.738–754,2006.
[3] I.R.Chen, A.P.Speer, and M.Eltoweissy, "Adaptive fault-tolerant QoS control algorithms for maximizing system life time of query-based wireless sensor networks," IEEE Trans. Dependable Secure Computing,vol.8,no.2,pp.161–176,2011.
[4] M.Yarvis,N.Kushalnagar,H.Singh,A.Rangarajan,Y.Liu,andS.Singh,"Exploiting heterogeneity in sensor networks," in Proc.2005 IEEE Conf. Computer Commun.,vol.2,pp.878–890.

Paper Type	:	Research Paper
Title	:	Dynamic memory Allocation using ballooning and virtualization in cloud computing
Country	:	India
Authors	:	V Holy Angel Jenitha, R.Veeramani
	:	10.9790/0661-16241923

Abstract: Cloud computing has changed the way in which computer resources are used and shared. Once we register with cloud service provider we can access the software or hardware resources without the need to purchase our own product. Virtualization plays a vital role to maximize resource usage. In this paper, we define a system that dynamically release the unused memory pages and thereby can improve the performance of the overall system. We can maximize the memory usage when ballooning is used effectively with gray box analysis data. We can predict the memory needs by applying mathematical formula on working set samples. Once prediction is done, balloon list can be created to release the unused memory. Skewness algorithm is used to efficiently distribute load among the virtual machines.

Keywords: Ballooning, Cloud computing, Skewness, Usher, Virtualization

[1] M. Armbrust et al., "Above the Clouds: A Berkeley View of Cloud Computing," technical report, Univ. of California, Berkeley, Feb.2009.
[2] P. Barham, B. Dragovic, K. Fraser, S. Hand, T. Harris, A. Ho, R.Neugebauer, I. Pratt, and A. Warfield, "Xen and the Art of Virtualization," Proc. ACM Symp. Operating Systems Principles(SOSP '03), Oct. 2003.
[3] M. McNett, D. Gupta, A. Vahdat, and G.M. Voelker, "Usher: AnExtensible Framework for Managing Clusters of Virtual Machines," Proc. Large Installation System Administration Conf.(LISA '07), Nov. 2007.
[4] T. Wood, P. Shenoy, A. Venkataramani, and M. Yousif, "Black-Box and Gray-Box Strategies for Virtual Machine Migration," Proc. Symp. Networked Systems Design and Implementation (NSDI '07), Apr. 2007.
[5] C.A. Waldspurger, "Memory Resource Management in VMware ESX Server," Proc. Symp. Operating Systems Design and Implementation (OSDI '02), Aug. 2002.
[6] Dan Magenheimer , Oracle Corp. "Memory Overcommit… without the commitment "Extended Abstract for Xen Summit, June 2008

Paper Type	:	Research Paper
Title	:	Improvement of Arabic Spam Web pages Detection Using New Robust Features
Country	:	Egypt
Authors	:	Mohammed A. Saleh, Hesham N. El mahdy,Talal Saleh
	:	10.9790/0661-16242435

Abstract: In this paper we proposed new set of features to improve the detection ofthe Arabic spam web pages. These Features include: Global Popular Keywords (GPK) features, Character N-Gram Graph (CNGG)features and Sentence Level Frequent Words (SLFW) features. We denoted the new proposed set of features as features B in contrast to the state-of-art featured which denoted by features A. We combined our features (B) with the state-of-art features (A) to get features( AB) and then fed the resulting features AB into different classification algorithms include Ensemble Decision Tree with Bagging and Boosting ensemble methods, Decision Tree J48 , and Random Forest classifiers to achieve our results. In our results we achieved an F-measure of about 99.54% with the Random Forest classifier. We applied our new features on a dataset of about 15962 Arabic web pages which include spam and non-spam pages. We also compared our results with results of a previous study in the field of Arabic spam web pages and we found that, our results (F-measure of 99.64%) have outperformed their results (98%) with the same dataset they used in their study (Dataset 2010).

Keywords: Apriori Algorithme ,Arabic web spam,Detecting Arabic Spam, Machine learning algorithms, N-Gram graph, Popular keywords.

[1] C. Silverstein, H. Marais, M. Henzinger, and M. Moricz, "Analysis of a very large web search engine query log," in ACM SIGIR Forum, vol. 33, no. 1. ACM, 1999, pp. 6–12.
[2] T. Joachims, L. Granka, B. Pan, H. Hembrooke, and G. Gay, "Accurately interpreting clickthroughdata as implicit feedback," in Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval. ACM, 2005, pp. 154–161.
[3] Z. Gyongi and H. Garcia-Molina, "Spam: It's not just for inboxes anymore," Computer, vol. 38, no. 10, pp. 28–34, 2005.
[4] R. Jaramh, T. Saleh, S. Khattab, and I. Farag, "Detecting arabic spam web pages using content analysis," International Journal of Reviews in Computing, vol. 6, pp. 1–8, 2011.
[5] Y.-M.Wang, M. Ma, Y. Niu, and H. Chen, "Spam double-funnel: Connecting web spammers with advertisers," in Proceedings of the 16th international conference on World Wide Web. ACM, 2007, pp. 291–300.
[6] A. Bifet, C. Castillo, P.-A.Chirita, and I. Weber, "An analysis of factors used in search engine ranking," 2005.

Paper Type	:	Research Paper
Title	:	GPS Location Alert System
Country	:	India
Authors	:	Saravana Kumar J, Veeramani .R
	:	10.9790/0661-16243642

Abstract: Traditionally alerts are based on time. But there are many situations the alerts are based on your current location and not based on time. It is difficult to find the persons in a particular location where some disaster is going to happen. In this situation fixing the search area and accurate location is difficult. In this modern era we have mobile devices capable of finding the user's current location using the Global Positioning Systems (GPS). In this paper we use our own algorithm "Extended Polygon Match Algorithm using Quadtree" to find whether a mobile is within a defined polygon shaped area using their GPS coordinates. This algorithm determines the spatial indices of the polygon region and mobile user's Current location.

[1] R. K. Harle, Spatial Indexing for Location-Aware Systems, in Fourth Annual International Conference on Mobile and Ubiquitous
Systems: Networking Services (MobiQuitous), pp. 1 –8, 2007.
[2] Gang Fu, Hongrui Zhao, Cong Li and Limei Shi, Segmentation for High-Resolution Optical Remote Sensing Imagery Using
Improved Quadtree and Region Adjacency Graph Technique, MDPI International Journal, Remote Sens. 2013, 5, 3259-3279;
doi:10.3390/rs5073259
[3] Hanan Samet, University Of Maryland And Robert E. Webber, Rutgers University, Storing A Collection Of Polygons Using
Quadtrees, ACM Transactions On Graphics, Vol. 4, No. 3, July 1985, Pages 182-222.
[4] Abdullah Çavuşoğlu1, Baha Şen1,*, Caner Özcan2 and Salih Görgünoğlu, Cropped quad-tree based solid object colouring with
cuda, Mathematical and Computational Applications, Vol. 18, No. 3, pp. 301-312, 2013
[5] Jean-Marc Laferté, Patrick Pérez, and Fabrice Heitz, Discrete Markov Image Modeling and Inference on the Quadtree, IEEE
Transactions on Image Processing, VOL. 9, NO. 3, MARCH 2000

Paper Type	:	Research Paper
Title	:	Secured Lossless Medical Image Compression Based On Adaptive Binary Optimization
Country	:	India
Authors	:	Dr. A.R. Mohamed Shanavas, M.Shameera
	:	10.9790/0661-16244347

Abstract: Image and data compression is of vital importance and has great significance in many practical applications. Large amount of medical image sequences are available in various hospitals and medical organizations, which occupies considerable storage space. Hence to reduce the storage space there is a need for compressing medical images. In this paper we made an analysis of compressing a medical image using a simple but effective technique called adaptive binary optimization (ABO) based on Repetition and correlation coding and proposed an enhanced security technique on compressed data to attain a high security.

[1] N. Memon and K. Sayood., Lossless image compression: A comparative study. Proc. SPIE Still-Image Compression, 2(18), March 1995, 8–20.
[2] C.K. Li and H.Yuen, "A High Performance Image Compression Technique for Multimedia Applications," IEEE Transactions on Consumer Electronics, 42( 2), May 1996, 239-243.
[3] Ricardo L. de Queiroz "Processing JPEG-Compressed Images and Documents", IEEE Transactions On Image Processing 7(12), december 1998, 1661-1667.
[4] N. Memon and K..Sayood, Lossless compression of rgb color images. Optical Engineering, 34(6), June 1995, 1711–1717.
[5] Arvind Thigarajan, Repetition coded compression for highly correlated image data, US patent application.No200060153461, 2004
[6] Ismail Avcibas, Nasir Memon, Bulent Sankur, Khalid Sayood, " A Progressive Lossless / Near Lossless Image Compression Algorithm, "IEEE Signal Processing Letters,9( 10) ,October 2002, 312-314.

Paper Type	:	Research Paper
Title	:	Study on Energy Model Prototyping in Various Simulators of WSN
Country	:	India
Authors	:	M. Thangaraj, S.Anuradha
	:	10.9790/0661-16244857

Abstract: Simulators are used to abstract the real hardware behaviors and proceed the research more economically. Various simulators of Wireless Sensor Network (WSN) are used to access the performance and transmission processes involved in WSN. Each of the simulators has its own model to support the protocol stacks of physical layer and data layer, routing algorithms, topology control. This decade issue of Energy Engineering in WSN is getting the growing attention now days. This paper is to study and compare the various Energy Model support in the simulators of WSN with the following details of features, configuration setup, data structures, result traces, monitor outputs, debugging facilities, libraries and utilities and GUI support to explain the usage. Wide range of simulators is considered for the study; the classification of simulators with the key features is briefed with their model architectures. This paper will be the unique guide for any researcher who works on the energy relevant studies in WSN field to choose the proper tool and learn its usage and architecture with minimal learning curve.

Keywords: Wireless Sensor Networks, Energy Model, Power Spectrum, Simulator, Test bed, Emulator

[1] P. S. Rakesh Sharma, S.Kaushik, V. A. Athavale, "simulators for wireless sensor networks: Are view", International Journal of Computer Applications 75(6) (Aug 2013)1– 30.doi:0975 8887.
[2] R. Huber, P.Sommer, R. Wattenhofer, "demo abstract: Debugging wireless sensor network simulations with yeti and cooja", ISPN- ACM doi:978-1-4503-0512-9.
[3] H.Sundani, H.Li, V. Devabhaktuni, M.Alam, P.Bhattacharya, Wireless sensor network simulators a survey and comparisons, International Journal of Computer Networks 2(5) (2010)249–265. doi:10.1021/ic9907718.
[4] B. Musznicki, P. Zwierzykowski, Survey of simulators for wireless sensor networks, International Journal of Grid and Distributed Computing 5(3) (September, 2012) 23–50. doi:10.1021/ja0276321.
[5] C. Ptolemaeus, Simulation Design and Modeling, 1stEdition, Creative Commons, 444 Castro Street, Suite 900, Mountain View, California,94041,USA,2014.
[6] Dianemu a java based generic simulation environment for distributed protocols1, Tech.rep., D-76128Karlsruhe, Germany (July, 2003).

Paper Type	:	Research Paper
Title	:	Enhanced Data Sharing over Mobile Ad Hoc Network Based on non-Selfish Exposure
Country	:	India
Authors	:	Amrutha b k , Mr.I.Edwin Albert
	:	10.9790/0661-16245865

Abstract: A Mobile ad hoc network is a peer-to-peer multihop wireless network. MANETs are key to nomadic computing. Mobile units can set up spontaneous local networks and can remove the need for fixed network infrastructure, either as wireless access points or wired LAN. Each node in a MANET communicates with each other. Some nodes does not cooperate with each other nodes and termed as Selfish nodes. Selfish nodes are handled on the basis of replica allocation. Partial nodes are also handled.

[1]. P. Padmanabhan, L. Gruenwald, A. Vallur, and M.Atiquzzaman, "A Survey of Data Replication Techniques for Mobile Ad Hoc Network Databases," The Int‟l J. Very Large Data Bases, vol. 17, no. 5, pp. 1143-1164, 2008.
[2]. C.E. Perkins and P. Bhagwat,(1994) "Highly Dynamic Destination- Sequenced Distance-Vector Routing (DSDV) for Mobile Computers‟ Proc. ACM SIGCOMM ‟94, pp. 234-244.
[3]. Hyun injin kim, jon M.peha, Carnegie mellon university(2008),‟Detecting selfish behavior in a cooperative commons‟,research show,IEEE span.
[4]. Jae-Ho Choi, Kyu-Sun Shim, SangKeun Lee, and Kun-Lung Wu. (2012)"Handling Selfishness in Replica Allocation over a Mobile Ad Hoc Network in IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 11, NO. 2
[5]. B.-G. Chun, K. Chaudhuri, H. Wee, M. Barreno, C.H. Papadimitriou, and J. Kubiatowicz, "Selfish Caching in Distributed Systems: A Game-Theoretic Analysis," Proc. ACM Symp. Principles of Distributed Computing, pp. 21-30, 2004.