Research On Cross-layer Communication Protocols For Dense Wireless Sensor Networks

As technology advances, the microelectronics industry, computer technology, wireless sensor networks has been rapid development. Dense wireless sensor networks due to the greater competition and conflict between the nodes, brought many problems, making the overall performance of the network becomes poor. This paper uses, Cross-layer communication protocol, multi-layer combination processing, Aiming at the problem of large competition, low network throughput, and the extension of communication, conduct research, the main contents are as follows:1. In dense wireless sensor networks, nodes communicate with each other between the competition and conflict in particular, caused by prolonged transmission, low network throughput, energy consumption greatly. In view of the above problems, this paper uses Multi-Channel Multi-Radio wireless sensor network, and uses the k-ary n-cube topology of the network model to solve. First of all, the distributed calculation is carried out, and the network model is constructed. Next, the allocation of the channel. Finally, using the dimension order routing strategy in data transmission.2. Routing strategy based on virtual network in dense network, Firstly, divide the network into clusters by the k-means algorithm, and the method of vertex coloring is adopted to allocate channel for each cluster. Then, the resource allocation method based on virtual network is adopted, the cluster is selected as the routing path, which is the smallest load and the distance close to the destination node. The experimental results show that this strategy not only can make the network load balance, but also improve the rate of data transmission, to obtain the profit approximate maximum.3. A cross layer network strategy with power regulation is proposed for the dense nodes in wireless sensor networks. Nodes use different transmission power for data transmission and so that each node has a predetermined number of its neighbor nodes, the number of neighbors is the node degrees. Thus guarantee the network connectivity, and can effectively reduce the competition conflict between nodes. The nodes in the network are divided according to the hierarchy, the upper node with the minimum transmission power is selected as the father node to construct the routing tree, the candidate father node sets of the nodes are calculated, in the case of the failure of the father node, select candidate father nodes for transmission to solve the problem. The experimental results show that this strategy can improve the network throughput, improve the rate of data transmission.