CN114040469B - Pre-awakening rapid routing and energy-efficient routing method and system - Google Patents
Pre-awakening rapid routing and energy-efficient routing method and system Download PDFInfo
- Publication number
- CN114040469B CN114040469B CN202111310765.1A CN202111310765A CN114040469B CN 114040469 B CN114040469 B CN 114040469B CN 202111310765 A CN202111310765 A CN 202111310765A CN 114040469 B CN114040469 B CN 114040469B
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- wur
- base station
- nodes
- 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
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000004891 communication Methods 0.000 claims description 29
- 230000005540 biological transmission Effects 0.000 claims description 20
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 4
- 238000005265 energy consumption Methods 0.000 description 21
- 238000010586 diagram Methods 0.000 description 5
- 230000002035 prolonged effect Effects 0.000 description 4
- 230000002618 waking effect Effects 0.000 description 4
- 230000000052 comparative effect Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/30—Connectivity information management, e.g. connectivity discovery or connectivity update for proactive routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor 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
-
- 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
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a pre-awakening rapid routing and energy-efficient routing method and system, wherein the method comprises the following steps: randomly and uniformly deploying partial WuR nodes in the wireless sensor network; and carrying out data routing on the delay sensitive data packet by adopting a pre-awakening strategy, pre-establishing a routing path to the base station by broadcasting an awakening signal, and continuously transmitting the delay sensitive data packet to the base station based on the pre-established routing path. By reducing the deployment number of WuR nodes, the deployment cost is reduced; meanwhile, a pre-wake-up strategy is adopted for data routing, so that network routing delay can be effectively reduced.
Description
Technical Field
The present invention relates to the field of data transmission technologies, and in particular, to a method and a system for fast routing and energy efficient routing with pre-wakeup.
Background
A wireless sensor network is a wireless network composed of a large number of stationary sensors in an ad hoc and multi-hop manner, with the purpose of cooperatively sensing, collecting, processing and transmitting monitoring information of a perceived object within a geographic area covered by the network, and reporting to a user. The sensing nodes are deployed in the area to be monitored, sense the surrounding physical phenomena, transmit the sensed data to the base station through the multi-hop routing network, and then the base station is connected with the control center, so that the control center makes a decision. Since the sensor nodes are battery powered and in many cases their batteries cannot be replaced, the energy is extremely limited. To save energy, most sensor nodes employ duty cycle modes of operation. In this mode, the periodic awake/sleep of a node, the ratio of the nodes in awake to the overall cycle time during a cycle is referred to as the duty cycle. Since the energy consumption of a node in sleep state is only 1/1000 of that of it in awake state. Thus, the node should be in sleep state as much as possible, but this increases the delay of the data routing (this delay is called sleep delay), because when the transmitting node has data to transmit, if its receiving node is in sleep state, the transmitting node needs to wait for the receiving node to wake up before routing the data, and because each hop generates a larger delay, the end-to-end delay of the route to the base station is larger.
To reduce the delay of data routing, a wake-up radio (WuR) hardware is added to the normal node, and a Main Radio (MR) is used to receive and transmit data in the WuR node, so that the main power consumption of the node is on MR, while the WuR power consumption is very low and 2 orders of magnitude lower than the MR power consumption. The working mode adopted by the WuR node is: wuR is always in awake state because of low energy consumption, and MR shifts to sleep state when there is no data operation. When the node has data transmission, the transmitting node transmits a wake-up message (WuC) to the WuR of the receiving node, and the WuR of the receiving node wakes up the MR of the receiving node after receiving the wake-up signal. Thus, in a WuR node, the MR of the node is in a wake-on-demand manner. Since there is a WuR that can wake up the MR as needed when the sending node has data transmission, there is no sleep delay in the WuR node-based network, but a small period of time t is required to interact and wake up the MR between wurs. But the period of time that increases is relatively much smaller than sleep delay, especially in low duty cycle WSNs (wireless sensor networks).
Although WuR enabled WSNs can effectively reduce the delay of data routing, this is achieved by adding node hardware WuR, thus increasing the deployment cost of the network. Because the deployment of the sensor nodes is denser, the data volume of the deployment is large, and therefore, one WuR is added to each node, and the cost of one WuR is low, but the huge quantity of the sensor nodes can cause the cost of the network deployment to rise quickly, so that the cost of the network deployment is lower. Thus, how to effectively reduce delay is a significant problem facing researchers with minimizing the number of WuR nodes that need to be deployed to reduce deployment costs.
The inventors have found that in the conventional network study based on WuR nodes, all nodes in the network are WuR nodes. Thus, the most effective way to reduce the deployment cost is to deploy only a certain proportion of WuR nodes, which can effectively reduce the deployment cost of the network. However, if only the deployment WuR nodes are reduced, the deployment cost can be reduced, but at the same time, some nodes have no WuR, there is a sleep delay, so that the delay of the data routing becomes large. Furthermore, since the near base station node is to carry data packets from more far base stations, the energy consumption of the nodes near the near base station is higher than the energy consumption near the far base station, and the nodes need to consume a certain amount of energy additionally for sending the wake-up signal, which definitely increases the burden of the network. Therefore, how to ensure the delay of data transmission and effectively reduce the number of WuR nodes is very significant and difficult to study. To the best of our current study, no similar study has been done.
Disclosure of Invention
The invention provides a pre-awakening rapid routing and energy-efficient routing method and system, which are used for solving the problem that the existing routing scheme cannot achieve low delay and low cost of a network.
In a first aspect, a pre-awakened fast routing and energy efficient routing method is provided, comprising:
randomly and uniformly deploying partial WuR nodes in the wireless sensor network;
and carrying out data routing on the delay sensitive data packet by adopting a pre-awakening strategy, pre-establishing a routing path to the base station by broadcasting an awakening signal, and continuously transmitting the delay sensitive data packet to the base station based on the pre-established routing path.
In order to reduce network routing delay, all nodes of the existing wireless sensor network adopt WuR nodes, and the deployment cost is increased, so that the deployment cost is reduced by adopting a mode of deploying part of WuR nodes. Meanwhile, in consideration of the problem that the network routing delay is increased due to the reduction of WuR nodes, the invention performs data routing through a pre-awakening strategy so as to reduce the network routing delay. Specifically, when the existing wireless sensor network performs data transmission, a node is used for waking up a next-hop node, then the data transmission is performed, the next-hop node is continuously woken up after the next-hop node receives the data, and the cycle is repeated, and the network routing delay is increased by taking the routing mode of stopping and the like into consideration. The partial WuR nodes are arranged, and the speed of establishing data connection in a wake-up mode is far faster than the speed of data transmission, so that even if a common node exists in a routing path, the data connection with the common node can be established before the data reception is completed, and the network routing low delay is realized.
Further, the data routing for the delay sensitive data packet by adopting a pre-wake policy specifically includes:
a1: when a transmitting node needs to transmit a delay sensitive data packet, broadcasting a wake-up signal in the communication range of the transmitting node;
a2: when the WuR node exists in the communication range, selecting the WuR node closest to the base station as a next-hop node for data routing, otherwise, selecting a first natural awakened common node in the communication range as the next-hop node for data routing;
a3: whether the next-hop node is a WuR node or a normal node, the data transmission is started immediately as long as the node wakes up; meanwhile, the node broadcasts a wake-up signal in the communication range, and selects a next hop node;
a4: repeating the step A3 until the route reaches the base station, thereby pre-establishing a route path;
a5: the delay sensitive data packets are continuously transmitted based on a pre-established routing path to the base station.
Further, the method further comprises the following steps:
and adopting a duty cycle routing strategy to route the data for the common data packet.
By adopting the differentiated service mode, the routing speed is not required to be high when the common data packet is routed, the time for the common data packet to reach the base station is not required to be high, and the data routing can consume extra energy if the pre-awakening strategy is adopted, so that the service life of the wireless sensor network is not facilitated.
Further, in the whole wireless sensor network, the duty ratio of the WuR node in a preset range from the base station is smaller than that of other WuR nodes.
The inventor finds that, because the node near the base station routes the data packet from the node far away from the base station, the data volume is relatively large, so the energy consumption of the node near the base station is generally larger than that of the node far away from the base station, and the energy consumption of the node near the base station directly affects the service life of the wireless sensor network. In general, when all nodes near the near base station die, the far base station also has 80% of the remaining energy. Therefore, the duty ratio of the WuR node in the preset range from the base station is smaller than that of other WuR nodes, namely the energy consumption of the WuR node close to the base station is reduced, and the service life of the wireless sensor network is prolonged. These reduced duty cycle WuR nodes do not in fact affect network delay because a certain routing path is already established after the pre-wakeup is employed.
Further, in the whole wireless sensor network, the duty ratio of the WuR node within three hops and more from the base station isWuR node duty cycle within one hop from base station is +.>The duty cycle of the WuR node in the two-hop range from the base station is +.>Wherein 0 is<α<β<1. The data quantity of the node which is closer to the base station is larger, and the energy consumption is higher, so that the data quantity is graded according to the distance between the node and the base station, and the service life of the wireless sensor network can be prolongedThe routing delay is reduced as much as possible.
Further, the ratio θ of WuR nodes in the wireless sensor network satisfies the following relationship:
wherein N is WuR The number of WuR nodes in the wireless sensor network is the number of total nodes in the wireless sensor network.
In a second aspect, a pre-awakened fast routing and energy efficient routing system is provided, comprising a wireless sensor network and a base station;
the wireless sensing network comprises WuR nodes and common nodes which are distributed randomly and uniformly, and each WuR node and each common node can establish wireless connection with the WuR node, the common node or the base station in the communication range of the wireless sensing network;
when the wireless sensor network needs to route the delay sensitive data packet, a pre-wake-up strategy is adopted to route the data, a route path reaching the base station is pre-established in a mode of broadcasting a wake-up signal, and the delay sensitive data packet is continuously transmitted to the base station based on the pre-established route path.
Further, the performing data routing by adopting the pre-wake policy specifically includes:
a1: when a transmitting node needs to transmit a delay sensitive data packet, broadcasting a wake-up signal in the communication range of the transmitting node;
a2: when the WuR node exists in the communication range, selecting the WuR node closest to the base station as a next-hop node for data routing, otherwise, selecting a first natural awakened common node in the communication range as the next-hop node for data routing;
a3: whether the next-hop node is a WuR node or a normal node, the data transmission is started immediately as long as the node wakes up; meanwhile, the node broadcasts a wake-up signal in the communication range, and selects a next hop node;
a4: repeating the step A3 until the route reaches the base station, thereby pre-establishing a route path;
a5: the delay sensitive data packets are continuously transmitted based on a pre-established routing path to the base station.
Further, when the wireless sensor network needs to route the common data packet, a duty cycle routing strategy is adopted for data routing.
Further, in the whole wireless sensor network, the duty ratio of the WuR node in a preset range from the base station is smaller than that of other WuR nodes.
Advantageous effects
The invention provides a pre-awakening rapid routing and energy-efficient routing method and system, which have the following advantages compared with the prior art: in the existing wireless sensor network, in order to reduce network routing delay, all nodes adopt WuR nodes, so that the deployment cost is increased; the invention adopts the mode of deploying partial WuR nodes to reduce the deployment cost. Meanwhile, in consideration of the problem that the network routing delay is increased due to the reduction of WuR nodes, the invention performs data routing through a pre-awakening strategy so as to reduce the network routing delay. Specifically, when the existing wireless sensor network performs data transmission, a node is used for waking up a next-hop node, then the data transmission is performed, the next-hop node is continuously woken up after the next-hop node receives the data, and the cycle is repeated, and the network routing delay is increased by taking the routing mode of stopping and the like into consideration. The partial WuR nodes are arranged, and the speed of establishing data connection in a wake-up mode is far faster than the speed of data transmission, so that even if a common node exists in a routing path, the data connection with the common node can be established before the data reception is completed, and the network routing low delay is realized. The method realizes the low delay and low cost of the network.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic diagram of a pre-awakened fast routing and energy efficient routing method provided by an embodiment of the present invention;
FIG. 2 is a comparison diagram of routing data packets to a base station by nodes at different distances from the base station when different strategies are employed in accordance with an embodiment of the present invention;
FIG. 3 shows node energy consumption of nodes with different duty cycles at a remote base station when different strategies are adopted according to the embodiment of the invention;
FIG. 4 shows node energy consumption of nodes with different duty cycles at a near base station when different strategies are adopted according to the embodiment of the invention;
fig. 5 illustrates network lifetime when different policies are used and the duty cycle of the different policies is different according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be described in detail below. It will be apparent that the described embodiments are only some, but not all, embodiments of the invention. All other embodiments, based on the examples herein, which are within the scope of the invention as defined by the claims, will be within the scope of the invention as defined by the claims.
Example 1
The embodiment provides a pre-awakening fast routing and energy-efficient routing method, which comprises the following steps:
randomly and uniformly deploying partial WuR nodes in the wireless sensor network;
a pre-wake-up strategy is adopted for data routing of the delay sensitive data packet, a routing path reaching the base station is pre-established in a mode of broadcasting a wake-up signal WuC, and the delay sensitive data packet is continuously transmitted to the base station based on the pre-established routing path;
and adopting a duty cycle routing strategy to route the data for the common data packet.
In order to reduce network routing delay, all nodes of the existing wireless sensor network adopt WuR nodes, and the deployment cost is increased, so that the deployment cost is reduced by adopting a mode of deploying part of WuR nodes. Meanwhile, in consideration of the problem that the network routing delay is increased due to the reduction of WuR nodes, the invention performs data routing through a pre-awakening strategy so as to reduce the network routing delay. Specifically, when the existing wireless sensor network performs data transmission, a node is used for waking up a next-hop node, then the data transmission is performed, the next-hop node is continuously woken up after the next-hop node receives the data, and the cycle is repeated, and the network routing delay is increased by taking the routing mode of stopping and the like into consideration. The partial WuR nodes are arranged, and the speed of establishing data connection in a wake-up mode is far faster than the speed of data transmission, so that even if a common node exists in a routing path, the data connection with the common node can be established before the data reception is completed, and the network routing low delay is realized.
The invention adopts a differentiated service mode, and for the common data packet, the routing speed is not required to be high, the time for the common data packet to reach the base station is not required to be high, and the data routing can consume extra energy if a pre-awakening strategy is adopted, so that the service life of the wireless sensor network is not facilitated.
Specifically, as shown in fig. 1, a schematic diagram of a wireless sensor network provided by an embodiment of the present invention is configured with a portion of WuR nodes, which are distributed randomly and uniformly, where a ratio θ of WuR nodes in the wireless sensor network satisfies the following relationship:
wherein N is WuR The number of WuR nodes in the wireless sensor network is the number of total nodes in the wireless sensor network. In the implementation, the value of the proportion theta is selected according to actual needs. Assuming that the communication radius of the node is r, the wake-up time of the node is d link Time d when packet arrives at node date The transmission time of one hop of the data packet is tau. D of all nodes during network initialization link And d date Are all 0. Since only some of the nodes in the wireless sensor network are WuR nodes, the nodes must wait for a node within its communication range to wake up before transmitting a data packet, and the process of waiting for the node to wake up is called data connection, regardless of whether the node is a WuR node. Since the duty ratio of the base station is 1, nodes within a distance r from the base station can directly perform data connection, and the waiting time is 0.
The method for carrying out data routing on the delay sensitive data packet by adopting a pre-wake-up strategy specifically comprises the following steps:
a1: when the transmitting node needs to transmit the delay sensitive data packet, it broadcasts a wake-up signal WuC within its communication range;
a2: only the WuR node can receive the wake-up signal WuC and wake up the MR of the node in advance, and if the WuR node exists in the communication range, the WuR node closest to the base station is selected as the next hop node N next Data routing is carried out, otherwise, a first natural awakened common node in the communication range is selected as a next-hop node N next Data routing is performed and the next hop node N is updated next Time d of wake-up link ；
A3: no matter the next hop node N next Whether a WuR node or a normal node, as long as the node wakes up, immediately starts data transmission; meanwhile, the data packet does not wait for reaching the next hop node N next Then data connection is carried out, the node continues to broadcast a wake-up signal WuC in the communication range after being waken up, and a next hop node is selected;
a4: repeating the step A3 until the route reaches the base station, and stopping the data connection process, thereby pre-establishing a route path; because the data connection speed by using the WuR nodes is very fast and far faster than the routing speed of the data packet, even if only part of WuR nodes exist in the network, one awakened route can be established before the data packet arrives;
a5: the delay sensitive data packets are continuously transmitted based on a pre-established routing path to the base station.
When the first hop node wakes up, the node can start data routing, and the data routing process and the data connection process are performed simultaneously. Each time node N routes a packet to the next hop, the time the next hop node wakes up is compared with the time the packet arrives at node N. If the time d of the packet reaching the node N date Less than d link Indicating that the next hop has not yet been awakened when the packet arrives at the previous hop, so that we update the next hop node N next D of (2) date Is d link +τ, otherwise updating next hop node N next D of (2) date Is d date +τ. Routing data packets to base station, we are for d on each node link And d date Updated to 0 for the next round of packet routing.
The inventor finds that, because the node near the base station routes the data packet from the node far away from the base station, the data volume is relatively large, so the energy consumption of the node near the base station is generally larger than that of the node far away from the base station, and the energy consumption of the node near the base station directly affects the service life of the wireless sensor network. In general, when all nodes near the near base station die, the far base station also has 80% of the remaining energy. Therefore, in this embodiment, in the entire wireless sensor network, the duty ratio of the WuR node within the preset range from the base station is smaller than the duty ratio of other WuR nodes. The energy consumption of the WuR node near the base station is reduced, and the service life of the wireless sensor network is prolonged. These reduced duty cycle WuR nodes do not in fact affect network delay because a certain routing path is already established after the pre-wakeup is employed.
Further, in the whole wireless sensor network, the duty ratio of the WuR node within three hops and above from the base station isWuR node duty cycle within one hop from base station is +.>The duty cycle of the WuR node in the two-hop range from the base station is +.>Wherein 0 is<α<β<1. The data quantity of the node which is closer to the base station is larger, and the energy consumption is higher, so that the routing delay can be reduced as much as possible while the service life of the wireless sensor network is prolonged by carrying out hierarchical arrangement according to the distance between the node and the base station.
Example 2
The embodiment provides a pre-awakening rapid routing and energy-efficient routing system, which comprises a wireless sensor network and a base station;
the wireless sensing network comprises WuR nodes and common nodes which are distributed randomly and uniformly, and each WuR node and each common node can establish wireless connection with the WuR node, the common node or the base station in the communication range of the wireless sensing network;
when the wireless sensor network needs to route the delay sensitive data packet, a pre-wake-up strategy is adopted to route the data, a route path reaching the base station is pre-established in a mode of broadcasting a wake-up signal WuC, and the delay sensitive data packet is continuously transmitted to the base station based on the pre-established route path;
when the wireless sensor network needs to route the common data packet, the data is routed by adopting a duty cycle routing strategy.
The data routing by adopting the pre-wake-up strategy specifically comprises the following steps:
a1: when the transmitting node needs to transmit the delay sensitive data packet, it broadcasts a wake-up signal WuC within its communication range;
a2: when the WuR node exists in the communication range, selecting the WuR node closest to the base station as a next-hop node for data routing, otherwise, selecting a first natural awakened common node in the communication range as the next-hop node for data routing;
a3: whether the next-hop node is a WuR node or a normal node, the data transmission is started immediately as long as the node wakes up; meanwhile, the node broadcasts a wake-up signal in the communication range, and selects a next hop node;
a4: repeating the step A3 until the route reaches the base station, thereby pre-establishing a route path;
a5: the delay sensitive data packets are continuously transmitted based on a pre-established routing path to the base station.
Preferably, in the whole wireless sensor network, the duty ratio of the WuR node in a preset range from the base station is smaller than that of other WuR nodes.
It is to be understood that the same or similar parts in the above embodiments may be referred to each other, and that in some embodiments, the same or similar parts in other embodiments may be referred to.
In order to further understand the technical solution of the present invention, the following description is further provided with reference to several comparative experiments of the routing method.
In a conventional WuR node-free network, a duty cycle routing strategy is generally adopted (i.e., as described in the first paragraph of the background), and we refer to this method as DC-RS. For networks where all nodes are WuR nodes, the TR-WuR routing policy is typically employed.
As shown in fig. 2, a comparison diagram of routing data packets to a base station by nodes at different locations from the base station when different strategies are employed. In the figure, θ represents the ratio of WuR nodes in the network, DC-RS is a routing method adopted in a network without WuR nodes, TR-WuR is a routing method adopted in a network with all WuR nodes, and PA-WuRES is a routing method adopted in the present invention. As can be seen from the figure, the delay of the routing by using the DC-RS is the greatest, because the routing mode of the DC-RS is "stop-and-wait", and each hop needs to wait for the arrival of the data packet and then connect the next hop in the routing process, and then route the data. Thus, each hop may incur a large delay. At a distance from the base station, the number of hops of the route may be greater, and thus the delay of the route of the far base station packet is greater. For the TR-WuR method, all nodes in the network are WuR nodes, and the network is not changed in the routing method, or adopts a stop-and-wait type, but the time for waking up the next hop node by using WuR is relatively short, so that the delay of the network can be effectively reduced. For the PA-WuRES method adopted by the invention, the data routing process and the data connection process are carried out simultaneously, so that the network delay can be effectively reduced, and when the proportion of the WuR nodes in the network is 20%, the network delay is lower than that of the TR-WuR method by adopting the method.
As shown in fig. 3, when different strategies are adopted, node energy consumption diagrams of nodes with different duty ratios at a remote base station are shown; fig. 4 shows the node power consumption of nodes with different duty cycles at the near base station when different strategies are adopted. Fig. 3-4 show the energy consumption of nodes at different locations from the base station when different strategies are adopted, and the energy consumption of nodes near the near base station (near the base station 0-r) is generally greater than that of nodes near the far base station because the data packets from the nodes near the far base station are routed. The energy consumption near the near base station directly affects the service life of the network, so that the energy consumption near the near base station is effectively reduced. Since the WuR node consumes additional energy to send the wake-up signal, it can be seen from fig. 3-4 that the TR-WuR is the highest energy consumption in both the far and near base stations of the three routing methods. Because there is often much residual energy at the node near the far base station when the network life is exhausted, the routing method of the invention fully utilizes the network residual energy, and for the WuR node near the base station in the method of the invention, the duty ratio of the WuR node is reduced, the network life is prolonged, and the energy consumption of the node near the base station can be effectively reduced by adopting the method of the invention as shown in fig. 4.
As shown in fig. 5, to employ different strategies, network lifetime is at different duty cycles. It can be seen that as the duty cycle increases, the network lifetime decreases. Under the same duty ratio, the method of the invention can effectively improve the service life of the network.
While embodiments of the present invention have been shown and described above, it will be understood that the above embodiments are illustrative and not to be construed as limiting the invention, and that variations, modifications, alternatives and variations may be made to the above embodiments by one of ordinary skill in the art within the scope of the invention.
Claims (8)
1. A pre-awakened fast routing and energy efficient routing method, comprising:
randomly and uniformly deploying partial WuR nodes in the wireless sensor network;
a pre-wake-up strategy is adopted for data routing of the delay sensitive data packet, a routing path reaching the base station is pre-established in a mode of broadcasting a wake-up signal, and the delay sensitive data packet is continuously transmitted to the base station based on the pre-established routing path;
the method for carrying out data routing on the delay sensitive data packet by adopting a pre-wake-up strategy specifically comprises the following steps:
a1: when a transmitting node needs to transmit a delay sensitive data packet, broadcasting a wake-up signal in the communication range of the transmitting node;
a2: when the WuR node exists in the communication range, selecting the WuR node closest to the base station as a next-hop node for data routing, otherwise, selecting a first natural awakened common node in the communication range as the next-hop node for data routing;
a3: whether the next-hop node is a WuR node or a normal node, the data transmission is started immediately as long as the node wakes up; meanwhile, the node broadcasts a wake-up signal in the communication range, and selects a next hop node;
a4: repeating the step A3 until the route reaches the base station, thereby pre-establishing a route path;
a5: the delay sensitive data packets are continuously transmitted based on a pre-established routing path to the base station.
2. The pre-awakened fast routing and energy-efficient routing method of claim 1, further comprising:
and adopting a duty cycle routing strategy to route the data for the common data packet.
3. The pre-awakening fast routing and energy efficient routing method according to claim 1, wherein the duty cycle of WuR nodes within a preset range from a base station is smaller than the duty cycle of other WuR nodes in the whole wireless sensor network.
4. The pre-awakening fast routing and energy-efficient routing method according to claim 3, wherein the duty cycle of WuR nodes in a range of three hops and above from a base station in the entire wireless sensor network isWuR node duty cycle within one hop from base station is +.>The duty cycle of the WuR node in the two-hop range from the base station is +.>Wherein 0 is<α<β<1。
5. The pre-awakening fast routing and energy efficient routing method according to claim 1, wherein the ratio θ of WuR nodes in the wireless sensor network satisfies the following relationship:
wherein N is WuR The number of WuR nodes in the wireless sensor network is the number of total nodes in the wireless sensor network.
6. A pre-awakened fast routing and energy efficient routing system, comprising a wireless sensor network and a base station;
the wireless sensor network comprises WuR nodes and common nodes which are distributed randomly and uniformly, and each WuR node and each common node can establish wireless connection with the WuR node, the common node or the base station in the communication range of the wireless sensor network;
when the wireless sensor network needs to route the delay sensitive data packet, a pre-wake-up strategy is adopted to route the data, a route path reaching the base station is pre-established in a mode of broadcasting a wake-up signal, and the delay sensitive data packet is continuously transmitted to the base station based on the pre-established route path;
the data routing by adopting the pre-wakeup strategy specifically comprises the following steps:
a1: when a transmitting node needs to transmit a delay sensitive data packet, broadcasting a wake-up signal in the communication range of the transmitting node;
a2: when the WuR node exists in the communication range, selecting the WuR node closest to the base station as a next-hop node for data routing, otherwise, selecting a first natural awakened common node in the communication range as the next-hop node for data routing;
a3: whether the next-hop node is a WuR node or a normal node, the data transmission is started immediately as long as the node wakes up; meanwhile, the node broadcasts a wake-up signal in the communication range, and selects a next hop node;
a4: repeating the step A3 until the route reaches the base station, thereby pre-establishing a route path;
a5: the delay sensitive data packets are continuously transmitted based on a pre-established routing path to the base station.
7. The pre-awakened fast routing and energy efficient routing system of claim 6, wherein a duty cycle routing strategy is employed for data routing when a wireless sensor network needs to route normal data packets.
8. The pre-awakened fast routing and energy efficient routing system of claim 6, wherein a duty cycle of WuR nodes within a preset range from a base station is smaller than other WuR nodes throughout a wireless sensor network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111310765.1A CN114040469B (en) | 2021-11-08 | 2021-11-08 | Pre-awakening rapid routing and energy-efficient routing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111310765.1A CN114040469B (en) | 2021-11-08 | 2021-11-08 | Pre-awakening rapid routing and energy-efficient routing method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114040469A CN114040469A (en) | 2022-02-11 |
| CN114040469B true CN114040469B (en) | 2024-03-19 |
Family
ID=80136628
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111310765.1A Active CN114040469B (en) | 2021-11-08 | 2021-11-08 | Pre-awakening rapid routing and energy-efficient routing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114040469B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102017527A (en) * | 2007-12-17 | 2011-04-13 | 韩国电子通信研究院 | Wake-up apparatus and wake-up method for a low power sensor node |
| CN102740427A (en) * | 2012-06-15 | 2012-10-17 | 无锡必创传感科技有限公司 | Method for awakening wireless sensor, wireless sensor and wireless sensor system |
| CN106888491A (en) * | 2016-12-22 | 2017-06-23 | 南京航空航天大学 | A kind of wireless sensor network based on constructive interference fast wake-up method on demand |
| CN107969007A (en) * | 2016-10-19 | 2018-04-27 | 中南大学 | A kind of data fusion collection method based on not grade sub-clustering sensor network |
| WO2018085635A1 (en) * | 2016-11-03 | 2018-05-11 | Interdigital Patent Holdings, Inc. | Methods for efficient power saving for wake up radios |
| WO2018208058A1 (en) * | 2017-05-08 | 2018-11-15 | 한국전자통신연구원 | Operation method of communication node for supporting low power mode in wireless lan |
| WO2019139984A1 (en) * | 2018-01-12 | 2019-07-18 | Interdigital Patent Holdings, Inc. | Method for efficient rediscovery and medium access for wake-up radios |
| CN111466138A (en) * | 2018-01-15 | 2020-07-28 | 中兴通讯股份有限公司 | Method and apparatus for low power channel access |
| CN113453304A (en) * | 2021-06-29 | 2021-09-28 | 中南大学 | Self-adaptive synchronous MAC protocol based on virtual clustering and path reservation |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9232475B2 (en) * | 2013-03-08 | 2016-01-05 | University Of Rochester | Wireless sensor network wake-up range extension via energy harvesting and edge devices |
| US9955238B2 (en) * | 2015-01-20 | 2018-04-24 | Nanyang Technological University | Methods and systems for wireless transmission of data between network nodes |
-
2021
- 2021-11-08 CN CN202111310765.1A patent/CN114040469B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102017527A (en) * | 2007-12-17 | 2011-04-13 | 韩国电子通信研究院 | Wake-up apparatus and wake-up method for a low power sensor node |
| CN102740427A (en) * | 2012-06-15 | 2012-10-17 | 无锡必创传感科技有限公司 | Method for awakening wireless sensor, wireless sensor and wireless sensor system |
| CN107969007A (en) * | 2016-10-19 | 2018-04-27 | 中南大学 | A kind of data fusion collection method based on not grade sub-clustering sensor network |
| WO2018085635A1 (en) * | 2016-11-03 | 2018-05-11 | Interdigital Patent Holdings, Inc. | Methods for efficient power saving for wake up radios |
| CN106888491A (en) * | 2016-12-22 | 2017-06-23 | 南京航空航天大学 | A kind of wireless sensor network based on constructive interference fast wake-up method on demand |
| WO2018208058A1 (en) * | 2017-05-08 | 2018-11-15 | 한국전자통신연구원 | Operation method of communication node for supporting low power mode in wireless lan |
| WO2019139984A1 (en) * | 2018-01-12 | 2019-07-18 | Interdigital Patent Holdings, Inc. | Method for efficient rediscovery and medium access for wake-up radios |
| CN111466138A (en) * | 2018-01-15 | 2020-07-28 | 中兴通讯股份有限公司 | Method and apparatus for low power channel access |
| CN113453304A (en) * | 2021-06-29 | 2021-09-28 | 中南大学 | Self-adaptive synchronous MAC protocol based on virtual clustering and path reservation |
Non-Patent Citations (3)
| Title |
|---|
| Energy efficiency trade-off between dutycycling and wake-up radio techniques in IoT networks;KOZLPWSKI A et al;《Wireless personal communications》;全文 * |
| 低占空比无线传感网络广播与机会路由协议的研究;闫凡;《中国博士学位论文全文数据库》;全文 * |
| 面向物联网的无线传感器网络节能策略研究;宋孝东;《中国优秀硕士学位论文全文数据库》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114040469A (en) | 2022-02-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9544848B2 (en) | Methods and apparatus for communicating short paging messages in a wireless communication network | |
| US9635613B2 (en) | Method and apparatus using an ultra low power signal with scheduled power save modes | |
| US7356561B2 (en) | Adaptive sleeping and awakening protocol for an energy-efficient adhoc network | |
| EP2171929B1 (en) | Path selection and power management in mesh networks | |
| Kim et al. | Minimizing delay and maximizing lifetime for wireless sensor networks with anycast | |
| EP3248418B1 (en) | Network of nodes, battery-powered node and method for managing battery-powered node | |
| US7729285B2 (en) | Energy-efficient network protocol and node device for sensor networks | |
| US8547982B2 (en) | Wireless sensor network with energy efficient protocols | |
| JP4630875B2 (en) | Method and wireless device for saving power | |
| Zhao et al. | A survey and projection on medium access control protocols for wireless sensor networks | |
| KR20050022479A (en) | Method and system for controlling sleep mode in broadband wireless access communication system | |
| JP2009526438A (en) | Power saving system and method | |
| Nazir et al. | Dynamic sleep scheduling for minimizing delay in wireless sensor network | |
| CN107925963A (en) | Optimize across the access point standby power of any number of associated client | |
| KR20070116399A (en) | Method and system for controlling the sleep mode for power saving in a wireless mesh network | |
| Sun et al. | A study on medium access control scheme for energy efficiency in wireless smart sensor networks | |
| CN113133081B (en) | Energy-saving transmission method for wireless ad hoc network | |
| US8433353B2 (en) | Method of communication, emitter and receiver stations and associated computer programs | |
| WO2012031542A1 (en) | Method, system, and apparatus for establishing communication for wireless sensor network | |
| CN114040469B (en) | Pre-awakening rapid routing and energy-efficient routing method and system | |
| Damdinsuren et al. | Lifetime extension based on residual energy for receiver-driven multi-hop wireless network | |
| Balachandran et al. | Adaptive sleeping and awakening protocol (ASAP) for energy efficient adhoc sensor networks | |
| Kim et al. | Energy-aware MAC protocol to extend network lifetime in asynchronous MAC-based WSNs | |
| Kumar et al. | A power efficient communication protocol for wireless sensor network | |
| Singh et al. | Energy efficient broadcast protocols for asynchronous duty-cycled wireless sensor 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 |