Mobile Transmission Using Rigorous Data for Wireless Sensor Networks
Main Article Content
Abstract
Wireless Sensor Networks (WSNs) are progressively more used in data-intensive applications such as micro-climate monitor, exactitude agriculture, and audio/video supervision. A key dispute faced by data-intensive WSNs is to convey all the data generated within an application's duration to the base station regardless of the fact that antenna nodes have restricted power supplies. We recommend using low-cost not reusable mobile transmissions to concentrate the energy expenditure of data-intensive WSNs. Our advance differs from preceding work in two main aspects. First, it does not require complex motion planning of mobile nodes, so it can be implemented on a number of low-cost mobile sensor platforms. Second, we incorporate the energy exploitation due to both mobility and wireless transmissions into a holistic optimization framework. Our framework consists of three main algorithms. The first algorithm computes an optimal routing tree pretentious no nodes can move. The second algorithm improves the topology of the routing tree by tightfistedly adding new nodes exploiting mobility of the newly added nodes. The third algorithm improves the routing tree by relocating its nodes without changing its topology. This iterative algorithm converges on the optimal position for each node given the restriction that the routing tree topology does not change. We present professional distributed implementations for each algorithm that require only inadequate, confined to a small area bringing together. Because we do not automatically calculate an optimal topology, our ending routing tree is not automatically optimal. However, our simulation results show that our algorithms significantly surpass the best presented solutions.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
IJCERT Policy:
The published work presented in this paper is licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. This means that the content of this paper can be shared, copied, and redistributed in any medium or format, as long as the original author is properly attributed. Additionally, any derivative works based on this paper must also be licensed under the same terms. This licensing agreement allows for broad dissemination and use of the work while maintaining the author's rights and recognition.
By submitting this paper to IJCERT, the author(s) agree to these licensing terms and confirm that the work is original and does not infringe on any third-party copyright or intellectual property rights.
References
R. Szewczyk, A. Mainwaring, J. Polastre, J. Anderson, and D. Culler, “An analysis of a large scale habitat monitoring application,” in SenSys, 2004.
L. Luo, Q. Cao, C. Huang, T. F. Abdelzaher, J. A. Stankovic, and M. Ward, “Enviromic: Towards cooperative storage and retrieval in audio sensor networks,” in ICDCS, 2007, p. 34.
D. Ganesan, B. Greenstein, D. Perelyubskiy, D. Estrin, and J. Heidemann, “An evaluation of multi-resolution storage for sensor networks,” in SenSys, 2003.
S. R. Gandham, M. Dawande, R. Prakash, and S. Venkatesan, “Energy efficient schemes for wireless sensor networks with multiple mobile base stations,” in Globecom, 2003.
J. Luo and J.-P. Hubaux, “Joint mobility and routing for life-time elongation in wireless sensor networks,” in INFOCOM, 2005.
Z. M. Wang, S. Basagni, E. Melachrinoudis, and C. Petrioli, “Exploiting sink mobility for maximizing sensor networks lifetime,” in HICSS, 2005.
A. Kansal, D. D. Jea, D. Estrin, and M. B. Srivastava, “Con-trollably mobile infrastructure for low energy embedded net-works,” IEEE Transactions on Mobile Computing, vol. 5, pp. 958– 973, 2006.
G. Xing, T. Wang, W. Jia, and M. Li, “Rendezvous design algorithms for wireless sensor networks with a mobile base station,” in MobiHoc, 2008, pp. 231–240.
D. Jea, A. A. Somasundara, and M. B. Srivastava, “Multiple controlled mobile elements (data mules) for data collection in sensor networks,” in DCOSS, 2005.
R. Shah, S. Roy, S. Jain, and W. Brunette, “Data mules: Modeling a three-tier architecture for sparse sensor networks,” in IEEE SNPA Workshop, 2003.
S. Jain, R. Shah, W. Brunette, G. Borriello, and S. Roy, “Exploiting mobility for energy efficient data collection in wireless sensor networks,” MONET, vol. 11, pp. 327–339, 2006.
W. Wang, V. Srinivasan, and K.-C. Chua, “Using mobile re-lays to prolong the lifetime of wireless sensor networks,” in MobiCom, 2005.
D. K. Goldenberg, J. Lin, and A. S. Morse, “Towards mobility as a network control primitive,” in MobiHoc, 2004, pp. 163–174.
A. A. Somasundara, A. Ramamoorthy, and M. B. Srivastava, “Mobile element scheduling with dynamic deadlines,” IEEE Transactions on Mobile Computing, vol. 6, pp. 395–410, 2007.
Y. Gu, D. Bozdag, and E. Ekici, “Mobile element based differentiated message delivery in wireless sensor networks,” in
K. Dantu, M. Rahimi, H. Shah, S. Babel, A. Dhariwal, and G. S. Sukhatme, “Robomote: enabling mobility in sensor networks,” in IPSN, 2005.
http://www.kteam.com/robots/khepera/index.html.
J.-H. Kim, D.-H. Kim, Y.-J. Kim and K.-T. Seow, Soccer Robotics. Springer, 2004.
G. Xing, T. Wang, Z. Xie, and W. Jia, “Rendezvous planning in wireless sensor networks with mobile elements,” IEEE Transactions on Mobile Computing, vol. 7, pp. 1430–1443, 2008.
“Rendezvous planning in mobility-assisted wireless sensor networks,” in RTSS ’07: Proceedings of the 28th IEEE Inter-national Real-Time Systems Symposium, 2007, pp. 311–320.