Research On Protocol Sequences Based On Wireless Sensor Networks

Protocol sequences are periodic and deterministic binary sequences with special Hamming cross-correlation.They have been used to define a channel access scheme for the collision channel without feedback,and can provide strict guarantee on worst-case throughout or delay performance to asynchronous users.User-irrepressible(UI)sequences is a special class of protocol sequences,and is able to guarantee that every user can successfully send at least one packet in every sequence period under a slot-synchronous and single-packet reception(SPR)assumption.Such a property is desirable for wireless sensor networks with a strict requirement on delivery deadline and reliability.This thesis follows the line of this investigation,and further works on the sequence construction and delay analysis,according to more general data rate,more general channel model and more practical physical layer reception technique.First,we propose g-UI sequences to guarantee that every user can successfully send at least g packet in every sequence period under a slot-synchronous and SPR assumption provide a construction method and develop an analytical model to derive its delay performance.Second,we focus on CI sequences which can ensure that every user can successfully send at least one packet in every sequence period under a slot-asynchronous and SPR assumption.We provide a theoretical analysis to its average delay performance.Third,we provide a construction method to guarantee that every user can successfully send at least one packet in every sequence period under a slot-synchronous and multiple-packet reception assumption.We also present a theoretical analysis to its average delay performance.Simulation results confirm the accuracy of the above analysis,and indicate that protocol sequences enjoy better delay performance than Aloha under different system models.