IOSR Journal of Computer Engineering (IOSR-JCE)

Volume 9- Issue 4

Paper Type : Research Paper
Title : Bridging Socially Enhanced Virtual Communities
Country : India
Authors : Venugopal Rao, R.V.Krishnaiah
: 10.9790/0661-0940104      logo

Abstract: As technologies required for collaborative computing grow, there are business collaborations among companies carrying out related business. The communication and interactions across the companies has become a common phenomenon. In order to create and sustain this kind of business collaborations, specialized methods or techniques are required. In this paper we propose concept of bridging socially enhanced virtual communities. It is achieved by discovering present relevant businesses and prospective business alliances by developing a semi-automated approach. The architecture of the proposed system is compromising of human activities and also automated activities and it is essentially a service oriented system. For the purpose of bringing the previously separated groups and also finding new relevant groups we introduced broker discovery concept that makes use of techniques and metrics pertaining to interactive mining. The empirical results revealed that the proposed system is effective when tested with test bed which is based on distributed technology such as web services.

Index Terms: Social interactions, interaction mining, broker discovery, business collaborations

[1] L. M. Camarinha-Matos and H. Afsarmanesh.Collaborative networks. In PROLAMAT, pages 26–40,2006.

[2] J. Kleinberg. The convergence of social and technological networks. Commun. ACM, 51(11):66–72,2008.

[3] M. Ford et al. Web Services Human Task (WS-HumanTask), Version 1.0., 2007.

[4] D. Schall, H.-L. Truong, and S. Dustdar. Unifying human and software services in web-scale collaborations. Internet Comp., 12(3):62–68, 2008.

[5] R. S. Burt. Structural holes and good ideas. American Journal of Sociology, 110(2):349–399, Sept. 2004.

[6] W. Tsai. Social capital, strategic relatedness, and the formation of intra-organizational strategic linkages. Strategic Management Journal, (21):925–939, 2000.

[7] J. Kleinberg, S. Suri, E. Tardos, and T. Wexler. Strategic network formation with structural holes.ACM Conference on Electronic Commerce, 7(3):1–4, 2008.

[8] D. Brabham. Crowd sourcing as a model for problem solving: an introduction and cases. Convergence, 14(1):75, 2008.

[9] D. Artz and Y. Gil. A survey of trust in computer science and the semantic web. J. Web Sem., 5(2):58–71, 2007.

[10] L. Mui, M. Mohtashemi, and A. Halberstadt. A computational model of trust and reputation for e-businesses. In HICSS, page 188, 2002.


Paper Type : Research Paper
Title : Scrutinizing Unsolicited E-Mail And Revealing Zombies
Country : India
Authors : V.Annie, Mr. G. Sathishkumar. B.E, M.E, Ph.D.*
: 10.9790/0661-0940509      logo

Abstract: In this paper specialize in the detection of the compromised machines during a network that are concerned within the spamming activities. In this paper, considering the matter in unsought spam e-mail's wherever crucial information's are divided to assure data confidentiality and integrity. The replicas of divided shares are dynamically allotted to boost recital. Heuristic search minimizes the spam access in Zombies. During this paper, Network official examines unsought e-mail by mistreatment the heuristic search, and reportable to the tip user. Once checking the activities beside IP address, the unsought e-mail is blocked that are originated by Zombies. Index term-Zombies, spam, secure information, secret sharing, and heuristic.

[1] S. Areora, P. Raghavan, and S. Rao, "Approximation Schemes for Euclidean k-Medians and Related Problems," Proc. 30th ACM Symp. Theory of Computing (STOC), 1998.

[2] M. Baker, R. Buyya, and D. Laforenza, "Grids and Grid Technology for Wide-Area Distributed Computing," Software- Practice and Experience, 2002.

[3] A. Chervenak, E. Deelman, I. Foster, L. Guy, W. Hoschek, C. Kesselman, P. Kunszt, M. Ripeanu, B. Schwaretzkopf, H. Stockinger, and B. Tierney, "Giggle: A Framework for Constructing Scalable Replica Location.

[4] F. Li and M.-H. Hsieh. An Empirical Study of Clustering Behavior of Spammers and Group-based Anti-Spam Strategies. In Conference on Email and Anti-Spam, 2006.

[5] Daswani,N., Stoppelman, M., and the google click quality and security teams. The anatomy of clickbot.a. In HotBots'07.
[6] Postini Message Security and Management Update for October Reveals that Spam is Back with a Vengeance. http://postini.com/news events/pr/pr110606.php, 2006.

[7] A. Ramachandran, D. Dagon, and N. Feamster. Can DNSBased Blacklists Keep Up with Bots? In Conference on Email and Anti-Spam, 2006.

[8] A. Ramachandran and N. Feamster. Understanding the Network-Level Behavior of Spammers. In Proc. of Sigcomm, 2006.

[9] A. Ramachandran, N. Feamster, and D. Dagon. Revealing Botnet Membership Using DNSBL Counter-Intelligence. In 2nd Steps to Reducing Unwanted Traffic on the Internet Workshop (SRUTI), 2006.

[10] Route Views Project. http://www.routeviews.org.


Paper Type : Research Paper
Title : A Comprehensive Parametric Analysis of Vertical Handoff in Next Generation Wireless Networks
Country : India
Authors : Mrs.Jayasheela C S, Dr. Gowrishankar
: 10.9790/0661-0941017      logo

Abstract: The science and technology is developing day by day leading to expand and forcing to reshape our living standards. The main aspects leading to deployment of a wide array of wireless and mobile networks are advances in miniaturization, low power circuit design and development in radio access technologies and increase in user demand for high speed internet access. The varying wireless technologies are driving today's wireless networks to become heterogeneous, ie., the network comprised of two or more different access network technologies. Heterogeneous networks have created many challenges such as mobility management, handoff, resource management, location management, providing QoS, security and pricing. Switching between heterogeneous networks requires seamless vertical handoff. The selection of parameters plays an important role in the decision of vertical handoff. The parameters like bandwidth, signal strength, velocity, power consumption, throughput, cost, user preferences and network load are considered during vertical handoff. In this paper, the vertical handoff parameters of the existing work are critically ascertained and presented in a tabular format for identifying the important parameters. A dynamic, adaptive and efficient approach is required to implement the vertical handoff mechanism in next generation heterogeneous wireless networks to produce an effective service for the user by considering dynamic and non dynamic parameters.

Keywords: Heterogeneous networks, parameters, handoff

[1] E. Arun & R.S Moni, (June 2010) "A Novel Decision Scheme for Vertical Handoff in 4G Wireless Networks", GJCST Computing Classification, Page 28 Vol.10 Issue 5 Ver.1.0

