CN104734798A - Method for rapidly decomposing time gap conflicts in distributed type TDMA protocol - Google Patents
Method for rapidly decomposing time gap conflicts in distributed type TDMA protocol Download PDFInfo
- Publication number
- CN104734798A CN104734798A CN201510170031.6A CN201510170031A CN104734798A CN 104734798 A CN104734798 A CN 104734798A CN 201510170031 A CN201510170031 A CN 201510170031A CN 104734798 A CN104734798 A CN 104734798A
- Authority
- CN
- China
- Prior art keywords
- node
- time slot
- slot
- sinr
- 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
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method for rapidly decomposing time gap conflicts in a distributed type TDMA protocol. The method mainly solves the problem that in an Ad Hoc network, due to the time gap conflicts, the transmission efficiency and channel utilization rate are decreased. The method includes the steps that firstly, a node has access to a network and is marked with a time gap type; secondly, when receiving a correct packet during a receiving time gap, the node calculates prediction parameters according to the physical layer parameters of the packet and conducts conflict forecasting decomposition if the prediction parameters meet the conflict prediction conditions; thirdly, when receiving a wrong packet during the receiving time gap, the node conducts conflict decomposition if physical layer parameters of the packet meet the conflict conditions; fourthly, when receiving no packet during the receiving time gap or receiving a correct packet during an idle time gap, the node renews a time gap list. The cross-layer design is introduced, and therefore the time gap conflicts are more efficiently predicted and detected, the network transmission efficiency and channel utilization rate are increased, and the method can be used for the distributed type self-organized network.
Description
Technical field
The invention belongs to communication technical field, particularly a kind of decomposition method of time slot collision, be applicable to TDMA agreement in mobile Ad Hoc network, under the condition meeting network demand, effectively improve transmission performance and the channel utilization of network.
Background technology
Ad Hoc network is a kind of novel wireless self-organization network, different with WLAN (wireless local area network) from conventional cellular network, it is made up of one group of mobile node with wireless transmitter, do not need the base station fixed or control centre, it is a kind of distributed network structure, can at any time, any place fast assembling wireless network, therefore receive increasing concern in recent years.
Because Ad Hoc network is a kind of multihop network, traditional competition multi-access mode, the Throughput as CSMA/CA agreement is low, access delay is uncontrollable.Therefore, both at home and abroad most by dynamic TDMA protocol application in Ad Hoc network.But, due to features such as the dynamic change of Ad Hoc network topological structure, TDMA protocol timeslot are multiplexing, in Ad Hoc network, inevitably there is the problem of conflict.Distributed T DMA time slot collision causes the transmission performance of network and channel utilization to decline, and its impact should not be underestimated.
For solving time slot collision problem, some paper distributes from tdma slot starts with, expect with more reasonably time slot allocation to reduce time slot collision probability, but this mode often needs the overall topology of network, this is difficult to obtain in distributed network, and if utilize local network topology structure distribute time slot, although improve the utilance of time slot, the time slot collision because node fast moving causes can not be solved.Some method itself is started with from TDMA agreement in addition, combines and avoids time slot collision, but also come with some shortcomings with the carrier sense multiple access CSMA/CA agreement of band conflict avoidance.
The patent application " a kind of micropower wireless self-organization network broadcast communication method " (publication number CN103826316A, application number CN201410062676.3) of Jiangsu Linyang Electronics Co., Ltd. discloses a kind of micropower wireless self-organization network broadcast communication method.The method is for the feature of micropower wireless self-organization network broadcast communication and Problems existing, adopt the technology that CSMA/CA algorithm and TDMA algorithm combine, communication efficiency can be improved when fully promoting broadcast communication reliability, TDMA basis proposes slot synchronization algorithm, node is made to have unique time slot, broadcast data adopts slot synchronization algorithm, child node is made to start slot timer at the end of broadcast data frame receives, for the opportunity forwarding broadcast data frame carries out accurate synchronization, thus avoid conflict when data send to greatest extent.The deficiency that the method exists is: first, the method changes original TDMA agreement, adds the complexity of agreement, well not portable; Secondly, adopt CSMA-CA algorithm, information time delay is excessive, can not adapt to the Ad Hoc network that requirement of real-time is high.
Traditional procotol is according to strict hierarchical design, and interlayer interface is static, does not change with network demand, and each layer hides the complexity of this layer and low layer, is serve upper layers.Hierarchy clear logic, extensibility is high, and robustness is good, easily realizes.But because can not be mutual between non-adjacent layers, or can not carry out mutual between adjacent layer on demand, the information that lower-layer protocols can obtain easily, upper-layer protocol will take very large strength and just can obtain, and this just causes the waste of resource and the repetition of information.Layer and interlayer lack necessary information interaction, cannot realize the optimization of network performance.
Summary of the invention
The object of the invention is to for the deficiencies in the prior art, by carrying out analysis and calculation to obtainable physical layer information, proposing the quick decomposition method of time slot collision in a kind of Distributed T DMA agreement, to improve transmission performance and the channel utilization of network.
Technical scheme of the present invention is achieved in that
One. know-why
In Wireless Ad Hoc network, the mobility of node can have influence on the operation of each layer of procotol, causes various network problem, and cross layer design can the information of mutual each interlayer, solve the problem in single layer network better, the optimization for network performance has more significant effect.Equally, in Ad Hoc network, the time slot collision problem of MAC layer TDMA agreement also solves by cross layer design.The present invention utilizes the cross-layer information of physical layer just, predicts exactly and detects the generation of time slot collision and decompose in time.
Two. implementation:
In Distributed T DMA agreement of the present invention, the quick decomposition method of time slot collision, comprises the steps:
(1) node networks at the time point of random setting, set up the slot table of this node and intercept channel, receive one and jump the broadcast packet sent of neighbors, obtain one jump neighbors take this node double bounce neighbors comprised in time slot and broadcast packet take time slot;
(2) time slot that a jumping and double bounce neighbors take is recorded in the slot table of this node, in slot table, Stochastic choice one has been jumped by one and the unduplicated time slot of time slot that double bounce neighbors takies with all, be labeled as sending time slots, the time slot that one jumping neighbors takies is labeled as receiving slot, and the time slot take double bounce neighbors and unappropriated time slot are labeled as free timeslot;
Every class time slot comprises medium wave and data segment, and each node sends broadcast packet at the medium wave of sending time slots, and each node sends packet at the data segment of sending time slots;
(3) as certain node N in network
jclock wheel when forwarding the medium wave of a certain time slot k to, check this node slot time table, obtain time slot k, and carry out different operating according to the time slot type obtaining time slot k: if receiving slot, then perform step (4), if free timeslot, then perform step (5);
(4) node N
jin the medium wave finish time of time slot k, check the reception condition of broadcast packet: if correctly wrap, then perform step (6) and (7), if erroneous packets, then perform step (8), if do not receive bag, then perform step (9);
(5) node N
jin the medium wave finish time of time slot k, check the reception condition of broadcast packet: if correctly wrap, then perform step (10), if erroneous packets or do not receive bag, then do not process;
(6) this received power P correctly wrapped is obtained from physical layer
r, Signal to Interference plus Noise Ratio SINR be recorded in slot table, according to Signal to Interference plus Noise Ratio formula S INR=10log
10[P
r/ P
c] calculate interference power P
cand be recorded in slot table, all record physical layer information when time slot k receives correct bag, at most record 20 groups of data, for when continuing record more than 20 groups of needs, then by the data that this data cover record time is the longest at every turn;
(7) based on the n recorded in time slot k list item in slot table to interference power P
cwith received power P
r, n<=20, utilizes Winener's prediction, predicts that next round time slot k receives the predicted interference power P of bag respectively
cvwith prediction received power P
rv, according to Signal to Interference plus Noise Ratio formula S INR=10log
10[P
r/ P
c] calculate prediction Signal to Interference plus Noise Ratio SINR
v, will received power P be predicted
rvwith prediction Signal to Interference plus Noise Ratio SINR
vthresholding P is predicted respectively with received power
vtwith Signal to Interference plus Noise Ratio prediction thresholding SINR
vtrelatively, if P
rv> P
vt, SINR
v< SINR
vt, show that the increase disturbed is about to cause the conflict of time slot, then carry out conflict prediction decomposition, otherwise do not process;
(8) the received power P of this erroneous packets is obtained from physical layer
r, Signal to Interference plus Noise Ratio SINR, by received power P
rwith Signal to Interference plus Noise Ratio SINR respectively with received power thresholding P
rtwith Signal to Interference plus Noise Ratio thresholding SINR
trelatively, if P
r> P
rt, SINR < SINR
t, showing to fail correct receiving package is existence due to time slot collision, then carry out collision decomposition, otherwise do not process;
(9) do not receive bag, show that the jumping neighborhood information taking time slot k lost efficacy, node N
jupgrade slot table, the jumping neighborhood information being about to take time slot k is deleted from slot table;
(10) node N
jgap k receives correct bag at one's leisure, and showing has new node to become a hop neighbor node of this node, node N
jupgrade slot table, be labeled as receiving slot by time slot k, obtain this received power P correctly wrapped from physical layer
r, Signal to Interference plus Noise Ratio SINR being recorded in slot table.
The present invention compared with prior art tool has the following advantages:
1. invention introduces cross layer design, by obtaining and analyzing physical layer information, the motion state of nodes can be obtained, utilize the motion state of node to predict imminent time slot collision, change time slot in advance to avoid the generation of time slot collision, significantly improve the transmission performance of network;
2. in the present invention by obtaining and analyzing physical layer information, accurately and timely can judge the generation of time slot collision, decompose time slot collision rapidly, the impact of time slot collision is reduced as much as possible, ensure that the utilance of channel in network.
3. time slot collision of the present invention detects in Sum decomposition module accessible site embedding conventional allocation formula TDMA agreement, has good transplantability.
Accompanying drawing explanation
Fig. 1 of the present inventionly realizes general flow chart;
Fig. 2 is the sub-process figure that in the present invention, conflict prediction decomposes;
Fig. 3 is the sub-process figure of collision decomposition in the present invention.
Embodiment
Below in conjunction with accompanying drawing, content of the present invention is described in detail.
With reference to Fig. 1, performing step of the present invention is as follows:
Step 1: node networks.
Node networks at the time point of random setting, sets up the slot table of this node and intercepts channel, receives one and jumps the broadcast packet that neighbors sends, obtain one jump neighbors take this node double bounce neighbors comprised in time slot and broadcast packet take time slot.
Step 2: mark time slot type.
Jump one and the time slot that takies of double bounce neighbors is recorded in the slot table of this node, in slot table, Stochastic choice one has been jumped by one and the unduplicated time slot of time slot that double bounce neighbors takies with all, is labeled as sending time slots;
The time slot that one jumping neighbors takies is labeled as receiving slot;
The time slot take double bounce neighbors and unappropriated time slot are labeled as free timeslot.
Described sending time slots, receiving slot and free timeslot include medium wave and data segment, and each node sends broadcast packet at the medium wave of sending time slots, and each node sends packet at the data segment of sending time slots.
Described slot table, due to the unduplicated rule of Time Slot Occupancy in double bounce, a hop node and two hop nodes of a certain node may take identical time slot, so slot table should determine unique list item with node serial number.When searching time slot in slot table, if certain time slot is taken by a hop node and two hop nodes simultaneously, then think that this time slot is receiving slot.The structure of slot table is as table one:
Table one time slot list structure
| ID | BS_No | Hop | Node_Level | BS_Class | Lifetime | List_Pr | List_Pi | List_SINR |
In table one, the information of each domain representation is as follows:
ID: record neighbors numbering.Have 40 effective list items at the most in each slot table, call number is 0-39.The information of wherein often opening first list item of slot table is all the information that this node takies time slot.
BS_No: the timeslot number that the neighbors of minute book node takies.
Hop: the jumping figure of record neighbors, the definition of jumping figure is relative, if node directly receives neighbor information, then jumping figure is set to 1 jumping, and the setting of jumping figure for benchmark, is double bounce with this node to the maximum.
Node_Level: this domain representation be the clock stratum of node.The division of clock stratum is the sequencing receiving broadcast packet according to node.
BS_Class: represent the classification that this node takies time slot, 0 represents free timeslot, and 1 represents receiving slot, is conserve space, although sending time slots is also labeled as 0, can judges according to this nodal information, without the need to this territory.
Lifetime: the life cycle referring to this list item.
List_Pr, List_Pi, List_SINR: represent the received power of front n time slot reception information of record, interference noise and Signal to Interference plus Noise Ratio respectively, n<=20, this information only has receiving slot just to have.
Step 3: judge time slot type.
As certain node N in network
jclock wheel when forwarding the medium wave of a certain time slot k to, check the slot table of this node, obtain time slot k, and carry out different operating according to the time slot type obtaining time slot k: if receiving slot, then perform step 4, if free timeslot, then perform step 5.
Step 4: the reception condition judging bag at receiving slot.
Node N
jin the medium wave finish time of time slot k, check the reception condition of broadcast packet: if correctly wrap, then perform step 6 and 7, if erroneous packets, then perform step 8, if do not receive bag, then perform step 9.
Step 5: gap judges the reception condition of bag at one's leisure.
Node N
jin the medium wave finish time of time slot k, check the reception condition of broadcast packet: if correctly wrap, then perform step 10, if erroneous packets or do not receive bag, then do not process.If gap does not correctly receive bag at one's leisure, obviously this time slot is not still taken by neighbors, so do not deal with.
Step 6: the physical layer information of the correct bag of record.
This received power P correctly wrapped is obtained from physical layer
r, Signal to Interference plus Noise Ratio SINR be recorded in slot table, according to Signal to Interference plus Noise Ratio formula S INR=10log
10[P
r/ P
c] calculate interference power P
cand be recorded in slot table, all record physical layer information when time slot k receives correct bag, at most record 20 groups of data, for when continuing record more than 20 groups of needs, then by the data that this data cover record time is the longest at every turn.
Step 7: the prediction Sum decomposition carrying out time slot collision.
7.1) prediction of time slot collision:
7.1a) based on the n recorded in time slot k list item in slot table to interference power P
cwith received power P
r, utilize Winener's prediction to calculate respectively predicted interference power P that next round time slot k receives bag
cvwith prediction received power P
rv, n<=20;
7.1b) according to Signal to Interference plus Noise Ratio formula S INR=10log
10[P
r/ P
c] calculate prediction Signal to Interference plus Noise Ratio SINR
v;
7.1c) received power P will be predicted
rvwith prediction Signal to Interference plus Noise Ratio SINR
vthresholding P is predicted respectively with received power
vtwith Signal to Interference plus Noise Ratio prediction thresholding SINR
vtrelatively, if P
rv> P
vt, SINR
v< SINR
vt, show that the increase disturbed is about to cause the conflict of time slot, predict time slot collision, then carry out conflict prediction decomposition, otherwise do not process.
7.2) decomposition of time slot collision prediction:
With reference to Fig. 2, the step of decomposing conflict prediction is as follows:
7.2a) node N
jthe jumping neighbors N taking time slot k is searched in slot table
i, to clock gap k and node N in the acceptance of the bid of conflict prediction table
iinformation, upgrades the list item of slot table, namely deletes slot table interior joint N
icorresponding list item;
7.2b) as node N
jclock wheel forward the medium wave of sending time slots h to, by the time slot k that marks in conflict prediction table and node N
iin information write broadcast packet, and send broadcast packet;
7.2c) other nodes receive this broadcast packet, judge conflict prediction flag node N wherein
iwhether be this node, if this node, then perform step (7.2d), if not this node, then perform step (7.2e);
7.2d) node N
icheck the slot table of this node, Stochastic choice and all occupied time slots unduplicated time slot t, t ≠ k, be labeled as the sending time slots of oneself, the former time slot k taken be labeled as free timeslot by time slot t;
7.2e) upgrade the slot table of this node, namely delete conflict prediction flag node N in slot table
icorresponding list item.
7.3) received power thresholding P
rtwith Signal to Interference plus Noise Ratio thresholding SINR
tdetermination:
Received power thresholding P
rtwith Signal to Interference plus Noise Ratio thresholding SINR
tall determine according to antenna sensitivity and channel model: namely first calculate received power thresholding P by antenna sensitivity and channel model
rt; Again by received power thresholding P
rtsignal to Interference plus Noise Ratio thresholding SINR is calculated with channel model
t.
Such as: channel model adopts free space propagation model, and the receiving sensitivity of node reception antenna is-95dBm, then according to channel model, can calculate received power thresholding P
rt=10
^(-95/10)=3.1623e-13W;
For Signal to Interference plus Noise Ratio thresholding SINR
tcalculating, then by path loss formula L
p=[C/ (4 π Df
c)]
2be P with received power formula
r=P
sg
txl
pg
rxcan obtain, received power P
rbecome inverse square with transmission range D, then according to communication range 2km and interference range 5km, received power thresholding P can be calculated
rtwith maximum interference power P
cxratio be 6.25, finally by Signal to Interference plus Noise Ratio formula S INR=10log
10[P
r/ P
c] calculate, Signal to Interference plus Noise Ratio thresholding SINR
tfor 7.96dB.
In described formula, L
pfor path loss, f
ccentered by frequency, C is the light velocity, and D is transmission range, P
rfor received power, P
sfor transmitting power, G
txfor transmitting antenna gain, G
rxfor receiving antenna gain.
Received power P
rwith received power thresholding P
rtcomparative result determine node and can receive bag, Signal to Interference plus Noise Ratio SINR and Signal to Interference plus Noise Ratio thresholding SINR
tcomparative result whether determine the bag that node receives correct.
Work as P
r> P
rttime, node can receive packet, otherwise node does not receive packet; As SINR > SINR
ttime, the packet that node receives can by correct demodulation out, and what namely receive is correct bag, otherwise the packet received cannot by correct demodulation out, and what namely receive is erroneous packets.
7.4) received power prediction thresholding P
vtwith Signal to Interference plus Noise Ratio prediction thresholding SINR
vtdetermination:
Received power prediction thresholding P
vtwith Signal to Interference plus Noise Ratio prediction thresholding SINR
vt, all determine according to channel model, interstitial content, joint movements speed and number of time slot: namely first estimate an occupied average time m of time slot by interstitial content and number of time slot; The maximum changing value of received power and interference power in the unit interval is calculated again by the value of m, joint movements speed and channel model; Finally calculate received power by these two changing values and channel model and predict thresholding P
vtwith Signal to Interference plus Noise Ratio prediction thresholding SINR
vt.
Such as: channel model adopts free space propagation model, and interstitial content is 40, and number of time slot is 10, and estimating an occupied average time of time slot is 4, then on average have 3 interfering nodes; By path loss formula L
p=[C/ (4 π Df
c)]
2be P with received power formula
r=P
sg
txl
pg
rxcan obtain, received power P
rinverse square is become with transmission range D; Can calculate according to joint movements speed 70m/s, communication range 2km and interference range 5km, in the unit interval, the maximum changing value of received power is 0.49e-13W again, and in the unit interval, the maximum changing value of interference power is 0.0522e-13W; Last by this two changing values and Signal to Interference plus Noise Ratio formula S INR=10log
10[P
r/ P
c] can calculate, received power prediction thresholding P
vt=3.6523e-13W, Signal to Interference plus Noise Ratio prediction thresholding SINR
t=9.09dB.
Step 8: the detection Sum decomposition carrying out time slot collision.
8.1) detection of time slot collision:
The received power P of this erroneous packets is obtained from physical layer
r, Signal to Interference plus Noise Ratio SINR, by received power P
rwith Signal to Interference plus Noise Ratio SINR respectively with received power thresholding P
rtwith Signal to Interference plus Noise Ratio thresholding SINR
trelatively: if P
r> P
rt, SINR < SINR
t, showing to fail correct receiving package is existence due to time slot collision, time slot collision detected, then carries out collision decomposition, otherwise do not process.
8.2) decomposition of time slot collision:
With reference to Fig. 3, as follows to the step of collision decomposition:
8.2a) node N
jthe jumping neighbors N taking time slot k is searched in slot table
p, to clock gap k and node N in collision table acceptance of the bid
pinformation, upgrades the list item of slot table, namely deletes slot table interior joint N
pcorresponding list item;
8.2b) as node N
jclock wheel forward the medium wave of sending time slots h to, by the time slot k that marks in collision table and node N
pin information write broadcast packet, send broadcast packet;
8.2c) other nodes receive this broadcast packet, judge the node N in conflict tag entry wherein
pwhether be this node:
If not, then upgrade slot table, by taking time slot k in slot table and for node N
plist item delete;
If so, then node is kept out of the way, and empties slot table, again networks, and intercepts channel, and the time slot that record one is jumped and double bounce neighbors takies in slot table, selects and the unduplicated time slot of all occupied time slots, be labeled as the sending time slots of oneself.
Step 9: delete the information lost efficacy in slot table.
If node N
jdo not receive bag at receiving slot k, then may have three kinds of situations: the first situation is a jumping neighbors logout; The second situation is that a jumping neighbors is kept out of the way because of time slot collision; The third situation be a jumping neighbors away from.These three kinds of situations all show that the jumping neighborhood information taking time slot k lost efficacy, then node N
jupgrade slot table, the jumping neighborhood information being about to take time slot k is deleted from slot table.
Step 10: add new information of neighbor nodes in slot table.
If node N
jgap k receives correct bag at one's leisure, and showing has new node to become a hop neighbor node of this node, node N
jupgrade slot table, be labeled as receiving slot by time slot k, obtain this received power P correctly wrapped from physical layer
r, Signal to Interference plus Noise Ratio SINR being recorded in slot table.
More than describing is only example of the present invention; obviously for those skilled in the art; after having understood content of the present invention and principle; all may when not deviating from the principle of the invention, structure; carry out the various correction in form and details and change, but these corrections based on inventive concept and change are still within claims of the present invention.
Claims (5)
1. the quick decomposition method of time slot collision in Distributed T DMA agreement, comprises the steps:
(1) node networks at the time point of random setting, set up the slot table of this node and intercept channel, receive one and jump the broadcast packet sent of neighbors, obtain one jump neighbors take this node double bounce neighbors comprised in time slot and broadcast packet take time slot;
(2) time slot that a jumping and double bounce neighbors take is recorded in the slot table of this node, in slot table, Stochastic choice one has been jumped by one and the unduplicated time slot of time slot that double bounce neighbors takies with all, be labeled as sending time slots, the time slot that one jumping neighbors takies is labeled as receiving slot, and the time slot take double bounce neighbors and unappropriated time slot are labeled as free timeslot;
Every class time slot comprises medium wave and data segment, and each node sends broadcast packet at the medium wave of sending time slots, and each node sends packet at the data segment of sending time slots;
(3) as certain node N in network
jclock wheel when forwarding the medium wave of a certain time slot k to, check this node slot time table, obtain time slot k, and carry out different operating according to the time slot type obtaining time slot k: if receiving slot, then perform step (4), if free timeslot, then perform step (5);
(4) node N
jin the medium wave finish time of time slot k, check the reception condition of broadcast packet: if correctly wrap, then perform step (6) and (7), if erroneous packets, then perform step (8), if do not receive bag, then perform step (9);
(5) node N
jin the medium wave finish time of time slot k, check the reception condition of broadcast packet: if correctly wrap, then perform step (10), if erroneous packets or do not receive bag, then do not process;
(6) this received power P correctly wrapped is obtained from physical layer
r, Signal to Interference plus Noise Ratio SINR be recorded in slot table, according to Signal to Interference plus Noise Ratio formula S INR=10log
10[P
r/ P
c] calculate interference power P
cand be recorded in slot table, all record physical layer information when time slot k receives correct bag, at most record 20 groups of data, for when continuing record more than 20 groups of needs, then by the data that this data cover record time is the longest at every turn;
(7) based on the n recorded in time slot k list item in slot table to interference power P
cwith received power P
r, n<=20, utilizes Winener's prediction, predicts that next round time slot k receives the predicted interference power P of bag respectively
cvwith prediction received power P
rv, according to Signal to Interference plus Noise Ratio formula S INR=10log
10[P
r/ P
c] calculate prediction Signal to Interference plus Noise Ratio SINR
v, will received power P be predicted
rvwith prediction Signal to Interference plus Noise Ratio SINR
vthresholding P is predicted respectively with received power
vtwith Signal to Interference plus Noise Ratio prediction thresholding SINR
vtrelatively, if P
rv> P
vt, SINR
v< SINR
vt, show that the increase disturbed is about to cause the conflict of time slot, then carry out conflict prediction decomposition, otherwise do not process;
(8) the received power P of this erroneous packets is obtained from physical layer
r, Signal to Interference plus Noise Ratio SINR, by received power P
rwith Signal to Interference plus Noise Ratio SINR respectively with received power thresholding P
rtwith Signal to Interference plus Noise Ratio thresholding SINR
trelatively, if P
r> P
rt, SINR < SINR
t, showing to fail correct receiving package is existence due to time slot collision, then carry out collision decomposition, otherwise do not process;
(9) do not receive bag, show that the jumping neighborhood information taking time slot k lost efficacy, node N
jupgrade slot table, the jumping neighborhood information being about to take time slot k is deleted from slot table;
(10) node N
jgap k receives correct bag at one's leisure, and showing has new node to become a hop neighbor node of this node, node N
jupgrade slot table, be labeled as receiving slot by time slot k, obtain this received power P correctly wrapped from physical layer
r, Signal to Interference plus Noise Ratio SINR being recorded in slot table.
2. the quick decomposition method of time slot collision in the Distributed T DMA agreement according to claims 1, the conflict prediction in wherein said step 7 decomposes, and carries out as follows:
(7a) node N
jthe jumping neighbors N taking time slot k is searched in slot table
i, to clock gap k and node N in the acceptance of the bid of conflict prediction table
iinformation, upgrades the list item of slot table, namely deletes slot table interior joint N
icorresponding list item;
(7b) as node N
jclock wheel forward the medium wave of sending time slots h to, by the time slot k that marks in conflict prediction table and node N
iin information write broadcast packet, send broadcast packet;
(7c) other nodes receive this broadcast packet, judge conflict prediction flag node N wherein
iwhether be this node, if this node, then perform step (7d), if not this node, then perform step (7e);
(7d) node N
icheck the slot table of this node, Stochastic choice and all occupied time slots unduplicated time slot t, t ≠ k, be labeled as the sending time slots of oneself, the former time slot k taken be labeled as free timeslot by time slot t;
(7e) upgrade the slot table of this node, namely delete conflict prediction flag node N in slot table
icorresponding list item.
3. the quick decomposition method of time slot collision in the Distributed T DMA agreement according to claims 1, the collision decomposition in wherein said step 8, carries out as follows:
(8a) node N
jthe jumping neighbors N taking time slot k is searched in slot table
p, to clock gap k and node N in collision table acceptance of the bid
pinformation, upgrades the list item of slot table, deletes slot table interior joint N
pcorresponding list item;
(8b) as node N
jclock wheel forward the medium wave of sending time slots h to, by the time slot k that marks in collision table and node N
pin information write broadcast packet, send broadcast packet;
(8c) other nodes receive this broadcast packet, judge the node N in conflict tag entry wherein
pwhether be this node: if not, then perform step (8d), if so, then perform step (8e);
(8d) upgrade slot table, namely delete in slot table and take time slot k and be node N
plist item;
(8e) node N
pkeep out of the way, empty slot table, again network, intercept channel, the time slot that record one is jumped and double bounce neighbors takies in slot table, selects and the unduplicated time slot of all occupied time slots, is labeled as the sending time slots of oneself.
4. the quick decomposition method of time slot collision in the Distributed T DMA agreement according to claims 1, the received power thresholding P in wherein said step 8
rtwith Signal to Interference plus Noise Ratio thresholding SINR
t, all determine according to antenna sensitivity and channel model: namely first calculate received power thresholding P by antenna sensitivity and channel model
rt; Again by received power thresholding P
rtsignal to Interference plus Noise Ratio thresholding SINR is calculated with channel model
t.
5. the quick decomposition method of time slot collision in the Distributed T DMA agreement according to claims 1, the received power prediction thresholding P in wherein said step 7
vtwith Signal to Interference plus Noise Ratio prediction thresholding SINR
vt, all determine according to channel model, interstitial content, joint movements speed and number of time slot: namely first estimate an occupied average time m of time slot by interstitial content and number of time slot; The maximum changing value of received power and interference power in the unit interval is calculated again by the value of m, joint movements speed and channel model; Finally calculate received power by these two changing values and channel model and predict thresholding P
vtwith Signal to Interference plus Noise Ratio prediction thresholding SINR
vt.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510170031.6A CN104734798B (en) | 2015-04-10 | 2015-04-10 | The quick decomposition method of time slot collision in Distributed T DMA agreements |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510170031.6A CN104734798B (en) | 2015-04-10 | 2015-04-10 | The quick decomposition method of time slot collision in Distributed T DMA agreements |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104734798A true CN104734798A (en) | 2015-06-24 |
| CN104734798B CN104734798B (en) | 2017-06-16 |
Family
ID=53458277
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510170031.6A Expired - Fee Related CN104734798B (en) | 2015-04-10 | 2015-04-10 | The quick decomposition method of time slot collision in Distributed T DMA agreements |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104734798B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105873230A (en) * | 2016-03-29 | 2016-08-17 | 南京林洋电力科技有限公司 | Synchronization method for broadband carrier broadcast communication of power line |
| CN109600189A (en) * | 2018-12-11 | 2019-04-09 | 齐俊宇 | Based on time division multiple acess TDMA protocol timeslot dispatching method, self-organizing network control system |
| WO2019141099A1 (en) * | 2018-01-18 | 2019-07-25 | 维沃移动通信有限公司 | Method for channel monitoring, and communication device |
| CN110620631A (en) * | 2018-06-20 | 2019-12-27 | 金铎 | Time division multiplexing network device compatible with other networks |
| CN112954801A (en) * | 2021-02-03 | 2021-06-11 | 山东星通易航通信科技有限公司 | VDES frame mapping table idle time slot searching method based on block division |
| CN113794530A (en) * | 2021-09-09 | 2021-12-14 | 深圳市力合微电子股份有限公司 | Low-power-consumption power wireless communication method based on TDMA |
| WO2022057456A1 (en) * | 2020-09-15 | 2022-03-24 | Oppo广东移动通信有限公司 | Slot updating method, electronic device, and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080137620A1 (en) * | 2006-12-07 | 2008-06-12 | Kiyon, Inc. | System and Method for Timeslot and Channel Allocation |
| CN104427619A (en) * | 2013-09-10 | 2015-03-18 | 富士通株式会社 | Time slot allocation method and device |
-
2015
- 2015-04-10 CN CN201510170031.6A patent/CN104734798B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080137620A1 (en) * | 2006-12-07 | 2008-06-12 | Kiyon, Inc. | System and Method for Timeslot and Channel Allocation |
| CN104427619A (en) * | 2013-09-10 | 2015-03-18 | 富士通株式会社 | Time slot allocation method and device |
Non-Patent Citations (2)
| Title |
|---|
| 一种适用于多跳Ad Hoc网络的增强型协作多址接入协议;张琰，盛敏等;《电子学报》;20110131;全文 * |
| 应用于Ad Hoc网络中的密度自适应泛洪广播策略;盛敏，李建东，史琰;《电子学报》;20040731;全文 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105873230A (en) * | 2016-03-29 | 2016-08-17 | 南京林洋电力科技有限公司 | Synchronization method for broadband carrier broadcast communication of power line |
| WO2019141099A1 (en) * | 2018-01-18 | 2019-07-25 | 维沃移动通信有限公司 | Method for channel monitoring, and communication device |
| CN110062395A (en) * | 2018-01-18 | 2019-07-26 | 维沃移动通信有限公司 | Method and communication equipment for channel sense |
| US11432169B2 (en) | 2018-01-18 | 2022-08-30 | Vivo Mobile Communication Co., Ltd. | Channel sensing method and communication device |
| CN110620631A (en) * | 2018-06-20 | 2019-12-27 | 金铎 | Time division multiplexing network device compatible with other networks |
| CN109600189A (en) * | 2018-12-11 | 2019-04-09 | 齐俊宇 | Based on time division multiple acess TDMA protocol timeslot dispatching method, self-organizing network control system |
| CN109600189B (en) * | 2018-12-11 | 2020-06-30 | 齐俊宇 | Time slot scheduling method based on time division multiple access TDMA protocol and self-organizing network control system |
| CN114268898A (en) * | 2020-09-15 | 2022-04-01 | Oppo广东移动通信有限公司 | Time slot updating method, device and storage medium |
| WO2022057456A1 (en) * | 2020-09-15 | 2022-03-24 | Oppo广东移动通信有限公司 | Slot updating method, electronic device, and storage medium |
| CN114268898B (en) * | 2020-09-15 | 2023-04-18 | Oppo广东移动通信有限公司 | Time slot updating method, device and storage medium |
| CN112954801B (en) * | 2021-02-03 | 2022-04-12 | 山东星通易航通信科技有限公司 | VDES frame mapping table idle time slot searching method based on block division |
| CN112954801A (en) * | 2021-02-03 | 2021-06-11 | 山东星通易航通信科技有限公司 | VDES frame mapping table idle time slot searching method based on block division |
| CN113794530A (en) * | 2021-09-09 | 2021-12-14 | 深圳市力合微电子股份有限公司 | Low-power-consumption power wireless communication method based on TDMA |
| CN113794530B (en) * | 2021-09-09 | 2023-12-01 | 深圳市力合微电子股份有限公司 | TDMA-based low-power consumption micropower wireless communication method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104734798B (en) | 2017-06-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104734798A (en) | Method for rapidly decomposing time gap conflicts in distributed type TDMA protocol | |
| Yadav et al. | Energy aware cluster based routing protocol over distributed cognitive radio sensor network | |
| US7676236B2 (en) | Distributed hierarchical scheduling in an ad hoc network | |
| US8903440B2 (en) | Distributed hierarchical scheduling in an ad hoc network | |
| KR20080113017A (en) | System and method for detecting node mobility based on network topology changes in a wireless communication network | |
| JP2010522487A5 (en) | ||
| Kumar et al. | A localized algorithm for clustering in cognitive radio networks | |
| Wu et al. | Multi-channel and cognitive radio approaches for wireless sensor networks | |
| Leonardi et al. | MRT-LoRa: A multi-hop real-time communication protocol for industrial IoT applications over LoRa networks | |
| Murthy et al. | Energy efficient scheduling in cross layer optimized clustered wireless sensor networks | |
| Liu et al. | CSMAC: A novel DS-CDMA based MAC protocol for wireless sensor networks | |
| Wu et al. | Distributed wake-up scheduling for data collection in tree-based wireless sensor networks | |
| Pan et al. | Event data collection in ZigBee tree-based wireless sensor networks | |
| Rahman et al. | Integrating low-power wide-area networks for enhanced scalability and extended coverage | |
| Hu et al. | A MAC protocol with mobility support in cognitive radio ad hoc networks: Protocol design and analysis | |
| CN102724669B (en) | Routing and time slot distributing method on basis of main user protection in cognitive radio network | |
| Cheng et al. | A low-latency interference coordinated routing for wireless multi-hop networks | |
| Begum et al. | Source Routing for Distributed Big Data‐Based Cognitive Internet of Things (CIoT) | |
| Zeng et al. | Fast neighbor discovery with lightweight termination detection in heterogeneous cognitive radio networks | |
| Chouikhi et al. | Routing-based multi-channel allocation with fault recovery for wireless sensor networks | |
| Kim | A distributed channel assignment control for QoS support in mobile ad hoc networks | |
| Tong et al. | Research on resource efficiency optimization model of TDMA-based distributed wireless ad hoc networks | |
| Uchida et al. | Construction and Maintenance of a Novel Cluster-based Architecture for Ad Hoc Sensor Networks. | |
| Duan et al. | An adaptive RTS/CTS mechanism in IEEE 802.15. 4 for multi-hop networks | |
| Yamao et al. | Cross-layer multi-hopping scheme for efficient and reliable transmission in fading environment |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170616 |