This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics
July-September 2003 (vol. 2 no. 3)
pp. 248-256
ASCII Text
x 
 
Xiuzhen Cheng, Bhagirath Narahari, Rahul Simha, Maggie Xiaoyan Cheng, Dan Liu, "Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics," IEEE Transactions on Mobile Computing, vol. 2, no. 3, pp. 248-256, July-September, 2003.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2003.1233530,
author = {Xiuzhen Cheng and Bhagirath Narahari and Rahul Simha and Maggie Xiaoyan Cheng and Dan Liu},
title = {Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics},
journal ={IEEE Transactions on Mobile Computing},
volume = {2},
number = {3},
issn = {1536-1233},
year = {2003},
pages = {248-256},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2003.1233530},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics
IS - 3
SN - 1536-1233
SP248
EP256
EPD - 248-256
A1 - Xiuzhen Cheng,
A1 - Bhagirath Narahari,
A1 - Rahul Simha,
A1 - Maggie Xiaoyan Cheng,
A1 - Dan Liu,
PY - 2003
KW - Minimum energy topology
KW - power control
KW - wireless sensor networks
KW - NP-Completeness
KW - incremental power heuristic.
VL - 2
JA - IEEE Transactions on Mobile Computing
ER -
 

Abstract—Wireless sensor networks have recently attracted lots of research effort due to its wide range of applications. These networks must operate for months or years. However, the sensors are powered by battery, which may not be possible to be recharged after they are deployed. Thus, energy-aware network management is extremely important. In this paper, we study the following problem: Given a set of sensors in the plane, assign transmit power to each sensor such that the induced topology containing only bidirectional links is strongly connected. This problem is significant in both theory and application. We prove its NP-Completeness and propose two heuristics: power assignment based on minimum spanning tree (denoted by MST) and incremental power. We also show that MST heuristic has a performance ratio of 2. Simulation study indicates that the performance of these two heuristics does not differ very much, but, in average, the incremental power heuristic is always better than MST.

