An energy-aware reliable deterministic broadcast protocol for wireless sensor networks

Broadcast is one of the most fundamental services provided by the communication protocol for wireless sensor networks. In this paper, we design an energy-aware reliable deterministic broadcast scheduling protocol by using user-irrepressible (UI) protocol sequences. Each user transmits a packet in a time slot if and only if the sequence value is equal to one. A collision occurs if two or more users transmit at the same slot. UI sequences ensure that each user can receive at least one packet error-free from each other within the sequence period. Moreover, it does not require any time synchronization among the users. In the protocol, a new construction of UI sequences is presented and a sleeping mechanism is proposed. Simulation results show that the new protocol has a significant energy saving compared with traditional UI-sequences-based schemes. In addition, the delay can in fact be reduced by employing new UI sequences instead.

[1]  W. S. Wong New Protocol Sequences for Random-Access Channels Without Feedback , 2007, IEEE Transactions on Information Theory.

[2]  Kenneth W. Shum,et al.  Construction and Applications of CRT Sequences , 2010, IEEE Transactions on Information Theory.

[3]  Kenneth W. Shum,et al.  Design and construction of protocol sequences: Shift invariance and user irrepressibility , 2009, 2009 IEEE International Symposium on Information Theory.

[4]  Kenneth W. Shum,et al.  Safety-Message Broadcast in Vehicular Ad Hoc Networks Based on Protocol Sequences , 2014, IEEE Transactions on Vehicular Technology.

[5]  James L. Massey,et al.  The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.

[6]  László Györfi,et al.  Constructions of binary constant-weight cyclic codes and cyclically permutable codes , 1992, IEEE Trans. Inf. Theory.

[7]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[8]  Kenneth W. Shum,et al.  User-Irrepressible Sequences , 2010, SETA.

[9]  Kenneth W. Shum,et al.  Shift-Invariant Protocol Sequences for the Collision Channel Without Feedback , 2009, IEEE Transactions on Information Theory.

[10]  Victor O. K. Li,et al.  An optimal topology-transparent scheduling method in multihop packet radio networks , 1998, TNET.

[11]  Charles J. Colbourn,et al.  Ternary Schedules for Energy-Limited Sensor Networks , 2007, IEEE Transactions on Information Theory.

[12]  Charles J. Colbourn,et al.  The effects of synchronization on topology-transparent scheduling , 2006, Wirel. Networks.