CN109195225B - Node working time slot generation method suitable for neighbor discovery of wireless self-organizing network - Google Patents

Node working time slot generation method suitable for neighbor discovery of wireless self-organizing network Download PDF

Info

Publication number
CN109195225B
CN109195225B CN201811228373.9A CN201811228373A CN109195225B CN 109195225 B CN109195225 B CN 109195225B CN 201811228373 A CN201811228373 A CN 201811228373A CN 109195225 B CN109195225 B CN 109195225B
Authority
CN
China
Prior art keywords
node
time slot
working
neighbor discovery
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.)
Expired - Fee Related
Application number
CN201811228373.9A
Other languages
Chinese (zh)
Other versions
CN109195225A (en
Inventor
谭雪松
周子望
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology of China
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN201811228373.9A priority Critical patent/CN109195225B/en
Publication of CN109195225A publication Critical patent/CN109195225A/en
Application granted granted Critical
Publication of CN109195225B publication Critical patent/CN109195225B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention belongs to the technical field of communication, and particularly relates to a node working time slot generation method suitable for neighbor discovery of a wireless self-organizing network. The method for generating the working time slot of the wireless self-organizing network node with the minimized RWT as the target can minimize the working time length of each network node on the premise of ensuring that any two network nodes can work simultaneously within a preset longest time interval. The method for generating the working time slot of the wireless self-organizing network node aiming at minimizing the MTCW can minimize the longest time interval required by any two network nodes to realize the simultaneous working under the premise of ensuring that the working time length of each network node does not exceed a specified upper limit value. The two node working time slot generation methods effectively reduce the energy consumption required by the network node equipment in the neighbor discovery process from different angles and shorten the maximum time length required by the network node equipment for discovering the neighbor nodes.

Description

Node working time slot generation method suitable for neighbor discovery of wireless self-organizing network
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a node working time slot generation method suitable for neighbor discovery of a wireless self-organizing network.
Background
Unlike a traditional cellular wireless network, a wireless ad hoc network does not need fixed infrastructure support, and can provide mutual communication between terminals without using the existing network infrastructure (such as a base station and a wireless access point), so that the wireless ad hoc network is particularly suitable for application occasions such as battlefield communication, emergency rescue, internet of things, vehicle networking and the like. Because the wireless ad hoc network topology is usually dynamically changed, each network node needs to periodically or aperiodically execute the function of neighbor node discovery in the stages of networking, routing, communication and the like, and update the neighbor node list and the network topology in real time, so as to better provide reliable guarantee for the basic functions of subsequent routing discovery, data transmission and the like.
On the other hand, for mobile and outdoor communication devices that consume power only supported by batteries, how to achieve longer-term communication is a key issue. To reduce energy consumption, wireless ad hoc networks typically allow each network node to switch back and forth between an active and a dormant state. When a node is in a working state, the node can send data to a neighbor node or receive the data sent by the neighbor node to realize the neighbor discovery function, but certain battery energy is consumed; while a node is dormant, it may not be able to communicate and achieve the lowest battery power consumption, but it cannot discover the presence of a neighbor node.
Therefore, under the limited condition of limited node energy, a key problem faced by the wireless ad hoc network neighbor discovery is how to design an efficient working time slot generation method for each network node, and ensure that the node obtains the chance of neighbor discovery within a limited time length while shortening the working time of the node as much as possible.
Disclosure of Invention
The invention aims to provide a node working time slot generation method suitable for wireless self-organizing network neighbor discovery aiming at the problems.
The parameters for measuring the performance of the method for generating the working time slot of the network node mainly comprise the following steps:
maximum simultaneous working time interval (MTCW) is the longest time interval required by any two nodes in the wireless ad hoc network to realize two consecutive simultaneous working. Since any two neighboring nodes may only realize communication handshake and discover each other's existence when the same slot is in working state at the same time, the node working slot generation method with smaller MTCW generally has better performance.
A Ratio of operating time (RWT), that is, to ensure that a network node can obtain a chance of neighbor discovery within a finite time, the number of timeslots that it needs to be in an operating state within an MTCW time interval is a proportion of the total number of timeslots in the time interval. It is clear that the value range of RWT should be (0, 1.) under the precondition that any two nodes can always work simultaneously within the longest MTCW time interval, the method for generating the node working time slot with smaller RWT is more energy-saving.
Therefore, on the premise of meeting a certain MTCW upper limit value, the smaller the RWT is, the smaller the node working time slot generation method can better save the energy of the wireless self-organizing network node; on the premise of meeting a certain RWT upper limit value, the method for generating the MTCW-less node working time slot has shorter neighbor discovery time delay and better neighbor discovery performance.
The technical principle on which the invention is based is as follows:
definition 1, if set
Figure BDA0001836532020000021
A subset of k elements a ═ a0,a1,…,ak-1Satisfy the condition that for each non-zero integer
Figure BDA0001836532020000022
Each having at least one element pair (a)i,aj) Satisfies ai∈A，aje.A and d ═ ai-ajmodulo n, then set a is referred to as an (n, k) -relaxation cycle difference set or simply an (n, k) -difference set. Wherein the content of the first and second substances,
Figure BDA0001836532020000023
representing the set of all integers modulo n.
In particular, since all (n, k) -difference sets need to satisfy the condition n ≦ k2-k +1 or its equivalent
Figure BDA0001836532020000024
Therefore, when the parameter k is as close as possible to
Figure BDA0001836532020000025
The corresponding (n, k) -difference set is further generally referred to as the (n, k) -minimum difference set.
For any n ≧ 2, the (n, k) -difference set always exists, from definition 1 the following two inferences can be drawn:
inference 1. for a (n, k) -difference set
Figure BDA0001836532020000026
The execution distance is r epsilon [0, n-1]Is rotated to generate a set of k elements
Figure BDA0001836532020000027
Is also an (n, k) -And (4) difference set.
Inference 2. for a (n, k) -difference set A, there is always
Figure BDA0001836532020000031
This is true.
Based on the inference 1 and 2, a relaxation cycle difference set A has a so-called rotation closure characteristic, that is, the difference set A is arbitrarily spaced by r ∈ [0, n-1 ]]Always has a non-empty intersection between the difference set ROT (A, r) and the difference set A, i.e. there is a non-empty intersection between
Figure BDA0001836532020000032
The technical scheme of the invention is that for any given MTCW upper limit value, a node working time slot generation method capable of minimizing the ratio of the working time of each node to RWT is designed aiming at the neighbor discovery process of a wireless self-organizing network, and the method specifically comprises the following steps:
defining the longest time interval required by any two nodes in the wireless ad hoc network to realize two continuous simultaneous operations, namely the upper limit value of the maximum simultaneous operation time interval (MTCW) is N, the method for generating the node operation and dormancy time slot capable of minimizing the operation time length Ratio (RWT) for the wireless ad hoc network comprises the following steps:
s1, for any integer j being more than or equal to 2, making MjRepresents a collection of integers such that for any integer M e MjEach having at least one (M, j) -minimum difference set, and let Mj (m)Representation set MjMiddle largest integer, set M1 (m)＝1；
S2, setting a minimum integer k to satisfy the constraint condition that at least one (N, k) -difference set exists;
s3, generating set MkAnd Mk-1And calculate Mk (m)And Mk-1 (m)；
S4, if k/N is equal to k/Mk (m),(k-1)/Mk-1 (m)) Setting L ═ N and L ═ k, and proceeds to step S7; otherwise, set l ═ k-1, and proceed to step S5;
s5, generationSet Ml-1And calculate Ml-1 (m)；
S6, if k/N is equal to [ l/M ]l (m),(l-1)/Ml-1 (m)) In the set MlSearching for the maximum integer L less than N, and proceeding to step S7; otherwise, updating l-1 and returning to step S5;
s7, selecting the same (L, L) -difference set A for all nodes of the wireless self-organizing network, setting a neighbor discovery period with the length of L time slots for each node, numbering the L time slots as 0,1, … and L-1 respectively, and enabling each node to be in a working state in each time slot i belonging to the A in each neighbor discovery period and each time slot in the same neighbor discovery period
Figure BDA0001836532020000033
All are in a dormant state.
The invention also provides another technical scheme, and for any given RWT upper limit value, aiming at a wireless ad hoc network neighbor discovery process, a node working time slot generation method capable of minimizing the longest time interval MTCW required by two continuous simultaneous working of any two nodes is designed, which specifically comprises the following steps:
defining an upper limit value of a working time length Ratio (RWT) in a wireless ad hoc network as R, and generating a node working and sleeping time slot configuration method capable of minimizing the longest time interval required by any two nodes to realize two continuous simultaneous working, namely the maximum simultaneous working time interval (MTCW), in the wireless ad hoc network, wherein the maximum MTCW comprises the following steps:
s1, for any integer j being more than or equal to 2, making MjRepresents a collection of integers such that for any integer M e MjThere is at least one (M, j) -minimum difference set, let Mj (m)Representation set MjThe largest integer in, and let Mj(n) represents the set MjThe middle nth small integer, wherein n is more than or equal to 1;
s2, initializing i to 3, and generating set MiAnd Mi-1And calculate Mi (m)And Mi-1 (m)；
S3, if R is E[i/Mi (m),(i-1)/Mi-1 (m)) Proceeding to step S5; otherwise, update i ═ i +1, and proceed to step S4;
s4, generating set MiCalculate Mi (m)And returns to step S3;
s5, searching an integer n epsilon [1, | Mi|-1]So that R is the [ i/M ]i(n+1),i/Mi(n)) true;
s6, selecting the same (M) for all nodes of the wireless self-organizing networki(n +1), i) -difference set A, setting length M for each nodei(n +1) time slots, and (M) a neighbor discovery periodiThe (n +1) time slots are respectively numbered as 0,1, …, Mi(n +1) -1, and each node is in working state in each time slot i ∈ A of each neighbor discovery period, and each time slot of the same neighbor discovery period
Figure BDA0001836532020000041
All are in a dormant state.
In the above scheme, S7 in the minimized RWT method and S6 in the minimized MTCW method each generate its active and dormant timeslots in each N-slot period for each network node based on one (N, k) -difference set a, where N ═ L and k ═ L in S7 and N ═ M in S6i(n +1) and k ═ i. When the node X starts to execute neighbor discovery before the neighbor node Y in any t (more than or equal to 0) time slots, the node Y is in a working state in the time slots of which each number of each N time slot period belongs to the set A, and the node X is in a working state in the time slots of which each number of each N time slot period belongs to the set ROT (A (N-t module N)). The rotation closure characteristic of the (N, k) -difference set A is known because
Figure BDA0001836532020000042
It is always true that, therefore, no matter how much the difference t between the start times of the neighbor discovery performed by the nodes X and Y is, at least 1 slot exists in each N-slot period (i.e., maximum simultaneous working time interval (MTCW)) of the node Y to satisfy the requirement that the nodes X and Y are simultaneously in working state, so that the two nodes can be served therebyProviding opportunities for communication handshakes and discovery of each other's presence.
The method for generating the working time slot of the wireless self-organizing network node with the minimized RWT as the target has the beneficial effect that the working time slot of each network node is minimized under the precondition that any two network nodes can certainly realize the simultaneous working in a preset longest time interval. The method for generating the working time slot of the wireless self-organizing network node aiming at minimizing the MTCW can minimize the longest time interval required by any two network nodes to realize the simultaneous working under the premise of ensuring that the working time length of each network node does not exceed a specified upper limit value. The two node working time slot generation methods effectively reduce the energy consumption required by the network node equipment in the neighbor discovery process from different angles and shorten the maximum time length required by the network node equipment for discovering the neighbor nodes. Furthermore, thanks to the rotating closed nature of the relaxation cycle difference set (i.e. inference 2), any two neighboring nodes can get an opportunity for communication handshaking and discovery of each other within each longest simultaneous working time interval MTCW, at any clock difference.
Drawings
Fig. 1 is a diagram of RWT, which is a ratio of operating time of nodes obtained by a method for generating operating timeslots of nodes based on grid quorum and based on a minimum difference set, respectively, aiming at minimizing RWT, under a given MTCW upper limit value;
fig. 2 is a diagram of maximum simultaneous working time intervals MTCW obtained by a method for generating working timeslots of nodes based on grid quorum and targeting to minimize MTCW according to the present invention under a given RWT upper limit value;
fig. 3 is a diagram of maximum simultaneous operation time intervals MTCW obtained by a node-operating slot generation method aiming at minimizing MTCWs and based on a minimum difference set according to the present invention, respectively, for a given upper limit value of RWTs.
Detailed Description
The invention is described below with reference to the accompanying drawings and examples.
Example 1
When the given MTCW upper limit value N is 4, the method for generating the node working timeslot aiming at minimizing the RWT in the present embodiment generates the working and sleeping timeslots of each network node according to the following steps:
the first step is as follows: for any integer j ≧ 2, let MjRepresents a collection of integers such that for any integer M e MjEach having at least one (M, j) -minimum difference set, and let Mj (m)Representation set MjThe largest integer in (1). Setting M1 (m)＝1。
The second step is that: when N is 4, the smallest integer k that satisfies the condition that there is one (N, k) -difference set restriction should be 3.
The third step: generating a set M2{3} and M34,5,6,7, and calculate M2 (m)3 and M3 (m)＝7。
The fourth step: due to the fact that
Figure BDA0001836532020000051
So set l-k-1-2 and jump to the fifth step.
The fifth step: according to the first step, Ml-1 (m)＝M1 (m)＝1。
And a sixth step: since k/N is 3/4 e 2/3,1), in the set Ml＝M2Searching for the maximum integer L less than N-4. This gave L ═ 3.
The seventh step: since L-3 and L-2, one (3,2) -difference set {0,1} ∈ Z is selected for all nodes of the wireless ad hoc network3Generating an operating time slot of each network node, setting the length of a neighbor discovery cycle of each node to be 3 time slots, numbering the 3 time slots of each neighbor discovery cycle to be 0,1 and 2 respectively, and setting each node to be in an operating state at the time slots 0 and 1 of each neighbor discovery cycle and to be in a dormant state at the time slot 2 of the cycle.
As can be seen from the above steps, when the given MTCW upper limit value is N-4, each network node is 2/3 in duty cycle. Similarly, we can obtain node operation time length ratios 3/7,4/13,5/21,6/31,8/49,8/57,9/73 and 10/91 respectively, which can be obtained by the node operation time slot generation method aiming at minimizing RWT of the present invention when the given MTCW upper limit value N is 9,16,25,36,49,64,81 and 100.
For comparison with the node working time slot generation method aiming at minimizing RWT provided by the present invention, a grid Quorum-Based node working time slot generation method (s.khatibi, m.dehghan, and m.a.poormina, "quality-Based Pure Directional Neighbor Discovery in Self-Organized Ad Hoc Networks," International Symposium on Telecommunications Networks (IST),2010) and a minimum difference set-Based node working time slot generation method (j.r.jiang, y.c.tseng, c.s.s.and t.h.lai, "query-Based physics Power-Saving Protocols for IEEE 802.11Ad Networks," Mobile Networks, application No. 2-181,2005) are considered. Wherein, the grid quorum based generation method is only applicable to the case that the given MTCW upper limit value N is an integer square. In particular, when the given MTCW upper limit value N is 4,9,16,25,36,49,64,81, and 100, node operating time slot generation methods based on grid quorum may obtain node operating time slot ratios of 3/4,5/9,7/16,9/25,11/36,13/49,15/64,17/81, and 19/100, respectively. On the other hand, the minimum difference set based generation method directly employs (N, k) -minimum difference sets for a given MTCW upper limit value N to generate active and dormant timeslots for each network node. It may be applied to any given MTCW upper limit N (≧ 3).
As shown in fig. 1, the node operating time duration ratios obtained by the node-operating time slot generation method based on the minimum difference set and aimed at minimizing RWT according to the present invention are respectively obtained when the given MTCW upper limit N is 3,4, …,81, and the node operating time duration ratios obtained by the node-operating time slot generation method based on the grid quorum when the given MTCW upper limit N is 4,9,16,25,36,49,64, 81. It can be seen that for the same given MTCW upper limit value, the proposed method always achieves lower RWT values than the grid quorum based generation method, but also always achieves lower RWT values than or the same as the minimum difference set based generation method, thus illustrating that the proposed method is more energy efficient than the grid quorum based and minimum difference set based generation methods for the same longest time interval of neighbor discovery.
Example 2
When the upper limit value R of RWT is given as 5/9, the method for generating working timeslots of nodes aiming at minimizing MTCW as proposed in this example proceeds as follows:
the first step is as follows: for any integer j ≧ 2, let MjRepresents a collection of integers such that for any integer M e MjThere is at least one (M, j) -minimum difference set, let Mj (m)Representation set MjThe largest integer in, and let Mj(n) represents the set MjThe nth smallest integer, wherein n is more than or equal to 1.
The second step is that: initializing i to 3, generating set M2{3} and M34,5,6,7, and calculate M2 (m)3 and M3 (m)＝7。
The third step: because RWT upper limit value R is 5/9E [ i/M ∈i (m),(i-1)/Mi-1 (m)) 3/7, 2/3), so a jump to the fourth step is necessary
The fourth step: in the set M3Searching for an integer n of 2 in {4,5,6,7} so that R ∈ [ i/M ∈i(n+1),i/Mi(n)), [3/6,3/5) is true.
The fifth step: selecting the same (6,3) -difference set {0,1,3} E Z for all nodes of the wireless self-organizing network6Generating an operating time slot of each network node, setting a neighbor discovery cycle with the length of 6 time slots for each node, numbering the 6 time slots as 0,1, …,5 respectively, and enabling each node to be in an operating state in the time slots 0,1 and 3 of each neighbor discovery cycle and be in a dormant state in the time slots 2, 4 and 5 of the same neighbor discovery cycle.
Based on the above steps, it can be seen that when the given RWT upper limit value is R5/9, the maximum simultaneous operating time interval obtained by the section generation method aimed at minimizing MTCW is 6 slots. Similarly, when the upper limit value of the RWT is given as R-3/4, the maximum simultaneous operation time interval obtained by the method is 3 time slots.
For comparison with the method for generating the node working timeslot aiming at minimizing the MTCW proposed by the present invention, grid quorum-based and minimum difference set-based methods for generating the node working timeslot are considered. When the given RWT upper limit value is R-5/9, the maximum simultaneous operating time interval that can be obtained by the grid quorum-based generation method is 9 slots. And when the given RWT upper limit value is R-3/4, the maximum simultaneous operation time interval that can be obtained by the generation method based on the minimum difference set is 4 slots.
As shown in fig. 2, when the upper limit value of a given RWT is R3/4, 5/9,7/16,9/25,11/36,13/49,15/64, and 17/81, the maximum simultaneous operation time interval, which is respectively obtained by the node operation slot generation method based on grid quorum and targeted to minimize MTCW, is proposed in the present invention. It can be seen that for the same given upper value of RWT, the proposed method of the present invention always achieves lower MTCW values than the grid quorum based method, thus illustrating the opportunity for the former to achieve neighbor discovery in a shorter time interval than the latter under the same energy saving requirements.
As shown in fig. 3, when the upper limit value of a given RWT is R e [9/73,0.75], the maximum simultaneous operation time interval respectively obtained by the node operation slot generation method based on the minimum difference set and targeting to minimize the MTCW is proposed in the present invention. It can be seen that for the same given upper value of RWT, the proposed method of the present invention always achieves the same or lower MTCW value than the minimum difference set based generation method, thus illustrating the opportunity for the former to achieve neighbor discovery in the same or shorter time interval than the latter under the same energy saving requirements.

