Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

By Ivan Stojmenovic, Mahtab Seddigh, J. Zunic. IEEE Trans. Parallel Distributed Syst., 2002

966 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

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

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

1. Jie Wu
2. Ivan Stojmenovic
3. Ü. Özgüner
4. Fei Dai
5. Yi Zou
6. Eylem Ekici
7. Füsun Özgüner
8. Gökhan Korkmaz

Citations in the corpus

• Message-optimal connected dominating sets in mobile ad hoc networks (2002, background): “The virtual backbones proposed in [8] and [6] are relatively easier to be maintained, but suffer from poor quality.”
• Connectivity Based k-Hop Clustering in Wireless Networks (2002, methodology): “Such application of highest degree clustering for k = 1 is given in by Stojmenovic et al. [ 31 ].”
• Geometric spanners for wireless ad hoc networks (2002, neutral): “studied [20], [21], [22], [23], [24], [7], [8], [25].”
• Position-based routing in ad hoc networks (2002, methodology): “If a message is reasonably “short,” it can be broadcast (i.e., flooded) using an optimal broad-casting scheme (non-blind broadcasting schemes are discussed in [3]).”
• Urban multi-hop broadcast protocol for inter-vehicle communication systems (2004, methodology): “In [3],[4], methods to eliminate redundant packets while broadcasting is proposed using the topology information.”
• Localized minimum-energy broadcasting in ad-hoc networks (2003, methodology): “This new “trick” is similar to neighbor elimination scheme [3], [26] but only applied to neighbors in RNG graph.”
• On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks (2001, background): “Small connected dominating set also corresponds to a small forward node set in broadcasting [7] which minimize overall energy consumption per broadcast.”
• A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks (2005, background): “It is only necessary to keep nodes in CDS active for routing packets on the network.”
• New distributed algorithm for connected dominating set in wireless ad hoc networks (2002, methodology): “Several algorithms for MIS were described in [11], which can be generalized to the following framework: Each node has a unique rank parameter such as the ID only [8][9], an ordered pair of degree and ID [3], an order pair of degree and location [11].”
• On reducing broadcast redundancy in ad hoc wireless networks (2002, background): “Efficient broadcasting in ad hoc wireless networks has been extensively studied in [1], [2], [7], [9], [11], [13], [15].”