Approximation Algorithms for Link Scheduling with Physical Interference Model in Wireless Multi-hop Networks

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages

Scientific paper

The link scheduling in wireless multi-hop networks is addressed. Different from most of work that adopt the protocol interference model which merely take consideration of packet collisions, our proposed algorithms use the physical interference model to reflect the aggregated signal to interference and noise ratio (SINR), which is a more accurate abstraction of the real scenario. We first propose a centralized scheduling method based on the Integer Linear Programming (ILP) and resolve it by an approximate solution based on the randomized rounding method. The probability bound of getting a guaranteed approximate factor is given. We then extend the centralized algorithm to a distributed solution, which is favorable in wireless networks. It is proven that with the distributed scheduling method, all links can transmit without interference, and the approximate ratio of the algorithm is also given.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Approximation Algorithms for Link Scheduling with Physical Interference Model in Wireless Multi-hop 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 Approximation Algorithms for Link Scheduling with Physical Interference Model in Wireless Multi-hop Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximation Algorithms for Link Scheduling with Physical Interference Model in Wireless Multi-hop Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-483800

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.