Joint Scheduling, Power Control and Routing in Symmetric, One-dimensional, Multi-hop Wireless Networks

The traditional layered networking approach is not efficient in ad-hoc net-works. We are interested in finding a jointly optimal scheduling, routing and power control that achieves max-min fair rate allocation in a multi-hop wireless network. This is a highly complex non-convex optimization problem and it has been previously solved only for small networks. We restrict ourselves to symmet-ric networks with ring and line topologies, and we numerically solve the problem for a large number of nodes. We model point to point links as single user Gaussian channels. This type of channel approximates the performance of CDMA networks and performs better than the equivalent 802.11 network. We show that for smaller transmission powers it is optimal to relay over other nodes whereas for high powers it is optimal to send data directly to a destination. We also show when this transition occurs. We analyze the optimal schedule and find that if a node is active, it should send at the maximum power. Furthermore, in large networks the distance between nodes sending at the same time is never larger then five.


Note: The status of this file is: Anyone

 Record created 2004-08-31, last modified 2020-04-20

TR02_084 - Download fulltextPDF
IC_TECH_REPORT_200284 - Download fulltextPDF
Rate this document:

Rate this document:
(Not yet reviewed)