CN114125984B - Efficient opportunistic routing method and device - Google Patents
Efficient opportunistic routing method and device Download PDFInfo
- Publication number
- CN114125984B CN114125984B CN202111391138.5A CN202111391138A CN114125984B CN 114125984 B CN114125984 B CN 114125984B CN 202111391138 A CN202111391138 A CN 202111391138A CN 114125984 B CN114125984 B CN 114125984B
- Authority
- CN
- China
- Prior art keywords
- node
- forwarding
- sensor
- candidate
- 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
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 a high-efficiency opportunistic routing method and device. After initializing the duty ratio wireless sensor network, each sensor node in the network calculates a corresponding forwarding angle initial value according to the duty ratio value. After receiving the data packet sent by the upstream node, the sensor node broadcasts a leading signal with an initial value of a forwarding angle to the neighbor node, and selects one candidate forwarding node from a candidate forwarding node set in the neighbor nodes feeding back the confirmation signal as a downstream forwarding node according to the forwarding priority of the candidate forwarding node, so as to forward the data packet, and each sensor node executes the method until the signal is transmitted to a sink node in the duty ratio wireless sensor network. When no neighbor node feeds back the acknowledgement signal, the sensor node enlarges the forwarding angle and broadcasts the acknowledgement signal until the sensor node receives the acknowledgement signal from the neighbor node or enlarges the forwarding angle to the maximum.
Description
Technical Field
The present disclosure relates to wireless sensor network technologies, and in particular, to a method and apparatus for efficient opportunistic routing.
Background
The wireless sensor network (Wireless Sensor Networks, WSN) is typically a sensor network consisting of wireless chargeable sensor nodes and Sink nodes (Sink nodes). The wireless sensing nodes realize wireless communication through zigBee, WIFI and other protocols, and a multi-hop communication self-organizing network is built to transmit sensing information to a designated sink node. In the development process of the WSN, a series of new technologies are generated around two key elements of energy consumption and time delay, and a duty cycle wireless sensor network (Duty cycle wireless sensor networks, DC-WSN) is a novel sensor network developed on the basis of the WSN, and is mainly characterized in that except for a state that a sink node keeps being always awakened, other wireless sensor nodes adopt a Duty Cycle (DC) working mode, namely, periodically awakening and dormancy scheduling are performed. In such an operating mode, the wireless sensor node transmits the collected data to the sink node in the form of multi-hop wireless communications, following the routing protocol employed. On the 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, the introduction of the DC working mode makes the traditional single routing mode not adapt to the network characteristics of the DC-WSN dynamically changing along with time, and a routing mode more suitable for the DC-WSN needs to be explored.
Routing protocols can be divided into two main categories, deterministic routing and opportunistic routing, according to the selection mode of the relay node (i.e., relay node) in the DC-WSN. In deterministic routing, a forwarding node determined in advance is selected based on a routing table (recording a next-hop forwarding node of each node) every time a route is selected, and thus a resulting 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 to serve as an actually used forwarding node according to the real-time network condition. Thus, opportunistic routing is more applicable to DC-WSNs. Opportunistic routing is a key technology, and is widely studied and applied in DC-WSNs, but data redundancy for forwarding single data packets for multiple times can also occur in the network, and finally, the energy consumption and the time delay of the network are greatly increased. Therefore, it is still further necessary to study how to build a forwarding node set for each node and how to select an optimal node as the final forwarding node.
Disclosure of Invention
In view of the foregoing, an object of the present application is to provide an efficient opportunistic routing method and apparatus.
Based on the above object, the present application provides an efficient opportunistic routing method for a DC-WSN of a duty cycle wireless sensor network, where the DC-WSN includes a sensor node and an sink node, including:
initializing the DC-WSN, and calculating a corresponding duty ratio value of each sensor node in the DC-WSN according to a network duty ratio initial value broadcasted by the sink node;
according to the duty ratio value, each sensor node calculates a forwarding angle initial value corresponding to the sensor node;
responding to the data packet sent by the upstream node received by the sensor node, continuously broadcasting a preamble signal carrying the initial value of the forwarding angle to the neighbor node, and entering a first monitoring period to monitor signals sent by the neighbor node;
in response to each sensor node monitoring an acknowledgement signal for 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 forwarding node set 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 at the time of waking up, and transmits the acknowledgement signal to the sensor node after determining that itself is located in a forwarding area according to the forwarding angle initial value carried in the preamble signal.
In some embodiments, in response to the sensor node not listening for the acknowledgement signal within the first listening period, increasing the forwarding angle initial value to enlarge the forwarding area, updating the broadcasted preamble signal based on the increased forwarding angle initial value, and continuing listening for the acknowledgement signal for a second listening period.
In some embodiments, the duty cycle value is calculated by the sensor node from the distance between the sensor node and sink node during initialization of the DC-WSN.
In some embodiments, in initializing the DC-WSN, it comprises:
in response to the sensor node receiving the initial value of the duty ratio broadcasted by the sink node, the sensor node calculates the ratio of the distance between the sensor node and the sink node to the communication radius of the sensor node and rounds down to determine the layer number i of the sensor node, wherein a circular area taking the sink node as the center is divided into different layers according to the communication radius of the sink node;
and determining the duty ratio value corresponding to the ith layer node based on the duty ratio initial value and the energy consumption of the ith layer node.
In some embodiments, the initial value of the forwarding angle for each of the sensor nodes 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 includes:
determining the forwarding priority of each of the plurality of candidate forwarding nodes;
and selecting the candidate forwarding node with the highest forwarding priority from the plurality of candidate forwarding nodes as the downstream forwarding node.
In some implementations, determining the forwarding priority of each of the plurality of candidate forwarding nodes includes:
for each of the candidate forwarding nodes, determining the forwarding priority of the candidate forwarding node based on a distance between the candidate forwarding node and the sink node and a remaining energy of the candidate forwarding node.
In some implementations, determining the forwarding priority of the candidate forwarding node based on the distance between the candidate forwarding node and the sink node and the remaining energy includes:
calculating average distances between the candidate forwarding nodes and the sink nodes;
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 in the respective remaining energies of the plurality of candidate forwarding nodes;
calculating a ratio of the remaining energy to the maximum energy value as a remaining energy score;
and determining the forwarding priority of the candidate forwarding node based on a weighted sum of the forwarding process score and the remaining energy score.
Based on the same inventive concept, the present application further provides an efficient opportunistic routing device, including:
an initialization module configured to: initializing the DC-WSN, and calculating a corresponding duty ratio value of 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 value, each sensor node calculates a forwarding angle initial value corresponding to the sensor node;
a broadcast module configured to: responding to the data packet sent by the upstream node received by each sensor node, continuously broadcasting a preamble signal carrying the initial value of the forwarding angle to the 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 an acknowledgement signal for 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 forwarding node set 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 at the time of waking up, and transmits the acknowledgement signal to the sensor node after determining that itself is located in a forwarding area according to the forwarding angle initial value carried in the preamble signal.
In some embodiments, the efficient opportunistic routing apparatus provided in the present application further includes:
a control module configured to: and in response to the sensor node not monitoring the acknowledgement signal in the first monitoring period, increasing the forwarding angle initial value to enlarge the forwarding area, updating the broadcasted preamble signal based on the increased forwarding angle initial value, and continuing to monitor the acknowledgement signal in a second monitoring period.
From the above, it can be seen that, according to the efficient opportunistic routing method and the efficient opportunistic routing device provided by the present application, by dividing the forwarding area of each sensor node in advance, each sensor node selects a downstream forwarding node from the sensor nodes located in the forwarding area in the forwarding process, and enlarges the forwarding angle of the sensor node 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 the larger forwarding area. The adoption of the method ensures that the sink node in the DC-WSN does not need to calculate the metric value for each sensor node by using global information and broadcast the metric value to the corresponding sensor node, thereby reducing communication overhead. And the forwarding area corresponding to each sensor node is adjustable, so that the problem caused by overlarge or undersize forwarding set when the fixed forwarding area established for each sensor node is not ideal is avoided. And when the downstream forwarding node of the sensor node is selected, the forwarding priorities of a plurality of candidate forwarding nodes meeting the conditions are calculated and sequenced, and the candidate forwarding node with the largest forwarding priority is selected as the downstream forwarding node, so that the difficulty of selecting the only one node from the plurality of 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 rapidly 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 of the present application or related art, the drawings that are required to be used in the description of the embodiments or related art will be briefly described below, and it is apparent that the drawings in the following description are only embodiments of the present application, and other drawings may be obtained according to these drawings without inventive effort to those of ordinary skill in the art.
Fig. 1 is a flowchart of an efficient opportunistic routing method provided in an embodiment of the present application;
fig. 2 is a flowchart of calculating a duty cycle value and a forwarding angle value by a sensor node according to an embodiment of the present application;
fig. 3 is a block diagram of an efficient opportunistic routing apparatus according to an embodiment of the present application.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail below with reference to the accompanying drawings.
It should be noted that unless otherwise defined, technical or scientific terms used in the embodiments of the present application should be given the ordinary meaning as understood by one of ordinary skill in the art to which the present application belongs. The terms "first," "second," and the like, as used in embodiments of the present application, do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that elements or items preceding the word are included in the element or item listed after the word and equivalents thereof, but does not exclude other elements or items.
According to the background art, when a forwarding node set is generally established for each node in the DC-WSN, the method is mainly divided into two major categories, namely, calculating a metric value of a neighbor node of each node and dividing a forwarding area of each node.
In the scheme for establishing the forwarding node set through the computation node Metric, the iterative computation of the Metric value of each node from Sink nodes through global computation is mainly considered, and then for each node, the node with the higher Metric value is selected from the neighbor nodes to be added into the forwarding node set. The scheme mainly comprises two aspects of design, wherein factors for determining the metric value are selected firstly, including the DC size of the node (the DC size is the ratio of the wake-up duration of each node to the period), the communication quality of the node, the geographic position of the node and the like. In the related art, a desired DC wakeup Number (Expected EDC) is proposed as a metric value on which to build a forwarding node set. According to the technical scheme, EDC of all nodes is calculated iteratively from Sink nodes. Then, selecting nodes with EDC size in a certain range from the neighbor nodes for each node, and adding the nodes into the forwarding node set. The EDC is defined mainly according to the communication quality among the 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, the measurement value of each node is calculated through the sink node when the network is established, and the measurement value is forwarded to each node in a broadcast mode, so that more additional communication overhead is brought in the mode, and the information and the broadcast measurement value of each node need to be updated; meanwhile, when the topology structure and the communication quality of the nodes are changed, 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 a forwarding node set by dividing a forwarding area, the directivity 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 directivity of the design 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 utilizing the connection line of the sending node and the forwarding node and the included angle between the connection line of the sending node and the Sink node. Secondly, in order to ensure that the size of the forwarding node set is reasonable, the scheme also needs to consider the size of the forwarding area, namely the size of the forwarding area is 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 approach, the establishment of the forwarding area is localized to some extent, i.e. relies only on local information between the node and the neighboring node. Most of these schemes, however, adopt a manner 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 forwarding area division of a fixed angle depends on factors such as network density, when the node density is low, the forwarding node set may be too small, so that the time required for waiting for a certain forwarding node to wake up becomes long, and the network delay performance is deteriorated; when the node density is high, there may be an excessively large set of forwarding nodes, resulting in a data redundancy phenomenon in the transmission process. When a plurality of forwarding nodes wake up at the same time, the difficulty of ensuring that only one node serves as the forwarding node increases along with the increase of the number of the nodes, so that the data redundancy for forwarding one data packet for a plurality of 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-mentioned problems, the present application provides a high-efficiency opportunistic routing method, by dividing the forwarding area of each sensor node in advance, each sensor node selects a downstream forwarding node from the sensor nodes in the forwarding node set according to the forwarding priority in the forwarding process, and sends data to the downstream forwarding node until the sink node is selected as the downstream forwarding node. And the forwarding angle of the sensor node is enlarged according to actual conditions 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 the larger forwarding area. The adoption of the method ensures that the sink node in the DC-WSN does not need to calculate the metric value for each sensor node by using global information and broadcast the metric value to the corresponding sensor node, thereby reducing communication overhead. And the forwarding area corresponding to each sensor node is adjustable, so that the problem caused by overlarge or undersize forwarding set when the fixed forwarding area established for each sensor node is not ideal is avoided.
Referring to fig. 1, the efficient opportunistic routing method provided in the present application includes:
step S101, initializing the DC-WSN, and calculating a corresponding duty ratio value of each sensor node in the DC-WSN according to a network duty ratio initial value broadcasted by the sink node.
After initializing the DC-WSN, the sink node sends a duty ratio initial 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 farther the sensor node is from the sink node, the longer the working time in one period.
And layering all the sensor nodes in a circular area with the sink node as a center according to the ratio of the distances from the different sensor nodes to the sink node and the communication radius of the sink node, wherein the DC values of the different sensor nodes in the same layer are the same.
Step S102, each sensor node calculates a forwarding angle initial value corresponding to the sensor node according to the duty ratio value.
In the efficient opportunistic routing method provided by the application, the relation between the initial value of the forwarding angle of the sensor node and the period satisfies the formula (1):
wherein T in formula (1) m 、T n DC periods for two different sensor nodes m and n, respectively; θ m 、θ n The initial angle of the forwarding areas corresponding to the sensor node m and the sensor node n are respectively. Since for the i-th layer sensor node: its DC period is T i ＝λ i ×Δt slot Wherein Δt is slot The time slot length is a fixed value; lambda (lambda) i Is the DC value of the i-th layer sensor node. By T i ＝λ i ×Δt slot For equation (1) T m 、T n After replacement and reduction of formula (1), formula (2) is obtained:
with the formula (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 a preamble signal carrying the initial value of the forwarding angle to the neighbor node, and entering a first monitoring period to monitor signals sent by the neighbor node.
After receiving the data packet sent by the upstream node, the single sensor node selects a 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 each sensor node monitoring the acknowledgement signal for the preamble signal sent by at least one candidate forwarding node in the forwarding node set in the 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, i.e. 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 receives the preamble signal when the node wakes up, and sends the neighbor node of the acknowledgement signal to the sensor node after determining that the node is located in a forwarding area according to the forwarding angle initial value carried in the preamble signal.
According to the efficient opportunistic routing method, each sensor node in the DC-WSN calculates a corresponding DC value according to the initial value of the duty ratio broadcasted by the sink node, calculates the initial value of the forwarding angle corresponding to each sensor node according to the DC value, and divides a corresponding forwarding area. When the data is forwarded, each sensor node only needs to select the downstream forwarding node of the current sensor node from the candidate forwarding nodes in the corresponding forwarding area to forward the data. 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 when the DC-WSN is established is avoided, and the additional communication overhead caused by updating the information of the sensor node and broadcasting the metric value in each round of transmission process is avoided; meanwhile, the problem of poor network expandability caused by the fact that the measurement 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 are changed is avoided.
As an optional embodiment, referring to fig. 1, in the efficient opportunistic routing method provided in the present application, when no downstream forwarding node is selected in step S104, the forwarding angle of the sensor node may be further enlarged, so as to enlarge 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 forwarding angle initial value to enlarge the forwarding area, updating the broadcasted preamble signal based on the increased forwarding angle initial value, and continuing to monitor the acknowledgement signal in a second monitoring period.
After the sensor node increases the corresponding forwarding angle initial value, broadcasting a preamble signal with the increased forwarding angle initial value to the neighbor node, and after the neighbor node receives the preamble signal with the increased forwarding angle initial value, calculating whether the sensor node is located in the forwarding area corresponding to the increased forwarding angle initial value. When the neighbor node is positioned in the forwarding area corresponding to the increased forwarding angle initial value, the neighbor node sends a confirmation signal to the sensor node, and the forwarding angle initial value stops increasing; otherwise, the initial value of the forwarding angle continues to be increased and whether a neighbor node sends a confirmation signal is judged until the forwarding angle value is increased to pi/2.
When the forwarding angle initial value is increased to pi/2 and no neighbor node still transmits a confirmation signal, waiting until the second monitoring period is finished to receive the confirmation signal transmitted by the neighbor node, and when the sensor node does not receive the confirmation signal transmitted by the neighbor node after the second monitoring period is finished, the data packet forwarding fails.
The method for expanding the forwarding angle of the sensor node, so as to expand the corresponding forwarding area and select the downstream forwarding node from the larger forwarding area, and the problem that the forwarding set is too small or too large due to the fact that the forwarding area is not ideal to establish when the fixed forwarding area is established is avoided.
As an alternative embodiment, referring to fig. 2, initializing the DC-WSN in step S101 and step S102, and calculating the duty cycle value and the forwarding angle value of the sensor node in the DC-WSN includes:
step S201, the sink node broadcasts a duty cycle initial value to the sensor node.
Step S202, the sensor node determines the layer number i of the sensor node.
The method comprises the steps of dividing a circular area with a sink node as a center into different layers according to the communication radius of the sink node, wherein sensor nodes are respectively located in the different layers, and DC values of the sensor nodes located in the same layer are the same.
When the sensor node determines the layer number i of the sensor node, 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 layer number i of the sensor node. If the ratio of the distance between the sensor node and the sink node to the communication radius of the sink node is smaller than 1, the sensor node is a layer 0 node.
Step S203, the sensor node calculates the self duty ratio value 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 cycle value λ according to the following formula (3) i ：
Wherein lambda is 0 Initial value of duty cycle, E, broadcasted for sink node r,0 And E is 0,0 Energy consumption for receiving and transmitting data packets for layer 0 nodes, E t,i And E is r,i Energy consumption for receiving and transmitting data packets for the i-layer node respectively, E lpl,i Not transmitting data packets for an i-layer sensor nodeMonitoring energy consumption at the time d i,s Is the distance between the sensor node of the i layer and the sink node. And each energy consumption in the formula (3) is obtained by measuring a sensor node in the DC-WSN in advance.
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 at the outermost layer is set to 60 °, and the initial values of the forwarding angles of the sensor nodes at the other layers are calculated according to the calculated DC value of the sensor nodes at each layer and 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, a forwarding priority of each of the plurality of candidate forwarding nodes may be determined and a candidate forwarding node having the highest forwarding priority may be selected as a downstream forwarding node of the sensor node.
For example, for each of the candidate forwarding nodes, a forwarding priority of the candidate forwarding node may be determined based on a distance between the candidate forwarding node and the sink node and a remaining energy of the candidate forwarding node.
Specifically, the forwarding priority of the candidate forwarding node may be determined by the following operations.
Calculating a forwarding process score of the candidate forwarding node according to the following formula (4):
wherein D is j-sink And D is the average value of the distances between the plurality of candidate forwarding nodes and the sink node.
Calculating a remaining energy score of the candidate forwarding node according to the following formula (5):
where ResidualEnergy (j) is the remaining energy of the candidate forwarding node, and MaxEnergy is the maximum value of the remaining energy of each of the plurality of candidate forwarding nodes.
The weighted summation calculation is carried out on the forwarding process score and the residual energy score according to the following formula (6), and the obtained result is used as the forwarding priority of the candidate forwarding node
Score(j)＝αProgress(j)+βRE(j) (6)
Wherein Score (j) represents a measure of forwarding priority, and α and β represent weights of a forwarding process Score and a residual energy Score, respectively, and are set according to actual needs.
And calculating and sequencing the forwarding priorities of the candidate forwarding nodes meeting the conditions, and selecting the candidate forwarding node with the largest forwarding priority as the downstream forwarding node, so that the difficulty of selecting the unique 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 rapidly selected from the candidate forwarding nodes, and the time consumed in selecting the downstream forwarding nodes is reduced.
In summary, according to the efficient opportunistic routing method provided by the present application, by dividing the forwarding area of each sensor node in advance, each sensor node selects a downstream forwarding node from the sensor nodes located in the forwarding area in the forwarding process, and enlarges the forwarding angle of the sensor node 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 the larger forwarding area. The adoption of the method ensures that the sink node in the DC-WSN does not need to calculate the metric value for each sensor node by using global information and broadcast the metric value to the corresponding sensor node, thereby reducing communication overhead. And the forwarding area corresponding to each sensor node is adjustable, so that the problem caused by overlarge or undersize forwarding set when the fixed forwarding area established for each sensor node is not ideal is avoided. And when the downstream forwarding node of the sensor node is selected, the forwarding priorities of a plurality of candidate forwarding nodes meeting the conditions are calculated and sequenced, and the candidate forwarding node with the largest forwarding priority is selected as the downstream forwarding node, so that the difficulty of selecting the only one node from the plurality of 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 rapidly 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 embodiments of the present application may be performed by a single device, for example, a computer or a server. The method of the embodiment can also be applied to a distributed scene, and is completed by mutually matching a plurality of devices. In the case of such a distributed scenario, one of the devices may perform only one or more steps of the methods of embodiments of the present disclosure, the devices interacting with each other to accomplish the methods.
It should be noted that some embodiments of the present application are described above. 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 are also possible or may be advantageous.
Based on the same inventive concept, the application also provides an efficient opportunistic routing device corresponding to the method of any embodiment. Referring to fig. 3, the efficient opportunistic routing apparatus includes:
an initialization module 301 configured to: initializing the DC-WSN, and calculating a corresponding duty ratio value of 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 302 configured to: and according to the duty ratio value, each sensor node calculates a forwarding angle initial value corresponding to the sensor node.
A broadcast module 303 configured to: and responding to the data packet sent by the upstream node received by each sensor node, continuously broadcasting a preamble signal carrying the initial value of the forwarding angle to the neighbor node, and entering a first monitoring period to monitor signals sent by the neighbor node.
A routing module 304 configured to: and responding to the response that each sensor node monitors the acknowledgement signal for the preamble signal 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.
As an optional embodiment, the efficient opportunistic routing apparatus further includes:
a control module 305 configured to: and in response to the sensor node not monitoring the acknowledgement signal in the first monitoring period, increasing the forwarding angle initial value to enlarge the forwarding area, updating the broadcasted preamble signal based on the increased forwarding angle initial value, and continuing to monitor the acknowledgement signal in a second monitoring period.
For convenience of description, the above sensor nodes are described as being functionally divided into various modules, respectively. Of course, the functions of each module may be implemented in the same piece or pieces of software and/or hardware when implementing the present application.
The sensor node in the foregoing embodiments is configured to implement the corresponding efficient opportunistic routing method in any one of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiments, which are not described herein.
Those of ordinary skill in the art will appreciate that: the discussion of any of the embodiments above is merely exemplary and is not intended to suggest that the scope of the application (including the claims) is limited to these examples; the technical features of the above embodiments or in the different embodiments may also be combined within the idea of the present application, the 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.
Additionally, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown within the provided figures, in order to simplify the illustration and discussion, and so as not to obscure the embodiments of the present application. Furthermore, the devices may be shown in block diagram form in order to avoid obscuring the embodiments of the present 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 on which the embodiments of the present application are to be implemented (i.e., such 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 embodiments of the application can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative in nature and not as restrictive.
While the present application has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of those embodiments will be apparent to those skilled 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. Accordingly, any omissions, modifications, equivalents, improvements and/or the like which are within the spirit and principles of the embodiments 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 a sensor node and a sink node, comprising:
initializing the DC-WSN, and calculating a corresponding duty ratio value of each sensor node in the DC-WSN according to a network duty ratio initial value broadcasted by the sink node;
according to the duty ratio value, each sensor node calculates a forwarding angle initial value corresponding to the sensor node;
responding to the data packet sent by the upstream node received by each sensor node, continuously broadcasting a preamble signal carrying the initial value of the forwarding angle to the neighbor node, and entering a first monitoring period to monitor signals sent by the neighbor node;
in response to each sensor node monitoring an acknowledgement signal for 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 forwarding node set 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 at the time of waking up, and transmits the acknowledgement signal to the sensor node after determining that itself is located in a forwarding area according to the forwarding angle initial value carried in the preamble signal.
2. The method of claim 1, further comprising:
and in response to the sensor node not monitoring the acknowledgement signal in the first monitoring period, increasing the forwarding angle initial value to enlarge the forwarding area, updating the broadcasted preamble signal based on the increased forwarding angle initial value, and continuing to monitor the acknowledgement signal in a second monitoring period.
3. A method according to claim 1 or 2, wherein the duty cycle value is calculated by the sensor node from the distance between the sensor node and sink node during initialization of the DC-WSN.
4. A method according to claim 3, wherein in initializing the DC-WSN, comprising:
in response to the sensor node receiving the initial value of the duty ratio broadcasted by the sink node, the sensor node calculates the ratio of the distance between the sensor node and the sink node to the communication radius of the sensor node and rounds down to determine the layer number i of the sensor node, wherein a circular area taking the sink node as the center is divided into different layers according to the communication radius of the sink node;
and determining the duty ratio value corresponding to the ith layer node based on the duty ratio initial 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 of the sensor nodes is proportional to the duty cycle value.
6. The method according to claim 1 or 2, wherein,
the at least one candidate forwarding node includes a plurality of candidate forwarding nodes;
selecting one of the at least one candidate forwarding node as the downstream forwarding node includes:
determining the forwarding priority of each of the plurality of candidate forwarding nodes;
and selecting the candidate forwarding node with the highest forwarding priority from the plurality of candidate forwarding nodes as the downstream forwarding node.
7. The method of claim 6, wherein determining the forwarding priority of each of the plurality of candidate forwarding nodes comprises:
for each of the candidate forwarding nodes, determining the forwarding priority of the candidate forwarding node based on a distance between the candidate forwarding node and the 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 the distance between the candidate forwarding node and sink node and the remaining energy comprises:
calculating average distances between the candidate forwarding nodes and the sink nodes;
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 in the respective remaining energies of the plurality of candidate forwarding nodes;
calculating a ratio of the remaining energy to the maximum energy value as a remaining energy score;
and determining the forwarding priority of the candidate forwarding node based on a weighted sum of the forwarding process score and the remaining energy score.
9. An efficient opportunistic routing apparatus for a duty cycle wireless sensor network, DC-WSN, wherein the DC-WSN comprises a sensor node and a sink node, comprising:
an initialization module configured to: initializing the DC-WSN, and calculating a corresponding duty ratio value of 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 value, each sensor node calculates a forwarding angle initial value corresponding to the sensor node;
a broadcast module configured to: responding to the data packet sent by the upstream node received by the sensor node, continuously broadcasting a preamble signal carrying the initial value of the forwarding angle to the neighbor node, and entering a first monitoring period to monitor signals sent by the neighbor node;
a routing module configured to: stopping broadcasting the preamble signal and selecting one of the at least one candidate forwarding nodes as a downstream forwarding node in response to the sensor node monitoring an acknowledgement signal for the preamble signal sent by at least one candidate forwarding node in the forwarding node set in a first monitoring period, so as 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 of the candidate forwarding nodes corresponding to the sensor nodes; the candidate forwarding node is the neighbor node that receives the preamble signal at the time of waking up, and transmits the acknowledgement signal to the sensor node after determining that itself is located in a forwarding area according to the forwarding angle initial value carried in the preamble signal.
10. The efficient opportunistic routing apparatus of claim 9, further comprising:
a control module configured to: and in response to the sensor node not monitoring the acknowledgement signal in the first monitoring period, increasing the forwarding angle initial value to enlarge the forwarding area, updating the broadcasted preamble signal based on the increased forwarding angle initial value, and continuing to monitor the acknowledgement signal in a second monitoring 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 CN114125984A (en) | 2022-03-01 |
| CN114125984B true 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 (4)
| 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 |
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190166502A1 (en) * | 2017-11-29 | 2019-05-30 | Mojo Networks, LLC. | Security monitoring for wireless sensor nodes |
-
2021
- 2021-11-22 CN CN202111391138.5A patent/CN114125984B/en active Active
Patent Citations (4)
| 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 |
| 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 |
|---|---|
| CN114125984A (en) | 2022-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106604346B (en) | Method for realizing energy-efficient opportunistic routing of wireless sensor network | |
| Younis et al. | Energy-aware routing in cluster-based sensor networks | |
| Youssef et al. | A constrained shortest-path energy-aware routing algorithm for wireless sensor networks | |
| Yu et al. | An energy-efficient chain-based routing protocol in wireless sensor network | |
| US20120087290A1 (en) | Communicating over a Wireless Network | |
| Nazir et al. | Dynamic sleep scheduling for minimizing delay in wireless sensor network | |
| Singh et al. | Energy-efficient QoS-aware intelligent hybrid clustered routing protocol for wireless sensor networks | |
| US10499264B1 (en) | Role selection method in wireless communication networks | |
| Coutinho et al. | A joint anypath routing and duty-cycling model for sustainable underwater sensor networks | |
| Rahama et al. | A routing protocol for improving energy efficiency in wireless sensor networks | |
| Pradhan et al. | A survey on hierarchical clustering algorithm for wireless sensor networks | |
| CN114125984B (en) | Efficient opportunistic routing method and device | |
| US11871343B2 (en) | Optimized parent and path selection for battery powered devices within a wireless network | |
| Khan et al. | Load balancing and collision avoidance using opportunistic routing in wireless sensor networks | |
| Meghanathan et al. | Centralized and Distributed Algorithms for Stability-based Data Gathering in Mobile Sensor Networks. | |
| Matsui et al. | ECORS: Energy consumption-oriented route selection for wireless sensor network | |
| Zeb et al. | Location Centric Energy Harvesting Aware Routing Protocol for IoT in Smart Cities | |
| Coutinho et al. | Pcon: a novel opportunistic routing protocol for duty-cycled Internet of underwater things | |
| Feng et al. | An adaptive data gathering strategy for target tracking in cluster-based wireless sensor networks | |
| Paul et al. | E2RIC: Energy-efficient receiver-initiated cooperative MAC protocol for IoUT networks | |
| Jing et al. | A cluster-based multipath delivery scheme for wireless sensor networks | |
| Frye et al. | Topology management for wireless sensor networks | |
| Alapati et al. | An Efficient Power Reduction Mode in Mobile Ad hoc Networks to Reduce the Power Consumption Levels for Improving the QoS | |
| Liu et al. | A grid-based distributed multi-hop routing protocol for wireless sensor networks | |
| Shinde et al. | An energy efficient critical event monitoring routing method for 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 |