Wireless Mobile Self-organizing Network Data Link Layer Key Technology Analysis, Design And Realization

Kernel-Tree is a new networking architecture for the self-organization of Ad hoc networks, which is devided into two hierarchies. The upper, composed of Wireless Routers, constitutes the self-organization network and the lower is a set of Wireless Hosts which can access the network and communicate by IP. WHs can also roam in the networok without communication interruption. How to implement WH's roaming in the multihop Ad hoc network is one of the key techniques in the self-organization network. This paper gives a clear definition of WH's seamless roaming, and points out the limitation of IEEE802.11 infrastructure mode for WH's mobility in multihop Ad hoc network. According to the characteristics of the Kernel-Tree network, this paper proposes a new WH seamless roaming solution, which combines the IEEE802.11 protocol and the KTRP protocol, in the multihop Ad hoc network based on TCP/IP protocol stacks. The solution includes the virtual address technology, the proxy ARP in multihop Ad hoc, and the fast route-convergence technology in KTRP protocol. And its implementation for Linux is also discussed in this paper.Another key issue in multihop Ad hoc based on IEEE802.11 is how to determine link connectivity between every two WRs. This paper gives the overview of the characteristics of link connectivity in IEEE802.11 networks. Adding a sublayer, neighbor link management sublayer, in the data link layer is also proposed in this paper. The new sublayer is used to make precision determination about the link connectivity. And the experiments in the testing system indicate that the sublayer is practicable and available.