Abstract
In this paper we propose a routing algorithm for Mobile Wireless Sensor Network (MWSN) where all the nodes, sensors and sink, are mobile. We follow a leader election approach to build a spanning tree by using only information provided by neighbor nodes. The leader election approach allows automatic routing adaptation despite node mobility. The routing algorithm has been implemented and evaluated using the JBotSim simulator. We present some preliminary evaluations that show the impact of mobility in the message delivery rate.
Author supplied keywords
Cite
CITATION STYLE
Burgos, U., Gómez-Calzado, C., & Lafuente, A. (2016). Leader-based routing in mobile wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10070 LNCS, pp. 218–229). Springer Verlag. https://doi.org/10.1007/978-3-319-48799-1_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