Claims (2)

1. A node working time slot generation method suitable for neighbor discovery of a wireless self-organizing network defines the longest time interval required by any two nodes in the wireless self-organizing network to realize two continuous simultaneous working, namely the upper limit value of the maximum simultaneous working time interval (MTCW) is N, and the method for generating the node working and sleeping time slots capable of minimizing the working time length Ratio (RWT) for the wireless self-organizing network comprises the following steps:
s1, for any integer j being more than or equal to 2, making MjRepresents a collection of integers such that for any integer M e MjEach having at least one (M, j) -minimum difference set, and let Mj (m)Representation set MjMiddle largest integer, set M1 (m)＝1；
S2, setting a minimum integer k to satisfy the constraint condition that at least one (N, k) -difference set exists;
s3, generating a set M according to the definitions of the steps S1 and S2kAnd Mk-1And calculate Mk (m)And Mk-1 (m)；
S4, if k/N is equal to k/Mk (m),(k-1)/Mk-1 (m)) Setting L ═ N and L ═ k, and proceeds to step S7; otherwise, set l ═ k-1, and proceed to step S5;
s5, generating set Ml-1And calculate Ml-1 (m)；
S6, if k/N is equal to [ l/M ]l (m),(l-1)/Ml-1 (m)) In the set MlSearching for the maximum integer L less than N, and proceeding to step S7; otherwise, updating l-1 and returning to step S5;
s7, selecting the same (L, L) -difference set A for all nodes of the wireless self-organizing network, setting a neighbor discovery period with the length of L time slots for each node, numbering the L time slots as 0,1, … and L-1 respectively, and enabling each node to be in a working state in each time slot i belonging to the A in each neighbor discovery period and each time slot in the same neighbor discovery period
Figure FDA0002965324730000011
All are in a dormant state.
2. A node working time slot generation method suitable for neighbor discovery of a wireless self-organizing network defines that an upper limit value of a working time length Ratio (RWT) in the wireless self-organizing network is R, and then a node working and dormancy time slot configuration method which can minimize the longest time interval required by any two nodes to realize continuous two-time simultaneous working, namely the maximum simultaneous working time interval (MTCW), is generated in the wireless self-organizing network comprises the following steps:
s1, for any integer j being more than or equal to 2, making MjRepresents a collection of integers such that for any integer M e MjThere is at least one (M, j) -minimum difference set, let Mj (m)Representation set MjThe largest integer in, and let Mj(n) represents the set MjThe middle nth small integer, wherein n is more than or equal to 1;
s2, initializing i to 3, and generating set M according to the definition of step S1iAnd Mi-1And calculate Mi (m)And Mi-1 (m)；
S3, if R is equal to [ i/M ]i (m),(i-1)/Mi-1 (m)) Proceeding to step S5; otherwise, update i ═ i +1, and proceed to step S4;
s4, generating set MiCalculate Mi (m)And returns to step S3;
s5, searching an integer n epsilon [1, | Mi|-1]So that R is the [ i/M ]i(n+1),i/Mi(n)) true;
s6, selecting the same (M) for all nodes of the wireless self-organizing networki(n +1), i) -difference set A, setting length M for each nodei(n +1) time slots, and (M) a neighbor discovery periodiThe (n +1) time slots are respectively numbered as 0,1, …, Mi(n +1) -1, and each node is in working state in each time slot i ∈ A of each neighbor discovery period, and each time slot of the same neighbor discovery period
Figure FDA0002965324730000021
All are in a dormant state.
CN201811228373.9A 2018-10-22 2018-10-22 Node working time slot generation method suitable for neighbor discovery of wireless self-organizing network Expired - Fee Related CN109195225B (en)

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 CN109195225A (en) 2019-01-11
CN109195225B true CN109195225B (en) 2021-06-08

