CN101741685A - A routing search method and routing device - Google Patents

Abstract

The embodiment of the invention discloses a route search method, which relates to the field of network communication. The method includes: acquiring the energy status of the neighbor nodes; selecting a next-hop relay node among the neighbor nodes according to the energy status of the neighbor nodes; and sending a data packet to the next-hop relay node. It solves the problem that the continuous use of a single node in the network causes the energy of the node to be exhausted prematurely and shortens the lifetime of the network. The embodiment of the invention also discloses a routing device.

Description

A routing search method and routing device

technical field

The invention relates to the field of network communication, in particular to a route search method and device applied to a wireless sensor network.

Background technique

Wireless Sensor Network (WSN) is a comprehensive intelligent wireless communication system integrating information collection, information processing, and information transmission. It is composed of thousands of sensor nodes. Each node includes a microprocessor, memory, sensors, batteries and a tiny radio transceiver. After the wireless sensor network is deployed at the application site, it can collect the information of the designated monitoring object in real time, process it, and then send the processing result.

Due to the small size of the sensor node, it can only be equipped with a limited power supply. In some applications, it is almost impossible to replace the battery, which makes the life of the sensor node depend on the life of the battery to a large extent. Therefore, reducing power consumption to extend The service life of the system is an important issue that needs to be considered in the design of wireless sensor networks.

In order to avoid frequently using the same path during data transmission. The nodes on the path are caused to fail early due to excessive battery energy consumption, and the entire network is divided into disconnected network areas. An energy routing mechanism is proposed. According to the available energy of all nodes in the entire network obtained through the source node (PowerAvailable, PA), select the path with the least total energy consumption as the transmission path, and the available energy of the node is the remaining energy of the current battery of the node.

In the process of implementing the above routing selection, the inventors found that there are at least the following problems in the prior art: in the prior art, the source node counts the energy of the nodes in the entire network, and selects the path with the least total energy consumption as the transmission path according to the statistical results, so that The continuous use of a single node in the network causes the energy of the node to be exhausted prematurely and shortens the lifetime of the network.

Contents of the invention

In order to solve the problem in the prior art that the energy of the node is prematurely depleted due to the continuous use of a single node in the route selection process, the embodiments of the present invention provide a route search method and device.

The invention discloses a route search method, which is applied to a wireless sensor network, including:

Obtain the energy status of neighbor nodes;

selecting a next-hop relay node from the neighbor nodes, wherein the relay node is a node whose energy among the neighbor nodes is greater than a threshold;

Sending a data packet to the next-hop relay node.

The invention also discloses a routing device, which includes:

A data packet receiving unit, configured to receive data packets;

An energy status acquisition unit, configured to acquire the energy status of neighboring nodes;

A path selection unit, configured to select a next-hop relay node from neighbor nodes of the current node, wherein the relay node is a node whose energy among the neighbor nodes is greater than a threshold;

A data packet sending unit, configured to send a data packet to the selected relay node.

In the routing search method and routing device provided by the embodiments of the present invention, in path calculation, each node obtains the energy information of neighboring nodes, and selects the next-hop relay node, so that the node energy is consumed in a balanced manner during the transmission process, and overcomes the single The node is continuously used, and the energy of the node is exhausted prematurely, which prolongs the service life of the network.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only These are some embodiments of the present invention. For those skilled in the art, other drawings can also be obtained according to these drawings without any creative effort.

Fig. 1 is the application scene of the embodiment of the present invention;

Fig. 2 is the flow chart of the routing lookup method that the embodiment of the present invention provides;

FIG. 3 is a flowchart of a routing device provided by an embodiment of the present invention.

Detailed ways

The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.

The present invention will be further explained below in conjunction with specific embodiments and accompanying drawings.

In order to solve the problem in the prior art that the continuous use of a single node causes the energy of the node to be exhausted prematurely, the embodiments of the present invention provide a route search method and device.

For ease of understanding, the embodiment of the present invention will be described in detail by taking the schematic diagram of the wireless sensor network shown in FIG. 1 and the process of sending a data packet from node A to converging node B as an example.

The route search method provided by the embodiment of the present invention is introduced in detail below, specifically referring to FIG. 2:

201. The current node receives the data packet sent by the previous hop relay node;

Wherein, the address information of the node through which the data packet has been recorded is recorded in the path information of the data packet;

In the embodiment of the present invention, node A receives the data packet sent by the relay node of the last hop, and the address information of the node through which the data packet has been recorded is recorded in the path information of the data packet.

202. The current node obtains the energy status of neighboring nodes;

Wherein, the energy status of the neighbor node includes the energy consumption status of the neighbor node or the energy surplus status of the neighbor node. That is to say, a neighbor node with more remaining energy or an energy node with less energy consumption is selected as the relay node of the next hop to ensure that the neighbor nodes can consume energy on average. Nodes whose energy consumption is greater than a preset threshold or less than a preset threshold can also be selected.

