loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2001 International Conference on Parallel Processing Workshops (ICPPW'01)
Package Routing Algorithms in Mobile Ad-Hoc Wireless Networks
Valencia, Spain
September 03-September 07
ISBN: 0-7695-1260-7
Xiao Chen, Southwest Texas State University
Xingde Jia, Southwest Texas State University
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.
Citation:
Xiao Chen, Xingde Jia, "Package Routing Algorithms in Mobile Ad-Hoc Wireless Networks," icppw, pp.0485, 2001 International Conference on Parallel Processing Workshops (ICPPW'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.