Family

ID=64946114

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811228373.9A Expired - Fee Related 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)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110519745B (en) * 2019-08-05 2021-04-20 西安电子科技大学 Neighbor discovery method based on maximum common divisor of cycle length

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9037750B2 (en) * 2007-07-10 2015-05-19 Qualcomm Incorporated Methods and apparatus for data exchange in peer to peer communications
US9679336B2 (en) * 2011-10-19 2017-06-13 Facebook, Inc. Social ad hoc networking protocol and presentation layer
US9955421B2 (en) * 2014-07-09 2018-04-24 Qualcomm Incorporated Traffic advertisement and scheduling in a neighbor aware network data link
CN105813163B (en) * 2014-12-29 2019-01-08 中国民用航空总局第二研究所 A kind of method of duty cycle number set configuration in Sensor Network neighbours discovery
CN107395251B (en) * 2017-07-17 2019-07-02 电子科技大学 Frequency hopping sequence generating method suitable for more transceiver cognition wireless networks
CN107889184B (en) * 2017-11-03 2020-02-18 四川大学 Neighbor node discovery method and system
CN108521648B (en) * 2018-02-09 2020-03-27 北京航空航天大学 Directional antenna self-adaptive neighbor discovery method based on historical information

Also Published As

Publication number Publication date
CN109195225A (en) 2019-01-11

