CN109195225A - Node working time slot generation method suitable for wireless self-organization network neighbours discovery - Google Patents
Node working time slot generation method suitable for wireless self-organization network neighbours discovery Download PDFInfo
- Publication number
- CN109195225A CN109195225A CN201811228373.9A CN201811228373A CN109195225A CN 109195225 A CN109195225 A CN 109195225A CN 201811228373 A CN201811228373 A CN 201811228373A CN 109195225 A CN109195225 A CN 109195225A
- Authority
- CN
- China
- Prior art keywords
- node
- time slot
- wireless self
- generation method
- integer
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention belongs to fields of communication technology, more particularly to a kind of node working time slot generation method suitable for wireless self-organization network neighbours discovery.It is proposed by the present invention to minimize under RWT can centainly be able to achieve the precondition worked at the same time in a preset maximum duration interval ensuring any two network node as the radio self-organized network nodes working time slot generation method of target, minimize the operating time accounting of each network node.And it is proposed by the present invention using minimize MTCW as the radio self-organized network nodes working time slot generation method of target can the operating time accounting for ensuring each network node be no more than set upper limit value precondition under, minimize any two network node realization works at the same time required maximum duration interval.Maximum time length needed for both node working time slot generation methods effectively reduce apparatus for network node energy consumption needed for neighbor discovery process from different angles and shorten apparatus for network node discovery neighbor node.
Description
Technical field
The invention belongs to field of communication technology, more particularly to a kind of suitable for wireless self-organization network neighbours discovery
Node working time slot generation method.
Background technique
Different from traditional cellular radio, wireless self-organization network does not need static infrastructure support, Neng Gou
Being in communication with each other between terminal is provided in the case where not utilizing network infrastructure (such as base station and wireless access point), thus
Especially suitable for applications such as battlefield communication, emergency management and rescue, Internet of Things and car networkings.Since wireless self-organization network network is opened up
Usually dynamic change is flutterred, therefore each network node needs periodically or non-periodically in the stages such as networking, routing and communications
The function of neighbor node discovery, its neighboring node list of real-time update and network topology are executed, preferably for subsequent routing
It was found that providing reliable guarantee with basic functions such as data transmission.
On the other hand, for only supporting movement and the outdoor communication equipment of energy consumption by battery, when how to realize longer
Between communication be a critical issue.In order to reduce energy consumption, wireless self-organization network allows generally for each network node can
To be toggled between work and suspend mode the two states.When a node is in running order, it can be to its neighbour
Node send data or receive the transmission of its neighbor node data to realize neighbours' discovery feature, but certain battery can be consumed
Energy；And when a node in a dormant state when, it can realize that the minimum energy content of battery is consumed because of that can not communicate, but this
When it can not find the presence of neighbor node.
Therefore, under the limited restrictive condition of node energy, wireless self-organization network neighbours have found a faced pass
Key problem is, how for each network node design one efficient working time slot generation method, is shortening the node as far as possible
Ensure that it obtains the chance of neighbours' discovery in limited time span while operating time.
Summary of the invention
The object of the invention is in view of the above-mentioned problems, proposing a kind of node suitable for wireless self-organization network neighbours discovery
Working time slot generation method.
The parameter for measuring a network node working time slot generation method performance specifically includes that
Maximum works at the same time time interval (Maximum time to current work, abbreviation MTCW), i.e., wirelessly certainly
The realization of any two node works at the same time required maximum duration interval twice in succession in tissue network.Due to any two neighbours
Node is only likely to realize communication handshake when same time slot is in running order simultaneously and finds mutual presence, therefore has
The node working time slot generation method of standby smaller MTCW is generally configured with better performance.
Operating time accounting (Ratio of working time, abbreviation RWT), that is, to ensure that a network node is having
The chance of neighbours' discovery can be obtained in limit, it needs in running order number of time slots in a MTCW time interval
Account for the ratio of the total timeslot number of the time interval.It is obvious that the value range of RWT should be (0,1].Meeting, any two node is total
Under capable of realizing the precondition worked at the same time in longest MTCW time interval, the node working time slot for having smaller RWT is generated
Method is more energy saving.
Therefore, under the precondition for meeting certain MTCW upper limit value, RWT smaller node working time slot generation method energy
Preferably save the energy of radio self-organized network nodes；And under the precondition for meeting certain RWT upper limit value, MTCW is smaller
Node working time slot generation method then have shorter neighbours and find time delay and more preferably neighbours' discovery performance.
Technical principle is based on the present invention:
If defining 1, setA k subset of elements A={ a0,a1,…,ak-1Meet such as
Lower condition, for each nonzero integerThere is at least one element to (ai,aj) meet ai∈ A, aj∈ A and d=ai-
ajModulo n, then set A is thus referred to as (n, k)-relaxed cyclic difference set or referred to as (n, k)-difference set.Wherein,
Indicate the set constituted to all integer modulus n.
Particularly, since all (n, k)-difference sets require to meet condition n≤k2- k+1 or its equivalent conditionTherefore, when parameter k is approached as much as possibleWhen, corresponding (n, k)-difference set is usually further referred to as (n, k)-
Minimum difference set.
For any n >=2, what (n, k)-difference set was constantly present, two inferences as follows can be obtained according to defining 1:
Inference 1. is to (n, k)-difference setExecute the rotation that distance is r ∈ [0, n-1]
Turn k element set generatedIt is also one
(n, k)-difference set.
Inference 2. always has (n, k)-difference set AAt
It is vertical.
Based on inference 1 and 2 it is found that a relaxed cyclic difference set A has so-called rotating closed characteristic, i.e., difference set A is made
Any distance always has the intersection of non-empty between the rotation difference set ROT (A, r) generated and difference set A of r ∈ [0, n-1],
I.e.
The technical scheme is that for any one given MTCW upper limit value, for wireless self-organization network neighbours
Discovery procedure designs the node working time slot generation method of each node operating time accounting RWT of energy minimization, specifically includes:
Any two node realization in wireless self-organization network is defined to work at the same time twice in succession between required maximum duration
Every it is N that is, maximum, which works at the same time the upper limit value of time interval (MTCW), then generates energy minimization work for wireless self-organization network
Duration accounting (RWT) node work and suspend mode time slot method the following steps are included:
S1, for arbitrary integer j >=2, enable MjAn integer intersection is indicated, so that for arbitrary integer M ∈ MjExist extremely
One (M, j) few-minimum difference set, and enable Mj (m)Indicate set MjIn maximum integer, be arranged M1 (m)=1；
One S2, setting smallest positive integral k, to meet the restrictive condition that at least there is (N, k)-difference set；
S3, set M is generatedkAnd Mk-1, and calculate Mk (m)And Mk-1 (m)；
If S4, k/N ∈ [k/Mk (m),(k-1)/Mk-1 (m)), L=N and l=k is set, and enters step S7；Otherwise, if
L=k-1 is set, and enters step S5；
S5, set M is generatedl-1, and calculate Ml-1 (m)；
If S6, k/N ∈ [l/Ml (m),(l-1)/Ml-1 (m)), in set MlMiddle search is less than the maximum integer L of N, and enters
Step S7；Otherwise, l=l-1, and return step S5 are updated；
S7, same (L, l)-difference set A is selected for all nodes of wireless self-organization network, length, which is arranged, for each node is
The neighbours of L time slot have found the period, and it is 0,1 that this L time slot is numbered respectively ..., L-1, and makes each node in each neighbour
It occupies and is in working condition in each time slot i ∈ A in discovery period, and in each time slot in same neighbourhood discovery periodIt is interior
It is in dormant state.
The invention also provides another technical solutions, for any one given RWT upper limit value, for wirelessly from group
Knitmesh network neighbor discovery process design energy minimization any two node works at the same time required maximum duration interval twice in succession
The node working time slot generation method of MTCW, specifically includes:
The upper limit value for defining operating time accounting (RWT) in wireless self-organization network is R, then in wireless self-organization network
It generates the realization of energy minimization any two node and works at the same time required maximum duration interval twice in succession, is i.e. maximum works at the same time
Time interval (MTCW) node work and suspend mode time-slot configuring method the following steps are included:
S1, for arbitrary integer j >=2, enable MjAn integer intersection is indicated, so that for arbitrary integer M ∈ MjExist extremely
One (M, j) few-minimum difference set, enables Mj (m)Indicate set MjIn maximum integer, and enable Mj(n) set M is representedjIn it is n-th small
Integer, wherein n >=1；
S2, initialization i=3, generate set MiAnd Mi-1, and calculate Mi (m)And Mi-1 (m)；
If S3, R ∈ [i/Mi (m),(i-1)/Mi-1 (m)), enter step S5；Otherwise, i=i+1 is updated, and is entered step
S4；
S4, set M is generatedi, calculate Mi (m), and return step S3；
S5, one Integer n ∈ of search [1, | Mi| -1] make R ∈ [i/Mi(n+1),i/Mi(n)) it sets up；
S6, the same (M is selected for all nodes of wireless self-organization networki(n+1), i)-difference set A, it is arranged for each node
Length is Mi(n+1) neighbours of a time slot have found the period, by this Mi(n+1) it is 0,1 that a time slot is numbered respectively ..., Mi(n+1) -1,
And each node is made to be in working condition in each time slot i ∈ A that each neighbours have found the period, and sent out in same neighbourhood
Each time slot in existing periodInside it is in dormant state.
In above scheme, the S6 for minimizing the S7 in RWT method and minimizing in MTCW method is based on one (N, k)-
Difference set A for each network node generates its work and suspend mode time slot in each N slot cycle, wherein in S7 N=L and
K=l, and the N=M in S6i(n+1) and k=i.When nodes X starts to execute prior to its neighbor node Y any t (>=0) a time slot
When neighbours have found, node Y can be in running order in the time slot that each number of each of which N slot cycle belongs to set A, and
Nodes X can be located in the time slot that each number of each N slot cycle of node Y belongs to set ROT (A, (N-t modulo N))
In working condition.According to the rotating closed characteristic of (N, k)-difference set A it is found that due to
Always set up, therefore, no matter nodes X and Y execute difference t at the beginning of neighbours' discovery have it is much, in each N of node Y
In slot cycle (i.e. maximum works at the same time time interval (MTCW)), at least there is 1 time slot and meet nodes X and Y while being in
The requirement of working condition, so as to provide communication handshake and discovery existing chance each other for the two nodes.
Beneficial effects of the present invention are, proposed by the present invention to minimize radio self-organized network nodes of the RWT as target
Working time slot generation method can be centainly able to achieve in a preset maximum duration interval ensuring any two network node
Under the precondition worked at the same time, the operating time accounting of each network node is minimized.And it is proposed by the present invention to minimize
MTCW is that the radio self-organized network nodes working time slot generation method of target can be in the operating time for ensuring each network node
Accounting is no more than under the precondition of set upper limit value, minimizes the realization of any two network node and works at the same time required longest
Time interval.Both node working time slot generation methods effectively reduce apparatus for network node from different angles and send out in neighbours
Maximum time length needed for showing energy consumption needed for process and shortening apparatus for network node discovery neighbor node.This
Outside, the rotating closed characteristic (i.e. inference 2) of relaxed cyclic difference set is benefited from, any two neighbor node is in any timing differential
In the case of can be worked at the same time in each longest and obtain communication handshake in time interval MTCW and find mutual chance.
Detailed description of the invention
Fig. 1 be under given MTCW upper limit value, the present invention mentioned using minimize RWT as target, based on grid
The node operating time accounting RWT that quorum and node working time slot generation method based on minimum difference set obtain respectively；
Fig. 2 is under given RWT upper limit value, and what the present invention was mentioned is target and is based on grid to minimize MTCW
The maximum that the node working time slot generation method of quorum obtains respectively works at the same time time interval MTCW；
Fig. 3 is under given RWT upper limit value, and what the present invention was mentioned is target and based on minimum difference set to minimize MTCW
The maximum that obtains respectively of node working time slot generation method work at the same time time interval MTCW.
Specific embodiment
The present invention will be described with reference to the accompanying drawings and examples.
Embodiment 1
As given MTCW upper limit value N=4, this example is mentioned raw as the node working time slot of target to minimize RWT
In accordance with the following steps can generate work and the suspend mode time slot of each network node at method:
Step 1: enabling M for arbitrary integer j >=2jAn integer intersection is indicated, so that for arbitrary integer M ∈ MjDeposit
In at least one (M, j)-minimum difference set, and enable Mj (m)Indicate set MjIn maximum integer.M is set1 (m)=1.
Step 2: there are the smallest positive integral k of (N, k)-difference set restrictive condition should be 3 for satisfaction as N=4.
Step 3: generating set M2={ 3 } and M3={ 4,5,6,7 }, and calculate M2 (m)=3 and M3 (m)=7.
Step 4: due toSo setting l=k-1=2, and jump to the 5th step.
Step 5: can be obtained according to the first step, Ml-1 (m)=M1 (m)=1.
Step 6: due to k/N=3/4 ∈ [2/3,1), so in set Ml=M2Middle search is less than the maximum integer of N=4
L.Thus, L=3.
Step 7: being that all nodes of wireless self-organization network select one (3,2)-poor due to L=3 and l=2
Collect { 0,1 } ∈ Z3The working time slot of each network node is generated, when the neighbours of each node being set finding that cycle length is 3
Gap, it is 0,1 and 2 that each neighbours, which are had found that 3 time slots in period are numbered respectively, and each node is arranged and finds in each neighbours
The time slot 0 and 1 in period is in running order, and the time slot in the period 2 in a dormant state.
It can be obtained based on above-mentioned steps, when given MTCW upper limit value is N=4, each network node operating time accounting
It is 2/3.Similarly, we are available, as given MTCW upper limit value N=9,16,25,36,49,64,81 and 100, this
Invent the node operating time accounting point that can be obtained to minimize RWT as the node working time slot generation method of target proposed
It Wei 3/7,4/13,5/21,6/31,8/49,8/57,9/73 and 10/91.
In order to be compared using minimizing RWT as the node working time slot generation method of target with what the present invention was mentioned, examine
Node working time slot generation method (S.Khatibi, M.Dehghan, and based on grid quorum are considered
M.A.Poormina,“Quorum-Based Pure Directional Neighbor Discovery in Self-
Organized Ad Hoc Networks,”International Symposium on Telecommunications
(IST), node working time slot generation method (J.R.Jiang, Y.-C.Tseng, C.- 2010) and based on minimum difference set
S.Hsu,and T.-H.Lai,“Quorum-Based Asynchronous Power-Saving Protocols for IEEE
802.11Ad Hoc Networks,”Mobile Networks and Applications,Vol.10,No.1-2,pp.169-
181,2005).Wherein, it is that an integer is flat that the generation method based on grid quorum, which is only applicable to given MTCW upper limit value N,
The situation of side.Particularly, as given MTCW upper limit value N=4,9,16,25,36,49,64,81 and 100, it is based on grid
The node operating time accounting that the node working time slot generation method of quorum can obtain is respectively 3/4,5/9,7/16,9/
25,11/36,13/49,15/64,17/81 and 19/100.On the other hand, the generation method based on minimum difference set is directed to given
MTCW upper limit value N directlys adopt (N, k)-minimum difference set to generate work and the suspend mode time slot of each network node.It can be fitted
For any given MTCW upper limit value N (>=3).
As shown in Figure 1, as given MTCW upper limit value N=3, when 4 ..., 81, what the present invention was mentioned is to minimize RWT
The node operating time accounting that target and node working time slot generation method based on minimum difference set obtain respectively, and when giving
Fixed MTCW upper limit value N=4, when 9,16,25,36,49,64 and 81, the node working time slot generation side based on grid quorum
Method node operating time accounting obtained.As can be seen that for same given MTCW upper limit value, the mentioned side of the present invention
Method can obtain RWT value more lower than generation method based on grid quorum, and also can always obtain than based on minimum difference set
The lower or same RWT value of generation method, thus explanation this hair in the case where identical neighbours have found maximum duration interval
Bright mentioned method is more energy saving than the generation method based on grid quorum and based on minimum difference set.
Embodiment 2
As given RWT upper limit value R=5/9, the node working time slot to minimize MTCW as target that this example is mentioned
Generation method in accordance with the following steps can generate work and the suspend mode time slot of each network node:
Step 1: enabling M for arbitrary integer j >=2jAn integer intersection is indicated, so that for arbitrary integer M ∈ MjDeposit
In at least one (M, j)-minimum difference set, M is enabledj (m)Indicate set MjIn maximum integer, and enable Mj(n) set M is representedjIn
N-th small integer, wherein n >=1.
Step 2: initialization i=3, generates set M2={ 3 } and M3={ 4,5,6,7 }, and calculate M2 (m)=3 and M3 (m)
=7.
Step 3: due to RWT upper limit value R=5/9 ∈ [i/Mi (m),(i-1)/Mi-1 (m))=[3/7,2/3), it is therefore desirable to
Jump to the 4th step
Step 4: in set M3Integer n=2 are searched in={ 4,5,6,7 } makes R ∈ [i/Mi(n+1),i/Mi(n))=
It [3/6,3/5) sets up.
Step 5: selecting same (6,3)-difference set { 0,1,3 } ∈ Z for all nodes of wireless self-organization network6To generate
The working time slot of each network node is arranged the neighbours that length is 6 time slots for each node and finds the period, by this 6 time slots
Number is 0,1 respectively ..., 5, and each node is made to be in work shape in the time slot 0,1 and 3 that each neighbours have found the period
State, and dormant state is in the time slot 2,4 and 5 in same neighbourhood discovery period.
It can be obtained based on above-mentioned steps, it is raw as the section of target to minimize MTCW when given RWT upper limit value is R=5/9
Working at the same time time interval at the maximum that method obtains is 6 time slots.Similarly, when given RWT upper limit value is R=3/4,
It is 3 time slots that the maximum that this method obtains, which works at the same time time interval,.
In order to be compared using minimizing MTCW as the node working time slot generation method of target with what the present invention was mentioned, examine
The node working time slot generation method based on grid quorum and based on minimum difference set is considered.When given RWT upper limit value is R
When=5/9, it is 9 time slots that the maximum that the generation method based on grid quorum can obtain, which works at the same time time interval,.And work as
When given RWT upper limit value is R=3/4, the maximum that the generation method based on minimum difference set can obtain was worked at the same time between the time
It is divided into 4 time slots.
As shown in Fig. 2, when given RWT upper limit value is R=3/4,5/9,7/16,9/25,11/36,13/49,15/64 He
When 17/81, the present invention mentioned to minimize MTCW as target and the node working time slot generation method based on grid quorum
The maximum obtained respectively works at the same time time interval.As can be seen that the present invention is mentioned for same given RWT upper limit value
Method can be obtained than based on the lower MTCW value of grid quorum method, thus explanation under identical power conservation requirement the former
Than the chance that the latter can obtain neighbours' discovery in shorter time interval.
As shown in figure 3, when given RWT upper limit value is [9/73,0.75] R ∈, the present invention mentioned to minimize
The maximum that node working time slot generation method of the MTCW for target and based on minimum difference set obtains respectively worked at the same time between the time
Every.As can be seen that the mentioned method of the present invention can be obtained than the life based on minimum difference set for same given RWT upper limit value
At the identical perhaps lower MTCW value of method thus explanation the former can be identical or more than the latter under identical power conservation requirement
The chance of neighbours' discovery is obtained in short time interval.
Claims (2)
1. being suitable for the node working time slot generation method of wireless self-organization network neighbours discovery, define in wireless self-organization network
The realization of any two node works at the same time required maximum duration interval twice in succession, i.e. maximum works at the same time time interval
(MTCW) upper limit value be N, then for wireless self-organization network generate energy minimization operating time accounting (RWT) node work and
The method of suspend mode time slot the following steps are included:
S1, for arbitrary integer j >=2, enable MjAn integer intersection is indicated, so that for arbitrary integer M ∈ MjHave at least one
A (M, j)-minimum difference set, and enable Mj (m)Indicate set MjIn maximum integer, be arranged M1 (m)=1；
One S2, setting smallest positive integral k, to meet the restrictive condition that at least there is (N, k)-difference set；
S3, set M is generatedkAnd Mk-1, and calculate Mk (m)And Mk-1 (m)；
If S4, k/N ∈ [k/Mk (m),(k-1)/Mk-1 (m)), L=N and l=k is set, and enters step S7；Otherwise, l=is set
K-1, and enter step S5；
S5, set M is generatedl-1, and calculate Ml-1 (m)；
If S6, k/N ∈ [l/Ml (m),(l-1)/Ml-1 (m)), in set MlMiddle search is less than the maximum integer L of N, and enters step
S7；Otherwise, l=l-1, and return step S5 are updated；
S7, same (L, l)-difference set A is selected for all nodes of wireless self-organization network, it is L that length, which is arranged, for each node
The neighbours of time slot have found the period, and it is 0,1 that this L time slot is numbered respectively ..., L-1, and each node is sent out in each neighbours
Working condition is in each time slot i ∈ A in existing period, and in each time slot in same neighbourhood discovery periodInside locate
In dormant state.
2. being suitable for the node working time slot generation method of wireless self-organization network neighbours discovery, define in wireless self-organization network
The upper limit value of operating time accounting (RWT) is R, then realizes to generate energy minimization any two node in wireless self-organization network
Required maximum duration interval is worked at the same time twice in succession, i.e. maximum works at the same time the node work of time interval (MTCW) and stops
Dormancy time-slot configuring method the following steps are included:
S1, for arbitrary integer j >=2, enable MjAn integer intersection is indicated, so that for arbitrary integer M ∈ MjHave at least one
A (M, j)-minimum difference set, enables Mj (m)Indicate set MjIn maximum integer, and enable Mj(n) set M is representedjIn it is n-th small whole
It counts, wherein n >=1；
S2, initialization i=3, generate set MiAnd Mi-1, and calculate Mi (m)And Mi-1 (m)；
If S3, R ∈ [i/Mi (m),(i-1)/Mi-1 (m)), enter step S5；Otherwise, i=i+1 is updated, and enters step S4；
S4, set M is generatedi, calculate Mi (m), and return step S3；
S5, one Integer n ∈ of search [1, | Mi| -1] make R ∈ [i/Mi(n+1),i/Mi(n)) it sets up；
S6, the same (M is selected for all nodes of wireless self-organization networki(n+1), i)-difference set A, for each node, length is set
For Mi(n+1) neighbours of a time slot have found the period, by this Mi(n+1) it is 0,1 that a time slot is numbered respectively ..., Mi(n+1) -1, and make
It obtains each node and is in working condition in each time slot i ∈ A that each neighbours have found the period, and find week in same neighbourhood
Each time slot of phaseInside it is in dormant state.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811228373.9A CN109195225B (en) | 2018-10-22 | 2018-10-22 | Node working time slot generation method suitable for neighbor discovery of wireless self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811228373.9A CN109195225B (en) | 2018-10-22 | 2018-10-22 | Node working time slot generation method suitable for neighbor discovery of wireless self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109195225A true CN109195225A (en) | 2019-01-11 |
| CN109195225B CN109195225B (en) | 2021-06-08 |
Family
ID=64946114
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811228373.9A Active CN109195225B (en) | 2018-10-22 | 2018-10-22 | Node working time slot generation method suitable for neighbor discovery of wireless self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109195225B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110519745A (en) * | 2019-08-05 | 2019-11-29 | 西安电子科技大学 | The neighbor discovering method of greatest common divisor based on cycle length |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101689986A (en) * | 2007-07-10 | 2010-03-31 | 高通股份有限公司 | Methods and apparatus for data exchange in peer to peer communications |
| CN105813163A (en) * | 2014-12-29 | 2016-07-27 | 中国民用航空总局第二研究所 | Method of work cycle time set configuration in sensor network neighbor discovery |
| CN106471842A (en) * | 2014-07-09 | 2017-03-01 | 高通股份有限公司 | Service announcement in neighbours' sensing network data link and scheduling |
| US20170278198A1 (en) * | 2011-10-19 | 2017-09-28 | Facebook, Inc. | Social Ad Hoc Networking Protocol and Presentation Layer |
| CN107395251A (en) * | 2017-07-17 | 2017-11-24 | 电子科技大学 | Suitable for the frequency hopping sequence generating method of more transceiver cognition wireless networks |
| CN107889184A (en) * | 2017-11-03 | 2018-04-06 | 四川大学 | Neighbor node finds method and system |
| CN108521648A (en) * | 2018-02-09 | 2018-09-11 | 北京航空航天大学 | A method of the adaptive neighbours of directive antenna based on historical information have found |
-
2018
- 2018-10-22 CN CN201811228373.9A patent/CN109195225B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101689986A (en) * | 2007-07-10 | 2010-03-31 | 高通股份有限公司 | Methods and apparatus for data exchange in peer to peer communications |
| US20170278198A1 (en) * | 2011-10-19 | 2017-09-28 | Facebook, Inc. | Social Ad Hoc Networking Protocol and Presentation Layer |
| CN106471842A (en) * | 2014-07-09 | 2017-03-01 | 高通股份有限公司 | Service announcement in neighbours' sensing network data link and scheduling |
| CN105813163A (en) * | 2014-12-29 | 2016-07-27 | 中国民用航空总局第二研究所 | Method of work cycle time set configuration in sensor network neighbor discovery |
| CN107395251A (en) * | 2017-07-17 | 2017-11-24 | 电子科技大学 | Suitable for the frequency hopping sequence generating method of more transceiver cognition wireless networks |
| CN107889184A (en) * | 2017-11-03 | 2018-04-06 | 四川大学 | Neighbor node finds method and system |
| CN108521648A (en) * | 2018-02-09 | 2018-09-11 | 北京航空航天大学 | A method of the adaptive neighbours of directive antenna based on historical information have found |
Non-Patent Citations (6)
| Title |
|---|
| JEHN-RUEY JING等: "Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks", 《2003 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 2003. PROCEEDINGS.》 * |
| SINA KHATIBI等: "Quorum-based neighbor discovery in self-organized cognitive MANET", 《21ST ANNUAL IEEE INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS》 * |
| SINA KHATIBI等: "Quorum-based pure directional neighbor discovery in self-organized ad hoc networks", 《2010 5TH INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATIONS》 * |
| TONG SHEN等: "Alano: An Efficient Neighbor Discovery Algorithm in an Energy-Restricted Large-Scale Network", 《 2018 IEEE 15TH INTERNATIONAL CONFERENCE ON MOBILE AD HOC AND SENSOR SYSTEMS (MASS)》 * |
| 徐瞳阳: "无线自组网定向天线邻居发现技术研究", 《中国优秀硕士学位论文电子期刊网》 * |
| 陈杰: "基于循环差集的认知无线网络控制信息交互机制设计", 《中国优秀硕士论文电子期刊网》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110519745A (en) * | 2019-08-05 | 2019-11-29 | 西安电子科技大学 | The neighbor discovering method of greatest common divisor based on cycle length |
| CN110519745B (en) * | 2019-08-05 | 2021-04-20 | 西安电子科技大学 | Neighbor discovery method based on maximum common divisor of cycle length |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109195225B (en) | 2021-06-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bhola et al. | Performance evaluation of multilayer clustering network using distributed energy efficient clustering with enhanced threshold protocol | |
| Wei et al. | Cluster-based routing protocols in wireless sensor networks: a survey | |
| Voigt et al. | Solar-aware clustering in wireless sensor networks | |
| Hady et al. | Intelligent sleeping mechanism for wireless sensor networks | |
| Saxena et al. | Clustering based energy efficient algorithm using max-heap tree for MANET | |
| Esmaeeli et al. | Improving energy efficiency using a new game theory algorithm for wireless sensor networks | |
| Razzaq et al. | Energy efficient Dijkstra-based weighted sum minimization routing protocol for WSN | |
| Chen et al. | Never live without neighbors: From single-to multi-channel neighbor discovery for mobile sensing applications | |
| Salah et al. | Energy efficient clustering based on LEACH | |
| Pozza et al. | CARD: Context-aware resource discovery for mobile Internet of Things scenarios | |
| Khodashahi et al. | Optimal location for mobile sink in wireless sensor networks | |
| CN109195225A (en) | Node working time slot generation method suitable for wireless self-organization network neighbours discovery | |
| Rauthan et al. | An improved approach in clustering algorithm for load balancing in wireless sensor networks | |
| Imani et al. | Adaptive S-grid: a new adaptive quorum-based power saving protocol for multi-hop ad hoc networks | |
| Al-Kaseem et al. | Energy efficient MAC protocol with smart sleep scheduling for cluster-based M2M networks | |
| Cao et al. | Energy optimization protocol of heterogeneous WSN based on node energy | |
| Hatamian et al. | A centralized evolutionary clustering protocol for wireless sensor networks | |
| Mahlknecht et al. | Energy aware distance vector routing scheme for data centric low power wireless sensor networks | |
| Aissa et al. | An efficient scalable weighted clustering algorithm for mobile Ad Hoc networks | |
| Alippi et al. | An adaptive LLC-based and hierarchical power-aware routing algorithm | |
| Saidu et al. | An enhanced leach routing algorithm for energy conservation in a wireless sensor network | |
| Yan et al. | An Energy-Aware Multilevel Clustering algorithm for wireless sensor networks | |
| Guo et al. | Intra-superframe power management for IEEE 802.15. 3 WPAN | |
| CN103619050B (en) | For the neighbor node discover method based on perfect difference set of mobile wireless network | |
| Nanda et al. | Cost effective modleach-a* search algorithm for shortest path routing in wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |