Conflict-Aware Data Aggregation Scheduling in Wireless Sensor Networks with Adjustable Transmission Range

The minimum latency data aggregation schedule is one of the fundamental problems in wireless sensor networks. Most existing works assumed that the transmission ranges of sensor nodes cannot be adjusted. However, sensors with adjustable transmission ranges have advantages in energy saving, reducing transmission interference and latency. In this paper, we study the minimum latency conflict-aware data aggregation scheduling problem with adjustable transmission radii: given locations of sensors along with a base station, all sensors could adjust their transmission radii and each sensor's interference radius is α times of its transmission radius, we try to find a data aggregation schedule in which the data from all sensors can be transmitted to the base station without conflicts, such that the latency is minimized. We first partition the set of all nodes into two parts: the major set and the minor set. Then, we design different scheduling strategies for the two sets, respectively. Finally, we propose an approximation algorithm for the problem and prove the performance ratio of the algorithm is bounded by a nearly constant. Our experimental results evaluate the efficiency of the proposed algorithm.

[1]  Wenyu Liu,et al.  Minimum-Latency Aggregation Scheduling in Underwater Wireless Sensor Networks , 2011, 2011 IEEE International Conference on Communications (ICC).

[2]  Xiao-Dong Hu,et al.  Minimum Data Aggregation Time Problem in Wireless Sensor Networks , 2005, MSN.

[3]  Zhu Wang,et al.  First-Fit Scheduling for Beaconing in Multihop Wireless Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[4]  Shaojie Tang,et al.  A Delay-Efficient Algorithm for Data Aggregation in Multihop Wireless Sensor Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[5]  Xiaohua Jia,et al.  Minimum-latency aggregation scheduling in multihop wireless networks , 2009, MobiHoc '09.

[6]  Sandeep K. S. Gupta,et al.  On tree-based convergecasting in wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[7]  Shaojie Tang,et al.  Efficient data aggregation in multi-hop wireless sensor networks under physical interference model , 2009, 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems.

[8]  Xiaohua Jia,et al.  Minimum-Latency Beaconing Schedule in Multihop Wireless Networks , 2009, IEEE INFOCOM 2009.

[9]  Weiping Shang,et al.  Approximation algorithm for minimal convergecast time problem in wireless sensor networks , 2010, Wirel. Networks.

[10]  Jianzhong Li,et al.  Distributed Data Aggregation Scheduling in Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[11]  Ying Zhang,et al.  Distributed Minimal Time Convergecast Scheduling in Wireless Sensor Networks , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[12]  Yingshu Li,et al.  Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[13]  Chunming Qiao,et al.  A Constant Approximation Algorithm for Interference Aware Broadcast in Wireless Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[14]  Dariusz R. Kowalski,et al.  Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks , 2005, Second Annual Conference on Wireless On-demand Network Systems and Services.

[15]  Deying Li,et al.  An Approximation Algorithm for Conflict-Aware Many-to-One Data Aggregation Scheduling in Wireless Sensor Networks , 2009, WASA.

[16]  Hongqiang Zhai,et al.  An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks , 2008, MobiHoc '08.