Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/SNPD.2007.219 | SNPD (1) |
Field | DocType | Volume |
Max-min fairness,Key distribution in wireless sensor networks,Bandwidth allocation,Computer science,Network packet,Computer network,Real-time computing,Dynamic bandwidth allocation,Fairness measure,Network congestion,Network traffic control,Distributed computing | Conference | 1 |
Issue | ISBN | Citations |
null | 0-7695-2909-7 | 3 |
PageRank | References | Authors |
0.41 | 15 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shanshan Li | 1 | 295 | 53.11 |
| Xiangke Liao | 2 | 622 | 74.79 |
| Shaoliang Peng | 3 | 176 | 32.05 |
| Peidong Zhu | 4 | 145 | 36.81 |
| Jie Jiang | 5 | 55 | 6.91 |