Hypergraph Interference Models in  Wireless Ad–Hoc Networks with Low  Complexity Distributed Scheduling

A. Rama Prathap Reddy; D. Venkatesh; K. Ramesh

Volume : II, Issue : VI, June - 2013

Hypergraph Interference Models in Wireless Ad–Hoc Networks with Low Complexity Distributed Scheduling

A. Rama Prathap Reddy, D. Venkatesh, K. Ramesh

Abstract :

In this paper low complexity distributed scheduling approach is used in wireless Ad hoc networks to consider the con?icts caused by interference models. We explain the successful transmissions under any graph model can be improved by a hypergraph in the random network. The proposed one is different from the global signal-to- interferenceplus-noise ratio (SINR) model, the hypergraph model protect a localized graph-theoretic structure and, therefore utilize the existing graph-based efficient scheduling algorithms to be extended to the cumulative interference container. In some networks, a hypergraph can double the uniform throughput compared to the disk graph. As an application of the propose models, we believe the performance of maximal scheduling, i.e., a low complexity distributed scheduling algorithm achieves accuracy of throughput, in wireless networks. We propose a Queuing Model to get average throughput that gives finest stability of the link pair. The scope of the project is to develop a hypergraph based model for the scheduling problem in wireless networks which is quite flexible in modelling sum interference constraints, which can include both the graph model and the physical SINR model as special cases thus achieving the low complexity scheduling in Wireless Ad Hoc Networks.