The week's pick
Reseach Article
Research Challenges in using Mobile Agents for Data Aggregation in Wireless Sensor Networks with Dynamic Deadlines
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 30 - Number 5 |
| Year of Publication: 2011 |
| Authors: Pranesh.V.Kallapur, Geetha. V |
10.5120/3636-5079
|
Pranesh.V.Kallapur, Geetha. V . Research Challenges in using Mobile Agents for Data Aggregation in Wireless Sensor Networks with Dynamic Deadlines. International Journal of Computer Applications. 30, 5 ( September 2011), 34-38. DOI=10.5120/3636-5079
Abstract
Recent research has provided means by which Wireless Sensor Networks (WSN) with dynamic deadlines can make use of mobile agents for data aggregation. Lot of research has already been done with respect to using mobile agents in case of static wireless sensor networks. This paper proposes, along with brief explanation of research issues associated with applying mobile agents, two new techniques to improve the performance of data aggregation using mobile agents. First technique proposed in this paper makes mobile agents ‘intelligent’ enough to support dynamic wireless sensor networks also. Second technique proposed shows that how multiple mobile agents can also be used, in partitions of the original given wireless sensor which are generated based on some chosen criteria, to reduce overall number of buffer overflows. Paper will be concluded with mentioning of future directions of research.
References
- Arun A Somasundara, Aditya Ramamoorthy, Mani B Srivastava. Mobile Element Scheduling for efficient Data Collection in Wireless Sensor Networks with Dynamic Deadlines. In Proceedings of the 25th IEEE International Real-Time Systems Symposium (RTSS 2004), 2007
- A. Chakrabarti, A. Sabharwal, and B. Aazhang. Using predictable observer mobility for power efficient design of sensor networks. In The second International Workshop on Information Processing in Sensor Networks (IPSN), 2003.
- P. Juang, H. Oki, Y. Wang, M. Martonosi, L. Peh, and D. Rubenstein. Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebranet. In Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2002.
- A. Kansal, A. Somasundara, D. Jea, M. Srivastava, and D. Estrin. Intelligent fluid infrastructure for embedded networks. In The Second International Conference on Mobile Systems, Applications, and Services (MobiSys), 2004.
- R. C. Shah, S. Roy, S. Jain, and W. Brunette. Data mules: Modeling a three-tier architecture for sparse sensor networks. In IEEE Workshop on Sensor Network Protocols and Applications (SNPA), 2003.
- T. Small and Z. Haas. The shared wireless infostation model a new ad hoc networking paradigm (or where there is a whale, there is a way). In The Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 2003.
- W. Zhao and M. Ammar. Message ferrying: Proactive routing in highly-partitioned wireless ad hoc networks. In The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS), 2003.
- W. Zhao, M. Ammar, and E. Zegura. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In The fifth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 2004.
- P. Toth and D. Vigo, editors, “The Vehicle Routing Problem”, Society for Industrial & Applied Mathematics (SIAM),2001.
- M. Solomon, “ Algorithms for the vehicle routing and scheduling problem with time window constraints”, Operations Research, 35(2), Mar-Apr 1985.
- P. Toth and D. Vigo editors, “ The Vehicle Routing Problem”, Society for Industrial & Applied Mathematics (SIAM), 2001.
- www.jamesreserve.edu (james san jacinto mountains reserve
- N. Bansal, A. Blum, S. Chawla, and A. Meyerson, “ Approximation algorithms for deadline-tsp and vehicle routing with time-windows”, In 36th ACM Symposium on Theory of Computing (STOC), 2004.
- Yaoyao Gu, Doruk Bozdag˘, Eylem Ekici, Fu¨sun O¨ zgu¨ner, Chang-Gun Lee, “Partitioning Based Mobile Element Scheduling in Wireless Sensor Networks”, IEEE International Conference on Mobile Computing, 2005.
- Zheng wei, Liu sanyang, Kou xiaoli, and Qi xiaogang, “Mobile agent routing algorithm in dynamic sensor network”, IEEE International Conference on Communications and Mobile Computing, 2010.
- Ryo Sugihar, and Rajesh K. Gupta, “Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks”, IEEE Transactions On Mobile Computing, Vol. 9, No. 1, January 2010.
- Pranesh V Kallapur, and Niranjan N Chiplunkar, “Topology Aware Mobile Agent for Efficient Data Collection in Wireless Sensor Networks with Dynamic Deadlines”, IEEE Conference on Advances in Computer Engineering (ACE), June 2010.
- Pranesh V Kallapur, and Niranjan N Chiplunkar, “Multiple Mobile Agents for Data Collection in Overflow Time Based Partitions of Wireless Sensor Networks with Dynamic Deadlines”, R10 Asia-Pacific regional IEEE Conference on Advances in Communication Technology (ICACT), February 2011.
Index Terms
Keywords