In the embodiment of the present invention, the acquiring the energy consumption status of the neighbor nodes includes:

An information list is set for each node within the coverage of the wireless sensor, and the information list records the number of data packets sent by the neighbor nodes. After the node recorded in the information list sends a data packet each time, the number of times the node has sent a data packet is updated.

Optionally, configure a counter for each node to record the number of times it has been sent. After a node sends a data packet each time, the data value recorded by the counter of the node is increased by one.

The above-mentioned method for recording the number of times of sending data packets is not limited thereto, since the implementation method or manner is similar, no more examples are given here.

In the embodiment of the present invention, the neighbor nodes in the information list of node A include node C, node D, and node E, and respectively record the number of times the three nodes have sent data packets.

203. Determine whether there is a neighbor node that the data packet has not passed among the neighbor nodes of the current node;

Specifically, through the address information recorded in the path information of the data packet, the node through which the data packet has passed can be obtained, and from the neighbor nodes of the current node, it is judged whether the data packet exists in the neighbor node Neighbor nodes other than the passed node. If there is a node in the neighbor nodes that the data packet has not passed through, go to step 204; if there is no node in the neighbor nodes that the data packet has not passed through, go to step 210.

204. The current node selects a next-hop relay node from the neighbor nodes that the data packet does not pass through according to the energy status of the neighbor nodes that the data packet does not pass through;

Specifically, in the embodiment of the present invention, the threshold value of the number of data packets sent by the node is set, and any neighbor node whose number of times of data packets sent in the neighboring nodes is less than a preset threshold value is selected as the middle node of the next hop. successor node.

Optionally, the neighbor node that has sent data packets the least number of times is selected as the relay node of the next hop.

In the embodiment of the present invention, the node D that has sent data packets the least number of times is selected as the next-hop relay node of node A.

After determining the relay node of the next hop, go to step 205 .

Obtain the energy information of neighbor nodes through the current node, select the relay node of the next hop, reduce the energy consumed by each node when sending energy information, and overcome the problem of sending energy information from each node to the source node in path selection in the prior art. The low-cost, low-energy wireless sensor network is used for the problem of excessive energy consumption for path calculation.

205. The current node judges whether there is a local data packet with the same destination address as the data packet;

In the embodiment of the present invention, the relay node D judges whether there is a local data packet whose destination address is the sink node.

By judging whether there is a local data packet with the same destination address, the local data packet is sent together with the data packet to be sent, avoiding that when the local data packet with the same destination address is sent, the local route search is performed again, and the time for transmitting the local data packet is shortened , and at the same time save the energy consumed by the neighbor nodes to transmit the energy status. Of course, in specific applications, step 205 can also be skipped.

206. The current node adds local address information to the path information of the data packet;

In the embodiment of the present invention, the current node A adds the address information of node A to the received data packet whose destination address is the sink node and the local data packet whose destination address is the sink node.

After adding the local address information in the data packet, go to step 207 .

207. The current node sends the data packet to the next-hop relay node;

In the embodiment of the present invention, node A sends the received data packet whose destination address is the sink node and the data packet whose local destination address is the sink node to relay node D.

208. Update the energy status of the current node

Specifically, update the information list that records the sent times of the current node; or update the value recorded by the counter of the current node.

In the embodiment of the present invention, update the value of node A in the information list including the previous hop relay node or update the value of the counter record of node A

209. The current node notifies the previous hop relay node that the data packet has been sent successfully.

In the embodiment of the present invention, node A notifies the last-hop relay node that the data packet whose destination address is the sink node has been sent successfully.

The above describes the situation that there are neighbor nodes other than the node through which the data packet has passed. The following describes the case where there is no neighbor node other than the node through which the data packet has passed.

210. The current node notifies the relay node of the previous hop that the sending of the data packet fails

In the embodiment of the present invention, node A notifies the relay node of the previous hop that the destination address is a response message of failure to send the data packet of the sink node;

After receiving the response message, the previous hop relay node of the current node reselects the next hop node from the neighbor nodes. For the specific process, refer to steps 201-210. Since the process and method are similar, details will not be repeated here.

During the data packet transmission process, the current node receiving the data packet searches for the next-hop relay node, refer to steps 202-210, until the sink node appears in the neighbor node of the current node, directly select the next-hop node as the sink node node. After the sink node receives the data packet whose destination address is the sink node, it sends a response message to the source node of the data packet to notify the transmission path of the data packet.

In the embodiment of the present invention, the transmission path is determined by acquiring the real-time energy status of neighboring nodes, which is more adaptable to changes in time, environment and network topology.

It should be noted that the method of route search is performed periodically, and the determined transmission path is used as a reference path within the period. When the transmission path fails or exceeds the period, the routing search is performed again, and the saved original transmission path is updated.

