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
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
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
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
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
Infrastructure tradeoffs for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Bandwidth sharing: objectives and algorithms
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
Real-World Experiences with an Interactive Ad Hoc Sensor Network
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
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
Mitigating congestion in wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
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
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
The emergence of networking abstractions and techniques in TinyOS
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Avoid 'void' in geographic routing for data aggregation in sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
Self-Coordinating Localized Fair Queueing in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Can CSMA/CA networks be made fair?
Proceedings of the 14th ACM international conference on Mobile computing and networking
Adjustable convergecast tree protocol for wireless sensor networks
Computer Communications
SMAC-based proportional fairness backoff scheme in wireless sensor networks
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Utilizing elevator for wireless sensor data collection in high-rise structure monitoring
Proceedings of the Nineteenth International Workshop on Quality of Service
Cluster Based Routing Protocol for Mobile Nodes in Wireless Sensor Network
Wireless Personal Communications: An International Journal
Efficient in-network aggregation for wireless sensor networks with fine grain location-based cluster
Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
Towards optimal rate allocation for data aggregation in wireless sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Achieving MAC-layer fairness in CSMA/CA networks
IEEE/ACM Transactions on Networking (TON)
End-to-end maxmin fairness in multihop wireless networks: Theory and protocol
Journal of Parallel and Distributed Computing
An algorithm on fairness verification of mobile sink routing in wireless sensor network
Personal and Ubiquitous Computing
Hi-index | 0.00 |
For data-collection applications in sensor networks, it is important to ensure all data sources have equal (or weighted) access to network bandwidth so that the base stations receive a complete picture about the monitored area. We point out the fairness problem in the current design of sensor networks, which may cause extremely biased bandwidth allocations. It is a challenge to design a fully distributed fairness solution due to the lack of global knowledge about the distribution of data sources and their routing paths. This paper proposes a new aggregate fairness model and a localized algorithm (called AFA) that implements the model. AFA is designed to work with any routing protocol. In particular, it allows the packets from a data source to follow an arbitrary set of forwarding paths to the base stations. This flexibility makes it considerably harder to allocate bandwidth fairly among different data sources. AFA solves the problem with only localized operations at the sensors. It is easy to implement, which is an attractive property for sensor networks. Moreover, the algorithm automatically adjusts a sensor's forwarding rate to avoid packet drops due to downstream congestion, which helps improve energy efficiency. We perform extensive simulations, demonstrating that the proposed algorithm can effectively improve end-to-end fairness.