Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
The medium time metric: high throughput route selection in multi-rate ad hoc wireless networks
Mobile Networks and Applications
An entropy-constrained algorithm for routing of communication networks
Computer Communications
| Hi-index | 0.00 |
In Mobile Ad hoc Networks (MANETs), when mobile nodes move to another location, the relative distance of communicating nodes will directly affects the data rate of transmission. The further distance between two communicating nodes is, the lower rate that they can use for transferring data. The connection certainty of a link also changes because a node may move closer or far away out of communication range of other nodes. Taking into account those issues, this paper proposes a new routing metric for MANETs. The new metric consider both link weight and route stability that be defined in relation with connection entropy. The problem of determining the best route is subsequently formulated as the constrained minimization of an object function formed as a linear combination of the link weight and and the uncertainty of connection of that link. The simulation results show that proposed routing metric improves end to end throughput and reduces the percentage of link breakage and route reparation.