CN106793152A - A kind of network concurrent competitive channel and referee method based on power distribution - Google Patents
A kind of network concurrent competitive channel and referee method based on power distribution Download PDFInfo
- Publication number
- CN106793152A CN106793152A CN201710122491.0A CN201710122491A CN106793152A CN 106793152 A CN106793152 A CN 106793152A CN 201710122491 A CN201710122491 A CN 201710122491A CN 106793152 A CN106793152 A CN 106793152A
- Authority
- CN
- China
- Prior art keywords
- node
- power
- neighbors
- network
- competitive channel
- 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
- 238000000034 method Methods 0.000 title claims abstract description 44
- 230000002860 competitive effect Effects 0.000 title claims abstract description 23
- 230000005540 biological transmission Effects 0.000 claims abstract description 20
- 230000000694 effects Effects 0.000 claims abstract description 8
- 230000004913 activation Effects 0.000 claims abstract description 6
- 230000008569 process Effects 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 5
- 230000006854 communication Effects 0.000 description 4
- 230000007423 decrease Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000005059 dormancy Effects 0.000 description 3
- 238000013461 design Methods 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000005562 fading Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000000284 resting effect Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 230000035945 sensitivity Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0866—Non-scheduled access, e.g. ALOHA using a dedicated channel for access
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0473—Wireless resource allocation based on the type of the allocated resource the resource being transmission power
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of network concurrent competitive channel based on power distribution and referee method, implementation step is：Each node in network sets up neighborhood information table when starting；According to the power that recursive method is that its neighbors distributes concurrent competitive channel, the method input is neighborhood information table to each node, is output as in allocation result set, and selection result set accommodating most one of node number as final allocation result；It is that its power for distributing carries out channel competition according to its destination node when node has data is activation；Recipient decodes the signal of competition side by capture effect, and specifies the node and transmission time length for allowing transmission data.The present invention utilizes capture effect and power distribution, and adjustment participates in the node number of concurrent transmission, and raising is captured as power, and then improves the utilization rate and network throughput of channel.
Description
Technical field
The present invention relates to wireless communication technology field, more particularly to a kind of network concurrent competitive channel based on power distribution
And referee method.
Background technology
Wireless sensor network is made up of a large amount of cheap microsensor node being deployed in target area, by nothing
The multihop self-organizing network that the mode of line communication is formed, is mainly used in the monitoring to target area.In actual applications,
The converging information that sensor node will be collected, it is thereby possible to substantial amounts of data burst occur, causes multiple nodes to data center
Compete to same node-node transmission data.Conventional channel is competed using CSMA mechanism, i.e. each node before data frame is sent,
When first having to carry out carrier sense, only medium clear, just allow to send frame, otherwise kept out of the way.But it is prominent in mass data
In the case of hair, the node for participating in competition is excessive, and the probability of conflict increases, especially when sensor node is operated in dutycycle mould
When under formula, competition is further exacerbated by, the success rate that constitutes competition declines, data transfer delay increase.
The content of the invention
In view of the drawbacks described above of prior art, the technical problems to be solved by the invention are to provide a kind of based on power point
The network concurrent competitive channel and referee method matched somebody with somebody, improve the utilization rate and network throughput of channel.
To achieve the above object, the invention provides a kind of network concurrent competitive channel based on power distribution and arbitration side
Method, it is characterised in that comprise the following steps：
Each node in S1, network sets up neighborhood information table when starting；
S2, each node are according to the power that recursive method is that its neighbors distributes concurrent competitive channel, the method input
It is neighborhood information table, multiple allocation results is produced in recursive procedure, and it is most that node number is accommodated in selection result set
One used as optimal solution, i.e., final allocation result；
It is that its power for distributing carries out channel competition according to its destination node when S3, node are if data is activation, it is no
Then, not competitive channel；
S4, recipient decode the signal of certain competition side by capture effect, and specify it as the section for sending data
Point, and for it distributes transmission time length.
Preferably, in the step S1 in neighborhood information table, the attribute of each neighbors include respectively node number, can
With transmit power and its corresponding received signal strength, and according to the continuous real-time update neighbors letter of data transmitted in network
Breath.
Preferably, each node is that its neighbors distributes concurrent competitive channel according to recursive method in the step S2
Power, target is one subset of maximum of determination from the neighbors set of recipient so that any several sections in this subset
The power that is captured as when point participates in competition all meets requirement.The neighborhood information table being wherein input into is not sky, therefore recursive procedure
Performed once to I haven't seen you for ages.
Preferably, it is that its power for distributing carries out letter according to its destination node when the step S3 nodes have data is activation
Road is competed.
Preferably, the step S2 is specially：
Note alternate node collection is combined into L, and current solution is R, and current interference strength is I, and globally optimal solution is B, and L is initialized as neighbour
Informational table of nodes, it is assumed that have a n neighbors, I is initialized as 0, and R, B initialization are all sky, the input of recurrence distribution method for L and
R, is output as B；
2a) Recursion process M branches：Perform get_min (L) operations and obtain (M, mi,mj), by (mi,mj) add R in obtain
R1, and perform Sum [dBm] (M, I) operation obtain I1, while performing set_N/A_Row (L, mi) and set_N/A_Threshold
(L,I1+ THR) operation obtain L1, by L1、R1And I1Next layer of recurrence is passed to as parameter；
2b) Recursion process P branches：Perform get_maxloss (L) operations and obtain (P, pi,pj), by (pi,pj) add R in
Obtain R2, and perform Sum [dBm] (P, I) operation obtain I2, while performing set_N/A_Row (L, pi) and set_N/A_
Threshold(L,I2+ THR) operation obtain L2, by L2、R2And I2Next layer of recurrence is passed to as parameter；
2c) recurrence border：If being equal to n without the node number in optional node or R in alternate node set, terminate recurrence,
And perform step 2d)；
If node number 2d) in R is more than B, renewal R is B, is not updated otherwise.
The beneficial effects of the invention are as follows：
1) present invention is by way of power distribution so that the nodes for participating in channel competition every time obtain reasonable interval
Maximum, meanwhile, when the node for carrying out channel competition participates in competition according to the power for distributing, it is ensured that must have one in competition every time
Individual node obtains the channel right to use, improves channel utilization and network throughput, and reduce data transfer delay.
2) present invention makes competition node carry out concurrent transmission by way of data receiver issues beacon frame, reduces
Because of the expense that time synchronized is brought.
The technique effect of design of the invention, concrete structure and generation is described further below with reference to accompanying drawing, with
It is fully understood from the purpose of the present invention, feature and effect.
Brief description of the drawings
Fig. 1 is the sub-process figure of recipient in data transmission procedure in the present invention；
Fig. 2 is the sub-process figure of sender in data transmission procedure in the present invention；
Fig. 3 is power distribution method flow chart in the present invention；
Fig. 4 is IEEE802.15.4 standard frame format schematic diagrames；
Fig. 5 is the frame assumption diagram of the beacon frame 1 that recipient sends；
Fig. 6 is the frame assumption diagram of the beacon frame 2 that recipient sends；
Fig. 7 is the frame assumption diagram of the challenge message that sender sends；
Pin level figure when Fig. 8 is TELOSB nodes reception packet；
Fig. 9 is a neighborhood information table example；
Figure 10 is the allocation example that the present invention proposes power distribution method；
Figure 11 is to select the neighborhood information table after first node.
Specific embodiment
The present invention is applied to wireless sensor network, and to save energy, sensor node generally uses duty cycle mould
Formula, i.e. node periodically work and dormancy according to certain scheduling strategy.Node can close wireless receiving and dispatching in the dormant state
Module, therefore, only under working condition, can just carry out data transmission.Node can in both cases be switched to working condition,
One is that, according to scheduling strategy, dormancy time terminates, and now node enters working condition as the identity of recipient, prepares to receive net
The data of potential sender in network；Two be node have data need send, be now transformed into work as the identity of sender
State, prepares to send data to destination node.
Reference picture 3 and Figure 10, it is of the invention to realize that step is as follows：
Each node in step 1, network sets up neighborhood information table when starting；
1a) in neighborhood information table, all neighbors comprising the node, neighborhood information includes the section of each neighbors
Period, can use transmit power, and its corresponding received signal strength.
Step 2, each node are according to the power that recursive method is that its neighbors distributes concurrent competitive channel, and the method is defeated
It is neighborhood information table to enter, and multiple allocation results are produced in recursive procedure, and it is most that node number is accommodated in selection result set
One as optimal solution, i.e., final allocation result；
Get_min (L) operations 2a) are first carried out and obtain minimum signal strength information (- 94.98dBm, 6,7), by (6,7)
Count in current solution R, obtain R1Maximum fading information (- 92.67dBm, 5,11) is obtained with get_maxloss (L) operations are performed,
R is obtained during (5,11) are counted into current solution R2, and recurrence is carried out respectively；By taking recurrence M branches as an example, due to No. 6 nodes by
Choose, perform set_N/A_Row (L, 6) operations, now I is -94.98dBm, performs set_N/A_Threshold (L, I+
SINRTHR) operation, neighborhood information table L now1As shown in figure 11；Perform get_min (L) and get_maxloss (L) operations
The result for obtaining is (- 92.67dBm, 5,11), therefore, two recursion paths merge into one, perform set_N/A_Row
(L1, 5 operations) operate to L1Screened, perform Sum [dBm] (- 92.67, -94.98) operations and obtain new interference strength；With
This analogizes, and get_min (L) and get_maxloss (L) operations is performed every time and obtains corresponding triple result, and be separately added into
Current solution, carries out recurrence, is M branches to the recursive branch of left representation intensity minimum power as shown in Figure 10, and decline is represented to the right
The recursive branch of peak power, i.e. P branches；Terminate recurrence when there is no optional performance number in set.
2b) from the allocation result for obtaining, selection accommodates node number most as final allocation result, accommodates
In the case of node number identical, selection wherein signal strength values summation is less, and such as Figure 10 final results are：
[(6,7)(5,11)(4,15)(3,23)(7,31)(0,27)(2,15)(1,27)]。
2c) use greedy algorithm, i.e., select from neighborhood information table minimum more than (Sum+SINR every timeTHR)
Signal strength values, the result that it is obtained is as follows, is equal to a branch in power distribution method of the invention, in such as Figure 10 most
One paths on the left side：
[(6,7)(5,11)(1,3)(7,19)(0,15)(2,11)]
It can be seen that using greedy algorithm, when input set is combined into 8 nodes, have to 6 allocation results of node, this
Inventing the distribution method for proposing can obtain complete or collected works so that 8 nodes can participate in channel competition.According to test result, this hair
The probability that the distribution method of bright proposition obtains optimal solution can be to 98%.
Step 3, node, if data is activation, are that its power for distributing carries out channel competition according to its destination node, no
Then, not competitive channel；
3a) data receiver inserts in beacon frame 1 power distribution result, and broadcast transmission, and the form of beacon frame 1 is deferred to
IEEE802.15.4 standard frame formats, as shown in figure 4, its pay(useful) load is as shown in figure 5, set the power distribution result of certain node
In have n neighbors, the combination of n group nodes number and transmit power will be write in its beacon frame 1；
3b) data sender is receiving the beacon frame 1 from destination node, the trailing edge of FIFOP pins start into
Row packet understand, if competition node pin level variation diagram as shown in figure 8, detecting the power meter in beacon frame 1 in have
The node number of oneself, just carries out channel competition according to power thereafter, otherwise, is transferred to resting state；
If 3c) certain competition node detects the information of oneself in beacon frame 1, just the last of beacon frame 1 is being received
One byte, i.e. SFD pins trailing edge, set transmit power, and triggering gating command sends challenge message, challenge message frame knot
Structure is as shown in Figure 7, it is ensured that each competition node sends the weak synchronization of message；
Step 4, recipient decode the signal of certain competition side by capture effect, and specify it as transmission data
Node, and for it distributes transmission time length.
4a) recipient decodes the signal of competition side, and broadcast beacon frame 2 by capture effect, is specified in beacon frame 2 and permitted
Perhaps the node and transmission time length of data are sent, its frame structure is as shown in Figure 6；
After 4b) sender receives beacon frame 2, judge whether oneself is the node for allowing to send data, if so, then in distribution
In time data are transmitted to recipient；Dormancy is otherwise transferred to, next round channel competition is waited.
In the present embodiment, when nodal test is in the presence of there is neighbors in the step 1, record adjacent in neighbor node table
Node address, the power for receiving each neighbors signal, and neighbor node table is constantly updated according to the information for receiving.
In the present embodiment, wherein recipient is each according to the distribution of the known signal power of all neighbors in the step 2
Individual neighbors participates in power level during channel competition, and target is one son of maximum of determination from the neighbors set of recipient
Collection so that the power that is captured as when any several nodes participate in competition in this subset all meets requirement.
In the present embodiment, wherein need the node of competitive channel after beacon frame is received in step 4, carry out concurrent transmission
, it is necessary to ensure a certain degree of synchronism during competitive channel, i.e. the difference of the time that each competition node sends challenge message can not
More than 128 μ s, this is the particular attribute of CC2420 chips.
In addition, the part term of the above is explained as follows：
1) neighborhood information table：
It is an information aggregate for all neighbors of node, is designated as L, its form is a bivariate table, line index is neighbour
Node number, column index is transmission power level, and element L (i, j) in neighborhood information table represents neighbors i with transmit power etc.
When level j sends data, the signal intensity of recipient is reached, unit is dBm, if node i is sent with power j, receive signal strong
It is referred to as unreachable when degree is less than the sensitivity of receiver, represented with ' N/A '.Every a line of L represents that one of neighbors is used
The signal intensity of recipient, leftmost value incremented by successively according to order from left to right are reached during different transmission power levels
The minimum received signal strength of recipient is reached for the node, rightmost is maximum received signal strength.
2) get_min (L) operations：The node at minimum signal strength value and its place and right is obtained in selectable value in L
The transmission power level answered, form is a triple, and disabled value ' N/A ' is ignored in screening process, when presence is multiple most
When small value, wherein power grade is chosen larger.
3) get_maxloss (L) operations：The minimum signal strength value of decline maximum node is obtained in selectable value in L
And its node and corresponding transmission power level at place.Electromagnetic wave in communication process, due to communication media and route of transmission
The phenomenon of the reception signal strength change for changing with time and causing is called decline, that is, send end signal strength and subtract receiving terminal
Signal intensity, due to node use 31 sending signal of power grade when, transmit power is 0dBm, therefore, each node use
The signal intensity that recipient is reached during 31 grade sending signal is numerically equal to its decline size, and selection wherein declines maximum
One node, returns to the available minimum signal strength value of the node.
4) Sum [dBm] (r, I) operations：R is the received signal strength value of current certain node chosen, and I is current total dry
Intensity is disturbed, unit is dBm, and be added to r in total interference strength I, first r and I is changed from dBm during superposition by Sum [dBm] operations
To mW, then it is added, the I after superposition is finally converted back into dBm again.
5) (L i) is operated set_N/A_Row：Unavailable data in L are configured, and all where by node i connect
Signal intensity is received to be set to unavailable ' N/A '.
6) (L t) is operated set_N/A_Threshold：Unavailable data in L are configured, will be less than threshold value t
(dBm) all received signal strengths are set to unavailable ' N/A '.
7) allocation result：The solution that power distribution method is obtained, form is two tuple-sets, ((n1,p1),(n2,
p2),…(nk,pk)), represent that the allocation result contains k node, at most allow the k concurrent competitive channel of node, wherein ni
Represent the node number of neighbors, piRepresent the appointed transmit power of the neighbors.
8) Signal to Interference plus Noise Ratio thresholding SINRTHR：Received signal strength is than interference and noise intensity sum SINR highTHRAfterwards, may be used
Ensure that receiver is correctly decoded signal.
Preferred embodiment of the invention described in detail above.It should be appreciated that one of ordinary skill in the art without
Need creative work just can make many modifications and variations with design of the invention.Therefore, all technologies in the art
Personnel are available by logical analysis, reasoning, or a limited experiment on the basis of existing technology under this invention's idea
Technical scheme, all should be in the protection domain being defined in the patent claims.
Claims (5)
1. a kind of network concurrent competitive channel and referee method based on power distribution, it is characterised in that comprise the following steps：
Each node in S1, network sets up neighborhood information table when starting；
S2, each node are neighbour according to the power that recursive method is that its neighbors distributes concurrent competitive channel, the method input
Informational table of nodes, produces multiple allocation results, and receiving node number is most in selection result set one in recursive procedure
As optimal solution, i.e., final allocation result；
It is that its power for distributing carries out channel competition according to its destination node, otherwise, no when S3, node are if data is activation
Competitive channel；
S4, recipient decode the signal of certain competition side by capture effect, and specify it as the node for sending data, and
For it distributes transmission time length.
2. as claimed in claim 1 a kind of network concurrent competitive channel and referee method based on power distribution, its feature exist
In：In the step S1 in neighborhood information table, the attribute of each neighbors include respectively node number, can with transmit power and
Its corresponding received signal strength, and according to the continuous real-time update neighborhood information of data transmitted in network.
3. as claimed in claim 1 a kind of network concurrent competitive channel and referee method based on power distribution, its feature exist
In：According to the power that recursive method is its neighbors concurrent competitive channel of distribution, target is each node in the step S2
A subset for maximum is determined from the neighbors set of recipient so that when any several nodes participate in competition in this subset
The power that is captured as all meet requirement.The neighborhood information table being wherein input into is not sky, therefore recursive procedure performs one to I haven't seen you for ages
It is secondary.
4. as claimed in claim 1 a kind of network concurrent competitive channel and referee method based on power distribution, its feature exist
In：It is that its power for distributing carries out channel competition according to its destination node when the step S3 nodes have data is activation.
5. as claimed in claim 1 a kind of network concurrent competitive channel and referee method based on power distribution, its feature exist
In the step S2 is specially：
Note alternate node collection is combined into L, and current solution is R, and current interference strength is I, and globally optimal solution is B, and L is initialized as neighbors
Information table, it is assumed that have n neighbors, I is initialized as 0, and R, B initialization are all sky, and the input of recurrence distribution method is L and R, defeated
It is B to go out；
2a) Recursion process M branches：Perform get_min (L) operations and obtain (M, mi,mj), by (mi,mj) add R in obtain R1, and
Perform Sum [dBm] (M, I) operations and obtain I1, while performing set_N/A_Row (L, mi) and set_N/A_Threshold (L, I1+
THR) operation obtains L1, by L1、R1And I1Next layer of recurrence is passed to as parameter；
2b) Recursion process P branches：Perform get_maxloss (L) operations and obtain (P, pi,pj), by (pi,pj) add R in obtain
R2, and perform Sum [dBm] (P, I) operation obtain I2, while performing set_N/A_Row (L, pi) and set_N/A_Threshold
(L,I2+ THR) operation obtain L2, by L2、R2And I2Next layer of recurrence is passed to as parameter；
2c) recurrence border：If being equal to n without the node number in optional node or R in alternate node set, terminate recurrence, and hold
Row step 2d)；
If node number 2d) in R is more than B, renewal R is B, is not updated otherwise.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710122491.0A CN106793152B (en) | 2017-03-03 | 2017-03-03 | Network concurrent competition channel based on power distribution and arbitration method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710122491.0A CN106793152B (en) | 2017-03-03 | 2017-03-03 | Network concurrent competition channel based on power distribution and arbitration method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106793152A true CN106793152A (en) | 2017-05-31 |
| CN106793152B CN106793152B (en) | 2020-07-03 |
Family
ID=58959013
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710122491.0A Active CN106793152B (en) | 2017-03-03 | 2017-03-03 | Network concurrent competition channel based on power distribution and arbitration method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106793152B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108184271A (en) * | 2018-03-10 | 2018-06-19 | 西安电子科技大学 | A kind of network conflict solution based on power distribution in wireless communication system |
| CN110896566A (en) * | 2019-11-18 | 2020-03-20 | 腾讯科技（深圳）有限公司 | Channel determination method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101512993A (en) * | 2006-09-08 | 2009-08-19 | 皇家飞利浦电子股份有限公司 | Method of selecting nodes |
| CN102036389A (en) * | 2010-12-15 | 2011-04-27 | 西安交通大学 | Multichannel diversity-based cognitive medium access control realizing method |
| CN102404804A (en) * | 2011-09-26 | 2012-04-04 | 北京航空航天大学 | Transmission method of MAC (Media Access Control) layer in multi-relay competitive cooperative communication |
| CN103313367A (en) * | 2013-07-08 | 2013-09-18 | 东南大学 | Uplink multi-user method applicable to wireless local area network |
-
2017
- 2017-03-03 CN CN201710122491.0A patent/CN106793152B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101512993A (en) * | 2006-09-08 | 2009-08-19 | 皇家飞利浦电子股份有限公司 | Method of selecting nodes |
| CN102036389A (en) * | 2010-12-15 | 2011-04-27 | 西安交通大学 | Multichannel diversity-based cognitive medium access control realizing method |
| CN102404804A (en) * | 2011-09-26 | 2012-04-04 | 北京航空航天大学 | Transmission method of MAC (Media Access Control) layer in multi-relay competitive cooperative communication |
| CN103313367A (en) * | 2013-07-08 | 2013-09-18 | 东南大学 | Uplink multi-user method applicable to wireless local area network |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108184271A (en) * | 2018-03-10 | 2018-06-19 | 西安电子科技大学 | A kind of network conflict solution based on power distribution in wireless communication system |
| CN108184271B (en) * | 2018-03-10 | 2022-02-01 | 西安电子科技大学 | Network conflict solution method based on power distribution in wireless communication system |
| CN110896566A (en) * | 2019-11-18 | 2020-03-20 | 腾讯科技（深圳）有限公司 | Channel determination method and device |
| CN110896566B (en) * | 2019-11-18 | 2022-04-22 | 腾讯科技（深圳）有限公司 | Channel determination method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106793152B (en) | 2020-07-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101013912B (en) | Power control method for centralized wireless multihop access network | |
| Doppler et al. | Advances in D2D communications: Energy efficient service and device discovery radio | |
| CN105375955B (en) | A kind of cooperation transmission method in letter energy simultaneous interpretation junction network | |
| CN103716853B (en) | A kind of self adaptation many relay selection methods in terminal direct connection communication system | |
| Zhao et al. | A survey and projection on medium access control protocols for wireless sensor networks | |
| CN108282861A (en) | A kind of transmission method of paging information, apparatus and system | |
| CN101667874B (en) | Method and system for partial cooperative spectrum sensing | |
| US20090122737A1 (en) | Mesh network control using common designation wake-up | |
| CN104105158A (en) | Relay selection method based on D2D relay communication | |
| CN106471828A (en) | Service announcement in neighbours' sensing network data link and scheduling | |
| CN106471842A (en) | Service announcement in neighbours' sensing network data link and scheduling | |
| Sinha et al. | An energy-efficient communication scheme for wireless networks: A redundant radix-based approach | |
| JP2010522487A5 (en) | ||
| CN106489281A (en) | Service announcement in neighbours' sensing network data link and scheduling | |
| Gao et al. | Neighbor discovery based on cross-technology communication for mobile applications | |
| CN101026837A (en) | Adaptive power saving method for wireless mobile packet communication system | |
| CN110519745B (en) | Neighbor discovery method based on maximum common divisor of cycle length | |
| CN103634913A (en) | Clustering-based multi-hop multi-channel cognitive wireless sensor network communication method | |
| CN106793152A (en) | A kind of network concurrent competitive channel and referee method based on power distribution | |
| Wang et al. | An energy efficient pre-schedule scheme for hybrid CSMA/TDMA MAC in wireless sensor networks | |
| La et al. | Energy-efficient multi-hop broadcasting in low power and lossy networks | |
| CN109688557A (en) | A kind of cooperative node selection method, device | |
| CN109618357A (en) | A kind of radio transmitting method and network | |
| Cabezas et al. | Low energy and low latency in wireless sensor networks | |
| CN103947244B (en) | Measuring method, user equipment and the base station of new wave-carring type cell |
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 |