Name
Abstract | ||
|---|---|---|
The back-off algorithm is the key point that directly affects the message transmission delay, during the design of the MAC layer of the vehicular ad hoc network communication protocol. However, thanks to the back-off time is inversely proportional to the seizing channel ability of the nodes, the unreasonable choice of the contention window usually leads to the nodes "starvation". This paper investigates a back-off algorithm to deal with the unfairness problem by changing the size of the contention window by analyzing the connectivity of local topology and the polymerization degrees of the nodes. The algorithm can effectively reduce the node's unfairness problem. The simulation results show that: comparing to the Binary Exponential back-off algorithm and the Multiplicative Increase, Linear Decrease back-off algorithm, the proposed algorithm can significantly enhance the nodes' fairness, which also reduces the transmission delay. Copyright © 2011. |
Year | DOI | Venue |
|---|---|---|
2011 | null | Intelligent Automation & Soft Computing |
Field | DocType | Volume |
Graph theory,Topology,Exponential function,Multiplicative function,Computer science,Transmission delay,Computer network,Algorithm,Communication channel,Vehicular ad hoc network,Binary number,Communications protocol | Journal | 17 |
Issue | ISSN | Citations |
8 | null | 0 |
PageRank | References | Authors |
0.34 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huibin Wang | 1 | 0 | 0.34 |
| Lili Zhang | 2 | 0 | 0.34 |
| Jie Shen | 3 | 0 | 0.68 |
| Jie Yang | 4 | 0 | 0.34 |