HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >
Please use this identifier to cite or link to this item:
|Title: ||Level the buffer wall : fair channel assignment in wireless sensor networks|
|Authors: ||Yang, Yanyan|
Ni, Lionel M.
Buffer wall phenomenon
|Issue Date: ||Oct-2009 |
|Citation: ||Proceedings IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS'09, 12-15 October 2009, Macau, China, p. 208-216|
|Abstract: ||In this paper, we study the trade-off between network throughput and fairness in a multi-channel enabled wireless sensor network (WSN). Traditional approaches attempt to solve the two problems in an isolated manner without a joint design. Our empirical studies show that solutions to these two problems cannot be simply combined. Away from the traditional belief, the number of channels in WSNs with Telosb sensor nodes operating at 2.4GHz band can be up to 83 and the orthogonal channels can be up to 27. The switching overhead in terms of time and energy cost is relatively small. Furthermore, we observe a buffer wall phenomenon which is one of the main reasons causing network throughput degradation and unfairness. To strike a better trade-off between the network throughput and fairness, we design a novel multi-channel assignment algorithm, targeting at maximizing the minimal data sending rate. The key idea of the proposed algorithm is to level down the buffer wall so that the buffer usage of nodes can be evenly distributed. As such, the bandwidth of bottleneck nodes can be fully utilized and the unfairness due to the node locality can be removed. We prove that the achieved data sending rate is no less than 4/9 of the optimal rate in theory. Our experimental results show that the minimal data sending rate can be improved by up to 100% comparing with the existing work TMCP.|
|Rights: ||© 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.|
|Appears in Collections:||CSE Conference Papers|
Files in This Item:
All items in this Repository are protected by copyright, with all rights reserved.