Lexicographic Maxmin Fairness for Data Collection in Wireless Sensor Networks

The ad hoc deployment of a sensor network causes unpredictable patterns of connectivity and varied node density, resulting in uneven bandwidth provisioning on the forwarding paths. When congestion happens, some sensors may have to reduce their data rates. It is an interesting but difficult problem to determine which sensors must reduce rates and how much they should reduce. This paper attempts to answer a fundamental question about congestion resolution: What are the maximum rates at which the individual sensors can produce data without causing congestion in the network and unfairness among the peers? We define the maxmin optimal rate assignment problem in a sensor network, where all possible forwarding paths are considered. We provide an iterative linear programming solution, which finds the maxmin optimal rate assignment and a forwarding schedule that implements the assignment in a low-rate sensor network. We prove that there is one and only one such assignment for a given configuration of the sensor network. We also study the variants of the maxmin fairness problem in sensor networks.

[1]  Igor Elgorriaga,et al.  Low-power direct-sequence spread-spectrum modem architecture for distributed wireless sensor networks , 2001, ISLPED '01.

[2]  Özgür B. Akan,et al.  ESRT: event-to-sink reliable transport in wireless sensor networks , 2003, MobiHoc '03.

[3]  Edward W. Knightly,et al.  Opportunistic media access for multirate ad hoc networks , 2002, MobiCom '02.

[4]  T. Bewley.  Advances in Economic Theory: Fifth World Congress , 2009 .

[5]  Haiyun Luo,et al.  Self-coordinating localized fair queueing in wireless ad hoc networks , 2004, IEEE Transactions on Mobile Computing.

[6]  Henryk Wozniakowski,et al.  Complexity of linear programming , 1982, Oper. Res. Lett..

[7]  Sanjay Shakkottai,et al.  Hop-by-Hop Congestion Control Over a Wireless Multi-Hop Network , 2004, IEEE/ACM Transactions on Networking.

[8]  Peter Steenkiste,et al.  Routing high-bandwidth traffic in max-min fair share networks , 1996, SIGCOMM '96.

[9]  Baruch Awerbuch,et al.  Converging to approximated max-min flow fairness in logarithmic time , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[10]  Sandeep K. S. Gupta,et al.  Research challenges in wireless networks of biomedical sensors , 2001, MobiCom '01.

[11]  Jerry Zhao,et al.  Habitat monitoring: application driver for wireless communications technology , 2001, CCRV.

[12]  Vaduvur Bharghavan,et al.  Achieving MAC layer fairness in wireless packet networks , 2000, MobiCom '00.

[13]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[14]  Wendi B. Heinzelman,et al.  Adaptive protocols for information dissemination in wireless sensor networks , 1999, MobiCom.

[15]  Klara Nahrstedt,et al.  Maxmin Fair Routing in Connection-Oriented Networks , 1998 .

[16]  Nimrod Megiddo,et al.  Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..

[17]  Martin Heusse,et al.  Performance anomaly of 802.11b , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[18]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[19]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[20]  Na Yang,et al.  Congestion Avoidance Based on Lightweight Buffer Management in Sensor Networks , 2006 .

[21]  Haiyun Luo,et al.  A new model for packet scheduling in multihop wireless networks , 2000, MobiCom '00.

[22]  Raj Jain,et al.  Congestion control with explicit rate indication , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[23]  David E. Culler,et al.  A transmission control scheme for media access in sensor networks , 2001, MobiCom '01.

[24]  Nimrod Megiddo,et al.  Advances in Economic Theory: On the complexity of linear programming , 1987 .

[25]  Leandros Tassiulas,et al.  Maxmin fair scheduling in wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[26]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[27]  Parameswaran Ramanathan,et al.  Distributed target classification and tracking in sensor networks , 2003 .

[28]  Chenyang Lu,et al.  SPEED: a stateless protocol for real-time communication in sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[29]  Nathan Ickes,et al.  Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks , 2001, MobiCom '01.

[30]  Edward W. Knightly,et al.  End-to-end performance and fairness in multihop wireless backhaul networks , 2004, MobiCom '04.

[31]  Bhaskar Krishnamachari,et al.  Max-min fair collision-free scheduling for wireless sensor networks , 2004, IEEE International Conference on Performance, Computing, and Communications, 2004.

[32]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[33]  Peter Marbach,et al.  Priority service and max-min fairness , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[34]  Haiyun Luo,et al.  Ad Hoc Network Security , 2004, Mobile Computing Handbook.

[35]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[36]  Chieh-Yih Wan,et al.  CODA: congestion detection and avoidance in sensor networks , 2003, SenSys '03.

[37]  Edoardo S. Biagioni,et al.  The Application of Remote Sensor Technology To Assist the Recovery of Rare and Endangered Species , 2002, Int. J. High Perform. Comput. Appl..

[38]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[39]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

[40]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[41]  Leonidas J. Guibas,et al.  Locating and bypassing routing holes in sensor networks , 2004, IEEE INFOCOM 2004.

[42]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[43]  Deborah Estrin,et al.  Habitat monitoring: application driver for wireless communications technology , 2001, SIGCOMM LA '01.

[44]  Moe Z. Win,et al.  Impulse radio multipath characteristics and diversity reception , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[45]  Jean-Yves Le Boudec,et al.  Rate performance objectives of multihop wireless networks , 2004, IEEE INFOCOM 2004.

[46]  Brahim Bensaou,et al.  On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation , 2001, MobiHoc '01.

[47]  Jeannine Mosely,et al.  Asynchronous distributed flow control algorithms , 1984 .

[48]  H. T. Kung,et al.  Efficient location tracking using sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[49]  Leonidas Georgiadis,et al.  Lexicographically optimal balanced networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[50]  F. Bonomi,et al.  The rate-based flow control framework for the available bit rate ATM service , 1995, IEEE Netw..