[2] Ahmed H. Zahran and Ben Liang, (Feb 2010) "Performance Evaluation Framework for Vertical Handoff Algorithms in Heterogeneous Networks".

[3] Sung H. Kim and Yeong M. Jang, "Soft Qos-Based Vertical Handover Scheme for WLAN and WCDMA Networks using Dynamic Programming Approach".

[4] Dong Ma & Maode Ma,(April 2012) "A QoS Oriented Vertical Handoff Scheme for WiMAX/WLAN Overlay Networks", IEEE Transactions on Parallel and Distributed Systems, Vol 23, No 4.

[5] K. Radhika et al,( Oct 2011),"AHP and Group Decision Making for Access Network Selection in Multi-Homed Mobile Terminals", IJCSE , Vol. 3 No. 10.

[6] Manoj Sharma & Dr. R.K.Khola, "An Intelligent Approach for Handover Decision in Heterogeneous Wireless Environment", International Journal of Engineering (IJE), Volume (4): Issue (5).

[7] Mithun B Patil,( Oct 2011) "Vertical Handoff in Future Heterogenous 4G Network", IJCSNS International Journal of Computer Science and Network Security, VOL.11 No.10.

[8] Mohammad Rafiq, Seema Kumar, Nagaraj Kammar, Guru Prasad,Gopi Krishna S Garge, Anand SVR, Malati Hegde, "A Vertical Handoff Decision Scheme for End-to-End QoS in Heterogeneous Networks: An Implementation on a Mobile IP Testbed".

[9] Presila Israt, Namvi Chakma, and M. M. A. Hashem, (Dec 2009)" A Fuzzy Logic-Based Adaptive Handoff Management Protocol for Next-Generation Wireless Systems", Journal of Networks, Vol.4, No.10.

[10] Pramod Goyal, and S. K. Saxena, "A Dynamic Decision Model for Vertical Handoffs across Heterogeneous Wireless Networks". World Academy of Science, Engineering and Technology 41 2008.


Paper Type : Research Paper
Title : Video Watermarking Scheme Based on DWT and PCA for Copyright Protection
Country : India
Authors : Phadtare Saurabh, Dhebe Pooja, Bobade Sharayu, Jawalkar Nishigandha
: 10.9790/0661-0941824      logo

Abstract: The distribution of digital products like audio and video are increasing rapidly over the networks, so the owners of such digital data are worried about their ownership protection. It may be possible that the third- party may claim the digital products as their own and misuse it in future. In order to overcome this problem, 'Video Watermarking Scheme Based on Principal Component Analysis and Wavelet Transform for Copyright Protection', is introduced for preventing illegal copying of their digital products. In this system, a Binary logo watermark is embedded in video frames for copyright protection. Principal Component Analysis (PCA) is applied to each block of the two bands (LL – HH) which results from Discrete Wavelet transform of the video frame. The watermark is embedded into the principal components of the LL blocks and HH blocks at different levels. Combining the DWT and PCA transform improves the performance of the watermark algorithm. This watermarking scheme shows no visible difference between the watermarked frames and the original frames i.e. imperceptible to the Human Visual System (HVS). It depicts the robustness against a wide range of attacks such as geometric transformation, histogram equalization, and gamma correction.

Keywords -Advanced Encryption Standard (AES), Discrete wavelet transforms (DWT), Fixed-length codeword (FLC), Principle Component Analysis (PCA), Video Watermarking.

[1] Salwa A.K Mostafa, A. S. Tolba ,F.M. Abdelkader, Hisham M. Elhindy, Video Watermarking Scheme Based on Principal Component Analysis and Wavelet Transform ,IJCSNS International Journal of Computer Science and Network Security, VOL.9 No.8, August 2009.

[2] R. Reyes, C. Cruz, M. Nakano-Miyatake, Member IEEE and H. Perez-Meana, Senior Member IEEE, Digital Video Watermarking in DWT Domain Using Chaotic Mixtures, IEEE Latin America Transactions, VOL. 8, NO. 3, June 2010.

[3] Xiaoli Li, Student Member, IEEE, Sridhar (Sri) Krishnan, Senior Member, IEEE, and Ngok-Wah Ma, Senior Member, IEEE, A Wavelet-PCA-Based Fingerprinting Scheme for Peer-to-Peer Video File Sharing ,IEEE Transactions on Information Forensics and Security, VOL. 5, NO. 3, September 2010.

[4] Xiangui Kang, Jiwu Huang, Senior Member, IEEE, Yun Q. Shi, Senior Member, IEEE, and Yan Lin, A DWT-DFT Composite Watermarking Scheme Robust to Both Affine Transform and JPEG Compression, IEEE Transactions on Circuits and Systems for Video Technology, VOL. 13, NO. 8, August 2003.

[5] Sanjana Sinha, Prajnat Bardhan, Swarnali Pramanick, Ankul Jagatramka, Dipak K. Kole, Aruna Chakraborty,Department of Computer Science & Engineering, St Thomas' College of Engineering and Technology, Kolkata, India, Digital Video Watermarking using Discrete Wavelet Transform and Principal Component Analysis, International Journal of Wisdom Based Computing, Vol. 1 (2), August 2011.

[6] Nisreen I. Yassin1, Nancy M. Salem2, and Mohamed I. El Adawy National Research Centre, Cairo, Egypt, Block Based Video Watermarking Scheme Using Wavelet Transform and Principle Component Analysis , IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 1, No 3, January 2012.

[7] S.K. Amirgholipour, A. R. Naghsh-Nilchi: Robust Digital Image Watermarking Based on Joint DWT-DCT, International Journal of Digital Content Technology and its Applications Volume 3, Number 2, pp. 42-54, June 2009.

[8] Martin Zlomek, Charles University in Prague, Faculty of Mathematics and Physics, Department of Software and Computer Science Education, Video Watermarking.

[9] M. Chandra, S. Pandey: A DWT Domain Visible Watermarking Techniques for Digital Images, International Conference on Electronics and Information Engineering, pp. V2-421 - V2-427, 2010.

[10] C.V. Serdean, M.A. Ambroze, M. Tomlinson and J.G. Wade, DWT Based Video Watermarking for Copyright Protection, Invariant to Geometrical Attacks, Proceedings of the 3rd International Symposium on Communication Systems Networks and Digital Signal Processing – CSNDSP'02, Stafford, UK, 15-17, July 2002


