Minimizing energy expense for chain-based data gathering in wireless sensor networks

被引:0
作者
Yen, LH [1 ]
Cai, MZ [1 ]
Cheng, YM [1 ]
Yang, PY [1 ]
机构
[1] Chung Hua Univ, Dept Comp Sci & Informat Engn, Taipei 300, Taiwan
来源
PROCEEDINGS OF THE SECOND EUROPEAN WORKSHOP ON WIRELESS SENSOR NETWORKS | 2005年
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper aims to minimize energy expense for chain-based data gathering schemes, which is essential to prolong operation lifetime of wireless sensor networks. We propose the concept of virtual chain, where an edge may correspond to a multi-hop data propagation path to conserve power. In contrast, an edge in previous work can only be a costly direct communication link. Furthermore, we propose a power-efficient leader scheduling scheme which selects the node that has the maximum residual power to be the leader of the chain. In contrast, nodes in previous work play the role of leader by turns, which results in non-uniform energy consumption among sensors. Simulation results show that our strategies successfully conserve power.
引用
收藏
页码:312 / 320
页数:9
相关论文
共 17 条
  • [1] Annamalai V, 2003, IEEE WCNC, P1942
  • [2] [Anonymous], 1990, Introduction to Algorithms
  • [3] Chandrakasan A., 2000, P 33 HAWAAIAN INT C
  • [4] IMPROVED ALGORITHM FOR DECENTRALIZED EXTREMA-FINDING IN CIRCULAR CONFIGURATIONS OF PROCESSES
    CHANG, E
    ROBERTS, R
    [J]. COMMUNICATIONS OF THE ACM, 1979, 22 (05) : 281 - 283
  • [5] CHRISTODES N, 1976, 388 CARN MELL U PITT
  • [6] CORMEN TH, 1990, INTRO ALGORITHMS, P520
  • [7] CORMEN TH, 1990, INTRO ALGORITHMS, P969
  • [8] DU K, 2003, P INT PARALLEL DISTR
  • [9] Hall D. L., 1992, MATH TECHNIQUES MULT
  • [10] Handy MJ, 2002, 2002 4TH INTERNATIONAL WORKSHOP ON MOBILE AND WIRELESS COMMUNICATION NETWORK, P368, DOI 10.1109/MWCN.2002.1045790