36 search results - page 1 / 8 » A probabilistic analysis for the range assignment problem in... |
MOBIHOC
2001
ACM
14 years 4 months ago
2001
ACM
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
SIROCCO
2004
13 years 6 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
IFIP
2003
Springer
13 years 10 months ago
2003
Springer
The design of an efficient Medium Access Control (MAC) is challenging in ad-hoc networks where users can enter, leave or move inside the network without any need for prior configu...
ICOIN
2005
Springer
13 years 10 months ago
2005
Springer
Multi-hop ad hoc wireless networks generally use the IEEE 802.11 Distributed Coordination Function (DCF) MAC protocol, which utilizes the request-to-send/clear-to-send (RTS/CTS) me...
WINET
2010
13 years 3 months ago
2010
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...