Similar Documents

Publication Publication Date Title
Wightman et al. A3: A topology construction algorithm for wireless sensor networks
Wei et al. Cluster-based routing protocols in wireless sensor networks: A survey
Li LEACH-HPR: An energy efficient routing algorithm for Heterogeneous WSN
Singh et al. An energy efficient approach for clustering in WSN using fuzzy logic
Abidi et al. Fuzzy cluster head election algorithm based on LEACH protocol for wireless sensor networks
Rauthan et al. An improved approach in clustering algorithm for load balancing in wireless sensor networks
CN109195225B (en) Node working time slot generation method suitable for neighbor discovery of wireless self-organizing network
CN105722180B (en) Low duty ratio Sensor Network neighbor discovering method based on Length discrepancy revival time slot
Imani et al. Adaptive S-grid: a new adaptive quorum-based power saving protocol for multi-hop ad hoc networks
Li An energy efficient routing algorithm for heterogeneous wireless sensor networks
Hatamian et al. A centralized evolutionary clustering protocol for wireless sensor networks
Li et al. Sender-jump receiver-wait: A blind rendezvous algorithm for distributed cognitive radio networks
Saidu et al. An enhanced leach routing algorithm for energy conservation in a wireless sensor network
Kumar et al. Intelligent Cluster Routing: An Energy Efficient Approach for Routing in Wireless Sensor Networks
CN112689275B (en) Novel non-uniform power forming method for BLE mesh network
Guo et al. Intra-superframe power management for IEEE 802.15. 3 WPAN
Yan et al. An Energy-Aware Multilevel Clustering algorithm for wireless sensor networks
CN103619050B (en) For the neighbor node discover method based on perfect difference set of mobile wireless network
Taha et al. Genetic algorithms for lifetime elongation of clustered WSN
Rathee et al. Developed distributed energy-efficient clustering (DDEEC) algorithm based on fuzzy logic approach for optimizing energy management in heterogeneous WSNs
Li et al. A range-based sleep scheduling algorithm for desired area coverage in solar-powered wireless sensor networks
Nanda et al. Cost effective modleach-a* search algorithm for shortest path routing in wireless sensor networks
Hung et al. A PROPOSAL FOR IMPROVE THE LIFE-TIME OF WIRELESS SENSOR NETWORK
Huang et al. Creating small-world model for homogeneous wireless sensor networks
Du et al. Cross‐Layer Optimized Energy‐Balanced Topology Control Algorithm for WSNs

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20210608