Self-deployment algorithm of mobile sensor network based on connection priority criteria

This paper deals with a self-deployment of the mobile sensor network in an unknown environment. A mobile sensor network is composed of a distributed collection of nodes, each of which has sensing, computation, communication and locomotion capabilities. Such a network is capable of self-reconfiguration of the network topology in order to gather distributed information on the dynamic environment. In this paper, we present a single node movement algorithm based on connection priority for node deployment. Each node moves only with local information such that the network accomplishes a global purpose, e.g., transmitting remote sensing data to the sink. Each node in this network transmits a control packet called "Hello message". Because the hello message may hardly press a communication resource, it is an advantage that this each node uses only hello messages and sensing data in order to decide the moving direction. Suggest that proposed algorithm is directly applicable. Its directly applicable to mobile sensor network for searching injured persons in disaster areas, data gathering in dangerous environments, etc.