Package Routing Algorithms in Mobile Ad-Hoc Wireless Networks

Authors:
Affiliations:
Venue:
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
Year:
2001

Citing 0
Cited 3

Multicasting techniques in mobile ad hoc networks

The handbook of ad hoc wireless networks
Reversing ticket based probing routing protocol for MANET

TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Random geometric graph diameter in the unit disk with lp metric

GD'04 Proceedings of the 12th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: A mobile ad-hoc network (MANET) is formed by a cluster of mobile stations randomly located within a certain area. Because of their low power, low bandwidth and mobility, routing in a MANET poses special challenges. In this paper, an efficient routing algorithm is discussed for MANETs. This routing algorithm has a small transmission delay and needs only a small and easy-to-update generation table for each station. In addition, the communication channels in the routing algorithm are dynamically assigned, which allows a large MANET to use a limited number of communication channels.