A New Packet Scheduling Scheme for Improving Fairness in Wireless Sensor Network (日韓合同ワークショップ 1st Korea-Japan Joint Workshop on Ubiquitous Computing and Networking Systems (ubiCNS 2005))

概要

論文の詳細を見る
In wireless sensor networks fair allocation of bandwidth among different nodes is one of the critical problems affecting the serviceability of the entire system. Fair bandwidth allocation mechanisms, like fair queuing, usually needs packet scheduling on a per flow basis, and the complexity may prevent them from being cost-effectively implemented and widely deployed. In this paper we propose a scheme that significantly reduces the implementation overhead yet still allows highly fair bandwidth allocation. This is achieved by letting the sensor node estimate the packet rate from each sensor device and attach a label at the packet header including the estimate. The sensor nodes relaying the packets maintain no per flow state; they use FIFO packet scheduling augmented by a probabilistic dropping algorithm that uses the packet label and an estimate of the aggregate traffic. The proposed scheme is evaluated and compared with earlier approaches using ns-2 simulator, and it reveals that the proposed scheme displays almost the same performance as the Deficit Round Robin(DRR) scheme, which has been recognized as the most effective one for achieving fairness but implementation overhead is quite high.
一般社団法人情報処理学会の論文
2005-06-09