14 search results - page 1 / 3 » An O(log n) dominating set protocol for wireless ad-hoc netw... |
MOBIHOC
2008
ACM
14 years 3 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
FSTTCS
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
MOBIHOC
2001
ACM
14 years 3 months ago
2001
ACM
In most studies on mobile ad hoc networks (MANET), simulation models are used for the evaluation of devices and protocols. Typically, such simulations focus on the specific higher...
JPDC
2007
13 years 4 months ago
2007
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
INFOCOM
2012
IEEE
11 years 6 months ago
2012
IEEE
Abstract—Capacity scaling laws offer fundamental understanding on the trend of user throughput behavior when the network size increases. Since the seminal work of Gupta and Kumar...