Dynamic initialization protocols for mobile ad hoc networks

The construction of interconnection wired networks (or wireless networks) from smaller components often leaves the fundamental problem of assigning address to stations. In general, the address of a station for algorithms in wired or wireless networks is either permanently stored in its local memory or is received at start-up time from a master station. In another words it is assumed that initially each station knows its address. This assumption is not always appropriate in some situations: according to the topology we want to use in the transputer reconfigurable network, the addresses of the transputers may be different. The problem of assigning addresses to stations is somehow fundamental and it is called the initialization problem. The mobile ad hoc wireless network is a dynamical system in which some channels or stations can be removed and new channels or stations can be added during the life of the system. The capability of whole system to handle these changes is crucial. The initialization of the mobile ad hoc network of n stations must then be dynamic by handling all these changes in particular the variation of the number of stations in time. In most applications in wireless networks, it is often supposed that the stations are partitioned into equal groups and that a channel is assigned to each group. But it is never shown how this partition is initially done. This paper addresses all these points and shows how a self organization of the mobile ad hoc system can be carried out dynamically.