CN104684057A - Link hibernation method for wireless sensor multi-hop network chain-like topological structure - Google Patents

Link hibernation method for wireless sensor multi-hop network chain-like topological structure Download PDF

Info

Publication number
CN104684057A
CN104684057A CN201510122208.5A CN201510122208A CN104684057A CN 104684057 A CN104684057 A CN 104684057A CN 201510122208 A CN201510122208 A CN 201510122208A CN 104684057 A CN104684057 A CN 104684057A
Authority
CN
China
Prior art keywords
node
link
nodes
dormancy
time
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.)
Granted
Application number
CN201510122208.5A
Other languages
Chinese (zh)
Other versions
CN104684057B (en
Inventor
王兆桐
董晋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jiangsu Cas Internet Of Things Technology Venture Capital Co ltd
Original Assignee
Jiangsu IoT Research and Development Center
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Jiangsu IoT Research and Development Center filed Critical Jiangsu IoT Research and Development Center
Priority to CN201510122208.5A priority Critical patent/CN104684057B/en
Publication of CN104684057A publication Critical patent/CN104684057A/en
Application granted granted Critical
Publication of CN104684057B publication Critical patent/CN104684057B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • H04W52/0203—Power saving arrangements in the radio access network or backbone network of wireless communication networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H04W76/10—Connection setup
    • H04W76/19—Connection re-establishment
    • 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

Abstract

The invention provides a link hibernation method for a wireless sensor multi-hop network chain-like topological structure. Supposed that all nodes before the Kth node in a link are in a work state during business data transmitting, and all the nodes after the Kth node are in a periodical hibernation awakening state. The inherent hibernation delay time of the nodes is T2, that is, the nodes enter the periodical hibernation awakening state if no business data is transmitted in the time period T2. When the Kth node finishes the transmission of the business data, the Kth node and all nodes which are K/i before the Kth node enter the periodical hibernation awakening state after delaying a time period T3, and the other nodes enter the periodical hibernation awakening state according to normal conditions, wherein i is bigger than or equal to 1 and smaller than or equal to k. When business data transmitting is carried on in a certain local area in the link frequently in short time, the purpose of quickly awakening the link can be achieved, so that the timeliness and the reliability of the system are improved.

Description

The link dormant method of wireless senser multihop network chain topology
Technical field
The present invention relates to a kind of link dormant method of wireless senser multihop network chain topology, belong to wireless communication field.
Technical background
Wireless chain communication system is the banded application scenarios of chain topology for communication zone and designs, needing the advantage having its uniqueness under the banded application scenarios covered just as forest for wind resistance and sand prevention, links, frontier defense circumference etc., there is the market demand widely at present.
When link enters resting state owing to not having business demand to occur, postpone in link according to certain rule and be positioned at the cycle that main controlled node node far away enters dormancy, a certain regional area in a link can be solved like this and frequently business data transmission occur at short notice and frequently wake the problem of link up.
Existing standard agreement all well cannot solve the problem of the link fast wake-up of wireless multi-hop chain topological system in link dormant mechanism.
Summary of the invention
The present invention proposes a kind of link dormant method of wireless senser multihop network chain topology, the method to be applicable in link after certain node generation business data transmission, some neighbor nodes comprised certain node in itself and there occurs business data transmission again and reawake the slower problem of link before and after it within a short period of time, can reach the object of fast wake-up under certain condition.
Suppose that in link, K node is when business data transmission, all nodes be in before this node are all in running order, and all nodes after this node are all in periodic dormancy awakening state; Node intrinsic dormancy time of delay is T2, and namely node does not have business data transmission then to enter periodically dormancy awakening state in time period T2; When K node completes the transmission of business datum, make this node and forward direction K/i thereof round a node delay time period T3 and enter periodically dormancy awakening state again; Other nodes enter periodically dormancy awakening state according to normal condition; Wherein i and T3 is for pre-setting, and specifically obtains according to the test of different network condition, 1<=i <=k, 0<=T3<=1000*T2.
When K node completes the transmission of business datum, after this node can also being waken up, round a node to K/i simultaneously.
The wakeup process of link is initiated by the central control node being positioned at node root, in setting-up time, send wake-up packet to first node by central control node always, after node is waken up, wake-up packet can be sent in setting-up time to node thereafter, the like, until the node that business datum occurs is waken up.
The time sending wake-up packet is greater than the dormancy period of node, and described dormancy period refers to that in periodic dormancy awakening state, a dormancy adds the time of waking up.
Advantage of the present invention is: the method for the invention defines a kind of link dormant mechanism being applicable to wireless multi-hop catenary system, this mechanism can make frequent when there is business datum in a certain regional area short time in a link, the object of fast wake-up link can be reached, thus the real-time of elevator system and reliability.
Accompanying drawing explanation
Fig. 1 is chain topology schematic diagram.
Fig. 2 is Link Fragmentation schematic diagram.
Fig. 3 is dormancy awakening time slot schematic diagram.
Embodiment
Below in conjunction with accompanying drawing and concrete case study on implementation, technical scheme of the present invention is described in more detail.
The present invention proposes a kind of postponement and the node of business datum and forward and backward (forward direction refers to the direction of this node to central control node, and backward is the direction of this node to tail node) some neighbor nodes thereof enter resting state mechanism when transfer of data completes occurs.When above-mentioned node will enter periodicity dormancy awakening state after business data transmission completes, its operating time of proper extension, if the node that business data transmission occurs so at short notice next time drops in above-mentioned node, the object of fast wake-up can be reached.
In link, certain node generation business datum is triggered by central control node (link only has, be positioned at link foremost), and its working method is half-duplex, and the initiation of all business datums on link is all from central control node.
Described node itself can enter periodic dormancy awakening state at one's leisure.An one dormancy period comprises dormancy and wakes two parts up, occupies certain ratio respectively, and in general, the duty ratio of dormancy part is greater than the duty ratio waking part up, supposes that dormancy period is set to T here.
Suppose that in link, K node (being called node K) is when business data transmission, it is all in running order for being now in all nodes (comprising this node) before this node, and all nodes thereafter are all in periodic dormancy awakening state.Suppose that node K completes the transmission of business datum in the T1 moment, all nodes itself need enter periodically dormancy awakening state owing to not having business data transmission in certain hour section T2.
Now, our dormancy strategy does not allow all working nodes enter periodically dormancy awakening state, but allow and the some nodes of its forward direction of node of business datum occur be assumed to be K/i and round (wherein 1<=i <=k) individual node (can by a certain percentage) and postpone certain hour section T3 (T3 scope is 0<=T3<=1000*T2) and enter periodically dormancy awakening state again, wake some nodes (node that main consideration will wake up recently may be neighbor node thereafter) thereafter up simultaneously.Then other nodes enter periodically dormancy awakening state according to normal condition.
If like this in limiting time section T2+T3, there is the node of business datum next time to drop on and be above-mentionedly in the scope (K-K/i ~ K+K/i) of working node, when so waking link up, only need wake K-K/i-1 node before this region up, being in node in this region without the need to waking up, the object of fast wake-up link can be reached like this.
If in limiting time section T2+T3, the node of business datum does not occur or the node (limit of consideration is that K+K/i does not exceed maximum node number here) not in this region of business datum occurs, so in this region, all nodes only need enter periodically dormancy awakening state by normal condition.
Link wakeup process is initiated by the central control node being positioned at node root, send wake-up packet to first node within a certain period of time by central control node always, after node is waken up, wake-up packet can be sent in certain to node thereafter, the like, until the node that business datum occurs is waken up.
Initial condition of the present invention is all nodes is all be in periodic dormancy awakening state, and namely whole piece link is in resting state.When node carries out business data transmission, node itself need be in operating state always, can not carry out periodic dormancy awakening, and namely link needs first to wake up.
Fast wake-up of the present invention is that be directed to other situations, efficiency of waking up of the present invention does not improve when the node that business datum occurs has dropped on a certain regional area at short notice.
Shown in Fig. 1 is the topological structure of chain multihop network, and the present invention will be described for chain-shaped network topological structure, but be not limited thereto.In chain-shaped network, whole communication nodes becomes one or more of link.There is a central control node in a network, define the root that its position is network.The communication direction of definition from central control node to leaf node is down direction, and the communication direction from leaf node to root node is up direction.Be directed to certain ordinary node, the node near network root on topological direction is called its forward direction node; Node away from network root is called its backward node.Such as, for node 2, node 1 is on the direction of network root, is called the forward direction node of node 2; Node 3 is on the direction away from network root, is called the backward node of node 2.
In the present embodiment, carry out expansion explanation by for the link dormant mechanism on a link during inter-node communication.But the present invention the topological structure that is suitable for be not limited thereto, the number of node that is suitable for be greater than 2.
Fig. 2 describes has m node on link.Time initial, the dormancy period of all nodes is consistent and all nodes start all to be in periodically resting state.Suppose that the transmission of business datum occurs for central control node this and node K, so first central control node can wake the link between itself and node K up.
Wakeup process is that first central control node sends wake-up packet to node 1 in certain hour section P always, and wherein P is the dormancy period T being greater than node, can ensure that node 1 is sure when the wake-up states of a dormancy period like this and receives wake-up packet.After node 1 is waken up, it can be pressed said process to node 2 and send wake-up packet, by that analogy, until wake node K up.
Can to central control node loopback message be waken up after node K is waken up, then central control node can send the message of business data transmission to node K.Suppose to be transmitted in T1 moment node K data, after certain free time T2, all nodes should enter periodic dormancy awakening state, now, the node that we postpone between node K and its forward direction (K-K/i) ~ K enters resting state, and retardation time is T3.And K ~ (K+K/i) node (considering that K+K/i is no more than maximum node number here) simultaneously waken up thereafter, all in running order at all nodes in node K-K/i ~ K+K/i this section of region like this, and other all nodes are all in periodically dormancy awakening state.
After node K finishing service transfer of data, in limiting time section T2+T3, if the node of generation business datum is within the scope of K-K/i ~ K+K/i, so we only need to wake a front K-K/i-1 node up, can reach the object of fast wake-up link like this.If there is the node of business datum not in above-mentioned scope or the node of business datum does not occur in limiting time section T2+T3, the node in so above-mentioned scope enters periodically dormancy awakening state.
In the present invention, clear for stating, the division in region represents according to the dividing condition of figure bis-, but link delay dormancy node region concrete zoned format be not limited to example as herein described.
Fig. 3 describes the situation waking dormancy duty ratio up of node, and its forward direction neighbor node sends out the situation of wake-up packet in wakeup process, for ensureing that it can receive wake-up packet, the minimum wakeup time length that we send wake-up packet should be longer than the dormancy period of node itself.
Described dormancy period comprises dormancy and wakes two parts up, node only just can receive wake-up packet when being in wake-up states, before node is waken up completely, may receive multiple wake-up packet, when node is waken up, just to its forward direction node loopback message of having waken up.

Claims (5)

1. the link dormant method of wireless senser multihop network chain topology, it is characterized in that: when in link, K node is in business data transmission, the all nodes be in before this node are all in running order, and all nodes after this node are all in periodic dormancy awakening state; Node intrinsic dormancy time of delay is T2, and namely node does not have business data transmission then to enter periodically dormancy awakening state in time period T2;
When K node completes the transmission of business datum, make this node and forward direction K/i thereof round a node delay time period T3 and enter periodically dormancy awakening state again; Other nodes enter periodically dormancy awakening state according to normal condition; Wherein 1<=i <=k.
2. the link dormant method of wireless senser multihop network chain topology as claimed in claim 1, is characterized in that, 0<=T3<=1000*T2.
3. the link dormant method of wireless senser multihop network chain topology as claimed in claim 1, is characterized in that, when K node completes the transmission of business datum, rounds a node after waking this node up to K/i simultaneously.
4. the link dormant method of wireless senser multihop network chain topology as claimed in claim 1, it is characterized in that, the wakeup process of link is initiated by the central control node being positioned at node root, in setting-up time, send wake-up packet to first node by central control node always, after node is waken up, wake-up packet can be sent in setting-up time to node thereafter, the like, until the node that business datum occurs is waken up.
5. the link dormant method of wireless senser multihop network chain topology as claimed in claim 4, it is characterized in that, the time sending wake-up packet is greater than the dormancy period of node, and described dormancy period refers to that in periodic dormancy awakening state, a dormancy adds the time of waking up.
CN201510122208.5A 2015-03-19 2015-03-19 The link dormant method of wireless senser multihop network chain topology Active CN104684057B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510122208.5A CN104684057B (en) 2015-03-19 2015-03-19 The link dormant method of wireless senser multihop network chain topology

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510122208.5A CN104684057B (en) 2015-03-19 2015-03-19 The link dormant method of wireless senser multihop network chain topology

Publications (2)

Publication Number Publication Date
CN104684057A true CN104684057A (en) 2015-06-03
CN104684057B CN104684057B (en) 2017-11-28

Family

ID=53318488

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510122208.5A Active CN104684057B (en) 2015-03-19 2015-03-19 The link dormant method of wireless senser multihop network chain topology

Country Status (1)

Country Link
CN (1) CN104684057B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106714284A (en) * 2016-11-30 2017-05-24 江苏中科羿链通信技术有限公司 Sequential sleep and wakeup method for wireless chain type topological network
CN106851803A (en) * 2017-03-06 2017-06-13 云南电网有限责任公司电力科学研究院 A kind of wireless senser awakening method
CN114554581A (en) * 2022-02-21 2022-05-27 营口天成消防设备有限公司 Method for realizing networking communication of low-power-consumption wireless equipment for fire fighting

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100956642B1 (en) * 2009-11-06 2010-05-11 서울대학교산학협력단 Method and system for data forwarding in duty-cycled wireless sensor networks
US20100290379A1 (en) * 2009-05-13 2010-11-18 Snu R&Db Foundation Method for wireless multi-hop network
CN101998598A (en) * 2009-08-20 2011-03-30 华为技术有限公司 Method and device for monitoring explore frame sequences
CN102740427A (en) * 2012-06-15 2012-10-17 无锡必创传感科技有限公司 Method for awakening wireless sensor, wireless sensor and wireless sensor system
CN102869079A (en) * 2012-09-20 2013-01-09 电子科技大学 Method for adjusting regular sleep period of terminal node in self-adaptive manner
CN103595561A (en) * 2013-11-06 2014-02-19 电子科技大学 Method for saving energy of broadband access network

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100290379A1 (en) * 2009-05-13 2010-11-18 Snu R&Db Foundation Method for wireless multi-hop network
CN101998598A (en) * 2009-08-20 2011-03-30 华为技术有限公司 Method and device for monitoring explore frame sequences
KR100956642B1 (en) * 2009-11-06 2010-05-11 서울대학교산학협력단 Method and system for data forwarding in duty-cycled wireless sensor networks
CN102740427A (en) * 2012-06-15 2012-10-17 无锡必创传感科技有限公司 Method for awakening wireless sensor, wireless sensor and wireless sensor system
CN102869079A (en) * 2012-09-20 2013-01-09 电子科技大学 Method for adjusting regular sleep period of terminal node in self-adaptive manner
CN103595561A (en) * 2013-11-06 2014-02-19 电子科技大学 Method for saving energy of broadband access network

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106714284A (en) * 2016-11-30 2017-05-24 江苏中科羿链通信技术有限公司 Sequential sleep and wakeup method for wireless chain type topological network
CN106851803A (en) * 2017-03-06 2017-06-13 云南电网有限责任公司电力科学研究院 A kind of wireless senser awakening method
CN114554581A (en) * 2022-02-21 2022-05-27 营口天成消防设备有限公司 Method for realizing networking communication of low-power-consumption wireless equipment for fire fighting
CN114554581B (en) * 2022-02-21 2024-01-02 营口天成消防设备有限公司 Method for realizing networking communication of low-power-consumption wireless equipment for fire control

Also Published As

Publication number Publication date
CN104684057B (en) 2017-11-28

Similar Documents

Publication Publication Date Title
KR101032724B1 (en) method for wireless multi-hop network
US20100097988A1 (en) Wireless sensor network with linear structure being capable of bidirectional communication and method thereof
US10070388B2 (en) Coordinated duty cycle assignment in mesh networks
CN103906207A (en) Wireless sensor network data transmission method based on self-adaptation required awakening technology
CN104684057A (en) Link hibernation method for wireless sensor multi-hop network chain-like topological structure
CN106888491B (en) Wireless sensor network on-demand quick awakening method based on constructive interference
CN104411000A (en) Method for selecting cluster head of hierarchical routing protocol in wireless sensor network
Vermeulen et al. Energy-delay analysis of full duplex wireless communication for sensor networks
CN110062433A (en) A kind of LoRa recurrent network of low-power consumption
WO2017036327A1 (en) Random access repeater, relay system and relay method therefor
JP2018535565A5 (en)
CN101217445B (en) A method of loop generation protection and Ethernet ring system
US20220217572A1 (en) Signal transfer device, signal transfer method, signal transfer control device, signal transfer control method and signal transfer program
CN106714284B (en) Sequential dormancy awakening method suitable for wireless chain topology network
Singh et al. A cross-layer MAC protocol for contention reduction and pipelined flow optimization in wireless sensor networks
CN113315668A (en) Method, node device and storage medium for adaptively adjusting network configuration
CN104703296A (en) Link dormancy method for wireless communication multi-hop network link and tree topology structure
CN104735698A (en) Data transmission method based on capture effect in wireless sensor network
Moon et al. Enabling low power listening on ieee 802.15. 4-based sensor nodes
CN102724741A (en) Micro-cycle-based sleep method adapted to routing nodes in wireless sensor network
ATE536077T1 (en) COMMUNICATION SIGNAL TRANSMISSION METHOD
US11943167B2 (en) Data collection from asynchronous transmissions in wireless mesh networks
US10999891B2 (en) Method for communicating in multi-MAC-operating environment and IoT apparatus
Jacquet et al. Using a token approach for the MAC layer of linear sensor networks: Impact of the node position on the packet delivery
Zhang et al. A relative clock based and energy sense MAC protocol for underwater acoustic communication 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
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20230707

Address after: 214135 Building C, Weina Sensor Network International Innovation Park, No. 200, Linghu Avenue, the Taihu Lake International Science Park, Wuxi New District, Jiangsu Province

Patentee after: JIANGSU CAS INTERNET-OF-THINGS TECHNOLOGY VENTURE CAPITAL CO.,LTD.

Address before: 214135 Block C, International Innovation Park of China Sensor Network, 200 Linghu Avenue, Wuxi New District, Jiangsu Province

Patentee before: JIANGSU R & D CENTER FOR INTERNET OF THINGS