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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Rangwala, S., Gummadi, R., Govindan, R., & Psounis, K. (2006). Interference-aware fair rate control in wireless sensor networks. In Proceedings of ACM SIGCOMM, Pisa, Italy.
Woo, A., & Culler, D. (2001). A transmission control scheme for media access in sensor networks. Mobicom., Rome, Italy.
Ee, C. T., & Bajcsy, R. (2004). Congestion control and fairness for many-to-one routing in sensor networks. In ACM SenSys, Baltimore, MD, USA.
Bertsekas, D., & Gallagher, R. (1992). Data networks. Prentice Hall.
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998). Rate control for communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49(3), 237–252.
Sridharan, A., & Krishnamachari, B. (2004). Max–min far collision-free scheduling for wireless sensor networks, Workshop Multihop Wireless Networks (MWN’04), IPCCC.
Tang, A., Wang, J., & Low, S. H. (2004). Is fair allocation always inefficient. Proceedings of IEEE Infocom (pp. 35–45). Hong Kong.
Boyd, S., & Vandenberghe, L. Convex optimization. Cambridge University Press, ISBN:0521833787.
Low, S. H., & Lapsley, D. E. (1999). Optimization flow control, I: Basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7(6), 861–875.
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007). Layering as optimization decomposition: A mathematical theory of network architectures. Proceedings of IEEE, 95, 255–312.
Chiang, M. (2005). Balancing transport and physical layers in wireless multihop networks: Jointly optimal congestion control and power control. IEEE Journal of Selected Areas in Communications, 23(1), 104–116.
Johansson, B., Soldatti, P., & Johansson, M. (2006). Mathematical decomposition techniques for distributed cross-layer optimization of data networks. IEEE JSAC, 24(8), 1535–1547.
Wang, X., & Kar, K. (2006). Cross-layer rate optimization for proportional fairness in multi-hop wireless networks with random access. IEEE JSAC, 24(8), 1548–1559.
Liao, R. R.-F., & Campbell, A. T. (2001). A utility-based approach for quantitative adaptation in wireless packet networks. Wireless Networks, 7, 541–557.
Curescu, C., & Nadjm-Tehrani, S. (2005). Price/utility-based optimization of resource allocation in ad hoc networks. IEEE Secon, Santa Clara, CA, USA.
Tan, K., Jiang, F., Zhang, Q., & Shen, S. (2005). Congestion control in multi-hop wireless networks. IEEE Secon, Santa Clara, CA, USA.
Wang, X., & Kar, K. (2004). Distributed algorithms for max–min fair rate allocation in Aloha networks. In Proceedings of Annual Allerton Conference, Urbana-Champaign.
Wang, X., Kar, K., & Pang, J.-S. (2006). Lexicographic max–min fairness in a wireless ad-hoc network with random access. In Proceedings of IEEE Conference on Decision and Control (CDC), San Diego.
Tassiulas, L., & Sarkar, S. (2002). Maxmin fair scheduling in wireless networks. In Proceedings of Infocom 2002 (pp. 763–772). New York, USA.
Ye, W., & Ordonez, F. (2005). A sub-gradient algorithm for maximal data extraction in energy-limited wireless sensor networks. Proceedings of the International Conference on Wireless Networks, Communications and Mobile Computing, 2, 958–963.
Acknowledgements
This work is supported in part by NSF grants numbered 0435505, 0347621, 0627028, 0430061 and 0325875.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sridharan, A., Krishnamachari, B. Maximizing network utilization with max–min fairness in wireless sensor networks. Wireless Netw 15, 585–600 (2009). https://doi.org/10.1007/s11276-007-0087-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11276-007-0087-9