Abstract
A critical problem of wireless sensor networks is the network lifetime, due to the device’s limited battery lifetime. The nodes are randomly deployed in the field and the system has no previous knowledge of their position. To tackle this problem we use a mobile robot, that discovers the nodes around it and replaces the active nodes, whose energy is drained, by fully charged inactive nodes. In this paper we propose two localized algorithms, that can run on the robot and that decide, which nodes to replace. We simulate our algorithms and our findings show that all nodes that fail are replaced in a short period of time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Parikh, S., Vokkarane, V.M., Xing, L., Kasilingam, D.: Node-Replacement Policies to Maintain Threshold-Coverage in Wireless Sensor Networks. In: Proceedings of 16th International Conference on Computer Communications and Networks, ICCCN 2007, pp. 760–765 (2007)
Zorbas, D., Razafindralambo, T.: Wireless Sensor Network Redeployment under the Target Coverage Constraint. In: 2012 5th International Conference on New Technologies, Mobility and Security (NTMS), pp. 2157–4952 (2012)
Sakib, K., Tari, Z., Bertok, P.: Failed node replacement policies for maximising sensor network lifetime. In: 2011 6th International Symposium on Wireless and Pervasive Computing (ISWPC), pp. 1–6 (2011)
Battery energy storage, http://www.allaboutbatteries.com/Energy-tables.html
Wifibots, http://www.wifibot.com/
Tong, B., Wang, G., Zhang, W., Wang, G.: Node Reclamation and Replacement for Long-Lived Sensor Networks. IEEE Transactions on Parallel and Distributed Systems 22, 1550–1563 (2011)
Tong, B., Li, Z., Wang, G., Zhang, W.: On-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-Lived Sensor Networks. In: Bartolini, N., Nikoletseas, S., Sinha, P., Cardellini, V., Mahanti, A. (eds.) QShine 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol. 22, pp. 148–166. Springer, Heidelberg (2009)
Tong, B., Li, Z., Wang, G., Zhang, W.: Towards Reliable Scheduling Schemes for Long-lived Replaceable Sensor Networks. In: 2010 Proceedings IEEE INFOCOM, pp. 1–9 (2010)
Falcon, R., Li, X., Nayak, A., Stojmenovic, I.: The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach. In: 2010 IEEE Congress on Evolutionary Computation (CEC), pp. 1–8 (2010)
Mei, Y., Xian, C., Das, S., Hu, Y.C., Lu, Y.-H.: Sensor replacement using mobile robots. Computer Communications 30, 2615–2626 (2007)
Li, X., Santoro, N., Stojmenovic, I.: Mesh-Based Sensor Relocation for Coverage Maintenance in Mobile Sensor Networks. LNCS, pp. 696–708. Springer, Heidelberg (2007)
Carle, J., Simplot-Ryl, D.: Energy-efficient area monitoring for sensor networks. Computer 37, 40–46 (2004)
Younis, M., Youssef, M., Arisha, K.: Energy-aware management for cluster-based sensor networks. Computer Networks 43, 649–668 (2003)
Sheu, J., Hsieh, K., Cheng, P.: Design and implementation of mobile robot for nodes replacement in wireless sensor networks. Journal of Information Science and Engineering 24, 393–410 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Magklara, K., Zorbas, D., Razafindralambo, T. (2013). Node Discovery and Replacement Using Mobile Robot. In: Zheng, J., Mitton, N., Li, J., Lorenz, P. (eds) Ad Hoc Networks. ADHOCNETS 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36958-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-36958-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36957-5
Online ISBN: 978-3-642-36958-2
eBook Packages: Computer ScienceComputer Science (R0)