Wireless sensor network, routing method and node equipment

Abstract

The invention discloses a routing method in a wireless sensor network, the wireless sensor network and node equipment based on the method. The routing method comprises the following steps: each node selects the nodes closer to the gateway than self from own neighbor nodes to form a candidate forward set; the node computes the payment equation value corresponding to each node in own candidate forward set; the neighbor node maximizing the payment equation value is selected as the next hop node; and after all the involved nodes select strategies, the route is established and data transmission is started. Based on the balance mechanism in the game theory, the invention can jointly optimize transmission reliability, network energy consumption and lifetime in the routing process and farthest save network energy consumption.

Description

technical field [0001] The invention relates to the technical field of wireless self-organization and sensor network, in particular to a routing selection method in a wireless sensor network, and a wireless sensor network and node equipment based on the method. Background technique [0002] With the development of sensor technology, embedded chip technology, distributed information processing technology and wireless network technology, Wireless Sensor Network (WSN) has emerged as a ubiquitous computing platform. WSN is composed of a large number of ubiquitous tiny sensor nodes with communication and computing capabilities densely arranged in unattended monitoring areas. It is an "intelligent" autonomous measurement and control network system that can independently complete specified tasks according to the environment. It is a network composed of tiny nodes integrating sensors, data processing units and wireless communication modules through self-organization and random distr...

AI Technical Summary

Problems solved by technology

Although there are many node positioning mechanisms that can provide accurate location services for nodes, the existing routing algorithms based on location information mainly rely on the location information of nodes and their neighbor nodes, which can easily cause the energy of nodes near the gateway to be blocked. Excessive consumption and premature death will also cause routing "holes" in hotspot areas

[0005] For example: in the existing routing selection methods based on location information, some use the method of the closest path first, first select the neighbor node closest to the destination node to participate in the routing, although the implementation is simple, but the neighbor nodes near the destination node will undertake the routing task for a long time , too much energy consumption and death due to drought, it is easy to cause a transmission "black hole" in the network, which shortens the lifetime of the network

Others use the joint position and the measurement of the remaining energy of neighboring nodes as a method to select the next hop node. Although it avoids the phenomenon that the neighbor nodes with lower energy exhaust energy and die prematurely, it does not consider the low reliability of the transmission link. It may lead to frequent data retransmission or even loss on a path with low transmission reliability, which will not only reduce the transmission reliability of the entire path, but also increase the energy consumption of the network during the retransmission process

Images