Name
Abstract | ||
|---|---|---|
Recent research activities have shown that opportunistic routing can achieve considerable performance gains in Cognitive Radio Ad hoc Networks (CRAHNs). Most of these studies focused on designing appropriate metrics to select and prioritize the forwarding candidates. However, in multiple-flow networks, a small number of nodes may always be with the higher priority order for different flows. Thus, some nodes may easily become overloaded with too much traffic and be severely congested. To overcome this problem, we propose a load balancing opportunistic routing (LBOR) scheme to maximize the total throughput of the whole network. We first formulate the problem of maximizing the total throughput of the network as a linear programming problem. Then, we develop heuristic load balancing candidate forwarder sorting and selection algorithms. Simulation results and comparisons demonstrate that our proposed LBOR scheme outperforms existing opportunistic routing protocols with nonload balancing methods in CRAHNs. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1155/2018/9412782 | WIRELESS COMMUNICATIONS & MOBILE COMPUTING |
Field | DocType | Volume |
Forwarder,Heuristic,Load balancing (computing),Computer science,Computer network,Sorting,Linear programming,Cognitive radio ad hoc networks,Throughput,Routing protocol,Distributed computing | Journal | 2018 |
ISSN | Citations | PageRank |
1530-8669 | 0 | 0.34 |
References | Authors | |
13 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenxuan Duan | 1 | 0 | 0.34 |
| xing tang | 2 | 8 | 2.35 |
| Junwei Zhou | 3 | 118 | 16.64 |
| Jing Wang | 4 | 507 | 93.00 |
| Guosheng Zhou | 5 | 0 | 0.34 |