16 search results - page 1 / 4 » DRAND: : distributed randomized TDMA scheduling for wireless... |
MOBIHOC
2006
ACM
14 years 3 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
MOBIHOC
2005
ACM
14 years 3 months ago
2005
ACM
Abstract-We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility condition...
ALGOSENSORS
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. Wireless sensor networks benefit from communication protocols that reduce power requirements by avoiding frame collision. Time Division Media Access methods schedule tra...
WINET
2010
13 years 2 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
AINA
2010
IEEE
13 years 8 months ago
2010
IEEE
One important challenge in wireless ad hoc networks is to achieve collision free communication. Many MAC layer protocols have been proposed by considering various communication mod...