Paper Type : Research Paper
Title : An Efficient and Active Data Delivery for Highly Dynamic Mobile Ad Hoc Networks
Country :  
Authors : G. Vivek Ananth, S. Mohana Rangan, Dr.D.Sivakumar
: 10.9790/0661-0942531      logo

Abstract: In highly dynamic mobile ad hoc networks occurred transmission problems like delivering data packets, packet delay, time delay and so on. Most of the existing ad hoc routing protocols are affected by node mobility, especially for large-scale networks [1]. Large-scale networks mean that wireless network at the dynamic time. Propel by this issue, position-based opportunistic routing(POR) protocol is efficient to introducing further advantage of the stateless property of Geo graphing routing and the broadcast environment of wireless medium. This POR having the right qualities in delivering the data to destination in highly energetic or forceful MANET. But it is susceptible by the over heading problem and also no data confidentiality. When a data packet is sent out, the neighbor nodes that have overhead the transmission, then serve as forwarding candidates. The specific best forwarder take turn the packets if it is not relayed by best forwarding candidates wit in a certain period of time, so the duplicate relaying caused by packet reroute. Many routing protocols are recommend by mobile-ad-hoc networks. In which the proactive Fish Eye State Routing(FSR) protocol is proposed for provides excellent solution to delivering data to highly dynamic MANETs, by updating and communicating nodes and nodes position and delivering data without over heading. The proposed scheme works well in large network of high mobility nodes. But still we susceptibleness to security threaten. Our security scheme is proposed to minimize the number of black holes or malicious nodes or selfish nodes in the path to destination, thus the number of data packet dropping may be minimized, we secured the FSR protocol with security. In the case of communication break, a Virtual Destination-based Void Handling (VDVH)[9] scheme is further proposed to work together with FSR.

Keywords: Ad-hoc Network, FSR, GR, MANET, POR, VDVH

[1] Neelesh Gupta, A.P., EC Dept. TIEIT (TRUBA), Bhopal, (M.P.)-India International Journal of Computer Applications (0975 – 8887) Volume 17–No.5, March 2011.
[2] J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, and J. Jetcheva, "A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols," Proc. ACM MobiCom, pp. 85-97, 1998.

[3] D. Son, A. Helmy, and B. Krishnamachari, "The Effect of Mobility Induced Location Errors on Geographic Routing in Mobile Ad Hoc Sensor Networks: Analysis and Improvement Using Mobility Prediction," IEEE Trans. Mobile Computing, vol. 3, no. 3, pp. 233- 245, July/Aug.2004.

[4] D. Chen and P. Varshney, "A Survey of Void Handling Techniques for Geographic Routing in Wireless Networks," IEEE Comm. Surveys and Tutorials, vol. 9, no. 1, pp. 50-67, Jan.-Mar. 2007.

[5] S. Biswas and R. Morris, "EXOR: Opportunistic Multi-Hop Routing for Wireless Networks," Proc. ACM SIGCOMM, pp. 133-144, 2005.

[6] S. Chachulski, M. Jennings, S. Katti, and D. Katabi, "Trading Structure for Randomness in Wireless Opportunistic Routing," Proc. ACM SIGCOMM, pp. 169-180, 2007.

[7] Alvin C. Valera, Student Member, IEEE, WinstonK.G. Seah, Senior Member, IEEE, and S.V. Rao, Senior Member,IEEEVOL.4,NO.5, September 2005

[8] Thrasyvoulos Spyropoulos, Konstantinos Psounis, and Cauligi S. Raghavendra, "Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case," IEEE/ACM transactions on networking, vol. 16, Feb. 2008.

[9] Shengbo Yang, Chai Kiat Yeo, and Bu Sung Lee http://www.ietf.org/ rfc/rfc4726.txt VOL. 11, NO. 1, JANUARY 2012.

[10] B. Deb, S. Bhatnagar, and B. Nath, "ReInForM: Reliable Information Forwarding Using Multiple Paths in Sensor Networks," Proc. Ann. IEEE Int'l Conf. Local Computer Networks (LCN '03), pp. 406- 415, 2003.


Paper Type : Research Paper
Title : ANTNET:ACO based routing algorithm
Country : India
Authors : Madhu Bhanote, Dr Vineet Sharma
: 10.9790/0661-0943236      logo

Abstract: AntNet is an ACO based routing algorithm for distributed and traffic adaptive multipath routing in wired best-effort IP networks. Forward ants in AntNet collect traffic behavior and backward ants are used to update probabilistic routing tables based on the collected information.

Keywords—connectionless-network, mobile ants, traffic adaptive, multipath, network performance

[1] S. Appleby and S. Steward, "Mobile software agents for control intelecommunication networks," BT echnol. vol. 12, no. 2, 1994.

[2] R. Schoonderwoerd, O. Holland, J. Bruten, and L.Rothkrantz,"Ants for Load Balancing in Telecommunication Networks," Hewlett Packard Lab., Bristol, U.K., Tech. Rep. HPL-96-35, 1996.

[3] D.Subbramanian, P.Druschel,and J.Chen,'Ants and reinforcement learning: A case study in routing in dynamic networks",Proce of IJCAI-97,Palo Alto,Morgan Kauffman,1997,pp 832-838

[4] E. Bonabeau,D.Suyers,"Routing in telecommunication networks with smart like agents ",Proceedings of LATA,1998

[5] M. Dorigo and G.D.Caro,"Antnet: A mobile agents approach to adaptive routing ",Tech Report, University Libre de Bruxelles,IRIDIA,1997.

[6] G. D. Caro and M. Dorigo, "AntNet: Distributed stigmergetic control for communications networks," Journal of Artificial Intelligence Research, 9,1998 vol. 9, pp. 317–365,1998.

[7] G. D. Caro and M. Dorigo, "Ant colonies for adaptive routing in packets witched communications networks," in Proc. 5th Int. Conf. Parallel Problem Solving from Nature, Amsterdam, The Netherlands, Sept. 27–30, 1998.

[8] G. D. Caro and M. Dorigo, "Two ant colony algorithms for best-effort routing in datagram networks," in Proc. 10th IASTED Int. Conf. Parallel Distributed Computing Systems, 1998, pp. 541–546.

[9] Kwang Mong Sim and Weng Hong Sun, "Ant Colony Optimization for Routing and Load-Balancing: Survey and New Directions ",IEEE transactions on systems and humans,Vol.33,No.5 Sept 2003.

[10] Marco Dorigo and Krzysztof Socha," An Introduction to Ant Colony Optimization "IRIDIA- Technical Report Series Technical Report No.TR/IRIDIA/2006-010 April 2006, Last revision: April 2007.


