XTC: a practical topology control algorithm for ad-hoc networks
By Roger Wattenhofer, Aaron Zollinger. 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., 2004
330 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/eaa72f4a97b8cdc65d16a73f84fb36cee39b39f4
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Roger Wattenhofer
- Michael M. Zavlanos
- Magnus Egerstedt
- George Pappas
- Paramvir Victor Bahl
- Yi-Min Wang
- Joseph Y. Halpern
- Erran L. Li
Citations in the corpus
- Topology control for wireless sensor networks (2003, neutral): “[18] Wattenhofer R, Zollinger A.”
- A cone-based distributed topology-control algorithm for wireless multi-hop networks (2005, background): “The only improvement toward this end that we are aware of is the XTC topology-control algorithm [28].”
- A Survey on Distributed Topology Control Techniques for Extending the Lifetime of Battery Powered Wireless Sensor Networks (2013, background): “This feature has been mentioned in [66], [82] as an important criterion for designing a topology control algorithm.”
- Survey of Important Issues in UAV Communication Networks (2016, background): “The protocol does not need location information [102].”
- Distributed connectivity control of mobile networks (2007, background): “Closely related to the topics discussed in this paper, is also work in ad-hoc sensor networks, involving cone-based topology control [7] as well as distributed algorithms that do not assume exact knowledge of agent positions [8], which, however, focuses more on the power consumption and routing prob”
- Graph-theoretic connectivity control of mobile robot networks (2011, background): “This line of research has given rise to connectivity or topology control algorithms that regulate the transmission power of the nodes and, therefore, their communication range, and range from cone-based approaches [24], [25] to distributed algorithms that do not involve any position information of t”