Fair capacity sharing among multiple sinks in wireless sensor networks

8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The data transmission capacity of wireless sensor networks is known to be limited by both the hardware and the sink-based communication paradigm. In a multi-sink application scenario, simultaneous queries may generate traffic exceeding the transmission capacity of certain sensor nodes. In this paper, we intend to share the capacity of the sensors among multiple sinks by adjusting their query ranges, so that no sensor gets congested and every sink is able to monitor an area with desired data rate. Specifically, the max-min fairness will be ensured. An analytical model is presented and theoretical results for two-sink case is given. Then a distributed algorithm allowing sinks to approach the optimal query range with local knowledge is developed. Finally, simulation results are shown to illustrate the characteristics of this capacity sharing problem and to validate the effectiveness of our distributed algorithm. © 2007 IEEE.

Cite

CITATION STYLE

APA

Han, B., & Simon, G. (2007). Fair capacity sharing among multiple sinks in wireless sensor networks. In 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS. https://doi.org/10.1109/MOBHOC.2007.4428641

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free