14 search results - page 3 / 3 » An O(log n) dominating set protocol for wireless ad-hoc netw... |
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
PODC
2011
ACM
12 years 7 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
PODC
2009
ACM
14 years 5 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...