CN103442440A - Time slot distribution method for synchronizing Mesh network - Google Patents
Time slot distribution method for synchronizing Mesh network Download PDFInfo
- Publication number
- CN103442440A CN103442440A CN2013103242722A CN201310324272A CN103442440A CN 103442440 A CN103442440 A CN 103442440A CN 2013103242722 A CN2013103242722 A CN 2013103242722A CN 201310324272 A CN201310324272 A CN 201310324272A CN 103442440 A CN103442440 A CN 103442440A
- Authority
- CN
- China
- Prior art keywords
- time slot
- node
- carrying capacity
- mesh network
- father
- 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
Images
Abstract
A time slot distribution method for a synchronizing Mesh network includes the following steps that (1) the number of time slots required by nodes is calculated according to the service volume of the nodes; (2) time slot application packages are generated by the nodes according to the number of the required time slots and sent to father nodes of the nodes; (3) after the father nodes collect the time slot application packages, time slots are jointly distributed to all child nodes of the father nodes; (4) time slot distribution result packages are generated by the father nodes and sent to all the child nodes. The time slot distribution method solves the technical problems that in the prior art, according to a time slot distribution method based on service grades, time slot waste is generated by bandwidth vibration and a large number of free time slots caused by frequent bandwidth application. The time slots are fairly distributed, bandwidth vibration caused by frequent bandwidth application is reduced, the number of the free time slots generated in the time slot distribution process is reduced, time slot waste is avoided to the maximum, transmission efficiency and service quality of a network are improved, and the time slot distribution method is especially suitable for distributing the time slots for the synchronizing Mesh network based on a multi-sector array antenna.
Description
Technical field
The present invention relates to a kind of slot allocation method of synchronizing network, specifically the slot allocation method of synchronous radio Mesh network.
Background technology
Wireless Mesh netword (Wireless Mesh Network) is the distributed network of a kind of high power capacity, high bandwidth, can regard the fusion of WLAN (wireless local area network) WLAN and Ad hoc mobile ad-hoc network as, and bring into play both advantages.Wireless Mesh netword can be realized the radio communication of multi-hop (Multi-Hops) in a wide zone, its networking fast, arrange net flexibly, survivability is strong, safeguard easily, stability is high, becomes one of key technology of Next-Generation Wireless Communication Systems.Synchronous Mesh network based on many fan region array antennas is different from general wireless Mesh netword, and it is a kind of advanced form of wireless Mesh netword, and the networking technology aspect adopts the technical system that " space division multiplexing "+" time division multiplexing " combines.Adopt many fan region array antennas technology and high speed antenna scanning technology, make it there is the feature of " space division multiplexing "; Adopt the synchronous network technology, make it there is again the feature of " time division multiplexing ".The combination of these two large features makes this wireless Mesh netword be different from other wireless Mesh netword technology, it can control with coordination network in the transmission that simultaneously occurs, reduce conflict and competition in network, and can improve spatial domain and spectrum reuse rate, higher network throughput and extensibility is provided.In synchronous Mesh network based on many fan region array antennas, mainly contain two large category nodes: gateway node GN(Gateway Node) and backbone node BN(Backbone Node).Gateway node GN mainly realizes the system management of the whole network, comprises the clock synchronous of network and slot synchronization, network topology management, address assignment, can also realize the access in radio function, is provided to the access capability of higher level's network simultaneously.Backbone node BN close fit gateway node GN, coordinate the time slot allocation of its upstream and downstream node, but be mainly the coverage of being responsible for extending network, and user's wire/wireless access function is provided.In this wireless Mesh netword, node is used effective distribution of time slot very crucial for the service quality height of whole network, especially for the real-time of voice, video information and continuity transmission, more needs the uniformity of time slot allocation.
In existing patent documentation CN102196578A, a kind of cross timeslot allocation method for wireless sensor network is disclosed, the cross time-slot piece distribution method of the service based grade weighting in this scheme is that the node that the grade of service is high distributes more time slot, but the general reflection of the grade of service of node be the class of service of this node carrying or in network topology structure the importance size of residing position, but can not reflect that the traffic carrying capacity of node carrying is how many.The grade of service of certain node in network is not high, when but traffic carrying capacity is but very large, time slot allocation principle according to this scheme, this node will be got less time slot, cause the business of this node to be difficult to complete transmission in the continuous slot of getting, thereby need bandwidth application continually, cause the vibration of bandwidth; Otherwise the grade of service of certain node in network is higher, but traffic carrying capacity is but seldom the time, time slot allocation principle according to this scheme, this node will be got more time slot, after this node finishing service transmission, still have a large amount of free timeslots, cause the waste of time slot.
Summary of the invention
For this reason, the slot allocation method that technical problem to be solved by this invention is service based grade in prior art causes bandwidth vibration and a large amount of free timeslots to cause the problem of time slot waste because of bandwidth application frequently, thereby propose a kind ofly can distribute liberally time slot, reduce the slot allocation method of the synchronous Mesh network of bandwidth vibration and free timeslot.
For solving the problems of the technologies described above, the invention provides a kind of slot allocation method of synchronous Mesh network.
Comprise the steps:
(1) each node calculates according to the traffic carrying capacity size of oneself number of timeslots needed;
(2) described node generates the time slot solicitation message and sends to his father's node according to required number of timeslots;
(3), after described father node is collected the time slot solicitation message, unified is its all child nodes distribution time slot;
(4) described father node generates time slot allocation bag as a result, and issues each child node.
In described step (1), described traffic carrying capacity size calculates according to the traffic carrying capacity in historical traffic and current data buffering area.
The method of described computing service amount size is as follows:
Traffic carrying capacity TN
icomputing formula as follows:
TN
i=λ (T
forward i+ T
abandon i)/t+(1-λ) * T
bi/ (D * δ)
Wherein,
TN
itraffic carrying capacity size for node i;
λ is weighted factor, between span 0～1;
T
forward ifor the traffic carrying capacity of all forwardings of node i, in historical statistics time t;
T
abandon ithe traffic carrying capacity that sends for node i is all unsuccessfully and abandon, in historical statistics time t;
T
bifor meaning traffic carrying capacity to be sent in node i current business buffering area;
The restriction of queuing time that D is traffic carrying capacity to be sent, or send the time for the long hair of queue traffic;
δ is for carrying out the time slot service efficiency of transfer of data.
In described step (3), the unified method for child node distribution time slot is as follows:
When the time slot demand sum of each child node surpasses the total amount that father node can distribute, father node is according to the actual time slot demand assignment time slot of each child node;
When the time slot demand sum of each child node surpasses the total amount that oneself can distribute, father node distributes corresponding time slot to each child node according to the ratio of the shared time slot demand of the time slot demand sum of each child node.
In described step (3), adopt the time slot demand that first meets father node self to meet again the allocation strategy of the time slot demand of its child node.
Front in step (1), new node, in the networking stage, adopts initial time slot allocation scheme, for carrying out the interworking of the protocol datas such as link-quality test and networking authentication.
In described step (1) before, also comprise initial time slot allocation step.Described initial time slot allocation scheme is, the father node of new node is according to the number of own child node, and all energy are distributed to new network access node for the average magnitude of the timeslot number of communicating by letter with child node.
Technique scheme of the present invention has the following advantages compared to existing technology:
(1) slot allocation method of synchronous Mesh network of the present invention comprises the steps: 1) each node calculates the number of timeslots of needs according to own traffic carrying capacity size; 2) described node generates the time slot solicitation message and sends to his father's node according to required number of timeslots; 3), after described father node is collected the time slot solicitation message, unified is its all child nodes distribution time slot; 4) described father node generates time slot allocation bag as a result, and issues each child node.Father node carries out rational time slot allocation according to the traffic carrying capacity size of each child node like this, distribute more time slot to the large node of traffic carrying capacity, the node that traffic carrying capacity is little distributes less time slot, realized fairization of time slot allocation, reduce the bandwidth vibration because the bandwidth application causes frequently, reduce the free timeslot quantity produced in the time slot allocation process, farthest avoid time slot waste, effectively improved efficiency of transmission and the service quality (QoS) of network.
(2) the traffic carrying capacity size in the slot allocation method of synchronous Mesh network of the present invention calculates according to the traffic carrying capacity in historical traffic and current data buffering area, traffic carrying capacity size TN
icomputing formula be: TN
i=λ (T
forward i+ T
abandon i)/t+(1-λ) * T
bi/ (D * δ), wherein λ is weighted factor, between span 0～1, the technical staff can be arranged according to specific needs, can consider like this impact on the node transmission of historical traffic and current business amount, improve the accuracy that traffic carrying capacity is calculated, avoid the bandwidth vibration.
(3) slot allocation method of synchronous Mesh network of the present invention adopts and first meets the time slot allocation strategy that father node meets child node again.In wireless Mesh netword, except root node GN and leaf node, each backbone node BN has the dual identity of father node and child node, when distributing time slot, the child node that this node is oneself must follow the time slot allocation wish of own father node, the time slot distributed for child node does not so affect the time slot of father node for oneself distributing, and avoids bandwidth application frequently to cause the bandwidth concussion.
(4) slot allocation method of synchronous Mesh network of the present invention, in the networking stage of new node, adopts initial time slot allocation scheme, for carrying out the interworking of the protocol datas such as link-quality test and networking authentication.Described initial time slot allocation scheme is, the father node of new node is according to the number of own child node, all energy are distributed to new network access node for the average magnitude of the timeslot number of communicating by letter with child node, the quick networking of new node can be guaranteed like this, stability and the continuation of other brotgher of node communication bandwidth can be maintained again.
The accompanying drawing explanation
For content of the present invention is more likely to be clearly understood, below according to a particular embodiment of the invention and by reference to the accompanying drawings, the present invention is further detailed explanation, wherein
Fig. 1 is based on the time slot allocation schematic diagram of the synchronous Mesh network of many fan region array antennas;
Fig. 2 is the schematic diagram of synchronous Mesh network frame structure;
Fig. 3 is the schematic diagram of new network access node time slot allocation flow process;
Fig. 4 is the schematic diagram of network access node time slot allocation flow process.
Embodiment
The present embodiment provides a kind of slot allocation method of the synchronous Mesh network based on many fan region array antennas.Include two large category nodes in synchronous Mesh network based on many fan region array antennas, wherein a category node is gateway node GN, and an other category node is backbone node BN, and as shown in Figure 1, GN is gateway node, i.e. root node, BN1, BN2 ... BN5 is backbone node.In the present embodiment, the number of backbone node is 5, the execution mode that can convert as other, and the number of backbone node can arrange the arbitrary finite number according to actual needs.The antenna of each node all adopts many fan region array antennas, the quantity of fan antenna is that N(N generally equals 3,4,6,8,10,12,15,18 ...), in the present embodiment, N equals 12, the execution mode that can convert as other, described N can arrange as required, as selected to be set to 8 or 10.N fan antenna realizes 360
0omnidirectional cover.
The frame structure of synchronous Mesh network as shown in Figure 2, mainly by 1 second frame, minute frame, subframe, time slot and timeslice (or claiming mini-slot) form.
1 second frame: by k minute frame, (numbering: 0～k-1) form, the duration of each minute frame is the 1000/k millisecond.
Divide frame: by j subframe, (numbering: 0～j-1) form, the duration of each subframe is 10 milliseconds, and therefore, k * j=100, get k=10, j=10 in the present embodiment.The execution mode that can convert as other, described k, j, under the condition that meets k * j=100, can arrange as required, as selected to be set to k=20, j=5.
Subframe: by 10 time slots, (numbering: 0～9) form, the duration of each time slot is 1 millisecond.
Time slot: 1 time slot and then can be divided into 10 mini-slot, each mini-slot is 100 microseconds.The type of time slot has 3 kinds, respectively: Hello time slot, competition slot, non-competing time slot.
Hello time slot: greet bag for the treatment of Hello, network for new node;
Competition slot: be averagely allocated to the array antenna of each sector, receive the time slot request bag of child node for father node, obtain the chance that sends data for child node;
Non-competing time slot: safeguard for the internodal data traffic transmission of father and son and communication link.
In Fig. 2, the 1st time slot (time slot 0) of subframe 0 is the Hello time slot, and 9 time slots of back are non-competing time slot;
The 1st time slot (time slot 0) of all the other subframes (numbering 1～j-1) is competition slot, and 9 time slots of back are non-competing time slot;
In 9 non-competing time slots in each subframe: front 2 time slots (time slot 1, time slot 2) are inseparable timing gap, for each level node of wireless Mesh netword, monitor its father node; Rear 7 time slots (time slot 3～time slot 9) are for can distribute time slot.
For above-mentioned assignable time interval resource, adopt the slot allocation method of synchronous Mesh network of the present invention, be the slot allocation method of the synchronous Mesh network based on many fan region array antennas herein, comprise the steps:
(1) each node calculates according to the traffic carrying capacity size of oneself number of timeslots needed, and in Fig. 1, GN is root node, BN1, and BN2, BN3 is the child node of GN, BN4, BN5 is the child node of BN3;
(2) child node BN1, BN2 ... BN5 generates the time slot solicitation message according to required number of timeslots, and sends to its father node in competition slot;
(3) father node GN, BN3 collects the time slot solicitation message of child node in competition slot, and can distribute the total quantity unification of time slot to distribute time slot for its all child node according to it;
(4) father node GN, BN3 generates time slot allocation bag as a result, and issues each child node.
The present embodiment provides a kind of slot allocation method of synchronous Mesh network, comprises the steps:
(1) new node in the time slot allocation flow process in the stage that networks as shown in Figure 3, determine father node by intercepting the Hello broadcast packet, its father node adopts initial time slot allocation scheme to distribute time slot for this new node, for carrying out the interworking of the protocol datas such as link-quality test and networking authentication.Described initial time slot allocation scheme is, the father node of new node is according to the number of own child node, and all energy are distributed to new network access node for the average magnitude of the timeslot number of communicating by letter with child node.
(2) node after the networking adopts the time slot allocation scheme of the network access node shown in Fig. 4, each node calculates according to the traffic carrying capacity size of oneself number of timeslots needed, and described traffic carrying capacity size calculates according to the traffic carrying capacity in historical traffic and current data buffering area.
The computing formula that traffic carrying capacity is concrete is as follows:
TN
i=λ (T
forward i+ T
abandon i)/t+(1-λ) * T
bi/ (D * δ) (1)
In formula (1),
TN
itraffic carrying capacity for node i;
λ is weighted factor, and between span 0～1, in the present embodiment, λ gets 0.5, and the execution mode that can convert as other can arrange as required flexibly;
T
forward ifor the traffic carrying capacity of all forwardings of node i, in historical statistics time t, described historical statistics time t is before current time one section fixedly duration, and those skilled in the art can be arranged as required;
T
abandon ithe traffic carrying capacity that sends for node i is all unsuccessfully and abandon, in historical statistics time t, described historical statistics time t is before current time one section fixedly duration, those skilled in the art can be arranged as required;
T
bifor meaning traffic carrying capacity to be sent in node i current business buffering area;
The restriction of queuing time that D is traffic carrying capacity to be sent, or send the time for the long hair of queue traffic;
δ is for carrying out the time slot service efficiency of transfer of data.
In every 1 second frame, the message transmission rate in 1 transfer of data time slot (1ms) is:
V=V
modulation* δ/N (2)
In formula (2):
The V modulation means the modulation rate of Wireless Mesh physical layer;
δ is for carrying out the time slot service efficiency of transfer of data;
N means the whole assignable number of time slots comprised in 1 second frame period.
So the needed number of time slots of node i is:
N
i = TN
i / V （3）
If father node has k child node, need to calculate respectively N
1,n
2,n
k.
(3) described child node is according to required number of timeslots N
i(i=1,2 ... k) generate time slot application bag and send to his father's node.
(4) after described father node is collected time slot application bag, reply time slot Requisition Validation bag, and unification distributes time slot for its all child node.
When the time slot demand sum of each child node surpasses the total amount that father node can distribute, i.e. N
1+ N
2+ ... + N
k≤ N, father node is according to the actual time slot demand assignment time slot of each child node;
When the time slot demand sum of each child node surpasses the total amount that oneself can distribute, i.e. N
1+ N
2+ ... + N
k>N, father node is distributed according to the ratio of the shared time slot demand of the time slot demand sum of each child node, so, child node i divide timeslot number be:
N
i’ = N×N
i /（N
1 + N
2 +…+ N
k） （4）
In formula (4):
N is the whole assignable number of time slots comprised in 1 second frame period.
Adopt and first meet the time slot allocation strategy that father node meets child node again, when distributing time slot, the child node that this node is oneself must follow the time slot allocation wish of own father node, the time slot distributed for child node does not so affect the time slot of father node for oneself distributing, namely child node is paid the utmost attention to the time slot demand with its father node, puts the time slot demand of considering again child node and its Sun Jiedian before this.
(5) described father node generates time slot allocation bag as a result, and issues one by one each child node, and each child node is replied the time slot allocation renewal and confirmed that bag is confirmed.
The execution mode that can convert as other, the above-mentioned time slot of executing in example can be also bandwidth, synchronous Mesh network can carry out allocated bandwidth according to the slot allocation method in above-described embodiment.
Obviously, above-described embodiment is only for example clearly is described, and is not the restriction to execution mode.For those of ordinary skill in the field, can also make other changes in different forms on the basis of the above description.Here exhaustive without also giving all execution modes.And the apparent variation of being extended out thus or change are still among the protection range in the invention.
Claims (7)
1. the slot allocation method of a synchronous Mesh network, is characterized in that, comprises the steps:
(1) each node calculates according to the traffic carrying capacity size of oneself number of timeslots needed;
(2) described node generates the time slot solicitation message and sends to his father's node according to required number of timeslots;
(3), after described father node is collected the time slot solicitation message, unified is its all child nodes distribution time slot;
(4) described father node generates time slot allocation bag as a result, and issues each child node.
2. the slot allocation method of synchronous Mesh network according to claim 1, is characterized in that, in described step (1), described traffic carrying capacity size calculates according to the traffic carrying capacity in historical traffic and current data buffering area.
3. the slot allocation method of synchronous Mesh network according to claim 1 and 2, is characterized in that, the method for described computing service amount size is as follows:
Traffic carrying capacity TN
icomputing formula as follows:
TN
i=λ (T
forward i+ T
abandon i)/t+(1-λ) * T
bi/ (D * δ)
Wherein,
TN
itraffic carrying capacity size for node i;
λ is weighted factor, between span 0～1;
T
forward ifor the traffic carrying capacity of all forwardings of node i, in historical statistics time t;
T
abandon ithe traffic carrying capacity that sends for node i is all unsuccessfully and abandon, in historical statistics time t;
T
bifor meaning traffic carrying capacity to be sent in node i current business buffering area;
The restriction of queuing time that D is traffic carrying capacity to be sent, or send the time for the long hair of queue traffic;
δ is for carrying out the time slot service efficiency of transfer of data.
4. according to the slot allocation method of the described synchronous Mesh network of arbitrary claim in claim 1-3, it is characterized in that: in described step (3), the unified method for child node distribution time slot is as follows:
When the time slot demand sum of each child node surpasses the total amount that father node can distribute, father node is according to the actual time slot demand assignment time slot of each child node;
When the time slot demand sum of each child node surpasses the total amount that oneself can distribute, father node distributes corresponding time slot to each child node according to the ratio of the shared time slot demand of the time slot demand sum of each child node.
5. according to the slot allocation method of the described synchronous Mesh network of arbitrary claim in claim 1-4, it is characterized in that, in described step (3), adopt the time slot demand that first meets father node self to meet again the allocation strategy of the time slot demand of its child node.
6. according to the slot allocation method of the described synchronous Mesh network of arbitrary claim in claim 1-5, it is characterized in that, front in step (1), new node is in the networking stage, adopt initial time slot allocation scheme, for carrying out the interworking of link-quality test and networking authentication protocol data.
7. according to the slot allocation method of the described synchronous Mesh network of arbitrary claim in claim 1-6, it is characterized in that, in described step (1) before, also comprise initial time slot allocation step, described initial time slot allocation scheme is, the father node of new node is according to the number of own child node, and all energy are distributed to new network access node for the average magnitude of the timeslot number of communicating by letter with child node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013103242722A CN103442440A (en) | 2013-07-30 | 2013-07-30 | Time slot distribution method for synchronizing Mesh network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013103242722A CN103442440A (en) | 2013-07-30 | 2013-07-30 | Time slot distribution method for synchronizing Mesh network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103442440A true CN103442440A (en) | 2013-12-11 |
Family
ID=49696088
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2013103242722A Pending CN103442440A (en) | 2013-07-30 | 2013-07-30 | Time slot distribution method for synchronizing Mesh network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103442440A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105959921A (en) * | 2016-07-20 | 2016-09-21 | 矽力杰半导体技术(杭州)有限公司 | Network controller, node equipment and grid network system with network controller and node equipment |
| CN112600732A (en) * | 2020-12-09 | 2021-04-02 | 广州技象科技有限公司 | Data transmission method, device and system based on data margin and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008070871A2 (en) * | 2006-12-07 | 2008-06-12 | Misonimo Chi Acquisition L.L.C. | System and method for timeslot and channel allocation |
| WO2009046143A2 (en) * | 2007-10-01 | 2009-04-09 | Powerwave Cognition, Inc. | Mobile ad hoc networking systems and methods |
| CN101409660A (en) * | 2008-08-14 | 2009-04-15 | 宁波中科集成电路设计中心有限公司 | Channel access control method for wireless sensor network |
| US20090279496A1 (en) * | 2008-05-07 | 2009-11-12 | Majid Raissi-Dehkordi | Dedicated and priority based allocation in multi-hop wireless systems |
| CN102196578A (en) * | 2011-05-30 | 2011-09-21 | 北京理工大学 | Cross timeslot allocation method for wireless sensor network |
-
2013
- 2013-07-30 CN CN2013103242722A patent/CN103442440A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008070871A2 (en) * | 2006-12-07 | 2008-06-12 | Misonimo Chi Acquisition L.L.C. | System and method for timeslot and channel allocation |
| WO2009046143A2 (en) * | 2007-10-01 | 2009-04-09 | Powerwave Cognition, Inc. | Mobile ad hoc networking systems and methods |
| US20090279496A1 (en) * | 2008-05-07 | 2009-11-12 | Majid Raissi-Dehkordi | Dedicated and priority based allocation in multi-hop wireless systems |
| CN101409660A (en) * | 2008-08-14 | 2009-04-15 | 宁波中科集成电路设计中心有限公司 | Channel access control method for wireless sensor network |
| CN102196578A (en) * | 2011-05-30 | 2011-09-21 | 北京理工大学 | Cross timeslot allocation method for wireless sensor network |
Non-Patent Citations (3)
| Title |
|---|
| MAOTAO XIE，ET.AL.: "An Energy-Efficient TDMA Protocol for Clustered Wireless Sensor Networks", 《2008 ISECS INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT》, 4 August 2008 (2008-08-04) * |
| 张昱晖等: "一种新型STDMA数据链系统时隙分配模型", 《通信技术》, 30 June 2009 (2009-06-30) * |
| 聂建耀等: "一种应用于Ad Hoc网络的改进型TDMA动态时隙分配算法", 《移动通信》, 31 October 2008 (2008-10-31) * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105959921A (en) * | 2016-07-20 | 2016-09-21 | 矽力杰半导体技术(杭州)有限公司 | Network controller, node equipment and grid network system with network controller and node equipment |
| CN105959921B (en) * | 2016-07-20 | 2019-11-22 | 矽力杰半导体技术(杭州)有限公司 | Network controller, node device and apply its mesh network system |
| CN112600732A (en) * | 2020-12-09 | 2021-04-02 | 广州技象科技有限公司 | Data transmission method, device and system based on data margin and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jin et al. | A centralized scheduling algorithm for IEEE 802.15. 4e TSCH based industrial low power wireless networks | |
| Rajendran et al. | Energy-efficient, application-aware medium access for sensor networks | |
| Kim et al. | Urban-X: Towards distributed channel assignment in cognitive multi-radio mesh networks | |
| CN103703844A (en) | Dynamic common broadcast schedule parameters for overlaying an independent unicast schedule | |
| Gaugel et al. | In-depth analysis and evaluation of self-organizing TDMA | |
| CN101790196A (en) | Correlation method of distributed access point in wireless Mesh network | |
| Jin et al. | Routing and packet scheduling in WiMAX mesh networks | |
| Fadlullah et al. | Cooperative QoS control scheme based on scheduling information in FiWi access network | |
| CN105744641A (en) | Directional time-division link scheduling method applicable to wireless mesh network | |
| Cheng et al. | QoS-driven MAC-layer resource allocation for wireless mesh networks with non-altruistic node cooperation and service differentiation | |
| CN103442440A (en) | Time slot distribution method for synchronizing Mesh network | |
| Liu et al. | A hybrid method of CSMA/CA and TDMA for real-time data aggregation in wireless sensor networks | |
| CN103442424A (en) | Method and system for synchronizing access node clock of synchronization Mesh network based on channel associated signaling | |
| Mansoor et al. | CoAd: A cluster based adhoc cognitive radio networks architecture with broadcasting protocol | |
| Chang et al. | Throughput enhancement by exploiting spatial reuse opportunities with smart antenna systems in wireless ad hoc networks | |
| Haneef et al. | Comparative analysis of classical routing protocol LEACH and its updated variants that improved network life time by addressing shortcomings in Wireless Sensor Network | |
| Wang et al. | Collaborative routing, scheduling and frequency assignment for wireless ad hoc networks using spectrum-agile radios | |
| Siraj et al. | Link establishment and performance evaluation in IEEE 802.16 wireless mesh networks | |
| Ramamurthi et al. | Optimal capacity allocation in wireless mesh networks | |
| Huang et al. | Exploiting the capacity of multichannel multiradio wireless mesh networks | |
| Lee et al. | Achieving throughput fairness in wireless mesh networks based on IEEE 802.11 | |
| Kas et al. | Utilization-based dynamic scheduling algorithm for wireless mesh networks | |
| de Oliveira et al. | Channel assignment strategies for optimal network capacity of IEEE 802.11 s | |
| Tang et al. | End-to-end rate allocation in multi-radio wireless mesh networks: cross-layer schemes | |
| Deng et al. | A load balance link layer protocol for multi-channel multi-interface wireless mesh 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20131211 |
|
| RJ01 | Rejection of invention patent application after publication |