Credit based Fairness Control in Wireless Sensor Network

Fairness is an essential problem in congestion control, which is to ensure all data sources have equal or weighted access to end-to-end network bandwidth. In this paper, we propose a practical fairness model CFRC to allocate congested bandwidth based on the credit of each sensor source instead of uniformly. Credit represents the effective amount of sensed information of packet generated in sensor source. In CFRC, a low-cost credit computation method ACCA is proposed for each source node to compute its credit locally based on the sensed area of it and its neighbors; Aggregation node computes the credit of aggregated packets using simple sum operation. Furthermore, an interferer aware fair rate allocation algorithm IFRA is proposed in CFRC to allocated bandwidth not only among all upstream neighbors, but also among congested nodes and its interferers. Simulation results verify the performance of CFRC.

[1]  Brahim Bensaou,et al.  On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation , 2001, MobiHoc '01.

[2]  Moni Naor,et al.  Deniable Ring Authentication , 2002, CRYPTO.

[3]  Jacques Stern,et al.  Threshold Ring Signatures and Applications to Ad-hoc Groups , 2002, CRYPTO.

[4]  Jonathan Katz,et al.  Ring Signatures: Stronger Definitions, and Constructions without Random Oracles , 2005, IACR Cryptol. ePrint Arch..

[5]  Haiyun Luo,et al.  Self-coordinating localized fair queueing in wireless ad hoc networks , 2004, IEEE Transactions on Mobile Computing.

[6]  Ross J. Anderson,et al.  Two remarks on public key cryptology , 2002 .

[7]  Zhan Zhang,et al.  Localized algorithm for aggregate fairness in wireless sensor networks , 2006, MobiCom '06.

[8]  Ramesh Govindan,et al.  Interference-aware fair rate control in wireless sensor networks , 2006, SIGCOMM 2006.

[9]  Masayuki Abe,et al.  Efficient threshold signer ambiguous signatures from variety of keys , 2004 .

[10]  Ruzena Bajcsy,et al.  Congestion control and fairness for many-to-one routing in sensor networks , 2004, SenSys '04.

[11]  Yael Tauman Kalai,et al.  How to Leak a Secret: Theory and Applications of Ring Signatures , 2001, Essays in Memory of Shimon Even.

[12]  Hongwei Zhang,et al.  Reliable bursty convergecast in wireless sensor networks , 2005, MobiHoc '05.

[13]  Chieh-Yih Wan,et al.  CODA: congestion detection and avoidance in sensor networks , 2003, SenSys '03.

[14]  Mario Gerla,et al.  GloMoSim: a library for parallel simulation of large-scale wireless networks , 1998 .

[15]  H. Balakrishnan,et al.  Mitigating congestion in wireless sensor networks , 2004, SenSys '04.

[16]  Joseph K. Liu,et al.  Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups (Extended Abstract) , 2004, ACISP.

[17]  Özgür B. Akan,et al.  ESRT: event-to-sink reliable transport in wireless sensor networks , 2003, MobiHoc '03.