CN109121176A - A kind of Distributed Data Synchronization method - Google Patents
A kind of Distributed Data Synchronization method Download PDFInfo
- Publication number
- CN109121176A CN109121176A CN201811147950.1A CN201811147950A CN109121176A CN 109121176 A CN109121176 A CN 109121176A CN 201811147950 A CN201811147950 A CN 201811147950A CN 109121176 A CN109121176 A CN 109121176A
- Authority
- CN
- China
- Prior art keywords
- node
- data synchronization
- message
- distributed data
- synchronous
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/023—Limited or focused flooding to selected areas of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
- H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Health & Medical Sciences (AREA)
- Cardiology (AREA)
- General Health & Medical Sciences (AREA)
- Mobile Radio Communication Systems (AREA)
- Synchronisation In Digital Transmission Systems (AREA)
Abstract
The invention discloses a kind of Distributed Data Synchronization methods, it is limited for wireless network environment lower channel bandwidth, mostly towards connectionless transmission mode, the rate of information throughput is low, the bit error rate is relatively high, the small feature of volume of business, it is optimized to the synchronous diffusion node selection mechanism of row data is diffused by message between nodes in Gossip agreement, optimal data synchronization node is selected by constraint conditions such as heartbeat index, bandwidth, delay variation, transmission paths, effectively raises Distributed Data Synchronization performance.It avoids triggering a large amount of invalid informations using message between nodes STOCHASTIC DIFFUSION when tradition Gossip agreement in wireless network environment, the serious communication resource for consuming wireless network influences Distributed Data Synchronization performance.
Description
Technical field
The present invention relates to Distributed Data Synchronization methods a kind of under wireless network environment.
Background technique
Gossip agreement is a kind of flooding information proclaiming mechanism.Its working principle is: in a bounded network, each
Node is all randomly communicated with other nodes, and by some rambling communication, the state of final all nodes can all be reached
Unanimously.Each node may know that every other node, it is also possible to several neighbor nodes be just known that, as long as these sections can pass through
Network-in-dialing, finally their state is all consistent.Even if some nodes are restarted because of delay machine, there is new node addition, but pass through
After a period of time, the state of these nodes can also reach an agreement with other nodes, that is to say, that Gossip agreement naturally has
The advantages of distributed fault-tolerance.
But the shortcomings that Gossip agreement, node selection mechanism was uniformly random it is also obvious that in traditional Gossip agreement
, the factors such as the ability of node, the distance of distance, bandwidth are not accounted for, so that optimal node is selected to synchronize diffusion,
Cause redundancy communication that can cause very big load to network bandwidth, cpu resource in this way, and these loads are limited to communication frequency
Rate, the frequency affect the speed of algorithmic statement again.Especially the network of wireless environment has limited bandwidth resources, link state not
Stablize, the features such as communication delay is big, with the increase for sending message number, the load of message dissemination is consequently increased；Work as network
When being on a grand scale, the failure rate that message is sent can be obviously increased.Therefore, it is distributed in wireless environments by Gossip protocol realization
Data between formula node synchronize that there are performance bottlenecks.
Summary of the invention
In order to overcome the disadvantages mentioned above of the prior art, the distributed number that the present invention provides a kind of under wireless network environment
According to synchronous method, it is intended to overcome the existing synchronization mechanism of gossip agreement to be difficult to meet the synchronisation requirement under wireless network environment,
Solve in face of wireless network environment channel width it is limited, mostly towards connectionless transmission mode, the rate of information throughput is low, accidentally
Code rate is relatively high, and bring network resources waste and distributed collaboration data net synchronization capability asks when volume of business small feature
Topic.
The technical solution adopted by the present invention to solve the technical problems is: a kind of Distributed Data Synchronization method, including such as
Lower step:
Step 1: local node sends handshaking information to other all nodes first, and generates neighbour in wireless network environment
Occupy node listing；
Step 2: all nodes of the local node into neighboring node list periodically send heartbeat message, and according to
Heart beat status immediate updating neighboring node list；
Step 3: local node calculates the liveness of all neighbor nodes and is ranked up according to active index；
Carried out Step 4: the data of each node are synchronous using two kinds of working methods of negative entropy and rumour, negative entropy it is synchronous when
Between the period can according to synchronous regime dynamic adjust；
Step 5: message source node is selected in neighbor node liveness sorted lists when message needs to synchronize diffusion
It selects k live-vertex and carries out the synchronous diffusion of data；
Step 6: the neighbor node for receiving flood message selected in the neighboring node list of oneself k live-vertex into
The synchronous diffusion of row data, if the flood message that node receives is repetition message, which stops flood message, final the whole network control
Device node data processed reaches last consistency.
Compared with prior art, the positive effect of the present invention is:
The method of the synchronous diffusion of data in Gossip agreement is optimized, avoids synchronous diffusion in wireless network big
Redundancy message is measured, serious the phenomenon that consuming cpu resource and Internet resources, can effectively improve synchronizing quality and wireless network band
Wide utilization rate mitigates the communications burden of wireless network, it is ensured that the timeliness and whole network data consistency of synchronization message.The present invention
The Distributed Data Synchronization method of proposition is more able to satisfy that the data under wireless network environment are synchronous, the synchronous method after optimization its
The advantages of structure of equity meets the demand of mobility and survivability for node, distributed fault-tolerance, it is suitble to extensive, dynamic
State, resource-constrained network environment.
Detailed description of the invention
Examples of the present invention will be described by way of reference to the accompanying drawings, in which:
Fig. 1 is that Gossip message synchronization spreads overall process schematic diagram in an embodiment of the present invention.
Fig. 2 is that the diffusion of Gossip message synchronization divides schematic diagram one in an embodiment of the present invention.
Fig. 3 is that the diffusion of Gossip message synchronization divides schematic diagram two in an embodiment of the present invention.
Fig. 4 is that the diffusion of Gossip message synchronization divides schematic diagram three in an embodiment of the present invention.
Specific embodiment
A kind of Distributed Data Synchronization method under wireless network environment, as shown in Figure 1, passing through the message of Gossip agreement
It is unified to be finally reached whole network data for continuous flooding mechanism.Itself specifically includes the following steps:
Step 1: local node sends handshaking information to other all nodes first in wireless network environment, will reply
It shakes hands neighbor node of the node as this controller of response, neighboring node list is generated according to the on-off between node.
Step 2: all nodes of the local node into neighboring node list periodically send heartbeat message, and according to
Heart beat status immediate updating neighboring node list:
All nodes of the local node into neighboring node list periodically send heartbeat message, according to heartbeat failure time
Network connectivty between the clear node of number, when the successive heartbeat frequency of failure is more than NmaxWhen, then it is assumed that local node and the neighbours save
Network connectivty fails between point, which is deleted from neighboring node list and re-initiates handshaking information.
Step 3: each node calculates the liveness of all neighbours in this node neighboring node list, and according to liveness weight
Newly neighboring node list is ranked up, k neighbor node when selecting need to spread Gossip message next time；
The liveness for calculating neighbor node may share congestion path between each node by considering, cause transmission bottleneck, from
And influence the wellness of transmission path.Therefore, it is necessary to the heartbeat parameter P according to local node and all candidate neighbor nodes1With
And the available bandwidth P in transmission path2, delay variation P3, transmission path P4Equal index comprehensives calculate.Liveness calculation formula is such as
Under:
A=α × P1+β×P2+γ×P3+δ×P4
The definition of each liveness parameter condition under introducing separately below:
1) heartbeat parameter: all node periodicity sending heartbeat messages of the local node into neighboring node list, according to
Heartbeat return information is received to calculate the liveness of each neighbor node；Since the Internet resources under wireless network environment are limited, week
The initial value of phase is set as 5s, heartbeat parameter weight α=35% in all liveness design conditions, the definition of heartbeat parameter value
Are as follows:
Wherein, nAlwaysFor the heartbeat total degree that this node is sent to some neighbor node, n is the heart for receiving neighbor node reply
Jump response times.
2) bandwidth: bandwidth is the important restrictions condition in message flooding procedure, liveness design conditions weight beta=
30%, the link effective bandwidth between local node and neighbor node is B, bandwidth B needed for flood messagereq, flood message bandwidth accounts for
Ratio is expressed asBandwidth usage is lower smaller to network load, bandwidth accounting is defined as:
Delay variation: delay variation selects the delay variation maximum value that link is formed between local node and all neighbor nodes
For reference target, delay variation is indicated are as follows: Tmax=max (T1, T2…Tn), TiFor the time delay of each of the links in neighbor node path
Delay variation is converted into the virtual value finally calculated with formula by shake, delay variation in institute's Prescribed Properties weight γ=
20%；
P3=Tmax-Ti；
3) transmission path: for message in each node synchronizing process, the distance of diffusion length is also the synchronous important finger of data
Mark, the synchronous purpose of the more efficient faster completion of preferential selection and the close energy of local message source node, transmission path is in all constraints
Weight δ=15% in condition；
Therefore, it is calculated according to the liveness of heartbeat parameter, available bandwidth, delay variation and transmission path and each comfortable node
Weight, to calculate the neighbor node liveness of each node and be ranked up, when this node message dissemination, selection liveness is most
It is synchronous that k high node carries out data: k can carry out dynamic adjustment according to current network feature, big when enlivening neighbor node number
When 4, the number of nodes k is set as 4；When enlivening neighbor node number less than 4, the number of nodes k is set as current active neighbour
Occupy number of nodes.
Step 4: because of wireless network deficient in stability, to realize that internodal data can be synchronized effectively, the number of each node
Negative entropy and rumour two ways is combined to carry out according to synchronous, first way is after node starts, to safeguard the timing of a cycle
Device T, for periodically synchronizing local existing total data to neighbor node, the second way receives new for arbitrary node
It is only that new the whole network of data source incremental trigger is synchronous when data source.And the periodicity for the maintenance of the negative entropy method of synchronization
Timer T flexible configuration can be carried out according to Network Synchronization state and dynamic adjusts；Predefined typical case under wireless network environment
Initial period be 4s.
Step 5: message source node selects 2 to enliven in neighboring node list when new information needs to synchronize diffusion
Node carries out the synchronous diffusion of data, and message is specifically spread as shown in Fig. 2, node 1 is according to the calculating of the liveness of neighbor node, selection
Node 2 and node 3 are used as Gossip message dissemination node；As shown in figure 3, after node 2 and node 3 receive flood message, section
Point 2 is diffused according to neighbor node liveness, is selected node 4 and node 5 to carry out Gossip message and is diffused, node 3 is still
So selection node 1 and node 2 carry out Gossip message dissemination, when node 1 and node 2 receive the diffusion of the repetition from node 3 and disappear
After breath, this message is spread in stopping again, is avoided the repetition of the redundancy message in wireless network environment from spreading, has been saved network
Resource；As shown in figure 4, node 4 and node 5 select the respective neighbor node that enlivens to be expanded respectively after receiving the message of diffusion
It dissipates, the whole network data being finally reached is unified.
Step 6: 2 live-vertexs will be selected in local neighboring node list by receiving the neighbor node of flood message
The synchronous diffusion of data is carried out, if the flood message that node receives is repetition message, which stops flood message, final the whole network
Controller node data reach last consistency.
Claims (10)
1. a kind of Distributed Data Synchronization method, characterized by the following steps:
Step 1: local node starts first to other all node periodicity sending handshaking informations, root in wireless network environment
Neighboring node list is generated according to the neighbor node after shaking hands successfully；
Step 2: all nodes of the local node into neighboring node list periodically send heartbeat message, and according to heartbeat
State immediate updating neighboring node list；
Step 3: local node calculates the liveness of all neighbor nodes and is ranked up according to active index；
Step 4: the data between node are synchronous using the two kinds of working methods developments of negative entropy and rumour, the node negative entropy period is according to net
Network state carries out dynamic adjustment；
Step 5: message source node selects k in neighbor node liveness sorted lists when message needs to synchronize diffusion
Live-vertex carries out the synchronous diffusion of data；
Step 6: the neighbor node for receiving flood message selects k live-vertex to be counted in the neighboring node list of oneself
It is spread according to synchronous, if the flood message that present node receives is repetition message, which stops flood message, final the whole network control
Device node data processed reaches last consistency.
2. a kind of Distributed Data Synchronization method according to claim 1, it is characterised in that: generate neighbours described in step 1
The method of node listing are as follows: local node passes through the network connectivty and stabilization between the handshaking information detection sent and other nodes
Property, using the node for receiving response of shaking hands as the neighbor node that enlivens of this controller, generate neighboring node list.
3. a kind of Distributed Data Synchronization method according to claim 1, it is characterised in that: the negative entropy working method is
After node starting, the timer T of a cycle is safeguarded, for periodically synchronizing local existing whole numbers to neighbor node
According to；When the rumour working method is that arbitrary node receives new data source, only by new the whole network of data source incremental trigger
It is synchronous.
4. a kind of Distributed Data Synchronization method according to claim 3, it is characterised in that: the dynamic adjusting method of T are as follows:
When this T expires, checks and take turns the success rate synchronous to selected neighbor node negative entropy on this node, if negative entropy synchronizes successful section
Point is no more than the 1/2 of total synchronization node, then new cycle Tnew=2T；If the synchronous successful node of negative entropy is greater than total synchronization node
3/4, then Tnew=T/2；Each negative entropy repeats above-mentioned dynamic adjustment algorithm when expiring, while ensuring Tinit/4≤Tnew≤
Tinit× 4, wherein TinitIt is the predefined initial period, works as TnewValue when may be because certain adjustment beyond above-mentioned limitation, put
Abandon this adjustment.
5. a kind of Distributed Data Synchronization method according to claim 1, it is characterised in that: neighbours are calculated as follows
The liveness of node:
A=α × P1+β×P2+γ×P3+δ×P4
Wherein: A indicates the liveness of some neighbor node, Pi(i=1~4) respectively indicate heartbeat index, bandwidth, delay variation,
Effective weight of transmission path；α, β, γ, δ respectively indicate heartbeat index, bandwidth, delay variation, transmission path calculated specific gravity.
6. a kind of Distributed Data Synchronization method according to claim 5, it is characterised in that: the heartbeat index it is effective
Weight calculation method are as follows:
Wherein, nAlwaysIt is always secondary to the heartbeat of some neighbor node transmission in the synchronizing cycle of this node negative entropy working method maintenance
Number, n are the heartbeat response times for receiving neighbor node reply.
7. a kind of Distributed Data Synchronization method according to claim 5, it is characterised in that: effective weight of the bandwidth
Calculation method are as follows:
Wherein: BreqFor data synchronization message bandwidth on demand, B is this link bandwidth.
8. a kind of Distributed Data Synchronization method according to claim 5, it is characterised in that: the delay variation it is effective
The calculation method of weight are as follows:
P3=Tmax-Ti
Wherein: Tmax=max (T1, T2..., Tn), TiFor the delay variation of i-th link.
9. a kind of Distributed Data Synchronization method according to claim 5, it is characterised in that: the transmission path it is effective
The calculation method of weight are as follows:
Wherein: Lmax=max (L1, L2..., Ln), LiFor the path-length of i-th link.
10. a kind of Distributed Data Synchronization method according to claim 5, it is characterised in that: α, β, γ, δ difference
It is 35%, 30%, 20%, 15%.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811147950.1A CN109121176B (en) | 2018-09-29 | 2018-09-29 | Distributed data synchronization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811147950.1A CN109121176B (en) | 2018-09-29 | 2018-09-29 | Distributed data synchronization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109121176A true CN109121176A (en) | 2019-01-01 |
| CN109121176B CN109121176B (en) | 2021-11-02 |
Family
ID=64857467
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811147950.1A Active CN109121176B (en) | 2018-09-29 | 2018-09-29 | Distributed data synchronization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109121176B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110602244A (en) * | 2019-09-26 | 2019-12-20 | 重庆紫光华山智安科技有限公司 | Message interaction method and node for distributed storage system and distributed storage system |
| CN112332947A (en) * | 2020-07-30 | 2021-02-05 | 深圳Tcl新技术有限公司 | Data transmission method, mobile terminal and computer storage medium |
| CN111901438B (en) * | 2020-08-05 | 2021-02-09 | 军事科学院系统工程研究院网络信息研究所 | Distributed SIP server data synchronization method |
| CN112910663A (en) * | 2021-01-14 | 2021-06-04 | 网易（杭州）网络有限公司 | Method, device, equipment and storage medium for message broadcasting and terminal registration |
| CN113079099A (en) * | 2021-06-04 | 2021-07-06 | 军事科学院系统工程研究院网络信息研究所 | Method and system for synchronizing network state by adopting consensus protocol stack |
| CN113641756A (en) * | 2021-07-26 | 2021-11-12 | 浪潮卓数大数据产业发展有限公司 | Distributed high-concurrency data storage method |
| CN113901141A (en) * | 2021-10-11 | 2022-01-07 | 京信数据科技有限公司 | Distributed data synchronization method and system |
| CN115174594A (en) * | 2022-07-07 | 2022-10-11 | 广州炒米信息科技有限公司 | Data synchronization method, device, equipment and medium for distributed system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102098677A (en) * | 2009-12-11 | 2011-06-15 | 武汉大学 | Method for quickly building overlay network based on gossip |
| US20180159717A1 (en) * | 2005-12-29 | 2018-06-07 | Amazon Technologies, Inc. | Dynamic application instance discovery and state management within a distributed system |
| CN108156086A (en) * | 2017-12-19 | 2018-06-12 | 北京奇艺世纪科技有限公司 | A kind of strategy rule downloading method and device |
-
2018
- 2018-09-29 CN CN201811147950.1A patent/CN109121176B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180159717A1 (en) * | 2005-12-29 | 2018-06-07 | Amazon Technologies, Inc. | Dynamic application instance discovery and state management within a distributed system |
| CN102098677A (en) * | 2009-12-11 | 2011-06-15 | 武汉大学 | Method for quickly building overlay network based on gossip |
| CN108156086A (en) * | 2017-12-19 | 2018-06-12 | 北京奇艺世纪科技有限公司 | A kind of strategy rule downloading method and device |
Non-Patent Citations (3)
| Title |
|---|
| V.W.LUK等: "Gossip-Based Delay-Sensitive N-to-N Information Dissemination Protocol", 《IEEE GLOBECOM 2008 - 2008 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE》 * |
| 刘德辉等: "分布环境下的Gossip算法综述", 《计算机科学》 * |
| 田振兴等: "基于改进Gossip协议的数据同步设计", 《指挥信息系统与技术》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110602244A (en) * | 2019-09-26 | 2019-12-20 | 重庆紫光华山智安科技有限公司 | Message interaction method and node for distributed storage system and distributed storage system |
| CN112332947A (en) * | 2020-07-30 | 2021-02-05 | 深圳Tcl新技术有限公司 | Data transmission method, mobile terminal and computer storage medium |
| CN112332947B (en) * | 2020-07-30 | 2024-04-02 | 深圳Tcl新技术有限公司 | Data transmission method, mobile terminal and computer storage medium |
| CN111901438B (en) * | 2020-08-05 | 2021-02-09 | 军事科学院系统工程研究院网络信息研究所 | Distributed SIP server data synchronization method |
| CN112910663A (en) * | 2021-01-14 | 2021-06-04 | 网易（杭州）网络有限公司 | Method, device, equipment and storage medium for message broadcasting and terminal registration |
| CN112910663B (en) * | 2021-01-14 | 2022-06-14 | 网易（杭州）网络有限公司 | Method, device, equipment and storage medium for message broadcasting and terminal registration |
| CN113079099A (en) * | 2021-06-04 | 2021-07-06 | 军事科学院系统工程研究院网络信息研究所 | Method and system for synchronizing network state by adopting consensus protocol stack |
| CN113079099B (en) * | 2021-06-04 | 2021-09-10 | 军事科学院系统工程研究院网络信息研究所 | Method and system for synchronizing network state by adopting consensus protocol stack |
| CN113641756A (en) * | 2021-07-26 | 2021-11-12 | 浪潮卓数大数据产业发展有限公司 | Distributed high-concurrency data storage method |
| CN113901141A (en) * | 2021-10-11 | 2022-01-07 | 京信数据科技有限公司 | Distributed data synchronization method and system |
| CN115174594A (en) * | 2022-07-07 | 2022-10-11 | 广州炒米信息科技有限公司 | Data synchronization method, device, equipment and medium for distributed system |
| CN115174594B (en) * | 2022-07-07 | 2024-03-29 | 广州炒米信息科技有限公司 | Data synchronization method, device, equipment and medium of distributed system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109121176B (en) | 2021-11-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109121176A (en) | A kind of Distributed Data Synchronization method | |
| Duquennoy et al. | Orchestra: Robust mesh networks through autonomously scheduled TSCH | |
| Wang et al. | Dynamic duty cycle control for end-to-end delay guarantees in wireless sensor networks | |
| Jiang et al. | A distributed CSMA algorithm for throughput and utility maximization in wireless networks | |
| CN105263143B (en) | The slot allocation method of adaptive session dot density and load in self-organizing network | |
| CN104038991A (en) | Long-distance line type wireless sensor network cross-layer communication method | |
| Chipara et al. | Dynamic conflict-free query scheduling for wireless sensor networks | |
| CN103974442A (en) | Low-delay scheduling method suitable for wireless sensor network | |
| AU2009338150B2 (en) | Communication scheduling of network nodes using a cluster coefficient | |
| CN110290579A (en) | Wireless ad hoc network method for synchronizing time, node and wireless ad hoc network under a kind of narrowband condition | |
| Jenschke et al. | Alternative parent selection for multi-path RPL networks | |
| CN107222903A (en) | Method of data capture based on constructive interference in asynchronous low duty ratio WSN | |
| Javed et al. | RL-Budget: A learning-based cluster size adjustment scheme for cognitive radio networks | |
| Ng et al. | C-Sync: Counter-based synchronization for duty-cycled wireless sensor networks | |
| Wang et al. | DutyCon: a dynamic duty-cycle control approach to end-to-end delay guarantees in wireless sensor networks | |
| Wang et al. | Robust routing and scheduling in wireless mesh networks under dynamic traffic conditions | |
| Ahmed et al. | Adaptive dynamic duty cycle mechanism for energy efficient medium access control in wireless multimedia sensor networks | |
| Sakthivel et al. | Enhancement of accuracy metrics for energy levels in MANETs | |
| CN102685917B (en) | Capacity expansion-oriented wireless sensor network multi-channel scheduling method | |
| Debadarshini et al. | Timecast: Real-time many-to-many data-sharing in low-power wireless distributed systems | |
| KR102165318B1 (en) | Method for supporting multipath transmission for tsch mac environments, node apparatus in a multipath transmitting tsch mac environment | |
| Mager et al. | BUTLER: Increasing the Availability of Low-Power Wireless Communication Protocols. | |
| Kim et al. | Adaptive gradient time synchronization protocol in wireless Ad-hoc networks | |
| Cabezas et al. | Low energy and low latency in wireless sensor networks | |
| Watwe et al. | A design for performance improvement of clock synchronization in WSNs using a TDMA-based MAC protocol |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |