Prolonging sensor network lifetime with energy provisioning and relay node placement

被引:35
作者
Hou, YT [1 ]
Shi, Y [1 ]
Sherali, HD [1 ]
Midkiff, SE [1 ]
机构
[1] Virginia Tech, Bradley Dept Elect & Comp Engn, Blacksburg, VA 24061 USA
来源
2005 SECOND ANNUAL IEEE COMMUNICATIONS SOCIETY CONFERENCE ON SENSOR AND AD HOC COMMUNICATIONS AND NETWORKS | 2005年
关键词
energy provisioning; relay node placement; power control; network lifetime; flow routing; wireless sensor networks;
D O I
10.1109/SAHCN.2005.1557084
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Wireless sensor networks that operate on batteries have limited network lifetime. There have been extensive recent research efforts on how to design protocols and algorithms to prolong network lifetime. However, due to energy constraint, even under the most efficient protocols and algorithms, the network lifetime may still be unable to meet the mission's requirements. In this paper, we consider the energy provisioning problem for a two-tier wireless sensor network. In addition to provisioning additional energy on the existing nodes, we also consider deploying relay nodes (RNs) into the network to mitigate network geometric deficiency and prolong network lifetime. We formulate the joint problem of energy provisioning and relay node placement (EP-RNP) into a mixed-integer nonlinear programming (MINLP) problem. Since an MINLP problem is NP-hard in general, and even the state-of-the-art software and techniques are unable of offer satisfactory solutions, we develop a heuristic algorithm, called SPINDS, to address this problem. We show a number of novel algorithmic design techniques in the design of SPINDS that effectively transforms a complex MINLP problem into linear programming (LP) problems without losing critical points in its search space. Through numerical results, we show that SPINDS offers very attractive solution and some important insights to the EP-RNP problem.
引用
收藏
页码:295 / 304
页数:10
相关论文
共 24 条
  • [1] Wireless sensor networks: a survey
    Akyildiz, IF
    Su, W
    Sankarasubramaniam, Y
    Cayirci, E
    [J]. COMPUTER NETWORKS, 2002, 38 (04) : 393 - 422
  • [2] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
  • [3] [Anonymous], 2004, The Fifth ACM International Symposium on Mobile Ad Hoc Networking and Computing
  • [4] Bazaraa M. S., 2013, NONLINEAR PROGRAMMIN
  • [5] BHASRDWAJ M, 2002, P IEEE INFOCOM, P1587
  • [6] BROWN TX, 2001, P ACM MOBIHOC LONG B, P128
  • [7] Chou J, 2003, IEEE INFOCOM SER, P1054
  • [8] AN OUTER-APPROXIMATION ALGORITHM FOR A CLASS OF MIXED-INTEGER NONLINEAR PROGRAMS
    DURAN, MA
    GROSSMANN, IE
    [J]. MATHEMATICAL PROGRAMMING, 1986, 36 (03) : 307 - 339
  • [9] Geoffrion A. M., 1972, Journal of Optimization Theory and Applications, V10, P237, DOI 10.1007/BF00934810
  • [10] BRANCH AND BOUND EXPERIMENTS IN CONVEX NONLINEAR INTEGER PROGRAMMING
    GUPTA, OK
    RAVINDRAN, A
    [J]. MANAGEMENT SCIENCE, 1985, 31 (12) : 1533 - 1546