The Algorithm Of Self-location In Ad Hoc Networks

Mobile Ad hoc network is a special wireless network that is a temporary one with communicating each other using distributed protocol. Mobile ad hoc network has many basic characters, such as dynamic network topology, multi-hop, self-organization and mobility. Now mobile ad hoc network is widely studied in mobile communication field. And positions of node in mobile Ad hoc network is an importance problem.The basic theories and technologies about the position system in Ad hoc network are described in this dissertation, such as the basic principle and measurement technique. And the evaluation criterion of the performance and the taxonomy of self-location systems for Ad hoc networks are also described in this dissertation. The principle and characteristics of some typical algorithms are discussed, and the directions of self-location systems are also proposed. A position system only using the connection of nodes in Ad hoc network is presented. The difference between this position system and other position systems lies in whether they need the help of GPS or basic stations or not.Based on the characters Af ad hoc network, the "group" idea is proposed in the dissertation. The whole multi-hop network is deemed to be made of lots of one-hop networks, in other word, the whole network is deemed to be made of lots of local area networks. All the nodes in a local area network make up of a group. A local area coordinate is created in every local area network, and all the nodes are located in itself local area coordinates. According to the transition of coordinates, the coordinates of all the nodes are uniformed in a global coordinate, in other word, all the nodes in the network are located. The performance and cost about mobile Ad hoc network with position system are studied according to the results of simulation.