Abstract

Maximization of network lifetime is one of the most important design goals in Wireless Sensor Networks (WSNs). In WSNs with static base stations, sensor nodes close to the base station dissipate most of their energies for relaying other sensor nodes' data. Although cooperation among the sensor nodes results in longer network lifetimes in comparison to greedy approaches, there is an inherent limit on the achievable network lifetime due to the limited energy of the sensor nodes in close proximity of the base station acting as relays. Base station mobility is proposed as a remedy for the WSN hot spot problem. As the base station relocates, the burden of relaying the data coming from all sensor nodes can be shared by a larger set of nodes. To take advantage of base station mobility to maximize the network lifetime, determining the optimal mobility pattern is of utmost importance. In this study, we investigate the impact of using three base station mobility patterns which are random mobility, grid mobility, and spiral mobility. To avoid the shadowing effects of specific protocols or algorithms we build a novel Mixed Integer Programming (MIP) framework which enables us to explore the design space under optimal operating conditions.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call