CN103209461B - Cycle neighbor discovering method asymmetric low on duty by turns based on collaboration prime number - Google Patents
Cycle neighbor discovering method asymmetric low on duty by turns based on collaboration prime number Download PDFInfo
- Publication number
- CN103209461B CN103209461B CN201310060129.7A CN201310060129A CN103209461B CN 103209461 B CN103209461 B CN 103209461B CN 201310060129 A CN201310060129 A CN 201310060129A CN 103209461 B CN103209461 B CN 103209461B
- Authority
- CN
- China
- Prior art keywords
- time slot
- cycle
- prime number
- duty
- turns
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 239000000523 sample Substances 0.000 claims abstract description 23
- 230000008569 process Effects 0.000 claims description 6
- 230000007958 sleep Effects 0.000 claims description 6
- 230000007246 mechanism Effects 0.000 claims description 5
- 230000000737 periodic effect Effects 0.000 claims description 3
- 230000005059 dormancy Effects 0.000 claims 1
- 241001050985 Disco Species 0.000 description 5
- 230000001186 cumulative effect Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 230000003442 weekly effect Effects 0.000 description 4
- 238000005315 distribution function Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 108090000623 proteins and genes Proteins 0.000 description 2
- 206010019133 Hangover Diseases 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000003467 diminishing effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000010304 firing Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000004622 sleep time Effects 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention discloses a kind of cycle neighbor discovering method asymmetric low on duty by turns based on collaboration prime number, and which comprises the steps：The corresponding cycle on duty by turns is selected according to the energy requirement and delay requirement of mobile node.According to the cycle on duty by turns, select different parameters to arrange the position of anchor time slot, probe time slot and prime number time slot, set up neighbor uni-cast dispatch list.Mobile node completes neighbor uni-cast according to the neighbor uni-cast dispatch list.Prime number of the present invention using single cooperation, it is ensured that quick asynchronous neighbor is completed in the discovery time delay of bounded and is found, and the quantity in optional cycle on duty by turns is increased, energy distribution is more flexible.Under asymmetric low cycle stage on duty by turns, the relatively low energy expense of mobile node can not only be ensured, and reduce the worst discovery time delay.
Description
Technical field
The present invention relates to mobile social networking technical field, more particularly to it is a kind of based on the asymmetric low on duty by turns of collaboration prime number
Cycle neighbor discovering method.
Background technology
In recent years, the mobile device such as movable sensor and smart mobile phone has obtained extensive and deep answering in all fields
With.Great majority have an opportunity to meet mutually each other based on the mobile device of application.For example, two mobile devices are encountered, and then
Communicate；Certain mobile device needs into a group having built up and multiple mobile devices the field for forming a group
Scape.In these application scenarios, it is required for mobile device quickly to find the neighbor user in oneself communication range.
In emerging Internet of Things and mobile social networking, mobile device completes neighbor uni-cast and mainly faces three aspects
Challenge.First, the energy of mobile device is restricted.In order to extend the time of continuous firing, mobile device is needed in extremely low wheel
Run under phase on weekly duty, the hardware platform of isomery is also required to the asymmetrical cycle on duty by turns（The i.e. different cycles on duty by turns）.2nd, movement sets
Standby work is asynchronous, will cause bigger discovery time delay in the network in low cycle on duty by turns.3rd, major part operates in movement and sets
Standby upper application is very sensitive to time delay, and less discovery time delay is required in neighbor discovery process.
For asynchronous asymmetrical neighbor uni-cast problem, before researched and proposed several solutions, such as Disco,
U-Connect and Searchlight agreements.Disco agreements choose a pair of prime numbers, the cycle on duty by turns be two prime numbers inverse it
With if the value of node slot time counter can be divided exactly by arbitrary prime number, this time slot is just active slot, and the crossover of active slot can
To complete neighbor uni-cast；U-Connect agreements only select a prime number p, every p-1 time slot be an active slot, while
Per p2There is (p+1)/2 active slot in individual time slot；And Searchlight agreements are using between any two node active slot
Normal skew, compare Disco and U-Connect agreements, when reducing about 50% the worst discovery in the case of the symmetrical wheel phase on weekly duty
Prolong., above-mentioned three kinds of agreements are in reply energy efficiency and find to show its superiority in the challenge that brings of time delay, but, non-
In the case of the symmetrical low cycle on duty by turns, performance is relatively poor.
The content of the invention
For above-mentioned technical problem, it is an object of the invention to provide a kind of asymmetric low wheel based on collaboration prime number is on weekly duty
Phase neighbor discovering method, which can ensure bounded and less discovery time delay under extremely low energy expense, so as to complete low work(
The neighbor uni-cast of consumption.
It is that, up to this purpose, the present invention is employed the following technical solutions：
A kind of cycle neighbor discovering method asymmetric low on duty by turns based on collaboration prime number, which comprises the steps：
A, the energy requirement according to mobile node and delay requirement select the corresponding cycle on duty by turns；
B, according to the cycle on duty by turns, select different parameters to arrange the position of anchor time slot, probe time slot and prime number time slot, build
Vertical neighbor uni-cast dispatch list；
C, mobile node complete neighbor uni-cast according to the neighbor uni-cast dispatch list.
Especially, step B also includes：
Using the periodic sleep dispatching method based on time division mechanism, the time slot by mobile node in a cycle is divided
For time slot and the active slot of sleeping, wherein, active slot is divided into anchor time slot, probe time slot and prime number time slot three types.
Especially, in step B when defining and select prime number time slot, choose single prime number.
Especially, different parameters are selected to arrange the position of anchor time slot, probe time slot and prime number time slot, tool in step B
Body includes：
Different parameters t and p is selected to arrange the position of anchor time slot, probe time slot and prime number time slot, wherein, t is movable joint
The timeslot number of point a cycle, p is the prime number in [2, t-1].
Especially, the position of anchor time slot, probe time slot and prime number time slot is arranged in step B, is specifically included：
The position of anchor time slot is fixed, and is arranged in first time slot in each cycle；Probe time slot can systematically search for which
The anchor time slot of its node, from the beginning of slot count value 1, each cycle increases by 1, ends at for its positionThen repeat this mistake
Journey；Selected prime number is limited to [2, t-1], and corresponding prime number Slot format is in the null positions of slot count value mould p.
Especially, the neighbor uni-cast dispatch list is made up of the time slot of predefined regular length.
Especially, step C is specifically included：
Mobile node sends beacon message in the beginning and end of active slot according to the neighbor uni-cast dispatch list,
When any two time slot of anchor time slot, probe time slot and prime number time slot these three active slots is overlapped each other, you can receive and disappear
Its neighbour is ceased and recorded, neighbor uni-cast is completed.
Cycle neighbor discovering method asymmetric low on duty by turns based on collaboration prime number proposed by the present invention has the advantage that：
First, prime number of the prime number time slot using single cooperation, it is ensured that quick asynchronous neighbor is completed in the discovery time delay of bounded and is found,
And the quantity in optional cycle on duty by turns is increased, energy distribution is more flexible.2nd, under asymmetric low cycle stage on duty by turns, no
The relatively low energy expense of mobile node is only ensure that, and reduces the worst discovery time delay.
Description of the drawings
Fig. 1 is the cycle neighbor discovering method flow process asymmetric low on duty by turns based on collaboration prime number provided in an embodiment of the present invention
Figure；
Fig. 2 is neighbor uni-cast dispatch list schematic diagram of the tradition provided in an embodiment of the present invention based on time division mechanism；
Fig. 3 is the neighbor uni-cast dispatch list schematic diagram set up using the present invention provided in an embodiment of the present invention；
Fig. 4 is the neighbor uni-cast schematic diagram in asymmetric cycle on duty by turns provided in an embodiment of the present invention；
Fig. 5 has found that time delay cumulative distribution function is bent when being 1%-10% for the asymmetric cycle on duty by turns provided in an embodiment of the present invention
Line chart；
Different neighbor uni-cast sides when Fig. 6 is 1%-10% with 1%-5% for the asymmetric cycle on duty by turns provided in an embodiment of the present invention
The average discovery time delay comparison diagram of method；
Fig. 7 is 1%-5% for the asymmetric cycle on duty by turns provided in an embodiment of the present invention and finds when choosing different adjustment factor-alpha
Time delay cumulative distribution function curve map.
Specific embodiment
The invention will be further described with reference to the accompanying drawings and examples.It is understood that tool described herein
Body embodiment is used only for explaining the present invention, rather than limitation of the invention.It also should be noted that, for the ease of retouching
State, in accompanying drawing, illustrate only part related to the present invention rather than full content.
Refer to shown in Fig. 1, the cycle neighbor discovering method bag asymmetric low on duty by turns in the present embodiment based on collaboration prime number
Include following steps：
Step S101, the energy requirement according to mobile node and delay requirement select the corresponding cycle on duty by turns.
Cycle on duty by turns represents that node is enlivened and length of one's sleep ratio.The cycle on duty by turns of the fewer needs of energy of node is less.Together
When, due to the isomerism of mobile device, different nodes may select the asymmetrical cycle on duty by turns.
Step S102, according to the cycle on duty by turns, select different parameters to arrange anchor (anchor) time slot, probe (probe)
The position of time slot and prime number (prime) time slot, sets up neighbor uni-cast dispatch list.
Using the periodic sleep dispatching method based on time division mechanism, by mobile node during most of in a cycle
Gap is defined as time slot of sleeping, and partial time slot is defined as active slot, so as to set up neighbor uni-cast dispatch list, so, mobile
Node is slept in most of time slot, and fraction time slot is enlivened, and is conducive to saving energy, extending life cycle.As shown in Fig. 2 figure
Middle A, B represent two mobile nodes, and black region is active slot, and white portion is sleep time slot, and mobile node A, B will be every
One or more time slots in individual cycle are waken up, and sleep in remaining most of time slot.In the time slot waken up, namely when enlivening
Gap, node can send according to application program or receive message.When two active slots are overlapped each other, the movable joint of neighbours each other
Point A, B just can successfully have found other side.
Time slot of sleeping is defined as by the most of time slot by mobile node in a cycle only, partial time slot is defined as
Active slot, sets up neighbor uni-cast dispatch list, can not ensure bounded and less discovery time delay under extremely low energy expense,
So as to complete the neighbor uni-cast of low-power consumption.Therefore active slot is divided into three types by the present invention：Anchor time slot, probe time slot and element
Number time slot.In cycle on duty by turns according to selected by step S101, different parameters t and p is selected to arrange anchor time slot, probe time slot and prime number
The position of time slot, sets up neighbor uni-cast dispatch list, and t is the timeslot number of mobile node a cycle, and p is the prime number in [2, t-1].
The position of anchor time slot is fixed, and is arranged in first time slot in each cycle；Probe time slot can systematically search for other nodes
Anchor time slot, from the beginning of slot count value 1, each cycle increases by 1, ends at for its positionThen repeat this process；Meanwhile, by
Chinese remainder theorem is inspired, present invention introduces the third active slot, i.e. prime number time slot, are defining and selecting prime number time slot
When, single prime number is chosen, selected prime number is limited to [2, t-1], and corresponding prime number Slot format is equal to zero in slot count value mould p
Position.It should be noted that neighbor uni-cast dispatch list is made up of the time slot of predefined regular length.
As shown in figure 3, using A, P, p represent anchor time slot, probe time slot and prime number time slot respectively, and by arranging, (A, P p) build
Found a kind of new neighbor uni-cast dispatch list.The present invention one time slot counter of setting, A are located at time slot 0；P from the beginning of time slot 1, often
The individual cycle increases by 1, ends atThen repeat this process；P is in the null positions of slot count value mould p, for example, chooses
Prime number p=5, if the initial value of slot count t is 0, the time slot as tmodp=0（That is time slot 0,5,15,20 ...）For the element for enlivening
Number time slot.Give an example, for a certain mobile node, selection cycle t=8, prime number p=5, probe time slot periodicity according to 1,
2,3,4 } choose, a neighbor uni-cast dispatch list can be set up, i.e., shown in Fig. 3.
Under asymmetric case, different mobile nodes choose different parameters t and p, set up different neighbor uni-cast dispatch lists.
Fig. 4 is the example of neighbor uni-cast under an asymmetric case, wherein, A（p）Or P（p）Represent respectively anchor time slot and prime number time slot,
The selection of probe time slot and prime number time slot is overlapped, and two mobile nodes u and v choose t respectivelyu=6, pu=3 and tu=8, pu=5,
Can be found in time slot 6,9,21.
Step S103, mobile node complete neighbor uni-cast according to the neighbor uni-cast dispatch list.
In fact, mobile node always independent operating, does not set a length of a game, when clock drift may result in yet
Gap non-alignment.The present invention is not assumed that or by the boundary of time slot alignment between different nodes.In order to solve time slot non-alignment
Problem, mobile node sends beacon in the beginning and end of active slot according to the neighbor uni-cast dispatch list
（beacon）Message, and communicated in the remaining time of time slot.When anchor time slot, probe time slot and prime number time slot, these three enliven
When any two time slot of time slot is overlapped each other, you can receive message and record its neighbour, complete neighbor uni-cast.Ordinary circumstance
Under, each time slot can be set to several milliseconds, or even a few microseconds by node, and the smart mobile phone for being furnished with Wi-Fi needs to be set to several seconds.
In order to save energy, node needs to carry out neighbor uni-cast using as far as possible few time slot.
Performance to the present invention under symmetrical wheel phase on weekly duty and asymmetric cycle on duty by turns is illustrated below.
Symmetric case is discussed first, that is, all of mobile node has identical neighbor uni-cast dispatch list.The present invention
The worst discovery time delay in a symmetrical case, namely the minimum number of timeslots completed needed for neighbor uni-cast isThus may be used
Know, the present invention is having found to compromise between time delay and energy ezpenditure, although introduces prime number time slot and increased the cycle on duty by turns, but reduces
Discovery time delay.
Secondly, under asymmetric case, different mobile nodes choose different parameters t and p, set up different discovery scheduling
Table.Assume that the cycle on duty by turns of two mobile nodes is respectively 1/x1And 1/x2, and x1＞ x2.Given parameters (t1,p1),(t2,p2), p1,p2For selected prime number, α is regulatory factor, then the worst discovery time delay of the invention is less than or equal toCompared with Searchlight agreements, i.e.,α ＞ 4, the worst discovery time delay of the present invention are needed only
Less than Searchlight agreements, smaller than Disco and U-Connect agreements.Moreover, different mobile nodes in the present invention
Anchor time slot, probe time slot and prime number time slot crossover chance it is more, so comparing other Neighbor Discovery Protocols its worst discoveries
Shi Yanhui is less.Meanwhile, invention increases the quantity in optional cycle on duty by turns, energy distributes more flexible.
In addition, why when defining and select prime number time slot, choosing single prime number, its mechanism is as follows：
If choosing active slot it cannot be guaranteed that time slot crossover according to any nonnegative integer, while only choosing coprime non-negative
Integer cannot guarantee that discovery, so active slot should be determined using pure prime number.But, the multiple prime numbers of selection will cause superfluous
It is remaining and bring bigger energy ezpenditure, so the present invention chooses single prime number and synergistically together decides on active slot with parameter t.
Assume that the cycle on duty by turns of two mobile nodes is respectively 1/x1And 1/x2, and x1＞ x2.Two nodes each choose n
Individual prime number, i.e. p11,p12,...,p1nAnd p21,p22,...,p2n, order And And α1＞ α2＞ ... ＞ αn, then p11＜ p12＜ ... ＜ p1nAnd p21＜ p22＜ ... ＜ p2n.Two nodes it is on duty by turns
Cycle is：WithSo,
It is the worst to find that time delay is：
Obviously,Thus can obtain, when choosing single prime number, the present invention is non-
The worst discovery time delay under symmetric case is minimum.In other words, when choosing single synergistically prime number, the best performance of the present invention.
It is below simulation analysis situation：1) emulation is arranged and explanation.This analysis is important to notice that under asymmetric case not
When spending identical energy with agreement, need how long to find neighbours.Without loss of generality, energy can be represented by the cycle on duty by turns.
It was found that time delay refers to enter respective communication range to the time delay for finding mutually other side from two nodes, now with time slot
Number represents discovery time delay.Each agreement is run 1000 times with different seeds, the cumulative distribution letter of the time delay that makes discovery from observation
Number curve, can analyze the performance of different agreement.The present invention to the pSearch agreements that proposed and Disco, U-Connect and
Searchlight agreements are compared.This analysis also have evaluated impacts of the Dynamic gene α to protocol capabilities.2）It was found that time delay point
Analysis.Selective analysis and compare different Neighbor Discovery Protocols node select the asymmetric cycle on duty by turns when discovery time delay.Do not lose
Generality, arranges asymmetric low cycle 1%-10% on duty by turns for pSearch agreements, makes Dynamic gene α be equal to 8.When two movements
When the cycle on duty by turns of node is respectively 1% and 10%, the prime pair that Disco agreements are chosen is（17,23）With（191,211）, U-
The prime number that Connect chooses is 17 and the parameter of 151, Searchlight agreement selection is 20 and 200, and the choosing of pSearch agreements
The parameter for taking is（100,13）With（1000,123）.As shown in figure 5, comparing Searchlight agreements, pSearch is reduced about
30% finds time delay, the best performance in several discovery agreements.From Fig. 5 it can also be seen that deterministic Neighbor Discovery Protocol will not
Result in a finding that the hangover of time delay cumulative distribution function.Fig. 6 is more clearly analyzed and is compared the average of different Neighbor Discovery Protocols
It was found that time delay, 1,2,3,4 represent the discovery time delay bar shaped of Searchlight, pSearch, U-Connect, Disco agreement respectively
Figure.In asymmetric low cycle 1%-10% and 1%-5% on duty by turns, the average discovery time delay of pSearch agreements is slightly larger than
Searchlight agreements, but it is less than other agreements.
Under asymmetric case, the worst discovery time delay of pSearch agreements isFor analysis and regulation factor-alpha pair
The impact of pSearch protocol capabilities, chooses α respectively and is equal to 2,6 and 8.As shown in fig. 7, when being respectively 1% and 5% in the cycle on duty by turns,
The discovery time delay of pSearch agreements reduces with the increase of α, α be more than 4 when, when as 6 and 8, pSearch agreements it is the worst
It was found that time delay is less than Searchlight agreements.But, as α increases, it is found that the reduction amplitude of time delay is diminishing, finally nearly
Approximately equal to x1x2。
Technical scheme can not only ensure the relatively low energy of mobile node under asymmetric low cycle stage on duty by turns
Amount expense, and reduce the worst discovery time delay.
The preferred embodiments of the present invention are the foregoing is only, the present invention is not limited to, for those skilled in the art
For, the present invention can have various changes and change.All any modifications made within spirit and principles of the present invention, equivalent
Replace, improve etc., should be included within the scope of the present invention.
Claims (5)
1. it is a kind of based on the cycle neighbor discovering method asymmetric low on duty by turns for cooperateing with prime number, it is characterised in that to comprise the steps：
A, the energy requirement according to mobile node and delay requirement select the corresponding cycle on duty by turns；
B, according to the cycle on duty by turns, select different parameters to arrange the position of anchor time slot, probe time slot and prime number time slot, set up adjacent
Occupy and find dispatch list, detailed process is as follows：Different parameters t and p is selected to arrange the position of anchor time slot, probe time slot and prime number time slot
Put, wherein, timeslot numbers of the t for mobile node a cycle, p is the prime number in [2, t-1]；The position of anchor time slot is fixed, and arranges
In first time slot in each cycle；The anchor time slot of other nodes is searched on probe slotted system ground, and its position is from slot count value 1
Start, each cycle increases by 1, ends atThen repeat this process；Selected prime number is limited to [2, t-1], corresponding prime number
Slot format is in the null positions of slot count value mould p；
C, mobile node complete neighbor uni-cast according to the neighbor uni-cast dispatch list.
2. according to claim 1 based on the cycle neighbor discovering method asymmetric low on duty by turns for cooperateing with prime number, its feature exists
In step B also includes：
Using the periodic sleep dispatching method based on time division mechanism, the time slot by mobile node in a cycle is divided into sleeps
Dormancy time slot and active slot, wherein, active slot is divided into anchor time slot, probe time slot and prime number time slot three types.
3. according to claim 1 based on the cycle neighbor discovering method asymmetric low on duty by turns for cooperateing with prime number, its feature exists
In, in step B when defining and select prime number time slot, the single prime number of selection.
4. according to claim 1 based on the cycle neighbor discovering method asymmetric low on duty by turns for cooperateing with prime number, its feature exists
In the neighbor uni-cast dispatch list is made up of the time slot of predefined regular length.
5. according to one of Claims 1-4 based on collaboration prime number cycle neighbor discovering method asymmetric low on duty by turns, its
It is characterised by, step C is specifically included：
Mobile node sends beacon message in the beginning and end of active slot, works as anchor according to the neighbor uni-cast dispatch list
When any two time slot of time slot, probe time slot and prime number time slot these three active slots is overlapped each other, you can receive message simultaneously
Its neighbour is recorded, neighbor uni-cast is completed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310060129.7A CN103209461B (en) | 2013-02-26 | 2013-02-26 | Cycle neighbor discovering method asymmetric low on duty by turns based on collaboration prime number |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310060129.7A CN103209461B (en) | 2013-02-26 | 2013-02-26 | Cycle neighbor discovering method asymmetric low on duty by turns based on collaboration prime number |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103209461A CN103209461A (en) | 2013-07-17 |
| CN103209461B true CN103209461B (en) | 2017-04-05 |
Family
ID=48756513
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310060129.7A Expired - Fee Related CN103209461B (en) | 2013-02-26 | 2013-02-26 | Cycle neighbor discovering method asymmetric low on duty by turns based on collaboration prime number |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103209461B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105519194B (en) * | 2013-09-26 | 2020-11-20 | 上海诺基亚贝尔股份有限公司 | Method for distributing neighbor discovery resources |
| CN103532860B (en) * | 2013-10-24 | 2016-08-24 | 无锡清华信息科学与技术国家实验室物联网技术中心 | The neighbor discovering method of universal flexible |
| CN104053227B (en) | 2013-12-02 | 2017-06-27 | 华为终端有限公司 | A kind of method and apparatus for anchor main equipment selection |
| CN105813051B (en) * | 2014-12-29 | 2019-01-08 | 中国民用航空总局第二研究所 | The method of prime number set configuration in Sensor Network neighbours discovery based on prime number set |
| CN105813163B (en) * | 2014-12-29 | 2019-01-08 | 中国民用航空总局第二研究所 | A kind of method of duty cycle number set configuration in Sensor Network neighbours discovery |
| CN107889184B (en) * | 2017-11-03 | 2020-02-18 | 四川大学 | Neighbor node discovery method and system |
| CN109768848B (en) * | 2019-04-01 | 2020-10-30 | 西安电子科技大学 | Rapid response communication mechanism in time slot-based neighbor node discovery protocol |
| CN110519745B (en) * | 2019-08-05 | 2021-04-20 | 西安电子科技大学 | Neighbor discovery method based on maximum common divisor of cycle length |
| CN110602684B (en) * | 2019-08-06 | 2022-05-17 | 南京邮电大学 | Neighbor discovery method based on asynchronous bidirectional detection |
| CN112601199B (en) * | 2020-11-13 | 2022-02-22 | 西安电子科技大学 | Intelligent contact sensing method, device and system based on low-power-consumption Bluetooth |
| CN114339945A (en) * | 2022-03-08 | 2022-04-12 | 北京理工大学 | Neighbor discovery method and device for unmanned aerial vehicle ad hoc network and unmanned aerial vehicle |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102761931A (en) * | 2012-06-29 | 2012-10-31 | 南京大学 | Method for carrying out dynamic data transmission in asynchronous duty ratio wireless sensor network |
| EP2552168A1 (en) * | 2011-07-27 | 2013-01-30 | Alcatel Lucent | Clustering and resource allocation in ad hoc networks |
-
2013
- 2013-02-26 CN CN201310060129.7A patent/CN103209461B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2552168A1 (en) * | 2011-07-27 | 2013-01-30 | Alcatel Lucent | Clustering and resource allocation in ad hoc networks |
| CN102761931A (en) * | 2012-06-29 | 2012-10-31 | 南京大学 | Method for carrying out dynamic data transmission in asynchronous duty ratio wireless sensor network |
Non-Patent Citations (1)
| Title |
|---|
| 《无线传感器网邻居发现算法研究》;费晓飞;《微计算机信息》;20091231;第25卷(第2-1期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103209461A (en) | 2013-07-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103209461B (en) | Cycle neighbor discovering method asymmetric low on duty by turns based on collaboration prime number | |
| Chen et al. | On heterogeneous neighbor discovery in wireless sensor networks | |
| Bakht et al. | Searchlight: Won't you be my neighbor? | |
| Gnanambigai et al. | Leach and its descendant protocols: A survey | |
| Langendoen | Medium access control in wireless sensor networks | |
| Chao et al. | Multiple-rendezvous multichannel MAC protocol design for underwater sensor networks | |
| Saxena et al. | Clustering based energy efficient algorithm using max-heap tree for MANET | |
| Kurtoglu et al. | Energy consumption in long-range linear wireless sensor networks using LoRaWan and ZigBee | |
| CN103634872A (en) | Energy-efficient asynchronous neighbor node finding method in mobile self-organizing network | |
| Bakht et al. | Searchlight: helping mobile devices find their neighbors | |
| CN103906187B (en) | Group member's phase selection method and system based on group neighbor discovery mechanisms | |
| Bakht et al. | SearchLight: asynchronous neighbor discovery using systematic probing | |
| CN108495351A (en) | A kind of data transmission method and system | |
| Ko et al. | Adaptive, asynchronous rendezvous protocol for opportunistic networks | |
| Kumar et al. | Performance study of beacon-enabled IEEE 802.15. 4 standard in WSNs with clustering | |
| Chang et al. | An energy conservation MAC protocol in wireless sensor networks | |
| Gao et al. | An anti-collision neighbor discovery protocol for multi-node discovery | |
| Yang et al. | An energy efficient cross-layer MAC for wireless sensor networks | |
| Vo et al. | Minimal sleep delay driven aggregation tree construction in iot sensor networks | |
| Shi et al. | A clustering algorithm of ad-hoc network based on honeycomb division | |
| Mantri et al. | Scheduled Collision Avoidance in wireless sensor network using Zigbee | |
| CN103619050A (en) | Neighbor node discovering method based on perfect difference set and used for mobile wireless network | |
| Xu et al. | Reducing the path length of a mobile BS in WSNs | |
| Elsts et al. | Competition: Adaptive time-slotted channel hopping | |
| Nanda et al. | Cost effective modleach-a* search algorithm for shortest path routing in wireless sensor networks |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170405 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |