On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks

Details On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks

2007-01-02

arxiv.org/abs/cs/0701001v1

Computer Science

Performance

10 pages (double column), 10 figures

Scientific paper

Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number of transmissions having low Signal to Interference and Noise density Ratio (SINR) at intended receivers, leading to low throughput. To overcome this problem, we propose a new algorithm for STDMA link scheduling based on a graph model of the network as well as SINR computations. The performance of our algorithm is evaluated in terms of spatial reuse and computational complexity. Simulation results demonstrate that our algorithm achieves better performance than existing algorithms.

Affiliated with

Also associated with

No associations

Rating

On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-189095