The embodiment of the present invention is described by taking the application scenario of the sensor network routing connection diagram as shown in Figure 1 as an example, but the scope of application of the method is not limited to this, and it is also applicable to other sensor networks. Since the method and process are similar, they will not be repeated here.

The embodiment of the present invention selects the next hop node through the energy status of the neighbor nodes of each node, overcomes the problem in the prior art that the continuous use of a single node in the routing selection process causes the energy of the node to be exhausted prematurely, and realizes data packet transmission In the process, the energy of nodes is consumed in a balanced manner, and the energy of nodes in the entire network is smoothly degraded, which improves the energy balance performance of the network and maximizes the lifetime of the network.

Please refer to FIG. 3 , the embodiment of the present invention also provides a routing device 300, which is set on a node of the network, which includes:

A data packet receiving unit 310, configured to receive a data packet;

An energy status acquisition unit 320, configured to acquire the energy status of neighboring nodes;

A path selection unit 330, configured to select a next-hop relay node from neighbor nodes of the current node, wherein the relay node is a node whose energy among the neighbor nodes is greater than a threshold;

Wherein, the energy state acquisition method in the embodiment of the present invention may refer to the embodiment of the energy state acquisition and relay node selection described in the route search method provided by the present invention.

A data packet sending unit 340, configured to send a data packet to the selected relay node.

The data packet sending unit adds local address information to the path information of the data packet before sending the data packet.

When selecting a relay node, the path selection unit selects a neighbor node that has not been passed as a next-hop relay node according to the path information stored in the data packet.

The embodiment of the present invention selects the next hop node through the energy status of the neighbor nodes of each node, overcomes the problem in the prior art that the continuous use of a single node in the routing selection process causes the energy of the node to be exhausted prematurely, and realizes data packet transmission In the process, the energy of nodes is consumed in a balanced manner, and the energy of nodes in the entire network is smoothly degraded, which improves the energy balance performance of the network and maximizes the lifetime of the network.

Those of ordinary skill in the art can understand that all or part of the steps for realizing the above-mentioned method embodiments can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer-readable storage medium. When the program is executed, the It includes the steps of the above method embodiments; and the aforementioned storage medium includes: ROM, RAM, magnetic disk or optical disk and other various media that can store program codes.

The above is only a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Anyone skilled in the art can easily think of changes or substitutions within the technical scope disclosed in the present invention. Should be covered within the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.

Claims (10)

1. a method for searching route is characterized in that, is applied to wireless sensor network, comprising:

Obtain the energy state of neighbor node;

Choose the via node of next jumping from described neighbor node, wherein, described via node is that energy in the described neighbor node is greater than the node of a threshold values;

Via node to described next jumping sends packet.

2. method for searching route according to claim 1 is characterized in that, described via node to described next jumping sends packet and comprises:

Judge whether to exist the identical local packets of destination address with the packet that receives;

If there is described local packets, then send the packet and the described local packets of described reception to the via node of described next jumping.

3. method for searching route according to claim 1 is characterized in that, described via node to described next jumping comprises before sending packet:

In the routing information of described packet, add local address information.

4. method for searching route according to claim 1 is characterized in that, the described energy state that obtains neighbor node comprises:

Obtain the number of times that neighbor node has sent packet.

5. method for searching route according to claim 1 is characterized in that, the described via node of choosing next jumping from described neighbor node comprises:

Choose the not neighbor node of process of described packet, and obtain the not energy state of the neighbor node of process of described packet.

6. method for searching route according to claim 5 is characterized in that, choose described packet not the neighbor node of process also comprise:

If there is not the not neighbor node of process of packet, then upwards a via node of jumping sends the failure response result.After described last one via node of jumping receives described failure response result, from described neighbor node, choose the via node of the neighbor node of process not, and send packet to the via node of described next jumping as next jumping.

7. method for searching route according to claim 1 is characterized in that, the described via node of choosing next jumping from described neighbor node comprises:

Obtain the number of times that sends packet of neighbor node;

From neighbor node, choose and sent the packet number of times less than arbitrary neighbor node of a threshold value via node for next jumping.

8. method for searching route according to claim 1 is characterized in that, the described via node of choosing next jumping from described neighbor node comprises:

Choose the maximum neighbor node of energy as next-hop node.

9. route device comprises:

The packet receiving element is used to receive packet;

The energy state acquiring unit is used to obtain the energy state of neighbor node;

Path selection unit is used for choosing from the neighbor node of present node the via node of next jumping, and wherein, described via node is that energy in the described neighbor node is greater than the node of a threshold values;

The packet transmitting element is used for sending packet to the described via node of choosing.

10. route device as claimed in claim 9, it is characterized in that, described packet transmitting element added local address information in the routing information of described packet before sending packet, the routing information that described path selection unit is preserved in according to described packet when selecting via node is selected the via node of the neighbor node of process not as next jumping.

Images