Computer Science – Networking and Internet Architecture
Scientific paper
2007-04-27
Computer Science
Networking and Internet Architecture
14 pages, 5 figures, submitted to IEEE/ACM Transactions on Networking
Scientific paper
We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing total cost. In order to observe the fundamental duplexing constraint that co-located transmitters and receivers cannot operate simultaneously on the same frequency band, we first devise a spectrum allocation scheme that divides the whole spectrum into multiple sub-bands and activates conflict-free links on each sub-band. We show that the minimum number of required sub-bands grows asymptotically at a logarithmic rate with the chromatic number of network connectivity graph. A simple distributed and asynchronous algorithm is developed to feasibly activate links on the available sub-bands. Given a feasible spectrum allocation, we then design node-based distributed algorithms for optimally controlling the transmission powers on active links for each sub-band, jointly with traffic routes and user input rates in response to channel states and traffic demands. We show that under specified conditions, the algorithms asymptotically converge to the optimal operating point.
No associations
LandOfFree
Distributed Algorithms for Spectrum Allocation, Power Control, Routing, and Congestion Control in 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 Algorithms for Spectrum Allocation, Power Control, Routing, and Congestion Control in Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Algorithms for Spectrum Allocation, Power Control, Routing, and Congestion Control in Wireless Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-367265