Edge-based beaconing schedule in duty-cycled multihop wireless networks

Beaconing is a fundamental networking service where each node broadcasts a packet to all its neighbors locally. Unfortunately, the problem Minimum Latency Beaconing Schedule (MLBS) in duty-cycled scenarios is not well studied. Existing works always have rigid assumption that each node is only active once per working cycle. Aiming at making the work more practical and general, MLBS problem in duty-cycled network where each node is allowed to active multiple times in each working cycle (MLBSDCA for short) is investigated in this paper. Firstly, a modified first-fit coloring based algorithm is proposed for MLBSDCA under protocol interference model. After that, a (ρ + 1)2 ∗ |W|-approximation algorithm is proposed to further reduce the beaconing latency, where ρ denotes the interference radius, and |W| is the maximum number of active time slots per working cycle. When ρ and |W| is equal to 1, the approximation ratio is only 4, which is better than the one (i.e., 10) in existing works. Furthermore, two approximation algorithms for MLBSDCA under physical interference model are also investigated. The theoretical analysis and experimental results demonstrate the efficiency of the proposed algorithms in term of latency.

[1]  Peng-Jun Wan,et al.  Minimum-Latency Beaconing Schedule in duty-cycled multihop wireless networks , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[2]  Jianzhong Li,et al.  Energy-Efficient Algorithm for Multicasting in Duty-Cycled Sensor Networks , 2015, Sensors.

[3]  Jiannong Cao,et al.  Sleeping Schedule-Aware Minimum Latency Broadcast in Wireless Ad Hoc Networks , 2009, 2009 IEEE International Conference on Communications.

[4]  Djamel Djenouri,et al.  Distributed Low-Latency Data Aggregation Scheduling in Wireless Sensor Networks , 2015, ACM Trans. Sens. Networks.

[5]  Zhi-Zhong Chen,et al.  A 3.4713-approximation algorithm for the capacitated multicast tree routing problem , 2009, Theor. Comput. Sci..

[6]  Jiannong Cao,et al.  Fast Group Communication Scheduling in Duty-Cycled Multihop Wireless Sensor Networks , 2012, WASA.

[7]  Xiaodong Wang,et al.  Minimum Latency Broadcast Scheduling in Duty-Cycled Multihop Wireless Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

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

[9]  Yingshu Li,et al.  Approximate Holistic Aggregation in Wireless Sensor Networks , 2015, ICDCS.

[10]  Randy Goebel,et al.  Size-constrained tree partitioning: Approximating the multicast k-tree routing problem , 2011, Theor. Comput. Sci..

[11]  Bo Jiang,et al.  Opportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with Unreliable Links , 2009, IEEE Transactions on Computers.

[12]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.

[13]  Feng Wang,et al.  Duty-Cycle-Aware Broadcast in Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[14]  Mostafa Ammar,et al.  Evaluation of slot allocation strategies for TDMA protocols in packet radio networks , 1990, IEEE Conference on Military Communications.

[15]  Yang Liu,et al.  Duty-Cycle-Aware Minimum-Energy Multicasting in Wireless Sensor Networks , 2010, IEEE/ACM Transactions on Networking.

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

[17]  Arunabha Sen,et al.  A new model for scheduling packet radio networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[18]  Leonard Kleinrock,et al.  Spatial TDMA: A Collision-Free Multihop Channel Access Protocol , 1985, IEEE Trans. Commun..

[19]  Arunabha Sen,et al.  A new model for scheduling packet radio networks , 1997, Wirel. Networks.

[20]  Anthony Ephremides,et al.  Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..

[21]  Tian He,et al.  Dynamic Switching-Based Data Forwarding for Low-Duty-Cycle Wireless Sensor Networks , 2011, IEEE Transactions on Mobile Computing.

[22]  Subramanian Ramanathan,et al.  Scheduling algorithms for multi-hop radio networks , 1992, SIGCOMM '92.

[23]  Leland L. Beck,et al.  Smallest-last ordering and clustering and graph coloring algorithms , 1983, JACM.

[24]  Jianzhong Li,et al.  A Study on Application-Aware Scheduling in Wireless Networks , 2017, IEEE Transactions on Mobile Computing.

[25]  Xiaohua Jia,et al.  Approximation algorithms for conflict-free channel assignment in wireless ad hoc networks , 2006, Wirel. Commun. Mob. Comput..