Distributed Greedy Scheduling for Multihop Wireless Networks

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We consider the problem of scheduling in multihop wireless networks subject to interference constraints. We consider a graph based representation of wireless networks, where scheduled links adhere to the K-hop link interference model. We develop a distributed greedy heuristic for this scheduling problem. Further, we show that this distributed greedy heuristic computes the exact same schedule as the centralized greedy heuristic.

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

Distributed Greedy Scheduling for Multihop Wireless 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 Distributed Greedy Scheduling for Multihop Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Greedy Scheduling for Multihop Wireless Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-309834

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