Paper Type : Research Paper
Title : Performance Comparison on Trust Based Power Aware Reliable On Demand Routing Protocol in Mobile Ad Hoc Networks
Country : India
Authors : Mukesh Kumar Garg, Dharam Vir, Dr. S.K. Agarwal
: 10.9790/0661-0943745      logo

Abstract: A mobile ad hoc network (MANET) is a collection of mobile wireless nodes, which communicate to each other without any centralized administration. Trust and Power consumption is the most challenging task in routing protocol design for Mobile ad hoc networks (MANETs), since the highly dynamic nature of MANET coupled with limited bandwidth and battery power imposes severe restrictions on routing protocols especially on achieving the routing. Furthermore replacing and recharging batteries and making nodes co-operative are often impossible in significant environments. In this paper, we effort to study the performance of three ondemand routing protocols (AODV, DSR, DYMO) in terms of number of hop counts, number of routes selected, number of RREQ packets, number of RREP packets and power consumption in transmit, received and ideal modes. During route discovery, nodes are more trust to find reliable route for communication and utilizing maximum energy capacity for selection of route. Route based selection of nodes called 'Reliability'. Route request from the source is accepted by a node only if its reliability is high. Otherwise, the route request is discarded. This approach forms a reliable route from source to destination thus increasing network life time, improving power utilization and decreasing number of packet loss during transmission. To solve the above problem here we describe the three on demand routing and it is simulated using QualNet 5.0 simulator.

Keywords: AODV, DSR, DYMO, Mobile Ad Hoc Networks, Power, Reliability, Trust

