Sciweavers

Share
GLOBECOM
2007
IEEE

Colouring Link-Directional Interference Graphs in Wireless Ad Hoc Networks

9 years 17 days ago
Colouring Link-Directional Interference Graphs in Wireless Ad Hoc Networks
—In this paper, we clarify inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (l-graph). Most of the interference graphs in the literature simply model the DATA and ACK traffic of a link by a single vertex. They fail to capture the link-directionalities. In fact, some instances of directional traffic can actually transmit simultaneously but are prohibited by the interference graphs. Thus, in our link-directional interference graph, a link is represented by two vertices, one for DATA traffic and the other for ACK traffic. We then apply a colouring algorithm in the l-graphs. The colouring results provide insights in order to boost network capacities in TDMA or FDMA ad-hoc networks. We show that the network capacities can be improved by 100% in a triangular topology and 33% in a lattice topology. Simulations also show that a distributed dual channel protocol assigning channels according to link-directionalities can boost the capacities by 7...
Ping Chung Ng, David J. Edwards, Soung Chang Liew
Added 02 Jun 2010
Updated 02 Jun 2010
Type Conference
Year 2007
Where GLOBECOM
Authors Ping Chung Ng, David J. Edwards, Soung Chang Liew
Comments (0)
books