CN104703296A - Link dormancy method for wireless communication multi-hop network link and tree topology structure - Google Patents
Link dormancy method for wireless communication multi-hop network link and tree topology structure Download PDFInfo
- Publication number
- CN104703296A CN104703296A CN201510122210.2A CN201510122210A CN104703296A CN 104703296 A CN104703296 A CN 104703296A CN 201510122210 A CN201510122210 A CN 201510122210A CN 104703296 A CN104703296 A CN 104703296A
- Authority
- CN
- China
- Prior art keywords
- node
- link
- sleep
- frame
- main controlled
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a link dormancy method for a wireless communication multi-hop network link and a tree topology structure. The link dormancy method comprises the step of closing a data path on a link of a certain subsection region which does not have business data interaction within a set time so that the data path enters a local dormancy state. Dormancy of the subsection region does not affect business transmission of other node equipment on the link. Data are not transmitted between a master control node and a certain secondary node in two ways within a certain time, and a link between the master control node and the secondary node enters a local dormancy state. The link dormancy method has the advantages that in a wireless communication system, if business data are not transmitted between nodes, the data path of the subsection region is closed, loss of flow can be reduced effectively, and the use ratio of a system can be improved.
Description
Technical field
The present invention relates to a kind of link dormant method of radio communication multihop network chain and tree topology, belong to wireless communication field.
Technical background
Wireless chain communication system is the application scenarios of chain or tree topology for communication zone and designs, needing the advantage having its uniqueness under the banded application scenarios covered just as oil highway, rivers and lakes, frontier defense circumference etc., there is the market demand widely at present.
Bandwidth availability ratio is an important indicator of wireless communication system.In chain and tree topology, if when on some sectional areas, (region of continuous several node composition) does not have a business data transmission within a period of time, the idle flow loss of this sectional area can be relatively more serious, therefore needs to consider to adopt certain dormancy mechanism.
Summary of the invention
The present invention proposes a kind of link dormant method of radio communication multihop network chain and tree topology, part of links can be made not have can enter resting state during business data transmission within a period of time, solve the problem of idle flow loss with this.
Described dormancy method is: in communication process, if when a certain sectional area in discovery link does not have a service data interaction in setting-up time, just allow this sectional area link on data path close, enter local sleep state, the dormancy of described sectional area does not affect the business transmission of other node devices on link.
The determination methods whether meeting dormancy condition is: when main controlled node find self and certain from node within a certain period of time two-way all there is no a transfer of data time, described main controlled node just enters local sleep state to from the link between node.
The method for message interaction making link enter resting state is: main controlled node to sending a sleep frame with sleep time from node, then main controlled node and enter resting state respectively after node carries out message authentication by retransmission mechanism of shaking hands; After sleep time terminates, main controlled node recovers to communicate with again waking up from node.
From node after receiving sleep frame, receive the response message of this sleep frame to main controlled node loopback one, then enter resting state, main controlled node also enters resting state after receiving this response message.If main controlled node is to after retransmitting set point number sleep frame message from node, still do not receive the response message from node loopback, so main controlled node also enters resting state.
Concrete, described sleep frame at least comprises following components: source node ID, destination node ID, frame type, sleep time, and whether described frame type can show this frame is sleep frame.
Advantage of the present invention is: in a wireless communication system, if when not having the transmission of business datum between node, close the data path of this sectional area, effectively can reduce the loss of flow, also can improve the utilance of system simultaneously.
Accompanying drawing explanation
Fig. 1 is chain topology schematic diagram.
Fig. 2 is sleep frame structure.
Fig. 3 is host node dormancy flow chart.
Fig. 4 is host node and from node communication mechanism schematic diagram.
Embodiment
Below in conjunction with drawings and Examples, the invention will be further described.
In the present invention, the whole nodes sharing same interface-free resources are called one group of resource-sharing node.Wherein, described node can be but be not limited to the Wireless Telecom Equipments such as via node, base station, mobile terminal.
In one group of resource-sharing node, the node distributed interface-free resources is main controlled node, and referred to as host node, all the other nodes are called from node.
Link dormant mechanism of the present invention have employed the principle of centralized distribution.In communication process, collected by host node and judge whether the link between a pair wireless communication node equipment is idle from the bidirectional data buffer district information of node.Wherein, from node, the cache information of local data buffering area is fed back to host node by physics frame head, host node according to feedback information, then judges bidirectional traffics in conjunction with the cache information of host node local data buffering area.Pass through multi frame detection, if bidirectional traffics are empty situation continue for n frame (size of n can be determined on a case-by-case basis), then think that this meets the condition of dormancy to node, further, we need to make this enter resting state respectively to node according to certain strategy.
Sleep messages interaction mechanism described in the present invention can but be not limited to retransmission mechanism of shaking hands.After a pair node meets dormancy condition in a link, first by host node to sending a sleep frame with sleep time from node, from node after receiving this sleep frame, after being resolved to sleep time wherein, just enter resting state, again waking up from node after sleep time.
In order to ensure the reliability of interacting message, from node after receiving sleep frame, receive the ack(response of this sleep frame to host node loopback one) message, just need to enter resting state again after the complete ack message of loopback from node like this.And host node also enters resting state after receiving this ack message, wherein, master and slave node is all again wake up after sleep time after entering resting state, and master and slave node recovers communication.
Wherein, the sleep frame that host node sends may be lost, we can ensure the correct arrival of message by retransmission mechanism, if host node is to after retransmitting three (can be three times but be not limited to this) sleep frame message from node, still the ack information from node loopback is not received, so host node now also enters resting state, but now may there is two states from node: the first, if never receive the sleep frame information of host node transmission from node, so always in running order from node, resting state can not be entered, until host node recovers proper communication after again waking up again.The second, if the ack information drop-out of loopback after receiving sleep frame message from node first time, so now from node after receiving sleep frame message, just resting state is entered, by the time again wake up again from node after sleep time, and host node is just entering resting state after certain number of retransmissions, thus at host node after sleep time, master and slave node could recover proper communication.
As shown in Figure 1 be the topological structure of chain and tree-shaped multihop network, the present invention will be described for chain-shaped network topological structure.In chain-shaped network, whole communication nodes becomes chain or tree-shaped branch.There is a root node in a network and central control unit is linked, definition root node position is the root of network.The communication direction of definition from root node to leaf node is down direction, and the communication direction from leaf node to root node is up direction.In a pair communication node with direct communication relation, topological direction plays master control effect near the node of network root in the process of communication, is called host node (MASTER); Away from the node of network root in the process of communication, receive the control of host node, be called from node (SLAVE).Such as, in node 3 and node 5, the root of node 3 more near network in topology, institute thinks host node, node 5 away from the root of network, for from node.In the position of topological bifurcated, host node can be corresponding multiple from node, and such as node 2 is when communicating with node 4 with node 3, and node 2 is host node, node 3 and node 4 be node 2 from node.
In the present embodiment, expansion explanation will be carried out for communication process between node 2, this group node of node 3.But the present invention the topological structure that is suitable for be not limited thereto, the number of dormancy node that is suitable for be greater than 2, be not limited to the dormancy node number in the implementation case.
In communication process, whether host node 2 is collected and is idle from the link that the bidirectional data buffer district information of node 3 is come between decision node 2, node 3.Specific strategy is as follows: from node 3, the cache information of local data buffering area is fed back to host node 2 by physics frame head, and host node 2 according to feedback information, then carrys out the bidirectional traffics between decision node in conjunction with the cache information of its local data buffering area.If detect, bidirectional traffics are that empty situation continue for n frame, then think that node 2 and node 3 meet dormancy condition, next step node 2 and node 3 will walk dormancy flow process.
Node dormancy duration carries transmission in the sleep frame of host node transmission, and wherein sleep frame at least comprises following components: source node ID, destination node ID, frame type, sleep time etc., as shown in Figure 2.
Wherein, source node ID represents the node address of main controlled node, is used to refer to the source address sending sleep frame; Destination node ID representative, from the node address of node, is used to refer to the destination address receiving sleep frame; Whether frame type is used to refer to this frame is sleep frame; Sleep time is used to refer to the time length of master and slave node dormancy.
Fig. 3 describes the flow chart that host node carries out resting state.After determining that node 2 and node 3 meet dormancy condition, host node 2 can send a sleep frame with sleep time to from node 3, node 3 can receive the ack information of sleep frame after receiving this sleep frame to host node 2 loopback one, after loopback this ack information complete, just enter resting state from node 3, and host node 2 enters resting state again after receiving the ack information of loopback.
If after host node 2 sends sleep frame, do not receive the ack information of loopback within a certain period of time, so host node 2 can carry out retransmitting this sleep frame, retransmit maximum times can be but be not limited to three times, if still do not receive the ack information of loopback after retransmitting for three times, so now host node 2 just enters resting state.
Master and slave node, after entering resting state, all can be waken up through sleep time again, and master and slave node recovers communication again.
Fig. 4 describes in communication process the interacting message situation that the dormancy flow process retransmitted does not occur.
Suppose that host node 2 sends sleep frame in the t1 moment to from node 3, the sleep time that wherein sleep frame is carried is T, if receive this sleep frame in the t2 moment from node 3, so from node 3 after the t2 moment receives sleep frame, just enter resting state to the complete ack information of host node 2 loopback, again waking up in the t2+T moment after sleep time T.And host node 2 is being supposed after the t3 moment receives the ack information of loopback, so host node 2 is also entering resting state in the t3 moment, also again wakes up after sleep time T in the t3+T moment.Wake up prior to host node 2 from node 3, so after node 3 is waken up, enter receiving mode, until the Frame of synchronous upper host node 2, between master and slave node, just recovered communication.
Claims (6)
1. the link dormant method of radio communication multihop network chain and tree topology, it is characterized in that: in communication process, if when a certain sectional area in discovery link does not have a service data interaction in setting-up time, just allow this sectional area link on data path close, enter local sleep state, the dormancy of described sectional area does not affect the business transmission of other node devices on link.
2. the link dormant method of radio communication multihop network chain as claimed in claim 1 and tree topology, it is characterized in that, the determination methods whether meeting dormancy condition is: when main controlled node find self and certain from node within a certain period of time two-way all there is no a transfer of data time, described main controlled node just enters local sleep state to from the link between node.
3. the link dormant method of radio communication multihop network chain as claimed in claim 1 and tree topology, it is characterized in that, the method for message interaction making link enter resting state is: main controlled node to sending a sleep frame with sleep time from node, then main controlled node and enter resting state respectively after node carries out message authentication by retransmission mechanism of shaking hands; After sleep time terminates, main controlled node recovers to communicate with again waking up from node.
4. the link dormant method of radio communication multihop network chain as claimed in claim 3 and tree topology, it is characterized in that, described sleep frame at least comprises following components: source node ID, destination node ID, frame type, sleep time, and whether described frame type can show this frame is sleep frame.
5. the link dormant method of radio communication multihop network chain as claimed in claim 3 and tree topology, it is characterized in that, from node after receiving sleep frame, the response message of this sleep frame is received to main controlled node loopback one, enter resting state again, main controlled node also enters resting state after receiving this response message.
6. the link dormant method of radio communication multihop network chain as claimed in claim 3 and tree topology, it is characterized in that, if main controlled node is to after retransmitting set point number sleep frame message from node, still do not receive the response message from node loopback, so main controlled node enters resting state.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510122210.2A CN104703296A (en) | 2015-03-19 | 2015-03-19 | Link dormancy method for wireless communication multi-hop network link and tree topology structure |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510122210.2A CN104703296A (en) | 2015-03-19 | 2015-03-19 | Link dormancy method for wireless communication multi-hop network link and tree topology structure |
Publications (1)
Publication Number | Publication Date |
---|---|
CN104703296A true CN104703296A (en) | 2015-06-10 |
Family
ID=53349965
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201510122210.2A Pending CN104703296A (en) | 2015-03-19 | 2015-03-19 | Link dormancy method for wireless communication multi-hop network link and tree topology structure |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104703296A (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105049272A (en) * | 2015-09-08 | 2015-11-11 | 北京邮电大学 | Link hibernation method and device |
CN113543198A (en) * | 2020-04-14 | 2021-10-22 | 海能达通信股份有限公司 | Mesh network communication method and related device |
CN113543203A (en) * | 2020-04-14 | 2021-10-22 | 海能达通信股份有限公司 | Method for communication resource allocation and communication node awakening |
WO2023226989A1 (en) * | 2022-05-26 | 2023-11-30 | 华为技术有限公司 | Node scheduling method and device based on plc, and plc system |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101272557A (en) * | 2008-05-15 | 2008-09-24 | 重庆大学 | Mobile station dormancy mode energy-saving method |
EP2047354A1 (en) * | 2006-07-28 | 2009-04-15 | ARM Limited | Power management in a data processing device having masters and slaves |
CN102625427A (en) * | 2012-03-14 | 2012-08-01 | 东南大学 | Wireless sensor network data acquisition method based on asynchronous awakening scheduling |
CN102740363A (en) * | 2012-06-20 | 2012-10-17 | 东南大学 | Method for acquiring data of wireless sensor network |
CN102781081A (en) * | 2012-07-13 | 2012-11-14 | 浙江工业大学 | Energy-saving transmission for wireless sensor network based on secondary exponential smoothing forecasting |
CN103078756A (en) * | 2012-12-28 | 2013-05-01 | 长城汽车股份有限公司 | Mode switching method and CAN (Controller Area Network) |
-
2015
- 2015-03-19 CN CN201510122210.2A patent/CN104703296A/en active Pending
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2047354A1 (en) * | 2006-07-28 | 2009-04-15 | ARM Limited | Power management in a data processing device having masters and slaves |
CN101272557A (en) * | 2008-05-15 | 2008-09-24 | 重庆大学 | Mobile station dormancy mode energy-saving method |
CN102625427A (en) * | 2012-03-14 | 2012-08-01 | 东南大学 | Wireless sensor network data acquisition method based on asynchronous awakening scheduling |
CN102740363A (en) * | 2012-06-20 | 2012-10-17 | 东南大学 | Method for acquiring data of wireless sensor network |
CN102781081A (en) * | 2012-07-13 | 2012-11-14 | 浙江工业大学 | Energy-saving transmission for wireless sensor network based on secondary exponential smoothing forecasting |
CN103078756A (en) * | 2012-12-28 | 2013-05-01 | 长城汽车股份有限公司 | Mode switching method and CAN (Controller Area Network) |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105049272A (en) * | 2015-09-08 | 2015-11-11 | 北京邮电大学 | Link hibernation method and device |
CN105049272B (en) * | 2015-09-08 | 2018-09-11 | 北京邮电大学 | Link dormant method and device |
CN113543198A (en) * | 2020-04-14 | 2021-10-22 | 海能达通信股份有限公司 | Mesh network communication method and related device |
CN113543203A (en) * | 2020-04-14 | 2021-10-22 | 海能达通信股份有限公司 | Method for communication resource allocation and communication node awakening |
CN113543203B (en) * | 2020-04-14 | 2023-10-24 | 海能达通信股份有限公司 | Communication resource allocation and communication node awakening method |
CN113543198B (en) * | 2020-04-14 | 2023-12-19 | 海能达通信股份有限公司 | Mesh network communication method and related device |
WO2023226989A1 (en) * | 2022-05-26 | 2023-11-30 | 华为技术有限公司 | Node scheduling method and device based on plc, and plc system |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10075892B2 (en) | Mobile device for use in a dynamic and stochastic asynchronously updated wireless ad-hoc network | |
US8831023B2 (en) | Low latency mesh network | |
CN102761931B (en) | Method for carrying out dynamic data transmission in asynchronous duty ratio wireless sensor network | |
Sharma et al. | A Comparative Analysis of Reliable and Congestion‐Aware Transport Layer Protocols for Wireless Sensor Networks | |
CN107040878A (en) | A kind of many chain wireless sensor networks without layered communication method | |
CN103200109B (en) | A kind of ospf neighbor relationship management method and equipment | |
CN102480409B (en) | Method for realizing rapid ring protection protocol (RRPP) loop shunting uplink, RRPP loop and device | |
CN104703296A (en) | Link dormancy method for wireless communication multi-hop network link and tree topology structure | |
CN105873169A (en) | Wireless ad-hoc network communication method | |
CN101938418A (en) | Relaying method of power line communication network | |
CN101784067A (en) | Method for quickly sensing meeting nodes based on cross-layer triggering in opportunistic network | |
CN103139865B (en) | Networking and the method communicated in a kind of electric power Internet of Things | |
Tso et al. | DragonNet: a robust mobile internet service system for long-distance trains | |
CN101686169B (en) | Scheme for avoiding deadlock in multi-ring interconnect, with additional application to congestion control | |
CN107508648A (en) | Time triggered Ethernet substep time synchronized strategy based on functions of the equipments classification | |
CN102932820A (en) | Link processing method, device and system | |
Abbas et al. | Performance analysis of end-to-end delay and reliability for linear wireless multimedia sensor networks | |
Ali et al. | Three hops reliability model for underwater wireless sensor network | |
CN103079251B (en) | The method and system of data collision are avoided in wireless sense network | |
CN103312619A (en) | Synchronous deleting and message transferring congestion control method | |
CN109391675B (en) | Reliable transmission method applied to WSN (Wireless sensor network) from sink node to sensor node | |
Justus et al. | Congestion control in wireless sensor network using hybrid epidermic and DAIPaS approach | |
CN105721296A (en) | Method for improving stability of chain structure ZigBee network | |
CN102801639B (en) | Communication device and method for transmitting network management protocol by using E1 odd frame Sa bit | |
CN103781104B (en) | A kind of Wireless Sensor Networks are based on the route maintenance method of path repairing |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into 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: 20150610 |