skip to main content
10.1145/1839379.1839381acmotherconferencesArticle/Chapter ViewAbstractPublication PagescompsystechConference Proceedingsconference-collections
research-article

Topology control algorithms for wireless sensor networks: a critical survey

Published: 17 June 2010 Publication History

Abstract

In a densely deployed wireless sensor network, a single node has many neighbouring nodes with which direct communication would be possible when using sufficiently large transmission power. This is, however, not beneficial; high transmission power requires lots of energy, many neighbours are a burden for a MAC protocol, and routing protocols suffer from volatility in the network when nodes move around. To overcome these problem topology control can be applied. The idea is to deliberately restrict the set of nodes that are considered neighbours of a given node. This article surveys the most popular and efficient topology control algorithms for wireless ad hoc sensor networks.

References

[1]
I. F. Akyldiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, "A survey on sensor netowrks", IEEE Communications, vol. 40, no. 8, pp. 102--114, 2002.
[2]
G. Toussaint, "The relative neighborhood graph of a finite planar set", Pattern Recognition, vol. 12, pp. 261--268, 1980.
[3]
R. K. Gabriel and R. R. Sokal, "A new statistical approach to geographic variation analysis," Systematic Zoology, vol. 18, no. 3, pp. 259--278, September 1969.
[4]
N. Li, J. C. Hou and L. Sha, "Design and analysis of an MST-based topology control algorithm", IEEE Transactions on Wireless Communications, vol. 4, no. 3, pp. 1195--1206, 2005.
[5]
W. B. Heinzelman, A. P. Chandrakasan and H. Balakrishnan, "An application-specific protocol architecture for wireless microsensor networks", IEEE Transactions on Wireless Communications, vol. 1, no. 4, pp. 660--670, 2002.
[6]
O. Younis and S. Fahmy, "HEED: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks", IEEE Transactions on Mobile Computing, vol. 3, no. 4, pp. 366--379, 2004.
[7]
O. Younis, M. Krunz and S. Ramasubramanian, "Node clustering in wireless sensor networks: Recent developments and deployment challenges", IEEE Network, vol. 20, no. 3, pp. 20--25, May/Jun. 2006.
[8]
A. D. Amis, R. Prakash, T. H. P. Vuong and D. T. Huynh, "Max-min d-cluster formation in wireless ad hoc networks", Proceedings Annual Joint Conference of IEEE Computer and Communications Societies (INFOCOM), vol. 1, 2000, pp. 32--41.
[9]
S. Basagni, "Distributed clustering for ad hoc networks", Proceedings International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN), 1999, pp. 310--315.
[10]
S. Basagni, M. Mastrogiovanni, A. Panconesi and C. Petrioli, "Localized protocols for ad hoc clustering and backbone formation: A performance comparison", IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 4, pp. 292--306, 2006.
[11]
M. Chatterjee, S. Das and D. Turgut, "WCA: A weighted clustering algorithm for mobile ad hoc networks", ACM/Kluwer Cluster Computing, vol. 5, no. 2, pp. 193--204, 2002.
[12]
A. Qayyum, L. Viennot and A. Laouiti, "Multipoint relaying: An efficient technique for flooding in mobile wireless networks", INRIA, Tech. Rep. 3898, March 2000.
[13]
I. Stojmenovic, M. Seddigh and J. Zunic, "Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks", IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 1, pp. 14--25, 2002.
[14]
J. Wu and H. Li, "A dominating-set-based routing scheme in ad hoc wireless networks", Telecommunication Systems, vol. 18, no. 1--3, pp. 13--36, 2001.
[15]
A. Qayyum, L. Viennot and A. Laouiti, "Multipoint relaying for flooding broadcast messages in mobile wireless networks", Proceedings IEEE Hawaii Conference on System Sciences (HICSS), 2002.
[16]
B. Williams and T. Camp, "Comparison of broadcasting techniques for mobile ad hoc networks", Proceedings MobiHoc, 2002, pp. 194--205.
[17]
R. Gandhi and S. Parthasarathy, "Fast distributed well connected dominating sets for ad hoc networks," University of Maryland at College Park, Tech. Rep. CS-TR-4559, Tech. Rep., 2004.
[18]
D. Pennock, G. Flake, S. Lawrence, E. Glover and C. Giles, "Winners don't take all: Characterizing the competition for links on the Web", Proceedings National Academy of Sciences, vol. 99, no. 8, pp. 5207--5211, 2002.
[19]
B. Chen, K. Jamieson, H. Balakrishnan and R. Morris, "SPAN: An energy efficient coordination algorithm for topology maintenance in ad hoc networks", ACM/Kluwer Wireless Networks, vol. 8, no. 5, pp. 481--494, 2002.
[20]
S. Bandyopadhyay and E. J. Coyle, "An energy efficient hierarchical clustering algorithm for wireless sensor networks", Proceedings Annual Joint Conference of IEEE Computer and Communications Societies (INFOCOM), vol. 3, 2003, pp. 1713--1723.
[21]
J. Chang and L. Tassiulas, "Energy conserving routing in wireless ad hoc networks", Proceedings Annual Joint Conference of IEEE Computer and Communications Societies (INFOCOM), vol. 1, 2000, pp. 22--31.
[22]
D. Estrin, R. Govindan, J. Heidemann and S. Kumar, "Next century challenges: Scalable coordination in sensor networks", Proceedings ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), 1999.
[23]
L. Buttyan and P. Schaffer, "Panel: Position-based aggregator node election in wireless snsor networks", Proceedings IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS), 2007, pp. 1--9.
[24]
M. Ye, C. Li, G. Chen and J. Wu, "An energy efficient clustering scheme in wireless sensor networks", Ad Hoc and Sensor Wireless Networks, vol. 3, pp. 99--119, 2006.
[25]
C. Liu, K. Wu and J. Pei, "An energy-efficient data collection framework for wireless sensor networks by exploiting spatiotemporal correlation", IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 7, pp. 1010--1023, 2007.
[26]
A. Youssef, M. Younis, M. Youssef, and A. Agrawala, "Distributed formation of overlapping multi-hop clusters in wireless sensor networks", Proceedings 49th Annual IEEE Global Communication Conference (Globecom), 2006, pp. 1--6.
[27]
L. C. Freeman, "A set of measures of centrality based on betweenness", Sociometry, vol. 40, no. 1, pp. 35--41, March 1977.
[28]
L. C. Freeman, "Centrality in social networks: Conceptual clarification", Social Networks, vol. 1, no. 3, pp. 215--239, 1979.
[29]
U. Brandes, "A faster algorithm for betweenness centrality", Journal of Mathematical Sociology, vol. 25, pp. 163--177, 2001.
[30]
M. Girvan and M. E. Newman, "Community structure in social and biological networks", Proceedings National Academy of Sciences, vol. 99, no. 12, pp. 7821--7826, June 2002.
[31]
M. E. J. Newman and M. Girvan, "Finding and evaluating community structure in networks", August 2003.
[32]
E. W. Dijkstra, "A note on two problems in connexion with graphs", Numerische Mathematik, vol. 1, no. 1, pp. 269--271, December 1959. {Online}. Available: http://dx.doi.org/10.1007/BF01386390

