CN114125984A - Efficient opportunistic routing method and device - Google Patents
Efficient opportunistic routing method and device Download PDFInfo
- Publication number
- CN114125984A CN114125984A CN202111391138.5A CN202111391138A CN114125984A CN 114125984 A CN114125984 A CN 114125984A CN 202111391138 A CN202111391138 A CN 202111391138A CN 114125984 A CN114125984 A CN 114125984A
- Authority
- CN
- China
- Prior art keywords
- node
- forwarding
- candidate
- sensor
- 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.)
- Granted
Links
Images
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
- 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
- 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 application provides an efficient opportunistic routing method and device. After the duty ratio wireless sensor network is initialized, each sensor node in the network calculates a corresponding forwarding angle initial value according to the duty ratio value. After receiving a data packet sent by an upstream node, the sensor nodes broadcast a preamble signal with a forwarding angle initial value to neighbor nodes, and select one candidate forwarding node from a candidate forwarding node set in the neighbor nodes feeding back confirmation signals according to the forwarding priority of the candidate forwarding node as a downstream forwarding node to forward the data packet. When no neighbor node feeds back the confirmation signal, the sensor node expands the forwarding angle and broadcasts until the sensor node receives the confirmation signal from the neighbor node or the forwarding angle is expanded to the maximum.
Description
Technical Field
The present application relates to wireless sensor network technologies, and in particular, to an efficient opportunistic routing method and apparatus.
Background
A Wireless Sensor Network (WSN) is generally a Sensor network composed of wirelessly chargeable Sensor nodes and Sink nodes. The wireless sensing nodes realize wireless communication through protocols such as zigBee and WIFI, a multi-hop communication ad hoc network is established, and sensing information is transmitted to the designated sink nodes. In the development process of the WSN, a series of new technologies are generated around two key elements, namely energy consumption and time delay, and a Duty cycle wireless sensor network (DC-WSN) is a novel sensor network developed on the basis of the WSN, and is mainly characterized in that except for a sink node, the sink node is kept in a state of being awakened all the time, and other wireless sensor nodes adopt a Duty Cycle (DC) working mode, namely, scheduling of periodically awakening and sleeping is performed. In such a mode of operation, the wireless sensor node transmits the collected data to the sink node by way of multi-hop wireless communication, following the employed routing protocol. On one hand, due to the introduction of the DC working mode, the wireless sensor node is in a dormant state for a long time when no task is forwarded, and the network service life of the WSN is greatly prolonged. On the other hand, due to the introduction of the DC working mode, the traditional single routing mode no longer adapts to the network characteristics of the DC-WSN which dynamically changes with time, and a routing mode more suitable for the DC-WSN needs to be explored.
Routing protocols can be divided into two categories, namely deterministic routing and opportunistic routing according to the selection mode of a forwarding node (namely a relay node) in the DC-WSN. In deterministic routing, each time a route is routed, a predetermined forwarding node is selected based on a routing table (recording the next hop forwarding node of each node), and thus the obtained forwarding path is determined. The opportunistic routing uses relatively static global or local information to construct a forwarding node set for each node, and then dynamically selects one forwarding node from the forwarding node set according to real-time network conditions to serve as an actually used forwarding node. Thus, opportunistic routing is more suitable for DC-WSN. Opportunistic routing is a key technology, although widely researched and applied in the DC-WSN, it may also cause data redundancy for multiple forwarding of a single data packet in the network, and finally, both the energy consumption and the time delay of the network are greatly increased. Therefore, further research is needed on how to establish a forwarding node set for each node and how to select an optimal node as a final forwarding node.
Disclosure of Invention
In view of the above, an object of the present application is to provide an efficient opportunistic routing method and apparatus.
In view of the above, the present application provides an efficient opportunistic routing method for a DC-WSN of a duty-cycle wireless sensor network, wherein the DC-WSN includes sensor nodes and sink nodes, and includes:
initializing the DC-WSN, and calculating a duty ratio value corresponding to each sensor node in the DC-WSN according to a network duty ratio initial value broadcast by the sink node;
according to the duty ratio, each sensor node calculates a forwarding angle initial value corresponding to the sensor node;
responding to a data packet sent by an upstream node received by the sensor node, continuously broadcasting a preamble signal carrying the initial value of the forwarding angle to a neighbor node, and entering a first monitoring period to monitor a signal sent by the neighbor node;
in response to each sensor node monitoring a confirmation signal aiming at the preamble signal sent by at least one candidate forwarding node in a forwarding node set in a first monitoring period, stopping broadcasting the preamble signal, and selecting one of the at least one candidate forwarding node as a downstream forwarding node to forward the data packet to the downstream forwarding node until the sink node is selected as the downstream forwarding node; wherein the set of forwarding nodes includes all of the candidate forwarding nodes corresponding to the sensor nodes; the candidate forwarding node is the neighbor node that receives the preamble signal during wake-up and sends the acknowledgement signal to the sensor node after determining that the candidate forwarding node is located in a forwarding area according to the initial value of the forwarding angle carried in the preamble signal.
In some embodiments, in response to the sensor node not listening to the acknowledgement signal for the first listening period, increasing the forwarding angle initial value to expand the forwarding area, updating the broadcasted preamble signal based on the increased forwarding angle initial value, and continuing listening to the acknowledgement signal for a second listening period.
In some embodiments, the duty cycle value is calculated by the sensor node from a distance between the sensor node and a sink node during initialization of the DC-WSN.
In some embodiments, initializing the DC-WSN comprises:
responding to the initial value of the duty ratio broadcast by the sink node received by the sensor node, calculating the ratio of the distance between the sensor node and the sink node and the communication radius of the sensor node by the sensor node, and rounding downwards to determine the layer number i of the sensor node, wherein a circular area with the sink node as the center is divided into different layers according to the communication radius of the sink node;
determining the duty ratio value corresponding to the ith layer node based on the initial duty ratio value and the energy consumption of the ith layer node.
In some embodiments, the initial value of the forwarding angle for each sensor node is proportional to the duty cycle value.
In some embodiments, the at least one candidate forwarding node comprises a plurality of candidate forwarding nodes;
selecting one of the at least one candidate forwarding node as the downstream forwarding node comprises:
determining respective forwarding priorities of the plurality of candidate forwarding nodes;
selecting a candidate forwarding node with the highest forwarding priority among the plurality of candidate forwarding nodes as the downstream forwarding node.
In some embodiments, determining the respective forwarding priorities of the plurality of candidate forwarding nodes comprises:
for each of the candidate forwarding nodes, the forwarding priority of the candidate forwarding node is determined based on a distance between the candidate forwarding node and a sink node and a remaining energy of the candidate forwarding node.
In some embodiments, determining the forwarding priority of the candidate forwarding node based on the distance between the candidate forwarding node and a sink node and the remaining energy comprises:
calculating an average distance between the plurality of candidate forwarding nodes and the sink node;
calculating the ratio of the average distance to the distance between the candidate forwarding node and the sink node as a forwarding process score;
determining a maximum energy value of remaining energies of each of the plurality of candidate forwarding nodes;
calculating a ratio of the residual energy to the maximum energy value as a residual energy score;
determining the forwarding priority for the candidate forwarding node based on a weighted sum of the forwarding progress score and the residual energy score.
Based on the same inventive concept, the application also provides an efficient opportunistic routing device, which comprises:
an initialization module configured to: initializing the DC-WSN, and calculating a duty ratio value corresponding to each sensor node in the DC-WSN according to the initial value of the duty ratio broadcasted by the sink node;
an angle calculation module configured to: according to the duty ratio, each sensor node calculates a forwarding angle initial value corresponding to the sensor node;
a broadcast module configured to: responding to each sensor node receiving a data packet sent by an upstream node, continuously broadcasting a preamble signal carrying the forwarding angle initial value to a neighbor node, and entering a first monitoring period to monitor signals sent by the neighbor node;
a routing module configured to: in response to each sensor node monitoring a confirmation signal aiming at the preamble signal sent by at least one candidate forwarding node in a forwarding node set in a first monitoring period, stopping broadcasting the preamble signal, and selecting one of the at least one candidate forwarding node as a downstream forwarding node to forward the data packet to the downstream forwarding node until the sink node is selected as the downstream forwarding node; wherein the set of forwarding nodes includes all of the candidate forwarding nodes corresponding to the sensor nodes; the candidate forwarding node is the neighbor node that receives the preamble signal during wake-up and sends the acknowledgement signal to the sensor node after determining that the candidate forwarding node is located in a forwarding area according to the initial value of the forwarding angle carried in the preamble signal.
In some embodiments, the efficient opportunistic routing apparatus provided by the present application further comprises:
a control module configured to: in response to the sensor node not listening to the acknowledgement signal in the first listening period, increasing the forwarding angle initial value to expand the forwarding area, updating the broadcasted preamble signal based on the increased forwarding angle initial value, and continuing to listen to the acknowledgement signal in a second listening period.
As can be seen from the above, according to the efficient opportunistic routing method and apparatus provided by the present application, the forwarding area of each sensor node is pre-divided, so that each sensor node selects a downstream forwarding node from the sensor nodes located in the forwarding area in the forwarding process, and the forwarding angle of the sensor node is enlarged according to the actual situation in the forwarding process, so that the forwarding area corresponding to the sensor node is enlarged, and the sensor node can select a suitable downstream forwarding node from a larger forwarding area. The method is adopted, so that the sink node in the DC-WSN does not need to calculate the metric value for each sensor node by using the global information and broadcast the metric value to the corresponding sensor node, and the communication overhead is reduced. And the forwarding area corresponding to each sensor node can be adjusted, so that the problem caused by overlarge or undersize forwarding sets when the fixed forwarding area established for each sensor node is not ideal is solved. And when the downstream forwarding node of the sensor node is selected, the forwarding priorities of the multiple candidate forwarding nodes meeting the conditions are calculated and ranked, and the candidate forwarding node with the highest forwarding priority is selected as the downstream forwarding node, so that the difficulty of selecting a single node from the multiple candidate forwarding nodes as the downstream forwarding node is reduced. Even if the number of the candidate forwarding nodes is greatly increased, the downstream forwarding nodes can be quickly selected from the candidate forwarding nodes, and the time consumed in selecting the downstream forwarding nodes is reduced.
Drawings
In order to more clearly illustrate the technical solutions in the present application or the related art, the drawings needed to be used in the description of the embodiments or the related art will be briefly introduced below, and it is obvious that the drawings in the following description are only embodiments of the present application, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a flowchart of an efficient opportunistic routing method provided by an embodiment of the present application;
fig. 2 is a flowchart of a sensor node calculating a duty ratio value and a forwarding angle value according to an embodiment of the present application;
fig. 3 is a structural diagram of an efficient opportunistic routing apparatus according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is further described in detail below with reference to the accompanying drawings in combination with specific embodiments.
It should be noted that technical terms or scientific terms used in the embodiments of the present application should have a general meaning as understood by those having ordinary skill in the art to which the present application belongs, unless otherwise defined. The use of "first," "second," and similar terms in the embodiments of the present application do not denote any order, quantity, or importance, but rather the terms are used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that the element or item listed before the word covers the element or item listed after the word and its equivalents, but does not exclude other elements or items.
According to the background art, generally, when a forwarding node set is established for each node in a DC-WSN, two major categories are mainly used, namely, calculating a metric value of a neighbor node of each node and dividing a forwarding area of each node.
In the scheme of establishing the forwarding node set through the computing node Metric, the Metric value of each node is calculated iteratively from a Sink node through global calculation, and then for each node, a node with a higher Metric value is selected from neighbor nodes and added into the forwarding node set. This kind of scheme mainly includes two aspects of design, and the factors for determining the metric value are selected first, including the DC size of the node (the DC size is the ratio of the wake-up time of each node to the period), the communication quality of the node, the geographical location of the node, and so on. In the related technical scheme, an Expected DC wakeup Number (Number of Duty-Cycled wakeup, Expected EDC) is provided as a metric value on which a forwarding node set is established. According to the technical scheme, from Sink nodes, EDCs of all nodes are calculated in an iterative mode. Then, selecting nodes with the EDC size within a certain range from the neighbor nodes of each node, and adding the nodes into the forwarding node set. The definition of EDC mainly depends on the communication quality between nodes and the DC size of the nodes, so that the nodes with relatively good communication quality and relatively large DC can be screened out and added into the forwarding node set.
For the scheme, as the metric value of each node needs to be calculated by the sink node when the network is established, and the metric value is forwarded to each node in a broadcast manner, more extra communication overhead is brought in the manner, and the information and the broadcast metric value of the node need to be updated in each round; meanwhile, when the topological structure and the communication quality of the node change, each metric value information in the current network needs to be updated, so that the expandability of the network is poor.
In the scheme of establishing the forwarding node set by dividing the forwarding areas, the directionality of the forwarding area design and the area of the forwarding area design are mainly considered. In order to avoid forwarding of the sending node in a direction away from the Sink node, the design directivity of the forwarding area is considered, and the forwarding area is ensured to ensure that the progress of the data forwarding process always faces the Sink node by using the connecting line of the sending node and the forwarding node and the included angle between the connecting lines of the sending node and the Sink node. Secondly, in order to ensure that the size of the forwarding node set is reasonable, the size of the forwarding area needs to be considered in the scheme, that is, the size of the forwarding area needs to be further designed in the node communication range, so that the size of the forwarding set is reduced, and the possibility of generating data redundancy is reduced.
With this scheme, the establishment of the forwarding area is localized to a certain extent, i.e. only local information between the node and the neighboring nodes is relied upon. However, most of such schemes adopt a mode of establishing a fixed forwarding area, and cannot solve the problem that the forwarding set is too small or too large when the establishment of the forwarding area is not ideal. For example, the division of forwarding areas at a fixed angle depends on network density and other factors, when the node density is low, a set of forwarding nodes may be too small, which causes the time for waiting for a certain forwarding node to wake up to be long, and causes the network delay performance to be poor; when the node density is high, a phenomenon of data redundancy in a transmission process due to an overlarge forwarding node set may exist. When a plurality of forwarding nodes are awakened at the same time, the difficulty of ensuring that only one node is taken as the forwarding node is increased along with the increase of the number of the nodes, so that data redundancy for forwarding a data packet for multiple times occurs in the network. And finally, the energy consumption and the time delay of the network are greatly increased.
In order to solve the above problems, the present application provides an efficient opportunistic routing method, in which a forwarding area of each sensor node is pre-divided, so that each sensor node selects a downstream forwarding node from the sensor nodes in a forwarding node set according to a forwarding priority in a forwarding process, and sends data to the downstream forwarding node until a sink node is selected as a downstream forwarding node. And the forwarding angle of the sensor node is enlarged according to the actual situation in the forwarding process, so that the forwarding area corresponding to the sensor node is enlarged, and the sensor node can select a proper downstream forwarding node from a larger forwarding area. The method is adopted, so that the sink node in the DC-WSN does not need to calculate the metric value for each sensor node by using the global information and broadcast the metric value to the corresponding sensor node, and the communication overhead is reduced. And the forwarding area corresponding to each sensor node can be adjusted, so that the problem caused by overlarge or undersize forwarding sets when the fixed forwarding area established for each sensor node is not ideal is solved.
Referring to fig. 1, the present application provides an efficient opportunistic routing method, including:
step S101, initializing the DC-WSN, and calculating a duty ratio value corresponding to each sensor node in the DC-WSN according to the initial value of the network duty ratio broadcast by the sink node.
After the DC-WSN is initialized, the sink node sends an initial duty ratio value to each sensor node. After each sensor node receives the initial value of the duty ratio, the initial value of the duty ratio is adjusted according to the distance between the sensor node and the sink node to obtain a DC value corresponding to each sensor node, so that the sensor nodes farther away from the sink node have longer working time in one period.
Because all the sensor nodes are positioned in a circular area with the sink node as the center, different sensor nodes are layered according to the ratio of the distances from the different sensor nodes to the sink node to the communication radius of the sink node, and the DC values of the different sensor nodes positioned on the same layer are the same.
And step S102, calculating a forwarding angle initial value corresponding to each sensor node according to the duty ratio value.
In the efficient opportunistic routing method provided by the application, the relationship between the initial value of the forwarding angle of the sensor node and the period satisfies formula (1):
wherein, T in the formula (1)m、TnThe DC periods of two different sensor nodes m and n are respectively set; thetam、θnThe initial angle sizes of the forwarding areas corresponding to the sensor node m and the sensor node n are respectively. Due to the fact thatFor the ith layer sensor node: its DC period is Ti＝λi×ΔtslotWhere Δ t isslotIs the time slot length and is a fixed value; lambda [ alpha ]iIs the DC value of the i-th layer sensor node. By Ti＝λi×ΔtslotFor the formula (1) Tm、TnAfter the substitution and the reduction of equation (1), equation (2) is obtained:
using equation (2), the forwarding angle initial values corresponding to the remaining layer sensor nodes can be calculated according to the known forwarding angle initial value of the i-th layer sensor node and the DC value of each layer sensor node calculated in step S101.
Step S103, responding to the data packet sent by the upstream node received by each sensor node, continuously broadcasting the preamble signal carrying the forwarding angle initial value to the neighbor nodes, and entering a first monitoring period to monitor the signal sent by the neighbor nodes.
After receiving the data packet sent by the upstream node, the single sensor node selects the sector area with the same size as the forwarding area corresponding to the sensor node according to the corresponding forwarding angle calculated in step S102.
Step S104, in response to that each sensor node monitors a confirmation signal, which is sent by at least one candidate forwarding node in the forwarding node set and is directed to the preamble signal, in a first monitoring period, stopping broadcasting the preamble signal, and selecting one of the at least one candidate forwarding node as a downstream forwarding node to forward the data packet to the downstream forwarding node until the sink node is selected as the downstream forwarding node.
Wherein the forwarding node set includes all the candidate forwarding nodes corresponding to the sensor node, that is, the forwarding node set corresponding to a single sensor node includes all the candidate forwarding nodes corresponding to the sensor node
The candidate forwarding node is the neighbor node which receives the preamble signal when waking up, and sends the confirmation signal to the sensor node after determining that the candidate forwarding node is located in a forwarding area according to the initial value of the forwarding angle carried in the preamble signal.
According to the efficient opportunistic routing method provided by the application, each sensor node in the DC-WSN calculates a corresponding DC value according to the duty ratio initial value broadcast by the sink node, calculates a forwarding angle initial value corresponding to each sensor node according to the DC value, and divides a corresponding forwarding area. When each sensor node forwards data, only the downstream forwarding node of the current sensor node needs to be selected from the candidate forwarding nodes in the corresponding forwarding area, and the data is forwarded. The communication overhead of calculating the metric value of each node through the sink node and forwarding the metric value to each node in a broadcast mode during establishment of the DC-WSN is avoided, and the additional communication overhead caused by updating the information of the sensor node and the broadcast metric value in the process of forwarding each cycle is avoided; meanwhile, the problem that the expandability of the network is poor due to the fact that the metric value information of each sensor node in the DC-WSN needs to be updated when the topological structure and the communication quality of the DC-WSN change is solved.
As an alternative embodiment, referring to fig. 1, when no downstream forwarding node is selected in step S104, the efficient opportunistic routing method provided by the present application may further expand a forwarding angle of the sensor node, so as to expand a corresponding forwarding area, and select a downstream forwarding node from a larger forwarding area, including:
step S105, in response to the sensor node not monitoring the acknowledgement signal in the first monitoring period, increasing the initial value of the forwarding angle to expand the forwarding area, updating the broadcasted preamble signal based on the increased initial value of the forwarding angle, and continuing to monitor the acknowledgement signal in a second monitoring period.
After the forwarding angle initial value corresponding to the sensor node is increased, the sensor node broadcasts a preamble signal with the increased forwarding angle initial value to a neighbor node, and after the neighbor node receives the preamble signal with the increased forwarding angle initial value, whether the neighbor node is located in a forwarding area corresponding to the increased forwarding angle initial value is calculated. When the neighbor node is located in the forwarding area corresponding to the increased initial forwarding angle value, the neighbor node sends a confirmation signal to the sensor node, and meanwhile, the initial forwarding angle value stops increasing; otherwise, the initial value of the forwarding angle is continuously increased and whether a neighbor node sends a confirmation signal is judged until the value of the forwarding angle is increased to pi/2.
And when the initial value of the forwarding angle is increased to pi/2 and no neighbor node sends a confirmation signal, waiting until the second monitoring period is finished to receive the confirmation signal sent by the neighbor node, and when the sensor node does not receive the confirmation signal sent by the neighbor node after the second monitoring period is finished, failing to forward the data packet.
According to the method for expanding the forwarding angle of the sensor node, the corresponding forwarding area is expanded, and the downstream forwarding node is selected from the larger forwarding area, so that the problem that the forwarding set is too small or too large due to the fact that the forwarding area is not ideal when a fixed forwarding area is established is solved.
As an alternative embodiment, referring to fig. 2, initializing the DC-WSN in steps S101 and S102, and calculating the duty cycle value and the forwarding angle value of the sensor node in the DC-WSN, includes:
in step S201, the sink node broadcasts an initial value of a duty ratio to the sensor node.
Step S202, the sensor node determines the layer number i where the sensor node is located.
The circular area with the sink node as the center is divided into different layers according to the communication radius of the sink node, the sensor nodes are respectively positioned in the different layers, and the DC values of the sensor nodes positioned in the same layer are the same.
And when the sensor node determines the number i of the layers in which the sensor node is located, calculating the ratio of the distance between the sensor node and the sink node to the communication radius of the sink node, and rounding the calculated ratio downwards to obtain the number i of the layers of the sensor node. And if the ratio of the distance between the sensor node and the sink node to the communication radius of the sink node is less than 1, the sensor node is a layer 0 node.
And step S203, the sensor node calculates the duty ratio value of the sensor node according to the initial value of the duty ratio and the energy consumption of the ith layer node.
In this step, the sensor node of the i-th layer calculates its duty ratio value λ according to the following formula (3)i：
Wherein λ is0Initial value of duty cycle broadcast for sink node, Er,0And E0,0Energy consumption for receiving and sending data packets, respectively, for layer 0 nodes, Et,iAnd Er,iEnergy consumption for receiving and sending data packets, respectively, for nodes of the i-th layer, Elpl,iMonitoring energy consumption for the i-th sensor node when it is not transmitting data packets, di,sAnd the distance between the sensor node of the ith layer and the sink node is shown. And the energy consumptions in the formula (3) are measured in advance for the sensor nodes in the DC-WSN.
And step S204, calculating the forwarding angle value of each sensor node according to the fact that the forwarding angle initial value is in direct proportion to the duty ratio value.
In this embodiment, the initial value of the forwarding angle of the sensor node on the outermost layer is set to be 60 °, and the initial values of the forwarding angles of the sensor nodes on the other layers are respectively calculated according to the calculated DC value of each sensor node and the formula (2).
As an alternative embodiment, in order to select one of the at least one candidate forwarding node as a downstream forwarding node in step S104, respective forwarding priorities of a plurality of candidate forwarding nodes may be determined and a candidate forwarding node with the highest forwarding priority may be selected as the downstream forwarding node of the sensor node.
For example, for each of the candidate forwarding nodes, the forwarding priority of the candidate forwarding node may be determined based on the distance between the candidate forwarding node and the sink node and the remaining energy of the candidate forwarding node.
Specifically, the forwarding priority of the candidate forwarding node may be determined by the following operations.
Calculating the forwarding progress score of the candidate forwarding node according to the following formula (4):
wherein Dj-sinkAnd D is the distance between the candidate forwarding node and the sink node, and is the average value of the distances between the candidate forwarding nodes and the sink node.
Calculating a remaining energy score for the candidate forwarding node according to the following equation (5):
wherein residulengy (j) is the remaining energy of the candidate forwarding node, and maxengy is the maximum value of the respective remaining energies of the candidate forwarding nodes.
Carrying out weighted summation calculation on the forwarding progress score and the residual energy score according to the following formula (6), and taking the obtained result as the forwarding priority of the candidate forwarding node
Score(j)＝αProgress(j)+βRE(j) (6)
Wherein score (j) represents a metric of the forwarding priority, and α and β represent respective weights of the forwarding progress score and the residual energy score, and are set according to actual needs.
The forwarding priorities of the candidate forwarding nodes meeting the conditions are calculated and ranked, and the candidate forwarding node with the highest forwarding priority is selected as the downstream forwarding node, so that the difficulty of selecting the only one node from the candidate forwarding nodes as the downstream forwarding node is reduced. Even if the number of the candidate forwarding nodes is greatly increased, the downstream forwarding nodes can be quickly selected from the candidate forwarding nodes, and the time consumed in selecting the downstream forwarding nodes is reduced.
To sum up, according to the efficient opportunistic routing method provided by the application, the forwarding area of each sensor node is pre-divided, so that each sensor node selects a downstream forwarding node from the sensor nodes located in the forwarding area in the forwarding process, and the forwarding angle of the sensor node is enlarged according to the actual situation in the forwarding process, so that the forwarding area corresponding to the sensor node is enlarged, and the sensor node can select a proper downstream forwarding node from a larger forwarding area. The method is adopted, so that the sink node in the DC-WSN does not need to calculate the metric value for each sensor node by using the global information and broadcast the metric value to the corresponding sensor node, and the communication overhead is reduced. And the forwarding area corresponding to each sensor node can be adjusted, so that the problem caused by overlarge or undersize forwarding sets when the fixed forwarding area established for each sensor node is not ideal is solved. And when the downstream forwarding node of the sensor node is selected, the forwarding priorities of the multiple candidate forwarding nodes meeting the conditions are calculated and ranked, and the candidate forwarding node with the highest forwarding priority is selected as the downstream forwarding node, so that the difficulty of selecting a single node from the multiple candidate forwarding nodes as the downstream forwarding node is reduced. Even if the number of the candidate forwarding nodes is greatly increased, the downstream forwarding nodes can be quickly selected from the candidate forwarding nodes, and the time consumed in selecting the downstream forwarding nodes is reduced.
It should be noted that the method of the embodiment of the present application may be executed by a single device, such as a computer or a server. The method of the embodiment can also be applied to a distributed scene and completed by the mutual cooperation of a plurality of devices. In such a distributed scenario, one of the devices may only perform one or more steps of the method of the embodiments of the present disclosure, and the devices may interact with each other to complete the method.
It should be noted that the above describes some embodiments of the present application. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments described above and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
Based on the same inventive concept, corresponding to the method of any embodiment, the application also provides an efficient opportunistic routing device. Referring to fig. 3, the efficient opportunistic routing apparatus comprises:
an initialization module 301 configured to: and initializing the DC-WSN, and calculating a duty ratio value corresponding to each sensor node in the DC-WSN according to the duty ratio initial value broadcast by the sink node.
An angle calculation module 302 configured to: and according to the duty ratio, each sensor node calculates a forwarding angle initial value corresponding to the sensor node.
A broadcast module 303 configured to: and responding to the fact that each sensor node receives a data packet sent by an upstream node, continuously broadcasting a preamble signal carrying the forwarding angle initial value to a neighbor node, and entering a first monitoring period to monitor signals sent by the neighbor node.
A routing module 304 configured to: in response to each sensor node monitoring a confirmation signal aiming at the preamble signal sent by at least one candidate forwarding node in a forwarding node set in a first monitoring period, stopping broadcasting the preamble signal, and selecting one of the at least one candidate forwarding node as a downstream forwarding node to forward the data packet to the downstream forwarding node until the sink node is selected as the downstream forwarding node.
As an optional embodiment, the efficient opportunistic routing apparatus further includes:
a control module 305 configured to: in response to the sensor node not listening to the acknowledgement signal in the first listening period, increasing the forwarding angle initial value to expand the forwarding area, updating the broadcasted preamble signal based on the increased forwarding angle initial value, and continuing to listen to the acknowledgement signal in a second listening period.
For convenience of description, the above sensor nodes are described as being divided into various modules by functions and described separately. Of course, the functionality of the various modules may be implemented in the same one or more software and/or hardware implementations as the present application.
The sensor node in the foregoing embodiment is used to implement the corresponding efficient opportunistic routing method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiment, which are not described herein again.
Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, is limited to these examples; within the context of the present application, features from the above embodiments or from different embodiments may also be combined, steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the present application as described above, which are not provided in detail for the sake of brevity.
In addition, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown in the provided figures for simplicity of illustration and discussion, and so as not to obscure the embodiments of the application. Furthermore, devices may be shown in block diagram form in order to avoid obscuring embodiments of the application, and this also takes into account the fact that specifics with respect to implementation of such block diagram devices are highly dependent upon the platform within which the embodiments of the application are to be implemented (i.e., specifics should be well within purview of one skilled in the art). Where specific details (e.g., circuits) are set forth in order to describe example embodiments of the application, it should be apparent to one skilled in the art that the embodiments of the application can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative instead of restrictive.
While the present application has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of these embodiments will be apparent to those of ordinary skill in the art in light of the foregoing description.
The present embodiments are intended to embrace all such alternatives, modifications and variances which fall within the broad scope of the appended claims. Therefore, any omissions, modifications, substitutions, improvements, and the like that may be made without departing from the spirit and principles of the embodiments of the present application are intended to be included within the scope of the present application.
Claims (10)
1. An efficient opportunistic routing method for a duty-cycle wireless sensor network, DC-WSN, wherein the DC-WSN comprises sensor nodes and sink nodes, comprising:
initializing the DC-WSN, and calculating a duty ratio value corresponding to each sensor node in the DC-WSN according to a network duty ratio initial value broadcast by the sink node;
according to the duty ratio, each sensor node calculates a forwarding angle initial value corresponding to the sensor node;
responding to each sensor node receiving a data packet sent by an upstream node, continuously broadcasting a preamble signal carrying the forwarding angle initial value to a neighbor node, and entering a first monitoring period to monitor signals sent by the neighbor node;
in response to each sensor node monitoring a confirmation signal aiming at the preamble signal sent by at least one candidate forwarding node in a forwarding node set in a first monitoring period, stopping broadcasting the preamble signal, and selecting one of the at least one candidate forwarding node as a downstream forwarding node to forward the data packet to the downstream forwarding node until the sink node is selected as the downstream forwarding node; wherein the set of forwarding nodes includes all of the candidate forwarding nodes corresponding to the sensor nodes; the candidate forwarding node is the neighbor node that receives the preamble signal during wake-up and sends the acknowledgement signal to the sensor node after determining that the candidate forwarding node is located in a forwarding area according to the initial value of the forwarding angle carried in the preamble signal.
2. The method of claim 1, further comprising:
in response to the sensor node not listening to the acknowledgement signal in the first listening period, increasing the forwarding angle initial value to expand the forwarding area, updating the broadcasted preamble signal based on the increased forwarding angle initial value, and continuing to listen to the acknowledgement signal in a second listening period.
3. The method of claim 1 or 2, wherein the duty cycle value is calculated by the sensor node from a distance between the sensor node and a sink node during initialization of the DC-WSN.
4. The method of claim 3, wherein in initializing the DC-WSN, comprising:
responding to the initial value of the duty ratio broadcast by the sink node received by the sensor node, calculating the ratio of the distance between the sensor node and the sink node and the communication radius of the sensor node by the sensor node, and rounding downwards to determine the layer number i of the sensor node, wherein a circular area with the sink node as the center is divided into different layers according to the communication radius of the sink node;
determining the duty ratio value corresponding to the ith layer node based on the initial duty ratio value and the energy consumption of the ith layer node.
5. The method according to claim 1 or 2, wherein the initial value of the forwarding angle for each sensor node is proportional to the duty cycle value.
6. The method of claim 1 or 2,
the at least one candidate forwarding node comprises a plurality of candidate forwarding nodes;
selecting one of the at least one candidate forwarding node as the downstream forwarding node comprises:
determining respective forwarding priorities of the plurality of candidate forwarding nodes;
selecting a candidate forwarding node with the highest forwarding priority among the plurality of candidate forwarding nodes as the downstream forwarding node.
7. The method of claim 6, wherein determining the respective forwarding priorities of the plurality of candidate forwarding nodes comprises:
for each of the candidate forwarding nodes, the forwarding priority of the candidate forwarding node is determined based on a distance between the candidate forwarding node and a sink node and a remaining energy of the candidate forwarding node.
8. The method of claim 7, wherein determining the forwarding priority of the candidate forwarding node based on a distance between the candidate forwarding node and a sink node and the remaining energy comprises:
calculating an average distance between the plurality of candidate forwarding nodes and the sink node;
calculating the ratio of the average distance to the distance between the candidate forwarding node and the sink node as a forwarding process score;
determining a maximum energy value of remaining energies of each of the plurality of candidate forwarding nodes;
calculating a ratio of the residual energy to the maximum energy value as a residual energy score;
determining the forwarding priority for the candidate forwarding node based on a weighted sum of the forwarding progress score and the residual energy score.
9. An efficient opportunistic routing apparatus comprising:
an initialization module configured to: initializing the DC-WSN, and calculating a duty ratio value corresponding to each sensor node in the DC-WSN according to the initial value of the duty ratio broadcasted by the sink node;
an angle calculation module configured to: according to the duty ratio, each sensor node calculates a forwarding angle initial value corresponding to the sensor node;
a broadcast module configured to: responding to a data packet sent by an upstream node received by the sensor node, continuously broadcasting a preamble signal carrying the initial value of the forwarding angle to a neighbor node, and entering a first monitoring period to monitor a signal sent by the neighbor node;
a routing module configured to: in response to the sensor node monitoring a confirmation signal aiming at the preamble signal and sent by at least one candidate forwarding node in the forwarding node set in a first monitoring period, stopping broadcasting the preamble signal and selecting one of the at least one candidate forwarding node as a downstream forwarding node to forward the data packet to the downstream forwarding node until the sink node is selected as the downstream forwarding node; wherein the set of forwarding nodes includes all of the candidate forwarding nodes corresponding to the sensor nodes; the candidate forwarding node is the neighbor node that receives the preamble signal during wake-up and sends the acknowledgement signal to the sensor node after determining that the candidate forwarding node is located in a forwarding area according to the initial value of the forwarding angle carried in the preamble signal.
10. The efficient opportunistic routing apparatus of claim 9 further comprising:
a control module configured to: in response to the sensor node not listening to the acknowledgement signal in the first listening period, increasing the forwarding angle initial value to expand the forwarding area, updating the broadcasted preamble signal based on the increased forwarding angle initial value, and continuing to listen to the acknowledgement signal in a second listening period.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111391138.5A CN114125984B (en) | 2021-11-22 | 2021-11-22 | Efficient opportunistic routing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111391138.5A CN114125984B (en) | 2021-11-22 | 2021-11-22 | Efficient opportunistic routing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114125984A true CN114125984A (en) | 2022-03-01 |
| CN114125984B CN114125984B (en) | 2023-05-16 |
Family
ID=80439711
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111391138.5A Active CN114125984B (en) | 2021-11-22 | 2021-11-22 | Efficient opportunistic routing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114125984B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102761931A (en) * | 2012-06-29 | 2012-10-31 | 南京大学 | Method for carrying out dynamic data transmission in asynchronous duty ratio wireless sensor network |
| CN106604346A (en) * | 2016-11-29 | 2017-04-26 | 河南科技大学 | Wireless sensor network energy effective opportunistic routing protocol implementation method |
| US20190166502A1 (en) * | 2017-11-29 | 2019-05-30 | Mojo Networks, LLC. | Security monitoring for wireless sensor nodes |
| CN111629415A (en) * | 2020-04-24 | 2020-09-04 | 南京理工大学 | Opportunistic routing protocol based on Markov decision process model |
| CN112702710A (en) * | 2020-12-22 | 2021-04-23 | 杭州电子科技大学 | Opportunistic routing optimization method based on link correlation in low duty ratio network |
-
2021
- 2021-11-22 CN CN202111391138.5A patent/CN114125984B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102761931A (en) * | 2012-06-29 | 2012-10-31 | 南京大学 | Method for carrying out dynamic data transmission in asynchronous duty ratio wireless sensor network |
| CN106604346A (en) * | 2016-11-29 | 2017-04-26 | 河南科技大学 | Wireless sensor network energy effective opportunistic routing protocol implementation method |
| US20190166502A1 (en) * | 2017-11-29 | 2019-05-30 | Mojo Networks, LLC. | Security monitoring for wireless sensor nodes |
| CN111629415A (en) * | 2020-04-24 | 2020-09-04 | 南京理工大学 | Opportunistic routing protocol based on Markov decision process model |
| CN112702710A (en) * | 2020-12-22 | 2021-04-23 | 杭州电子科技大学 | Opportunistic routing optimization method based on link correlation in low duty ratio network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114125984B (en) | 2023-05-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Al-Jemeli et al. | An energy efficient cross-layer network operation model for IEEE 802.15. 4-based mobile wireless sensor networks | |
| CN106604346B (en) | Method for realizing energy-efficient opportunistic routing of wireless sensor network | |
| EP3248418B1 (en) | Network of nodes, battery-powered node and method for managing battery-powered node | |
| Chao et al. | Multiple-rendezvous multichannel MAC protocol design for underwater sensor networks | |
| Aswale et al. | Geographic multipath routing based on triangle link quality metric with minimum inter-path interference for wireless multimedia sensor networks | |
| Yu et al. | An energy-efficient chain-based routing protocol in wireless sensor network | |
| Sotheara et al. | Effective data gathering and energy efficient communication protocol in wireless sensor networks employing UAV | |
| Kim | Adjusting transmission power for real-time communications in wireless sensor networks | |
| Nazir et al. | Sleep/wake scheduling scheme for minimizing end-to-end delay in multi-hop wireless sensor networks | |
| Zheng et al. | Bulk data dissemination in wireless sensor networks: analysis, implications and improvement | |
| Jemili et al. | Cross-layer adaptive multipath routing for multimedia wireless sensor networks under duty cycle mode | |
| Nazir et al. | Dynamic sleep scheduling for minimizing delay in wireless sensor network | |
| Dang et al. | An efficient multi-channel MAC protocol for wireless ad hoc networks | |
| US10499264B1 (en) | Role selection method in wireless communication networks | |
| Jin et al. | Q-learning-Based Opportunistic Routing with an on-site architecture in UASNs | |
| Coutinho et al. | A joint anypath routing and duty-cycling model for sustainable underwater sensor networks | |
| Fradj et al. | A range-based opportunistic routing protocol for wireless sensor networks | |
| Enzinger | Energy-efficient communication in wireless sensor networks | |
| Nawaz Jadoon et al. | EEHRT: energy efficient technique for handling redundant traffic in zone-based routing for wireless sensor networks | |
| Khan et al. | Load balancing and collision avoidance using opportunistic routing in wireless sensor networks | |
| Abedi et al. | Load-balanced and energy-aware opportunistic routing with adaptive duty cycling for multi-channel WSNs | |
| CN114125984B (en) | Efficient opportunistic routing method and device | |
| Zytoune et al. | A fairly balanced clustering algorithm for routing in wireless sensor networks | |
| Karthikeyan et al. | Energy utilization strategies using novel approach in wireless sensor networks | |
| CN109495946B (en) | Data transmission method and device of wireless sensor network |
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 |