[1] NS2 page,http://www.isi.edu/nsnamns/, 2003.
[2] GloMoSim page,http://pcl.cs.ucla.edu/projectsglomosim/, 2003.
[3] G. Asada et al., Wireless Integrated Network Sensors: Low Power Systems on a Chip Proc. European Solid-State Circuits Conf. (ESSCIRC), 1998.
[4] S.A. Borbash and E.H. Jennings, Distributed Topology Control Algorithm for Multihop Wireless Networks Proc. 2002 Int'l Joint Conf. Neural Networks, IJCNN, vol. 1, pp. 355-360, 2002.
[5] M. Cagalj, J.-P. Hubaux, and C. Enz, Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distributed Issues Proc. MobiCom 2002, pp. 172-182, 2002.
[6] W.T. Chen and N.F. Huang, The Strongly Connecting Problem on Multihop Packet Radio Networks IEEE Trans. Comm., vol. 37, no. 3, Mar. 1989.
[7] X. Cheng, H.D. Du, X. Jia, and G. Xue, Virtual Backbone-Based Routing in Multihop Ad Hoc Wireless Networks submitted for publication, 2003.
[8] X. Cheng, D.-Z. Du, L. Wang, and B. Xu, Relay Sensor Placement in Wireless Sensor Networks submitted for publication, 2003.
[9] A.E.F. Clementi, P. Penna, and R. Silvestri, “Hardness Results for the Power Range Assignment Problem in Packet Radio Networks,” Proc. Second Int'l Workshop Approximation Algorithms for Combinatorial Optimization Problems (RANDOM/APPROX '99), pp. 197-208, 1999.
[10] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, chapter 37, pp. 978-983. The MIT Press, McGraw-Hill Book Company, 1992.
[11] F.O. Eynde et al., A Fully-Integrated Single-Chip SOC for Bluetooth Proc. IEEE International Solid-State Circuits Conf. (ISSCC '01), pp. 196-197, vol. 446, 2001.
[12] M.R. Garey and D.S. Johnson, The Rectilinear Steiner Tree Problem is NP-Complete SIAM J. Applied Math., vol. 32, pp. 826-834, 1977.
[13] L. Hu, Topology Control for Multihop Packet Radio Networks IEEE Trans. Comm., vol 41, no. 10, pp. 1474-1481, 1993.
[14] D.B. Johnson and D.A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks Mobile Computing, pp. 153-181, T. Imielinski and H. Korth, ed., Kluwer Academic, 1996.
[15] E.S. Jung and N.H. Vaidya, An Energy Efficient MAC Protocol for Wireless LANs Proc. INFOCOM '02, vol. 3, pp. 1756-1764, 2002.
[16] L. Li, J.H. Halpern, P. Bahl, Y. Wang, and R. Wattenhofer, “Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multi-Hop Networks,” Proc. ACM ACM Symp. Principles of Distributed Computing (PODC '01), 2001.
[17] E.L. Lloyd, R. Liu, M.V. Marathe, R. Ramanathan, and S.S. Ravi, Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks Proc. MobiCom '02, pp. 123-134, 2002.
[18] N. Lynch, Distributed Algorithms. New Jersey, Morgan Kaufman, 1996.
[19] R. Min, M. Bhardwaj, S.-H. Cho, N. Ickes, E. Shih, A. Sinha, A. Wang, and A. Chandrakasan, Energy-Centric Enabling Technologies for Wireless Sensor Networks IEEE Wireless Comm., vol. 9, no. 4, pp. 28-39, 2002.
[20] C. Perkins and E. Royer, Ad Hoc on Demand Distance Vector (AODV) Routing Proc. Second IEEE Workshop Mobile Computing Systems and Applications, pp. 90-100, Feb. 1999.
[21] G. Pottie and W. Kaiser, "Wireless Integrated Network Sensors," Comm. ACM, vol. 43, no. 5, May 2000, pp. 51-58.
[22] R. Prakash, Unidirectional Links Prove Costly in Wireless Ad Hoc Networks Proc. Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIAL-M '99), pp. 15-22, 1999.
[23] V. Raghunathan, C. Schurgers, S. Park, and M. Srivastava, “Energy-Aware Wireless Sensor Networks,” IEEE Signal Processing, vol. 19, no. 2, pp. 40-50, Mar. 2002.
[24] R. Ramanathan and R. Rosales-Hain, Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Proc. 19th Ann. Joint Conf. IEEE Computer and Comm. Soc. (INFOCOM), pp. 404-413, Mar. 2000.
[25] V. Ramasubramanian, R. Chandra, and R. Mosse, Providing a Bidirectional Abstraction for Unidirectional Ad Hoc Networks Proc. INFOCOM '02, vol. 3, pp. 1258-1267, 2002.
[26] T.S. Rappaport, Wireless Communications: Principles&Practice. Prentice Hall, 1996.
[27] V. Rodoplu and T.H. Meng, “Minimum Energy Mobile Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp. 1333-1344, Aug. 1999.
[28] P. Santi, D.M. Blough, and F. Vainstein, “A Probabilistic Analysis for the Range Assignment Problem in Ad Hoc Networks,” Proc. ACM MobiHoc '01, pp. 212-220, 2001.
[29] P.-J. Wan, G. Calinescu, X. Li, and O. Frieder, “Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks,” Proc. IEEE INFOCOM 2001, 2001.
[30] R. Wattenhofer, L. Li, P. Bahl, and Y.-M. Wang, Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks Proc. Infocom 2001, Apr. 2001.
[31] W. Ye, J. Heidemann, and D. Estrin, An Energy-Efficient MAC Protocol for Wireless Sensor Networks Proc. INFOCOM '02, vol. 3, pp. 1567-1576, 2002.

Index Terms:
Minimum energy topology, power control, wireless sensor networks, NP-Completeness, incremental power heuristic.
Citation:
Xiuzhen Cheng, Bhagirath Narahari, Rahul Simha, Maggie Xiaoyan Cheng, Dan Liu, "Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics," IEEE Transactions on Mobile Computing, vol. 2, no. 3, pp. 248-256, July-Sept. 2003, doi:10.1109/TMC.2003.1233530
Usage of this product signifies your acceptance of the Terms of Use.