Maximise success probability for real-time sensor networks using contention-based protocols

被引：0

作者：

Liu, Qin ^{[1
]}

Chang, Yanan ^{[2
]}

Jia, Xiaohua ^{[3
]}

机构：

[1] Wuhan Univ, Sch Comp, Wuhan 430072, Peoples R China

[2] Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China

[3] City Univ Hong Kong, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China

来源：

INTERNATIONAL JOURNAL OF SENSOR NETWORKS | 2015年 / 18卷 / 3-4期

基金：

中国国家自然科学基金;

关键词：

data aggregation tree; real-time data aggregation; wireless sensor networks; cyber-physical systems; DATA AGGREGATION; WIRELESS; PERFORMANCE; CSMA;

D O I：

10.1504/IJSNET.2015.070401

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We study real-time data aggregation problem for wireless sensor net-works 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.

引用

页码：217 / 226

页数：10

共 19 条

[1] Performance analysis,of the IEEE 802.11 distributed coordination function [J].