A novel routing algorithm for SEED of hybrid ad hoc networks

In this paper, we propose a novel integrated routing algorithm to optimize hybrid ad hoc networks. There are some nodes called SEEDs in the hybrid ad hoc networks model we presented. The SEEDs work only as relay nodes with strong capabilities of radio and routes resource management. Such management is carried out by the coordination of the routes, traffic and power of a SEED itself. This novel algorithm is proposed to select the optimized route by a routing evaluating function and a joint back-off mechanism. The simulation results show that the throughput of the hybrid ad hoc networks with the novel routing algorithm is much higher than that of the conventional ad hoc.

[1]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[2]  Prem Dassanayake,et al.  User Mobility Modeling and Characterization of Mobility Patterns , 1997, IEEE J. Sel. Areas Commun..

[3]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Chunming Qiao,et al.  Integrated cellular and ad hoc relaying systems: iCAR , 2001, IEEE J. Sel. Areas Commun..