Message-optimal connected dominating sets in mobile ad hoc networks

By Khaled M. Alzoubi, Pengjun Wan, Ophir Frieder. ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2002

401 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Geometric ad-hoc routing: of theory and practice (2003, neutral): “[1, 9, 25]).”
Ad hoc networks beyond unit disk graphs (2003, methodology): “Many of them are based on dominating sets [1, 10, 11, 13, 14, 19, 29] or angle of arrival [30].”
Does topology control reduce interference? (2004, background): “Most of these proposals are based on (connected) dominating sets [1, 2, 9] and focus on locality and provable properties, such as [12], which achieves a non-trivial approximation of the minimum dominating set in constant time.”
Connected sensor cover: self-organization of sensor networks for efficient query execution (2003, background): “The work in wireless network research community [9, 18, 26, 1, 7] has primarily focussed on developing energy-efficient distributed algorithms to construct a nearoptimal dominating connected set.”
XTC: a practical topology control algorithm for ad-hoc networks (2004, background): “The most popular and promising approaches are based on (connected) dominating sets [1, 8, 10].”
Worst-Case optimal and average-case efficient geometric ad-hoc routing (2003, methodology): “(Using clustering techniques a similar result can be achieved without the Ω(1)-model [1, 9, 18].”