skip to main content
10.1145/2684464.2684490acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicdcnConference Proceedingsconference-collections
research-article

Boruvka-Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks

Published: 04 January 2015 Publication History

Abstract

Given a set of sensors, the strong minimum energy topology (SMET) problem is to assign transmission range to each sensor node so that the sum of the transmission range for all the sensor is minimum subject to the constraint that the network is strongly connected (there is a directed path between every pair of nodes in the Network). This problem is known to be NP-hard. As this problem has lots of practical applications, several approximation algorithms and heuristics have been proposed. In this paper, we propose a new heuristic called Boruvka-incremental power greedy heuristic based on the Boruvka algorithm for the minimum spanning tree (MST) problem for solving the SMET problem. We compare the performance of the Boruvka-incremental power greedy heuristic with Kruskal-incremental power greedy heuristic and Prim-incremental power greedy heuristic. Extensive simulation results illustrate that Boruvka heuristic outperforms the Kruskal-incremental power greedy heuristic and Prim-incremental power greedy heuristic. We have also proved that apart from providing significant improvement in terms of average power savings, Boruvka incremental power greedy heuristic takes O(n) time for planar graphs as compared to O(n log n) time taken by Kruskal-incremental power greedy heuristic and O(n2) time taken by Prim-incremental power greedy heuristic, where n is the number of nodes in the network.

References

[1]
I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. Wireless sensor networks: a survey. Computer networks, 38(4):393--422, 2002.
[2]
Y. P. Aneja, A. Bari, A. Jaekel, R. Chandrasekaran, and K. P. K. Nair. Minimum energy strong bidirectional topology for ad hoc wireless sensor networks. In IEEE International Conference on Communications, pages 1--5. IEEE, 2009.
[3]
B. K. Bhatta and D. P. Shetty. A parallel 2-approximation nc-algorithm for range assignment problem in packet radio networks. In Distributed Computing and Internet Technology, pages 137--144. Springer, 2013.
[4]
D. Bilò and G. Proietti. On the complexity of minimizing interference in ad-hoc and sensor networks. Theoretical Computer Science, 402(1):43--55, 2008.
[5]
X. Cheng, B. Narahari, R. Simha, M. X. Cheng, and D. Liu. Strong minimum energy topology in wireless sensor networks: Np-completeness and heuristics. IEEE Transactions on Mobile Computing, 2(3):248--256, 2003.
[6]
B. Fuchs. On the hardness of range assignment problems. Networks, 52(4):183--195, 2008.
[7]
E.-S. Jung and N. H. Vaidya. An energy efficient mac protocol for wireless lans. In INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, volume 3, pages 1756--1764, 2002.
[8]
L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power consumption in packet radio networks. Theoretical Computer Science, 243(1):289--305, 2000.
[9]
M. A. Labrador and P. M. Wightman. Topology Control in Wireless Sensor Networks: with a companion simulation tool for teaching and research. Springer, 2009.
[10]
E. L. Lloyd, R. Liu, M. V. Marathe, R. Ramanathan, and S. S. Ravi. Algorithmic aspects of topology control problems for ad hoc networks. Mobile Networks and applications, 10(1-2):19--34, 2005.
[11]
B. Panda and D. P. Shetty. An incremental power greedy heuristic for strong minimum energy topology in wireless sensor networks. In Distributed Computing and Internet Technology, pages 187--196. Springer, 2011.
[12]
T. S. Rappaport. Wireless communications: principles and practice, volume 2. Prentice Hall Communications Engineering and Emerging Technologies Series, 2002.
[13]
P. Santi. Topology control in wireless ad hoc and sensor networks. ACM Computing Surveys (CSUR), 37(2):164--194, 2005.

Cited By

View all
  • (2021)Interval graph based energy efficient routing scheme for a connected topology in wireless sensor networksWireless Networks10.1007/s11276-021-02782-027:8(5085-5104)Online publication date: 1-Nov-2021
  • (2017)New heuristics for strong minimum energy topology with reduced time complexity2017 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)10.1109/ANTS.2017.8384173(1-6)Online publication date: 17-Dec-2017

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICDCN '15: Proceedings of the 16th International Conference on Distributed Computing and Networking
January 2015
360 pages
ISBN:9781450329286
DOI:10.1145/2684464
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 January 2015

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Boruvka algorithm
  2. Graph Algorithms
  3. Minimum Spanning Tree
  4. Topology Control
  5. Wireless Sensor Networks

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

ICDCN '15

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)1
Reflects downloads up to 06 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Interval graph based energy efficient routing scheme for a connected topology in wireless sensor networksWireless Networks10.1007/s11276-021-02782-027:8(5085-5104)Online publication date: 1-Nov-2021
  • (2017)New heuristics for strong minimum energy topology with reduced time complexity2017 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)10.1109/ANTS.2017.8384173(1-6)Online publication date: 17-Dec-2017

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media