CN103369496B - Neighbor discovery method and device thereof in wireless communication system - Google Patents
Neighbor discovery method and device thereof in wireless communication system Download PDFInfo
- Publication number
- CN103369496B CN103369496B CN201210100477.8A CN201210100477A CN103369496B CN 103369496 B CN103369496 B CN 103369496B CN 201210100477 A CN201210100477 A CN 201210100477A CN 103369496 B CN103369496 B CN 103369496B
- Authority
- CN
- China
- Prior art keywords
- nodal point
- signature
- primary nodal
- node
- 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
Abstract
The embodiment of the invention provides a neighbor discovery method and device thereof in a wireless communication system. According to the embodiment of the invention, the method can comprise the following steps: a discovery message is received from one or more second nodes of the wireless communication system in a discovery period, and the discovery message comprises a unique signature of the second node; according to a position of a sending time slot of a first node in the discovery period, a projection matrix aiming at a signature space of the first node is acquired from the signature space constructed by the signature of the first node and the second node; and a neighbor node of the first node is identified by utilizing a sparse signal discovery algorithm according to the received discovery message and the projection matrix.
Description
Technical field
The present invention relates to cordless communication network, and more specifically, it is related in wireless communication system (as orthogonal frequency division multiplexing
With (OFDM) system) in carry out the method and apparatus of neighbor uni-cast.
Background technology
In wirelessly end-to-end communication network, each node is only had directly with other nodes of minority (being referred to as its neighbour)
Wireless link.Before carrying out effective routing or other end-to-end activities, node has to carry out neighbor uni-cast to find and really
The identity (ID) of its neighbour fixed.For the system that Ad Hoc network etc. does not have pre-existing architecture, this problem
One to it is critical that.And the network with architecture for such as cellular network etc, due to direct between node
The demand of communication/cooperation is continuously increased and has the picocell of no supervision and the isomery cellular network of Femto cell
Carry out, this problem also becomes more and more important.
Node carries out neighbor uni-cast using some Resource Block, and these Resource Block are also referred to as " finding the cycle ".Existing
In neighbor uni-cast scheme, all nodes in network send, in the discovery cycle, the message comprising its ID, and are finding the phase in cycle
Between intercept wireless channel to decode the ID of its neighbour simultaneously.
For example, node randomly accessed no during the discovery cycle taking existing Stochastic accessing neighbor discovery technique as a example
Line resource comprises the message of their ID to send.If message not with other message collision, or the letter of the message of conflict
Number energy is less than threshold value (this represents that the node of the message sending this conflict is remote enough), then corresponding ID is considered correctly adjacent by it
Occupy and receive.Do not coordinate well due between node, so each node needs repeatedly to send the ID's comprising their own
Message, so that the probability that this message is successfully received is larger.In order to ensure that maximum probability is properly received, message typically requires and repeats to send out
Send many times, this make Radio Resource utilization ratio very low.
Content of the invention
Embodiments of the present invention propose a kind of for the neighbor uni-cast scheme in wireless communication system, which use
The sparse characteristic of the knowledge utilization neighbours of compressed sensing is carrying out neighbor uni-cast.
According to an aspect of the invention, it is provided a kind of neighbours for identifying primary nodal point in a wireless communication system
The method of node, the method can include：Connect from one or more secondary nodal points of described wireless communication system in the discovery cycle
The existing message of transmitting-receiving, comprises the signature unique of described secondary nodal point in described discovery message；According to described primary nodal point at described
The position of the sending time slots in the existing cycle, obtains from the signature space that the signature of described primary nodal point and secondary nodal point is constituted
Projection matrix for the described signature space of described primary nodal point；And according to the discovery message being received and described projection square
Using sparse signal, battle array, finds that algorithm identifies the neighbor node of described primary nodal point.
According to another aspect of the present invention, there is provided a kind of neighbour for identifying primary nodal point in a wireless communication system
Occupy the device of node, this device can include：Receiving unit, is configured in the discovery cycle from the one of described wireless communication system
Individual or multiple secondary nodal points receive and find message, comprise the signature unique of described secondary nodal point in described discovery message；Projection square
Battle array acquiring unit, the position of the sending time slots being configured to according to described primary nodal point in the described discovery cycle, from described the
The described signature space being directed to described primary nodal point is obtained in the signature space that the signature of one node and secondary nodal point is constituted
Projection matrix；And neighbor node determining unit, it is configured to, according to the discovery message being received and described projection matrix, utilize
Sparse signal finds algorithm to identify the neighbor node of described primary nodal point.
The such scheme being provided using embodiment of the present invention, can be realized having between the node of half-duplex characteristic
Multinode neighbor uni-cast simultaneously, and do not need extra signaling consumption.Additionally, with using Stochastic accessing neighbor discovery technique
Prior art is compared, and the radio resource consumption of the such scheme that embodiment of the present invention is provided and power consumption all substantially drop
Low.
Brief description
After description by the specific embodiment below with reference to the present invention given by drawings below, will be more preferably geographical
Solve the present invention, and other objects of the present invention, details, feature and advantage will become apparent from.In the accompanying drawings：
Fig. 1 shows the schematic diagram of a present invention wireless communication system applicatory；
The flow chart that Fig. 2 shows the compression neighbor discovering method according to embodiment of the present invention；
Fig. 3 shows an example of the projection matrix obtaining signature space；
Fig. 4 shows and in an ofdm system the signature of node is mapped to discovery week according to an embodiment of the invention
One example of phase；And
Fig. 5 shows according to one embodiment of the present invention, device carrying out neighbor uni-cast in an ofdm system
Schematic diagram.
Specific embodiment
It has been noted that within a wireless communication network, the quantity of the neighbours of a node is generally than all node ID space
Size will little several orders of magnitude.That is, neighbours' quantity of a node have for whole ID space sparse
Characteristic, therefore can carry out neighbor uni-cast using the knowledge of compressed sensing.According to the principle of compressed sensing, can from length relatively
Recover the longer sparse signal of length in short measurement vector.For example, it is assumed that sparse signal is x, its length is N, the linear survey of x
The vectorial y=Ax length of amount is M, and A is the projection matrix between y and x, and wherein M and N is positive integer.So knowing projection square
In the case of battle array A, according to compressive sensing theory, even if M is ＜ ＜ N, also x accurately can be recovered from y with very maximum probability.Cause
This, openness the providing of the neighbours of node carries out the foundation of neighbor uni-cast using compressive sensing theory.
In consideration of it, the invention provides a kind of neighbor uni-cast scheme of compression, it utilizes the sparse characteristic of neighbours, is based on
The knowledge of signature space is determining the neighbor node of node.
Fig. 1 shows the schematic diagram of a present invention wireless communication system 100 applicatory.In wireless communication system 100
In, for example exist node 0, node 1 ..., node N, i.e. there is N+1 node.Taking node 0 as a example, such as its neighbour section
Point is node 1, node 2, node 3, node 4 and node 5, and that is, node 0 has 5 neighbor nodes.As a rule, the neighbour of node 0
The number occupying node is very little for the node total number in system 100, it is therefore possible to using compressive sensing theory
Carry out neighbor uni-cast.
In the context of description, node may refer to the reciprocity end in Ad Hoc network, or may refer to honeycomb
Terminal in communication system (as LTE system).
Ultimate principle
Introduce the concept of signature below referring to figs. 2 and 3 the ultimate principle of compression neighbor uni-cast to be described.
With reference to Fig. 2, the flow chart that it illustrates the compression neighbor discovering method according to embodiment of the present invention.
In step 210, node (node 0 as in Fig. 1) obtains its signature unique.The signature unique of node is e.g. by no
Line communication network 100 (base station in such as cellular system) each node Uniform Construction therein simultaneously distributes, with this node
Unique ID be associated.This construction and distribution for example can occur before the discovery cycle starts.Additionally, each node also by
The information of the signature unique with regard to other nodes in cordless communication network 100 is provided.In another embodiment, node
Signature has been stored in advance in this node, thus to obtain its signature unique without execution step 210.
Assume to useTo represent the ID space of all nodes being considered, to use snTo represent node n's
Signature.Assume that the signature of all nodes has equal length M, then the signature space that all signatures are constituted can be expressed as S=
[so...sn...sN], it is a M × (N+1) matrix.
Length is signed for M it is assumed that the quantity of wherein nonzero element is K, then construction signature makes each non-zero entry
At random and norm is 1 for the position of element and phase place.For example, for node n (n=0,1,2 ..., N) it is assumed that it is signed isWherein nonzero element Position and phase place be independent, and randomly generate.
In step 220, node sends their own to other nodes in wireless communication system 100 during the discovery cycle
Find message, this discovery message is included as the signature unique that this node is distributed, and in step 230, node is in the cycle of transmission
Period, other nodes from wireless communication system 100 received discovery message simultaneously, and this discovery message is included as other node institutes
The signature unique of distribution.
As described above, the signature that length is M includes K nonzero element and (M-K) individual neutral element.According to non-zero entry in signature
For each node, the position of element, can will be seen that the cycle is divided into sending time slots and receives time slot, wherein sending time slots correspond to
In the position of the nonzero element of the signature of this node, receive the position that time slot corresponds to the neutral element of signature of this node.
Additionally, during the discovery cycle, all nodes send the discovery message comprising its signature unique simultaneously.Therefore, right
For whole network, the signature of all nodes is superimposed during the discovery cycle in space.Each node can be in its transmission
Time slot sends the nonzero element in its signature, receives the signature of other nodes in reception time slot, more particularly, receives other sections
The nonzero element of the signature of point.
In other words, it is believed that node is not all to be transmitted in the whole discovery cycle, but only in the discovery cycle
Time slot corresponding with the position of the nonzero element that it is signed (referred to as sending time slots it is also possible to referred to as ON time slot) is transmitted,
Time slot corresponding with the position of the neutral element that it is signed in the discovery cycle (referred to as receive time slot it is also possible to referred to as OFF time slot) is no
It is transmitted, but intercept the signature of other nodes transmission.
In step 240, the position of node sending time slots in the discovery cycle according to it, obtain the projection of signature space S
Matrix
Because each node has been known a priori by the signature space of all nodes, it is possible to using receive other
The discovery message of node is carrying out neighbor uni-cast.Note, node is described as every other node from system 100 all herein
Receive discovery message, therefore signature space is made up of the signature of all nodes.However, in the more typically embodiment of property,
Node may not receive discovery message (due to a variety of causes) by other nodes some from system 100, therefore signs empty
Between received the signature of those other nodes finding message by this node and this node and constitute.
Without loss of generality, the process of compression neighbor uni-cast to be discussed in the following discussion taking node 0 as a example.Aobvious
So, this process may be directly applied to arbitrary node.
The signal that node 0 was received during the discovery cycle is expressed as y, can be modeled as：
Wherein, PTIt is the transmission power of node it is assumed that its, α=[α all identical to all nodes1...αN]TIt is in system
Attenuation vector between other nodes and node 0, wherein αnBe attenuation quotient between node 0 and node n (n=0,1,
2 ..., N),It is the projection matrix of signature space S.
Note, for the sake of describing simply, eliminate the impact of system noise when being modeled to receipt signal, but
The solution of the present invention obviously easily can be applied to the process of the situation of making an uproar by those skilled in the art.
In one embodiment, for node n, by deleting (n+1)th row (that is, the node of whole signature space S
The signature s of nnCorresponding row in whole signature space S) and and snIn corresponding the going and obtain the throwing of node n of nonzero element
Shadow matrixFig. 3 shows the projection matrix obtaining signature space SAn example, wherein, taking node 0 as a example it is assumed that its
Sign as s0=[0ejθ10…ejθ200]T, projection matrixIt is by deleting the 1st of signature space S the row and the signature s with node 0o
In nonzero element corresponding row obtained.
Generally it may be reasonably assumed that node 0 only receives strong signal from its neighbor node.As previously described, because node 0
The quantity of neighbor node wants much less than the number of nodes of whole system, only has seldom a part of element in therefore attenuation vector α
Value larger, thus vectorial α has close to sparse characteristic.Therefore the model in above-mentioned formula (1) can be regarded as vectorial α's
Linear measuring system.
AssumeIt is the length of receipt signal y.Because vectorial α has close to sparse characteristic, even if therefore?
α can highly precisely be recovered, this represents that the size finding the cycle in compression neighbor uni-cast can be far smaller than ID space
Size.
Therefore, next in step 250, node, according to the discovery message being received and acquired projection matrix, utilizes
Sparse signal finds algorithm to identify its neighbor node.
Algorithm can be found using various known sparse signals and attenuation vector α is estimated according to receipt signal y.For example,
According to Lasso algorithm, can be by solving following l1Quadratic equation limited by norm is estimating α：
WhereinIt is the estimated value of attenuation vector α, λ is regularization parameter.
It is well-known to those skilled in the art for finding that algorithm recovers primary signal according to measurement signal using sparse signal,
Therefore will not be described here.Those skilled in the art can also find algorithm, such as shellfish using various other known sparse signals
Ye Si (Bayesian) algorithm, basic trace (Basic Pursuit) algorithm, match tracing (Matching Pursuit) algorithm
Etc., attenuation vector is estimated.
As described above, the value of attenuation quotient reflects the distance between two nodes, therefore obtaining estimating of attenuation vector
EvaluationAfterwards it is believed that the node corresponding with the attenuation quotient being wherein more than certain predetermined value is the adjacent segments of node 0
Point.For heterogeneous networks, the size of this predetermined value may be different.
Neighbor uni-cast in ofdm system
It may be found that the cycle is divided into sending time slots and receives time slot in ultimate principle discussed above, node is sending
Time slot sends the nonzero element in its signature, the nonzero element in receiving the signature that time slot receives other nodes.However,
In ofdm system, the discovery cycle is the two-dimentional Resource Block comprising time domain and frequency domain, and the construction of signature and neighbor discovery process will be with
Above-mentioned different.For example, it is assumed that the discovery cycle comprises T OFDM symbol and F subcarrier, wherein T × F >=M.Each signature
Element must be mapped to this two-dimentional Resource Block.
Fig. 4 shows and in an ofdm system the signature of node is mapped to discovery week according to an embodiment of the invention
One example of phase.In the diagram, the feelings of 4 OFDM symbol (time domain) and 3 subcarriers (frequency domain) are comprised with each discovery cycle
As a example condition.Wherein, Fig. 4 (a) shows that the signature of each node is finding the mapping in cycle and overlap in space, Fig. 4
B () is that the matrix form of Fig. 4 (a) represents.
As shown in Fig. 4 (a), the signature of all nodes is spatially overlapping.As can be seen that the signature of each node is in fact
It is the two dimension signature of a time domain and frequency domain.Each signature is rewritten as an one-dimensional vector, then the signature space S obtaining is as schemed
Shown in 4 (b), wherein each row is corresponding with a node, represents the signature of this node.
In an ofdm system, when node is launched in an OFDM symbol, it is all in this OFDM symbol
All it is unable to receipt signal, even if this node is only launched on the portion subcarriers of this OFDM symbol on subcarrier.In other words
Say, in an ofdm system, node has half-duplex characteristic.Therefore signature design and neighbor discovery process be not with said process yet
With.
Compression neighbor discovery process in ofdm system to be described referring still to Fig. 2.
In step 210, node obtains its signature unique.As it was previously stated, the signature unique of node is, for example, by radio communication
System 100 (base stations in such as Cellular Networks) each node Uniform Construction therein simultaneously distributes, and it is unique with this node
ID is associated.This construction and distribution for example can occur before the discovery cycle starts.Additionally, each node is further provided with closing
The information of the signature specific to ID that other nodes in wireless communication system 100 are used.
From above-mentioned, signature is divided into neutral element and the embodiment of nonzero element is different, in an ofdm system, will sign
It is divided into complete zero section and non-zero section, wherein complete zero section refers to that element is all zero section, and non-zero section refers to comprise the section of nonzero element.
Use KTN () represents snIn non-zero section quantity, KF(n, t) represents snThe nonzero element of t-th non-zero section quantity.One
Plant in embodiment, design signature s using following rulesn：
(1) assume for any n=0,1,2 ..., N, KT(n)=KT, and for any n=0,1,2 ..., N and t
=1,2 ..., KT, KF(n, t)=KF.Wherein KTIt is the suitable value selecting from [1,2 ..., T], KFBe from [1,2 ...,
F] the middle suitable value selecting.For example, as shown in Fig. 4 (b), T=4, F=3, select KT=2, KF=1.
(2) each is signed, randomly choose KTIndividual variable { ti| i=1～KT}.For each ti, randomly choose KFIndividual
Variable, is expressed as { fI, j| j=1～KF}.
(3) produce the index { (t of the nonzero element in signaturei-1)F+fI, j| i=1～KT, j=1～KFAnd produce phase
The nonzero element answered.The value of the nonzero element producing is that have the normalization variable of random phase, such as aforementioned combination Fig. 2 and Fig. 3
Described.
As can be seen that the design of signing structure depends on two parameters KTAnd KF, KTRepresent each non-zero section in signing
Quantity, KFRepresent the quantity of the nonzero element in each non-zero section.The value of this two parameters, especially KTValue, to neighbor uni-cast
The impact of performance is very big.For example, less KTEnable a node to the signature that the more time intercepts other nodes, but
The sending time slots that this also increases two nodes conflict completely thus they can not listen to the probability of signature each other completely.
Therefore, in order to obtain optimum performance, need to select suitable KTAnd KF.For example, KTAnd KFSelection need to meet following condition：
Condition (1)：Should be byIn complete zero row probability of occurrence control less than appropriate value.For example, if a node
The sending time slots (non-zero section) of sending time slots (non-zero section) and node 0 be placed exactly in same position, thenMiddle complete zero row.
In this case, node 0 can not listen to this signature completely, from being unable to recover the decay of this node according to receipt signal
Coefficient.It is thus desirable to selecting a suitable KTValue makeIn be not in complete zero row, or occur complete zero row probability very
Low.
In one embodiment, as the signature s of node 00Signature s with node nnIn non-zero section position just complete
When exactly the same, projection matrixMiddle complete zero rowThe probability of occurrence of this situation may be calculated：
Condition (2)：Projection matrixRow between correlation should be smaller, thusSimilar to a nearly orthogonal matrix.
This is because, find that in algorithm, performance has relation to averagely related and related distribution in sparse signal.Therefore, in order to
Obtain preferable performance, it is required that the probability of occurrence of the average cross-correlation of row and larger correlation is minimum.
In one embodiment it is considered to projection matrixIn two rowWithWithBetween correlation permissible
It is calculated as：
WhereinRepresentIn non-zero section quantity (i=1,2).As can be seen thatIt is a value from 0 to KTWith
Machine number.Probability may be calculated：
ConsiderWithAll possible valueWith(4) can be rewritten as：
Wherein to all possibleTo summation,Represent given rightWhenExpectation.Represented with lWithIn the nonzero element of overlap number.Obviously l is a stochastic variable, and its distribution takes
Certainly inF and KF.It is assumed that l=L will obtain：
GivenWhen l=L probability may be calculated：
Wherein
And
Wherein
Second summation in formula (8) is to { L under the constraint of (11) and (12)i| i=1～P } all probability enter
Row, wherein
Max (0,2KF-F)≤Li≤KF(11)
And
Consider all possible L, (6) may be calculated：
(13)
WhereinIt is for any given L,WithRow cross-correlation.
The correlation calculating in formula (13) is the average of all probability.Sparse signal find algorithm in, performance not only by
Averagely related decision, is also determined by related distribution.Specifically it should avoid larger correlation as far as possible, because larger phase
The degradation that pass is caused for performance is even more serious than little correlation.In order to reflect the Different Effects of different related levels, for difference
Related levels introduce different weighter factors, thus obtaining the average correlation weighting：
Wherein w ＞ 1 is used to balance different related levelsContribution parameter.By doing so it is possible, will be every
Individual related levelsUse the factorIt is weighted.As w ＞ 1, which increase
Therefore pass through to select w ＞ 1, the contribution of larger related levels can be increased to rw, then by making rwMinimum, Ke Yiyou
Avoid the occurrence of to effect the cross-correlation between larger row and make average related levels minimum.
In one embodiment, consider above-mentioned two condition, two following ginsengs can be selected for all signatures
Number KTAnd KF
Wherein pzero_column(KT, KF) ＜ Pthed(15)
Wherein PthedIt is predetermined threshold value.In a preferred embodiment, w=1.2, P are setthed=0.01.
In a preferred embodiment, select (KT=4, KF=F), select at this point for nearly all rational (T, F)
Relatively good performance all will be obtained.
Above-mentioned embodiment is for K in signature designTAnd KFSome exemplary setting modes, the present invention not office
It is limited to this.Depending on specific application scenarios and design preference, those skilled in the art can be come using various different methods
Select suitable KTAnd KFValue.
Next, in step 220 and 230, node is during the discovery cycle to other nodes in wireless communication system 100
Send the discovery message comprising its signature unique and other nodes reception from wireless communication system 100 simultaneously comprises other
The discovery message of the signature unique of node.
As noted previously, as the half-duplex characteristic of node, therefore the signature of each node is divided into non-zero section and complete zero
Section, correspondingly it may be found that the cycle is divided into sending time slots and receives the non-zero section of the signature of time slot, wherein sending time slots and node
Corresponding, receive time slot corresponding with complete zero section of the signature of node.
In step 240, the position of node sending time slots in the discovery cycle according to it, obtain the projection of signature space S
MatrixThe projection matrix obtaining signature space S in an ofdm system is described below in detailProcess.
Discuss it is assumed that the size (i.e. OFDM symbol number × sub-carrier number) in the cycle of discovery is equal to signature length to simplify,
I.e. T × F=M.By each s that signsnIt is divided into T section, be expressed asWhereinIt is sn
T section (t=1,2 ..., T).Each sectionComprise F element, map that to F in t-th OFDM symbol
On subcarrier.Wherein, the quantity of non-zero section is KT, the quantity of the nonzero element in non-zero section is KF.
Because node can only receive its not OFDM symbol when being launched in an ofdm system, therefore implement a kind of
In mode, for node n, by deleting the (n+1)th row (that is, signature s of node n from signature space SnSign whole
Corresponding row in space S) and and snThe projection matrix to obtain node n for corresponding those row of non-zero sectionThus,In
Each row only comprisesIndividual section.
For example, it is assumed that it is signed as s taking node 0 as a example0=[0ejθ10…ejθ200]T, such as shown in Fig. 4 (a).Although node
0 only using first and the 4th one of OFDM symbol subcarrier, but its on all subcarriers in this two symbols all
It is unable to receipt signal, as shown in the Lycoperdon polymorphum Vitt row in Fig. 4 (b).White portion in Fig. 4 (b) represents the projection matrix of node 0Its
It is by deleting the row corresponding with the non-zero section of node 0 and the row corresponding with the signature of node 0 from signature space S
(as shown in Fig. 4 (b) grey area) obtains.
Next in step 250, node according to the discovery message being received and acquired projection matrix, using sparse letter
Number find algorithm identifying its neighbor node.Can be using any one in various sparse signals discovery algorithms as previously described
Carry out the receipt signal according to node and projection matrix obtains the estimated value of attenuation vector, so that it is determined that the neighbor node of this node,
Will not be described here.
Herein, the solution of the present invention is described it being understood, however, that the program can taking ofdm system as a example
To be applied to any system that the discovery cycle is two dimension even more higher-dimension Resource Block.
Fig. 5 show according to one embodiment of the present invention, carry out neighbor uni-cast in wireless communication system 100
The schematic diagram of device 500.Device 500 can be for example node or one part in wireless communication system 100.
As illustrated, device 500 includes receiving unit 530, it is configured in the discovery cycle from wireless communication system 100
One or more secondary nodal points receive and find message, described discovery message package contains the signature unique of secondary nodal point；Projection matrix
Acquiring unit 540, it is configured to the position of the sending time slots according to node in the discovery cycle, obtains pin from signature space
Projection matrix to the signature space of described node；And neighbor node determining unit 550, it is configured to according to being received
Find message and acquired projection matrix, find that algorithm identifies the neighbor node of described node using sparse signal.
Additionally, device 500 also includes acquiring unit 510 of signing, for obtaining its signature unique.This signature unique for example may be used
So that by network Uniform Construction and distribute, wherein the design of signature is as it was previously stated, will not be described here.
Additionally, device 500 also includes transmitting element 520, for sending bag in the cycle of discovery to other nodes in system
Discovery message containing its signature unique, the wherein position of its sending time slots in the discovery cycle correspond to unique label of this node
The nonzero element of name.
Additionally, in one embodiment, reception time slot that receiving unit 530 was additionally configured in the cycle of discovery receives the
The nonzero element of the signature unique of two nodes.
Additionally, in one embodiment, the position of sending time slots corresponds to the non-zero entry of the signature unique of primary nodal point
Element, and projection matrix acquiring unit 540 is additionally configured to：By from signature space remove corresponding with primary nodal point arrange with
And row corresponding with the nonzero element of the signature of the primary nodal point projection matrix to obtain the signature space for primary nodal point.
Additionally, in one embodiment, the position of sending time slots corresponds to the non-zero section of the signature unique of primary nodal point,
And projection matrix acquiring unit 540 is additionally configured to：By from signature space remove corresponding with primary nodal point arrange and
To obtain the projection matrix of the signature space for primary nodal point with the corresponding row of non-zero section of the signature of primary nodal point, wherein
The non-zero section of the signature of one node refers to the section comprising nonzero element in the signature of primary nodal point.
In one embodiment, wireless communication system is ofdm system, and is comprised according to described discovery cycle
The quantity of OFDM symbol carries out segmentation to described signature.
In one embodiment, neighbor node determining unit 550 is additionally configured to：Obtain secondary nodal point and primary nodal point
Between attenuation quotient to determine the neighbor node whether as primary nodal point for the secondary nodal point.
As described above, sparse signal finds that algorithm includes Lasso algorithm, bayesian algorithm, basic tracing algorithm and coupling
At least one in tracing algorithm.
Using the such scheme of the present invention, multinode neighbours simultaneously can be realized having between the node of half-duplex characteristic
Find, and do not need extra signaling consumption.Additionally, compared with the prior art using Stochastic accessing neighbor discovery technique,
The solution of the present invention can be greatly enhanced power efficiency and the bandwidth efficiency of neighbor uni-cast, thus significantly reduce Radio Resource disappearing
Consumption and power consumption.
Additionally, being described to method disclosed herein referring to the drawings.It should be appreciated, however, that shown in accompanying drawing and
Sequence of steps described in this description is only schematically, without departing from the scope of the claims, these sides
Method step and/or action can execute in a different order and be not limited to shown in accompanying drawing and described in the specification
Particular order.
In one or more exemplary design, can be realized this with hardware, software, firmware or their combination in any
The described function of application.If realized with software, can be using described function as one or more instructions or code storage
On a computer-readable medium, or as the one or more instructions on computer-readable medium or code to transmit.Calculate
Machine computer-readable recording medium includes computer-readable storage medium and communication media, and wherein communication media includes contributing to computer program from one
Place is delivered to the arbitrary medium of another place.Storage medium can be that universal or special computer is addressable arbitrarily available
Medium.This computer-readable medium can include, for example, but not limited to, RAM, ROM, EEPROM, CD-ROM or other CD
Storage device, disk storage equipment or other magnetic storage apparatus, or can be used for universal or special computer or general or
Application specific processor addressable instruction or data structure form come to carry or store desired code modules any its
Its medium.And, arbitrarily connect computer-readable medium of can also being known as.For example, if software be using coaxial cable,
Optical fiber cable, the wireless technology of twisted-pair feeder, Digital Subscriber Line (DSL) or such as infrared ray, radio and microwave etc are come from net
Stand, server or the transmission of other remote source, then coaxial cable, optical fiber cable, twisted-pair feeder, DSL or such as infrared ray, wireless
The wireless technology of electricity and microwave etc is also included within the definition of medium.
General processor, digital signal processor (DSP), special IC (ASIC), field programmable gate can be used
Array (FPGA) or other PLD, discrete gate or transistor logic, discrete hardware components or be used for executing basis
Literary composition described in function combination in any come to realize or execute with reference to the various exemplary logical block described by the disclosure, module and
Circuit.General processor can be microprocessor, or, processor can also be any conventional processor, controller, micro-control
Device processed or state machine.Processor can also be embodied as the combination of computing device, for example, the combination of DSP and microprocessor, multiple
The combination of microprocessor, one or more microprocessors and DSP core, or any other such structure.
Those of ordinary skill in the art are also understood that the various exemplary logic with reference to embodiments herein description
Block, module, circuit and algorithm steps can be implemented as electronic hardware, computer software or combination.In order to understand earth's surface
Show this interchangeability between hardware and software, above various exemplary parts, block, module, circuit and step are all enclosed
Carry out general description around its function.It is implemented as hardware as this function and is also implemented as software, depending on specific
Application and applying design constraint over the whole system.Those skilled in the art can be directed to every kind of application-specific, to become
Logical mode realizes described function, but, this realize decision-making and should not be interpreted as causing a departure from the scope of this disclosure.
The above description of the disclosure is used for making any those of ordinary skill of this area be capable of or use the present invention.Right
For those of ordinary skill in the art, the various modifications of the disclosure will be apparent from, and generality defined herein
Principle can also be applied to other deformation in the case of without deviating from the spirit and scope of the disclosed invention.Therefore, the present invention is simultaneously
It is not limited to example as herein described and design, but consistent with the widest scope of principle disclosed herein and novel features.
Claims (16)
1. a kind of method of the neighbor node for identifying primary nodal point in a wireless communication system, including：
Receive from one or more secondary nodal points of described wireless communication system in the cycle of discovery and find message, described discovery message
In comprise the signature unique of described secondary nodal point；
According to the position of sending time slots in the described discovery cycle for the described primary nodal point, from described primary nodal point and secondary nodal point
The signature space that constituted of signature in obtain described signature space, for described primary nodal point projection matrix, wherein institute
The signature stating primary nodal point is obtained or be pre-stored in described primary nodal point by described primary nodal point；And
According to the discovery message being received and described projection matrix, find that algorithm identifies described primary nodal point using sparse signal
Neighbor node.
2. the method for claim 1, also includes：
Described primary nodal point comprises it in the described discovery cycle to other nodes transmission in described wireless communication system and uniquely signs
The discovery message of name, the position of wherein said sending time slots corresponds to the nonzero element of the signature unique of described primary nodal point.
3. the method for claim 1, wherein receives from described secondary nodal point and finds that message includes：In the described discovery cycle
Receive time slot receive described secondary nodal point signature unique nonzero element.
4. the method for claim 1, the position of wherein said sending time slots corresponds to unique label of described primary nodal point
The nonzero element of name,
The projection matrix obtaining the described signature space for described primary nodal point includes：By removing from described signature space
Row corresponding with described primary nodal point and row corresponding with the nonzero element of the signature of described primary nodal point are obtaining for institute
State the projection matrix of the described signature space of primary nodal point.
5. the method for claim 1, the position of wherein said sending time slots corresponds to unique label of described primary nodal point
The non-zero section of name,
The projection matrix obtaining the described signature space for described primary nodal point includes：By removing from described signature space
Corresponding with described primary nodal point arrange and to obtain for described with the corresponding row of non-zero section of the signature of described primary nodal point
The projection matrix of the described signature space of primary nodal point, the non-zero section of the signature of wherein said primary nodal point refers to described first segment
The section of nonzero element is comprised in the signature of point.
6. method as claimed in claim 5, wherein said wireless communication system is ofdm system, and finds week according to described
The quantity of the OFDM symbol that the phase is comprised carries out segmentation to described signature.
7. the method for claim 1, wherein identifies that the neighbor node of described primary nodal point includes：Obtain described second section
Whether the attenuation quotient between point and described primary nodal point is the neighbor node of described primary nodal point to determine described secondary nodal point.
8. the method for claim 1, wherein said sparse signal find algorithm include Lasso algorithm, bayesian algorithm,
At least one in basic tracing algorithm and matching pursuit algorithm.
9. a kind of device of the neighbor node for identifying primary nodal point in a wireless communication system, including：
Receiving unit, is configured to receive discovery in the discovery cycle from one or more secondary nodal points of described wireless communication system
Message, comprises the signature unique of described secondary nodal point in described discovery message；
Projection matrix acquiring unit, the position of the sending time slots being configured to according to described primary nodal point in the described discovery cycle
Put, obtain from the signature space that the signature of described primary nodal point and secondary nodal point is constituted described signature space, be directed to institute
State the projection matrix of primary nodal point, the signature of wherein said primary nodal point is obtained by described primary nodal point or is pre-stored in institute
State in primary nodal point；And
Neighbor node determining unit, is configured to according to the discovery message being received and described projection matrix, using sparse signal
Find algorithm to identify the neighbor node of described primary nodal point.
10. device as claimed in claim 9, also includes：
Transmitting element, is configured to comprise it only in the described discovery cycle to other nodes transmission in described wireless communication system
The discovery message of one signature, the position of wherein said sending time slots corresponds to the non-zero entry of the signature unique of described primary nodal point
Element.
11. devices as claimed in claim 9, wherein said receiving unit is additionally configured in the reception in described discovery cycle
Gap receives the nonzero element of the signature unique of described secondary nodal point.
12. devices as claimed in claim 9, the position of wherein said sending time slots corresponds to unique label of described primary nodal point
The nonzero element of name,
Described projection matrix acquiring unit is additionally configured to：Corresponding with described primary nodal point by removing from described signature space
Row and row corresponding with the nonzero element of the signature of described primary nodal point obtaining the described label for described primary nodal point
The projection matrix of the name space.
13. devices as claimed in claim 9, the position of wherein said sending time slots corresponds to unique label of described primary nodal point
The non-zero section of name,
Described projection matrix acquiring unit is additionally configured to：Corresponding with described primary nodal point by removing from described signature space
Row and to obtain the described signature for described primary nodal point with the corresponding row of non-zero section of the signature of described primary nodal point
The projection matrix in space, the non-zero section of the signature of wherein said primary nodal point refers to comprise non-zero in the signature of described primary nodal point
The section of element.
14. devices as claimed in claim 13, wherein said wireless communication system is ofdm system, and according to described discovery
The quantity of the OFDM symbol that the cycle is comprised carries out segmentation to described signature.
15. devices as claimed in claim 9, wherein said neighbor node determining unit is additionally configured to：Obtain described second
Whether the attenuation quotient between node and described primary nodal point is neighbours' section of described primary nodal point to determine described secondary nodal point
Point.
16. devices as claimed in claim 9, wherein said sparse signal finds that algorithm includes Lasso algorithm, Bayes calculates
At least one in method, basic tracing algorithm and matching pursuit algorithm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210100477.8A CN103369496B (en) | 2012-04-06 | 2012-04-06 | Neighbor discovery method and device thereof in wireless communication system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210100477.8A CN103369496B (en) | 2012-04-06 | 2012-04-06 | Neighbor discovery method and device thereof in wireless communication system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103369496A CN103369496A (en) | 2013-10-23 |
| CN103369496B true CN103369496B (en) | 2017-02-22 |
Family
ID=49369829
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210100477.8A Active CN103369496B (en) | 2012-04-06 | 2012-04-06 | Neighbor discovery method and device thereof in wireless communication system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103369496B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105338509A (en) * | 2014-07-15 | 2016-02-17 | 富士通株式会社 | Discovery method of neighbor node and apparatus thereof |
| CN109923895B (en) * | 2016-10-28 | 2021-12-31 | 瑞典爱立信有限公司 | Network node and method for establishing neighbor node relation in network node |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102291739A (en) * | 2011-08-16 | 2011-12-21 | 哈尔滨工业大学 | Method for detecting wireless sensor network sparse events based on compressed sensing and game theory |
-
2012
- 2012-04-06 CN CN201210100477.8A patent/CN103369496B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102291739A (en) * | 2011-08-16 | 2011-12-21 | 哈尔滨工业大学 | Method for detecting wireless sensor network sparse events based on compressed sensing and game theory |
Non-Patent Citations (1)
| Title |
|---|
| Neighbor Discovery in Wireless Networks Using Compressed Sensing with Reed-Muller codes;Lei Zhang;《IEEE》;20111230;第154-160页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103369496A (en) | 2013-10-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3937445B1 (en) | Method for transmitting he-ltf sequence and apparatus | |
| CN107888238B (en) | Method and device for UE (user equipment) and base station for random access | |
| CN107852680A (en) | The equipment of communication, method and computer-readable media in a wireless local area network | |
| US9999042B2 (en) | Small cell resource allocation | |
| CN107078757A (en) | System and method for detecting activation resource unit | |
| CN105684541A (en) | System, method and device for dynamically setting response indication deferral in wireless networks | |
| CN108476503A (en) | Channel-aware resource allocation | |
| CN110113808A (en) | System and method for power control | |
| US20160165378A1 (en) | Ran overload control for m2m communications in lte networks | |
| CN108260209B (en) | Method and device for UE (user equipment) and base station for random access | |
| US20120011566A1 (en) | System and method for sensor network authentication based on xor chain | |
| CN103369496B (en) | Neighbor discovery method and device thereof in wireless communication system | |
| US20150365840A1 (en) | Methods and Apparatus for Discovery Resource Signaling | |
| CN109842469A (en) | Information instruction determines method and device, computer storage medium | |
| US11304048B2 (en) | Partition a radio into a service chain and a scan chain to scan channels | |
| Mehta | Recursive quadratic programming for constrained nonlinear optimization of session throughput in multiple‐flow network topologies | |
| CN111342868B (en) | Large-scale MIMO transmission method and device | |
| CN112953695B (en) | Pilot frequency distribution method and system of distributed MIMO system | |
| CN111181884B (en) | Reference signal transmission method and apparatus | |
| US8391493B2 (en) | Probabilistic mitigation of control channel jamming via random key distribution in wireless communications networks | |
| CN104301898B (en) | A kind of resource allocation methods and system | |
| JP6669278B2 (en) | Resource mapping method, apparatus and communication system | |
| Lee et al. | Centralized contention based mac for ofdma wlan | |
| CN115398980A (en) | Method and apparatus for enabling access to a wireless communication network | |
| CN112822786A (en) | Data processing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 201206 Shanghai, Pudong Jinqiao Ning Bridge Road, No. 388, No. Patentee after: Shanghai NOKIA Baer Limited by Share Ltd Address before: 201206 Shanghai, Pudong Jinqiao Ning Bridge Road, No. 388, No. Patentee before: Shanghai Alcatel-Lucent Co., Ltd. |
|
| CP01 | Change in the name or title of a patent holder |