Sciweavers

Share
ECRTS
2007
IEEE

On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks

10 years 5 months ago
On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks
Since wireless ad-hoc networks use shared communication medium, accesses to the medium must be coordinated to avoid packet collisions. Transmission scheduling algorithms allocate time slots to the nodes of a network such that if the nodes transmit only during the allocated time slots, no collision occurs. For real-time applications, by ensuring deterministic channel access, transmission scheduling algorithms have the added significance of making guarantees on transmission latency possible. In this paper we present a distributed transmission scheduling algorithm for hexagonal wireless ad-hoc networks with a particular focus on Wireless Sensor Networks. Afforded by the techniques of ad-hoc networks topology control, hexagonal meshes enable trivial addressing and routing protocols. Our transmission scheduling algorithm constructs network-wide conflictfree packet transmission schedule for hexagonal networks, where the overhead of schedule construction in terms of message exchanges is ze...
Shashi Prabh, Tarek F. Abdelzaher
Added 02 Jun 2010
Updated 02 Jun 2010
Type Conference
Year 2007
Where ECRTS
Authors Shashi Prabh, Tarek F. Abdelzaher
Comments (0)
books