3rd International ICST Conference on Communication and Networking in China

Research Article

Reliable relay node placement in wireless sensor network

  • @INPROCEEDINGS{10.1109/CHINACOM.2008.4685044,
        author={Gang Wang and Liusheng Huang and Hongli Xu and Yang Wang},
        title={Reliable relay node placement in wireless sensor network},
        proceedings={3rd International ICST Conference on Communication and Networking in China},
        publisher={IEEE},
        proceedings_a={CHINACOM},
        year={2008},
        month={11},
        keywords={},
        doi={10.1109/CHINACOM.2008.4685044}
    }
    
  • Gang Wang
    Liusheng Huang
    Hongli Xu
    Yang Wang
    Year: 2008
    Reliable relay node placement in wireless sensor network
    CHINACOM
    IEEE
    DOI: 10.1109/CHINACOM.2008.4685044
Gang Wang1,*, Liusheng Huang1,*, Hongli Xu1,*, Yang Wang1,*
  • 1: Department of Computer Science and Technology Suzhou Institute for Advanced Study University of Science and Technology of China
*Contact email: wgabc@mail.ustc.edu.cn, flshuang@ustc.edu.cn, hlxu@ustc.edu.cn, angyang@ustc.edu.cn

Abstract

To enhance the structure of networks, some costly but more powerful relay nodes are usually placed in wireless sensor networks. These nodes can prolong network lifetime and preserve connectivity of networks. So it makes sense to place relay nodes to guarantee the connectivity and reliability of wireless sensor networks. In this paper, we focus on the reliable relay node placement problem. We take set-cover based iterative actions to deal with the problem of placing minimum number of relay nodes to achieve connectivity and reliability, and then propose algorithms for two typical networks: single-tiered network and two-tiered network, respectively. We prove that the performance ratio of our algorithm for single-tiered network is no worse than (1+[(radic2D-2r)/2R])(lnn-lnlnn+thetas(1)), and performance ratio of our algorithm is no worse than (1+[radic2D/2R])(lnn-lnlnn+thetas(1)) for two-tiered network, where n is the number of initial sensor nodes, D is the size of the square sensing field, constants R > r > 0 are the communication radius of relay node and sensor node. At last, we carry out some experiments to show the nicer performance of our algorithm.