Design and analysis of an MST-based topology control algorithm
By Ning Li, Jennifer C. Hou, Lui Raymond Sha. IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 2003
1,053 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/11748e984fffd53311fcc0c562fa0d38219b7b56
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
- Michael M. Zavlanos
- George Pappas
- Magnus Egerstedt
- Roger Wattenhofer
- Aaron Zollinger
- J. Stankovic
- Jennifer C. Hou
- Wen Wang
Citations in the corpus
- A Survey on Topology Control in Wireless Sensor Networks: Taxonomy, Comparative Study, and Open Issues (2008, methodology): “[50] introduce the local MST (LMST), a fully distributed and localized protocol aimed at building an MSTlike topology.”
- LoRaWAN — A low power WAN protocol for Internet of Things: A review and opportunities (2017, background): “topology of a WSN considering the neighbor nodes under certain criteria [2].”
- Real-time communication and coordination in embedded sensor networks (2003, background): “Li et al. [86] present a minimum spanning tree-based topology control algorithm, called local minimum spanning tree (LMST), for wireless multihop networks.”
- Using mobile relays to prolong the lifetime of wireless sensor networks (2005, methodology): “Topology control methods such as [16, 17] use controllable transmission range to achieve the most energy efficient network topology.”
- Graph-theoretic connectivity control of mobile robot networks (2011, background): “Of great importance in this field is the power management of the nodes for optimal routing and lifetime of the network, while ensuring connectivity [18]– [23].”
- Does topology control reduce interference? (2004, methodology): “This process of developing local algorithms featuring more and more properties was continued partly based on CBTC, partly based on local versions of classic geometric constructions such as the Delaunay Triangulation [15] or the minimum spanning tree [14].”