Energy-Efficient Broadcast and Multicast Trees in Wireless Networks

By J. Wieselthier, G. Nguyen, Anthony Ephremides. Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 2000

1,437 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/cd4e06d8f5ad2c34816b523ca67eb398fdaa627b

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

Citations in the corpus

Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks (2002, neutral): “Index Terms—Broadcasting, ad hoc networks, dominating sets.”
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues (2002, methodology): “Here we use the idea of the normalized tree power [25].”
Minimum-energy multicast in mobile ad hoc networks using network coding (2004, background): “However, the problem of constructing a minimum-energy multicast tree in a wireless ad hoc network is NP-hard; see, e.g., [ 1 ]n[3].”
Minimum-energy broadcast routing in static ad hoc wireless networks (2001, methodology): “Introduction Ad hoc wireless networks have received significant attention in recent years due to their potential applications in battlefield, emergency disaster relief and etc [7] [8].”
A Survey of Energy Efficient Network Protocols for Wireless Networks (2001, methodology): “Another method to improve energy performance is to take advantage of the broadcast nature of the network for broadcast and multicast traffic as in [52,66].”
Resilient Network Coding in the Presence of Byzantine Adversaries (2008, neutral): “Researchers have extended the above results to a variety of areas including wireless networks [25], [17], [18], energy [28], secrecy [2], content distribution [8], and distributed storage [16].”
Connected K-coverage problem in sensor networks (2004, background): “Connectivity is also a fundamental issue in wireless ad hoc environment, and many schemes have been proposed to address the issue of energy efficiency while maintaining connectivity in the network topology ([6], [7], [8]).”
Underground Structure Monitoring with Wireless Sensor Networks (2007, background): “This beacon mechanism benefits from the “wireless multicast advantage” (WMA) [23] in WSNs and could effectively reduce the traffic cost down to O(n).”
A Power Control MAC Protocol for Ad Hoc Networks (2002, methodology): “Power control has been also used to establish energy efficient spanning trees for multicasting and broadcasting [25,26].”
Hop-by-Hop Congestion Control Over a Wireless Multi-Hop Network (2004, background): “Tree architectures are also popular in Bluetooth based ad hoc networks [32], [33], as well as in broadcasting applications [34].”
Localized minimum-energy broadcasting in ad-hoc networks (2003, methodology): “Two of these protocols are globalized: MST Topology Control Protocol (MTCP) and the Broadcast Incremental Power (BIP) from [9] (enhanced with the sweep operation).”
A Survey on Topology Control in Wireless Sensor Networks: Taxonomy, Comparative Study, and Open Issues (2008, background): “In addition, the computational complexity of RA has been analyzed in [66].”