CN108174403A - A kind of k- covering hole detection methods of wireless sensor network - Google Patents
A kind of k- covering hole detection methods of wireless sensor network Download PDFInfo
- Publication number
- CN108174403A CN108174403A CN201810151725.9A CN201810151725A CN108174403A CN 108174403 A CN108174403 A CN 108174403A CN 201810151725 A CN201810151725 A CN 201810151725A CN 108174403 A CN108174403 A CN 108174403A
- Authority
- CN
- China
- Prior art keywords
- boundary
- node
- message
- sections
- line segment
- 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.)
- Pending
Links
Classifications
-
- 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
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
A kind of k the invention discloses wireless sensor network covers hole detection method.Wireless sensor network is modeled as a figure G=(V, E), V is the set of all nodes, and E is the set of all adjacent node lines；According to the range information between adjacent node, the boundary sections in all 1 covering cavities in current network are found, and calculate its weight；In the boundary sections of discovery, suitable beginning boundary line segment is found, and thus boundary initial segment starts to transmit message successively to other connected boundary sections, find the boundary circumference in all 1 covering cavities；In current network find a node set that target area can be completely covered, suspend mode this set in node the coverage of current network is made to subtract 1, again detect current network present in 1 covering cavity；It repeats k 1 time, finds the boundary sections and boundary circumference in all k coverings cavities.The present invention can accurately detect the coverings of k present in network cavity in the case where only knowing localization range information.
Description
Technical field
The invention belongs to wireless sensor network field, a kind of more particularly to k- coverings cavity of wireless sensor network
Detection method.
Background technology
Wireless sensor network is by largely having the microsensor node group of sensing capability, ability to communicate and computing capability
Into being widely used in the fields such as environmental monitoring, intrusion detection.In order to improve Fault Tolerance or be wanted to coverage
It asks in higher application such as military monitoring, triangulation location, often requires that each point in target area at least by k node
Sensing range covering, wherein k is integer more than or equal to 1；And in practical application, random spreading, the energy of sensor node
Amount exhausts and the factors such as node is destroyed can cause the empty generation of covering again, seriously affects wireless sensor network and can be provided
Service quality.Therefore, the detection in k- coverings cavity is an important job.
At present, the scheme for having had some different for the empty test problems of the covering of wireless sensor network, mainly may be used
To be divided into three classes：Based on coordinate, based on distance and based on homology theory；Wherein, the covering hole detection method based on coordinate can
Accurately to find the boundary sections in all cavities and boundary circumference, but the method needs to obtain all the sensors node in network
Coordinate information, and these information are difficult to obtain in practice；The existing k- coverings hole detection method based on distance is only capable of
It was found that all boundary nodes, and the boundary sections and boundary circumference in all k- coverings cavities cannot be found simultaneously；Based on the people having the same aspiration and interest
Theoretical covering hole detection method only finds the covering cavity in network by communication information, but the method cannot find own
Covering cavity.
Invention content
In order to solve the technical issues of above-mentioned background technology proposes, the present invention is intended to provide a kind of wireless sensor network
K- covers hole detection method, and in the case where only knowing localization range information, k- coverings present in accurate detection network are empty
Hole, and determine the specific region in each k- coverings cavity.
In order to realize above-mentioned technical purpose, the technical scheme is that：
A kind of k- covering hole detection methods of wireless sensor network, include the following steps：
(1) wireless sensor network is modeled as a figure G=(V, E), wherein, V is the set of all nodes, and E is institute
There is the set of adjacent node line；According to the range information between adjacent node, all 1- coverings cavities in current network are found
Boundary sections, and calculate its weight；
(2) in the boundary sections found in step (1), suitable beginning boundary line segment, and thus boundary start line are found
Section starts to transmit message successively to other connected boundary sections, finds the boundary circumference in all 1- coverings cavities；
(3) in current network find a node set that target area can be completely covered, suspend mode this set in
Node makes the coverage of current network subtract 1, detects the coverings of 1- present in current network cavity again；
(4) step (1)-(3) k-1 times are repeated, find the boundary sections and boundary circumference in all k- coverings cavities.
Further, in step (1), the boundary sections in all 1- coverings cavities in current network is found and calculate its power
The method of weight is as follows：
For, per a pair of of adjacent node, judging that whether it perceives the intersection point of disk by other public-neighbors in figure G
It is covered, if two intersection points are covered by the perception disk of other public-neighbors, which is not
The boundary sections in 1- coverings cavity, weight are set as 0；If it is only covered in two intersection points there are one intersection point by other public-neighbors
Lid, then the line to adjacent node is the boundary sections that weight is 1；If two intersection points are not by other public-neighbor institutes
Covering, then the line to adjacent node is the boundary sections that weight is 2.
Further, in step (2), the method for finding suitable beginning boundary line segment is as follows：
There are two cavities of public boundary line segment, select the public boundary line segment as beginning boundary line segment；
There are two cavities of public boundary node, select a line boundary line section being connected with the public boundary node as
Beginning boundary line segment；
Two cavities being separated from each other respectively select beginning boundary line segment of any one boundary sections as them.
Further, in step (2), start to transmit successively to other connected boundary sections from boundary initial segment and disappear
The method for ceasing and finding the boundary circumference in all covering cavities is as follows：
After selecting beginning boundary line segment uv, since node v, all boundaries being connected with node v except removing node u
Line segment transmits message, and the content of message includes the ID serial numbers of node u and v；When a certain boundary node receives a piece of news, exist
Following four situation：
Situation 1：Node had received the message from same beginning boundary line segment, then the judgement of this message was attached most importance to
Redoubling is ignored；
Situation 2：Node did not received the message for coming from the beginning boundary line segment, and the ID serial numbers of oneself are added to message end
Tail, and pass to other boundary sections being connected with this node；
Situation 3：It is same node, and received before and this that the node of message, which is received, with the start node of the message
The similar message of message then is judged to this message to repeat and ignore；
Situation 4：It is same node, and do not received and this before that the node of message, which is received, with the start node of the message
The similar message of message, judgement are found that a boundary circumference；
It often finds a boundary circumference, the weight for all boundary sections for forming the boundary circumference is subtracted 1, continues to find it
The boundary circumference in his cavity, the boundary sections for being more than 0 until weight is not present.
Further, in step (3), to all non-boundary nodes in wake-up states, judge that it perceives disk area
Whether domain is completely covered by other nodes, if so, the node is included into set S and suspend mode；If it is not, node stayed awake, continues
Judge next node；After performing primary judgement to all non-boundary nodes in wake-up states, it is still within waking up shape
The non-boundary node of state constitutes a node set that target area is completely covered, and by these node whole suspend mode, and wakes up S
In whole nodes, the coverage of current wireless sensor network subtracts 1.
The advantageous effect brought using above-mentioned technical proposal：
The present invention can be calculated merely with the localization range information between adjacent node in network by simple geometry,
It was found that the boundary sections and boundary circumference in all 1- coverings cavities, pass through network coverage and the iteration 1- coverings cavity detection of successively decreasing
Mode, it has further been found that the boundary sections and boundary circumference in all k- covering cavity in network determine each k- coverings cavity
Specific region, for it is subsequent cavity repair etc. work basis is provided.
Description of the drawings
Fig. 1 covers empty detection example figure for wireless sensor network 1-；
Fig. 2 subtracts the wireless sensor network exemplary plot after 1 for network coverage；
Fig. 3 is the empty exemplary plot of 2- coverings found after iteration 1- coverings cavity is detected；
Fig. 4 is flow chart of the method for the present invention.
Specific embodiment
Below with reference to attached drawing, technical scheme of the present invention is described in detail.
For the wireless sensor network being made of N number of sensor node being randomly dispersed in rectangular target areas, net
Each node in network has unique and mutually different ID identification numbers, and all nodes have identical the perception radius RsAnd communication
Radius Rc；To ensure that the network coverage connects, node needs to meet Rc≥2Rs, it is assumed here that Rc=2Rs, the present invention is to Rc>2Rs
Situation it is equally applicable.Each sensor node using disk overlay model, i.e. the sensing range of node be using node as the center of circle,
Radius is RsDisk.For any two node u and v, if the Euclidean distance d between themu,v≤Rc, claim them adjacent each other
Node can communicate between adjacent node, obtain range information to each other.
The perception circumference of any two adjacent node u, v necessarily intersect at one section of circular arc Su,v, length μu,vIt can be by remaining
String theorem calculates：
According to the property circumferentially covered, if the perception circumference of node is completely covered by other nodes, then this node is just not
It is adjacent with covering cavity.For the line uv of node u, v, if circular arc Su,vBoth sides endpoint covered by other nodes, then line
Section uv is not just adjacent with covering cavity, i.e. line segment uv is not a line boundary line section.Assuming that node w is the public neighbours of node u, v
Node, then the perception circumference of node w and u necessarily intersect at one section of circular arc Su,w.It, equally can be in the hope of circle according to the cosine law
Arc Su,wLength μu,wAnd the angle theta between line segment uv and line segment uwvuw：
So circular arc Su,vWith Su,wBetween there are three kinds of useful position relationships：
Relationship (1-1)：Su,vWith Su,wNon-intersect, i.e., node w does not cover circular arc Su,vAny one endpoint；
Relationship (1-2)：That is node w covers S simultaneouslyu,vTwo endpoints, at this point, meeting formula between them：
μu,w≥μu,v+2θvuw (3)
Relationship (1-3)：Su,vWith Su,wIntersect but there is no inclusion relation, i.e. node w only covers Su,vAn endpoint, this
When, meet formula between them：
To any pair adjacent node u, v, judge their all public-neighbors to circular arc Su,vTwo endpoints cover
Lid situation；If meet relationship (1-2), then line segment uv is not a line boundary line section, no longer judges remaining public-neighbor；
If neighbor node meets relationship (1-3), which is added to set S1；If being unsatisfactory for relationship (1-2), (1-3), continue to sentence
Break next public-neighbor.
After judgement, if meeting relationship (2) conditional without node, set S is judged1Whether it is empty set；If so, line segment
Uv is the boundary sections that weight is 2；If S1It is not empty set, then continues to judge set S1In with the presence or absence of a pair of of node, be covered each by
Su,vThe different endpoint in both sides two.If set S1In two node w, x meet any one in following conditions, illustrate to save
Point w, x cover circular arc Su,vThe different endpoint in both sides two：
Condition (1-1)：W and x is not neighbor node,
Condition (1-2)：W and x is neighbor node, and is met
θwux=θvuw+θvuxOr θwux+θvuw+θvux=2 π (5)
If Su,vTwo endpoints covered by the perception disk of other nodes in addition to node u, v, line segment uv is not just
The boundary sections in 1- coverings cavity, weight 0；If only there are one by other coverages in two endpoints, line segment uv is 1-
The boundary sections in cavity are covered, weight 1 illustrates that uv is adjacent with a covering cavity；If two endpoints are not saved by other
Point is covered, and line segment uv is the boundary sections in 1- coverings cavity, and weight 2 illustrates that uv is adjacent with two covering cavities.Successively
Judge all line segments in network, obtain the boundary sections in all 1- coverings cavities, as shown in Figure 1.
It was found that after all boundary sections, continue to find the boundary circumference in cavity.It is empty for any two covering in network
Hole, there are three kinds of position relationships, find the beginning boundary line segment of boundary circumferential process by following standard selections respectively：
(1) there are two cavities of public boundary line segment, public boundary line segment is selected as beginning boundary line segment；
(2) there are two cavities of public boundary node, select a line boundary line section being connected with the public boundary node
As beginning boundary line segment；
(3) two cavities being separated from each other respectively select beginning boundary line segment of any one boundary sections as them.
It is all with saving except node u to removing since start node v after selecting suitable beginning boundary line segment uv
The boundary sections that point v is connected transmit message, and the content of message includes the ID serial numbers of node u and v；When a certain boundary node receives
A piece of news, it is understood that there may be following four situation：
Situation (1-1)：Node had received the message from same beginning boundary line segment, then this message was judged
Redoubling of attaching most importance to is ignored；
Situation (1-2)：Node did not received the message for coming from the beginning boundary line segment, and the ID serial numbers of oneself are added to and are disappeared
End is ceased, and passes to other boundary sections being connected with this node.
Situation (1-3)：It is same node, but received before that the node of message, which is received, with the start node of the message
The message similar to this message is judged to this message to repeat and ignore；
Situation (1-4)：The start node for receiving node and the message of message is same node, and do not received before with
The similar message of this message, judgement are found that a boundary circumference.
It often finds a boundary circumference, the weight for all boundary sections for forming the boundary circumference is subtracted 1, continues to find it
The boundary circumference in his cavity, the boundary sections for being more than 0 until weight is not present.
It was found that after the boundary circumference in all 1- coverings cavities, one can be completely covered target area in searching current network
Node set.To the nodes in wake-up states all in network, judge whether it perceives disc area complete by other nodes
All standing.Adjacent node v, w for existing in disk and perceiving circumference intersection point are perceived in node u to all, if intersection point is also removed u
Except other nodes covered, then node u perceive disc area be completely covered by other nodes.Exist between node u, v, w
Three kinds of situations：
Situation (2-1)：Node u does not cover Sv,wAny one endpoint, then continue to judge lower a pair of of neighbor node；
Situation (2-2)：Node u only covers Sv,wAn endpoint, judge whether node x, covered together with node u
1. or 2. one endpoint of sample meets condition with the presence or absence of node x：
1. u and x is unsatisfactory for condition (1-2) for neighbor node and node x；
2. node x covers S simultaneouslyv,wTwo endpoints；
Situation (2-3)：Node u covers S simultaneouslyv,wTwo endpoints, judge whether that node x covers S simultaneouslyv,w's
Two endpoints or with the presence or absence of a pair of of node x, y, are covered each by Sv,wThe different endpoint in two, both ends.
If the node dormancy is included into set by all intersection points perceived in disc area of node by other coverages
S2.After judging the non-boundary nodes in wake-up states all in network, it is still in the non-boundary of wake-up states
Node forms a node set that target area is completely covered, and by these node whole suspend mode, and wakes up S2In whole sections
Point, the coverage of current wireless sensor network subtract 1, as shown in Figure 2.
The empty detection of 1- coverings is repeated in existing network, the boundary sections and boundary circumference found are former wireless biography
The boundary sections and boundary circumference in 2- coverings cavity in sensor network, as shown in Figure 3.Iteration above process k-1 times finds network
In all k- covering cavity boundary sections and boundary circumference.The process of entire detection method is as shown in Figure 4.
Embodiment is merely illustrative of the invention's technical idea, it is impossible to protection scope of the present invention is limited with this, it is every according to
Technological thought proposed by the present invention, any change done on the basis of technical solution, each falls within the scope of the present invention.
Claims (5)
1. the k- covering hole detection methods of a kind of wireless sensor network, which is characterized in that include the following steps：
(1) wireless sensor network is modeled as a figure G=(V, E), wherein, V is the set of all nodes, and E is all phases
The set of neighbors line；According to the range information between adjacent node, the boundary in all 1- coverings cavities in current network is found
Line segment, and calculate its weight；
(2) in the boundary sections found in step (1), suitable beginning boundary line segment is found, and thus boundary initial segment is opened
Begin to transmit message successively to other connected boundary sections, find the boundary circumference in all 1- coverings cavities；
(3) in current network find a node set that target area can be completely covered, suspend mode this set in node
The coverage of current network is made to subtract 1, detects the coverings of 1- present in current network cavity again；
(4) step (1)-(3) k-1 times are repeated, find the boundary sections and boundary circumference in all k- coverings cavities.
2. the k- covering hole detection methods of wireless sensor network according to claim 1, which is characterized in that in step
(1) in, find the boundary sections in all 1- covering cavity in current network and calculate its weight method it is as follows：
For, per a pair of of adjacent node, judging that it perceives whether the intersection point of disk is covered by other public-neighbors in figure G
Lid, if two intersection points are covered by the perception disk of other public-neighbors, which is not that 1- covers
The boundary sections in cavity are covered, weight is set as 0；If only being covered in two intersection points there are one intersection point by other public-neighbors,
Then the line to adjacent node is the boundary sections that weight is 1；If two intersection points are not covered by other public-neighbors
Lid, then the line to adjacent node is the boundary sections that weight is 2.
3. the k- covering hole detection methods of wireless sensor network according to claim 1, which is characterized in that in step
(2) in, the method for finding suitable beginning boundary line segment is as follows：
There are two cavities of public boundary line segment, select the public boundary line segment as beginning boundary line segment；
There are two cavities of public boundary node, select a line boundary line section being connected with the public boundary node as starting
Boundary sections；
Two cavities being separated from each other respectively select beginning boundary line segment of any one boundary sections as them.
4. the k- covering hole detection methods of wireless sensor network according to claim 1, which is characterized in that in step
(2) in, start to transmit message successively to other connected boundary sections from boundary initial segment and find all covering cavities
The method of boundary circumference is as follows：
After selecting beginning boundary line segment uv, since node v, all boundary sections being connected with node v except removing node u
Message is transmitted, the content of message includes the ID serial numbers of node u and v；When a certain boundary node receives a piece of news, there are following
Four kinds of situations：
Situation 1：Node had received the message from same beginning boundary line segment, then this message was judged to repeating simultaneously
Ignore；
Situation 2：Node did not received the message for coming from the beginning boundary line segment, and the ID serial numbers of oneself are added to message end,
And pass to other boundary sections being connected with this node；
Situation 3：It is same node, and received disappear with this before that the node of message, which is received, with the start node of the message
Message as manner of breathing then is judged to this message to repeat and ignore；
Situation 4：It is same node, and do not received before and this message that the node of message, which is received, with the start node of the message
Similar message, judgement are found that a boundary circumference；
It often finds a boundary circumference, the weight for all boundary sections for forming the boundary circumference is subtracted 1, continue to find other skies
The boundary circumference in hole, the boundary sections for being more than 0 until weight is not present.
5. the k- covering hole detection methods of wireless sensor network according to claim 1, which is characterized in that in step
(3) in, to all non-boundary nodes in wake-up states, judge that it perceives whether disc area is covered completely by other nodes
Lid, if so, the node is included into set S and suspend mode；If it is not, node stayed awake, continues to judge next node；It is in all
After the non-boundary node of wake-up states performed primary judgement, the non-boundary node for being still within wake-up states constitutes one
The node set of target area is completely covered, by these node whole suspend mode, and wakes up whole nodes in S, current wireless biography
The coverage of sensor network subtracts 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810151725.9A CN108174403A (en) | 2018-02-14 | 2018-02-14 | A kind of k- covering hole detection methods of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810151725.9A CN108174403A (en) | 2018-02-14 | 2018-02-14 | A kind of k- covering hole detection methods of wireless sensor network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108174403A true CN108174403A (en) | 2018-06-15 |
Family
ID=62510540
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810151725.9A Pending CN108174403A (en) | 2018-02-14 | 2018-02-14 | A kind of k- covering hole detection methods of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108174403A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109451519A (en) * | 2018-11-13 | 2019-03-08 | 井冈山大学 | Based on WSN protocol network safety protecting method and system, computer program |
| CN110267323A (en) * | 2019-05-21 | 2019-09-20 | 杭州电子科技大学 | A kind of connection target K covering method based on adjustable the perception radius model |
| CN110806591A (en) * | 2019-10-11 | 2020-02-18 | 广东工业大学 | Unmanned aerial vehicle coverage search method and search device based on coherent theory |
| CN111065104A (en) * | 2019-12-13 | 2020-04-24 | 中国电子科技集团公司第二十研究所 | Self-adaptive network coverage method applied to distributed multi-hop network |
| CN111935732A (en) * | 2020-09-09 | 2020-11-13 | 南京嘉环科技股份有限公司 | Method, device, computer system and server for identifying network coverage structure holes |
| CN113746681A (en) * | 2021-09-06 | 2021-12-03 | 中国联合网络通信集团有限公司 | Detection method, device and equipment for perception hole and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100261495A1 (en) * | 2009-04-13 | 2010-10-14 | Xiaoyun Li | Distributed hole recovery process using connectivity information |
| CN102843708A (en) * | 2011-06-22 | 2012-12-26 | 中国科学院深圳先进技术研究院 | Method for checking coverage quality of wireless sensor network |
| CN105898779A (en) * | 2016-04-27 | 2016-08-24 | 南华大学 | Method of detecting coverage holes of sensor network using trusted information coverage model |
| CN106358210A (en) * | 2016-10-20 | 2017-01-25 | 重庆工商大学 | Mixed strategy-based heterogeneous directional sensor network dynamic coverage method |
-
2018
- 2018-02-14 CN CN201810151725.9A patent/CN108174403A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100261495A1 (en) * | 2009-04-13 | 2010-10-14 | Xiaoyun Li | Distributed hole recovery process using connectivity information |
| CN102843708A (en) * | 2011-06-22 | 2012-12-26 | 中国科学院深圳先进技术研究院 | Method for checking coverage quality of wireless sensor network |
| CN105898779A (en) * | 2016-04-27 | 2016-08-24 | 南华大学 | Method of detecting coverage holes of sensor network using trusted information coverage model |
| CN106358210A (en) * | 2016-10-20 | 2017-01-25 | 重庆工商大学 | Mixed strategy-based heterogeneous directional sensor network dynamic coverage method |
Non-Patent Citations (2)
| Title |
|---|
| WENYU MA等: "Coverage Hole Detection Algorithm without Location Information in Wireless Sensor Networks", 《2017 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATIONS (ICCC)》 * |
| 王自力等: "面向异构网络的基于k-覆盖的休眠调度算法", 《传感技术学报》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109451519A (en) * | 2018-11-13 | 2019-03-08 | 井冈山大学 | Based on WSN protocol network safety protecting method and system, computer program |
| CN110267323A (en) * | 2019-05-21 | 2019-09-20 | 杭州电子科技大学 | A kind of connection target K covering method based on adjustable the perception radius model |
| CN110267323B (en) * | 2019-05-21 | 2020-09-01 | 杭州电子科技大学 | Connected target K covering method based on adjustable perception radius model |
| CN110806591A (en) * | 2019-10-11 | 2020-02-18 | 广东工业大学 | Unmanned aerial vehicle coverage search method and search device based on coherent theory |
| CN110806591B (en) * | 2019-10-11 | 2022-02-11 | 广东工业大学 | Unmanned aerial vehicle coverage search method and search device based on coherent theory |
| CN111065104A (en) * | 2019-12-13 | 2020-04-24 | 中国电子科技集团公司第二十研究所 | Self-adaptive network coverage method applied to distributed multi-hop network |
| CN111065104B (en) * | 2019-12-13 | 2022-06-21 | 中国电子科技集团公司第二十研究所 | Self-adaptive network coverage method applied to distributed multi-hop network |
| CN111935732A (en) * | 2020-09-09 | 2020-11-13 | 南京嘉环科技股份有限公司 | Method, device, computer system and server for identifying network coverage structure holes |
| CN111935732B (en) * | 2020-09-09 | 2020-12-22 | 南京嘉环科技股份有限公司 | Method, device, computer system and server for identifying network coverage structure holes |
| CN113746681A (en) * | 2021-09-06 | 2021-12-03 | 中国联合网络通信集团有限公司 | Detection method, device and equipment for perception hole and storage medium |
| CN113746681B (en) * | 2021-09-06 | 2023-06-16 | 中国联合网络通信集团有限公司 | Method, device, equipment and storage medium for detecting perception holes |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108174403A (en) | A kind of k- covering hole detection methods of wireless sensor network | |
| Beghdad et al. | Boundary and holes recognition in wireless sensor networks | |
| Shang et al. | Localization from mere connectivity | |
| Kuo et al. | An intelligent positioning approach: RSSI-based indoor and outdoor localization scheme in Zigbee networks | |
| Chang et al. | An obstacle-free and power-efficient deployment algorithm for wireless sensor networks | |
| Chen et al. | Securing DV-Hop localization against wormhole attacks in wireless sensor networks | |
| JP5756529B2 (en) | Method and apparatus for mobile device location determination | |
| JP5973967B2 (en) | User apparatus, base station, discovery signal reception method, and discovery signal transmission method | |
| WO2004092925A3 (en) | Method and system for detecting characteristics of a wireless network | |
| EP1976227A3 (en) | Method and system for monitoring a selected region of an airspace associated with local area networks of computing devices | |
| CN103458478B (en) | Based on source hiding method and the system in dynamic forgery source | |
| Yao et al. | Distributed wireless sensor network localization based on weighted search | |
| CN103401922A (en) | Distributed positioning device and method based on game method in wireless sensor network | |
| CN103607770B (en) | High precision distance estimation in a kind of wireless sensor network location | |
| CN101483935B (en) | Topology drawing algorithm for wireless Ad-Hoc network | |
| KR20060092703A (en) | Method for forming power efficient network | |
| Sivakumar et al. | Error minimization in localization of wireless sensor networks using fish swarm optimization algorithm | |
| Sitanayah et al. | Heuristic algorithm for finding boundary cycles in location-free low density wireless sensor networks | |
| CN105162539A (en) | Cognitive wireless sensor network spectrum detection method based on node information | |
| Hsieh et al. | Hole detection and boundary recognition in wireless sensor networks | |
| CN105050099A (en) | Method for identifying boundary nodes in distributed wireless sensor network | |
| Patil et al. | Localization in wireless sensor networks using three masters | |
| AbdelSalam et al. | A 3d-localization and terrain modeling technique for wireless sensor networks | |
| CN103796237B (en) | A kind of method for quick of sensor network uncovered area | |
| CN105472630B (en) | The wireless sensor network fringe node recognition methods differentiated based on triangle |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180615 |
|
| RJ01 | Rejection of invention patent application after publication |