Event-to-sink reliable transport in wireless sensor networks

被引:278
作者
Akan, ÖB [1 ]
Akyildiz, IF [1 ]
机构
[1] Georgia Inst Technol, Sch Elect & Comp Engn, Broadband & Wireles Networking Lab, Atlanta, GA 30332 USA
基金
美国国家科学基金会;
关键词
congestion control; energy conservation; event-to-sink reliability; reliable transport protocols; wireless sensor networks;
D O I
10.1109/TNET.2005.857076
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of several microsensor nodes. Reliable event detection at the sink is based on collective information provided by source nodes and not on any individual report. However, conventional end-to-end reliability definitions and solutions are inapplicable in the WSN regime and would only lead to a waste of scarce sensor resources. Hence, the WSN paradigm necessitates a collective event-to-sink reliability notion rather than the traditional end-to-end notion. To the best of our knowledge, reliable transport in WSN has not been studied from this perspective before. In order to address this need, a new reliable transport scheme for WSN, the event-to-sink reliable transport (ESRT) protocol, is presented in this paper. ESRT is a novel transport solution developed to achieve reliable event detection in WSN with minimum energy expenditure. It includes a congestion control component that serves the dual purpose of achieving reliability and conserving energy. Importantly, the algorithms of ESRT mainly run on the sink, with minimal functionality required at resource constrained sensor nodes. ESRT protocol operation is determined by the current network state based on the reliability achieved and congestion condition in the network. This self-configuring nature of ESRT makes it robust to random, dynamic topology in WSN. Furthermore, ESRT can also accommodate multiple concurrent event occurrences in a wireless sensor field. Analytical performance evaluation and simulation results show that ESRT converges to the desired reliability with minimum energy expenditure, starting from any initial network state.
引用
收藏
页码:1003 / 1016
页数:14
相关论文
共 13 条
  • [1] [Anonymous], 2003, Proceedings of the 4th ACM international symposium on Mobile ad hoc networking and computing
  • [2] [Anonymous], MICA MOTES SENSORS
  • [3] Distributed target classification and tracking in sensor networks
    Brooks, RR
    Ramanathan, P
    Sayeed, AM
    [J]. PROCEEDINGS OF THE IEEE, 2003, 91 (08) : 1163 - 1171
  • [4] Chieh-YihWan Andrew T., 2002, P 1 ACM INT WORKSH W, P1, DOI DOI 10.1145/570738.570740
  • [5] Directed diffusion for wireless sensor networking
    Intanagonwiwat, C
    Govindan, R
    Estrin, D
    Heidemann, J
    Silva, F
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2003, 11 (01) : 2 - 16
  • [6] Johnson D.B., 2002, DYNAMIC SOURCE ROUTI
  • [7] State-centric programming for sensor-actuator network systems
    Liu, J
    Chu, M
    Liu, J
    Reich, J
    Zhao, F
    [J]. IEEE PERVASIVE COMPUTING, 2003, 2 (04) : 50 - 62
  • [8] Servetto SergioD., 2002, P 1 ACM INT WORKSHOP, P12, DOI DOI 10.1145/570738.570741
  • [9] Shih E., 2001, PROC 7 ANN ACMIEEE I, P272, DOI DOI 10.1145/381677.381703
  • [10] Sohrabi K, 1999, IEEE VTS VEH TECHNOL, P571, DOI 10.1109/VETEC.1999.778120