CN107484255A - Preferred channels number determines method in a kind of multichannel CSMA agreements based on frequency packet - Google Patents
Preferred channels number determines method in a kind of multichannel CSMA agreements based on frequency packet Download PDFInfo
- Publication number
- CN107484255A CN107484255A CN201710677528.6A CN201710677528A CN107484255A CN 107484255 A CN107484255 A CN 107484255A CN 201710677528 A CN201710677528 A CN 201710677528A CN 107484255 A CN107484255 A CN 107484255A
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- channel
- base station
- node
- 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
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0808—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
Abstract
The invention discloses preferred channels number in a kind of multichannel CSMA agreements based on frequency packet to determine method, the feature of this method is that base station determines that the node of current base station accesses loading condition by detecting the frequency of cell interior joint Stochastic accessing, each node uses the non-continuous carrier sense multiple access way of multichannel being grouped based on frequency to be communicated with base station, in order to ensure the communication of low time delay between node and base station, base station predicts the average load of lower a period of time according to load situation of change, and then determines the optimal number of channel.
Description
Technical field
The present invention relates to determined most in a kind of non-continuous carrier sense multiple access protocol of multichannel based on frequency packet
The method of the excellent number of channel, belong to Internet of Things radio access technology field.
Background technology
Machine communication is the Internet of things era communication mode the most basic, main to be characterized between large number quipments node solely
Vertical intrusively carries out seamless data exchange without the mankind.The application field of machine communication includes the every aspect of life, such as intelligence
Energy family, wisdom health, intelligent grid and industrial automation etc..The characteristics of maximum of these applications is exactly that number of nodes is very huge
Greatly, for example, in intelligent electric meter field, radius is that ammeter quantity may be up to 35760 in 2km circular cell,
In such environment, how to ensure that great deal of nodes can be successfully accessed the problem of being most important in a short time.
There are many packet access ways for reducing access delay or reducing collision probability at present, it is main to include temporally
Packet, spatially it is grouped and is grouped by frequency.Time division multiple acess is most commonly that in the method being temporally grouped, it is each in which
Node will be assigned to whole bandwidth and part-time.It is common in the way of frequency is grouped in contrast thereto, i.e.,
Frequency division multiple access, in this fashion, each node will be assigned to whole time and partial bandwidth.K.S.KO's et al.
In paper, a kind of method based on space packet is described, it is characterized in that its distance is joined using the node different from base station distance
Numerical value also different feature, the position of different decision nodes is judged according to distance parameter value, so as to be grouped.But above
All there are some defects in several ways, in time division multiple acess and frequency division multiple access, resource distribution mode is fixed, it is impossible to is adapted to
The situation that activation number of nodes changes always in machine communication communication.And the position of node is required in the way of space is grouped
It is changeless, which greatly limits the scope of application, it is well known that there is substantial amounts of mobile node in Internet of Things, because
This this mode can not be applied to machine communication and communicate.
The content of the invention
It is to propose a kind of multichannel based on frequency packet non-continuous carrier sense multiple access association the mesh of the present invention
The method that preferred channels number is determined in view, the non-continuous carrier sense multiple access protocol of multichannel based on frequency packet can drop
The time delay of the low access of node when loading very big in machine communication, this method can be by changing transmission letter according to the size of load
Road number is so that the agreement is constantly in optimal working condition.
It is optimal the invention provides being determined in a kind of non-continuous carrier sense multiple access of multichannel based on frequency packet
The method of the number of channel, its technical scheme are：Base station determines current base station by detecting the frequency of cell interior joint Stochastic accessing
Node accesses loading condition, and each node uses the non-continuous carrier sense multiple access way of multichannel being grouped based on frequency and base
Station is communicated, and in order to which the low time delay ensured between node and base station communicates, base station predicts next section according to load situation of change
The average load of time, and the optimal number of channel is determined, ensure the low time delay of communication.This method comprises the following steps：
(1) base station determines initial preferred channels according to the packet transmission frequency of cell interior joint quantity and each node
Number, and preferred channels number n is broadcasted by downlink broadcast channelopt。
(2) need the node for sending data to intercept downlink broadcast channel, obtain the value of preferred channels number, calculate oneself institute
The channel at place and licensed frequency band, and carried out data transmission using non-continuous carrier sense multiple access protocol.
(1) base station estimates the average load of subsequent period according to the momentary load in a period of time, and average using this
Load calculates the preferred channels number of subsequent period, repeats (2), (3) step, until convergence.
In step (1), the specific method for calculating preferred channels number is：
Wherein,The value of the independent variable n when function obtains minimum value is represented, n represents the number of channel, and D represents data
Bag size, unit kbit, ωmRepresent total bandwidth and the receiving terminal signal to noise ratio as n=1 respectively with SNR.psuccRepresent data
The probability of bag Successful transmissions, packet Successful transmissions need two conditions, are that channel status will when packet is sent respectively
For the free time and within a period of time after data start to send, whole cell can not have other nodes to send data, if another
Node could not listen to channel busy and start to send data, then can produce to conflict with currently transmitted packet causes access to be lost
Lose.Make piAnd psChannel idle and the probability for not having other nodes to send data in transmission a period of time when representing to send respectively,Withpsucc=pi*ps, gnThe load in each channel is represented, computational methods areM represents cell interior joint number, and r represents the frequency of each node application access, and n represents the number of channel.T=τp+δd
+ δ, τpRepresent packet transmission time, δdRepresent that other nodes can listen to the time delay of intercepting of channel busy, δ represents packet from section
Propagation delay of the point to base station.θbAnd θfRepresent there are other nodes to send because of channel busy and after transmission in a period of time respectively
Data and the time wasted when leading to the failure.
In step (2), node channel according to where determining following methods：Each node is then random internally to generate one 0
Random number in the range of to 1, if the random number of generation is in the range of, in first channel, if the random number of generation exists
In the range of when, then in second channel, the like.The computational methods of licensed band are：
fiRepresent the allowed transport frequency range of i-th of channel interior joint, f1And f2The start-stop frequency of whole frequency band is represented respectively
Rate.
In step (3), base station estimates that the formula used in next section of time load is：Wherein g (t)
Represent that base station end is successfully accessed the function that the number of request changes over time, t1And t2The access of base station statistical data packet is represented respectively
Several beginning and ending time points, (t2-t1) it is the time span counted, can be by t in Base station initialization1It is set to 0, t2When being set to statistics
Between section length, thenThe access request being successfully received each second for base station in timing statisticses section, psuccExpression connects
Enter the probability of success, both ratio is that each second, all nodes attempted the number of access in timing statisticses section.
Beneficial effect
1. whole frequency band can be divided into n sub-band by the present invention, node that competition is participated in each sub-band is reduced
Number, the probability being successfully accessed is improved, reduce time delay and improve energy efficiency, spectrum efficiency.
2. the present invention can constantly adjust packet count n, to cause the performance of whole system to be constantly in optimal state,
And then extend the life cycle of whole network.
Brief description of the drawings
Fig. 1 is the machine communication network model figure used in present example.
Fig. 2 is to be determined most in a kind of non-continuous carrier sense multiple access protocol based on frequency packet in present example
Excellent number of channel method flow diagram.
Fig. 3 is that detection node implements uplink random access process figure in present example.
Embodiment
With reference to Figure of description, a kind of non-continuous carrier sense multiple based on frequency packet of the present invention is accessed
Determine that preferred channels counting method example is described in detail in agreement.
Fig. 1 is the machine communication network model figure being applicable in the embodiment of the present invention, as shown in figure 1, the present invention is applied to " base
The machine communication network scenarios of tiny node+detection node ", the type machine communication network scenarios have the special feature that including：
1st, monitoring node is responsible for gathering surrounding enviroment data, and is uploaded to base-station node.
2nd, monitoring node random distribution in machine communication network, can when monitoring node is with base-station node progress data exchange
Direct communication, it is not necessary to via node.
3rd, monitoring node single upload data volume is smaller, and the time of node gathered data has regularity.
4th, monitoring node is cell type equipment, and node limited energy, base station is to the requirement of energy supply unrestriction.
5th, monitoring node possess can hibernation feature, i.e., in network activate node quantity be change.
In present example, suitable for a kind of non-continuous carrier sense multiple based on frequency packet of machine communication communication
Determine that preferred channels counting method needs multiple steps in access protocol.A kind of as shown in Fig. 2 non-continuous load based on frequency packet
Ripple, which is intercepted, determines that the specific implementation process of preferred channels counting method has the following steps in multiple access protocol：
Step 1：Estimate channel loading and initial preferred channels number n is calculated according to formula in base stationopt。
Step 2：Node channel and licensed band according to residing for calculating the channel information received.
Step 3：Each node is carried out according to the ascending resource being assigned to using non-continuous carrier sense multiple access protocol
Row Stochastic accessing.
Step 4：Base station real-time statistics are successfully accessed number.
Step 5：Base station calculates optimal n according to average load at regular intervalsopt。
Step 6：Repeat step two, three, four, five.
In above-mentioned steps one, the present invention is to the computational methods of initial preferred channels number in machine communication communication：
Wherein,The value of the independent variable n when function obtains minimum value is represented, n represents the number of channel, and D represents data
Bag size, unit kbit, ωmRepresent total bandwidth and the receiving terminal signal to noise ratio as n=1 respectively with SNR.psuccRepresent data
The probability of bag Successful transmissions, packet Successful transmissions need two conditions, are that channel status will when packet is sent respectively
For the free time and within a period of time after data start to send, whole cell can not have other nodes to send data, if another
Node could not listen to channel busy and start to send data, then can produce to conflict with currently transmitted packet causes access to be lost
Lose.Make piAnd psChannel idle and the probability for not having other nodes to send data in transmission a period of time when representing to send respectively,Withpsucc=pi*ps, gnThe load in each channel is represented, computational methods areM represents cell interior joint number, and r represents the frequency of each node application access, and n represents the number of channel.T=τp+δd
+ δ, τpRepresent packet transmission time, δdRepresent that other nodes can listen to the time delay of intercepting of channel busy, δ represents packet from section
Propagation delay of the point to base station.θbAnd θfRepresent there are other nodes to send because of channel busy and after transmission in a period of time respectively
Data and the time wasted when leading to the failure.
In step 2, node channel according to where determining following methods：Each node then internally arrive for one 0 by random generation
Random number in the range of 1, if the random number of generation [0,1/n) in the range of when, then in first channel, if generation is random
Number [1/n, 2/n) in the range of when, then in second channel, the like.The computational methods of licensed band are：
fiRepresent the allowed transport frequency range of i-th of channel interior joint, f1And f2The start-stop frequency of whole channel is represented respectively
Rate.
In step 3, each node is when there is data to need to send, with regard to the corresponding frequency of channel usage according to place
The method that band is accessed using non-continuous carrier sense multiple carries out uplink random access.Specific method is as follows, when there is data needs
During transmission, whether node is intercepted has other nodes transmitting data in assigned frequency band, if there is other node-node transmission numbers
According to, then wait for a period of time at random and intercept channel busy-idle condition again, if listening to channel idle, send data immediately, if
Channel is still busy, then is intercepted after continuing waiting for a period of time, untill channel idle sends data immediately.
In step 4 and five, base station estimates that the formula used in next section of time load is：Wherein g
(t) represent that base station end is successfully accessed the function that the number of request changes over time, t1And t2Represent that base station statistical data packet connects respectively
Enter several beginning and ending time points, (t2-t1) it is the time span counted, can be by t in Base station initialization1It is set to 0, t2It is set to count
The length of period, thenThe access request being successfully received each second for base station in timing statisticses section, psuccRepresent
Probability is successfully accessed, both ratio is that each second, all nodes attempted the number of access in timing statisticses section.
In step 6, calculated most again according to the method in step 1 using the subsequent time period average load estimated
Excellent number of channel nopt, and step 2 is repeated to step 5.
Fig. 3 is the Stochastic accessing application timing diagram of the monitoring node of one embodiment in the present invention, as illustrated, a certain section
Point determines whether that data need to transmit after bringing into operation, if it is not, continuing to monitor.If data need to transmit,
Then receive down control channel in include on information such as channel and frequencies.Channel is intercepted after receiving, if channel busy,
Channel busy is intercepted again after waiting for a period of time at random, transmits data, end of transmission immediately after listening to channel idle
Determine whether that data need to send again afterwards, if so, then proceeding as described above, if no data need to send, continue to supervise
Survey.
Claims (4)
1. preferred channels number determines method in a kind of multichannel CSMA agreements based on frequency packet, it is characterized in that：Base station passes through
The frequency of detection cell interior joint Stochastic accessing determines the node access loading condition of current base station, and each node uses and is based on frequency
The non-continuous carrier sense multiple access way of multichannel of packet is communicated with base station, in order to ensure between node and base station
Low time delay communicates, and the average load of lower a period of time is predicted in base station according to load situation of change, and determines the optimal number of channel, protects
The low time delay of communication is demonstrate,proved, is comprised the following steps：
(1) base station determines initial preferred channels number according to the packet transmission frequency of cell interior joint quantity and each node, and
Preferred channels number n is broadcasted by downlink broadcast channelopt；
(2) need the node for sending data to intercept downlink broadcast channel, obtain the value of preferred channels number, calculate residing for oneself
Channel and licensed frequency band, and carried out data transmission using non-continuous carrier sense multiple access protocol；
(3) base station estimates the average load of subsequent period according to the momentary load in a period of time, and utilizes the average load
The preferred channels number of subsequent period is calculated, repeats (2), (3) step until convergence.
2. according to the method for claim 1, it is characterised in that：In step (1), the specific method of preferred channels number is calculated
For：
<mrow>
<msub>
<mi>n</mi>
<mrow>
<mi>o</mi>
<mi>p</mi>
<mi>t</mi>
</mrow>
</msub>
<mo>=</mo>
<munder>
<mi>arg</mi>
<mi>n</mi>
</munder>
<mi>m</mi>
<mi>i</mi>
<mi>n</mi>
<mo>{</mo>
<mfrac>
<mrow>
<mi>D</mi>
<mi>n</mi>
</mrow>
<mrow>
<msub>
<mi>&omega;</mi>
<mi>m</mi>
</msub>
<mi>l</mi>
<mi>o</mi>
<mi>g</mi>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>+</mo>
<mi>n</mi>
<mi>S</mi>
<mi>N</mi>
<mi>R</mi>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mfrac>
<mn>1</mn>
<msub>
<mi>p</mi>
<mrow>
<mi>s</mi>
<mi>u</mi>
<mi>c</mi>
<mi>c</mi>
</mrow>
</msub>
</mfrac>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>&lsqb;</mo>
<mfrac>
<mrow>
<mn>1</mn>
<mo>-</mo>
<msub>
<mi>p</mi>
<mi>i</mi>
</msub>
</mrow>
<mrow>
<mn>1</mn>
<mo>-</mo>
<msub>
<mi>p</mi>
<mrow>
<mi>s</mi>
<mi>u</mi>
<mi>c</mi>
<mi>c</mi>
</mrow>
</msub>
</mrow>
</mfrac>
<msub>
<mi>&theta;</mi>
<mi>b</mi>
</msub>
<mo>+</mo>
<msub>
<mi>p</mi>
<mi>i</mi>
</msub>
<mfrac>
<mrow>
<mn>1</mn>
<mo>-</mo>
<msub>
<mi>p</mi>
<mi>s</mi>
</msub>
</mrow>
<mrow>
<mn>1</mn>
<mo>-</mo>
<msub>
<mi>p</mi>
<mrow>
<mi>s</mi>
<mi>u</mi>
<mi>c</mi>
<mi>c</mi>
</mrow>
</msub>
</mrow>
</mfrac>
<mrow>
<mo>(</mo>
<msub>
<mi>&theta;</mi>
<mi>f</mi>
</msub>
<mo>+</mo>
<msub>
<mi>&tau;</mi>
<mi>p</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>&rsqb;</mo>
<mo>}</mo>
</mrow>
Wherein,The value of the independent variable n when function obtains minimum value is represented, n represents the number of channel, and D represents that packet is big
It is small, unit kbit, ωmRepresent total bandwidth and the receiving terminal signal to noise ratio as n=1 respectively with SNR；psuccRepresent that data are bundled into
The probability of work(transmission, packet Successful transmissions need two conditions, are that channel status will be sky when packet is sent respectively
It is not busy and whole cell can not have other nodes to send data within a period of time after data start to send, if another node
Channel busy could not be listened to start to send data, then can produce to conflict with currently transmitted packet causes access failure；Order
piAnd psChannel idle and the probability for not having other nodes to send data in transmission a period of time when representing to send respectively,Withpsucc=pi*ps, gnThe load in each channel is represented, computational methods areM represents cell interior joint number, and r represents the frequency of each node application access, and n represents the number of channel；T=τp+δd
+ δ, τpRepresent packet transmission time, δdRepresent that other nodes can listen to the time delay of intercepting of channel busy, δ represents packet from section
Propagation delay of the point to base station.θbAnd θfRepresent there are other nodes to send because of channel busy and after transmission in a period of time respectively
Data and the time wasted when leading to the failure.
3. according to the method for claim 1, it is characterised in that：In step (2), node is according to where determining following methods
Channel：Each node then random number in the range of random generation internally one 0 to 1, if the random number of generation [0,1/n) scope
When interior, then in first channel, if the random number of generation [1/n, 2/n) in the range of when, then in second channel, successively
Analogize；The computational methods of licensed band are：
<mrow>
<msub>
<mi>f</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msub>
<mi>f</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<mfrac>
<mrow>
<mo>(</mo>
<msub>
<mi>f</mi>
<mn>2</mn>
</msub>
<mo>-</mo>
<msub>
<mi>f</mi>
<mn>1</mn>
</msub>
<mo>)</mo>
</mrow>
<mi>n</mi>
</mfrac>
<mo>(</mo>
<mrow>
<mi>i</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
<mo>)</mo>
<mo>,</mo>
<msub>
<mi>f</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<mfrac>
<mrow>
<mo>(</mo>
<msub>
<mi>f</mi>
<mn>2</mn>
</msub>
<mo>-</mo>
<msub>
<mi>f</mi>
<mn>1</mn>
</msub>
<mo>)</mo>
</mrow>
<mi>n</mi>
</mfrac>
<mi>i</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
</mrow>
fiRepresent the allowed transport frequency range of i-th of channel interior joint, f1And f2The start-stop frequency of whole frequency band is represented respectively.
4. according to the method for claim 1, it is characterised in that：In step (3), next section of time load institute is estimated in base station
Formula is：Wherein g (t) represents that base station end is successfully accessed the letter that the number of request changes over time
Number, t1And t2The beginning and ending time point of base station statistical data packet access number, (t are represented respectively2-t1) it is the time span counted, in base
Stand initialization when, by t1It is set to 0, t2The length of timing statisticses section is set to, thenFor base station each second in timing statisticses section
The access request being successfully received, psuccExpression is successfully accessed probability, both ratio be in timing statisticses section each second
All nodes attempt the number of access.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710677528.6A CN107484255B (en) | 2017-08-09 | 2017-08-09 | Method for determining optimal channel number in multi-channel CSMA protocol based on frequency grouping |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710677528.6A CN107484255B (en) | 2017-08-09 | 2017-08-09 | Method for determining optimal channel number in multi-channel CSMA protocol based on frequency grouping |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107484255A true CN107484255A (en) | 2017-12-15 |
| CN107484255B CN107484255B (en) | 2020-10-16 |
Family
ID=60599979
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710677528.6A Active CN107484255B (en) | 2017-08-09 | 2017-08-09 | Method for determining optimal channel number in multi-channel CSMA protocol based on frequency grouping |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107484255B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108430054A (en) * | 2018-03-14 | 2018-08-21 | 南京邮电大学 | Multichannel CSMA bandwidth allocation methods based on Delay Priority |
| CN109951238A (en) * | 2019-02-19 | 2019-06-28 | 哈尔滨工程大学 | A kind of out-of-date channel state information choosing method based on the fading channel factor |
| CN111885506A (en) * | 2020-06-15 | 2020-11-03 | 杭州电子科技大学 | Channel weight based CR Ad Hoc network active rendezvous broadcasting method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050157676A1 (en) * | 2003-07-23 | 2005-07-21 | Interdigital Technology Corporation | Method and apparatus for determining and managing congestion in a wireless communications system |
| CN102300257A (en) * | 2011-07-21 | 2011-12-28 | 西北工业大学 | Channel booking mechanism-based multi-channel multi-address access method in wireless ad hoc network |
| CN102781115A (en) * | 2012-08-03 | 2012-11-14 | 西安电子科技大学 | Automatic channel selection method based on channel order in dense wireless fidelity (WiFi) |
| US20160183285A1 (en) * | 2013-09-03 | 2016-06-23 | Kabushiki Kaisha Toshiba | Communication processing device |
-
2017
- 2017-08-09 CN CN201710677528.6A patent/CN107484255B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050157676A1 (en) * | 2003-07-23 | 2005-07-21 | Interdigital Technology Corporation | Method and apparatus for determining and managing congestion in a wireless communications system |
| CN102300257A (en) * | 2011-07-21 | 2011-12-28 | 西北工业大学 | Channel booking mechanism-based multi-channel multi-address access method in wireless ad hoc network |
| CN102781115A (en) * | 2012-08-03 | 2012-11-14 | 西安电子科技大学 | Automatic channel selection method based on channel order in dense wireless fidelity (WiFi) |
| US20160183285A1 (en) * | 2013-09-03 | 2016-06-23 | Kabushiki Kaisha Toshiba | Communication processing device |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108430054A (en) * | 2018-03-14 | 2018-08-21 | 南京邮电大学 | Multichannel CSMA bandwidth allocation methods based on Delay Priority |
| CN108430054B (en) * | 2018-03-14 | 2020-12-01 | 南京邮电大学 | Multi-channel CSMA bandwidth allocation method based on time delay priority |
| CN109951238A (en) * | 2019-02-19 | 2019-06-28 | 哈尔滨工程大学 | A kind of out-of-date channel state information choosing method based on the fading channel factor |
| CN111885506A (en) * | 2020-06-15 | 2020-11-03 | 杭州电子科技大学 | Channel weight based CR Ad Hoc network active rendezvous broadcasting method |
| CN111885506B (en) * | 2020-06-15 | 2021-10-22 | 杭州电子科技大学 | Channel weight based CR Ad Hoc network active rendezvous broadcasting method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107484255B (en) | 2020-10-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Tian et al. | Evaluation of the IEEE 802.11 ah restricted access window mechanism for dense IoT networks | |
| CN101827378B (en) | Blending MAC protocol design method suitable for wireless sensor network | |
| Borgonovo et al. | MAC for ad-hoc inter-vehicle network: services and performance | |
| CN102076068B (en) | ZigBee energy saving method based on space-time adjustment | |
| CN103327638B (en) | A kind of wireless medium connection control method of super narrow bandpass letter pattern | |
| CN103298064B (en) | Downlink data transmission method and relevant device and communication system | |
| Khorov et al. | Two-slot based model of the IEEE 802.11 ah restricted access window with enabled transmissions crossing slot boundaries | |
| CN104094652A (en) | System and method for managing contention in a wireless communications system | |
| Kai et al. | Energy-efficient sensor grouping for IEEE 802.11 ah networks with max-min fairness guarantees | |
| CN105592564B (en) | Adaptive access mechanism based on the estimation of live-vertex number in wireless Mesh netword | |
| CN101013912A (en) | Power control method for centralized wireless multihop access network | |
| CN104796959A (en) | Hybrid MAC protocol method for cluster-structure multi-carrier acoustic sensor network | |
| CN107484255A (en) | Preferred channels number determines method in a kind of multichannel CSMA agreements based on frequency packet | |
| Kim et al. | Data aggregation and packet bundling of uplink small packets for monitoring applications in LTE | |
| CN105357158A (en) | Method for node to access multiple channels exactly and efficiently in underwater cognitive network | |
| Liu et al. | Coexistence of 802.11 ah and 802.15. 4g networks | |
| CN102740476B (en) | A kind of method for resource allocation and system | |
| Lehong et al. | A survey of LoRaWAN adaptive data rate algorithms for possible optimization | |
| CN103024796A (en) | Bandwidth estimation method for wireless Mesh network | |
| Serati et al. | ADR-Lite: A Low-Complexity Adaptive Data Rate Scheme for the LoRa Network | |
| Rasheed et al. | An energy consumption analysis of beacon enabled slotted CSMA/CA IEEE 802.15. 4 | |
| CN102572847B (en) | Spectrum allocation method and system | |
| Dasgupta et al. | Congestion avoidance topology in wireless sensor network using Karnaugh map | |
| Ines | Performance of IEEE802. 15.4 e TSCH protocol for multi-hop wireless sensor networks | |
| Krishnamurthy et al. | Reservation-based protocol for monitoring applications using IEEE 802.15. 4 sensor networks |
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 |