5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness

Research Article

Delay-Constraint Topology Control in Wireless Sensor Networks Format

Download493 downloads
  • @INPROCEEDINGS{10.4108/ICST.QSHINE2008.3815,
        author={Hongli Xu and Liusheng Huang and Junmin Wu and Gang Wang and Wang Liu},
        title={Delay-Constraint Topology Control in Wireless Sensor Networks Format},
        proceedings={5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness},
        publisher={ICST},
        proceedings_a={QSHINE},
        year={2010},
        month={5},
        keywords={Wireless Sensor Networks Delay Topology Control Energy Efficient},
        doi={10.4108/ICST.QSHINE2008.3815}
    }
    
  • Hongli Xu
    Liusheng Huang
    Junmin Wu
    Gang Wang
    Wang Liu
    Year: 2010
    Delay-Constraint Topology Control in Wireless Sensor Networks Format
    QSHINE
    ICST
    DOI: 10.4108/ICST.QSHINE2008.3815
Hongli Xu1,2,*, Liusheng Huang1,2,*, Junmin Wu1,2,*, Gang Wang1,2,*, Wang Liu1,2,*
  • 1: Depart. of Computer Science and Technology, Univ. of Science & Technology of China, Hefei 230027, P.R. China,
  • 2: Suzhou Institute for Advanced Study, Univ. of Science & Technology of China Suzhou 215123, P.R. China
*Contact email: xuhongli@ustc.edu.cn, lshuang@ustc.edu.cn, jmwu@ustc.edu.cn, wgabc@mail.ustc.edu.cn, wangliu@mail.ustc.edu.cn

Abstract

This paper studies delay-constraint topology control (DTC) in wireless sensor networks. That is, the delay of transmission is guaranteed through topology control. This problem has been proved to be NP-Completeness, and the previous works are in-adequate and lack of the theoretical analysis. In this paper, we present the DTCP algorithm with the minimal increased-energy method. We analyze that the energy cost of DTCP algorithm is at most (2n/T)α -- 2(2n/T)α-2 + 1 times as that of minimal spanning tree for the linear networks, where n is the number of the nodes in the network, T is the required delay from source to the sink node, α is determined by hardware and environments. Besides these, we design two localized algorithms for DTC problem. The experimental results show that DTCP algorithm can reduce about 31% energy over HBH algorithm under the same conditions.