Cited By

View all
  • (2020)Impact of Duty-CyclingSensor Technology10.4018/978-1-7998-2454-1.ch073(1557-1579)Online publication date: 2020
  • (2019)Improving Energy Efficiency in Wireless Sensor Networks through Virtual-Backbone–Based Topology Control MechanismJournal of Testing and Evaluation10.1520/JTE2018041147:6(20180411)Online publication date: 11-Mar-2019
  • (2018)Parallel genetic algorithm with elite and diverse cores for solving the minimum connected dominating set problem in wireless networks topology controlProceedings of the 2nd International Conference on Future Networks and Distributed Systems10.1145/3231053.3231080(1-9)Online publication date: 26-Jun-2018
  • Show More Cited By
  1. Topology control algorithms for wireless sensor networks: a critical survey

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    CompSysTech '10: Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
    June 2010
    575 pages
    ISBN:9781450302432
    DOI:10.1145/1839379
    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: 17 June 2010

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. clustering
    2. dominating sets
    3. topology control
    4. wireless sensor networks

    Qualifiers

    • Research-article

    Conference

    CompSysTech '10

    Acceptance Rates

    Overall Acceptance Rate 241 of 492 submissions, 49%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

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

    Other Metrics

    Citations

    Cited By

    View all
    • (2020)Impact of Duty-CyclingSensor Technology10.4018/978-1-7998-2454-1.ch073(1557-1579)Online publication date: 2020
    • (2019)Improving Energy Efficiency in Wireless Sensor Networks through Virtual-Backbone–Based Topology Control MechanismJournal of Testing and Evaluation10.1520/JTE2018041147:6(20180411)Online publication date: 11-Mar-2019
    • (2018)Parallel genetic algorithm with elite and diverse cores for solving the minimum connected dominating set problem in wireless networks topology controlProceedings of the 2nd International Conference on Future Networks and Distributed Systems10.1145/3231053.3231080(1-9)Online publication date: 26-Jun-2018
    • (2018)Efficient Maintenance of Shortest Distances in Dynamic GraphsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2017.277223330:3(474-487)Online publication date: 1-Mar-2018
    • (2017)Reliable and energy efficient topology control in probabilistic Wireless Sensor Networks via multi-objective optimizationThe Journal of Supercomputing10.1007/s11227-016-1946-x73:6(2632-2656)Online publication date: 1-Jun-2017
    • (2016)Impact of Duty-CyclingInternational Journal of Business Data Communications and Networking10.4018/IJBDCN.201601010212:1(16-35)Online publication date: Jan-2016
    • (2016)Efficient Maintenance of All-Pairs Shortest DistancesProceedings of the 28th International Conference on Scientific and Statistical Database Management10.1145/2949689.2949713(1-12)Online publication date: 18-Jul-2016
    • (2015)A Topology Control Algorithm for Sensor Networks Based on Robust OptimizationInternational Journal of Distributed Sensor Networks10.1155/2015/14070911:1(140709)Online publication date: Jan-2015
    • (2015)A Dynamic Topology Control Algorithm for Wireless Sensor NetworksProceedings of the 14th International Conference on Ad-hoc, Mobile, and Wireless Networks - Volume 914310.1007/978-3-319-19662-6_1(3-18)Online publication date: 29-Jun-2015
    • (2015)Sensory Data Gathering for Road Traffic Monitoring: Energy Efficiency, Reliability, and Fault ToleranceModeling and Processing for Next-Generation Big-Data Technologies10.1007/978-3-319-09177-8_4(89-112)Online publication date: 2015
    • Show More Cited By

    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