CN111447566B - Method for avoiding mutual interference between static or semi-dynamic coexistent body area networks - Google Patents
Method for avoiding mutual interference between static or semi-dynamic coexistent body area networks Download PDFInfo
- Publication number
- CN111447566B CN111447566B CN202010194393.XA CN202010194393A CN111447566B CN 111447566 B CN111447566 B CN 111447566B CN 202010194393 A CN202010194393 A CN 202010194393A CN 111447566 B CN111447566 B CN 111447566B
- Authority
- CN
- China
- Prior art keywords
- body area
- area network
- networks
- network
- neighbor
- 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
- 238000000034 method Methods 0.000 title claims abstract description 35
- 230000003068 static effect Effects 0.000 title claims abstract description 13
- 238000009826 distribution Methods 0.000 claims abstract description 16
- 230000008569 process Effects 0.000 claims description 7
- 238000012545 processing Methods 0.000 claims description 5
- 238000003860 storage Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 6
- 230000005540 biological transmission Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000032683 aging Effects 0.000 description 1
- 230000036760 body temperature Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 230000005802 health problem Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/04—Arrangements for maintaining operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
- H04W4/08—User group management
-
- 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/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/51—Allocation or scheduling criteria for wireless resources based on terminal or device properties
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method for avoiding mutual interference between static or semi-dynamic coexisting body area networks, firstly, each body area network coordinator sends neighbor information mastered by itself to the coordinator of the neighbor network of itself until all the body area networks with adjacent relations master a same neighbor information table; then the body area network coordinator with the largest number of neighbor networks classifies all the body area networks according to the neighbor message table; distributing different channels to each category according to the classification result, and broadcasting the distribution information to all body area networks; and when a new body area network is added or the existing body area network is separated, the body area network is classified again and channels are distributed. The invention is suitable for a scene of coexisting interference of a plurality of static or semi-dynamic body area networks, can avoid the mutual interference among the body area networks and improve the utilization rate of channels.
Description
Technical Field
The invention relates to the technical field of wireless body area networks, in particular to a method for avoiding mutual interference between static or semi-dynamic coexisting body area networks.
Background
A wireless body area network is a human body monitoring technology applied to health care. The body area network comprises a coordinator and a plurality of sensor nodes, wherein the sensor nodes are arranged on the human body or implanted in the human body and used for collecting various parameters of the human body, such as electrocardiogram, body temperature and the like. And the coordinator is used for receiving the data collected by the sensor nodes, fusing the data and transmitting the fused data to the server or the medical center.
With the development of wireless body area network technology, more and more people will use wireless body area networks. When a plurality of people carrying wireless body area networks are together (such as places like a senior citizen home and a hospital hall), the plurality of body area networks may interfere with each other due to coexistence, that is, when sensor nodes between different networks transmit data, collision may occur due to the use of the same channel and time slot, which may cause an increase in packet loss rate and seriously affect network performance. In recent years, many researches are devoted to solve the problem of coexistence interference of a plurality of body area networks, namely how to allocate different channel or time slot resources to sensor nodes which interfere with each other in different body area networks, how to reasonably utilize limited transmission resources while keeping a low packet loss rate, and how to improve the utilization rate of the channel and the time slot.
The aging problem of the world population is aggravated nowadays, more and more attention is paid to the health problem, the number of people using the body area network in the future is greatly increased, and the coexistence interference problem of a plurality of body area networks is urgently solved. Because the body area network and WiFi and so on can sometimes use the same channel, the available channel resources are limited, but the problem of limited channel resources is not considered in the solutions proposed by many scholars at present, if the channel state used by the body area network is not good, even if the coexistence interference problem is alleviated by a certain method, the performance of the body area network still cannot be guaranteed. Therefore, we should not only alleviate the interference problem between coexisting body area networks, but also increase the channel utilization as much as possible.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provide a method for avoiding mutual interference between static or semi-dynamic coexisting body area networks, which can avoid the mutual interference between the body area networks and improve the utilization rate of a channel.
The purpose of the invention is realized by the following technical scheme: a method for avoiding mutual interference between static or semi-dynamic coexistent body area networks comprises the following steps:
s1, each body area network coordinator sends own mastered neighbor information to the coordinator of the own neighbor network until all body area networks with adjacent relations master a same neighbor information table;
s2, classifying all body area networks according to the neighbor message table by the body area network coordinator with the largest number of neighbor networks;
s3, distributing different channels to each category according to the classification result, and broadcasting the distribution information to all body area networks;
and S4, when a new body area network is added or the existing body area network is separated, reclassifying the body area network and distributing channels.
Preferably, the step S1 specifically includes the following steps:
s1.1, each body area network continuously broadcasts own network and neighbor network queues to adjacent networks, meanwhile, a neighbor information table is established, and neighbor information mastered by the body area network and the received neighbor information are gradually filled into the table;
s1.2, when neighbor information tables grasped by all networks are consistent, each body area network stops broadcasting.
Preferably, the step S2 specifically includes the following steps:
s2.1, the body area network with the most neighbor networks in the neighbor information table firstly classifies the body area network into one type, which is temporarily called as a type, and the neighbor network of the body area network is classified into another type, which is temporarily called as b type, then the neighbor network which can not store the body area network with the most neighbor networks is marked in the a type, and the body area network with the most neighbor networks is marked as visited;
when the number of the neighbor networks is the same, the network with the large network ID is used as the body area network with the largest number of the neighbor networks;
and S2.2, continuously traversing the rest body area networks according to the sequence of the classes and the sequence of the storage networks in the same class, and putting each body area network into a proper class.
Further, the classification process of step S2.2 is as follows:
s2.2.1, checking whether the current body area network is accessed, if yes, skipping;
if not, traversing all the existing categories, checking whether the current body area network can be classified into the categories or not, when the traversed categories can store the current body area network, putting the categories into the categories, then marking the adjacent networks which cannot store the current body area network in the categories, and in the marking process, skipping the visited body area network and only processing the body area network which is not visited;
s2.2.2, putting the adjacent body area networks of the current body area network into a new class;
s2.2.3, and finally marking the current body area network as visited.
Preferably, the step S3 specifically includes the following steps:
s3.1, distributing different channels for each category, and broadcasting the distribution information to all body area networks;
and S3.2, after receiving the distribution message, the coordinator of each body area network contains the channel distributed by the network in the beacon and sends the beacon to the sensor nodes in the network, and then the sensor nodes transmit data packets according to the distributed channel.
Preferably, when a new body area network is added to the current area in step S4, the method specifically includes the following steps:
s4.1, firstly, executing the step S1, exchanging the neighbor information of each body area network until all networks hold the same neighbor information table;
s4.2, classifying the newly added body area network into a proper category according to the new neighbor information table;
and S4.3, broadcasting the distribution message according to the step S3, and transmitting data by all body area networks according to the specified channel.
Further, the step S4.2 specifically includes the following steps:
s4.2.1, traversing the body area networks in all categories, checking whether the body area networks are adjacent to the newly added body area network, if so, marking that the newly added body area network cannot be put into the category in the category, and if not, not processing the newly added body area network;
s4.2.2, traversing all categories, checking whether the newly added body area network can be stored in the category, and if so, putting the category into the newly added body area network; if not, skip;
if the newly added body area network can not be stored in the existing category, the newly added body area network is put into a new category;
s4.2.4, after the newly added body area network is classified, marking that the neighbor network of the newly added network cannot be stored in the current class and marking that the newly added body area network is accessed.
Preferably, when the body area network leaves the current area in step S3, the method specifically includes the following steps:
s4.4, exchanging the neighbor information of each body area network in step S1 until all networks hold the same neighbor information table;
s4.5, deleting the record of leaving the body area network of the current area;
and S4.6, broadcasting the distribution message according to the step S3, and transmitting data by all body area networks according to the appointed channel.
Further, step S4.5 specifically includes the following steps:
s4.5.1, traversing all categories, checking whether the departed network is included in the category, if yes, deleting the departed body area network information; if not, skipping;
s4.5.2, checking whether the mark in each category leaves the network and can not be stored, if yes, deleting; if not, skip.
Preferably, for the case that the requirement for channel utilization is high, or the current channel availability state is not good, i.e. the available channel is less: and in the case that the classification of the body area networks is finished, re-executing the steps S2 and S3 every set time to re-classify all the body area networks.
Compared with the prior art, the invention has the following advantages and effects:
(1) the invention avoids the mutual interference between the body area networks of static or semi-dynamic coexistence, every body area network coordinator sends the neighbor message mastered by oneself to the coordinator of the own neighbor network at first, until all body area networks with adjacent relation master a same neighbor message list; then the body area network coordinator with the largest number of neighbor networks classifies all the body area networks according to the neighbor message table; distributing different channels to each category according to the classification result, and broadcasting the distribution information to all body area networks; and when a new body area network is added or the existing body area network is separated, the body area network is classified again and channels are distributed. The method reasonably classifies all body area networks according to the interference situation among the plurality of body area networks, and allocates channels to the body area networks in each class, so that the adjacent body area networks can not use the same channel, mutual interference of sensor nodes in different body area networks is avoided, and the method is very suitable for a scene of coexisting interference of a plurality of static or semi-dynamic body area networks.
(2) The method does not need extra operation of the sensor nodes in the body area network, only needs to transmit data according to the appointed channel, and does not have extra power consumption.
(3) The method of the invention considers the problem of limited available channels, minimizes the categories on the premise of ensuring no interference among the body area networks as much as possible in the process of classifying the body area networks, and adjusts the classification when the body area networks join or leave, thereby maximizing the utilization rate of the channels.
Drawings
FIG. 1 is a diagram of a coexisting wireless body area network topology modeled in accordance with an actual production and living environment in accordance with the present invention.
Fig. 2 is a flow chart of the method for avoiding mutual interference between static or semi-dynamic coexisting body area networks according to the present invention.
Fig. 3(a) is a diagram illustrating the result of the first classification step performed by the network head on the body area network of fig. 1.
Fig. 3(b) is a diagram illustrating the result of the second classification step of the body area network of fig. 1.
Fig. 3(c) is a diagram illustrating the final result of the classification of the body area network of fig. 1.
Fig. 4 is a schematic channel allocation diagram of the body area network of fig. 1.
Fig. 5 is a network topology diagram after a new body area network joins the area of fig. 1.
Detailed Description
The present invention will be described in further detail with reference to examples and drawings, but the present invention is not limited thereto.
Examples
The embodiment discloses a method for avoiding mutual interference between static or semi-dynamic coexisting body area networks, which is applied to a wireless body area network consisting of a plurality of sensor nodes and a coordinator, as shown in fig. 1, because collision may occur due to the use of the same channel or time slot when transmission ranges of a plurality of body area networks are overlapped, the time for movement between networks is far shorter than the stable time due to the coexisting interference of the static or semi-dynamic plurality of body area networks, which causes the performance reduction of the body area networks, so that different channels need to be allocated to the coexisting body area networks to avoid mutual interference between adjacent body area networks. As shown in fig. 2, the method comprises the steps of:
s1, each body area network coordinator sends own mastered neighbor information to the coordinator of its neighbor network until all body area networks with adjacent relations master a same neighbor information table, which specifically comprises:
s1.1, each body area network continuously broadcasts own network and neighbor network queues to adjacent networks, meanwhile, a neighbor information table is established, and neighbor information mastered by the body area network and the received neighbor information are gradually filled into the table;
s1.2, when the neighbor information tables grasped by all networks are consistent, each body area network stops broadcasting, and the final neighbor information table is shown as table 1 and corresponds to the body area network topology shown in the figure 1.
TABLE 1
| Network name | Neighbor network name | Network name | Neighbor network name |
| A | B、C | G | E、F |
| B | A、H | H | B、I |
| C | A、D、E | I | H、K、J |
| D | C、E | J | I |
| E | C、D、F、G | K | I |
| F | E、G |
S2, classifying all body area networks according to the neighbor message table by the body area network coordinator with the maximum number of neighbor networks:
s2.1, the body area network with the most number of neighbor networks in the neighbor information table, namely E is taken as the network, firstly, the E is classified into one class, which is temporarily called as class a, and the own neighbor network is classified into another class, which is temporarily called as class b, then the neighbor network which can not store the E is marked in the class a, and the E is marked as visited, and the network is represented by the letter after visiting the available letter, as shown in figure 3 (a).
When the number of the neighbor networks is the same, the network with the large network ID is used as the body area network with the largest number of the neighbor networks.
S2.2, continuously traversing the rest body area networks according to the sequence of the classes and the sequence of the stored networks in the same class, namely traversing the networks stored in the class a (the networks in the class a are traversed according to the storage sequence), then traversing the class b (the networks in the class b are traversed according to the storage sequence), and so on until all the networks which are not accessed in all the classes are traversed, so as to put all the body area networks into proper classes, specifically as follows:
s2.2.1, taking body area network C as an example, checking whether the current body area network C is accessed, if yes, skipping;
if not, traversing all the existing categories, checking whether the C can be classified into the category or not, and putting the category into the category when the traversed category can store the C, wherein as can be seen from the figure 3(a), the C cannot be put into the category a but only can be put into the category b; the neighbor networks for the current body area network are then marked as class b where during this marking the visited body area network E is skipped and only the body area networks that have not been visited A, D are processed.
S2.2.2, put the C's neighboring body area network A, D into the new class (class C), as shown in FIG. 3 (b).
S2.2.3, the current body area network C is finally marked as visited. The final classification result can be seen in fig. 3 (c).
S3, distributing different channels to each category according to the classification result, and broadcasting the distribution information to all body area networks:
and S3.1, allocating different channels for each class, and broadcasting an allocation message to all body area networks, wherein as shown in the figure 4, a class allocates a CH1 channel, b allocates a CH2 channel, and c allocates a CH3 channel.
And S3.2, after receiving the distribution message, the coordinator of each body area network contains the channels distributed by the network in the beacon of the superframe and sends the beacon to the sensor nodes in the network, and then the sensor nodes transmit data packets according to the distributed channels.
And S4, when a new body area network is added or the existing body area network is separated, reclassifying the body area network and distributing channels.
As shown in fig. 5, when a new body area network L is added to the current area, the process is specifically as follows:
s4.1, first, step S1 is executed to exchange the neighbor information of each body area network until all networks hold the same neighbor information table, as shown in table 2.
TABLE 2
| Network name | Neighbor network name | Network name | Neighbor network name |
| A | B、C | G | E、F |
| B | A、H | H | B、I、L |
| C | A、D、E | I | H、K、J、L |
| D | C、E | J | I |
| E | C、D、F、G | K | I |
| F | E、G | L | I、H |
S4.2, classifying the newly added body area network L into proper categories according to the new neighbor information table:
s4.2.1, traversing the body area networks in all categories, checking whether the body area networks are adjacent to the newly added body area network L, if so, marking that the newly added body area network L cannot be put into the category in the category, and if not, not processing the newly added body area network L;
s4.2.2, traversing all categories, checking whether the newly added body area network L can be stored in the category, and if so, putting the category into the new body area network L; if not, skip.
If the newly added body area network L can not be stored in the existing category, the newly added body area network L is put into a new category;
since L is adjacent to H, I, H is already in class a and I is already in class b, L cannot fit into class a and class b, but can fit into class c.
S4.2.4, after the newly added body area network L is classified, the neighbor network H, I which can not store the newly added network is marked in the current class, and the newly added body area network is marked to be accessed.
And S4.3, broadcasting the distribution message according to the step S3, and transmitting data by all body area networks according to the specified channel.
When the body area network leaves the current area, the process is as follows:
s4.4, exchanging neighbor information for each body area network as described in step S1 until all networks hold the same neighbor information table.
S4.5, deleting the record of leaving the body area network of the current region:
s4.5.1, traversing all categories, checking whether the departed network is included in the category, if yes, deleting the departed body area network information; if not, skipping;
s4.5.2, checking whether the mark in each category leaves the network and can not be stored, if yes, deleting; if not, skip.
And S4.6, broadcasting the distribution message according to the step S3, and transmitting data by all body area networks according to the appointed channel.
In addition, in the whole process, the requirement on the utilization rate of the channel is high, or the current channel has poor available state, i.e. the available channel is few:
in the case that the classification of the body area network is completed, steps S2 and S3 may be executed again at a set time interval, so as to reclassify all the body area networks, and the time interval may be adjusted in a floating manner according to the requirement.
The above embodiments are preferred embodiments of the present invention, but the present invention is not limited to the above embodiments, and any other changes, modifications, substitutions, combinations, and simplifications which do not depart from the spirit and principle of the present invention should be construed as equivalents thereof, and all such changes, modifications, substitutions, combinations, and simplifications are intended to be included in the scope of the present invention.
Claims (9)
1. A method for avoiding mutual interference between static or semi-dynamic coexistent body area networks (VLANs), comprising the steps of:
s1, each body area network coordinator sends own mastered neighbor information to the coordinator of the own neighbor network until all body area networks with adjacent relations master a same neighbor information table;
s2, classifying all body area networks according to the neighbor message table by the body area network coordinator with the maximum number of neighbor networks:
s2.1, the body area network with the most neighbor networks in the neighbor information table firstly classifies the body area network into one type, which is temporarily called as a type, and the neighbor network of the body area network is classified into another type, which is temporarily called as b type, then the neighbor network which can not store the body area network with the most neighbor networks is marked in the a type, and the body area network with the most neighbor networks is marked as visited;
when the number of the neighbor networks is the same, the network with the large network ID is used as the body area network with the largest number of the neighbor networks;
s2.2, continuously traversing the rest body area networks according to the sequence of the classes and the sequence of the storage networks in the same class, and putting each body area network into a proper class;
s3, distributing different channels to each category according to the classification result, and broadcasting the distribution information to all body area networks;
and S4, when a new body area network is added or the existing body area network is separated, reclassifying the body area network and distributing channels.
2. The method according to claim 1, wherein the step S1 specifically comprises the following steps:
s1.1, each body area network continuously broadcasts own network and neighbor network queues to adjacent networks, meanwhile, a neighbor information table is established, and neighbor information mastered by the body area network and the received neighbor information are gradually filled into the table;
s1.2, when neighbor information tables grasped by all networks are consistent, each body area network stops broadcasting.
3. The method according to claim 2, wherein the classification procedure of step S2.2 is as follows:
s2.2.1, checking whether the current body area network is accessed, if yes, skipping;
if not, traversing all the existing categories, checking whether the current body area network can be classified into the categories or not, when the traversed categories can store the current body area network, putting the categories into the categories, then marking the adjacent networks which cannot store the current body area network in the categories, and in the marking process, skipping the visited body area network and only processing the body area network which is not visited;
s2.2.2, putting the adjacent body area networks of the current body area network into a new class;
s2.2.3, and finally marking the current body area network as visited.
4. The method according to claim 1, wherein the step S3 specifically comprises the following steps:
s3.1, distributing different channels for each category, and broadcasting the distribution information to all body area networks;
and S3.2, after receiving the distribution message, the coordinator of each body area network contains the channel distributed by the network in the beacon and sends the beacon to the sensor nodes in the network, and then the sensor nodes transmit data packets according to the distributed channel.
5. The method according to claim 1, wherein when a new body area network joins the current area in step S4, the method specifically includes the following steps:
s4.1, firstly, executing the step S1, exchanging the neighbor information of each body area network until all networks hold the same neighbor information table;
s4.2, classifying the newly added body area network into a proper category according to the new neighbor information table;
and S4.3, broadcasting the distribution message according to the step S3, and transmitting data by all body area networks according to the specified channel.
6. The method according to claim 5, wherein the step S4.2 specifically comprises the following steps:
s4.2.1, traversing the body area networks in all categories, checking whether the body area networks are adjacent to the newly added body area network, if so, marking that the newly added body area network cannot be put into the category in the category, and if not, not processing the newly added body area network;
s4.2.2, traversing all categories, checking whether the newly added body area network can be stored in the category, and if so, putting the category into the newly added body area network; if not, skip;
if the newly added body area network can not be stored in the existing category, the newly added body area network is put into a new category;
s4.2.4, after the newly added body area network is classified, marking that the neighbor network of the newly added network cannot be stored in the current class and marking that the newly added body area network is accessed.
7. The method according to claim 1, wherein when there is a body area network leaving the current area in step S3, the method specifically includes the following steps:
s4.4, exchanging the neighbor information of each body area network in step S1 until all networks hold the same neighbor information table;
s4.5, deleting the record of leaving the body area network of the current area;
and S4.6, broadcasting the distribution message according to the step S3, and transmitting data by all body area networks according to the appointed channel.
8. The method according to claim 7, wherein the step S4.5 specifically includes the following steps:
s4.5.1, traversing all categories, checking whether the departed network is included in the category, if yes, deleting the departed body area network information; if not, skipping;
s4.5.2, checking whether the mark in each category leaves the network and can not be stored, if yes, deleting; if not, skip.
9. The method of claim 1, wherein for the case that channel utilization is high or the number of channels available is low due to bad current channel availability status: and in the case that the classification of the body area networks is finished, re-executing the steps S2 and S3 every set time to re-classify all the body area networks.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010194393.XA CN111447566B (en) | 2020-03-19 | 2020-03-19 | Method for avoiding mutual interference between static or semi-dynamic coexistent body area networks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010194393.XA CN111447566B (en) | 2020-03-19 | 2020-03-19 | Method for avoiding mutual interference between static or semi-dynamic coexistent body area networks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111447566A CN111447566A (en) | 2020-07-24 |
| CN111447566B true CN111447566B (en) | 2021-05-14 |
Family
ID=71650953
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010194393.XA Expired - Fee Related CN111447566B (en) | 2020-03-19 | 2020-03-19 | Method for avoiding mutual interference between static or semi-dynamic coexistent body area networks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111447566B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102340838A (en) * | 2011-07-18 | 2012-02-01 | 西安电子科技大学 | Medium access control method for prolonging network lifetime in wireless body area network |
| US8457560B2 (en) * | 2009-04-06 | 2013-06-04 | Samsung Electronics Co., Ltd. | Apparatus and method for interference minimization in body area networks using low duty cycle and preamble design |
| CN103763698A (en) * | 2014-01-20 | 2014-04-30 | 北京邮电大学 | Wireless body area network key negotiation mechanism based on wavelet transform tendency |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8565683B2 (en) * | 2009-12-18 | 2013-10-22 | Anseok Lee | Adaptive collision avoidance apparatus and method in channel-hopping based wireless AD-HOC networks |
| CN106332292A (en) * | 2015-06-17 | 2017-01-11 | 富士通株式会社 | Interference-resistant device, method and system applied to wireless body area network |
-
2020
- 2020-03-19 CN CN202010194393.XA patent/CN111447566B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8457560B2 (en) * | 2009-04-06 | 2013-06-04 | Samsung Electronics Co., Ltd. | Apparatus and method for interference minimization in body area networks using low duty cycle and preamble design |
| CN102340838A (en) * | 2011-07-18 | 2012-02-01 | 西安电子科技大学 | Medium access control method for prolonging network lifetime in wireless body area network |
| CN103763698A (en) * | 2014-01-20 | 2014-04-30 | 北京邮电大学 | Wireless body area network key negotiation mechanism based on wavelet transform tendency |
Non-Patent Citations (1)
| Title |
|---|
| 基于功率控制的无线体域网间干扰研究;刘树斌等;《数据通信》;20150530;27-30 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111447566A (en) | 2020-07-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Caccamo et al. | An implicit prioritized access protocol for wireless sensor networks | |
| Saleem et al. | Clustering and reinforcement-learning-based routing for cognitive radio networks | |
| Gu et al. | Task offloading in vehicular mobile edge computing: A matching-theoretic framework | |
| Rajandekar et al. | A survey of MAC layer issues and protocols for machine-to-machine communications | |
| CN103220788B (en) | Method, node and the access point that node is grouped | |
| JP2023553495A (en) | Communication device and communication method compatible with cooperative service period | |
| CA2627961C (en) | System and method for dynamic frequency selection based on spectrum etiquette | |
| US20130182565A1 (en) | Systems and methods for resource allocation serving communication requirements and fairness | |
| CN106332094A (en) | Q algorithm-based dynamic duty ratio coexistence method for LTE-U and Wi-Fi systems in unauthorized frequency band | |
| CN101594617A (en) | A kind of control channel method for building up of hierarchical spectrum sharing network | |
| CN104580407A (en) | VANET (vehicular ad hoc network) time slot reservation method based on game theory | |
| Ma et al. | Adaptive hybrid MAC protocols for UAV-assisted mobile sensor networks | |
| CN102833755B (en) | Method and device for constructing CoMP (Coordinated Multi-Point) cell coordination set | |
| CN111601398B (en) | Ad hoc network medium access control method based on reinforcement learning | |
| CN105704821A (en) | Channel mapping based MAC protocol of multi-channel distribution method | |
| CN101282256A (en) | Method and node for establishing time slot in wireless mesh network | |
| CN109845312A (en) | Data transmission method, device, computer equipment and system | |
| WO2024149009A1 (en) | Beam scheduling method, apparatus and system, and communication device and storage medium | |
| US20210127366A1 (en) | Resource allocation method for coexistence of multiple line topological industrial wireless networks | |
| CN109257824B (en) | Resource scheduling method based on TD-LTE self-organizing network | |
| CN111447566B (en) | Method for avoiding mutual interference between static or semi-dynamic coexistent body area networks | |
| Priya et al. | EE-MAC: energy efficient hybrid MAC for WSN | |
| CN104540203A (en) | Performance optimizing method for wireless body area network based on independent sets | |
| Fan et al. | Efficient resource scheduling for interference alleviation in dynamic coexisting WBANs | |
| CN110268739A (en) | Connection control method, device and readable storage medium storing program for executing |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20210514 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |