CN102761931B - Method for carrying out dynamic data transmission in asynchronous duty ratio wireless sensor network - Google Patents
Method for carrying out dynamic data transmission in asynchronous duty ratio wireless sensor network Download PDFInfo
- Publication number
- CN102761931B CN102761931B CN201210220645.7A CN201210220645A CN102761931B CN 102761931 B CN102761931 B CN 102761931B CN 201210220645 A CN201210220645 A CN 201210220645A CN 102761931 B CN102761931 B CN 102761931B
- Authority
- CN
- China
- Prior art keywords
- node
- neighbor
- base station
- sensor node
- sensor
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 27
- 230000005540 biological transmission Effects 0.000 title claims abstract description 15
- 230000009191 jumping Effects 0.000 claims description 18
- 238000012790 confirmation Methods 0.000 claims description 3
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000012544 monitoring process Methods 0.000 abstract 1
- 230000002035 prolonged effect Effects 0.000 abstract 1
- 230000001360 synchronised effect Effects 0.000 description 7
- 230000008569 process Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 108700026140 MAC combination Proteins 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 206010003549 asthenia Diseases 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000000205 computational method Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000002618 waking effect Effects 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention provides a method for carrying out dynamic data transmission in an asynchronous duty ratio wireless sensor network. The method comprises the following steps of: (1) deploying sensor nodes in a monitoring area in a random manner and deploying base stations at a network center position; (2) initializing a hop count distance to the base stations and link quality by the sensor nodes; noticing information to a neighbor node; and recording the obtained information in an own neighbor list of the neighbor node by the neighbor node; and (3) selecting a group of candidate relays for transmitting a data package from the neighbor node by the sensor node, and updating relevant information of the neighbor list by using a data package bringing manner. With the adoption of the method provided by the invention, the package receiving rate of the data package can be ensured; the end-to-end time delay of the data package is reduced; and the service life of the network is prolonged.
Description
Technical field
The present invention relates to field of data transmission in wireless sensor network, and relate to a kind of dynamic data transmission method in asynchronous duty ratio wireless sensor network especially.
Background technology
Wireless sensor network is with a wide range of applications.But sensor node is normally powered by non-rechargeabel battery, in order to prolong network lifetime just needs to save unnecessary energy loss as much as possible when sensor node runs.Allowing sensor node close wireless communication module when not having data to send is the most effective method saving energy, therefore, allows sensor node periodically sleep/the work MAC protocol of (being called duty ratio) just be suggested.Duty-cycle is divided into two large classes usually: a class needs clock synchronous between sensor node, is called synchronous duty-cycle; Another kind of is do not need clock synchronous between sensor node and node decides sleep scheduling in its sole discretion, is called asynchronous duty-cycle.In synchronous duty ratio, node needs clock synchronous and exchanges synchronization packets, thus there is very large synchronous energy expense.In asynchronous duty ratio, node can save synchronous energy expense, but due to the time of carrying out between sensor node communicating uncertain, often make the end-to-end time delay of packet very large.
Routing Protocol in some wireless sensor networks in the past proposed often only for a certain optimizing network performance, such as: time delay, distance etc.But only carry out routing decision for a certain network performance optimum and often cause other internetworking loss of energies.Such as, just likely cause forwarding data between link-quality very poor node when the method for service range optimum carries out routing decision, this can cause a large amount of data re-transmission and lose the large energy of node and then cause network to occur too early splitting disconnected situation.In this various resource-constrained network of wireless sensor network, consider various network performance and more can ensure that wireless sensor network application obtains more balanced network function.In most applications, comprehensive network performance is vital for the function of guarantee network.The network performance that usual needs are considered comprises the end-to-end time delay, node energy etc. of internodal link-quality, packet.Our dynamic data transmission method has considered link-quality, time delay and balance energy ezpenditure, and therefore it is a feasible method.
Summary of the invention
Goal of the invention is the method for the dynamic data transmission provided in a kind of asynchronous duty ratio wireless sensor network, overcome the problem of carrying out routing decision based on single network performance in the past, thus reach the object ensureing packet packet receiving rate, reduce packet end-to-end time delay and prolong network lifetime.
For reaching above-mentioned purpose, the invention provides the method for the dynamic data transmission in a kind of asynchronous duty ratio wireless sensor network, specifically comprising the steps:
(1) sensor node is deployed in guarded region in a random way, and by base station deployment heart position in a network;
(2) sensor node is initialised to the jumping figure Distance geometry one hop link quality of base station, and tells neighbor node by these information, and these information obtained are recorded in the neighbor table of neighbor node self by neighbor node;
(3) sensor node chooses one group of candidate relay node for forwarding data bag from neighbor node, and usage data bag method incidentally upgrades the relevant information of neighbor table.
Further, in described step (2), sensor node calculates the jumping figure distance of base station by the mode of base station broadcast jumping figure initialization bag, the discovery procedure of neighbor node is as follows: each sensor node finds and is allly not more than the neighbor node of the sensor node to base station jumping figure distance with the distance of base station, and will be recorded in the neighbor table of sensor node to the link-quality of jumping figure Distance geometry between them of base station through them, each sensor node broadcasts neighbor uni-cast bag, replying a reply comprising these two information of signal strength signal intensity of the neighbor uni-cast bag that neighbor node receives to the Distance geometry of base station after neighbor node receives neighbor uni-cast bag wraps to this sensor node, sensor node utilizes these two information above-mentioned and replys the single-hop bi-directional link quality that the signal strength signal intensity of wrapping can calculate neighbor node, when after sensor node initialization oneself neighbor table complete, the path link quality of sensor node to base station can be set up from base station reverse hop-by-hop, and the down hop relevant information in these paths is recorded in neighbor table the transmission being used for follow-up data.Wherein, described neighbor table arranges according to path link quality inverted order from excellent to bad.
Further, in described step (3), the step that sensor node chooses candidate relay node from neighbor node is as follows: sensor node calculates path link quality threshold required by base station according to oneself to the Distance geometry one hop link quality requirement of base station; By comparing with above-mentioned threshold value through the path link quality of neighbor node to base station in neighbor table, the node being better than threshold value is candidate relay node.
Further, the sequencing that sensor node is waken up according to candidate relay node in described step (3) successively by Packet Generation to candidate relay node until certain via node receives packet or reaches retransmit restriction, if a node does not receive packet, then no longer to its retransmission data packet may but wait for next node wake up by Packet Generation give it, if repeatedly retransmit to reach and retransmit restriction, then abandon this bag no longer to retransmit, when sensor node receives the confirmation bag of a packet, according to confirming that in bag, subsidiary path link quality upgrades the list item of its neighbor table.
In sum, the present invention chooses a group node according to the link-quality in path with the threshold value choosing candidate relay node and carrys out forwarding data, thus reaches the object of the packet receiving rate that ensures, reduction packet end-to-end time delay and raising network life.
Accompanying drawing explanation
Fig. 1 is the schematic diagram of node deployment after guarded region initialization neighbor table completes.
Fig. 2 is the flow chart of the dynamic transmission method in the asynchronous duty ratio wireless sensor network of the present invention.
Embodiment
Below in conjunction with accompanying drawing, the present invention is further described.
Its job step of dynamic transmission method in asynchronous duty ratio wireless sensor network is as follows:
(1) sensor node is deployed in guarded region in a random way, and by base station deployment heart position in a network.Also can according to certain demand by inserting knot in guarded region, as long as the position of base station deployment meets base station can receive the packet that all the sensors node multi-hop mode sends.
(2) sensor node is initialised to the jumping figure Distance geometry link-quality of base station, and tell neighbor node by these information, these information obtained are recorded in the neighbor table of oneself by neighbor node, and neighbor table arranges according to path link quality inverted order from excellent to bad.
From base station, initializing sensor node is to the jumping figure distance of base station, sensor node first time calculate when receiving initialization bag oneself to base station jumping figure apart from and broadcast an initialization bag.As shown in Figure 1, after the initialization of sensor node jumping figure distance completes, node N
1jumping figure distance to base station is j.Sensor node knows that oneself is after the jumping figure distance of base station, just can start neighbor discovery process.Node needs to record the relevant information that jumping figure distance is not more than the neighbor node of oneself in this course, comprises through they jumping figure Distance geometry one hop link quality to base station.As shown in Figure 1, node N
1need record neighbor node N
2, N
3, N
4, N
5relevant information in neighbor table.The last optimal path link-quality being initialised to base station from base station, and by the path link quality record after renewal in neighbor table.Finally inverted order arrangement is carried out to the quality of the list item of neighbor table link-quality by path.The algorithm of this implementation can be expressed as follows in detail:
In above-mentioned algorithm, calculate one hop link quality need signal strength signal intensity, wireless module parameter and to the modulator approach of signal and these information of data frame length.Except signal strength signal intensity needs to be obtained by packet switch, can directly obtaining from the information of sensor node itself of other.In addition, for the feature of the unreliability of wireless channel, can allow node repeatedly retransmission data packet may to reach the object of reliable initialization neighbor table.Complete node once neighbor table initialization just to sort to neighbor table according to the order of path link quality from excellent to bad, notice that the less expression of link-quality numerical value is better, the method specifically comparing two paths link-qualities is as follows:
(LQ
i，h
i)＞(LQ
j,h
j) if LQ
i＜LQ
jLQ
i＝LQ
j,h
i＜h
j
(LQ
i，h
i)＝(LQ
j,h
j) if LQ
i＝LQ
jand h
i＝h
j
After these all operations all complete, sensor node just can enter the scheduling pattern of duty ratio.
(3) sensor node chooses one group of candidate relay node for forwarding data, and usage data bag method incidentally upgrades the relevant information of neighbor table.Sensor node can initiatively carry out a neighbor table renewal process whenever necessary, to the up-to-date network information of all neighbor node requests to upgrade neighbor table.
When sensor node will send data to base station, first it calculate the path link quality threshold choosing candidate relay node itself according to single-hop one way link selected threshold α.Concrete computational methods are as follows:
Here h is the jumping figure distance of sensor node to base station, and α is actually the unidirectional packet receiving rate lower bound of single-hop, and being multiplied by 2 is because it is considered that bi-directional link quality.After sensor node calculates path link quality threshold, from neighbor table, just find out the list item that first is greater than threshold value, then all list items before this be all the candidate relay node meeting threshold requirement.Because sensor node needs when reality sends data to retransmit, in order to meet the requirement of number of retransmissions restriction, the both candidate nodes selected must not be less than number of retransmissions and add one, also namely just needs to choose before in neighbor table multinomial to meet number requirement when the both candidate nodes number chosen according to threshold value does not reach and requires.As shown in Figure 1, if when re-transmission restriction is not less than 3, node N
1need to choose all neighbor node N
2, N
3, N
4, N
5via node alternatively.
The sequencing of just waking up according to candidate relay node after selecting candidate relay node sends to them successively until there is a node successfully to receive packet.If a node does not receive packet, then no longer to its retransmission data packet may but wait for next node wake up by Packet Generation give it.
If repeatedly retransmit to reach and retransmit restriction, then abandon this bag and no longer retransmit.When node receives the confirmation bag of a packet, according to confirming that path link quality subsidiary in bag upgrades the list item of respective neighbor table.Concrete algorithm is as follows:
The parameter beta that the link of the 12nd row upgrades in computing formula in above-mentioned algorithm can be chosen according to actual needs.Such as, thinking to upgrade link-quality faster just can by larger for β value; Otherwise then β is got smaller.But the value of β must between 0 to 1.In addition, if when the situation that repeatedly data cannot be sent appears in node, then may network state change to some extent.Now, node can start a neighbor discovery process to obtain up-to-date information of neighbor nodes.
In sum, the present invention chooses a group node according to the link-quality in path with the threshold value choosing candidate relay node and carrys out forwarding data, thus reaches the object of the packet receiving rate that ensures, reduction packet end-to-end time delay and raising network life.
The above is only the preferred embodiment of the present invention; be noted that for those skilled in the art; under the premise without departing from the principles of the invention, can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (1)
1. carry out a method for dynamic data transmission in asynchronous duty ratio wireless sensor network, it is characterized in that, described method comprises the steps:
(1) sensor node is deployed in guarded region in a random way, and by base station deployment heart position in a network;
(2) each sensor node is initialised to the jumping figure Distance geometry link-quality of base station, and tells neighbor node by these information, and neighbor node calculates the optimal path link-quality of base station according to these information and is recorded in the neighbor table of neighbor node self;
(3) sensor node chooses one group of candidate relay node for forwarding data bag from neighbor node, and usage data bag method incidentally upgrades the relevant information of neighbor table;
In described step (2), sensor node calculates the jumping figure distance of base station by the mode of base station broadcast jumping figure initialization bag, and the discovery procedure of neighbor node is as follows: each sensor node finds and is allly not more than the neighbor node of the sensor node to base station jumping figure distance with the distance of base station, and will be recorded in the neighbor table of sensor node to the link-quality of jumping figure Distance geometry between them of base station through them, each sensor node broadcasts neighbor uni-cast bag, replying a reply comprising these two information of signal strength signal intensity of the neighbor uni-cast bag that neighbor node receives to the Distance geometry of base station after neighbor node receives neighbor uni-cast bag wraps to this sensor node, sensor node utilizes these two information above-mentioned and replys the single-hop bi-directional link quality that the signal strength signal intensity of wrapping can calculate neighbor node, when after sensor node initialization oneself neighbor table complete, the path link quality of sensor node to base station can be set up from base station reverse hop-by-hop, and the down hop relevant information in these paths is recorded in neighbor table the transmission being used for follow-up data,
In described step (2), described neighbor table arranges according to path link quality inverted order from excellent to bad.
2. carry out the method for dynamic data transmission in asynchronous duty ratio wireless sensor network according to claim 1, it is characterized in that: in described step (3), the step that sensor node chooses candidate relay node from neighbor node is as follows:
Sensor node calculates path link quality threshold required by base station according to oneself to the Distance geometry one hop link quality requirement of base station; By comparing with above-mentioned threshold value through the path link quality of neighbor node to base station in neighbor table, the node being better than threshold value is candidate relay node.
3. in asynchronous duty ratio wireless sensor network according to claim 2, carry out the method for dynamic data transmission, it is characterized in that: the sequencing that sensor node is waken up according to candidate relay node in described step (3) successively by Packet Generation to candidate relay node until certain via node receives packet or reaches retransmit restriction, if a node does not receive packet, then no longer to its retransmission data packet may but wait for next node wake up by Packet Generation give it, if repeatedly retransmit to reach and retransmit restriction, then abandon this bag no longer to retransmit, when sensor node receives the confirmation bag of a packet, according to confirming that in bag, subsidiary path link quality upgrades the list item of its neighbor table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210220645.7A CN102761931B (en) | 2012-06-29 | 2012-06-29 | Method for carrying out dynamic data transmission in asynchronous duty ratio wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210220645.7A CN102761931B (en) | 2012-06-29 | 2012-06-29 | Method for carrying out dynamic data transmission in asynchronous duty ratio wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102761931A CN102761931A (en) | 2012-10-31 |
| CN102761931B true CN102761931B (en) | 2015-05-06 |
Family
ID=47056219
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210220645.7A Expired - Fee Related CN102761931B (en) | 2012-06-29 | 2012-06-29 | Method for carrying out dynamic data transmission in asynchronous duty ratio wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102761931B (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103052131A (en) * | 2013-01-04 | 2013-04-17 | 无锡儒安科技有限公司 | Energy consumption control method under delay constraint in wireless sensor network |
| CN103209461B (en) * | 2013-02-26 | 2017-04-05 | 无锡清华信息科学与技术国家实验室物联网技术中心 | Cycle neighbor discovering method asymmetric low on duty by turns based on collaboration prime number |
| CN103415079B (en) * | 2013-08-07 | 2017-05-17 | 无锡清华信息科学与技术国家实验室物联网技术中心 | Time slot scheduling method and device used in wireless sensor network |
| CN103619050B (en) * | 2013-12-12 | 2016-05-25 | 上海交通大学 | For the neighbor node discover method based on perfect difference set of mobile wireless network |
| CN105578123A (en) * | 2014-10-16 | 2016-05-11 | 航天恒星科技有限公司 | Beyond-the-horizon video transmission system based on Ad Hoc network and method thereof |
| US9743370B2 (en) * | 2015-04-28 | 2017-08-22 | The Charles Stark Draper Laboratory, Inc. | Wireless network for sensor array |
| CN105979563B (en) * | 2016-04-19 | 2019-06-18 | 上海海事大学 | A kind of neighbor node discovery method combined based on active probe with passive listening |
| CN107105454A (en) * | 2017-04-12 | 2017-08-29 | 浙江工业大学 | A kind of access base station choosing method of wireless sensor network interior joint |
| CN107249026B (en) * | 2017-06-07 | 2018-11-16 | 中民新能物联股份有限公司 | Smart home system based on Internet of Things cloud computing |
| CN110996281B (en) * | 2019-12-03 | 2021-03-16 | 江苏湛德医疗用品有限公司 | UWB base station clock synchronization and calibration indoor positioning method based on TOF |
| CN112383883B (en) * | 2020-11-20 | 2022-04-15 | 南京在信通信技术有限公司 | Marine communication method |
| CN114125984B (en) * | 2021-11-22 | 2023-05-16 | 北京邮电大学 | Efficient opportunistic routing method and device |
| CN114599077A (en) * | 2022-03-09 | 2022-06-07 | 中南大学 | Duty ratio self-adaptive adjusting scheme based on data stream prediction |
| CN117098161B (en) * | 2023-10-18 | 2024-01-05 | 西安蜂语信息科技有限公司 | Data transmission method, device, network equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102223683A (en) * | 2011-06-07 | 2011-10-19 | 中兴通讯股份有限公司 | Data transmission method, node and system in wireless sensor network |
| CN102395161A (en) * | 2011-10-28 | 2012-03-28 | 中国科学院深圳先进技术研究院 | Method and system for wireless network transmission scheduling |
| CN102421162A (en) * | 2011-11-29 | 2012-04-18 | 北京交通大学 | Hybrid router supporting IPv6 (Internet Protocol version 6) wireless sensor network |
-
2012
- 2012-06-29 CN CN201210220645.7A patent/CN102761931B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102223683A (en) * | 2011-06-07 | 2011-10-19 | 中兴通讯股份有限公司 | Data transmission method, node and system in wireless sensor network |
| CN102395161A (en) * | 2011-10-28 | 2012-03-28 | 中国科学院深圳先进技术研究院 | Method and system for wireless network transmission scheduling |
| CN102421162A (en) * | 2011-11-29 | 2012-04-18 | 北京交通大学 | Hybrid router supporting IPv6 (Internet Protocol version 6) wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102761931A (en) | 2012-10-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102761931B (en) | Method for carrying out dynamic data transmission in asynchronous duty ratio wireless sensor network | |
| Rajendran et al. | Energy-efficient, application-aware medium access for sensor networks | |
| JP5430481B2 (en) | Gateway and terminal | |
| JP2023075220A (en) | Multi-hop networking protocol for wide-area energy harvesting sensor network deployment | |
| US20070233835A1 (en) | Methodology for scheduling data transfers from nodes using path information | |
| Watteyne et al. | Implementation of gradient routing in wireless sensor networks | |
| CN101394356B (en) | Route establishing method and device for mobile Ad hoc network | |
| Long et al. | Comparative performance study of RPL in wireless sensor networks | |
| Merlin et al. | Schedule adaptation of low-power-listening protocols for wireless sensor networks | |
| CN103108374B (en) | A kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network | |
| Lee et al. | FlexiMAC: A flexible TDMA-based MAC protocol for fault-tolerant and energy-efficient wireless sensor networks | |
| Zhao et al. | CoCo+: Exploiting correlated core for energy efficient dissemination in wireless sensor networks | |
| Zhao et al. | Exploiting link correlation for core-based dissemination in wireless sensor networks | |
| CN103391595A (en) | Mine emergency rescue wireless mesh network routing method based on cross-layer link state feedback | |
| De Armas et al. | Determinism through path diversity: Why packet replication makes sense | |
| Radi et al. | Network initialization in low-power wireless networks: a comprehensive study | |
| Zhao et al. | Cluster-parent based rpl for low-power and lossy networks in building environment | |
| CN103619045A (en) | Route establishing method and system of low-consumption lossy network | |
| Shen et al. | Fast data collection in linear duty-cycled wireless sensor networks | |
| KR101104585B1 (en) | Method for Cross-Layered Routing and Transmitting Data in Wireless Sensor Network | |
| Yao et al. | Multicast scheduling algorithms for battery-free wireless sensor networks | |
| Papadopoulos et al. | CoopStor: a cooperative reliable and efficient data collection protocol in fault and delay tolerant wireless networks | |
| Sokullu et al. | MAC layer protocols for linear wireless sensor networks: a survey | |
| Yamao et al. | Cross-layer multi-hopping scheme for efficient and reliable transmission in fading environment | |
| Sarasvathi et al. | A Multi Route Rank Based Routing Protocol for Industrial Wireless Mesh Sensor Networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150506 Termination date: 20150629 |
|
| EXPY | Termination of patent right or utility model |