This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Lexicographic Maxmin Fairness for Data Collection in Wireless Sensor Networks
July 2007 (vol. 6 no. 7)
pp. 762-776
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.
Index Terms:
Multipath maxmin fairness, wireless sensor networks, data collection applications, iterative linear programming.
Citation:
Shigang Chen, Yuguang Fang, Ye Xia, "Lexicographic Maxmin Fairness for Data Collection in Wireless Sensor Networks," IEEE Transactions on Mobile Computing, vol. 6, no. 7, pp. 762-776, July 2007, doi:10.1109/TMC.2007.1039
Usage of this product signifies your acceptance of the Terms of Use.