Demand Self-organizing Routing Algorithm Design And Simulation

The Wireless Mobile Self-organizing Network (WMSN) demonstrates a new kind of network architecture that combines with the self-organization of Ad hoc networks and the user management of cellular networks. Thus, it can be easily deployed without the use of any existing network infrastructure and make mobile users more convenient to access it. The routing protocol is one of the key techniques to fulfill the network. The On-demand Self-organizing Routing (OSR) algorithm introduced in this paper is developed for this specific environment.The system infrastructure of WMSN is firstly described in this paper so that we can understand the environment thoroughly. Then a variety of wide-known ad hoc routing algorithms are surveyed in order to find out the strongpoint and weak point of them. A performance comparison between them gives a clue to the design of the OSR algorithm. Just as its name implies, the OSR algorithm is a kind of on-demand distributed algorithms, which greatly reduce the cost of self-organizing in WMSN compared with proactive routing protocols. Also it integrates the function of finding routes and the user management into a single process and gives more efficiency. In this paper, we depict the manipulation of the OSR algorithm at length and also a simulation work on it, which demonstrates that it works well in WMSN.