CN105873007B - The wireless self-organization network neighbors of beam switchable antenna finds method - Google Patents
The wireless self-organization network neighbors of beam switchable antenna finds method Download PDFInfo
- Publication number
- CN105873007B CN105873007B CN201610177121.2A CN201610177121A CN105873007B CN 105873007 B CN105873007 B CN 105873007B CN 201610177121 A CN201610177121 A CN 201610177121A CN 105873007 B CN105873007 B CN 105873007B
- Authority
- CN
- China
- Prior art keywords
- node
- neighbors
- information
- value
- discovery
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/04—TPC
- H04W52/30—TPC using constraints in the total amount of available transmission power
- H04W52/36—TPC using constraints in the total amount of available transmission power with a discrete range or set of values, e.g. step size, ramping or offsets
- H04W52/362—Aspects of the step size
Abstract
The invention proposes a kind of wireless self-organization network neighbors of beam switchable antenna to find method, for solving the problems, such as neighbors discovery low efficiency existing in the prior art, includes the following steps: the possible neighbors quantity of calculate node all directions；Judging whether node all directions search terminates；It chooses node neighbors and finds direction；Judge that direction neighbors discovers whether to terminate；Node is selected to execute the mode of neighbors discovery；It selects the node of the first mode first to transmit and is followed by breath of collecting mail；It selects the node of second of mode first to receive and transmits information afterwards；Node judges neighborhood information according to the information received, prepares next neighbors discovery.The execution that the present invention has found in the neighbors of the direction according to node in the neighborhood information adjustment that each direction is found next time, simultaneously according to the information transimission power of the direction change of event-driven neighbors discovery and adjustment neighbors discovery, neighbors discovery time and information collision probability are reduced.
Description
Technical field
The invention belongs to fields of communication technology, are related to a kind of discovery method of wireless self-organization network neighbors, specifically relate to
And a kind of self-organizing network neighbors discovery method of beam switchable antenna is, it can be achieved that neighbors in wireless self-organization network
Quickly discovery is used for pure directional aerial physical layer communication agreement.
Background technique
Wireless self-organization network is one using communication, the mobility peer-to-peer network of the multi-hop of dynamic group net
Network, being in communication with each other between existing network infrastructure can not be utilized to realize node, in sensor network and the exploration disaster relief etc.
Aspect has a wide range of applications.With the development of antenna technology, signal can be gathered single direction by directional aerial, compared with complete
To antenna, directional aerial transmission range is farther, and signal radiation range is bigger when safety is higher and same transmission power, can be switched
The one kind of beam antenna as directional aerial, using extremely wide in various wireless networks.Currently, in wireless self-organization network
The middle advantage that directional aerial can be preferably utilized using the transmission of directional aerial progress information, improves network transmission performance, still
Node in wireless self-organization network needs self-organizing self-configuring to complete neighbors discovery before transmission information is in communication with each other,
This just needs quickly and accurately neighbors discovery method.
Currently, the wireless self-organization network of beam switchable antenna, which executes neighbors discovery, is broadly divided into two ways: adopting
It is found with time driving neighbors and is found using event-driven neighbors.
Referred to using the discovery of time driving neighbors, node is during executing neighbors discovery, successively in each side
Emit to execution information and receive, then according to the direction of the variation adjustment neighbors discovery of time, until all directions are complete
It is found at neighbors, this time driven manner does not account for some direction neighbors discoveries in the implementation procedure of neighbors discovery
Some direction neighbors find slow-footed phenomenon to speed fastly, do not find situation predicate node at this according to real-time neighbors
The neighborhood information in direction only changes the direction of neighbors discovery by the variation of time, this allows for neighbors discovery time
It is longer." the Adaptive Scan-based Asynchronous Neighbor Discovery for example, Yang Wang is in paper
in wireless networks using directional antennas,"(published in Wireless
Communications&Signal Processing(WCSP),2013International Conference on,
Hangzhou, 2013, pp.1-6.) the neighbor node discovery method SBAN proposed in is a kind of typically adjacent using time driving
The method of node discovery.This method uses give out a contract for a project at a slow speed a mechanism and a Quick-return mechanism.The two mechanism are distinguished
The behavior of transmitting node and receiving node, transmitting node are emitted at a slow speed, send hello information in one direction, then
It waits certain time slot to receive ack information in same direction, terminates to go to the identical operation of next direction execution until the time；It connects
It receives node quickly to be scanned, antenna scans hello information in entire 360 ° of directions, and end of scan posterior nodal point is receiving
Ack is replied on the direction of hello information, completes neighbors discovery.The shortcoming of this method is only to change by time change
The direction of neighbors discovery, not according to the direction change of certain event triggering node, this allows for neighbors discovery time
It is longer.
Referred to using the discovery of event-driven neighbors, node is selecting a side during executing neighbors discovery
Backward, neighbors situation that the direction has been found that is judged according to corresponding event first, if the neighbors of direction discovery
Situation is able to satisfy communication, turns to next direction with regard to driving node and executes neighbors discovery, this direction no longer executes neighbors discovery,
This mode does not need successively to emit and receive in each direction execution information.Event driven manner fully considers that neighbors is found
Some direction discovery speed find slow-footed phenomenon in some directions fastly in the process, can find situation according to real-time neighbors
For predicate node in the neighbors situation of the direction, this just significantly reduces neighbors discovery time.For example, Mir, Z.H et al.
" the Continuous Neighbor Discovery Protocol in Wireless Ad Hoc Networks in paper
with Sectored-Antennas,"(published in Advanced Information Networking and
Applications(AINA),2015IEEE 29th International Conference on,Gwangiu,2015,
Pp.54-61. the NDSA proposed in) is a method using the discovery of event-driven neighbors.NDSA divides the channel access time
At superframe CYCLE one by one, this frame includes three status sections: LISTEN, TRANSMIT, SLEEP.Node carries out neighbors
It was found that when, it can be arbitrarily switched between three states of CYCLE process.In LISTEN state, node omnidirectional receives hello letter
Breath；In TRANSMIT state, node broadcasts hello information in all directions, at the same before being transmitted first monitor channel to keep away
Exempt to conflict；In SLEEP state, node maintains sleep, saves energy.Node starts in each CYCLE according to actual channel
The execution time of the independent execution for determining each state of collision feedback situation and each state, finally according to CYCLE interior joint
Time span in SLEEP state come determine whether neighbors discovery terminate.This method is when being executed according to channel and adjacent section
The feedback of point changes each state duration, improves the convergence rate of neighbors discovery.But this method does not go deep into node
The neighbors feedback in each direction only considered the neighbors discovery situation in entire 360 ° of directions, and feedback information is not comprehensive,
The purpose realization for completing neighbors discovery according to event-driven node is not complete enough, completes adjacent section still without node is effectively reduced
The time of point discovery.
Summary of the invention
It is an object of the invention to overcome the problems of the above-mentioned prior art, a kind of nothing of beam switchable antenna is proposed
Line self-organizing network neighbors finds method, the alternative condition of scanning direction and neighbour when executing neighbors discovery by improving node
The Rule of judgment that node discovery is completed, while being added and the direction is changed according to the real-time neighbors discovery quantity situation in each direction
The strategy of information transimission power and state select probability, the wireless self-organization network for solving existing beam switchable antenna are adjacent
Present in node discovery method the technical issues of low efficiency.
Realize above-mentioned purpose technical thought be: each node select a direction carry out transmitting hello information or
Before receiving hello information, first judges the neighbors discovery situation of the direction, decide whether to hold in the direction according to judging result
Row neighbors finds and whether needs to increase information transimission power to improve the probability of direction discovery neighbors；Each node
Before executing neighbors discovery, first transmitting information is selected to be followed by receiving information pattern or first receive transmitting information mode after information；Often
A node passes through certain actual transmission state of probability selection or sleep state when transmitting hello information；Each node
After receiving hello information, the neighborhood information table of this node is updated according to the neighborhood information carried in the hello information,
Record corresponding neighborhood information；Each node increases or reduces different directions according to the neighbors quantity situation received
Information transimission power and state select probability.
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: all Node leading-in network ranges into wireless self-organization network and node total number within this range,
And the find_finished value of each node all directions is set, the preliminary sweep direction sequence of neighbortable and each node, just
Beginning state select probability P2, wherein the find_finished value indicates the end situation of each direction neighbors discovery, it is described
The find_finished value for setting all directions is 0；
Step 2: node total number of each node according to the network range imported and within this range calculates its all directions
Upper possible neighbors quantity m；
Step 3: each node judges whether all direction neighbors according to the find_finished value of all directions
It was found that terminating, if the find_finished value of all directions is equal to 1, neighbors discovery terminates, and otherwise, executes step 4；
Step 4: each node carries out a side of neighbors discovery according to the preliminary sweep direction sequence, selection
To；
Step 5: each node judges that direction neighbors is sent out according to the find_finished value on the direction of its selection
Now whether terminate, if find_finished value is equal to 1, the discovery of direction neighbors terminates, and executes step 4, no to then follow the steps
6；
Step 6: the mode that two kinds of neighbors are found is arranged to each node, is realized as follows:
Step 6a: setting self-organized network nodes first transmit information and are followed by receiving information pattern；
Step 6b: setting self-organized network nodes transmit information pattern after first receiving information；
Step 6c: Setting pattern select probability P1；
Step 7: each node generates the numerical value K1 of (0,1) using rand function at random, and compare numerical value K1 with it is described
The size of model selection probability P 1 selects the mode for executing neighbors discovery according to comparison result, if K1≤P1, described in selection
First transmission information be followed by receive information pattern, execute step 8, otherwise select to transmit information pattern after first receiving information, execute step
Rapid 12；
Step 8: each node generates the numerical value K2 of (0,1) using rand function at random, and compares numerical value K2 and the shape
The size of state select probability P2 judges execution state according to comparison result, if K2≤P2, executes step 9, no to then follow the steps
10；
Step 9: hello information is arranged in each node, while sending up 2 × m hello letter in its selected side
Breath executes step 11；
Step 10: each node sleep on its selected direction；
Step 11: each node checks whether the mode locating for it is that the first transmission information is followed by receiving information pattern,
If so, step 12 is executed, it is no to then follow the steps 3；
Step 12: each node receives hello information in its selected direction, and judges whether to receive hello letter
Breath executes step 13 if receiving, no to then follow the steps 18；
Step 13: whether each node judges the hello information according to the node ID number in the hello information received
It is what new neighbors was sent, meanwhile, each node should according to the neighborhood information table in the hello information received, judgement
Whether include this node ID number in neighbortable, if meeting simultaneously, executes step 14, it is no to then follow the steps 17；
Step 14: the neighbors quantity in its selected direction is added one by each node；
Step 15: each node judges that its selected direction neighbors quantity adds whether one value is equal to m, if being equal to,
Step 16 is executed, it is no to then follow the steps 17；
Step 16: it is 1 that each node, which changes the find_finished value on its selected direction,；
Step 17: each node is according to the hello information update neighbortable received, while record receives
The node ID number and beam direction information for including in hello information execute step 19；
Step 18: power change steps PW value being increased to the information transmission power level of each node, obtains bigger information
Transmission power level, while 0.1 is increased to the state select probability P2, obtain bigger state select probability P2 value；
Step 19: each node checks whether the mode locating for it is that the first transmission information is followed by receiving information pattern,
If so, step 3 is executed, it is no to then follow the steps 8.
Compared with the prior art, the invention has the following advantages:
First, since the present invention is after the direction selection that node executes neighbors discovery, addition judges the direction
It was found that neighbors the step of whether meeting direction communication requirement situation, and decided whether that the party need to be executed according to judging result
To neighbors discovery, with prior art interior joint after choice direction immediately the direction execute neighbors discovery compared with, have
Effect reduces neighbors discovery time, improves neighbors discovery efficiency.
Second, since the present invention is when node executes the neighbors discovery for completing each direction, addition is sent out according to the direction
Whether existing neighbors quantity situation judgement needs to increase information transimission power when the direction executes neighbors discovery next time,
So as to next time the direction execute neighbors discovery it can be found that from this node it is farther with a distance from neighbors, and in the prior art
Neighbors discovery next time is executed using fixed information transimission power to compare, and the probability of neighbors discovery is improved, into one
Step improves neighbors discovery efficiency.
Third does not need shaking hands between node, does not need node reverts back confirmation letter since the present invention is during execution
Confirmation information to neighbors is included in the hello information sent by breath, node, and entire implementation procedure only has hello information
Transmission reduce info class compared with using a plurality of types of validation of information hello information reception conditions in the prior art
Type avoids the problem of information confusion caused by transmission multiple types information and receiving node processing complexity, executes neighbors hair
Now it is simple and efficient.
4th, since the present invention before node sends hello information by being added the step of execution state selects, node
When starting to execute neighbors discovery, selects to send with original state select probability or sleep state, adjacent with discovery are saved
The variation of point quantity, node increase or reduce the state select probability, concept transfer be in send or sleep state it is general
Rate, compared with what is used in the prior art does not distinguish node state or distinguishes node state but do not change state select probability,
Information collision can be further avoided, node energy is saved.
Detailed description of the invention
Fig. 1 is flow diagram of the invention；
Fig. 2 is implementation procedure schematic diagram of the invention；
Fig. 3 is the pattern diagram that two kinds of neighbors are found in the present invention；
Fig. 4 is the content schematic diagram of hello information in the present 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: all Node leading-in network ranges into wireless self-organization network and node total number within this range,
And the find_finished value of each node all directions is set, the preliminary sweep direction sequence of neighbortable and each node, just
Beginning state select probability P2, wherein the find_finished value of the setting all directions is 0.
Network range and node total number are used to indicate the essential attribute situation of the network.Each node is arranged in all directions
Find_finished value and neighbortable indicate that each direction finds situation, find_ in the neighbors in each direction
Finished value indicates that the end situation of each direction neighbors discovery, neighbortable indicate the adjacent section that each direction has been found that
Point information.Preliminary sweep sequence is arranged in each node, indicates that node carries out the inceptive direction variation of neighbors discovery, is arranged here
For change sequence clockwise, illustrate that the direction change of neighbors discovery is variation clockwise.
Step 2: node total number of each node according to the network range imported and within this range calculates its all directions
Upper possible neighbors quantity m.
Here with the range size from step 1 to wireless self-organization network and node of the network of each node input in
Sum, calculating each node indicates the adjacent section in each direction in the possible neighbors quantity m in each direction, neighbors quantity m
Point degree.Calculation method is as follows:
Wherein, node communication range is a communication attributes of node, indicates that node can transmit information and receive information
Range, switching antenna lobe number be the switching antenna an attribute, indicate switching antenna lobe number, the two numerical value
Belong to each node in wireless self-organization network and executes the attribute value set before neighbors discovery.
Step 3: each node judges whether all direction neighbors according to the find_finished value of all directions
It was found that terminating, if the find_finished value of all directions is equal to 1, neighbors discovery terminates, and otherwise, executes step 4.
Situation is found in all directions neighbors using find_finished value mark node in the present invention, if node exists
The find_finished value in some direction is 1, indicates that the discovery of direction neighbors terminates, node executes neighbors hair next time
It can not now be carried out in the direction, if node all directions find_finished value is 1, indicate node neighbors discovery knot
Beam can carry out neighbors maintenance, if node is 0 there are also the find_finished value in some directions, indicate that node is not complete
At neighbors discovery procedure, also need to continue to execute neighbors discovery.
Step 4: each node carries out a side of neighbors discovery according to the preliminary sweep direction sequence, selection
To.
Step 5: each node judges that direction neighbors is sent out according to the find_finished value on the direction of its selection
Now whether terminate, if find_finished value is equal to 1, the discovery of direction neighbors terminates, and executes step 4, otherwise executes 6.
If the direction find_finished value of node is 1, indicate that node can satisfy in the neighbors that the direction is found
The communication requirement of the direction needs not continue to execute neighbors discovery in the direction, can reselect an execution neighbors
It was found that direction, node execute the direction neighbors discovery before execute this judgement can be effectively reduced neighbors discovery when
Between.
Step 6: the mode that two kinds of neighbors are found is arranged to each node, is realized as follows:
It is followed by receiving information pattern step 1: setting self-organized network nodes first transmit information, as shown in Fig. 3 (a)；
Step 2: setting self-organized network nodes transmit information pattern after first receiving information, as shown in Fig. 3 (b)；
Step 3: Setting pattern select probability P1.
Here setting select probability P1 value is 0.5, and node first transmits information with identical probability selection and is followed by breath mould of collecting mail
Information pattern is transmitted after formula or first reception information, two kinds of message transmission modes of each node differentiation can be improved node and successfully connect
The probability of information is received, the probability of information transmission success can be effectively improved, while improving neighbors probability of detection.
Step 7: each node generates the numerical value K1 of (0,1) using rand function at random, and compare numerical value K1 with it is described
The size of model selection probability P 1 selects the mode for executing neighbors discovery according to comparison result, if K1≤P1, described in selection
First transmission information be followed by receive information pattern, execute step 8, otherwise select to transmit information pattern after first receiving information, execute step
Rapid 12.
Step 8: each node generates the numerical value K2 of (0,1) using rand function at random, and compares numerical value K2 and the shape
The size of state select probability P2 judges execution state according to comparison result, if K2≤P2, executes step 9, no to then follow the steps
10。
It is 0.8 that probability P 2 value initial value, which is arranged, and with the execution that neighbors is found, node in each direction according to finding
The size of quantity situation adjustment 2 value of probability P of neighbors, so that node is in the probability for sending hello information and is in sleep
Shape probability of state real-time change.If neighbors negligible amounts or do not find neighbors that node is found in this direction,
Increase 2 value of probability P, the probability that this direction sends hello information is improved, if the neighbors quantity energy that node is found in this direction
It is enough to meet communication needs, then reduce 2 value of probability P, reduces the probability that this direction sends hello information.Node is real in each direction
When adjustment state selection probability, be capable of increasing neighbors probability of detection, while saving node energy.
Step 9: hello information is arranged in each node, while sending up 2 × m hello letter in its selected side
Breath executes step 11.
The particular content of Hello information is as shown in Figure 4.
Step 10: each node sleep on its selected direction.
Node is equal to the time span of 2 × m hello information transmission in the time of direction sleep.Sleep indicates section
Point is received in the direction neither execution information transmission nor execution information, and node selects that node can be saved in direction sleep
Energy, and conflict collision of the hello information at receiving node can be effectively reduced, improve hello information and be properly received
Probability further increases neighbors discovery efficiency.
Step 11: each node checks whether the mode locating for it is that the first transmission information is followed by receiving information pattern,
If so, step 12 is executed, it is no to then follow the steps 3.
For node after being sent completely hello information, execution judges whether the mode locating for it is to receive after first transmitting information
Information pattern is that information transmission is different with the received sequencing of information during executing neighbors discovery due to node,
And each pattern Exactly-once information is sent and primary information receives, if mode locating for node is sent out after first receiving information
Information pattern is penetrated, then node is completed after sending information, no longer execution information is received, if mode locating for node is first to emit
Information is followed by receiving information pattern, then node is completed after sending information, also execution information is needed to receive.
Step 12: each node receives hello information in its selected direction, and judges whether to receive
Hello information executes step 13 if receiving, no to then follow the steps 18.
Node is in the time span that the time that selected direction receives hello information is the transmission of 2 × m hello information.
Due to the uncertainty of neighborhood information, node may not be received when selected direction executes and receives hello information
Any information, so node executes step 18 and increases information transimission power, it is effective to increase information transmission range, increase neighbors
Probability of detection.
Step 13: whether each node judges the hello information according to the node ID number in the hello information received
It is what new neighbors was sent, meanwhile, each node should according to the neighborhood information table in the hello information received, judgement
Whether include this node ID number in neighbortable, if meeting simultaneously, executes step 14, it is no to then follow the steps 17.
When each node receives hello information, the node ID number in the hello information is checked, if be present in this section
In the neighbortable of point respective direction, if it does not, illustrate that this node has not found the node for sending the hello information,
This node needs to record the nodal information of hello information carrying, if it does, illustrating that the hello information is not this node
What new neighbors was sent, that is to say, that this node has been found that the hello information carries before receiving the hello information
Node.
Whether node is checked comprising this node ID number in the neighborhood information table in hello information, if comprising saying simultaneously
The bright node for emitting the hello information has been found that this node, if do not included, illustrates that the node for emitting the hello information does not have
Be found this node, this node also need transmitting hello information so as to the node it can be found that oneself.If the two judge while expiring
Foot illustrates that the node of this node and transmitting hello information is mutually found, direction neighbors quantity will be arranged in this node
Add one.
Step 14: its selected direction neighbors quantity is added one by each node.
Step 15: each node judges that its selected direction neighbors quantity adds whether one value is equal to m, if being equal to,
Step 16 is executed, it is no to then follow the steps 17.
When the neighbors quantity of each node in one direction is equal to m, indicate that node is found in the neighbors of the direction
It completes, node does not need to execute in the direction when executing neighbors discovery next time, when can be effectively reduced neighbors discovery
Between.
Step 16: it is 1 that each node, which changes the find_finished value on its selected direction,.
Step 17: each node is according to the hello information update neighbortable received, while record receives
The node ID number and beam direction information for including in hello information execute step 19.
Each node will included in the hello information that received send the hello information neighbors ID number and
The beam direction that neighbors sends the hello information is recorded in the neighbortable of the respective direction of this node.
Step 18: power change steps PW value being increased to the information transmission power level of each node, obtains bigger information
Transmission power level, while 0.1 is increased to the state select probability P2, obtain bigger state select probability P2 value.
Node is not received by hello information in the direction, then increases the letter of the direction according to power change steps PW value
Transimission power is ceased, so that the range of node increase transmitting and reception information, guarantee receives hello information next time, and power becomes
Change step-length PW value to be needed according to network size and communication to be arranged.
Node enlarging state select probability can increase node and be in transmission shape probability of state, increase hello information and send
A possibility that with being properly received, meanwhile, if node does not have enlarging state select probability P2, node is more in sleep
State, can save node energy, the initial value of state select probability P2 in step 1 according to network size and communication need come
Setting.
Step 19: each node checks whether the mode locating for it is that the first transmission information is followed by receiving information pattern,
If so, step 3 is executed, it is no to then follow the steps 8.
For node after completing to receive hello information, execution judges whether the mode locating for it is to receive after first transmitting information
Information pattern is that information transmission is different with the received sequencing of information during executing neighbors discovery due to node,
And each pattern Exactly-once information is sent and primary information receives, if mode locating for node is sent out after first receiving information
Information pattern is penetrated, then node is completed after receiving information, also execution information is needed to send, if mode locating for node is first to emit
Information is followed by receiving information pattern, then node is completed after receiving information, no longer execution information is sent.
Referring to Fig. 2:
Fig. 2 describes the process that node executes neighbors discovery and information transmission, the neighbors of wireless self-organization network
It was found that a successional process leads to the neighborhood information having been found that due to change in location of nodes etc.
It changes, so needing lasting execution neighbors discovery procedure.It may be also during node completes neighbors discovery
It needs to carry out resource reservation, information collision avoids, the functions such as data information transfer, so setting mixed zone and service area are with after an action of the bowels
Face node is communicated.
Referring to Fig. 3:
Fig. 3 (a) describe node first transmit information be followed by receive information pattern, indicate node execute neighbors discovery
One direction receives hello information after executing first transmission hello information.
Fig. 3 (b) describes to transmit information pattern after node first receives information, indicates that node is executing neighbors discovery
Hello information is transmitted after executing first reception hello information in one direction.
Referring to Fig. 4:
Content included in hello information is illustrated in Fig. 4, including node ID number, the transmitting of node selection
Direction, neighbortable of the node in selected direction.
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 (5)
1. a kind of wireless self-organization network neighbors of beam switchable antenna finds method, include the following steps:
(1) all Node leading-in network ranges into wireless self-organization network and node total number within this range, and set
The preliminary sweep direction sequence of the find_finished value of each node all directions, neighbortable and each node, original state
Select probability P2, wherein the find_finished value indicates the end situation of each direction neighbors discovery, the setting is each
The find_finished value in direction is 0；
(2) node total number of each node according to the network range imported and within this range, calculating may in its all directions
Neighbors quantity m；(3) each node judges whether all direction neighbour sections according to the find_finished value of all directions
Point discovery terminates, if the find_finished value of all directions is equal to 1, neighbors discovery terminates, and otherwise, executes step (4)；
(4) each node carries out a direction of neighbors discovery according to the preliminary sweep direction sequence, selection；
(5) each node judges that direction neighbors discovers whether to tie according to the find_finished value on the direction of its selection
Beam, if find_finished value is equal to 1, the discovery of direction neighbors terminates, and executes step (4), no to then follow the steps (6)；
(6) mode that two kinds of neighbors are found is arranged to each node, realizes as follows:
(6a) setting self-organized network nodes first transmit information and are followed by receiving information pattern；
(6b) setting self-organized network nodes transmit information pattern after first receiving information；
(6c) Setting pattern select probability P1；
(7) each node generates the numerical value K1 of (0,1) using rand function at random, and compares numerical value K1 and the model selection
The size of probability P 1 selects the mode for executing neighbors discovery according to comparison result, if K1≤P1, the selection first transmission
Information is followed by receiving information pattern, executes step (8), otherwise selects to transmit information pattern after first receiving information, execute step (12)；
(8) each node generates the numerical value K2 of (0,1) using rand function at random, and compares numerical value K2 and state selection generally
The size of rate P2 judges execution state according to comparison result, if K2≤P2, executes step (9), no to then follow the steps (10)；
(9) hello information is arranged in each node, while sending up 2 × m hello information in its selected side, executes step
Suddenly (11)；
(10) each node sleep on its selected direction；
(11) each node checks whether the mode locating for it is that the first transmission information is followed by receiving information pattern, if so, holding
Row step (12), it is no to then follow the steps (3)；
(12) each node receives hello information in its selected direction, and judges whether to receive hello information, if connecing
It receives, executes step (13), it is no to then follow the steps (18)；
(13) each node judges whether the hello information is new neighbour according to the node ID number in the hello information received
Node send, meanwhile, each node according to the neighbortable in the hello information received, judge be in the neighbortable
No includes this node ID number, if meeting simultaneously, is executed step (14), no to then follow the steps (17)；
(14) the neighbors quantity in its selected direction is added one by each node；
(15) each node judges that its selected direction neighbors quantity adds whether one value is equal to m, if being equal to, executes step
(16), no to then follow the steps (17)；
(16) it is 1 that each node, which changes the find_finished value on its selected direction,；
(17) each node is according to the hello information update neighbortable received, while recording in the hello information received
The node ID number and beam direction information for including execute step (19)；
(18) power change steps PW value is increased to the information transmission power level of each node, obtains bigger information transmission power
Value, while 0.1 is increased to the state select probability P2, obtain bigger state select probability P2 value；
(19) each node checks whether the mode locating for it is that the first transmission information is followed by receiving information pattern, if so, holding
Row step (3), it is no to then follow the steps (8).
2. the wireless self-organization network neighbors of beam switchable antenna according to claim 1 finds method, feature
Be: find_finished value described in step (1) refers to the wireless self-organization network for identifying beam switchable antenna
In all directions neighbors quantity of each node meet the information of communication requirement situation, each direction is respectively provided with find_
Finished value, value are that 0 or 1,0 certain direction neighbors quantity for representing each node in wireless self-organization network cannot
Enough meet communication requirement, 1 certain direction neighbors quantity for representing each node in wireless self-organization network can satisfy communication
Demand.
3. the wireless self-organization network neighbors of beam switchable antenna according to claim 1 finds method, feature
It is: power change steps PW value is increased to the information transmission power level of each node described in step (18), is referred to changeable
Each node in the wireless self-organization network of beam antenna increases power change steps PW on the basis of information transmission power
Value, can be used for increasing the range that each node sends and receives information, and wherein the value of step-length PW is according to network size and communication need
To be arranged.
4. the wireless self-organization network neighbors of beam switchable antenna according to claim 1 finds method, feature
It is: selects the mode of execution neighbors discovery described in step (7) according to comparison result, refer to the nothing of beam switchable antenna
Each node in line self-organizing network compares the size relation of K1 value and P1 value, and is selected to execute neighbors according to comparison result
It was found that mode improve the probability that hello information is properly received at receiving node for avoiding the conflict of hello information,
Middle P1=0.5.
5. the wireless self-organization network neighbors of beam switchable antenna according to claim 1 finds method, feature
It is: execution state is judged according to comparison result described in step (8), refers to the wireless self-organization network of beam switchable antenna
In each node compare the size relation of K2 value and P2 value before transmitting hello information, and held according to comparison result judgement
Row state avoids conflict of the hello information at receiving node, same time for reducing the actual information sending probability of node
About node energy.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610177121.2A CN105873007B (en) | 2016-03-25 | 2016-03-25 | The wireless self-organization network neighbors of beam switchable antenna finds method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610177121.2A CN105873007B (en) | 2016-03-25 | 2016-03-25 | The wireless self-organization network neighbors of beam switchable antenna finds method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105873007A CN105873007A (en) | 2016-08-17 |
| CN105873007B true CN105873007B (en) | 2019-02-19 |
Family
ID=56625141
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610177121.2A Active CN105873007B (en) | 2016-03-25 | 2016-03-25 | The wireless self-organization network neighbors of beam switchable antenna finds method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105873007B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106686567B (en) * | 2016-12-29 | 2019-10-11 | 西安电子科技大学 | Orientation self-organizing network neighbors based on probability optimization finds method |
| CN111147122B (en) * | 2019-12-16 | 2022-02-01 | 北航（四川）西部国际创新港科技有限公司 | Self-adaptive discovery method for low-altitude flight target |
| CN113596760B (en) * | 2021-07-05 | 2023-11-14 | 广东电网有限责任公司广州供电局 | Wireless self-organizing network neighbor node discovery method for electric power construction site |
| CN115052280B (en) * | 2022-03-28 | 2023-08-29 | 广东电网有限责任公司广州供电局 | Method for discovering neighbor nodes of wireless self-organizing network |
| CN115052281B (en) * | 2022-03-28 | 2023-08-29 | 广东电网有限责任公司广州供电局 | Neighbor node discovery method for self-adaptive node density of electric power construction site |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104469731A (en) * | 2014-11-10 | 2015-03-25 | 上海交通大学 | Neighbor node finding method based on beam forming antenna |
-
2016
- 2016-03-25 CN CN201610177121.2A patent/CN105873007B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104469731A (en) * | 2014-11-10 | 2015-03-25 | 上海交通大学 | Neighbor node finding method based on beam forming antenna |
Non-Patent Citations (2)
| Title |
|---|
| Ad Hoc网络性能分析及路由技术研究;徐扬;《中国优秀博士学位论文全文数据库》;20150715;全文 |
| 基于定向天线的无线Ad Hoc网络协议研究;王洋;《中国优秀硕士学位论文全文数据库》;20140917;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105873007A (en) | 2016-08-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105873007B (en) | The wireless self-organization network neighbors of beam switchable antenna finds method | |
| Zhang et al. | Neighbor discovery in mobile ad hoc self-configuring networks with directional antennas: algorithms and comparisons | |
| US9693217B2 (en) | Method, apparatus, and computer program product for service discovery proxy for wireless communication | |
| EP3750348B1 (en) | Method of adaptive route selection in a node of a wireless mesh communication network corresponding apparatus for performing the method of adaptive route selection and corresponding computer program | |
| TWI713871B (en) | Mesh assisted node discovery | |
| EP3076709B1 (en) | Zigbee network-based data transmission method, apparatus, and system | |
| US8380072B2 (en) | Integrated sensor networks with optical and wireless links | |
| CN103069891B (en) | For the apparatus and method that the power in self-organizing network is saved | |
| US20160323925A1 (en) | Method, apparatus, and computer program product for inter-ap communication in neighbor awareness networking environment | |
| Saleem et al. | SMART: A SpectruM-Aware ClusteR-based rouTing scheme for distributed cognitive radio networks | |
| CN109547351B (en) | Routing method based on Q learning and trust model in Ad Hoc network | |
| JP2020517187A (en) | Neighbor node discovery in wireless mesh networks using directional transmission | |
| US8180352B2 (en) | Topology controlled discovery for next hop determination | |
| CN101426294B (en) | Wireless sensor network routing method capable of partially clustering on demand | |
| EP2709386A1 (en) | Method, apparatus, and computer program product for exchanging of information between wireless devices for joining | |
| CN106686567B (en) | Orientation self-organizing network neighbors based on probability optimization finds method | |
| CN107172678B (en) | Opportunistic routing method for geographic information of wireless sensor network | |
| EP1845584A1 (en) | Apparatus for selecting a beamforming direction | |
| CN110519745B (en) | Neighbor discovery method based on maximum common divisor of cycle length | |
| Mu et al. | Performance analysis of the ZigBee networks in 5G environment and the nearest access routing for improvement | |
| CN114051228B (en) | Intelligent neighbor discovery method and device for directional antenna self-organizing network | |
| CN106686680B (en) | A kind of route optimization system and method for car networking | |
| CN107948315B (en) | Method and system for controlling coverage of area of Internet of things | |
| Manisekaran et al. | Energy efficient hierarchical clustering for sensor networks | |
| CN111556548B (en) | Multi-path routing protocol based on non-uniform clustering in WBAN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |