Maximizing network utilization with max---min fairness in wireless sensor networks

Authors:
Avinash Sridharan;Bhaskar Krishnamachari
Affiliations:
Department of Electrical Engineering, University of Southern California, Los Angeles, USA;Department of Electrical Engineering, University of Southern California, Los Angeles, USA
Venue:
Wireless Networks
Year:
2009

Citing 10
Cited 3

Data networks

Data networks
Optimization flow control—I: basic algorithm and convergence

IEEE/ACM Transactions on Networking (TON)
A transmission control scheme for media access in sensor networks

Proceedings of the 7th annual international conference on Mobile computing and networking
A utility-based approach for quantitative adaptation in wireless packet networks

Wireless Networks
Convex Optimization

Convex Optimization
Congestion control and fairness for many-to-one routing in sensor networks

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Interference-aware fair rate control in wireless sensor networks

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Balancing transport and physical Layers in wireless multihop networks: jointly optimal congestion control and power control

IEEE Journal on Selected Areas in Communications
Mathematical decomposition techniques for distributed cross-layer optimization of data networks

IEEE Journal on Selected Areas in Communications
Cross-layer rate optimization for proportional fairness in multihop wireless networks with random access

IEEE Journal on Selected Areas in Communications

Stabilization of max-min fair networks without per-flow state

Theoretical Computer Science
Cluster Based Routing Protocol for Mobile Nodes in Wireless Sensor Network

Wireless Personal Communications: An International Journal
Rate control for heterogeneous wireless sensor networks: Characterization, algorithms and performance

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The state-of-the-art for optimal data-gathering in wireless sensor networks is to use additive increase algorithms to achieve fair rate allocation while implicity trying to maximize network utilization. For the quantification of the problem we present a receiver capacity model to capture the interference existing in a wireless network. We also provide empirical evidence to motivate the applicability of this model to a real CSMA based wireless network. Using this model, we explicitly formulate the problem of maximizing the network utilization subject to a max---min fair rate allocation constraint in the form of two coupled linear programs. We first show how the max---min rate can be computed efficiently for a given network. We then adopt a dual-based approach to maximize the network utilization. The analysis of the dual shows the sub-optimality of previously proposed additive increase algorithms with respect to bandwidth efficiency. Although in theory a dual-based sub-gradient search algorithm can take a long time to converge, we find empirically that setting all shadow prices to an equal and small constant value, results in near-optimal solutions within one iteration (within 2% of the optimum in 99.65% of the cases). This results in a fast heuristic distributed algorithm that has a nice intuitive explanation--rates are allocated sequentially after rank ordering flows based on the number of downstream receivers whose bandwidth they consume. We also investigate the near optimal performance of this heuristic by comparing the rank ordering of the source rates obtained from the heuristic to the solutions obtained by solving the linear program.