-
1.发明授权公开(公告)号：US09838070B1
公开(公告)日：2017-12-05
申请号：US15527955
申请日：2014-12-22
Inventor： Wei Liang , Haibin Yu , Bo Yang , Xiaoling Zhang
CPC classification number: H04B1/713 , H04B1/405 , H04B1/7143 , H04B2001/1045 , H04W16/02 , H04W72/0426 , H04W72/12
Abstract: The present invention relates to wireless network technology and presents a permutation group-based channel rendezvous method for a multi-antenna cognitive radio network, allowing a cognitive user equipped with multiple antennas to achieve blind channel rendezvous without the need for clock synchronisation. The present invention defines channel hopping sequences whilst making full use of properties such as channel diversity, the closure nature of permutation groups, and multi-antenna concurrency; based on the permutation groups obtained by rotating a regular polyhedron or a regular polygon around different angles according to different types of axes of symmetry, cyclical splicing is implemented, and different antennas can, according to different rules, independently generate hopping sequences and switching channels; the sequence generating methods are various and flexible; the use of parallel search ensures that deterministic rendezvous with other cognitive users is achieved as quickly as possible and as much as possible in a limited time; and the present method is a highly efficient blind channel rendezvous method having wide applicability and suitable for use in large-scale wireless networks.
-
公开(公告)号：US10264469B2
公开(公告)日：2019-04-16
申请号：US15527244
申请日：2014-12-11
Inventor： Wei Liang , Haibin Yu , Chaofan Ma , Xiaoling Zhang
Abstract: The present invention relates to a robust coverage method for relay nodes in a double-layer structure wireless sensor network. The present invention is a local search based relay node 2-coverage deployment algorithm which, by means of reducing the global deployment problem to a local deployment problem, achieves optimal deployment while ensuring robustness. The method specifically comprises two steps: first 1-coverage and second 1-coverage, wherein the first 1-coverage comprises the three steps of construction of relay node candidate deployment locations, grouping of sensor nodes and local deployment of relay nodes, wherein the sensor nodes are grouped by means of a novel grouping method, and the complexity of the algorithm is reduced while ensuring optimal deployment. The second 1-coverage adjusts a threshold, selects from every group the sensor nodes covered by just one relay node, and uses a 1-coverage method to re-implement 1-coverage of the sensor nodes, thereby ensuring robustness, reducing the number of relay nodes deployed, and shortening the problem-saving time.
-
Search Results
2
records
(took 0.014 seconds)
