CN101494910B - Multi-channel medium access method for wireless sensing network - Google Patents
Multi-channel medium access method for wireless sensing network Download PDFInfo
- Publication number
- CN101494910B CN101494910B CN2009100428615A CN200910042861A CN101494910B CN 101494910 B CN101494910 B CN 101494910B CN 2009100428615 A CN2009100428615 A CN 2009100428615A CN 200910042861 A CN200910042861 A CN 200910042861A CN 101494910 B CN101494910 B CN 101494910B
- Authority
- CN
- China
- Prior art keywords
- bunch
- channel
- adjacent
- network
- cluster
- 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.)
- Expired - Fee Related
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a multichannel medium accessing method applied in wireless sensing network. The technical scheme in the invention is: The communication process is divided into a in-cluster part and a inter-cluster part; cluster head performs the time scheduling in cluster to realize no conflict communication in cluster; each of the clusters adjacent to the two clusters uses a different channel to avoid intra-cluster interference. the intra-cluster data transmission is performed on a common channel; a plurality of non-overlapping virtual links exists in the whole network; virtual MIMO is used on Sink node to receive data from different links. The invention designs a multichannel medium addressing mechanism based on virtual link according to the clustering network topology structure and combining with time division multiplexing and frequency division multiplexing, is applied in wireless sensing networks with middle or large number of nodes, and achieves the purposes of reducing network conflict interference and reducing node energy consumption.
Description
Technical field
The invention belongs to the wireless sensor network field, relate to a kind of multi-channel medium access method that is applied to radio sensing network, its at be the sub-clustering network topology structure.
Background technology
Radio sensing network has merged technology such as sensing, communication, calculating, be widely used, interstitial content is many and density is big in the network, in order to realize network more flexible and extensibility, the general network configuration of using sub-clustering, bunch interior nodes only with this bunch bunch swap data, (promptly between bunch head and bunch head) intercourses data between bunch head.
For radio communication, at one time, the same space, can there be certain interference in two link transmission under the same frequency, for fear of this interference, the mode that can adopt time-division, frequency division or sign indicating number to divide.At present, a lot of wireless communication protocols are such as 802.15.4/Zigbee, all support the transfer of data of a plurality of channels in physical layer, but, but do not use multichannel to carry out medium and insert MAC layer (English original meaning: the lexical or textual analysis of Media Access Control Chinese: the medium access is controlled).Use multi channel access way to help reducing and disturb, can improve network throughput, and save energy.The wireless sensor network of, finite energy big for scale improves network throughput and saves even more important that energy shows.
For present popular wireless network protocol, as 802.11, ZigBee etc., the channel frequency resource that their MAC do not provide multi channel mechanism to be used to make full use of physical layer, the MAC mechanism of wireless network roughly has dual mode: the MAC that avoids based on the MAC and the conflict of competition.MAC based on competition has CSMA (Carrier SenseMultiple Access Carrier Sense Multiple Access), and the MAC that conflict is avoided has CDMA, TDMA, multi-channel MAC mechanism etc.
Summary of the invention
Technical problem to be solved by this invention provides a kind of multi-channel medium access method that is applied to radio sensing network, to overcome in radio sensing network because interstitial content is many ubiquitous medium access interference problem, and low network throughput that causes and high energy consumption problem.
Technical solution of the present invention is as follows:
A kind of multi-channel medium access method that is applied to radio sensing network, described radio sensing network is made up of a plurality of bunches and an aggregation node, each bunch comprises a bunch of head and a plurality of bunches of interior nodes, it is characterized in that, adopting time division multiplexing mode to carry out the medium visit by bunch head in bunch inserts, transfer of data between bunch is by carrying out on the common signal channel link, and there is the common signal channel link of a plurality of non-overlapping copies in whole radio sensing network; Aggregation node is communicated by letter with each bunch by described common signal channel link.
Bunch the channel allocation principle be: 1 jumps adjacent bunch uses non-conterminous channel, and 2 jump adjacent bunch uses channel inequality.
Wherein a kind of concrete steps of method for channel allocation are as follows;
1) the adjacent bunch matrix A of initialization by scan channel initialization available channel list, is initialized as sky with unavailable channel list, forwards 2 to);
2) find priority the highest bunch, distribute first available channel, insert a
Ll
3) judge whether channel assigns, and is then to forward 6 to), otherwise forward 4 to);
4) find next priority bunch i, capable for i among the matrix table A, poll a
Ik(1＜k＜i), carry out channel allocation according to following channel allocation principle:
If a
Ik=1, then expression bunch k is adjacent with bunch i one jumping, with a
Kk, a
Kk+ 1, a
Kk-1 joins not optional channel list; a
KkRepresent a channel value, a
Kk+ 1 and a
Kk-1 is channel a
KkThe adjacent channel value; Jump to 5);
If a
Ik=2, then expression bunch k is adjacent with bunch i two jumpings, with a
KkJoin not optional channel list; Jump to 5);
5) available channel list is deducted not optional channel list, deduct to be operating as and remove the channel value that not optional channel list occurs in the available channel list, select the channel value of a minimum to insert a
LlJump to 3);
6) channel allocation finishes.
The concrete steps of another kind of method for channel allocation following (being applicable to larger network (the node number is more than or equal to 100 network, or the number of clusters order is greater than 10 network)):
1) each bunch initialization and preservation and the interior adjacent bunch message structure of its 2 bunches of jumpings comprise a bunch ID, jumping figure information and channel selection result; Forward 2 to);
2) inquiry bunch message structure, judge 2 jump the own priority of internal ratios high bunch whether the channel selection finishes, be then to forward 3 to), otherwise forward 4 to);
3) carry out channel according to adjacent bunch of principle of using non-conterminous channel and 2 to jump the adjacent bunch of channel that use is inequality of 1 jumping and select, forward 5 to);
4) upgrade bunch message structure, forward 6 to).
5) this bunch of broadcast transmission channel selection result in the double bounce scope; Comprise this bunch ID and channel selection result in the broadcast, forward 8 to);
6) wait for the reception new information, forward 7 to);
7) receive a new information, upgrade bunch message structure, forward 2 to).
8) judge priority minimum bunch whether select to finish, be then to forward 9 to), otherwise forward 6 to);
9) channel allocation finishes.
Multi-channel medium access control method based on virtual link of the present invention comprises following main points:
1) mechanism is distributed channel resource, and small scale network uses the centralised allocation algorithm, and large scale network uses the distributed allocation algorithm.
2) 1 jump the adjacent bunch of non-conterminous channel of use, 2 jump adjacent bunch uses channel inequality.
3) carry out time scheduling bunch, carry out the medium visit with time division multiplexing mode and insert.
4) transfer of data bunch is carried out on a common signal channel link (virtual link), and there is the virtual link of several non-overlapping copies in whole network.
5), provide virtual MIMO (multiple-input and multiple-output) mechanism to aggregation node (Sink node).
6) mechanism is supported the 802.15.4/ZigBee protocol architecture based on the 802.15.4/ZigBee protocol architecture.
7) mechanism is supported the wireless sensor network of single antenna node.
Beneficial effect:
Basic ideas of the present invention are: based on the network configuration of sub-clustering, each node distributes transmission time slot in giving bunch, and allow adjacent bunch to use different channels, particularly, the principle of channel allocation is: 1. adjacent cluster is used not adjacent channel, 2. 2 jump the not heavy channel of adjacent bunch use, (the hidden terminal problem is meant to have solved the hidden terminal problem that exists between the node in the network, if other nodes are positioned at outside the communication range of a node in twice communication distance scope, still can perceive wireless signal or be interfered), between bunch head and Sink node (being aggregation node), form several " common signal channel links " be used for bunch between transmission, avoid interference effectively, reduce and retransmit, increase network throughput.That is: in communication process is divided into bunch and bunch between two parts, carry out time scheduling by bunch head in bunch, do not have conflict communication in realizing bunch, two bunches of each bunches of jumping in the adjacent bunch scope use different channels, with the interference between avoiding bunch.Transfer of data between bunch is carried out on a common signal channel link (virtual link), there is the virtual link of several non-overlapping copies in whole network, the Sink node is used virtual MIMO (Multiple Input Multiple Output multiple-input and multiple-output, virtual MIMO is promptly virtual with other node to be the antenna of a node, make this node have the multiple-input and multiple-output characteristic), receive the data on the different links.
Adopting said method, bunch in when communicating by letter, bunch head utilizes the mode of time-division to carry out transfer of data with bunch interior nodes, bunch between when communicating by letter, be under the same channel because " common signal channel link " goes up each bunch head, each bunch head on same " common signal channel link " can carry out normal transfer of data, and machine-processed whole process does not need the control radio frequency (control channel) of additional dedicated, so this mechanism only needs each node to be equipped with single radio frequency, is applicable to the actual network platform.In addition, the method can make full use of ubiquitous multi-channel resource (as 802.15.4/Zigbee) in the agreement.
Description of drawings
Fig. 1 is based on the multi-channel medium access schematic diagram of mechanism of virtual link among the present invention; Label declaration:
1-bunch of head; Common signal channel link (virtual link) between 2-bunch; Link between 3-bunch; 4-aggregation node (Sink)
Fig. 2 is the network topology exemplary plot of cluster among the embodiment 1;
Fig. 3 is that adjacent bunch matrix notation illustrations are jumped in 1 jumping and 2 among the embodiment 1;
Fig. 4 is a time slot allocation presentation graphs among the embodiment 1;
Fig. 5 be among the present invention bunch between communication common signal channel link schematic diagram;
Fig. 6 is each bunch time slot allocation presentation graphs on virtual link among the present invention;
Fig. 7 is a hidden terminal problem schematic diagram among the present invention;
Fig. 8 is a medium or small scale network lower channel allocation algorithm flow chart of the present invention;
Fig. 9 is a large scale network lower channel allocation algorithm flow chart among the present invention.
Embodiment
Following example is to further specify of the present invention, rather than the restriction scope of invention:
Embodiment 1:
Shown in Fig. 1～9, Fig. 1 among the present invention based on the multi-channel medium access schematic diagram of mechanism of virtual link.Network is the network topology structure of sub-clustering, has and only have a bunch of head in each bunch, exists between each bunch head to connect link, has 3 common signal channel links (virtual link) in the schematic diagram.There is and only has a data aggregation node Sink in the network.
Fig. 2 is the network topology exemplary plot of the clustering architecture in the present embodiment.The Sink node forms separately bunch, and bunch scale near the Sink node is more little more, and bunch scale away from the Sink node is big more more, and bunch interior nodes of all bunches can both follow its bunch CH direct communication, i.e. a jumping can reach its bunch head.
Fig. 3 is that adjacent bunch matrix notation illustrations are jumped in 1 jumping and 2 among the embodiment.This exemplary plot is a prerequisite with the network topology of Fig. 2.Behind the network cluster, Sink node initializing available channel table, the Sink node carries out the scanning of channel, obtains actual available channel resource.Unavailable channel list is initialized as sky.The formation rule of adjacent bunch matrix table following (wherein i represents row, and j represents row):
1) certain element a of triangle under in the matrix
Ij=1 expression: bunch i jumps adjacent (i＞j, j priority ratio i height) with bunch j one.
2) certain element a of triangle under in the matrix
Ij=2 expressions: bunch i jumps adjacent (i＞j, j priority ratio i height) with bunch j two.
3) the element a on the diagonal in the matrix
Ij=m represents: after bunch i process algorithm computation, and selected channel m.Initial value m is 0.
4) all the other elements all are 0.
Obviously, matrix is Nc dimension square formation (Nc for bunch number), and this matrix is a lower triangular matrix, adopts the compression storage mode.
After the initialization, the Sink node begins to carry out channel allocation, carries out (bunch ID number more little, and priority is high more) according to priority, calculates a successively
Ll, the channel allocation principle that this algorithm uses is: 1. the adjacent bunch channel of 1 jumping is not adjacent heavy, and 2. the adjacent bunch channel of 2 jumpings does not weigh.For be for ID number i bunch, it high 1 is jumped and the 2 channel allocation situations of jumping neighbours bunch only need to check priority ratio, selects according to above distribution principle then.
Fig. 4 is time slot allocation presentation graphs among the present invention.Wherein 1,2,3, the 4 shared times of stage are respectively T
S1～T
S4Each node is all safeguarded two values in the network: each time slots length T
Slot, total timeslot number N
Slot, both computing formula are as follows:
T
slot＝DL/K (1)
Wherein, DL is the data length of required transmission in using, and K is a message transmission rate, and for example DL is 1000B, and K is 200kbps, T
SlotBe 1000*8/200kbps=40ms.
N
slot＝(1+C)·N
m(0≤C≤1) (2)
Wherein, C characterization data degrees of fusion, degrees of fusion is high more, C is more little, then bunch between signal post require the timeslot number also can be more little.N
mThe maximum node number that allowed in the expression network bunch.
By as can be known above, T
SlotN
SlotThen be a slot cycle, determined all nodes except that the Sink node in the whole network carry out taking turns bunch in communication with bunch between time of communicating by letter.
For certain specific bunch, T
S1～T
S4Distribution by the actual number (N of each bunch head according to oneself bunch interior nodes
s) assigned.Wherein, most important is T
S2, T
S4, provide its expression formula below.
T
s2＝P·N
s·T
slot (3)
The probability that P sends for the individual node request msg.
T
s4＝(CPN
s+C
H-1·N
m)T
slot(H≥1)(4)
H is the jumping figure of this bunch from the Sink node.
Fig. 5 is communication common signal channel link table diagrammatic sketch between among the present invention bunch.Have three common signal channel links among the figure, they are operated in the 11st, 13,15 channels respectively.Dotted portion represents that two bunches is that 1 jumping links to each other.
Fig. 6 is each bunch time slot allocation presentation graphs on virtual link among the present invention.Fig. 6 is based on Fig. 5, expresses among Fig. 5 the time slot allocation of 3 bunches of heads on the virtual link and represents.Bunches 2,6,7 bunch in when communicating by letter, be operated in different channels respectively with bunch interior nodes communication, bunch between when beginning communication, bunches 6 and bunches 7 with channel adjustment to bunch 2 employed channels (No. 11 channels), CLH2, CLH6, the H value of CLH7 is respectively 1,2,3, according to formula (4), they bunch between communication time window reduce successively, peripheral more bunch, bunch scale is big more, in needing more bunch time slot and still less bunch between time slot, otherwise,, need bear communication between more bunch and (be used for this bunch bunch interior nodes transfer of data on the one hand near the Sink node cluster, be used to converge data on the common signal channel link on the other hand to the Sink node), so the time window of communication is bigger between corresponding bunch.
Fig. 7 is hidden terminal problem schematic diagram among the present invention.Bunch scale that the present invention adopts is, is the center with the Sink node, and whenever one-level bunch radius increases by 0.5 times backward.The center that the coverage that bunch radius has been represented bunch, bunch head are chosen in bunch as far as possible, after bunch formation, bunch interior nodes is adjusted transmitting power, guarantee 1 jump reduce transmitting power on the basis that can reach can be energy-conservation and reduce and disturb.Figure 7 shows that under limiting case, article one, on the link, bunches 1,2,3 adjacent successively, according to channel allocation principle of the present invention, bunches 2 and bunch 1,3 channels that use not adjacent heavy, bunch 1 and bunch 2 channels that use do not weigh, belong to bunch 1 node n1 and be positioned at bunch 1 and bunches 2 edge, belong to bunches 3 node n2 and be positioned at bunches 2 and bunches 3 edge, the present invention does not exist the adequate condition of hidden terminal problem to be: any bunch bunch interior nodes in its 2 times of communication distance scopes, do not cover use same channel bunch.Obviously, node n1 and node n2 are two category nodes that most probable produces hidden terminal, shown in their hidden terminal scope does not all exceed three bunches, and three bunches all be to use different channels, so under general case, the present invention can avoid the hidden terminal problem.
Fig. 8 is middle and small scale of the present invention (be interstitial content less than 100 network, or the number of clusters order being less than 10 a network) network lower channel allocation algorithm flow chart, and its concrete steps are as follows:
1) according to the adjacent bunch matrix A of the formation rule initialization of above neighbour bunch matrix table, be initialized as sky (NULL), forwards 2 to) by scan channel initialization available channel list UC, unavailable channel list UUC.
2) find priority the highest bunch (be ID be numbered 1 bunch), distribute first available channel, insert a
Ll
Does 3) channel assign? be then to forward 6 to), otherwise forward 4 to).
4) find next priority bunch i, capable for i among the matrix table A, poll a
Ik(1＜k＜i), according to the channel allocations principle:
If a
Ik=1, then expression bunch k is adjacent with bunch i one jumping, with a
Kk, a
Kk+ 1, a
Kk-1 joins not optional channel list (adding is operating as and operates) (a
KkChannel just, according to the channel allocations principle, one jumps the channel of adjacent cluster otherwise heavy not adjacent).Jump to 5).
If a
Ik=2, then expression bunch k is adjacent with bunch i two jumpings, with a
KkJoin not optional channel list.Jump to 5).
5) available channel list UC deducts not optional channel list UUC (deduct to be operating as and remove the channel value that UUC occurs among the UC), selects the channel of a minimum to insert a
LlJump to 3).
6) channel allocation finishes.
Fig. 9 is a large scale network lower channel allocation algorithm flow chart among the present invention, and its concrete steps are as follows:
1) each bunch initialization and preservation and the interior adjacent bunch message structure CIS (ClusterInformation Structure) (comprising a bunch ID, jumping figure information and channel selection result) of its 2 bunches of jumpings.Forward 2 to)
2) inquiry CIS, judge 2 jump the own priority of internal ratios high bunch whether the channel selection finishes, be then to forward 3 to), otherwise forward 4 to).
3) carry out channel according to the above-mentioned channel selection principle of this patent and select, forward 5 to).
4) upgrade CIS structure (by bunch ID that will receive, selection result information is inserted into the CIS structure), forward 6 to).
5) this bunch of broadcast transmission channel selection result (comprising this bunch ID and channel selection result in the broadcast) in the double bounce scope forwards 8 to).
6) wait for the reception new information, forward 7 to).
7) receive a new information, upgrade the CIS structure, forward 2 to).
8) judge minimum bunch whether the selecting of priority finish (by judge oneself whether be priority minimum bunch and whether select), be then to forward 9 to), otherwise forward 6 to).
9) channel allocation finishes.
Claims (3)
1. multi-channel medium access method that is applied to radio sensing network, described radio sensing network is made up of a plurality of bunches and an aggregation node, each bunch comprises a bunch of head and a plurality of bunches of interior nodes, it is characterized in that, adopting time division multiplexing mode to carry out the medium visit by bunch head in bunch inserts, transfer of data between bunch is by carrying out on the common signal channel link, and there is the common signal channel link of a plurality of non-overlapping copies in whole radio sensing network; Aggregation node is communicated by letter with each bunch by described common signal channel link; Bunch the channel allocation principle be: 1 jumps adjacent bunch uses non-conterminous channel, and 2 jump adjacent bunch uses channel inequality.
2. the multi-channel medium access method that is applied to radio sensing network according to claim 1 is characterized in that, the concrete steps of channel allocation are as follows:
1) the adjacent bunch matrix A of initialization by scan channel initialization available channel list, is initialized as sky with unavailable channel list, forwards 2 to);
2) find priority the highest bunch, distribute first available channel, insert a
11
3) judge whether channel assigns, and is then to forward 6 to), otherwise forward 4 to);
4) find next priority bunch i, capable for i among the matrix table A, poll a
Ik, 1＜k＜i, carry out channel allocation according to following channel allocation principle:
If a
Ik=1, then expression bunch k is adjacent with bunch i one jumping, with a
Kk, a
Kk+ 1, a
Kk-1 joins not optional channel list; a
KkRepresent a channel value, a
Kk+ 1 and a
Kk-1 is channel a
KkThe adjacent channel value; Jump to 5);
If a
Ik=2, then expression bunch k is adjacent with bunch i two jumpings, with a
KkJoin not optional channel list; Jump to 5);
5) available channel list is deducted not optional channel list, deduct to be operating as and remove the channel value that not optional channel list occurs in the available channel list, select the channel value of a minimum to insert a
IiJump to 3);
6) channel allocation finishes.
3. the multi-channel medium access method that is applied to radio sensing network according to claim 1 is characterized in that, the concrete steps of channel allocation are as follows:
1) each bunch initialization and preservation and the interior adjacent bunch message structure of its 2 bunches of jumpings comprise a bunch ID, jumping figure information and channel selection result; Forward 2 to);
2) inquiry bunch message structure, judge 2 jump the own priority of internal ratios high bunch whether the channel selection finishes, be then to forward 3 to), otherwise forward 4 to);
3) carry out channel according to adjacent bunch of principle of using non-conterminous channel and 2 to jump the adjacent bunch of channel that use is inequality of 1 jumping and select, forward 5 to);
4) upgrade bunch message structure, forward 6 to);
5) this bunch of broadcast transmission channel selection result in the double bounce scope; Comprise this bunch ID and channel selection result in the broadcast, forward 8 to);
6) wait for the reception new information, forward 7 to);
7) receive a new information, upgrade bunch message structure, forward 2 to);
8) judge priority minimum bunch whether select to finish, be then to forward 9 to), otherwise forward 6 to);
9) channel allocation finishes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100428615A CN101494910B (en) | 2009-03-13 | 2009-03-13 | Multi-channel medium access method for wireless sensing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100428615A CN101494910B (en) | 2009-03-13 | 2009-03-13 | Multi-channel medium access method for wireless sensing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101494910A CN101494910A (en) | 2009-07-29 |
| CN101494910B true CN101494910B (en) | 2010-11-10 |
Family
ID=40925247
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100428615A Expired - Fee Related CN101494910B (en) | 2009-03-13 | 2009-03-13 | Multi-channel medium access method for wireless sensing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101494910B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101720056B (en) * | 2009-09-07 | 2012-12-19 | 广州市香港科大霍英东研究院 | Method for tracking a plurality of equipment-free objects based on multi-channel and support vector regression |
| CN102143591B (en) * | 2011-04-07 | 2013-07-03 | 上海交通大学 | Method for realizing cognitive media access control (MAC) protocol in clustering wireless sensor network |
| CN102185906B (en) * | 2011-04-21 | 2013-11-06 | 西安交通大学 | Safety monitoring wireless sensor network for large equipment |
| US9762342B2 (en) | 2011-09-30 | 2017-09-12 | International Business Machines Corporation | Transmitting data to and from nodes of a clustered multi-hop network with a TDMA scheme |
| CN102497405A (en) * | 2011-12-07 | 2012-06-13 | 湖南大学 | Interference sensing wireless mesh network peer-to-peer (P2P) resource distributing method |
| CN103067131A (en) * | 2012-12-26 | 2013-04-24 | 陈宏滨 | Reliable sensor network communication method for digital channel |
| CN103379503A (en) * | 2013-07-27 | 2013-10-30 | 浙江求是人工环境有限公司 | System and method for distributing channels of wireless sensor network for agricultural product logistics |
| CN105636228A (en) * | 2016-03-17 | 2016-06-01 | 南京邮电大学 | Wireless sensor network child node data transmission method based on multiplexing |
| CN116684952B (en) * | 2023-07-28 | 2023-12-19 | 北京智芯微电子科技有限公司 | Communication power adjustment method, device, equipment and medium of dual-mode communication system |
-
2009
- 2009-03-13 CN CN2009100428615A patent/CN101494910B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN101494910A (en) | 2009-07-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101494910B (en) | Multi-channel medium access method for wireless sensing network | |
| EP3869895B1 (en) | System and method for radio access virtualization | |
| Incel | A survey on multi-channel communication in wireless sensor networks | |
| Zhang et al. | Joint routing and scheduling in multi-radio multi-channel multi-hop wireless networks | |
| CN102695265B (en) | Hybrid mechanism media access control (MAC) protocol communication method based on wireless sensor network | |
| CN100512092C (en) | Multi-channel selection multi-address access method | |
| US10440715B2 (en) | System and method for OFDMA resource management in WLAN | |
| US20170230909A1 (en) | Method and apparatus for operating a power save mode in a wireless lan system | |
| US8340053B2 (en) | Wireless sensor network and method for performing communication therein | |
| US8553626B2 (en) | Apparatus and method for supporting access in wireless communication system | |
| CN107257584B (en) | High time slot utilization rate access method of terahertz wireless personal area network based on implicit TDMA | |
| WO2008112329A1 (en) | Optimal resource allocation in a multi-hop ofdma wireless network with cooperative relaying | |
| CN101796739A (en) | Methods, systems, apparatuses and related computer program product for allocation of communication resources | |
| CN102264146A (en) | Time division multiple access/frequency division multiple access (TDMA/FDMA)-based wireless sensor network (WSN) medium access control (mac) layer scheduling method | |
| Lim et al. | A self-scheduling multi-channel cognitive radio MAC protocol based on cooperative communications | |
| Ali et al. | A Survey of MAC Protocols Design Strategies and Techniques in Wireless Ad Hoc Networks. | |
| Wu et al. | Multi-channel and cognitive radio approaches for wireless sensor networks | |
| US10904882B2 (en) | Systems and methods for scaling short range local area networks using dual interfaced first hub nodes and transmission schedule mapping | |
| Cinar et al. | HMCAWSN: A hybrid multi-channel allocation method for erratic delay constraint WSN applications | |
| CN103237323B (en) | Based on multichannel parallel node acceptance method | |
| CN102917376A (en) | Cognitive wireless sensor network MAC implementing method in combination of power control | |
| CN107018575A (en) | The expansible of wireless sensor network preengages SR BMA agreements | |
| Kim et al. | Energy-efficient resource management in Wireless Sensor Network | |
| Zaied et al. | Energy efficient of grid clustering based teen protocol for cognitive radio wireless sensor networks | |
| AU2003262673C1 (en) | Methods and apparatus of transmitting user data using traffic channels |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20101110 Termination date: 20150313 |
|
| EXPY | Termination of patent right or utility model |