[1] LIU Jian and LI Fang-min, "An Improvement of AODV Protocol Based on Reliable Delivery in Mobile Ad hoc Networks", Fifth International Conference on Information Assurance and Security, 2009.
[2] Rekha Patil , A.Damodaram, "Cost Based Power Aware Cross Layer Routing Protocol For Manet", IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.12, December2008.
[3] M.Tamilarasi, T.G Palani Velu, "Integrated Energy-Aware Mechanism for MANETs using On-demand Routing", International Journal of Computer, Information, and Systems Science, and Engineering 2; www.waset.org Summer 2008.
[4] M.Pushpalatha, Revathi Venkatraman, "Security in Ad Hoc Networks: An extension of Dynamic Source Routing", 10th IEEE Singapore International conference on Communication Systems Oct 2006,ISBN No:1-4244-0411-8,Pg1-5.
[5] V. Rishiwal, M. Yadav and S. Verma, "Power Aware Routing to support Real Time Traffic in Mobile Ad-hoc Networks", International Conference on Emerging Trends in Engg & Tech., IEEE, pp. 223-227, 2008
[6] Huafeng Wu1, Chaojian Shi1," A Trust Management Model for P2P File Sharing System", International Conference on Multimedia and Ubiquitous Engineering, IEEE Explore 978-0-7695-3134-2/08, 2008.
[7] LIXin MIAO Jian song," A new traffic allocation algorithm in AD hoc networks, "The Journal of China University of Post and Telecommunication", Volume 13. Issue 3. September 2006.
[8] P. Sinha, R. Sivakumar, and V. Bharghavan(1999), CEDAR: A Core Extraction Distributed Ad-hoc Routing Algorithm. IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, pp. 1454-1466.
[9] Smt Rajashree.V. Biradar & Prof V. C.Patil : "Classification and Comparison of routing Techniques in Wireless Ad-hoc Networks", in the proceedings of international Symposium on Adhoc Ubiquitous Computing (ISHUC'06), pp. 7-11 (2006).
[10] Robert Castaneda and Samir R. Das(1999): "Query Localization Techniques for On-demand Routing Protocols in Ad-hoc Networks",. In Proceedings of the Fifth International Conference on Mobile Computing and Networking (MobiCom'99). ACM.


Paper Type : Research Paper
Title : Generating random regions in Spatial cloaking algorithm for location privacy preservation
Country : India
Authors : Mrs. Suchita R. Shastry, Prof Dr.P.K.Deshmukh, Prof.Dr.A.B.Bagwan,
: 10.9790/0661-0944649      logo

Abstract: Location based Servers (LBS) include services to identify a location. Network users expect to access services relevant to their locations, and preserve their privacy without disclosing their exact location. The spatial cloaking method provides the solution where exact location of user gets hazy. In peer to peer network (P2P), communication between the peers becomes time consuming and communication overhead. In this paper we have proposed the method where instead of communicating with peers, user directly communicates with LBS. we have presented two algorithms where first algorithm which where the LBS provide the direct list of in ascending order. The second algorithm for query processing generates the region of different shapes which minimizes the chances of getting the user disclosed to adversary.

Index Terms—Location Based Service(LBS), Privacy Preserving, Spatial Cloaking, k- anonymity

[1] A Dual-active Spatial Cloaking Algorithm for Location Privacy Preserving in mobile Peer-to-Peer Networks ,Yanzhe Che, Qiang Yang, Xiaoyan Hong, 2012 IEEE Wireless Communications and Networking Conference: Mobile and Wireless Networks.

[2] B. Gedik and L. Liu. A Customizable k-Anonymity Model for Protecting Location Privacy. In ICDCS, 2005.

[3] M. Gruteser and D. Grunwald. Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking. In MobiSys, 2003.

[4] M. Mokbel, C. Chow, and W. Aref, "The new casper: query processing for location services without compromising privacy," in Proc. of Int. Conf. on Very large data bases, pp. 763–774, VLDB 2006.C.

[5] M. F. Mokbel, C.-Y. Chow, and W. G. Aref. The New Casper: Query Procesing for Location Services without Compromising Privacy. In VLDB, 2006.

[6] B. Gedik and L. Liu, "Location privacy in mobile systems: A personalized anonymization model," in Proc. of Int. Conf. on Distributed Computing Systems, pp. 620–629, IEEE, ICDCS 2005.

[7] G. Ghinita, P. Kalnis, and S. Skiadopoulos, "Prive: anonymous location based queries in distributed mobile systems," in Proc. of Int. conf. on World Wide Web, pp. 371–380, WWW 2007.

[8] A Spatial Cloaking Framework Based on Range Search for Nearest Neighbor Search, Hyoungshick Kim Computer Laboratory, University of Cambridge, UK hk331@cam.ac.uk


Paper Type : Research Paper
Title : Interactive Detection and Classification of DDoS Attacks Using ESVM
Country : India
Authors : S.Elanthiraiyan, Mr.P.Pandiaraja M.E
: 10.9790/0661-0945056      logo

Abstract: Distributed Denial of Service (DDoS) attack is a continuous critical threat to the internet. Application layer DDoS Attack is derived from the lower layers. Application layer based DDoS attacks use legitimate HTTP requests after establishment of TCP three way hand shaking and overwhelms the victim resources, such as sockets, CPU, memory, disk, database bandwidth. Network layer based DDoS attacks sends the SYN, UDP and ICMP requests to the server and exhausts the bandwidth. An anomaly detection mechanism is proposed in this paper to detect DDoS attacks using Enhanced Support Vector Machine (ESVM). The Application layer DDoS Attack such as HTTP Flooding, DNS Spoofing and Network layer DDoS Attack such as Port Scanning, TCP Flooding, UDP Flooding, ICMP Flooding, Land Flooding. Session Flooding are taken as test samples for ESVM. The Normal user access behavior attributes is taken as training samples for ESVM. The traffic from the testing samples and training samples are Cross Validated and the better classification accuracy is obtained. Application and Network layer DDoS attacks are classified with classification accuracy of 99 % with ESVM. Keywords— Anomaly detection, DDoS, Enhanced Support VectorMachine (ESVM), Intrusion detection, String kernels.

[1] ― Real Time Detection and Classification of DDoS Attacks using Enhanced SVM with String Kernels‖,
A.Ramamoorthi,Subbulakshmi Dr.S.Mercy Shalinie, Department of Computer Science and Engineering, Thiyagarajar College of
Engineering, Madurai, TamilNadu, India.
[2] Jie Yu and Zhoujun Li, "A Detection and Offense Mechanism to Defend Against Application Layer DDoS Attacks" IEEE Third
International Conference on Networking and Services, pp.54 – 54, 2007.
[3] Yi Xie and Shun-Zheng Yu, "A Novel Model for Detecting Application Layer DDoS Attacks", IEEE Proc. of the First International
Multi- Symposiums on Computer and Computational Science, pp.56-63, 2008.
[4] Yi Xie, and Shun-Zheng YU, "A Large-Scale Hidden Semi-Markov Model for Anomaly Detection on User Browsing Behaviors",
IEEE/ACM Trans.on networking, Vol. 17, No.1, pp. 54-65, 2009.
[5] Yi Xie, and Shun-Zheng, "Monitoring the Application layer DDoS Attacks for Popular Websites", IEEE/ACM Trans. on networking, Vol. 17, No. 1,pp. 15-25, 2009.
[6] Yoohwan Kim, Wing Cheong Lau, Mooi Choo Chuah and Jonatan Chao‖Packet Score: A Statistics-Based Packet Filtering Scheme
against Distributed Denial-of-Service Attacks‖, IEEE Trans.
[7] Amey Shevtekar and Nirwan Ansari,‖Is It Congestion or a DDoS Attack?‖ , transaction IEEE communications letters.
[8] Thing, V.L.L. Sloman, M. Dulay, N. ―Locating network domain entry and exit point/path for DDoS attack traffic‖ , IEEE Trans.
Network and Service Management, Vol. 6, No.3, pp. 163-170, 2009.
[9] Mirkovic, J. Reiher, P. ―D-WARD: a source-end defense againstflooding denial-of-service attacks‖, IEEE Trans. On Dependable and Secure Computing, Vol. 2, No. 3, pp. 216-225, 2005.
[10] Chonka, A.Singh, J.Wanlei Zhou, ― Chaos theory based detection against network mimicking DDoS attacks‖, IEEE Trans. On
Communications Letters, Vol. 13, No. 9, pp. 717-721, 2009.


Paper Type : Research Paper
Title : Survey on several improved Apriori algorithms
Country : India
Authors : Ms. Rina Raval, Prof. Indr Jeet Rajput , Prof. Vinitkumar Gupta
: 10.9790/0661-0945761      logo

Abstract: Apriori algorithm has been vital algorithm in association rule mining. Main idea of this algorithm is to find useful patterns between different set of data. It is a simple algorithm yet having many drawbacks. Many researches have been done for the improvement of this algorithm. This paper does a survey on few good improved approaches of Apriori algorithm. This will be really very helpful for the upcoming researchers to find some new ideas from these approaches.

Keywords - Apriori, Association, PW-factor, Q-factor, Record filter, Trade list

[1] Karl Aberer, (2007-2008),Data mining-A short introduction[Online],Available:http://lsirwww.epfl.ch/courses/dis/2003ws /lecturenotes/week13-Datamining print.pdf

[2] Agrawal, R. and Srikant, R. 1995." Mining sequential patterns", P. S. Yu and A. S. P. Chen, Eds.In:IEEE Computer Society Press, Taipei, Taiwan, 3{14}

[3] R.Divya , S.Vinod kumar ,"Survey on AIS,Apriori and FP-Tree algorithms",In: International Journal of Computer Science and Management Research Vol 1 Issue 2 September 2012, ISSN 2278-733X

[4] Goswami D.N., Chaturvedi Anshu.,Raghuvanshi C.S.," An Algorithm for Frequent Pattern Mining Based On Apriori", In: Goswami D.N. et. al. / (IJCSE) International Journal on Computer Science and Engineering ,,Vol. 02, No. 04, 2010, 942-947, ISSN : 0975-3397

[5] Sheila A. Abaya, "Association Rule Mining based on Apriori Algorithm in Minimizing Candidate Generation",In:International Journal of Scientific & Engineering Research Volume 3, Issue 7, July-2012

[6] Zhang Changsheng, Li Zhongyue, Zheng Dongsong," An Improved Algorithm for Apriori",In: IEEE,First International Workshop on Education Technology and Computer Science,2009

[7] Ms. Sanober Shaikh, Ms. Madhuri Rao,Dr. S. S. Mantha," A New Association Rule Mining Based On Frequent Item Set",In: CS & IT-CSCP 2011

[8] Mamta Dhanda," An Approach To Extract Efficient Frequent Patterns From Transactional Database",In: International Journal of Engineering Science and Technology (IJEST), Vol.3 No.7 July 2011, ISSN:0975-5462
[9] Andrew Kusiak, Association Rules-The Apriori algorithm[Online],Available: http://www.engineering. uiowa. edu/~comp /Public /Apriori.pdf

[10] Mamta Dhanda, Sonali Guglani , Gaurav Gupta, "Mining Efficient Association Rules Through Apriori Algorithm Using Attributes", In: International Journal of Computer Science and Technology Vol 2,Issue 3,September 2011,ISSN:0976-8491

 


Paper Type : Research Paper
Title : Evaluation of Content Management Systems Performance
Country : Nigeria
Authors : Maitanmi Olusola1 and Idowu Sunday
: 10.9790/0661-0946269      logo

Abstract: There are many web-authoring software like FrontPage and Dreamweaver, which are being used to develop and maintain websites. These web-authoring software are becoming inadequate because websites are becoming more dynamic with different contents types..

Keywords: Content Management System, Comparison of CMS, Open Source Software, Return on investment (ROI).

1] Gay, L. & Robinson, J.(2001).Content management: The Quest, Presentation at the CUMREC Annual Conference, http://www.educate.edu/ir/library/pdf/CMROI32.pdf retrieved on 20/10/ 2010
[2] Bachmann, D., John, E., & Gary, V. (1996). Tracking the Progress of E-Mail vs. Snail-Mail, Marketing Research: A Magazine of Management & Applications, 8(2), 30-35.
[3] Boiko, B. (2002). "Introducing the Major Parts of a CMS": A CM Domain White Paper.http://206.253.219.101/biblev1/Whitepapers/Boiko_Whitepaper_WPMISC1.pdf retrieved on 27/12/2010
[4] B. BoikoContent Management Bible, Second Edition, Wiley Publishing Incorporation Canada, 2005
[5] Byrne, T. (2005a). Oh What A Feature: Functional usability of web content management systems. EContent, 28(5).
[6] Business link, (2008). "Calculation of ROI‟http://www.elcnetwork.ca/ebusiness/pwt_return_on_investment.pdf retrieved on 12/10/2010
[7] Suchitra P. ( 2002). "Effective Web Content Management: Empowering the Business‟ User Workshop on Information Resource Management 13th-15th March 2002


Paper Type : Research Paper
Title : A Research Paper on Comparison between Energy Efficient Routing Protocol with Energy and Location in MANET
Country : India
Authors : Ruchi Gupta, Akhilesh A.Waoo, Sanjay Sharma and P. S Patheja
: 10.9790/0661-0947075      logo

Abstract: Energy is an important issue in MANET (Mobile Ad hoc Network). Nodes in network are working in presence of limited energy. So, energy efficient routing is needed for reducing energy consumption. Energy efficient routing schemes can greatly reduce energy consumption and extends the lifetime of the networks. Multipath routing protocol (AOMDV) having more than one path, if the first one is break then second provides the proper packet delivery, this causes reduced node energy consumption and the topology of MANETs always changes, due to the high mobility of nodes. This makes it more difficult to find the routes that message packets use when they are routed. The location based routing provides the location information of the destination to route a packet toward. This paper provides comparison and study on reduced energy consumption by using multipath protocol and performance which is evaluated by performance metrics in case of AOMDV and energy based AOMDV. Now here DREAM protocol is used with AOMDV to finding location of mobile nodes but not with energy but here measures their performance with both multipath protocols.

Keywords – AOMDV, Dream, Energy, MANET, Multipath

[1] Ruchi Gupta, Akhilesh A.Waoo and Dr. Sanjay Sharma, "A Survey of Energy Efficient Location Based Multipath Routing In MANET" in IJCA, Dec 2012.
[2] Jaya Jacob and V. Seethalakshmi, "EFFICIENCY ENHANCEMENT OF ROUTING PROTOCOL IN MANET" in IJAET, May 2012
[3] Stefano Basgani, Irnrich Chlamtac and Violet R. Syrotiuk, "A Distance Routing Effect Algorithm for Mobility (DREAM)".
[4] Pariza Kamboj, Ashok.K.Sharma, "Energy Efficient Multicast Routing Protocol for MANET with Minimum Control Overhead (EEMPMO)", in IJCT, Oct 2010.
[5] H.Vijayakumar , M.Ravichandran "Efficient Location Management of Mobile Node in Wireless Mobile Ad-hoc Network" in Proceedings of the National Conference on Innovations in Emerging Technology-2011.
[6] Azizol Abdullah, Norlida Ramly, Abdullah Muhammed, Mohd Noor Derahman, "Performance Comparison Study of Routing Protocols for Mobile Grid Environment", in IJCSNS, February 2008.
[7] Shwaita Kodesia and Asst. Prof. Prem Narayan Arya, "A REVIEW OF ENERGY EFFICIENT ROUTING PROTOCOLS FOR MOBILE AD-HOC NETWORK", in JGRCS, May 2012.
[8] Yun Ge, Guojun Wang, and Jie Wu, "Node-Disjoint Multipath Routing with Group Mobility in MANETs", IEEE 2010.
[9] Farukh Mahmudur Rahman, Mark A Gregory, "Quadrant Based Intelligent Energy Controlled Multicast Algorithm for Mobile Ad Hoc Networks", ICACT2011.
[10] Hua Chen, Hui Xu, Ting Zhang, Baolin Sun, "Performance of Network Coding in Ad Hoc Network Multipath Routing Protocol", IEEE 2012.


Paper Type : Research Paper
Title : A Survey on Data Preprocessing in Web Usage Mining
Country : India
Authors : Murti Punjani, Mr.Vinitkumar Gupta
: 10.9790/0661-0947679      logo

Abstract: With the abundant use of Internet and constant growth of users, the World Wide Web has a huge storage of data and these data serves as an important medium for the getting information of the users access to web sites which are data stored in Web server Logs. Today people are interested in analyzing logs file as they show actual usage of web site. But the data is not accurate so preprocessing of Web log files are essential then after that data are suitable for knowledge discovery or mining tasks. Web Usage Mining, a part of Web mining and application of data mining is used for automatic discovery of patterns in clickstreams and associated data collected or generated as a result of user interactions with one or more Web Sites. This survey paper gives the literature review and also overview of various steps needed for preprocessing phase.

Keywords – Data Fusion, Path Completion, Pre processing, Session Identification, Web usage, Web Server Log file.

1] O.Etzioni, The World Wide Web: Quagmire or gold mine.Communications of the ACM, 39(11):65–68, 1996.
[2] Vijayashri Losarwar, Dr. Madhuri Joshi,Data Preprocessing in Web Usage Mining, International Conference on Artificial Intelligence and Embedded Systems (ICAIES'2012) July 15-16, 2012 Singapore
[3] Li Chaofeng,Research and Development of Data Preprocessing in Web Usage Mining, School of Management, South-Central University for Nationalities, Wuhan 430074, P.R. China
[4] V.Chitraa, Dr. Antony Selvdoss Davamani, A Survey on Preprocessing Methods for Web Usage Data, (IJCSIS) International Journal of Computer Science and Information Security,Vol. 7, No. 3, 2010,p.78-83
[5] Demin Dong,Exploration on Web Usage Mining and its Application, IEEE, 2009.
[6] Raju G.T. and Sathyanarayana P. Knowledge discovery from Web Usage Data : Complete Preprocessing Methodology, ", IJCSNS 2008
[7] Priyanka Patil,Ujwala Patil, Preprocessing of web server log file for web mining ,World Journal of Science and Technology 2012, 2(3):14-18 ISSN: 2231 – 2587
[8] Marathe Dagadu Mitharam ,Preprocessing in Web Usage mining, International Journal of Scientific & Engineering Research, Volume 3, Issue 2, February -2012 1 ISSN 2229-5518
[9] C.P. Sumathi, R. Padmaja Valli , T. Santhanam, "An Overview of Preprocessing of Web Log Files for Web Usage Mining", Journal Of Theoretical And Applied Information Technology 31st December 2011. Vol. 34 No.2,P.178-185
[10] Jaideep Srivastava, Robert Cooley, Mukund Deshpande, and Pang-Ning Tan Web usage mining: Discovery and applications of usage patterns from web data.SIGKDD Explorations, 1(2):12–23, 2000


Paper Type : Research Paper
Title : Peephole Optimization Technique for analysis and review of Compiler Design and Construction
Country : India
Authors : Mr. Chirag H. Bhatt, Dr. Harshad B. Bhadka
: 10.9790/0661-0948086      logo

Abstract: In term of Compiler optimization, classical compilers implemented with an effective optimization technique called Peephole optimization. In the early stage of the implementation of this technique basically applied using string pattern matching performed on the regular expression and which are known as classical peephole optimizers. In the classical optimizers, the string pattern matching approach is considered as a processing of the input of the syntax of assembly code but its meaning gets lost. This paper explores prior research and current research issues in term of 'Optimizing' compilers with the implementation of Peephole optimization using different pattern matching approach that focuses on regular expression. In several research discussed below targets the implementation of pattern matching approach based on rule application strategy to achieve optimization of assembly code syntax for specific machine or retargetable [machine independent] in context of structured programming, procedure oriented programming and Object Oriented Programming.

Keywords - Intermediate Code, Optimization Rules, Pattern Matching Techniques, Peephole Size, Retargetable Peephole Optimizer

[1] Aho, A. V., Sethi, R., Ullman, J. D. Compilers: Principles, Techniques, and Tools. Massachusetts: Addison-Wesley,
[2] McKeeman, W. M. (1965) Peephole optimization. CACM 8(7):443-444.
[3] Lamb, D. A. (1981) Construction of a Peephole Optimizer. Software - Practice & Experience.
[4] Fraser, C. W. (1982) Copt, a simple, retargetable peephole optimizer. Software, available at ftp://ftp.cs.princeton.edu/pub/lcc/contrib/copt.shar.
[5] Davidson, J. W., Fraser, C. W. (1980) the design and application of a retargetable peephole optimizer. ACM TOPLAS 2(2):191-202.
[6] Fraser, C. W. (1979) A compact, machine-independent peephole optimizer. POPL'79:1-6.
[7] Davidson, J. W., Fraser, C. W. (1984) Code selection through object code optimization. ACM TOPLAS 6(4):505-526.
[8] Davidson, J. W., Fraser, C. W. (1984) Register allocation and exhaustive peephole optimization. Software - Practice & Experience 14(9):857-865.
[9] Davidson, J. W., Whalley, D. B. (1989) Quick compilers using peephole optimizations. Software - Practice & Experience 19(1):195-203.
[10] Ancona, M. (1995) an optimizing retargetable code generator. Information and Software Technology 37(2):87–101.


Paper Type : Research Paper
Title : Survey on Planar Drawing of Clustered Graphs
Country : Bangladesh
Authors : Marzia Sultana
: 10.9790/0661-09492102      logo

Abstract: In recent years, there has been great interest in graph drawing to express relational information and applications range from CASE tools, reverse engineering, idea organization, and software design. However, as the graphs to be visualized become more and more complex, extended structured graph variations are needed. Clustered graphs are graphs with recursive clustering structures. The possible utility of clustered graphs include CASE tools, reverse engineering, idea organization, software design, knowledge representation, visualization of social networks and biological networks , VLSI design tools and divide and conquer approaches. Thus, clustered graphs are useful tools worth investigating.

Keywords – Cluster Graphs, C-Planarity, Planar Drawing, St-Numbering.

[1] G. A. Grun, Cluster Graphs: A Survey of Drawing Algorithms, School of computer science, Simon Fraser University, September 1998.
[2] S. Cornelsen , D. Wagner, Completely connected clustered graphs, Journal of Discrete Algorithms 4, 2006.
[3] S-H. Hong, H. Nagamochi, Convex Drawings of Hierarchical Planar Graphs and Clustered Planar Graphs, Technical report 2007-004, January 28, 2007.
[4] S. Even and R. R. Tarjan, Computing an st-numbering, Theoretical Computer Science, 2, 1976, 339-344.
[5] P. Eades, Q. Feng, X. Lin and H. Nagamochi, Straight-line drawing algorithms for hierarchical graphs and clustered graphs, Algorithmica, 44, 2006, 1-32.
[6] W. T. Tutte, How to draw a graph, Proceeding London mathematical society, 1963.
[7] W. T. Tutte, Convex representations of graphs, Proc. of London Math. Soc. 10, no. 3, 1960, 304-320.
[8] Q. Feng, P. Eades, and R. F. Cohen, Planar drawing of clustered graphs, Technical report, Department of Computing Science and Software Engineering, University of Newcastle, 1995.
[9] P. Eades and Q. Feng, Drawing clustered graphs on an orthogonal grid, Technical report, Department of Computing Science and Software Engineering, University of Newcastle, 1997.
[10] R. S. Preparata, F. P. Preparata, M. I. Shamos, Computational Geometry: An Introduction, (Springer, 1993).


Paper Type : Research Paper
Title : Hybrid Intrusion Detection System Model using Clustering, Classification and Decision Table
Country : India
Authors : Aditi purohit, Hitesh Gupta
: 10.9790/0661-094103107      logo

Abstract: Nowadays, computer networks are so complex, nearly everyone with a computer has connected it to the Internet to access information and transmit messages and as complexity increases the question of security becomes more and more familiar as well as the depth knowledge of computer network protocols namely; Transmission Control Protocol (TCP), Internet Protocol (IP) being the most common ones amongst others like User Datagram Protocol (UDP) etc...One of the two most publicized to security is intruder (other is virus) generally referred to as hacker or cracker. Intrusion detection systems are an important component of defensive measures protecting computer systems and networks from abuse. In this paper we proposes, a new hybrid learning approach that combines K-Mean clustering, Naive Bayes (statistical) also known as KMNB with Decision Table Majority (rule based) approaches. An experiment will be Carrie out to evaluate the performance of the proposed approach using KDD Cup '99 dataset. The experimental results will shows that new type of attack can be detected effectively in the system, so that the efficiency and accuracy of intrusion detection system will improve terms of detection rate as well false positive rate with reasonable prediction time.

Keywords - Data mining, Intrusion detection System, Security, Protocol, Data Base..

[1] Virendra Barot and Durga Toshniwal "A New Data Mining Based Hybrid NetworkIntrusion Detection Model" IEEE 2012.

[2] Wang Pu and Wang Jun-qing "Intrusion Detection System with the Data Mining Technologies" IEEE 2011.

[3] Z. Muda, W. Yassin, M.N. Sulaiman and N.I. Udzir "Intrusion Detection based on K-Means Clustering and Naïve Bayes Classification" 7th IEEE International Conference on IT in Asia (CITA) 2011.

[4] Dewan M.D. Ferid, Nouria Harbi, "Combining Naïve Bayes and Decision Tree for Adaptive Intrusion detection" International Journal of Network Security and application(IJNSA),vol 2, pp. 189-196, April 2010.
[5] Joseph Derrick,Richard W. Tibbs, Larry Lee Reynolds "Investigating new approaches to data collection,management and analysis for network intrusion detection". In Proceeding of the 45th annual southesast regional conference, 2007. DOI = http://dl.acm.org/citation.cfm ?doid=1233341.1233392

[6] M.Panda, M. Patra, "Ensemble rule based classifiers for detecting network intrusion detection", in Int. Conference on Advances in Recent Technology in Communication and Computing, pp 19- 22,2009.

[7] R Rangadurai Karthick, Vipul P. Hattiwale and Balaraman Ravindran " Adaptive Network Intrusion Detection System using a Hybrid Approach" 2012 IEEE

[8] Safwan Mawlood Hussein, Fakariah Hani Mohd Ali and Zolidah Kasiran "Evaluation Effectiveness of Hybrid IDS Using Snort with Naïve Bayes to Detect Attacks" IEEE 2012

[9] Z. Muda, W. Yassin, M. N. Sulaiman, and N. I. Udzir "A K-Mean and Naïve Bayes Learning Approach for Bateer Intrusion detection system ", Information technology journal 2011 ISSN 1812-5638

[10] M.Moorthy and S.Sathiyabama "A Hybrid Data Mining based Intrusion Detection System for Wireless Local Area Networks" International Journal of Computer Applications (0975 – 8887)Volume 49– No.10, July 2012


Paper Type : Research Paper
Title : Implementation of Tree Based Itinerary Design (TBID) Algorithm Over Wireless Sensor networks by Using Mobile Agent
Country : India
Authors : Ganapathi rao.R, G. China Babu
: 10.9790/0661-094108112      logo

Abstract: In many sensor network applications viz., environmental monitoring, spatial exploration and battlefield surveillance, sensed data is aggregated and transmitted to the sinks for analysis. Thus, in- network data aggregation [2] becomes an important technique in wireless sensor networks and has been well studied in recent years. In general, any sensory network suffers with two problems i.e., i) the time latencies of the existing scheduling algorithms are still high, and ii) the other one is that all the existing algorithms are centralized, which are inherently inefficient. Hence, in this paper, we present a distributed scheduling algorithm generating collision-free schedules with latency bound, based on TBID, which employs multiple Mobile Agents (MAs) for completing the aggregation task on WSNs. The algorithm not only determines the proper number of MAs for minimizing the total aggregation cost but also constructs low-cost itineraries for each of them. In this paper, we adopt TBID that improves upon NOID by following a more direct approach to the problem of determining low-cost MA itineraries. Specifically, based on an accurate formula for the total energy expended during MA migration, we follow a greedy- like approach for distributing SNs in multiple MA itineraries, and algorithm determines a spanning forest of trees in the network, calculates efficient tree traversal orders (itineraries), and eventually, assigns these itineraries to individual MAs.) Keywords-component; TBID(Tree Based Itinerary Design) ,wireless sensor networks, data aggregation, mobile agents

