CN109787898A - A method of the wireless sensor network downstream message energy conservation flooding based on sleep scheduling - Google Patents
A method of the wireless sensor network downstream message energy conservation flooding based on sleep scheduling Download PDFInfo
- Publication number
- CN109787898A CN109787898A CN201910170172.6A CN201910170172A CN109787898A CN 109787898 A CN109787898 A CN 109787898A CN 201910170172 A CN201910170172 A CN 201910170172A CN 109787898 A CN109787898 A CN 109787898A
- Authority
- CN
- China
- Prior art keywords
- node
- mpr
- sensor network
- network
- energy
- 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
Classifications
-
- 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
- Mobile Radio Communication Systems (AREA)
Abstract
A kind of method that the present invention discloses wireless sensor network downstream message energy conservation flooding based on sleep scheduling includes the following steps: step 1: initial phase: node obtains information of neighbor nodes by mutually transmitting message between neighbours, obtains system configuration parameter；Step 2: being organized into known parameters information bank for acquired information of neighbor nodes and system configuration parameter, realizes the shared of nodes；Step 3: sensor network is layered using the hop count where node as standard, calculates the coverage of each node；Step 4: with coverage, most widely principle selects MPR node, then with dump energy is preferably principle selection MPR node, it is ensured that next node layer is all capped, generates every layer of MPR node set；Step 5: the realization of layering sleep awakening mechanism.The method of the invention can effectively reduce the quantity that packet is transmitted in network, avoid the congestion of network, reduce delay and additional energy expense, effectively extend the life cycle of sensor network.
Description
Technical field
The invention belongs to Information and Communication Engineering technical fields, and in particular to a kind of wireless sensor based on sleep scheduling
The method of network downstream message energy conservation flooding.
Background technique
In traditional link-state protocol (Link State), the process of flooding is to forward it to receive by each node
Message realize.This mode causes excessive message to broadcast in a network, and existing leads to network congestion, consumption excessive power
Defect.The OLSR agreement (Optimized Link State Routing Protocol) improved in this agreement is then
The flooding of message is realized in such a way that multiple spot relays (MPRs).OLSR is based on hop count and selects relay node MPR, and control message can only
It is forwarded by relay node, to effectively reduce the quantity to broadcast the message in network, reduces the load of nodes.
But under this application scenarios of wireless sensor network, in addition to the quantity to broadcast the message in network to be reduced, also
To consider the problem of wireless sensor devices energy deficiency.Wireless sensor network is disposed under complex environment, mainly according to
It powers by battery, biggish economic expense and unrealistic can be brought by frequently replacing battery.Therefore, meeting sensor node just
Often under the premise of work, the energy consumption of wireless sensor network how is reduced, extending its life cycle has been increasingly becoming current heat
The research topic of door.
Summary of the invention
In order to overcome the deficiencies in the prior art, the present invention proposes a kind of wireless sensor network based on sleep scheduling
The method of network downstream message energy conservation flooding effectively realizes that balancing energy utilizes, and extends the life cycle of network.
To reach above-mentioned technical purpose, the technical solution adopted by the present invention are as follows:
A method of energy conservation flooding that realizing message in wireless sensor network includes the following steps:
Step 1: the basic configuration information of network initial phase: is obtained in this stage node.Firstly, node passes through neighbour
Message mutually to be transmitted between residence obtains information of neighbor nodes, these information include: neighbor node position, power is sent, neighbours'
Neighbor information etc.；Then mutual distance, the information such as received signal to noise ratio are calculated according to these information.It needs to obtain simultaneously all
Such as the density of listener-in, defined threshold bit error rate value, the modulation /demodulation parameter determined by used modulation-demo-demodulation method
Equal related known systems configuration parameter.
Step 2: being organized into known parameters information bank for acquired parameter information, and realizes the shared of nodes.
Step 3: sensor network is layered using the hop count where node as standard, and calculates covering for each node
Cover degree.
Step 4: with coverage, most widely principle selection MPR node is with the next node layer of covering as much as possible first, so
It is preferably afterwards principle selection MPR node with dump energy, it is ensured that next node layer is all capped.Thus every layer of MPR is generated
Node set S1(i),S2(i),S3(i),...,Sn(i)
Step 5: the realization of layering sleep awakening mechanism.The entire broadcasting process duration is T, includes n time slot, kth
The node of (k=1,2,3 ..n) layer existsMoment automatically wakes up, if detecting, no data packet needs to transmit, and is again introduced into suspend mode
Mode, if having detected, data packet will be transmitted, and suspend mode is entered after the transmission of data packet to be done.
Above step one, two, three is only carried out when sensor network initializes for the first time, hereafter each duty cycle, only
It executes Step 4: five, reconfiguring for MPR node in sensor network is carried out according to dump energy situation to realize.Such as Fig. 2
In, when detecting c point lower than energy threshold, a for selecting dump energy more, b node replaces C point into line number as MPR node
According to the forwarding of packet.
The step 4 includes the following steps:
1) MPR for defining central node i integrates as S1(i), and S is initialized1It (i) is sky
2) for M1(i) all nodes in obtain them in M respectively2(i) the covered node number of institute in
3) for M1(i) any node in, if a hop neighbor node of the node existence anduniquess, this node is added
Enter S1(i) in set
If 4) M2(i) there is also not by S in1(i) node that any node is covered in, then for M1(i) do not added in
Into S1(i) node, finds M2(i) with the node A of maximal cover number in, if nearby there are also cover the identical section of number with it for it
The maximum node of dump energy is then added to S by point1(i) in set, A is otherwise added to S1(i) in set.
5) step 4 is jumped to until M2(i) there is no by S in1(i) node that any node is covered in.Similarly, exist
M2(i) MPR node is selected to cover it in M after the same method in3(i) S is added in all nodes in2(i)。
6) S is sequentially found according to the method described above3(i), S4(i) ..., Sn(i) until the whole network node is capped.
If the MPR node met the requirements can not be found out to realize that the whole network covers, which exhausts.
Compared with the existing technology, the invention has the following advantages:
The present invention provides the method in the energy conservation flooding of wireless sensor network downstream message, has the beneficial effect that:
1), the present invention improves traditional OLSR Routing Protocol, and what based on sensor network, this was special applies ring
Border proposes the MPR node selection mode of energy priority, effectively reduces the number of transmission packet during sensor network downlink broadcast
Amount avoids delay and additional energy consumption caused by network congestion, can effectively realize that balancing energy utilizes, effectively extend
The life cycle of network
2), present invention incorporates the realization mechanisms of layering sleep awakening, it is possible to reduce need not as caused by idle listening
The energy consumption wanted extends the life cycle of network
3), MPR selection proposed by the present invention and layering sleep awakening mechanism are simple and easy, it is easy to accomplish
Detailed description of the invention:
Fig. 1 is the flow chart of the method for the invention；
Fig. 2 is sensor network layering and message flooding schematic diagram
Fig. 3 is MPR selection course schematic diagram
Fig. 4 is layering sleep awakening schematic diagram of mechanism
Specific embodiment
With reference to the accompanying drawing and case study on implementation, the invention will be further described, it should be noted that embodiments of the present invention are not
It is limited to this.
As shown in Figure 1 and Figure 2, the wireless sensor network downstream message energy conservation flooding of the present invention based on sleep scheduling
Method and step it is as follows:
Step 1: the basic configuration information of network initial phase: is obtained in this stage node.Firstly, node passes through neighbour
Message mutually to be transmitted between residence obtains information of neighbor nodes, these information include: neighbor node position, power is sent, neighbours'
Neighbor information etc.；Then mutual distance, the information such as received signal to noise ratio are calculated according to these information.It needs to obtain simultaneously all
Such as the density of listener-in, defined threshold bit error rate value, the modulation /demodulation parameter determined by used modulation-demo-demodulation method
Equal related known systems configuration parameter.
Step 2: being organized into known parameters information bank for acquired parameter information, and realizes the shared of nodes.
Step 3: using MPR node relative to the hop count where central node as standard, sensor network is layered,
And calculate the coverage of each node.Wherein, layering result is as shown in Figure 1.
Step 4: as shown in figure 3, being preferably principle with node of the coverage extensively and more than dump energy, MPR node is carried out
Selection generates every layer of MPR node set S1(i),S2(i),S3(i),...,Sn(i)。
1) MPR for defining central node i integrates as S1(i), and S is initialized1It (i) is sky.
2) for M1(i) all nodes in obtain them in M respectively2(i) the covered node number of institute in.
3) for M1(i) any node in, if a hop neighbor node of the node existence anduniquess, this node is added
Enter S1(i) in set.
If 4) M2(i) there is also not by S in1(i) node that any node is covered in, then for M1(i) do not added in
Into S1(i) node, finds M2(i) with the node A of maximal cover number in, if nearby there are also cover the identical section of number with it for it
The maximum node of dump energy is then added to S by point1(i) in set, A is otherwise added to S1(i) in set.
5) step 4 is jumped to until M2(i) there is no by S in1(i) node that any node is covered in.Similarly, exist
M2(i) MPR node is selected to cover it in M after the same method in3(i) S is added in all nodes in2(i)。
6) S is sequentially found according to the method described above3(i), S4(i) ..., Sn(i) until the whole network node is capped, if can not
It selects the MPR node met the requirements and realizes that the whole network covers, then the network energy exhausts.
Step 5: the realization of layering sleep awakening mechanism.As shown in figure 4, the entire broadcasting process duration is T, it include n
The node of a time slot, kth (k=1,2,3 ..n) layer existsMoment automatically wakes up, if detecting, no data packet needs to transmit, then
Secondary to enter suspend mode, if having detected, data packet will be transmitted, and suspend mode is entered after the transmission of data packet to be done.
Above step one, two, three is only carried out when sensor network initializes for the first time, hereafter each duty cycle, only
It executes Step 4: five, reconfiguring for MPR node in sensor network is carried out according to dump energy situation to realize.Such as Fig. 3
In, when detecting c point lower than energy threshold, a for selecting dump energy more, b node replaces C point into line number as MPR node
According to the forwarding of packet.
The embodiments described above only express several embodiments of the present invention, and the description thereof is more specific and detailed, but simultaneously
Limitations on the scope of the patent of the present invention therefore cannot be interpreted as.It should be pointed out that for those of ordinary skill in the art
For, without departing from the inventive concept of the premise, various modifications and improvements can be made, these belong to guarantor of the invention
Protect range.Therefore, the scope of protection of the patent of the present invention should subject to the claims.
Claims (6)
1. a kind of method of the wireless sensor network downstream message energy conservation flooding based on sleep scheduling, which is characterized in that including
Following steps:
Step 1: initial phase: node obtains information of neighbor nodes by mutually transmitting message between neighbours, while obtaining and being
System configuration parameter；
Step 2: acquired information of neighbor nodes and system configuration parameter are organized into known parameters information bank, realize network
Interior joint is shared；
Step 3: sensor network is layered using the hop count where node as standard, calculates the coverage of each node；
Step 4: with coverage most widely principle select MPR node, then with dump energy be preferably principle selection MPR node, really
It is all capped to protect next node layer, thus generates every layer of MPR node set；If being realized without satisfactory MPR node
The whole network covering, then the network energy exhausts；
Step 5: layering sleep awakening mechanism: the entire broadcasting process duration is T, includes n time slot, kth (k=1,2,
3 ..n) node of layer is at the momentIt automatically wakes up, if detecting, no data packet needs to transmit, and enters suspend mode；If inspection
Having measured data packet will transmit, and suspend mode is entered after the transmission of data packet to be done.
2. according to the method described in claim 1, it is characterized by: the information of neighbor nodes includes: neighbor node position, hair
Send the distance between power, the neighbor information of neighbours, node and received signal to noise ratio；The system configuration parameter includes listener-in's
Density, defined threshold bit error rate value and modulation /demodulation parameter.
3. method according to claim 1, it is characterised in that:
Step 1: two, three only carry out when sensor network initializes for the first time, hereafter each duty cycle, step is only executed
Four, five, when detecting c point lower than energy threshold, a for selecting dump energy more, b node as MPR node instead of C point into
The forwarding of row data packet.
4. method according to claim 1, it is characterised in that: the step 4 includes the following steps:
1) MPR for defining central node i integrates as S1(i), and S is initialized1It (i) is sky；
2) for M1(i) all nodes in obtain them in M respectively2(i) the covered node number of institute in；
3) for M1(i) if a hop neighbor node of the node existence anduniquess S is added in this node by any node in1
(i) in set；
If 4) M2(i) there is also not by S in1(i) node that any node is covered in, then for M1(i) S is not added in1
(i) node, by it in M2(i) node in maximal cover number is added to S1(i) in set；
5) step 4 is jumped to until M2(i) there is no by S in1(i) node that any node is covered in.Similarly, in M2(i)
In select MPR node to cover it in M after the same method3(i) S is added in all nodes in2(i)；
6) S is sequentially found according to the method described above3(i), S4(i) ..., Sn(i) until the whole network node is capped.
5. according to the method described in claim 4, it is characterized by: selection MPR node when, if two adjacent node coverage phases
Together, preferentially select the biggish node of energy as MPR.
6. according to the method described in claim 1, it is characterized by: entire broadcasting process duration T is one normal in step 5
Number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910170172.6A CN109787898A (en) | 2019-03-07 | 2019-03-07 | A method of the wireless sensor network downstream message energy conservation flooding based on sleep scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910170172.6A CN109787898A (en) | 2019-03-07 | 2019-03-07 | A method of the wireless sensor network downstream message energy conservation flooding based on sleep scheduling |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109787898A true CN109787898A (en) | 2019-05-21 |
Family
ID=66486197
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910170172.6A Pending CN109787898A (en) | 2019-03-07 | 2019-03-07 | A method of the wireless sensor network downstream message energy conservation flooding based on sleep scheduling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109787898A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2428961A1 (en) * | 2010-09-13 | 2012-03-14 | Imec | Method for improving writability of SRAM memory |
| CN102497620A (en) * | 2011-12-01 | 2012-06-13 | 华为技术有限公司 | Method and system of information transmission in wireless sensor network |
| CN101282335B (en) * | 2008-05-20 | 2012-09-05 | 浙江大学宁波理工学院 | Method for snooping and sleeping low-load wireless sensor network MAC layer |
| CN107567067A (en) * | 2017-07-20 | 2018-01-09 | 华南理工大学 | A kind of improved method of MPR algorithms |
| CN108011660A (en) * | 2017-11-21 | 2018-05-08 | 湖南瓴星空间信息技术有限公司 | A kind of real-time Internet of Things constellation systems in the whole world |
| CN109039905A (en) * | 2018-08-07 | 2018-12-18 | 国网四川省电力公司技能培训中心 | PLC and wireless isomer group network system and method based on link-aware |
-
2019
- 2019-03-07 CN CN201910170172.6A patent/CN109787898A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282335B (en) * | 2008-05-20 | 2012-09-05 | 浙江大学宁波理工学院 | Method for snooping and sleeping low-load wireless sensor network MAC layer |
| EP2428961A1 (en) * | 2010-09-13 | 2012-03-14 | Imec | Method for improving writability of SRAM memory |
| CN102497620A (en) * | 2011-12-01 | 2012-06-13 | 华为技术有限公司 | Method and system of information transmission in wireless sensor network |
| CN107567067A (en) * | 2017-07-20 | 2018-01-09 | 华南理工大学 | A kind of improved method of MPR algorithms |
| CN108011660A (en) * | 2017-11-21 | 2018-05-08 | 湖南瓴星空间信息技术有限公司 | A kind of real-time Internet of Things constellation systems in the whole world |
| CN109039905A (en) * | 2018-08-07 | 2018-12-18 | 国网四川省电力公司技能培训中心 | PLC and wireless isomer group network system and method based on link-aware |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yadav et al. | Energy aware cluster based routing protocol over distributed cognitive radio sensor network | |
| Chen | An energy-efficient QoS routing for wireless sensor networks using self-stabilizing algorithm | |
| CN103298054A (en) | Wireless sensor network cluster routing protocol based on node depth | |
| Shaikh et al. | New metrics for dominating set based energy efficient activity scheduling in ad hoc networks | |
| Jemili et al. | Cross-layer adaptive multipath routing for multimedia wireless sensor networks under duty cycle mode | |
| Ammar et al. | Multi-hop LEACH based cross-layer design for large scale wireless sensor networks | |
| Villaverde et al. | Experimental evaluation of beacon scheduling mechanisms for multihop IEEE 802.15. 4 wireless sensor networks | |
| Naveen et al. | Tunable locally-optimal geographical forwarding in wireless sensor networks with sleep-wake cycling nodes | |
| Cakici et al. | A novel cross-layer routing protocol for increasing packet transfer reliability in mobile sensor networks | |
| Tong et al. | A pipelined-forwarding, routing-integrated and effectively-identifying MAC for large-scale WSN | |
| Awerbuch et al. | The pulse protocol: Energy efficient infrastructure access | |
| Rehan et al. | Anatomizing the robustness of multichannel MAC protocols for WSNs: An evaluation under MAC oriented design issues impacting QoS | |
| CN107222903A (en) | Method of data capture based on constructive interference in asynchronous low duty ratio WSN | |
| Zhao et al. | A transmission power control MAC protocol for wireless sensor networks | |
| Mu et al. | Performance analysis of the ZigBee networks in 5G environment and the nearest access routing for improvement | |
| Manikandan et al. | A score based link delay aware routing protocol to improve energy optimization in wireless sensor network | |
| Liu et al. | An improved energy efficient unequal clustering algorithm of wireless sensor network | |
| CN103634913A (en) | Clustering-based multi-hop multi-channel cognitive wireless sensor network communication method | |
| Guleria et al. | Asynchronous media access control protocols and cross layer optimizations for wireless sensor networks: An energy efficient perspective | |
| Guo et al. | A cluster-based algorithm for energy-efficient routing in wireless sensor networks | |
| Xu et al. | Maximizing throughput for low duty-cycled sensor networks | |
| Gunasekaran et al. | Xlrp: Cross layer routing protocol for wireless sensor networks | |
| KR101135517B1 (en) | Method for increasing energy efficiency in wireless sensor network | |
| CN109688557A (en) | A kind of cooperative node selection method, device | |
| CN109787898A (en) | A method of the wireless sensor network downstream message energy conservation flooding based on sleep scheduling |
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: 20190521 |