Abstract
Given a set of sensors in the plane, the strong minimum energy topology ( SMET) problem is to assign transmit power to each sensor such that the resulting topology containing only bidirectional links is strongly connected. This problem is known to be NP-hard. As this problem is very much significant from application point of view, several heuristic algorithms have been proposed. In this paper, we propose a new incremental power greedy heuristic for SMET problem, called Kruskal-incremental power greedy heuristic. We compare Kruskal-incremental power greedy heuristic with Prim-incremental power greedy heuristic, one of the most popular heuristics available in the literature, through extensive simulation. The simulation results suggest that Kruskal-incremental power greedy heuristic outperforms on an average the Prim-incremental power greedy heuristic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley Publishing Company, Reading (1987)
Akyildiz, I.F., Su, W., Sankarsubramanian, Y., Cayirci, E.: Wireless Sensor Networks: A Survey. Computer Networks 38, 393–422 (2002)
Cheng, X., Narahari, B., Simha, R., Cheng, M., Liu, D.: Strong minimum energy topology in wireless sensor networks: NP-Completeness and Heuristics. IEEE Transactions on Mobile Computing 2(3), 248–256 (2003)
Cheng, M.X., Cardei, M., Sun, J., Cheng, X., Wang, L., Xu, Y., Du, D.-Z.: Topology Control of Ad Hoc Wireless Networks for Energy Efficiency. IEEE Transactions on Computers 53(12), 1629–1635 (2004)
Gonzales, T. (ed.): Handbook of Approximation Algorithms and Metaheuristics, ch. 67. Chapman and Hall CRC, Boca Raton (2007)
Kirousis, L.M., Kranakis, E., Krizane, D., Pele, A.: Power consumption in packet radio networks. Theoretical Computer Science 243, 289–305 (2000)
Labrador, M.A., Wightman, P.M.: Topology Control in Wireless Sensor Networks. Springer, Heidelberg (2009)
Li, D., Du, H., Liu, L., Huang, S.C.H.: Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 541–550. Springer, Heidelberg (2008)
Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.S.: Algorithmic aspects of topology control problems for Ad Hoc Networks. Mobile Networks and Applications 10, 19–34 (2005)
Rappaport, T.S.: Wireless communications: Principle and Practice. Prentice-Hall, Englewood Cliffs (1996)
Santi, P.: Topology Control in wireless ad hoc and sensor Networks. ACM Computing Surveys 37(2), 164–194 (2005)
Santi, P.: Topology Control in wireless ad hoc and sensor Networks. Wiley Inter Science, Chichester (2005)
West, D.: Introduction to Graph Theory. PHI (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Panda, B.S., Pushparaj Shetty, D. (2011). An Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks. In: Natarajan, R., Ojo, A. (eds) Distributed Computing and Internet Technology. ICDCIT 2011. Lecture Notes in Computer Science, vol 6536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19056-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-19056-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19055-1
Online ISBN: 978-3-642-19056-8
eBook Packages: Computer ScienceComputer Science (R0)