Sciweavers

165 search results - page 18 / 33
» Capacity of Asynchronous Random-Access Scheduling in Wireles...
Sort
View
MOBIHOC
2001
ACM
14 years 7 months ago
Comparison between graph-based and interference-based STDMA scheduling
Spatial reuse TDMA is a fixed assignment access scheme for multi-hop radio networks. The idea is to increase network capacity by letting several radio terminals use the same time ...
Anders Hansson, Jimmi Grönkvist
MOBIHOC
2005
ACM
14 years 7 months ago
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks
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...
Theodoros Salonidis, Leandros Tassiulas
IWQOS
2004
Springer
14 years 1 months ago
Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks
— We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes...
Theodoros Salonidis, Leandros Tassiulas
GLOBECOM
2010
IEEE
13 years 5 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun
AINA
2006
IEEE
13 years 11 months ago
Efficient Packet Scheduler For Wireless Ad Hoc Networks With Switched Beam Antennas
Using beam forming antennas in ad hoc networks have been recently focused on, in order to improve the space reuse. This news context implies to revisit network algorithms because t...
Gilles Grimaud, Antoine Honore, Hervé Meuni...