The 1-Connected 1-Dominating Set Construction In Wireless Sensor Network

At present, wireless sensor network related to the technology of sensor and micro-electro-mechanism, modern networks and wireless communication, etc., is becoming one of the hottest spots in IT research. Sensor node, with the advantages of small volume and functions of information collection, data transaction and wireless communication, etc., makes the wireless sensor network widely used, such as in military affairs and national defense, biomedicine and medical treatment, environment protect, intelligent fitment, control flood, space exploring and so on.Nowaday, many interrelated technologies concerning wireless sensor network are in groping phase, such as the design for networks protocol, power management, the security and reliability for data transformation and so on. The routing algorithm is the key problem in network layer. Because of the resource restriction in nodes'energy, storage and calculation, wireless sensor network adopts the technology of data aggregation broad. Therefore broadcasting and routing is the most important communication mode. In this paper, we focus on the routing algorithm.In this paper, we adopt distributed algorithm, aiming to simple wireless network to construct connected dominating set on the network layer. Considering the energy consumption asymmetric of node, we set threshold energy to balance the energy consumption and prolong the life-time of network. Local information around the present node is only necessary to construct connected dominating set, except the information of the whole network. Therefore the algorithm has the advantage of robust and self-organized.In this paper, we adopt genetic algorithm, aiming to large and complex wireless sensor network to construct connected dominating set on the network layer. With the advantage of prolonging the life-time of network to the best, firstly we take the node's remaining energy as its authority, and differentiate the maximal authority and every node's authority with the authority respectively. Then it can be used to construct the object function. The algorithm adopts backtrack searching, aiming to use less dominating nodes to dominate more...