CN108650697B - Data routing method in long-distance linear wireless sensor network - Google Patents
Data routing method in long-distance linear wireless sensor network Download PDFInfo
- Publication number
- CN108650697B CN108650697B CN201810419175.4A CN201810419175A CN108650697B CN 108650697 B CN108650697 B CN 108650697B CN 201810419175 A CN201810419175 A CN 201810419175A CN 108650697 B CN108650697 B CN 108650697B
- Authority
- CN
- China
- Prior art keywords
- sub
- node
- chain
- nodes
- data
- 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
- 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
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/125—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality using a measured number of retransmissions as a link metric
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/126—Shortest path evaluation minimising geographical or physical path length
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/46—Cluster building
-
- 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/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- 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 in a long-distance linear wireless sensor network, which comprises a sub-chain dividing stage, an intra-chain data gathering stage and an inter-chain communication stage, wherein monitoring information is integrated and optimized, so that the condition monitoring delay of the whole long-distance linear line is reduced, and the safety and the network reliability in the data transmission process are ensured. The invention has the characteristics of low energy consumption and low time delay, and can use relatively few nodes to carry out communication of a large amount of data, so that the transmission success rate of the whole network reaches the highest.
Description
Technical Field
The invention belongs to the technical field of wireless sensing, and particularly relates to a data routing method in a long-distance linear wireless sensing network.
Background
Advanced technologies in wireless communication protocols and embedded designs have enabled low-power small multifunction sensor nodes to be widely used in Wireless Sensor Networks (WSNs), involving a variety of fields from environmental monitoring to health and entertainment. The sensor nodes can detect environmental parameters within their sensing range and route data to nodes within their communication range in a multi-hop manner. Sensor nodes typically work in concert to monitor hard-to-reach areas of humans. WSNs may require a uniform node layout, and after deployment of sensor nodes, network reliability depends on several parameters, including connectivity, data routing delays, and accuracy of sensor event detection.
WSN deployment involves several decision parameters, such as the number of deployed sensor nodes and the rate of data transfer between nodes, and needs to guarantee that the lifetime of the nodes lasts longer, and the node deployment location and the inter-node distance also affect energy usage, so data exchange needs to be reliably and efficiently scheduled in order to reduce data transmission delay and extend network lifetime by allocating energy load. The network life cycle is defined as the time when the network starts to work until some sensor nodes are exhausted and the whole network cannot provide data transmission service.
Due to the wide linear span, long-range wireless sensor networks can be used to monitor the safety and use of oil and gas pipelines. The quality of service (QoS) of a linear wireless sensor network requires that the data exchange method must be flexible and that switching between node sleep mode and operational mode is arranged in order to extend the lifetime of the network. The link quality defined by the Received Signal Strength Indicator (RSSI) is a major parameter of the network connection. For an acceptable QoS level, the transmission time of information needs to be as short as possible, and the data communication time per round needs to be stable and cannot be changed greatly. Furthermore, data routing mechanisms need to be designed to maintain the data load at critical points. Network reliability, fault tolerance and delay minimization in many cases requires that routing decisions be reflected or optimized.
The Linear Wireless Sensor Network (LWSN) architecture is a special case of all network topologies, and long-distance multi-hop communication results in increased data transmission time. LWSN may be too simple in topology, but the design of data routing mechanisms and node deployment methods is not simple. This network problem has been the focus of recent research.
Disclosure of Invention
In order to solve the technical problems in the background art, the present invention aims to provide a data routing method in a long-distance linear wireless sensor network, which reduces the condition monitoring delay of the whole long-distance linear line and simultaneously ensures the security and the network reliability in the data transmission process.
In order to achieve the technical purpose, the technical scheme of the invention is as follows:
a data routing method in a long-distance linear wireless sensor network comprises the following steps:
(1) dividing the whole linear topology network into C sub-chains;
(2) to be furthest from the base station
Putting one node into the 1 st sub-chain, and putting the node farthest from the base station in the rest nodes
Putting a node into the 2 nd sub-chain, and so on until all nodes are assigned to a small group of sub-chains, wherein
Represents rounding down;
(3) sequentially selecting next round of communication nodes from the C sub-chains for communication;
(4) in the ith sub-chain, all nodes add own relative energy parameter information into a sensing message data packet, and then send the data packet to the communication node of the current round of the sub-chain, wherein i is 1,2, …, C;
(5) the communication node receives data packets sent by other nodes in the sub-chain and generates signal strength data of each node;
(6) calculating signal quality parameters of the nodes according to the signal strength data of each node;
(7) putting all nodes with signal quality parameters greater than or equal to a preset threshold value in the ith sub-chain into a SetiInternal;
(8) search SetiInner phase relative to each otherAdding the node information to a data packet and an ACK message, and sending the data packet to the communication node of the (i + 1) th child chain;
(9) replying an ACK message after receiving a data packet from the communication node of the i-1 subchain;
(10) an ACK message is broadcast within the ith child chain.
Further, in step (1), the number C of daughter strands is confirmed by the following formula:
in the above formula, PCThe probability that the network is composed of C sub-chains at most, n is the total number of nodes, l is the length of a network link, r0Sending the distance for the node, i is the child chain number,
further, in step (2), when all the C child chains are allocated with full nodes and there are several nodes nearest to the base station that are not allocated with child chains, all the remaining nodes are allocated in the C-th child chain.
Further, in the step (4), the current round of communication refers to that the communication nodes meeting the conditions in the C sub-chains all participate in a process of communicating with the adjacent sub-chain nodes once.
Further, in step (6), the signal quality parameter of the node is calculated by the following formula:
in the above formula, RSSIkThe RSRP is the received power of the reference signal, which is the signal strength data of the kth node in the sub-chain.
Further, in step (8), the relative energy parameter of the node is calculated by the following formula:
in the above formula, ErelativekIs the relative energy parameter of the kth node in the child chain, ErestkIs the remaining energy of the kth node in the child chain, EfullIs the battery capacity.
Further, the monitoring range of the wireless sensor network is within 2000 meters along the network.
Further, nodes are arranged on the network along the line every r meters, and r is 50-100.
Adopt the beneficial effect that above-mentioned technical scheme brought:
the invention integrates and optimizes various monitoring information around the gateway node and uploads the monitoring information to the data center in a unified way, thereby being beneficial to the data center staff to master and analyze the whole condition of the link edge line, simultaneously ensuring the safety of communication information and the reliability of the network, prolonging the service life of the network and reducing the time delay of the whole data transmission process. The invention has the characteristics of low energy consumption and low time delay, and can use relatively few nodes to carry out communication of a large amount of data, so that the transmission success rate of the whole network reaches the highest.
Drawings
FIG. 1 is a schematic illustration of a subchain formation stage of the present invention;
FIG. 2 is a schematic diagram of a data summarization phase within a child chain according to the present invention;
FIG. 3 is a schematic diagram of the communication phase between sub-chains of the present invention;
fig. 4 is a flow chart of the present invention.
Detailed Description
The technical scheme of the invention is explained in detail in the following with the accompanying drawings.
Figure 1 illustrates the subchain partitioning stage.
Suppose that the transmission range is r0N nodes in the interval [0, l]Are randomly and uniformly distributed. Then the probability that the network consists of C child chains at most is:
wherein the content of the first and second substances,
from the connectivity formula (1), the connectivity P and the transmission range r can be set0The minimum value of the number C of the sub-chains meeting the requirement is taken between the two reference quantities, because the larger C is, the larger P is, but if C is too large, the number of the nodes in each group is reduced, and the significance of grouping is lost until the number of the nodes becomes 1, namely hop-by-hop transmission.
After C is obtained, the nodes which are adjacent in geography are put into the sub-chains, and each sub-chain has the nodes
The node, the process of this step is:
assuming that the BS knows the geographical location information of each node, the farthest one will be
Putting one node into the first sub-chain, and leaving the farthest node
Putting a node into a second sub-chain, and so on until all nodes are allocated to a certain sub-chain, and it should be noted that there are C sub-chains with full nodes and several (less than) sub-chains
) The node closest to the BS is not assigned a child chain, and the remaining nodes are all assigned within the C-th child chain, i.e., the last child chain.
FIG. 2 illustrates the intra-chain data summarization phase. After the communication nodes of the current round of communication are selected, the other nodes can directly send the current residual energy information and the sensed information to the selected nodes without passing through other member nodes. The purpose of this is to reduce the time delay, and although the energy consumption will inevitably increase, the size of each sub-chain is reduced by controlling the number of nodes in each sub-chain, which means that the maximum transmission range of the nodes is reduced, and the difference between the energy consumption and the hop-by-hop relay convergence is reduced.
Fig. 3 illustrates the inter-chain communication phase. Inter-sub-chain communication after the sub-chain data aggregation stage is completed, the communication node of each sub-chain sends the aggregated data to the communication node of the next sub-chain, because assuming that the chain ID of the sub-chain farthest from the BS is 1, the selected node of each sub-chain sends the data to the selected node whose chain ID is the sub-chain ID + 1. The communication node of the next sub-chain will send the data packet of the previous sub-chain and its own data packet to its destination node, i.e. the communication node of the third sub-chain, and so on.
As shown in fig. 4, the specific process of the present invention is as follows.
Step 1: dividing the whole linear topology network into C sub-chains, wherein the number C of the sub-chains can be confirmed by the following formula:
in the above formula, PCThe probability that the network is composed of C sub-chains at most, n is the total number of nodes, l is the length of a network link, r0Sending the distance for the node, i is the child chain number,
step 2: to be furthest from the base station
Putting one node into the 1 st sub-chain, and putting the node farthest from the base station in the rest nodes
One node is placed in the 2 nd child chain, and so on, until all nodes are assigned to a small group of child chains.
When all the C sub-chains are allocated with full nodes, and a plurality of nodes closest to the base station are not allocated with the sub-chains, all the rest nodes are allocated in the C sub-chain.
And step 3: and sequentially selecting the next round of communication nodes from the C sub-chains for communication.
And 4, step 4: in the ith sub-chain, all nodes add their own relative energy parameter information into the sensing message packet, and then send the packet to the current round of communication nodes of the sub-chain, i ═ 1,2, …, C.
And 5: the communication node receives the data packets sent by other nodes in the sub-chain and generates signal strength data of each node. The signal strength data can be obtained by:
in the above formula, RSSIkThe RSRP is the received power of the reference signal, which is the signal strength data of the kth node in the sub-chain.
Step 6: and calculating the signal quality parameters of the nodes according to the signal strength data of each node.
And 7: putting all nodes with signal quality parameters greater than or equal to a preset threshold value in the ith sub-chain into a SetiAnd (4) the following steps.
And 8: search SetiAnd adding the node information to the data packet and the ACK message and sending the data packet to the communication node of the (i + 1) th sub-chain. The relative energy parameter can be obtained by:
in the above formula, ErelativekIs the relative energy parameter of the kth node in the child chain, ErestkIs the remaining energy of the kth node in the child chain, EfullIs the battery capacity.
And step 9: an ACK message is replied to after receiving a data packet from a communication node of the i-1 child chain.
Step 10: an ACK message is broadcast within the ith child chain.
The embodiments are only for illustrating the technical idea of the present invention, and the technical idea of the present invention is not limited thereto, and any modifications made on the basis of the technical scheme according to the technical idea of the present invention fall within the scope of the present invention.
Claims (5)
1. A data routing method in a long-distance linear wireless sensor network is characterized by comprising the following steps:
(1) dividing the whole linear topology network into C sub-chains; the number of daughter strands, C, was confirmed by the following formula:
in the above formula, PCIs the network connectivity, n is the total number of nodes, l is the network link length, r0Sending the distance for the node, i is the child chain number,
(2) to be furthest from the base station
Putting one node into the 1 st sub-chain, and putting the node farthest from the base station in the rest nodes
Putting a node into the 2 nd sub-chain, and so on until all nodes are assigned to a small group of sub-chains, wherein
Represents rounding down;
(3) sequentially selecting next round of communication nodes from the C sub-chains for communication;
(4) in the ith sub-chain, all nodes add own relative energy parameter information into a sensing message data packet, and then send the data packet to the communication node of the current round of the sub-chain, wherein i is 1,2, …, C;
(5) the communication node receives data packets sent by other nodes in the sub-chain and generates signal strength data of each node;
(6) calculating a signal quality parameter theta of a node according to the signal strength data of each nodek：
In the above formula, RSSIkThe signal strength data of the kth node in the sub-chain is obtained, and the RSRP is reference signal received power;
(7) putting all nodes with signal quality parameters greater than or equal to a preset threshold value in the ith sub-chain into a SetiInternal;
(8) search SetiAdding the node information to a data packet and an ACK message and sending the data packet to the communication node of the (i + 1) th sub-chain by the node with the minimum internal relative energy parameter; the relative energy parameter of a node is calculated by:
in the above formula, ErelativekIs the relative energy parameter of the kth node in the child chain, ErestkIs the remaining energy of the kth node in the child chain, EfullIs the battery capacity;
(9) replying an ACK message after receiving a data packet from the communication node of the i-1 subchain;
(10) an ACK message is broadcast within the ith child chain.
2. The method according to claim 1, wherein in step (2), when all the C sub-chains are allocated with full nodes and the remaining nodes closest to the base station are not allocated with sub-chains, all the remaining nodes are allocated in the C sub-chain.
3. The data routing method in the long-distance linear wireless sensor network according to claim 1, wherein in the step (4), the current round of communication refers to that the communication nodes meeting the condition in the C sub-chains all participate in a process of communicating with the adjacent sub-chain node once.
4. The method of claim 1, wherein the wireless sensor network has a monitoring range of 2000 meters along the network.
5. The method for routing data in the long-distance linear wireless sensor network according to claim 1, wherein nodes are arranged every r meters along the network, and r is 50-100.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810419175.4A CN108650697B (en) | 2018-05-04 | 2018-05-04 | Data routing method in long-distance linear wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810419175.4A CN108650697B (en) | 2018-05-04 | 2018-05-04 | Data routing method in long-distance linear wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108650697A CN108650697A (en) | 2018-10-12 |
| CN108650697B true CN108650697B (en) | 2020-09-01 |
Family
ID=63749324
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810419175.4A Active CN108650697B (en) | 2018-05-04 | 2018-05-04 | Data routing method in long-distance linear wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108650697B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103188758A (en) * | 2013-03-25 | 2013-07-03 | 电子科技大学 | Energy saving method for wireless sensor network |
| CN106454905A (en) * | 2016-11-25 | 2017-02-22 | 重庆邮电大学 | Improved hierarchical type multi-link algorithm of wireless sensor network |
| CN107222900A (en) * | 2017-04-18 | 2017-09-29 | 西安电子科技大学 | A kind of wireless sensor network node collaboration method based on dynamic chain |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102474724A (en) * | 2009-07-15 | 2012-05-23 | 皇家飞利浦电子股份有限公司 | Method for securely broadcasting sensitive data in a wireless network |
-
2018
- 2018-05-04 CN CN201810419175.4A patent/CN108650697B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103188758A (en) * | 2013-03-25 | 2013-07-03 | 电子科技大学 | Energy saving method for wireless sensor network |
| CN106454905A (en) * | 2016-11-25 | 2017-02-22 | 重庆邮电大学 | Improved hierarchical type multi-link algorithm of wireless sensor network |
| CN107222900A (en) * | 2017-04-18 | 2017-09-29 | 西安电子科技大学 | A kind of wireless sensor network node collaboration method based on dynamic chain |
Non-Patent Citations (5)
| Title |
|---|
| Geography-Informed Sleep Scheduled and Chaining Based Energy Efficient Data Routing in WSN;Poonam Lohan，etc;《2012 IEEE Students’ Conference on Electrical, Electronics and Computer Science》;20121231;全文 * |
| 城轨无线传感网中链状分簇路由协议的研究;华吉宏等;《电子设计工程》;20160331;全文 * |
| 基于路由半径自适应的长链状无线传感网络协议;林炜岚等;《计算机科学》;20170331;全文 * |
| 基于长链状传感网的智慧路灯控制***;资双飞等;《照明工程学报》;20151031;全文 * |
| 链状线型WSN中基于梯度的分簇成链算法;范晓辉等;《计算机应用与软件》;20140630;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108650697A (en) | 2018-10-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kour et al. | Hybrid energy efficient distributed protocol for heterogeneous wireless sensor network | |
| Li et al. | Enhancing real-time delivery in wireless sensor networks with two-hop information | |
| US10499264B1 (en) | Role selection method in wireless communication networks | |
| Ducrocq et al. | Energy-based clustering for wireless sensor network lifetime optimization | |
| Kang et al. | Adaptive resource control scheme to alleviate congestion in sensor networks | |
| El Alami et al. | (SET) smart energy management and throughput maximization: a new routing protocol for WSNs | |
| Zhao et al. | Load migrating for the hot spots in wireless sensor networks using CTP | |
| Zhao et al. | Cluster-parent based rpl for low-power and lossy networks in building environment | |
| Feng et al. | Cost effective routing in large-scale multi-hop LoRa networks | |
| Tomar et al. | Dynamic multi-level hierarchal clustering approach for wireless sensor networks | |
| El Khediri et al. | An optimal clustering algorithm-based distance aware routing protocol for wireless sensor networks | |
| CN108650697B (en) | Data routing method in long-distance linear wireless sensor network | |
| Bonivento et al. | Seran: A semi random protocol solution for clustered wireless sensor networks | |
| Nisha et al. | An energy efficient self organizing multicast routing protocol for internet of things | |
| CN101471864A (en) | Data forwarding method based on receiver route in wireless self-organizing network | |
| Chaudhary et al. | Energy efficiency and latency improving protocol for wireless sensor networks | |
| Kouvatsos et al. | Broadcasting methods in mobile ad hoc networks: an overview | |
| Chelbi et al. | An Unequal Cluster-based Routing Protocol Based on Data Controlling for Wireless Sensor Network. | |
| CN112533262B (en) | Multi-path on-demand routing method of rechargeable wireless sensor network | |
| Zhang et al. | Optimal candidate set for opportunistic routing in asynchronous wireless sensor networks | |
| Sadat et al. | A trade-off between reliability and energy efficiency for inter-cluster communication in wireless sensor networks | |
| Alharbi et al. | Effect of unequal clustering algorithms in WirelessHART networks | |
| KR102052685B1 (en) | Wireless sensor network clustering method and system thereof | |
| Ma et al. | Opportunistic transmission based QoS topology control in wireless sensor networks | |
| Sabarish et al. | Clustering based energy efficient congestion aware protocol 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 |