Lexicographic Maxmin Fairness for Data Collection in Wireless Sensor Networks

Authors:
Shigang Chen;Yuguang Fang;Ye Xia
Affiliations:
-;IEEE;-
Venue:
IEEE Transactions on Mobile Computing
Year:
2007

Citing 28
Cited 7

Data networks

Data networks
Routing high-bandwidth traffic in max-min fair share networks

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Routing with guaranteed delivery in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Adaptive protocols for information dissemination in wireless sensor networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A new model for packet scheduling in multihop wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Achieving MAC layer fairness in wireless packet networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Habitat monitoring: application driver for wireless communications technology

SIGCOMM LA '01 Workshop on Data communication in Latin America and the Caribbean
Research challenges in wireless networks of biomedical sensors

Proceedings of the 7th annual international conference on Mobile computing and networking
A transmission control scheme for media access in sensor networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Low-power direct-sequence spread-spectrum modem architecture for distributed wireless sensor networks

ISLPED '01 Proceedings of the 2001 international symposium on Low power electronics and design
On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Fair medium access in 802.11 based wireless ad-hoc networks

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Opportunistic media access for multirate ad hoc networks

Proceedings of the 8th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Lexicographically optimal balanced networks

IEEE/ACM Transactions on Networking (TON)
Directed diffusion for wireless sensor networking

IEEE/ACM Transactions on Networking (TON)
ESRT: event-to-sink reliable transport in wireless sensor networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Fairness in Routing and Load Balancing

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Impact of interference on multi-hop wireless network performance

Proceedings of the 9th annual international conference on Mobile computing and networking
CODA: congestion detection and avoidance in sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
End-to-end performance and fairness in multihop wireless backhaul networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Congestion Avoidance Based on Lightweight Buffer Management in Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
Self-Coordinating Localized Fair Queueing in Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
A survey on sensor networks

IEEE Communications Magazine
The rate-based flow control framework for the available bit rate ATM service

IEEE Network: The Magazine of Global Internetworking

Steady and fair rate allocation for rechargeable sensors in perpetual sensor networks

Proceedings of the 6th ACM conference on Embedded network sensor systems
Event Based Fairness for Video Surveillance Sensor Networks

NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Joint energy management and resource allocation in rechargeable sensor networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Achieving Max-Min lifetime and fairness with rate allocation for data aggregation in sensor networks

Ad Hoc Networks
Perpetual and fair data collection for environmental energy harvesting sensor networks

IEEE/ACM Transactions on Networking (TON)
Fair sampling across network flow measurements

Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Qute: quality-of-monitoring aware sensing and routing strategy in wireless sensor networks

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.