CN109873765B - Energy-efficient routing decision method for wireless sensor network in tunnel environment - Google Patents
Energy-efficient routing decision method for wireless sensor network in tunnel environment Download PDFInfo
- Publication number
- CN109873765B CN109873765B CN201910219489.4A CN201910219489A CN109873765B CN 109873765 B CN109873765 B CN 109873765B CN 201910219489 A CN201910219489 A CN 201910219489A CN 109873765 B CN109873765 B CN 109873765B
- Authority
- CN
- China
- Prior art keywords
- route
- node
- routing
- energy
- tunnel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a routing decision method for wireless sensor network energy efficiency in a tunnel environment, which comprises the following steps: the tunnel node is used as a source node to initiate a routing request, and a routing request frame is initialized; after the routing node receives the routing request, the decision factor ETX, E is calculatediE3TX and updating the routing table, checking whether the table item of the destination node exists in the routing table, if yes, sending a routing response; the routing node receives the routing response, compares the locally calculated information with the data in the routing response frame, and forwards the locally calculated information to the source node to stop and generate a reverse route if the locally calculated information meets the conditions; the invention can obtain the optimal path from the source node to the destination node by combining the energy effectiveness, hop count, ETX and reliability by using a routing decision algorithm, and simultaneously solves the problems of time delay and reliability.
Description
Technical Field
The invention relates to an optimal wireless transmission path decision of a wireless sensor network, in particular to an energy-efficient routing decision method of the wireless sensor network in a tunnel environment.
Background
In the aspect of practical wireless transmission network application such as construction and tunnel health condition monitoring, because of complex environment and special network node distribution, the traditional routing protocol cannot guarantee energy consumption and network reliability in the complex tunnel environment. In the tunnel environment, the routing is difficult to have the multipath routing of the conventional network, but the routing is generally linear single-path routing, and the multipath effect influence is more remarkable than that of the conventional environment. In order to solve the problems of energy efficiency and network reliability of a wireless transmission network in a tunnel environment, the reason that the tunnel environment is complex needs to be considered, a traditional routing strategy needs to be optimized and improved, and an optimal routing decision strategy is provided for a single-path network in the tunnel environment.
In the prior art, a hierarchical AODV routing method (CN102118312B) is an improvement on AODV, is a traditional network AODV routing protocol, is mainly used for battlefield ground tactical networks, and is not suitable for wireless sensor networks, especially linear wireless sensor networks in tunnel environments.
Disclosure of Invention
In order to solve the problems of network delay, energy efficiency and network reliability faced by a linear wireless sensor network in a tunnel environment, the invention provides an energy-efficient routing decision method for the wireless sensor network in the tunnel environment.
The invention provides a node residual energy punishment mechanism for ensuring the balance of node energy consumption in a tunnel. The more energy a certain node steals, the heavier the obtained route decision penalty. The method specifically comprises the following steps:
step 1: the tunnel node is used as a source node to initiate a route request RREQ and initialize a route request frame;
step 2: after receiving the route request RREQ, the route node calculates a decision factor in a route table, processes the route request RREQ, and the processing result is as follows: forwarding the updated route request RREQ, or sending a route response RREP and discarding the route request RREQ;
and step 3: after receiving the route response RREP, the route node calculates the decision factor in the route table, processes the route response RREP, and the processing result is as follows: forwarding the updated route response RREP or discarding the route response RREP;
and 4, step 4: and repeating the step 3 until the route response RREP returns to the source node, and generating a reverse route through the route table, wherein the route path is the optimal path from the source node to the destination node.
The process of processing the route request RREQ in the step 2 is as follows:
2.1 after receiving the route request RREQ, the route node calculates the decision factor;
2.2 judging whether the route request RREQ is received repeatedly, if so, updating the optimal reverse route table, then discarding the route request frame, if not, updating the route request frame, and updating E3TX in the reverse route table;
2.3 judging whether the route request points to itself or the route table item pointing to the destination node in the node route table according to the destination address in the route request frame structure, if the condition is satisfied, the node discards the route request RREQ and sends a route response RREP through a reverse route table, and the route response frame contains the route decision value of the node; if the condition is not met, the routing node forwards the updated route request RREQ.
The process of processing the route response RREP in the step 3 is as follows:
3.1 the node receiving the route response RREP calculates the decision factor and other items in the corresponding route table according to the data in the route response frame and the local energy information of the node;
3.2 determining whether the route response RREP is received repeatedly, if so, discarding the route response RREP, otherwise, forwarding the route response RREP;
3.3 judging whether reaching source node, otherwise updating forwarding route response RREP, if yes, abandoning route response RREP and generating a reverse route.
The decision factor comprises an expected transmission number ETX value and a maximum remaining energy cost value EiAnd the energy efficient expected transmission number E3 TX. Calculated by the following formulas (1), (2) and (3), respectively
In the formula stnRefers to the expected Transmission number ETX (expected Transmission count) of a certain link in the tunnel, ETXiRepresenting a single hop expected number of transmissions;
in the formula senRefers to the maximum penalty value, S, of the link nodenSet of path nodes representing self-organizing route generation in tunnels, f (E)i) Refers to the residual energy cost value;
wherein the weight λ satisfies 0< λ < 1.
The above residual energy cost value is calculated using equation (4):
in the formula EiRepresenting the residual energy of the ith routing node in the tunnel wireless monitoring network, wherein i is 1,2, … n, and e represents a natural constant. The above-mentioned number of single-hop expected transmissions is given by equation (5),
in the formula
Respectively showing the success rate of the forward packet and the success rate of the reverse packet; reverse packet success rate d of the scheme i r1 is ═ 1; forward packet success rate
Can be calculated using the following equation (6),
wherein RSSI is Received Signal Strength Indication (Received Signal Strength Indication), RSSI is obtained by hardware in the wireless communication process, and psr is Packet Success Rate (Packet Success Rate).
The invention has the beneficial effects that:
the energy-efficient routing decision algorithm of the wireless sensor network only generates one reverse route, which just meets the requirement of a linear routing network in a tunnel environment. Although only one reverse route is finally generated, the route decision algorithm can combine energy efficiency, hop count, ETX and reliability to obtain the optimal path from the source node to the destination node. Meanwhile, the problems of time delay and reliability are solved.
Drawings
FIG. 1 is a schematic diagram of a wireless monitoring network transmission for a tunnel;
FIG. 2 is a flow of a route request process;
FIG. 3 is a route response process flow;
FIG. 4 is a simple 8-node linear tunnel network;
fig. 5 is a network illustration of a simple 8-node linear tunnel network.
Detailed Description
The invention is described in further detail below with reference to the figures and the detailed description.
In order to ensure that monitoring data in the tunnel can be transmitted correctly and reliably, the layout of network routing nodes in the tunnel is subjected to redundancy processing, namely the routing nodes can carry out hopping transmission so as to avoid physical death of a certain node and cause paralysis of a wireless monitoring network. The transmission diagram of the tunnel wireless monitoring network is shown in fig. 1.
The route decision strategy proposed by the scheme is consistent with the type of the AODV (Ad hoc On-Demand Vector Routing) route protocol packet, and comprises a Route REQuest (RREQ), a Route Response (RREP), a Route ERRor (RERR), a HELLO packet and a user data packet. The data structures of the routing error and the heartbeat packet in the scheme are consistent with the AODV protocol.
In the scheme, the tunnel node initiates a route request RREQ, and initializes a route request frame in the source node, wherein ETX is 0. Typically, the node is powered by two dry cell 5 batteries. Suppose that each node in the tunnel has the same initial energy EintHere order Eint3.3V. Thus initially E1＝Eint＝3.3V，E3TX＝λ×0+(1-λ)×f(E1)。
The route request frame structure is shown in the following table:
table 1 route request frame structure
After the route node receives the route request RREQ, the node calculates the decision factor ETX, E through equations (1), (2) and (3)iAnd E3TX and updates the routing table. And then judging whether the route request RREQ is repeatedly received. If the receiving is repeated, the optimal reverse routing table is discarded, the route request RREQ is discarded, if not, the route request frame is updated, and E3TX in the reverse routing table is updated. Before forwarding the route request RREQ, the node will determine whether the route request points to itself or whether a route entry pointing to the destination node already exists in the node route table according to the destination address in the route request frame structure. If the condition is met, the node discards the route request RREQ and sends a route response RREP through a reverse route table, and a route response frame comprises a route decision value of the node. And if the condition is not met, the routing node forwards the updated routing request frame. The process of the route request RREQ is shown in fig. 2.
In the route response processing process, the node receiving the route response RREP calculates the corresponding route table entry according to the data in the route response frame and the local energy information of the node, and the structure of the route response frame is shown in table 2 below.
Table 2 route response frame structure
The node determines whether the route response RREP is received repeatedly, if so, the route response RREP is discarded, otherwise, the route response RREP is discarded. The node compares the locally calculated information with the data in the route response frame, and the node updates the result of the maximum remaining energy cost value. The route table entry is updated through the route response frame, so that the response speed of the next route request RREQ can be improved. The process of the route response RREP is shown in fig. 3.
The scheme improves the AODV routing table entity to a certain extent, and the ETX value, the maximum residual energy cost value and the E3TX decision value are added in the table entry. Table 3 is a routing table entity herein.
Table 3 routing table entity
| Destination address (32bit) |
| Destination serial number (32bit) |
| Hop count (16bit) |
| Last hop count (16bit) |
| Next hop node address (32bit) |
| ETX value (32bit) |
| Maximum residual energy value (32bit) |
| E3TX decision value (32bit) |
| Leader List (32bit) |
| Survival time (32bit) |
| Sign (8bit) |
The energy-efficient routing decision algorithm of the wireless sensor network only generates one reverse route, which just meets the requirement of a linear routing network in a tunnel environment. Although only one reverse route is finally generated, the route decision algorithm can combine energy efficiency, hop count, ETX and reliability to obtain the optimal path from the source node to the destination node.
Link reliability is related to many factors, directly affecting the reliability of paths and networks. The invention uses an example to verify the effect of the method. Fig. 4 shows a simple 8-node linear tunnel network.
For ease of analysis, the figure 4 linear network is here changed to the simple network illustration shown in figure 5 below. The data above the nodes of fig. 4 and 5 represents the node energy remaining value, and the data on the link in the node of fig. 5 represents the link packet success rate.
In order to achieve simple calculation, the invention directly utilizes the battery residual voltage value to represent the node energy value. Here exemplified by the path S-6-2-D in fig. 5, which has a hop count of 3 hops. Using equation (1), the ETX can be calculated as:
the final decision value can be obtained by calculating formula (3), and the result has a certain difference compared with ETX, because the invention not only takes the link reliability as the distance decision factor, but also considers the hop count and the node residual energy. The final decision value calculation is shown below.
The results of all the exemplary 4 path calculations in this example are shown in table 4. Unlike the intermediate node, the destination node does not use the actual battery residual voltage of the destination node but uses the initialization energy voltage value E when calculating the routing decision valueintAnd E isintMay be different from the actual remaining battery voltage at the destination node. But when the destination node is acting as an intermediate node for other paths, then according to the decision strategy of the present invention,and calculating by using the actual battery residual voltage of the node.
TABLE 4 comparison of the final decision values of E3TX of the present invention with AODV and ETX
| Decision path | AODV | ETX | E3TX |
| Route S-5-3-1-D | 4 | 4.699 | 4.377 |
| |
1 | 4.762 | 3.633 |
| Route S-4- |
2 | 3.410 | 4.177 |
| Route S-6-2- |
3 | 3.703 | 3.579 |
As can be seen from table 4, there is a large difference between the final decision values of the three routing policies. AODV and ETX have certain limitations due to single consideration factors. The E3TX of the invention has obvious advantages in the energy and delay sensitive network in terms of comprehensive decision of network energy balance, hop count, expected transmission number, network delay and the like, and particularly can show the characteristics and advantages of the network in the tunnel linear type routing network.
Claims (3)
1. An energy-efficient routing decision method for a wireless sensor network in a tunnel environment is characterized by comprising the following steps:
step 1: the tunnel node is used as a source node to initiate a route request RREQ and initialize a route request frame;
step 2: after receiving the route request RREQ, the route node processes the route request RREQ;
2.1 calculating decision factors in a routing table, wherein the decision factors comprise an expected transmission number, a maximum remaining energy cost value and an energy effective expected transmission number of a certain path;
the expected number of transmissions is given by equation (1),
in the formula stnRefers to the expected number of transmissions, ETX, for a link in a tunneliRepresenting a single hop expected number of transmissions;
the maximum remaining energy cost value is derived from equation (2),
in the formula senRefers to the maximum penalty value of the link node, i.e. the maximum value of the energy cost of residue, SnSet of path nodes representing self-organizing route generation in tunnels, f (E)i) Refers to the residual energy cost value; eiRepresenting the remainder of the ith routing node in a tunneled wireless monitoring networkEnergy, i ═ 1,2, … n, where n is the total number of routing nodes;
the expected transmission number ETX value is derived from equation (3),
wherein the weight λ satisfies 0< λ < 1;
2.2 judging whether the route request RREQ is received repeatedly, if so, updating the optimal reverse route table, then discarding the route request RREQ, if not, updating the route request frame, and updating E3TX in the reverse route table;
2.3 judging whether the route request points to itself or the route table item pointing to the destination node in the node route table according to the destination address in the route request frame structure, if the condition is satisfied, the node discards the route request RREQ and sends a route response RREP through a reverse route table, and the route response frame contains the route decision value of the node; if the condition is not met, the routing node forwards the updated route request RREQ;
and step 3: after receiving the route response RREP, the route node processes the route response RREP;
3.1 the node receiving the route response RREP calculates the decision factor and other items in the corresponding route table according to the data in the route response frame and the local energy information of the node;
3.2 determining whether the route response RREP is received repeatedly, if so, discarding the route response RREP, otherwise, forwarding the route response RREP;
3.3 judging whether reaching the source node, if not, updating the forwarding route response RREP, if yes, discarding the route response RREP and generating a reverse route;
and 4, step 4: and repeating the step 3 until the route response RREP returns to the source node, and generating a reverse route through the route table, wherein the route path is the optimal path from the source node to the destination node.
2. The method for energy-efficient routing decision making for wireless sensor networks in tunnel environments according to claim 1, wherein the node residual energy cost value is calculated using equation (4):
in the formula EiRepresenting the residual energy of the ith routing node in the tunnel wireless monitoring network, wherein i is 1,2, … n, and n is the total number of the routing nodes; e denotes a natural constant.
3. The method for energy-efficient routing decision of wireless sensor network in tunnel environment according to claim 1, wherein the expected transmission number of single hop is given by formula (5),
in the formula di f，di rRespectively showing the success rate of the forward packet and the success rate of the reverse packet; reverse packet success rate d of the schemei r1 is ═ 1; forward packet success rate di fCan be calculated using the following equation (6),
wherein RSSI is a received signal strength indication, RSSI is obtained by hardware in the wireless communication process, and psr is a packet success rate; e denotes a natural constant.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910219489.4A CN109873765B (en) | 2019-03-21 | 2019-03-21 | Energy-efficient routing decision method for wireless sensor network in tunnel environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910219489.4A CN109873765B (en) | 2019-03-21 | 2019-03-21 | Energy-efficient routing decision method for wireless sensor network in tunnel environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109873765A CN109873765A (en) | 2019-06-11 |
| CN109873765B true CN109873765B (en) | 2021-02-19 |
Family
ID=66920996
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910219489.4A Active CN109873765B (en) | 2019-03-21 | 2019-03-21 | Energy-efficient routing decision method for wireless sensor network in tunnel environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109873765B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112954727B (en) * | 2021-03-09 | 2022-02-22 | 陕西高速电子工程有限公司 | Tunnel wireless sensor network communication method and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101945460A (en) * | 2010-08-26 | 2011-01-12 | 湘潭大学 | Energy-saving AODV routing method used in Ad Hoc network environment |
| WO2013126843A2 (en) * | 2012-02-24 | 2013-08-29 | Interdigital Patent Holdings, Inc. | Lte operation in small cells using dynamic shared spectrum |
| WO2015085273A1 (en) * | 2013-12-06 | 2015-06-11 | Interdigital Patent Holdings, Inc. | Layered connectivity in wireless systems |
| CN104796333A (en) * | 2015-03-31 | 2015-07-22 | 桂林电子科技大学 | IPv6-based wireless sensor network and Internet multi-gateway interconnection scheme |
| CN105916183A (en) * | 2016-06-15 | 2016-08-31 | 上海物联网有限公司 | Wireless sensor network routing method based on link quality and residual energy |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070060147A1 (en) * | 2005-07-25 | 2007-03-15 | Shin Young S | Apparatus for transmitting data packets between wireless sensor networks over internet, wireless sensor network domain name server, and data packet transmission method using the same |
-
2019
- 2019-03-21 CN CN201910219489.4A patent/CN109873765B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101945460A (en) * | 2010-08-26 | 2011-01-12 | 湘潭大学 | Energy-saving AODV routing method used in Ad Hoc network environment |
| WO2013126843A2 (en) * | 2012-02-24 | 2013-08-29 | Interdigital Patent Holdings, Inc. | Lte operation in small cells using dynamic shared spectrum |
| WO2015085273A1 (en) * | 2013-12-06 | 2015-06-11 | Interdigital Patent Holdings, Inc. | Layered connectivity in wireless systems |
| CN104796333A (en) * | 2015-03-31 | 2015-07-22 | 桂林电子科技大学 | IPv6-based wireless sensor network and Internet multi-gateway interconnection scheme |
| CN105916183A (en) * | 2016-06-15 | 2016-08-31 | 上海物联网有限公司 | Wireless sensor network routing method based on link quality and residual energy |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109873765A (en) | 2019-06-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ali et al. | An on-demand power and load-aware multi-path node-disjoint source routing scheme implementation using NS-2 for mobile ad-hoc networks | |
| Chen et al. | Energy-balanced cooperative routing in multihop wireless ad hoc networks | |
| CN109873765B (en) | Energy-efficient routing decision method for wireless sensor network in tunnel environment | |
| Amraoui et al. | Mobility quantification for MultiPoint Relays selection algorithm in Mobile Ad hoc Networks | |
| Alappatt et al. | A hybrid approach using ant colony optimization and binary particle swarm optimization (ACO: BPSO) for energy efficient multi-path routing in MANET | |
| Mehta et al. | Energy efficient cross-layer design in MANETs | |
| Periyasamy et al. | Energy optimized ad hoc on-demand multipath routing protocol for mobile ad hoc networks | |
| CN111970731B (en) | Spray and Wait mobile opportunistic network routing method based on node reputation | |
| Ferdous et al. | Randomized energy-based AODV protocol for wireless ad-Hoc network | |
| EffatParvar et al. | Load balancing and route stability in mobile ad hoc networks base on AODV protocol | |
| Devasenapathy et al. | Energy efficient Wireless Sensor Networks using FAF and dual cluster head technique for weed detection | |
| Bheemalingaiah et al. | Energy aware on-demand multipath routing protocol in mobile ad hoc networks | |
| Ahmad et al. | Enhanced AODV route Discovery and Route Establishment for QOS provision for real time transmission in MANET | |
| Kumar et al. | On the use of multiple hops in next generation cellular architectures | |
| CN115150914A (en) | Efficient routing mechanism based on multipath routing | |
| Benakappa et al. | An energy-aware node disjoint multipath routing protocol for MANETs with dynamictransmission range adjustment | |
| Sofat et al. | Ant colony based dynamic source routing | |
| Aron et al. | Energy efficient topology control algorithm for wireless mesh networks | |
| Cui et al. | Optimal distributed multicast routing using network coding: Theory and applications | |
| Kumar et al. | Energy aware localized routing in rendezvous point based mobile sink strategy for wireless sensor networks | |
| CN110324875A (en) | A kind of wireless sensor network energy consumption balance method for routing based on node center | |
| Choi et al. | Bio-inspired routing protocol based on pheromone diffusion in mobile ad hoc networks | |
| Xu et al. | A Reliable Multipath Routing Protocol Based on Link Stability | |
| Gui et al. | An entropy-based long-life multipath routing algorithm in manet | |
| Alam et al. | A Q-learning based routing protocol for body area networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |