Sink Mobility Model for Wireless Sensor Networks

Abstract

Using mobile sinks to collect data in wireless sensor networks and investigating the effect of mobility models on the network performance has been an interesting area of research. In this paper, a De Bruijn graph-based network topology is adopted. Subsequently, we propose a new sink mobility model that can be obtained or calculated based on the properties of De Bruijn graph. Moreover, De Bruijn graph routing algorithm has been modified in this paper to take the existence of a mobile sink into consideration. As a result, the proposed model and routing algorithm combine the use of single hop and multi hop communication to collect data from static sensor nodes. Finally, the performance of the proposed mobility model and routing algorithm has been studied, in terms of end-to-end delay and data success rate, through simulation with different speeds of the mobile sink and different network sizes.