Name
Abstract | ||
|---|---|---|
In an ad-hoc network, some nodes relay more communications than others. Since relaying is resource consuming, unfairness in terms of the number of communications relayed by different nodes is not desirable. This paper discusses a simple charging/rewarding scheme as a method to reduce the unfairness in the network. We explain the reason why such a scheme works well in a mobile network but does not work well in a static network and discuss some methods to improve performance in the static network. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ISCAS.2005.1465249 | ISCAS (3) |
Keywords | Field | DocType |
ad hoc networks,mobile radio,charging/rewarding scheme,mobile ad-hoc networks,node betweenness values,node communication relaying,static ad hoc networks,unfairness minimization | Mobile ad hoc network,Delay-tolerant networking,Computer science,Computer network,Adaptive quality of service multi-hop routing,Optimized Link State Routing Protocol,Cellular network,Wireless ad hoc network,Mobile wireless sensor network,Vehicular ad hoc network,Distributed computing | Conference |
ISSN | ISBN | Citations |
0271-4302 | 0-7803-8834-8 | 1 |
PageRank | References | Authors |
0.41 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Keisuke Nakano | 1 | 212 | 24.62 |
| Rajesh Krishna Panta | 2 | 177 | 14.10 |
| Masakazu Sengoku | 3 | 33 | 15.91 |
| Shoji Shinoda | 4 | 61 | 13.52 |