[1] V. Pham, and A. Karmouch, "Mobile Software Agents: An Overview," IEEE Comm. Magazine, vol. 36, no. 7, pp. 26-37, July1998.J.Clerk Maxwell, A Treatise on Electricity and Magnetism, 3rd ed., vol. 2. Oxford: Clarendon, 1892, pp.68–73.

[2] R. Rajagopalan and P. Varshney, "Data-Aggregation Techniques in Sensor Networks: A Survey," IEEE Comm. Survey & Tutorials, vol. 8, no. 4, pp. 48-63, Oct. 2006

[3] H.Qi,Y. Xu, and X. Wang, "Mobile-Agent-Based Collaborative Signal and Information Processing in Sensor Networks," Proc. IEEE, vol. 91, no. 8, pp. 1172-1183, Aug. 2003.

[4] Y.Xu and H. Qi, "Mobile Agent Migration Modeling and Design for Target Tracking in Wireless Sensor Networks," Ad Hoc Networks, vol. 6, no. 1, pp. 1-16, Jan. 2008.

[5] K. Kalpakis, K. Dasgupta, and P. Namjoshi, "Efficient Algorithms for Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks," Computer Networks, vol. 42, no. 6, pp. 697-716, Aug. 2003.

[6] Charalampos Konstantopoulos, Aristides Mpitziopoulos, Damianos Gavalas, Member, IEEE, and Grammati Pantziou "Effective Determination of Mobile Agent Itineraries for Data Aggregation on Sensor Networks" VOL. 22, NO. 12, DECEMBER 2010

[7] A. Mpitziopoulos, D. Gavalas, C. Konstantopoulos, and G.Pantziou, "Deriving Efficient Mobile Agent Routes in Wireless Sensor Networks with NOID Algorithm," Proc. IEEE 18th Ann. Int'l Symp. Personal, Indoor, and Mobile Radio Comm. (PIMRC '07), pp. 1- 5, Sept. 2007.

[8] D. Gavalas, G. Pantziou, C. Konstantopoulos, and B. Mamalis, "A Method for Incremental Data Fusion in Distributed Sensor Networks," Proc. IFIP Third Conf. Artificial Intelligence Applications and Innovations (AIAI '06), pp. 635-642, June 2006.





IOSR Journal Publish Online and Print Version Both