Mobile Data Gathering in Wireless Sensor Networks
Mobile Computing Lab
Center of Excellence in Wireless and Information Technology
Department of Electrical and Computer Engineering
Stony Brook University, New York, USA
In this talk, we consider a wireless sensor network that consists of a large number of sensors and a limited number of mobile data collectors. In such a network, mobile collectors take over the burden of routing from sensors, roaming over the sensing area and collecting data from nearby sensors via short-range wireless communications. We present a series of efficient mobile data gathering schemes in such sensor networks, which aim to prolong network lifetime and shorten data gathering latency.
Moving path planning with multi-hop relays. We propose a moving path planning algorithm by adopting a divide and conquer method, which recursively determines a turning point on the path. The moving path of the mobile collector is planed dynamically based on the distribution of sensors, and load balancing among sensors is performed along with the moving path planning to prolong network lifetime.
Single-hop data gathering. To achieve uniform energy consumption among sensors, in this scheme, the mobile collector is scheduled to traverse the transmission range of each sensor such that data from each sensor can be collected via single-hop transmission. However, this approach typically results in significantly increased latency due to the low moving velocity of the mobile collector. Hence, we focus on minimizing the length of a data gathering tour by formulating it into an optimization problem. A heuristic algorithm is proposed to provide a practically good solution to the problem.
Mobile data gathering with controlled mobility and SDMA technique. In this scheme, we apply the latest physical layer technique, Space-Division Multiple Access (SDMA), to sensor networks, which enables multiple sensors to upload data simultaneously to the mobile collector so that data uploading time can be greatly shortened. To better enjoy the benefit of SDMA, mobile collector may have to visit some specific locations where more sensors are compatible, which may adversely prolong the moving tour. We propose an optimal solution that minimizes the data gathering latency by exploring a tradeoff between the shortest moving tour and the full utilization of SDMA.
Bounded relay hop mobile data gathering scheme. In this scheme, we study the inherent tradeoff between energy saving and data gathering latency of the mobile data gathering in sensor networks, by achieving a balance between the relay hop count of local data aggregation and the moving tour length of the mobile collector. We propose a polling-based mobile collection approach and formulate it into an optimization problem. Specifically, a subset of sensors are selected as polling points that buffer the locally aggregated data and upload the data to the mobile collector when it arrives. In the meanwhile, when sensors are affiliated with these polling points, it is guaranteed that the relaying of any packet is bounded within a given number of hops.
Short Bio of Yuanyuan Yang
Yuanyuan Yang is currently a Full Professor of Electrical & Computer Engineering and Computer Science at Stony Brook University, and the Director of Communications and Devices Division at New York State Center of Excellence in Wireless and Information Technology (CEWIT). She received her PhD degree in computer science from Johns Hopkins University, Baltimore, Maryland, in 1992. Dr. Yang's research interests include data center networks, wireless/mobile networks, optical networks, multicast communication and parallel and distributed computing systems. She has authored or coauthored more than 260 research articles in leading refereed journals and conferences on these topics. She is also an inventor/co-inventor of seven U.S. patents in these areas.