Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Local solutions for global problems in wireless networks
Journal of Discrete Algorithms
Routing in wireless networks with position trees
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Statistical monitoring to control a proactive routing protocol
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Energy-Efficient face routing on the virtual spanner
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
| Hi-index | 0.00 |
For an adhoc network with n nodes, we propose a proactive routing protocol without routing tables which uses O (logn ) bits per node for the location service tables. The algorithm is based on 1-dimensional virtual coordinates, which we call labels. The decision of where to forward a packet is oblivious and purely local, depending only on the labels of the immediate neighbours and the label of the destination: the packet is forwarded to the neighbour whose label is closest to that of the destination. The algorithm is based on mapping the network to an ordered list where each node has one or more integer labels. This labeling can be produced by any arbitrary traversal of the network visiting all the nodes, in particular by a depth-first search of a flood tree which gives a 2n length traversal. We show experimentally that, in terms of hop number, our routing algorithm is far superior to geographic protocols in randomly generated networks and for sparse networks produces routes of length very close to those of the shortest path.