|
Author(s):
|
Xiang-Yang Li, Illinois Institute of Technology, USA ; XiaoHua Xu, Illinois Institute of Technology, USA; ShiGuang Wang, Illinois Institute of Technology, USA; Shao-Jie Tang, Illinois Institute of Technology, USA; Guojun Dai, Hangzhou Dianzi University, P.R. China; Jizhong Zhao, Xi'an Jiaotong University, P.R. China; Yong Qi, Xi'an Jiaotong University, P.R. China
|
|
Abstract:
|
Efficient aggregation of data collected by sensors is crucial for a successful application of wireless sensor networks (WSNs). Both minimizing the energy cost and reducing the latency (or called delay) of data aggregation has been extensively studied for WSN. Algorithms with theoretical performance guarantees are only known for the protocol interference model, or generally gragh-based interference models. In this paper, we focus on designing delay efficient aggregation method under the physical interference model. To the best of our knowledge, no algorithms with theoretical performance guarantees are known for this problem in the literature. We propose an efficient distributed algorithm that produces a collision-free aggregation schedule. We theoretically prove that the latency of our aggregation schedule is bounded by $O(R+\Delta)$ time-slots. Here $R$ is the network radius and $\Delta$ is the maximum node degree in the communication graph of the original network. In addition, we derive the lower-bound of latency for any aggregation scheduling algorithm under physical interference model. Our method is asymptotically optimum for random wireless networks. We conduct extensive simulations to study the performances of our proposed aggregation algorithm. Our simulation results corroborate our theoretical analysis.
|
