CN106686567B - Orientation self-organizing network neighbors based on probability optimization finds method - Google Patents
Orientation self-organizing network neighbors based on probability optimization finds method Download PDFInfo
- Publication number
- CN106686567B CN106686567B CN201611246664.1A CN201611246664A CN106686567B CN 106686567 B CN106686567 B CN 106686567B CN 201611246664 A CN201611246664 A CN 201611246664A CN 106686567 B CN106686567 B CN 106686567B
- Authority
- CN
- China
- Prior art keywords
- neighbors
- node
- beam direction
- selection probability
- beam selection
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/005—Discovery of network devices, e.g. terminals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
- H04B7/0686—Hybrid systems, i.e. switching and simultaneous transmission
- H04B7/0695—Hybrid systems, i.e. switching and simultaneous transmission using beam selection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/08—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station
- H04B7/0868—Hybrid systems, i.e. switching and combining
- H04B7/088—Hybrid systems, i.e. switching and combining using beam selection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
- H04L1/0007—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format by modifying the frame length
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Databases & Information Systems (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention proposes a kind of, and the orientation self-organizing network neighbors based on probability optimization finds method, for solving the technical issues of neighbors existing in the prior art finds low efficiency, realizes step are as follows: the beam selection probability vector of node is arranged；Modify the beam selection probability value of each beam direction；It modifies each beam direction and executes the number and send information and receive the slot length ratio of information that neighbors is searched；Selection executes the beam direction that neighbors is searched；Select neighbors search pattern；According to the information update neighbortable received and the neighbors quantity found.The execution that the present invention instructs next period to find in the neighbors of each beam direction according to node each period in the neighbors quantity that each beam direction is found, the beam selection probability of neighbors discovery is executed by optimizing each beam direction, and the slot length for executing number and send information and reception information of each beam direction is modified, improve neighbors discovery efficiency.
Description
Technical field
The invention belongs to wireless communication technology fields, are related to a kind of quick discovery side of wireless self-organization network neighbors
Method, and in particular to a kind of orientation self-organizing network neighbors discovery method based on probability optimization can be used for pure orientation wireless network
The data link layer and network layer communication Protocol Design of network.
Background technique
Wireless self-organization network is the multi-hop peer-to-peer network for capableing of dynamic group net, can not utilize any network foundation
Facility realize node between being in communication with each other, the terminal device of wireless self-organization network is various informative, can be ordinary user's computer,
Laptop, smart phone, tablet computer etc., in the exploration disaster relief, military communication, overocean communications, real-time information transmission etc.
Aspect has a wide range of applications.Directional aerial is by that in quantity set in ideal direction, will can provide longer transmission distance, reduce
Time delay improves spatial reuse, while reducing the interference between nodes, using extremely wide in various wireless networks.It is logical
It crosses and carries out information transmission using directional aerial in wireless self-organization network, the advantage of directional aerial can be utilized, improve network
Capacity enhances the transmission performance of network, but the node in wireless self-organization network is before a communication, needs to be first carried out adjacent section
Point discovery, this just needs fast and accurately neighbors discovery method.
Currently, the research of the wireless self-organization network neighbors discovery to directional aerial, is broadly divided into two kinds: with omnidirectional
The orientation neighbors discovery of antenna auxiliary and the pure orientation neighbors assisted without omnidirectional antenna are found.
Orientation neighbors discovery with omnidirectional antenna auxiliary can quickly realize that neighbors is found, efficiently carry out letter
Breath transmission, but it requires to increase omnidirectional antenna, and antenna equipment is complicated, it has not been convenient to carry, not meet wireless self-organization network shifting
The dynamic feature for facilitating tissue convenient.
Without the pure orientation neighbors discovery of omnidirectional antenna auxiliary, antenna structure is simple, is convenient for carrying, and current research is more
It focuses mostly in terms of pure directed information transmission.For example, the research team of Shanghai Communications University is in paper ＂ Neighbor
Discovery algorithms in wireless networks using directional antennas ＂
(published in Communications(ICC),2012 IEEE International Conference on,vol.,
No., pp.767-772,10-15 June 2012) in the I-SBA algorithm that proposes, be it is a kind of applied to small scale network without
The pure orientation neighbors of omnidirectional antenna auxiliary finds method.The algorithm is for the conflict and idle problem in neighbors discovery procedure
It is studied, substantially reduces collision probability by increasing an Idle state.When being executed, node is in each neighbors for the algorithm
It was found that with certain probability, one state of selection is first carried out from transmission, reception, Idle these three states before executing the period,
Node in Idle state, all in suspend mode, neither receives information nor transmits in the transmission and receive process of respective direction
Information, to reduce the conflict that receiving node receives hello information.This mode can improve search efficiency to a certain extent.But
This method only simply changes over time scanning all directions and carries out neighbors discovery, is not found using node in neighbors
The neighbors number having been found that and residue generated in the process does not find the data informations such as neighbors number, so for reducing
The effect of neighbors discovery time is not apparent.
For another example, Mir, Z.H et al. are in paper " Continuous Neighbor Discovery Protocol in
Wireless Ad Hoc Networks with Sectored-Antennas,"(published in Advanced
Information Networking and Applications(AINA),2015 IEEE 29th International
Conference on, Gwangiu, 2015, pp.54-61.) in propose NDSA algorithm, be a kind of to be held using event-driven node
The capable pure orientation neighbors without omnidirectional antenna auxiliary is found.This method when being executed, according to channel information and is found
The feedback information of neighbors, concept transfer are held in neighbors discovery procedure in transmission state, reception state, IDLE state
The continuous time, to improve the convergence rate of neighbors discovery.But the feedback information of this method is sent out just for entire direction in space
Existing neighbors quantity does not go deep into the neighbors quantity information in each direction of node, and feedback is not comprehensive, so cannot be effective
Reduce the time that node completes neighbors discovery.
Summary of the invention
It is an object of the invention to overcome above-mentioned the shortcomings of the prior art, proposes and a kind of determined based on probability optimization
Method is found to self-organizing network neighbors, passes through each beam direction setting wave beam choosing to orient each node of self-organizing network
Probability is selected, and constantly adjusts the beam selection probability during executing neighbors discovery, it is intended to change each beam direction quilt
It selects to execute the probability that neighbors is searched, for solving the orientation neighbour in existing orientation self-organizing network without omnidirectional antenna auxiliary
Existing for node discovery method the technical issues of low efficiency.
Technical thought of the invention is: for each node in orientation self-organizing network, executing neighbors at it and finds
Before, the neighbors quantity that first detection node has been found that in each beam direction, adjusts each beam direction according to testing result
Beam selection probability value；Each beam direction, which is modified, according to the beam selection probability value of each beam direction adjusted executes neighbors
It was found that number and each beam direction send information and receive information slot length；Each node is according to each wave adjusted
The beam selection probability value of Shu Fangxiang selects corresponding beam direction to execute neighbors lookup.
According to above-mentioned technical thought, realizes the technical solution that the object of the invention is taken, is achieved by the steps of:
Step 1: each Node leading-in network node quantity N, network range S and orientation day in Xiang Dingxiang self-organizing network
The beam angle θ of line, wherein N >=2, θ ∈ (0 °, 180 °]；
Step 2: each node calculates the wave beam number k of directional aerial, while basis according to the beam angle θ of directional aerial
Network node quantity N and network range S calculates each node possible neighbors quantity n on each beam direction0；
Step 3: each node carries out it in the neighbortable of each beam direction and the neighbors quantity n found initial
Change, and n=0, while utilizing possible neighbors quantity n0Each node is executed to neighbors lookup on each beam direction
Timeslot number is set as 2n0；
Step 4: each node judge neighbors quantity n that each beam direction is found whether all equal to 0, if so,
Step 5 is executed, it is no to then follow the steps 6；
Step 5: the value of each element is 0 in each node setting beam selection probability vector P, wherein P=[pi,0,
pi,1,…,pi,j,…,pi,k-1], i is node number, and k is the wave beam number of directional aerial, pi,jFor j-th of beam direction of node i
The beam selection probability that neighbors is searched is executed by selection, while each node generates k (0.5,0.8) using rand function
Random number, and using these random numbers to each beam selection Probability pi,jValue initialized, wherein 0.5 for beam selection it is general
Rate pi,jMinimum threshold pmin；
Step 6: each node according to the neighbors quantity n found on its each beam direction, to beam selection probability to
Each beam selection probability value in amount P is adjusted, and the beam selection probability value optimized is realized as follows:
Step 6a: judge neighbors quantity n and possible neighbors quantity n on the beam direction on any beam direction0
Whether n >=n is met0, if so, the beam selection probability value of the beam direction is adjusted to 0.5, and step 7 is executed, otherwise held
Row step 6b；
Step 6b: judge whether neighbors quantity n meets n=0, and the beam selection of the beam direction on the beam direction
Whether probability value is equal to 1, if so, the beam selection probability value of the beam direction is adjusted to 0.5, and executes step 7, otherwise
Execute step 6c；
Step 6c: increasing by 0.1 for the beam selection probability value of the beam direction, obtain new beam selection probability value, and
Beam selection probability value after increase is no more than 1；
Step 7: each beam selection probability value in each node judgment step 6 beam selection probability vector P adjusted
Whether p is all equal tomin, if so, executing step 12；It is no to then follow the steps 8；
Step 8: each node is arranged it and holds in each beam direction according to step 6 beam selection probability vector P adjusted
Vector of degree M and each beam direction sending time slots that row neighbors is searched and the ratio vector ψ, wherein M=[m for receiving time slot0,
m1,…,mj,…,mk-1], j is j-th of beam direction of each node, and k is the wave beam number of directional aerial, mjFor each node
J-th of beam direction by selection execute neighbors search number, For each node
J-th of beam direction execute neighbors search when sending time slots and receive time slot ratio；
Step 9: each node selects a beam direction according to the value of step 6 beam selection probability vector P adjusted
It executes neighbors to search, wherein the number searched is the numerical value m of the beam direction in the degree of node vector Mj；
Step 10: each node randomly chooses a kind of neighbors search pattern on its selected beam direction, wherein
Neighbors search pattern are as follows:
Search pattern 1: each node is first on its selected beam directionA time slot is sent
Hello information, thenA time slot receives hello information, and executes step 11；
Search pattern 2: each node is first on its selected beam directionA time slot receives
Hello information, thenA time slot sends hello information, and executes step 11；
Step 11: each node is according to the hello information received on its selected beam direction, to each beam direction
Neighbortable and the neighbors quantity n that finds be updated, and execute step 4；
Step 12: each node completes this neighbors discovery procedure.
Compared with the prior art, the invention has the following advantages:
First, the present invention is due to increasing setting wave when each node selects to execute the beam direction of neighbors lookup
The step of beam select probability vector, and the neighbors quantity found according to each beam direction adjusts the wave beam choosing of each beam direction
Probability value is selected, the beam direction for selecting unnecessary execution neighbors to search is avoided, neighbors discovery time is reduced, with existing skill
Each node random selection beam direction that art uses executes the method that neighbors is searched and compares, and effectively improves the hair of neighbors
Existing efficiency.
Second, the present invention is since each node is when its selected beam direction executes neighbors and searches, according to the wave
The beam selection probability value of Shu Fangxiang, modification node execute the number that neighbors is searched in the beam direction, change each period
Total slot length that neighbors is searched is executed, the asynchronous behavior between node is more obvious, reduces the probability of information collision, together
When, modification node current period executes transmission hello information and the time slot for receiving hello information when neighbors is searched in all directions
Length further reduces the probability of information collision, reduces the time of neighbors discovery, and the node used with the prior art exists
Each neighbors discovery period executes fixed neighbors and searches slot length and send and receive in fixed slot length
The method of hello information is compared, and the discovery efficiency of neighbors is further improved.
Detailed description of the invention
Fig. 1 is implementation process block diagram of the invention；
Fig. 2 is frame structure schematic diagram of the invention；
Fig. 3 is time slot variation schematic diagram of the invention.
Specific embodiment
Below in conjunction with the drawings and specific embodiments, the purpose of the present invention, technical solution and technical effect are made further detailed
Thin description.
Referring to Fig.1:
Step 1: each Node leading-in network node quantity N, network range S and orientation day in Xiang Dingxiang self-organizing network
The beam angle θ of line, wherein N >=2, θ ∈ { 30 °, 45 °, 60 °, 90 °, 120 ° }.
Step 2: each node calculates the wave beam number k of directional aerial, while basis according to the beam angle θ of directional aerial
Network node quantity N and network range S calculates each node possible neighbors quantity n on each beam direction0。
Here with the beam angle θ value of each node input in step 1 into wireless self-organization network, calculate every
The wave beam number k of a node.Calculation method are as follows:
Possible neighbors quantity n on each beam direction is calculated using N and S simultaneously0.Calculation method are as follows:
Wherein, node communication range is the communication attributes for orienting self-organizing network interior joint, indicates that node can transmit letter
The range of breath.
Step 3: each node carries out it in the neighbortable of each beam direction and the neighbors quantity n found initial
Change, and n=0, while utilizing neighbors quantity n0Each node is executed to the timeslot number of neighbors lookup on each beam direction
It is set as 2n0。
The neighbortable of each beam direction is initialized as 0 by each node, is indicated when starting to execute neighbors discovery, section
Point does not find any neighbors in each beam direction.Each node by its each beam direction can be performed neighbors discovery when
Gap number is set as 2n0, indicate that node executes the number of time slots that neighbors is searched in each beam direction and this beam direction can
The neighbors quantity of energy is related, is equal to n0Twice.
Step 4: each node judge neighbors quantity n that each beam direction is found whether all equal to 0, if so,
Step 5 is executed, it is no to then follow the steps 6.
The neighbors quantity that node is found in each beam direction illustrates that node executes adjacent section for the first time all equal to 0
Point is searched, therefore is executed step 5 and be configured beam selection probability vector.
Step 5: the value of each element is 0 in each node setting beam selection probability vector P, wherein P=[pi,0,
pi,1,…,pi,j,…,pi,k-1], i is node number, and k is the wave beam number of directional aerial, pi,jFor j-th of beam direction of node i
The beam selection probability that neighbors is searched is executed by selection, while each node generates k (0.5,0.8) using rand function
Random number, and using these random numbers to each beam selection Probability pi,jValue initialized, wherein 0.5 for beam selection it is general
Rate pi,jMinimum threshold pmin。
This method uses beam selection probability vector P=[pi,0,pi,1,…,pi,j,…,pi,k-1] indicate node in each wave beam
Direction executes the probability that neighbors is searched, probability value pi,jWhat more big then node i selection beam direction j execution neighbors was searched can
Energy property is bigger.Probability value p is seti,jRange between 0.5 to 0.8, can guarantee to execute neighbors every time and search Shi Douyou phase
The beam direction answered executes neighbors discovery by selection.
Step 6: each node according to the neighbors quantity n found on its each beam direction, to beam selection probability to
Each beam selection probability value in amount P is adjusted, and the beam selection probability value optimized is realized as follows:
Step 6a: judge neighbors quantity n and possible neighbors quantity n on the beam direction on any beam direction0
Whether n >=n is met0, if so, the beam selection probability value of the beam direction is adjusted to 0.5, and step 7 is executed, otherwise held
Row step 6b.
The neighbors quantity that a certain beam direction has been found is more than or equal to possible neighbors quantity, illustrates node
Have found neighbors all on the beam direction, then the neighbors discovery procedure that this period is arranged no longer is held in the beam direction
Row, can save neighbors discovery time.
Step 6b: judge whether neighbors quantity n meets n=0, and the beam selection of the beam direction on the beam direction
Whether probability value is equal to 1, if so, the beam selection probability value of the beam direction is adjusted to 0.5, and executes step 7, otherwise
Execute step 6c.
The neighbors quantity that a certain beam direction has been found is equal to 0 and its corresponding beam selection probability value has equalized
Maximum value 1, then neighbors may be not present in explanation in real network on the beam direction, so the wave of the beam direction is arranged
Beam select probability value is equal to 0.5, so that the neighbors discovery procedure in this period is no longer executed in the beam direction, can save neighbour
Node discovery time.
Step 6c: increasing by 0.1 for the beam selection probability value of the beam direction, obtain new beam selection probability value, and
Beam selection probability value after increase is no more than 1.
The beam selection probability value of certain beam direction does not reach maximum value, and the adjacent section found on the beam direction
Point quantity does not reach n0, then the neighbors discovery procedure in this period need to continue to execute in the beam direction, so as in the wave beam
Direction finds more neighbors.
Step 7: each beam selection probability value in each node judgment step 6 beam selection probability vector P adjusted
Whether p is all equal tomin, if so, step 12 is executed, it is no to then follow the steps 8.
pminIt indicates that a beam direction of node can execute the minimum value that neighbors is searched by selection, is advised according to network
Mould and communication requirement are set as 0.5.When the beam selection probability value of certain beam direction is equal to pminWhen, node thinks the direction
Neighbors is all found or the direction does not have neighbors, then the reselection beam direction does not execute neighbors to node
It searches.When the beam selection probability value of all beam directions is equal to pminWhen, indicate that node checks to all neighbors, are completed
Neighbors discovery procedure.
Step 8: each node is arranged it and holds in each beam direction according to step 6 beam selection probability vector P adjusted
Vector of degree M and each beam direction sending time slots that row neighbors is searched and the ratio vector ψ, wherein M=[m for receiving time slot0,
m1,…,mj,…,mk-1], j is j-th of beam direction of each node, and k is the wave beam number of directional aerial, mjFor each node
J-th of beam direction by selection execute neighbors search number, For each node
J-th of beam direction execute neighbors search when sending time slots and receive time slot ratio.
Each node in self-organizing network is oriented according to the beam selection of beam direction each in beam selection probability vector
Probability value, setting respective beam direction execute the secondary numerical value and the beam direction sending time slots that neighbors is searched and receive time slot
Ratio, that is, according to pi,jSet mjWithValue.
Setting means are as follows: work as pi,jWhen=0.5, m is setj=0,Indicate this period of node the beam direction not
Neighbors is executed to search；As 0.5 < pi,jWhen≤0.7, m is setj=1,Indicate that this period of node holds in the beam direction
Neighbors of row is searched, and sending time slots are identical with timeslot number is received on the beam direction；As 0.7 < pi,jWhen≤0.85, if
Set mj=2,It indicates that this period of node executes neighbors twice in the beam direction and searches, and is received on the beam direction
The length of time slot is twice of sending time slots length, and doing so can guarantee that node receives hello information on more time slots,
To find neighbors faster；As 0.85 < pi,jWhen≤1, m is setj=1,When beam selection probability value increases to
When 0.85, the neighbors for illustrating that the beam direction had executed certain number in the period in front is searched, so setting section
This period of point searches in the beam direction Exactly-once neighbors, while the length that reception time slot on the beam direction is arranged is
Twice of sending time slots length guarantees that node receives hello information on more time slots, reduces the conflict of hello information,
To find neighbors faster.
Step 9: each node selects a beam direction according to the value of step 6 beam selection probability vector P adjusted
It executes neighbors to search, wherein the number searched is the numerical value m of the beam direction in the degree of node vector Mj。
Node selects a beam direction according to the beam selection probability value of beam direction each in beam selection probability vector
The process for searching neighbors is executed, and searches m in the directionjIt is secondary.
Step 10: each node randomly chooses a kind of neighbors search pattern on its selected beam direction, wherein
Neighbors search pattern are as follows:
Search pattern 1: each node is first on its selected beam directionA time slot is sent
Hello information, thenA time slot receives hello information, and executes step 11.
Search pattern 2: each node is first on its selected beam directionA time slot receives hello
Information, thenA time slot sends hello information, and executes step 11.
Two kinds of search patterns, which are arranged, can reduce the conflict of hello information, increase and execute what neighbors was searched between node
Asynchronous behavior.
Step 11: each node is according to the hello information received on its selected beam direction, to each beam direction
Neighbortable and the neighbors quantity n that finds be updated, and execute step 4.
After node receives hello information, according to the content in hello information, record corresponding neighbors ID number and
The information such as beam direction number, while the neighbors quantity found is added 1.
Step 12: each node completes this neighbors discovery procedure.
Referring to Fig. 2:
Fig. 2 describes the frame structure schematic diagram that each node executes neighbors discovery procedure.
Referring to Fig. 3:
Fig. 3 (a) describes each node and sends hello information in each beam direction and receive the time slot of hello information
Ratio changes schematic diagram.
Fig. 3 (b) describes the total slot length variation schematic diagram for executing neighbors discovery in each node each period.
The content being not described in detail in description of the invention belongs to the well-known technique of those skilled in the art.Thought based on the present invention
The modifications and variations thought are still within the scope of the claims of the present invention.
Claims (3)
1. a kind of orientation self-organizing network neighbors based on probability optimization finds method, include the following steps:
(1) wave of each Node leading-in network node quantity N in Xiang Dingxiang self-organizing network, network range S and directional aerial
Beam angle, θ, wherein N >=2, θ ∈ (0 °, 180 °]；
(2) each node calculates the wave beam number k of directional aerial according to the beam angle θ of directional aerial, while according to network section
Point quantity N and network range S, calculates each node possible neighbors quantity n on each beam direction0；
(3) each node initializes it in the neighbortable of each beam direction and the neighbors quantity n found, and n
=0, while utilizing possible neighbors quantity n0Each node is executed to the timeslot number of neighbors lookup on each beam direction
It is set as 2n0；
(4) each node judges neighbors quantity n that each beam direction is found whether all equal to 0, if so, thening follow the steps
(5), no to then follow the steps (6)；
(5) value of each element is 0 in each node setting beam selection probability vector P, wherein P=[pi,0,pi,1,…,
pi,j,…,pi,k-1], i is node number, and k is the wave beam number of directional aerial, pi,jIt is selected for j-th of beam direction of node i
The beam selection probability that neighbors is searched is executed, while each node generates the random of k a (0.5,0.8) using rand function
Number, and using these random numbers to each beam selection Probability pi,jValue initialized, then execute step (7), wherein 0.5
For beam selection Probability pi,jMinimum threshold pmin；
(6) each node is according to the neighbors quantity n found on its each beam direction, in beam selection probability vector P
Each beam selection probability value is adjusted, the beam selection probability value optimized, is realized as follows:
(6a) judges neighbors quantity n and possible neighbors quantity n on the beam direction on any beam direction0Whether n is met
≥n0, if so, the beam selection probability value of the beam direction is adjusted to 0.5, and step (7) are executed, it is no to then follow the steps
(6b)；
(6b) judges whether neighbors quantity n meets n=0, and the beam selection probability value of the beam direction on the beam direction
Whether it is equal to 1, if so, the beam selection probability value of the beam direction is adjusted to 0.5, and executes step (7), otherwise execute
Step (6c)；
The beam selection probability value of the beam direction is increased by 0.1 by (6c), obtains new beam selection probability value, and after increase
Beam selection probability value is no more than 1；
(7) the beam selection probability vector or step (6) beam selection adjusted after each node judgment step (5) initialization
Whether each beam selection probability value in probability vector is all equal to pmin, if so, step (12) are executed, it is no to then follow the steps
(8)；
(8) each node is according to the judging results of step (7), be arranged its each beam direction execute number that neighbors is searched to
It measures M and each beam direction sending time slots and receives the ratio vector ψ of time slot, wherein M=[m0,m1,...,mj,...,mk-1], j is
J-th of beam direction of each node, k are the wave beam number of directional aerial, mjIt is selected for j-th of beam direction of each node
It selects and executes the number that neighbors is searched, It is executed for j-th of beam direction of each node
The ratio of sending time slots and reception time slot when neighbors is searched；
(9) each node selects a beam direction to execute according to the value of step (6) beam selection probability vector P adjusted
Neighbors is searched, wherein the number searched is the numerical value m of the beam direction in the degree of node vector Mj；
(10) each node randomly chooses a kind of neighbors search pattern on its selected beam direction, and wherein neighbors is looked into
Look for mode are as follows:
Search pattern 1: each node is first on its selected beam directionA time slot sends hello letter
Breath, thenA time slot receives hello information, and executes step (11)；
Search pattern 2: each node is first on its selected beam directionA time slot receives hello letter
Breath, thenA time slot sends hello information, and executes step (11)；
(11) each node saves the neighbour of each beam direction according to the hello information received on its selected beam direction
Point table and the neighbors quantity n found are updated, and execute step (4)；
(12) each node completes this neighbors discovery procedure.
2. the orientation self-organizing network neighbors according to claim 1 based on probability optimization finds that method, feature exist
In: beam selection Probability p described in step (5)i,jMinimum threshold pmin, refer to each section in orientation self-organizing network
Each beam direction of point, which is not selected, executes the probability value that neighbors is searched, and size is to need to set according to network size and communication
It sets.
3. the orientation self-organizing network neighbors according to claim 1 based on probability optimization finds that method, feature exist
In: its Vector of degree M and the transmission of each beam direction in the execution neighbors lookup of each beam direction of setting described in step (8)
Time slot and the ratio vector ψ for receiving time slot refer to each node in orientation self-organizing network according to beam selection probability vector P
In each beam direction value pi,j, set corresponding beam direction and execute the number m that neighbors is searchedjWhen with sending time slots and reception
The ratio of gapSetting means are as follows: work as pi,jWhen=0.5, m is setj=0,As 0.5 < pi,jWhen≤0.7, m is setj=
1,As 0.7 < pi,jWhen≤0.85, m is setj=2,As 0.85 < pi,jWhen≤1, m is setj=1,
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611246664.1A CN106686567B (en) | 2016-12-29 | 2016-12-29 | Orientation self-organizing network neighbors based on probability optimization finds method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611246664.1A CN106686567B (en) | 2016-12-29 | 2016-12-29 | Orientation self-organizing network neighbors based on probability optimization finds method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106686567A CN106686567A (en) | 2017-05-17 |
| CN106686567B true CN106686567B (en) | 2019-10-11 |
Family
ID=58872187
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611246664.1A Active CN106686567B (en) | 2016-12-29 | 2016-12-29 | Orientation self-organizing network neighbors based on probability optimization finds method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106686567B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109348537B (en) * | 2018-10-28 | 2023-05-12 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Multi-beam self-organizing network channel access control method |
| CN113490199B (en) * | 2021-06-28 | 2023-10-20 | 广东电网有限责任公司广州供电局 | Self-organizing network neighbor node discovery method with self-adaptive power consumption |
| CN113596807B (en) * | 2021-07-26 | 2023-08-11 | 广东电网有限责任公司广州供电局 | Neighbor node discovery method of self-adaptive time slot |
| CN114040375B (en) * | 2021-10-19 | 2023-10-13 | 广东技术师范大学 | Neighbor discovery conflict coordination method, system, computer equipment and storage medium |
| CN115052281B (en) * | 2022-03-28 | 2023-08-29 | 广东电网有限责任公司广州供电局 | Neighbor node discovery method for self-adaptive node density of electric power construction site |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101908913A (en) * | 2010-08-20 | 2010-12-08 | 上海交通大学 | Scanning method of directive antenna-based Ad Hoc network neighbor nodes |
| EP2451204A1 (en) * | 2010-11-04 | 2012-05-09 | Thales Nederland B.V. | A maritime mobile ad-hoc network |
| CN103686611A (en) * | 2013-12-18 | 2014-03-26 | 中国电子科技集团公司第五十四研究所 | Novel neighbor finding method based on directional antenna |
| CN105873007A (en) * | 2016-03-25 | 2016-08-17 | 西安电子科技大学 | Method for discovering neighbor nodes in wireless ad hoc network of switchable beam antenna |
-
2016
- 2016-12-29 CN CN201611246664.1A patent/CN106686567B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101908913A (en) * | 2010-08-20 | 2010-12-08 | 上海交通大学 | Scanning method of directive antenna-based Ad Hoc network neighbor nodes |
| EP2451204A1 (en) * | 2010-11-04 | 2012-05-09 | Thales Nederland B.V. | A maritime mobile ad-hoc network |
| CN103686611A (en) * | 2013-12-18 | 2014-03-26 | 中国电子科技集团公司第五十四研究所 | Novel neighbor finding method based on directional antenna |
| CN105873007A (en) * | 2016-03-25 | 2016-08-17 | 西安电子科技大学 | Method for discovering neighbor nodes in wireless ad hoc network of switchable beam antenna |
Non-Patent Citations (1)
| Title |
|---|
| An Intelligent Neighbor Discovery Algorithm forAd Hoc Networks with Directional Antennas;shengbo Huang;《proceedings 2013 international conference on mechatronic sciences,EMC IEEE》;20131222;正文全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106686567A (en) | 2017-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106686567B (en) | Orientation self-organizing network neighbors based on probability optimization finds method | |
| CN101908913B (en) | Scanning method of directive antenna-based Ad Hoc network neighbor nodes | |
| CN109348537B (en) | Multi-beam self-organizing network channel access control method | |
| Malak et al. | Optimal caching for device-to-device content distribution in 5G networks | |
| Hao et al. | Green communication for NOMA-based CRAN | |
| Komali et al. | Distributed topology control in ad-hoc networks: A game theoretic perspective | |
| CN105873007B (en) | The wireless self-organization network neighbors of beam switchable antenna finds method | |
| Zhou et al. | Multi-beam transmission and dual-band cooperation for control/data plane decoupled WLANs | |
| Ye et al. | Deep reinforcement learning-assisted energy harvesting wireless networks | |
| CN117318071B (en) | Power load regulation and control system and method based on high-speed wireless transmission network | |
| Ren et al. | Multi-Slice Joint Task Offloading and Resource Allocation Scheme for Massive MIMO Enabled Network. | |
| Moghaddam et al. | Efficient base-centric/user-centric clustering algorithms based on thresholding and sorting | |
| Liu et al. | Concurrent multi-beam transmissions for reliable communication in millimeter-wave networks | |
| Manisekaran et al. | Energy efficient hierarchical clustering for sensor networks | |
| Shen et al. | Routing protocols using directional antennas in ad hoc networks: A comparative review | |
| CN105722143B (en) | A kind of mobile terminal energy consumption optimization method based on probability switching | |
| Chen et al. | Transmission power optimization algorithm in wireless ad hoc networks | |
| Zheng et al. | Cooperative antenna selection method for directional antenna ad hoc networks based on ALOHA | |
| Sun et al. | Multi-Agent Deep Reinforcement Learning for Access Point Activation Strategy in Cell-Free Massive MIMO Networks | |
| Burghal et al. | Base station assisted neighbor discovery in device to device systems | |
| CN113596807B (en) | Neighbor node discovery method of self-adaptive time slot | |
| Wang et al. | Neighbor discovery algorithm in wireless local area networks using multi-beam directional antennas | |
| Liu et al. | A novel multi-path routing algorithm based on clustering for wireless mesh networks | |
| Zhihong et al. | Review on strategic technology of dense connection for the future mobile network [J] | |
| Liu et al. | Radio resource allocation for RIS-aided D2D communication based on greedy hypergraph-with-weight coloring |
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 |