CN112738863A - Data routing method and system based on dynamic ring - Google Patents
Data routing method and system based on dynamic ring Download PDFInfo
- Publication number
- CN112738863A CN112738863A CN202011596234.9A CN202011596234A CN112738863A CN 112738863 A CN112738863 A CN 112738863A CN 202011596234 A CN202011596234 A CN 202011596234A CN 112738863 A CN112738863 A CN 112738863A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- dynamic ring
- data
- hop count
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 230000005540 biological transmission Effects 0.000 claims abstract description 26
- 230000000977 initiatory effect Effects 0.000 claims description 20
- 230000002776 aggregation Effects 0.000 claims description 12
- 238000004220 aggregation Methods 0.000 claims description 12
- 230000008569 process Effects 0.000 claims description 9
- 238000012545 processing Methods 0.000 claims description 3
- 230000001360 synchronised effect Effects 0.000 claims description 2
- 238000005265 energy consumption Methods 0.000 abstract description 17
- 230000002035 prolonged effect Effects 0.000 abstract description 2
- 230000001351 cycling effect Effects 0.000 abstract 1
- 238000004891 communication Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- 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 invention discloses a data routing method and a data routing system based on a dynamic ring. The method comprises the following steps: timing or cycling execution: s1, acquiring the residual energy of other nodes except the sink node in the wireless sensor network, and acquiring a dynamic ring according to the residual energy distribution of other nodes; s2, determining the hop count of all nodes in the wireless sensor network relative to the dynamic ring through broadcasting; s3, within the dynamic ring: except the nodes which can be directly transmitted to the sink node, other nodes adopt a centrifugal routing mode to transmit data to the dynamic ring; outside the dynamic ring: all nodes transmit data to the dynamic ring by adopting a centripetal routing mode; and S4, establishing a data transmission loop on the dynamic loop, converging all the received data to a node by using the data transmission loop, and transmitting the data to the sink node through the node. The position of the dynamic ring is dynamically adjusted according to the residual energy of the nodes in the network, so that the energy consumption is balanced, the service life of the network is prolonged, and the energy utilization rate is improved.
Description
Technical Field
The invention relates to the technical field of wireless sensor network routing, in particular to a data routing method and system based on a dynamic ring.
Background
One of the basic services provided by Wireless Sensor Networks (WSNs) is monitoring of a Field of Interest (FoI). The target in the monitored area is detected by a large number of sensor nodes deployed in the monitored area. Therefore, WSNs are widely used in various scenes for object detection, such as environmental monitoring, military reconnaissance, and industrial automation.
WSNs are composed of a large number of nodes, each sensor can be used as a node, and the power, storage and computing capability of each node are limited, mainly, the nodes are usually powered by miniature batteries, and the nodes are often deployed in a harsh environment, and it is difficult to replace the batteries. Therefore, on the premise of not losing the basic functions of the WSNs network, how to reasonably utilize energy to prolong the service life of the network as much as possible and maximize the energy utilization rate is a problem to be faced.
In the prior art, a method for saving energy through data aggregation is provided, and data aggregation is to combine data collected by one or more sensor nodes in a data source or multi-hop transmission process, so as to reduce redundant information in monitored data, thereby effectively reducing the data amount required to be transmitted in a network, reducing the energy consumption of data transmission, and achieving the effect of saving energy. Although data aggregation can reduce the amount of data required to be transmitted to a Sink node, so as to reduce energy consumption of the node, due to reasons such as Sink node hot zone effect (namely that energy consumption of nodes near the Sink is too fast, and energy of nodes far away from the Sink node is excessive), energy consumption of the nodes in the WSNs network is unbalanced, partial energy consumption of the nodes can occur, data of nodes in a peripheral area can not be received, and the WSNs network dies in advance, so that the service life of the whole WSNs network is not high. Therefore, how to reduce the communication energy consumption of the WSNs network and prolong the life cycle of the WSNs network through an effective routing algorithm has become an important challenge for the wireless sensor network.
Disclosure of Invention
The invention aims to at least solve the technical problems in the prior art, and particularly provides a data routing method and system based on a dynamic ring.
In order to achieve the above object of the present invention, according to a first aspect of the present invention, there is provided a dynamic ring-based data routing method, performing, periodically or cyclically: s1, acquiring the residual energy of other nodes except the sink node in the wireless sensor network, and acquiring a dynamic ring according to the residual energy distribution of other nodes; s2, determining the hop count of all nodes in the wireless sensor network relative to the dynamic ring through broadcasting; s3, in the dynamic ring: except the nodes which can be directly transmitted to the sink node, other nodes all adopt a centrifugal routing mode to transmit data to the dynamic ring; outside the dynamic ring: all nodes transmit data to the dynamic ring by adopting a centripetal routing mode; and S4, establishing a data transmission loop on the dynamic loop, converging all the received data to a node by using the data transmission loop, and transmitting the data to the sink node through the node.
The technical scheme is as follows: the routing method changes a centripetal routing data aggregation mode taking a sink node as a center in the traditional routing strategy, but routes data generated by the node to a dynamic ring with abundant energy, and routes the data of all nodes (except the sink node) of the network to the sink node after performing data aggregation along a data transmission loop of the dynamic ring; the routing method dynamically adjusts the position of the dynamic ring according to the residual energy of the nodes in the network, thereby greatly reducing the energy consumption of the hot area in the network, and the energy consumption of the dynamic ring is balanced and shared on the nodes of the whole network by continuously changing the position of the dynamic ring although the energy consumption of the nodes on the dynamic ring is larger, thereby realizing the energy consumption balance, prolonging the service life of the network and improving the energy utilization rate of the network.
In a preferred embodiment of the present invention, in S1, the acquiring the dynamic ring includes: s11, selecting the hop count of the ring distance sink node with the maximum average residual energy as the hop count k of the dynamic ring according to the average residual energy of the nodes in each ring; s12, the sink node initiates a k-hop centrifugal route with the sink node as the center, and selects a node farthest away from the sink node as a next-hop node in each hop until the hop count of the node is k, so as to obtain a first k-hop node; and S13, taking the first k-hop node as the initiating node of the dynamic ring, and the initiating node sequentially selects the neighbor nodes which are farthest away from the initiating node and have the hop count of k away from the sink node as the next-hop node according to the anticlockwise or clockwise sequence until the nodes return to the initiating node in a circle, wherein the nodes passing through the circle form the dynamic ring, namely the ring route.
The technical scheme is as follows: step S11, dynamically adjusting the position of the dynamic ring according to the residual energy of the nodes in the network, and sharing the energy consumption of the dynamic ring on the nodes of the whole network in a balanced manner; the energy consumption of the hot area in the network is greatly reduced through the steps S12 and S13, so that the dynamic ring is far away from the hot area of the network as much as possible; the service life of the network is prolonged, and the energy utilization rate of the network is improved.
In a preferred embodiment of the present invention, the S2 includes: s21, setting the hop count of each node on the dynamic ring reaching the dynamic ring as 0; s22, broadcasting the information packets to the neighbor nodes in sequence from the nodes on the dynamic ring; s23, after receiving the broadcasted packet, all nodes in the network perform the following processing until all nodes obtain the hop count from the dynamic ring: after receiving the information packet, the node broadcasts the hop count in the information packet after adding 1 to the hop count, meanwhile, the hop count of the node is compared with the value obtained by adding 1 to the hop count in the received information packet, and if the value obtained by adding 1 to the hop count of the information packet is smaller than the hop count of the current node, the node sets the hop count of the node as the hop count in the information packet plus 1.
In a preferred embodiment of the present invention, in S3, the data transmission between the dynamic ring inside and the dynamic ring outside is synchronous.
The technical scheme is as follows: the speed of acquiring the data of the wireless sensor network nodes is increased.
In a preferred embodiment of the present invention, in S3, the centrifugal routing process is: and when the current node jumps to the next node, selecting a neighbor node with the hop count larger than the hop count of the current node from the dynamic ring as the next node in the direction away from the sink node.
The technical scheme is as follows: and the data transmission speed of the nodes is further improved.
In a preferred embodiment of the present invention, in S3, the centripetal routing process is:
and when the current node jumps to the next node, selecting a neighbor node which is less than the hop count of the current node from the dynamic ring as the next node in the direction close to the sink node.
The technical scheme is as follows: and the data transmission speed of the nodes is further improved.
In a preferred embodiment of the present invention, in S4, a node is randomly selected as an initial node on the dynamic ring, data is aggregated to a point along the dynamic ring route from the left and right directions of the initial node, data of all nodes in the network is aggregated into a data packet, and the data packet is sent to the sink node through the node at the aggregation; and/or in S4, the aggregated packet is routed to the sink node by the shortest route.
The technical scheme is as follows: the received node data are simultaneously gathered in the left and right directions on the dynamic ring, and the gathered data are routed to the sink node in the shortest route mode, so that the transmission delay can be reduced, and the data acquisition speed is improved.
In order to achieve the above object, according to a second aspect of the present invention, there is provided a wireless sensor network system, including a plurality of sensor nodes, at least one of which is a sink node, the system obtaining remaining energy of other nodes except the sink node, and obtaining a dynamic ring according to remaining energy distribution of the other nodes; the system further comprises: determining the hop count of all nodes in the wireless sensor network relative to the dynamic ring through broadcasting; within the dynamic ring: except the nodes which can be directly transmitted to the sink node, other nodes all adopt a centrifugal routing mode to transmit data to the dynamic ring; outside the dynamic ring: all nodes transmit data to the dynamic ring by adopting a centripetal routing mode; and establishing a data transmission loop on the dynamic loop, converging all received data to a node by using the data transmission loop, and transmitting the data to the sink node through the node.
The technical scheme is as follows: the system changes a centripetal routing data aggregation mode taking a sink node as a center in the traditional routing strategy, but routes data generated by the node to a dynamic ring with abundant energy, and routes the data of all nodes (except the sink node) of the network to the sink node after performing data aggregation along a data transmission loop of the dynamic ring; the system dynamically adjusts the position of the dynamic ring according to the residual energy of the nodes in the network, thereby greatly reducing the energy consumption of the hot area in the network, and the energy consumption of the dynamic ring is balanced and shared on the nodes of the whole network by continuously changing the position of the dynamic ring although the energy consumption of the nodes on the dynamic ring is larger, thereby realizing the energy consumption balance, prolonging the service life of the network and improving the energy utilization rate of the network.
Drawings
Fig. 1 is a flowchart illustrating a dynamic ring-based data routing method according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the accompanying drawings are illustrative only for the purpose of explaining the present invention, and are not to be construed as limiting the present invention.
In the description of the present invention, it is to be understood that the terms "longitudinal", "lateral", "upper", "lower", "front", "rear", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", and the like, indicate orientations or positional relationships based on those shown in the drawings, and are used merely for convenience of description and for simplicity of description, and do not indicate or imply that the referenced devices or elements must have a particular orientation, be constructed in a particular orientation, and be operated, and thus, are not to be construed as limiting the present invention.
In the description of the present invention, unless otherwise specified and limited, it is to be noted that the terms "mounted," "connected," and "connected" are to be interpreted broadly, and may be, for example, a mechanical connection or an electrical connection, a communication between two elements, a direct connection, or an indirect connection via an intermediate medium, and specific meanings of the terms may be understood by those skilled in the art according to specific situations. The invention discloses a data routing method based on a dynamic ring, which comprises the following steps that in a preferred embodiment, as shown in figure 1, the following steps are executed in a timed or circulating mode: s1, acquiring the residual energy of other nodes except the sink node in the wireless sensor network, and acquiring a dynamic ring according to the residual energy distribution of other nodes; s2, determining the hop count of all nodes in the wireless sensor network relative to the dynamic ring through broadcasting; s3, within the dynamic ring: except for the nodes which can be directly transmitted to the sink node, other nodes transmit data to the dynamic ring in a centrifugal routing mode, and generally, the nodes within one hop distance from the sink node are regarded as the nodes which are directly transmitted to the sink node, namely the nodes in the first ring; outside the dynamic ring: all nodes transmit data to the dynamic ring by adopting a centripetal routing mode; and S4, establishing a data transmission loop on the dynamic loop, converging all the received data to a node by using the data transmission loop to form a data packet, and transmitting the data packet to the sink node through the node.
In the present embodiment, the timed interval is preferably, but not limited to, equal to or greater than one communication cycle.
In a preferred embodiment, in S1, the process of acquiring the dynamic ring includes: s11, selecting, according to the average residual energy of the nodes in each ring, the hop count of the ring distance sink node with the largest average residual energy as the hop count k of the dynamic ring, where k is a positive integer, and generally, if the hop count of the node distance sink node is p, the region formed by the nodes is considered as the pth ring, and p is a positive integer, so if the average residual energy of the node of the kt ring (i.e., the k hop distance from the sink node) is the largest, the hop count of the dynamic ring is set as k; s12, the sink node initiates a k-hop centrifugal route with the sink node as the center, and selects the node farthest from the sink node as the next hop node in each hop until the hop count of the node is k, so as to obtain a first k-hop node; s13, the first k-hop node is used as the initiating node of the dynamic ring, the initiating node sequentially selects the neighbor nodes which are farthest away from the initiating node and have the hop number of k away from the sink node as the next-hop node according to the anticlockwise or clockwise sequence until the neighbor nodes return to the initiating node in a circle, the nodes passing through the circle form the dynamic ring, namely the dynamic ring, the dynamic ring is the ring route, and the nodes on the ring route are the nodes on the dynamic ring.
In this embodiment, it is preferable that k is the minimum hop count between the node with the largest residual energy and the sink node according to the residual energy distribution of other nodes.
In a preferred embodiment, S2 includes: s21, setting the hop count of each node on the dynamic ring reaching the dynamic ring as 0; s22, broadcasting the information packets to the neighbor nodes in sequence from the nodes on the dynamic ring; s23, after receiving the broadcasted packet, all nodes in the network perform the following processing until all nodes obtain the hop count from the dynamic ring: after receiving the information packet, the node broadcasts the hop count in the information packet after adding 1 to the hop count, meanwhile, the hop count of the node is compared with the value obtained by adding 1 to the hop count in the received information packet, and if the value obtained by adding 1 to the hop count of the information packet is smaller than the hop count of the current node, the node sets the hop count of the node as the hop count in the information packet plus 1.
In a preferred embodiment, the data transmission within the dynamic ring and the data transmission outside the dynamic ring are performed synchronously at S3.
In a preferred embodiment, in S3, the process of centrifugal routing is: and when the current node jumps to the next node, selecting a neighbor node with the hop count larger than the hop count of the current node from the dynamic ring as the next node in the direction away from the sink node until the next node is routed to the ring area within the one-hop range of the dynamic ring.
In a preferred embodiment, in S3, the centripetal routing process is: and when the current node jumps to the next node, selecting a neighbor node which is less than the hop count of the current node from the dynamic ring as the next node in the direction close to the sink node.
In a preferred embodiment, in S4, a node is randomly selected as a start node on the dynamic ring, data is aggregated to a point along the dynamic ring from the left and right directions of the start node, data of all nodes in the network is aggregated into a data packet, and the data packet is sent to the sink node through the node at the aggregation. In S4, the node at the aggregation routes the aggregated packet to the sink node by the shortest route, that is, the node at the aggregation sends the packet to the node at a shorter distance as much as possible during the packet transmission process, so that the data loss is minimized.
The invention also discloses a wireless sensing network system, which comprises a plurality of sensor nodes, wherein at least one sensor node is a sink node, and the system acquires the residual energy of other nodes except the sink node and acquires a dynamic ring according to the residual energy distribution of other nodes; the system further comprises: determining the hop count of all nodes in the wireless sensor network relative to the dynamic ring through broadcasting; within the dynamic ring: except the nodes which can be directly transmitted to the sink node (the 1 st ring), other nodes all adopt a centrifugal routing mode to transmit data to the dynamic ring; outside the dynamic ring: all nodes transmit data to the dynamic ring by adopting a centripetal routing mode; and establishing a data transmission loop on the dynamic loop, converging all the received data to a node by using the data transmission loop, and transmitting the data to the sink node through the node.
In a preferred embodiment, the process of the system acquiring the dynamic ring comprises: s11, selecting the hop count of the ring distance sink node with the maximum average residual energy as the hop count k of the dynamic ring according to the average residual energy of the nodes in each ring; s12, the sink node initiates a k-hop centrifugal route with the sink node as the center, and selects the node farthest from the sink node as the next hop node in each hop until the hop count of the node is k, so as to obtain a first k-hop node; s13, the first k jump node is used as the initiating node of the dynamic ring, the initiating node selects the neighbor nodes which are farthest from the initiating node and have the jump number of k from the sink node as the next jump node according to the anticlockwise or clockwise sequence, until the node returns to the initiating node in a circle, the nodes passing through in the circle form the dynamic ring, namely the ring route.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
While embodiments of the invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.
Claims (9)
1. A data routing method based on dynamic ring, characterized by performing periodically or circularly:
s1, acquiring the residual energy of other nodes except the sink node in the wireless sensor network, and acquiring a dynamic ring according to the residual energy distribution of other nodes;
s2, determining the hop count of all nodes in the wireless sensor network relative to the dynamic ring through broadcasting;
s3, in the dynamic ring: except the nodes which can be directly transmitted to the sink node, other nodes all adopt a centrifugal routing mode to transmit data to the dynamic ring;
outside the dynamic ring: all nodes transmit data to the dynamic ring by adopting a centripetal routing mode;
and S4, establishing a data transmission loop on the dynamic loop, converging all the received data to a node by using the data transmission loop, and transmitting the data to the sink node through the node.
2. The dynamic ring-based data routing method of claim 1, wherein in the S1, the process of acquiring the dynamic ring comprises:
s11, selecting the hop count of the ring distance sink node with the maximum average residual energy as the hop count k of the dynamic ring according to the average residual energy of the nodes in each ring;
s12, the sink node initiates a k-hop centrifugal route with the sink node as the center, and selects a node farthest away from the sink node as a next-hop node in each hop until the hop count of the node is k, so as to obtain a first k-hop node;
and S13, taking the first k-hop node as the initiating node of the dynamic ring, and the initiating node sequentially selects the neighbor nodes which are farthest away from the initiating node and have the hop count of k away from the sink node as the next-hop node according to the anticlockwise or clockwise sequence until the nodes return to the initiating node in a circle, wherein the nodes passing through the circle form the dynamic ring, namely the ring route.
3. The dynamic ring-based data routing method of claim 1, wherein the S2 comprises:
s21, setting the hop count of each node on the dynamic ring reaching the dynamic ring as 0;
s22, broadcasting the information packets to the neighbor nodes in sequence from the nodes on the dynamic ring;
s23, after receiving the broadcasted packet, all nodes in the network perform the following processing until all nodes obtain the hop count from the dynamic ring:
after receiving the information packet, the node broadcasts the hop count in the information packet after adding 1 to the hop count, meanwhile, the hop count of the node is compared with the value obtained by adding 1 to the hop count in the received information packet, and if the value obtained by adding 1 to the hop count of the information packet is smaller than the hop count of the current node, the node sets the hop count of the node as the hop count in the information packet plus 1.
4. The dynamic ring-based data routing method of claim 1, wherein in the S3, the transmission of data within and outside the dynamic ring is synchronous.
5. The dynamic ring-based data routing method of claim 1, wherein in the S3, the process of the centrifugal routing is: and when the current node jumps to the next node, selecting a neighbor node with the hop count larger than the hop count of the current node from the dynamic ring as the next node in the direction away from the sink node.
6. The dynamic ring-based data routing method of claim 1, wherein in the S3, the centripetal routing process is:
and when the current node jumps to the next node, selecting a neighbor node which is less than the hop count of the current node from the dynamic ring as the next node in the direction close to the sink node.
7. The dynamic ring-based data routing method of claim 1, wherein in S4, a node is randomly selected as a start node on the dynamic ring, data is aggregated to a point along the dynamic ring route from the left and right directions of the start node, data of all nodes in the network is aggregated into a data packet, and the data packet is sent to the sink node through the node at the aggregation;
and/or in S4, the aggregated packet is routed to the sink node by the shortest route.
8. A wireless sensor network system comprises a plurality of sensor nodes, at least one sensor node is a sink node, and the system is characterized in that the system acquires the residual energy of other nodes except the sink node and acquires a dynamic ring according to the residual energy distribution of other nodes; the system further comprises:
determining the hop count of all nodes in the wireless sensor network relative to the dynamic ring through broadcasting;
within the dynamic ring: except the nodes which can be directly transmitted to the sink node, other nodes all adopt a centrifugal routing mode to transmit data to the dynamic ring;
outside the dynamic ring: all nodes transmit data to the dynamic ring by adopting a centripetal routing mode;
and establishing a data transmission loop on the dynamic loop, converging all received data to a node by using the data transmission loop, and transmitting the data to the sink node through the node.
9. The wireless sensor network system of claim 8, wherein the system acquiring the dynamic ring comprises:
s11, selecting the hop count of the ring distance sink node with the maximum average residual energy as the hop count k of the dynamic ring according to the average residual energy of the nodes in each ring;
s12, the sink node initiates a k-hop centrifugal route with the sink node as the center, and selects a node farthest away from the sink node as a next-hop node in each hop until the hop count of the node is k, so as to obtain a first k-hop node;
and S13, taking the first k-hop node as the initiating node of the dynamic ring, and the initiating node sequentially selects the neighbor nodes which are farthest away from the initiating node and have the hop count of k away from the sink node as the next-hop node according to the anticlockwise or clockwise sequence until the nodes return to the initiating node in a circle, wherein the nodes passing through the circle form the dynamic ring, namely the ring route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011596234.9A CN112738863A (en) | 2020-12-28 | 2020-12-28 | Data routing method and system based on dynamic ring |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011596234.9A CN112738863A (en) | 2020-12-28 | 2020-12-28 | Data routing method and system based on dynamic ring |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112738863A true CN112738863A (en) | 2021-04-30 |
Family
ID=75609860
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011596234.9A Pending CN112738863A (en) | 2020-12-28 | 2020-12-28 | Data routing method and system based on dynamic ring |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112738863A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100220653A1 (en) * | 2007-11-01 | 2010-09-02 | Hwang So-Young | Multi-path routing method in wireless sensor network |
| CN102076049A (en) * | 2010-12-10 | 2011-05-25 | 清华大学 | Routing method based on energy balancing of potential energy field |
| CN103686920A (en) * | 2012-09-06 | 2014-03-26 | 江苏迈利科技发展有限公司 | Multi-path reliable data transmission method of industrial wireless sensor network based on surplus energy and multi-aggregation node |
| CN106304236A (en) * | 2016-08-25 | 2017-01-04 | 中南林业科技大学 | Data assemble method for routing and system |
| CN108848461A (en) * | 2018-06-13 | 2018-11-20 | 河海大学常州校区 | It is a kind of based on dynamically loop by WSNs source node location method for secret protection |
-
2020
- 2020-12-28 CN CN202011596234.9A patent/CN112738863A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100220653A1 (en) * | 2007-11-01 | 2010-09-02 | Hwang So-Young | Multi-path routing method in wireless sensor network |
| CN102076049A (en) * | 2010-12-10 | 2011-05-25 | 清华大学 | Routing method based on energy balancing of potential energy field |
| CN103686920A (en) * | 2012-09-06 | 2014-03-26 | 江苏迈利科技发展有限公司 | Multi-path reliable data transmission method of industrial wireless sensor network based on surplus energy and multi-aggregation node |
| CN106304236A (en) * | 2016-08-25 | 2017-01-04 | 中南林业科技大学 | Data assemble method for routing and system |
| CN108848461A (en) * | 2018-06-13 | 2018-11-20 | 河海大学常州校区 | It is a kind of based on dynamically loop by WSNs source node location method for secret protection |
Non-Patent Citations (1)
| Title |
|---|
| 江良珊: "无线传感器网络中基于动态环的数据聚集研究", 《中国优秀博硕士学位论文全文数据库（硕士）信息科技辑》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106604346B (en) | Method for realizing energy-efficient opportunistic routing of wireless sensor network | |
| Gong et al. | Multihop routing protocol with unequal clustering for wireless sensor networks | |
| CN104853395A (en) | Multi-sense unequal-radius wireless sensor network route implementing method | |
| Li et al. | Energy-efficient multipath routing in wireless sensor network considering wireless interference | |
| Mishra et al. | Study of cluster based routing protocols in wireless sensor networks | |
| Lim et al. | MCAS-MAC: A multichannel asynchronous scheduled MAC protocol for wireless sensor networks | |
| CN110662271A (en) | Method for self-adaptive adjustment of routing protocol parameters based on OLSR | |
| CN107222903A (en) | Method of data capture based on constructive interference in asynchronous low duty ratio WSN | |
| Zhao et al. | Energy efficient and cluster based routing protocol for WSN | |
| Fan et al. | A multi-hop energy-efficient sleeping MAC protocol based on TDMA scheduling for wireless mesh sensor networks | |
| Cengiz et al. | Multi-hop low energy fixed clustering algorithm (M-LEFCA) for WSNs | |
| CN112738863A (en) | Data routing method and system based on dynamic ring | |
| Wang et al. | A path-based approach for data aggregation in grid-based wireless sensor networks | |
| Chelbi et al. | An Unequal Cluster-based Routing Protocol Based on Data Controlling for Wireless Sensor Network. | |
| Lv et al. | A low energy uneven clustering topology control algorithm for wireless networks | |
| Li et al. | An energy based dynamic AODV routing protocol in wireless Ad Hoc networks | |
| Sudheendran et al. | Challenges of mobility aware MAC protocols in WSN | |
| Jing et al. | A cluster-based multipath delivery scheme for wireless sensor networks | |
| Mishra et al. | Fault tolerant multi cluster head data aggregation protocol in WSN (FMCDA) | |
| Yamini et al. | Improved location-free topology control protocol in MANET | |
| Balan et al. | Energy Efficient Multi-hop routing scheme using Taylor based Gravitational Search Algorithm in Wireless Sensor Networks | |
| Sirdeshpande et al. | Lifetime Maximization Using Modified Leach Protocol for Energy Efficient Routing In Wireless Sensor Networks | |
| Bajaber et al. | Distributed energy balanced clustering for wireless sensor networks | |
| Venkatesh Prasad | Improved energy efficient hierarchical cluster tree based routing to prolong network lifetime | |
| Can et al. | A novel node deployment and clustering scheme in 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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210430 |