Maximise success probability for real-time sensor networks using contention-based protocols Online publication date: Sun, 05-Jul-2015
by Qin Liu; Yanan Chang; Xiaohua Jia
International Journal of Sensor Networks (IJSNET), Vol. 18, No. 3/4, 2015
Abstract: We study real-time data aggregation problem for wireless sensor networks that use CSMA/CA MAC layer protocols. The problem is, for a given sink, a set of sensor nodes and a delay bound, to maximise the average transmission success probability of all sensor nodes within the delay bound. In CSMA/CA protocols, the success probability and the expected transmission delay are highly sensitive to node interference. We divide the system time into time-frames with fixed size and schedule the transmission of nodes into time-frames. The transmissions of all child nodes under the same parent are scheduled in the same time-frame. Therefore, the construction of data aggregation trees becomes very important in maximising the success probability of data collection. We solve the joint routing and scheduling problem by first constructing an aggregation tree that minimises the node interference. Then, we propose an efficient greedy scheduling method to assign time-frames to sensor nodes.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook