Efficient Data Collection in Wireless Sensor Networks with Path-Constrained Mobile Sinks

Authors:
Shuai Gao;Hongke Zhang;Sajal K. Das
Affiliations:
Beijing Jiaotong University, Beijing;Beijing Jiaotong University, Beijing;University of Texas at Arlington, Arlington
Venue:
IEEE Transactions on Mobile Computing
Year:
2011

Citing 0
Cited 6

Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey

ACM Transactions on Sensor Networks (TOSN)
Flocking based distributed self-deployment algorithms in mobile sensor networks

Journal of Parallel and Distributed Computing
Optimized relay node placement for connecting disjoint wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Real-time data report and task execution in wireless sensor and actuator networks using self-aware mobile actuators

Computer Communications
A reliable and flexible data gathering protocol for battery limited wireless sensor networks

International Journal of Communication Networks and Distributed Systems
A myopic mobile sink migration strategy for maximizing lifetime of wireless sensor networks

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent work has shown that sink mobility along a constrained path can improve the energy efficiency in wireless sensor networks. However, due to the path constraint, a mobile sink with constant speed has limited communication time to collect data from the sensor nodes deployed randomly. This poses significant challenges in jointly improving the amount of data collected and reducing the energy consumption. To address this issue, we propose a novel data collection scheme, called the Maximum Amount Shortest Path (MASP), that increases network throughput as well as conserves energy by optimizing the assignment of sensor nodes. MASP is formulated as an integer linear programming problem and then solved with the help of a genetic algorithm. A two-phase communication protocol based on zone partition is designed to implement the MASP scheme. We also develop a practical distributed approximate algorithm to solve the MASP problem. In addition, the impact of different overlapping time partition methods is studied. The proposed algorithms and protocols are validated through simulation experiments using OMNET++.