5 Using Dominating Set and TSP Algorithm for Data Collection with Mobile Sink in Wireless Sensor Networks

Traditional data collection protocols suffer “hot spot” problem heavily in area around the sink node. Recently proposed schemes using mobile sinks try to balance the load with the cost of sink mobility. However, most approaches are based on unit disk graph (UDG) model, which is inaccurate in physical world. We propose an UDG-free solution for data collection with mobile sinks using dominating set and traveling salesman problem (TSP) techniques. A distributed algorithm for dominating set construction is presented, and the result set is used in approximate TSP algorithm to generate a moving path. Our solution not only reduces communication overhead, but also balances the load distribution.