Abstrac&-Although manj' energy efficient/conserving routing protocol3 have been proposed for wireless sensor networks, the concentration of data traffic towards a small number of base stations remains a major threat to the network lifetime. The main reason is that the sensor nodes located near a base station have to relay data for a large part of the network and thus deplete their batteries very quickly, The solution we propose in this paper suggests that the base station be mobile; in this way, the nodes located close to it change oyer time. Data collection protocols can then be optimized by taking both base station mobility and multi-hop routing into account. We fitst study the fotmer, and conclude that the best mobility strategy consists in following the periphery of the network (we assume that the sensors are deployed within a circle). We then consider jointly mobility and routing algorithms in this case, and show that H better routing strategy uses a combination of round routes and short paths. We provide a detailed analytical model for each of our statements, and corroborate it with simulation results. We show that the obtained improvement in terms of network lifetime is in the order of 500'7~.
Luo and Hubaux REF demonstrate that using a mobile sink is beneficial and the mobility trajectory should follow the periphery of the network.
Joint mobility and routing for lifetime elongation in wireless sensor networks
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
Computer Science