CN106303979A - A kind of broadcast transmission method in self-organizing network - Google Patents
A kind of broadcast transmission method in self-organizing network Download PDFInfo
- Publication number
- CN106303979A CN106303979A CN201510358384.9A CN201510358384A CN106303979A CN 106303979 A CN106303979 A CN 106303979A CN 201510358384 A CN201510358384 A CN 201510358384A CN 106303979 A CN106303979 A CN 106303979A
- Authority
- CN
- China
- Prior art keywords
- broadcast transmission
- node
- sequence
- broadcast
- cycle
- 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
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- 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)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention proposes a kind of broadcast transmission method in self-organizing network, and the method is: the sleep cycle arranging battery saving mode node is P broadcast transmission chance, and arranging network node sum N is the multiple of P, and the numbering of N number of network node is designated as 0,1 successively ..., N-1；Every N number of broadcast transmission chance constitutes a broadcast transmission cycle, and broadcast transmission cycle numbering is designated as 0,1,2 successively ..., the i-th broadcast transmission chance in the jth broadcast transmission cycle is by numbered mod (i+Sequencemod(j,N), N) node take, wherein, j=0,1,2 ..., i=0,1 ..., N-1, Sequence are the sequence of a length of N, SequencekFor the sequential element of Sequence, k=0,1 ..., N-1, sequential element by 0,1 ..., N-1 random rearrangement is constituted.The present invention uses the broadcast transmission mode of variable period, and battery saving mode node takies broadcast resource with general mode node according to identical logic, it can be ensured that saves electrical nodes and normally sends this node broadcasts and listen to neighbor node broadcast.
Description
Technical field
The present invention relates to wireless communication field, particularly relate to a kind of broadcast transmission method in self-organizing network.
Background technology
Synchronizing in self-organizing network system, each node periodically sends the broadcast message of this node, by this node
Last state notifies neighbor node, and each node monitors the broadcast message of all neighbor nodes, updates this locality
The neighbor node state safeguarded.Under normal circumstances, from the point of view of the stability and Conflict solving of network,
Different nodes take broadcast resource district in turn, and broadcast by the fixing cycle.Use this traditional method
Time, if node uses battery saving mode, periodically wake up listening broadcast resource-area, due to each node
Broadcast transmission chance is also the fixed cycle, and this strategy can cause node only to trace into the wide of part of nodes
Broadcast, or node cannot obtain broadcast transmission chance all the time within the time wakeeed up.It is desirable to propose one
New broadcast transmission method, each node can pass through coordination network to use the broadcast transmission mode of variable period
In the broadcast transmission chance of all nodes so that battery saving mode node and general mode node all can be the quickest
Transmitting-receiving broadcast message.
Summary of the invention
The present invention proposes a kind of broadcast transmission method in self-organizing network, and the method is:
The sleep cycle arranging battery saving mode node is P broadcast transmission chance, arranges network node sum N
For the multiple of P, the numbering of N number of network node is designated as 0,1 successively ..., N-1；
Every N number of broadcast transmission chance constitutes a broadcast transmission cycle, and broadcast transmission cycle numbering is designated as successively
0,1,2 ..., the i-th broadcast transmission chance in the jth broadcast transmission cycle is by numbered
mod(i+Sequencemod(j,N), N) node take, wherein, j=0,1,2 ..., i=0,1 ..., N-1, Sequence are
The sequence of a length of N, SequencekFor the sequential element of Sequence, k=0,1 ..., N-1, sequential element by
0,1 ..., N-1 random rearrangement is constituted.
Preferably, Sequencek=k.
Preferably, P=4, N=8.
The present invention also proposes a kind of broadcast transmission method being grouped node in self-organizing network, the party
Method is:
The sleep cycle arranging battery saving mode node is P broadcast transmission chance, is divided into by all-network node
N group, N is the multiple of P, and often group shares a broadcast transmission chance, and the numbering of N number of network node group depends on
Secondary it is designated as 0,1 ..., N-1；
Every N number of broadcast transmission chance constitutes a broadcast transmission cycle, and broadcast transmission cycle numbering is designated as successively
0,1,2 ..., the i-th broadcast transmission chance in the jth broadcast transmission cycle is by numbered
mod(i+Sequencemod(j,N), N) node group take, wherein, j=0,1,2 ..., i=0,1 ..., N-1, Sequence
For the sequence of a length of N, SequencekFor the sequential element of Sequence, k=0,1 ..., N-1, sequential element
By 0,1 ..., N-1 random rearrangement is constituted.
Preferably, the node in each network node group uses time division way to share a broadcast transmission chance.
Preferably, the node in each network node group uses frequency division manner to share a broadcast transmission chance.
Preferably, Sequencek=k.
Preferably, P=4, the sum of network node is 32, and every 4 nodes constitute a network node group,
N=8.
Node in the self-organization network of the present invention uses the broadcast transmission mode of variable period, battery saving mode node and
General mode node takies broadcast resource according to identical logic, it can be ensured that saves electrical nodes and normally sends this section
Point is broadcasted and listens to neighbor node broadcast.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to enforcement
In example or description of the prior art, the required accompanying drawing used is briefly described, it should be apparent that, retouch below
Accompanying drawing in stating is some embodiments of the present invention, for those of ordinary skill in the art, is not paying
On the premise of creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the broadcast transmission sequential schematic of each broadcast transmission cycle interior nodes of embodiment 1；
Fig. 2 is the broadcast transmission sequential schematic of each broadcast transmission cycle interior nodes group of embodiment 2.
Detailed description of the invention
For making the purpose of the embodiment of the present invention, technical scheme and advantage clearer, below in conjunction with the present invention
Accompanying drawing in embodiment, is clearly and completely described the technical scheme in the embodiment of the present invention, it is clear that
Described embodiment is a part of embodiment of the present invention rather than whole embodiments；It should be noted that
In the case of not conflicting, the embodiment in the application and the feature in embodiment can be mutually combined.Based on
Embodiment in the present invention, those of ordinary skill in the art are obtained under not making creative work premise
Every other embodiment, broadly fall into the scope of protection of the invention.
Embodiment 1
In the present invention, either battery saving mode node or general mode node all use the broadcast of variable period to send out
Sending mode, the sleep cycle arranging battery saving mode node is P broadcast transmission chance, and arranges network
Node total number N is that the multiple of P (if actual node number is not the multiple of P, then can be planned some virtual
The multiple that node makes node total number be P), the numbering of N number of network node is designated as 0,1 successively ..., N-1.
Every N number of broadcast transmission chance constitutes a broadcast transmission cycle, and broadcast transmission cycle numbering is designated as successively
0,1,2 ..., within a cycle, all nodes take broadcast transmission chance, jth broadcast transmission cycle in turn
The broadcast transmission order of interior network node is: i-th broadcast transmission chance is by numbered
mod(i+Sequencemod(j,N), N) node take, wherein, j=0,1,2 ..., i=0,1 ..., N-1, Sequence are
The sequence of a length of N, SequencekFor the sequential element of Sequence, k=0,1 ..., N-1, sequential element by
0,1 ..., N-1 random rearrangement is constituted, say, that each sequential element is 0, and 1 ..., a numerical value in N-1, greatly
Little order can be random, if different.
Present embodiment assumes that total N=8 node, the most every 8 broadcast transmission chance structures in self-organizing network
Becoming a broadcast transmission cycle, the sleep cycle of battery saving mode node is P=4 broadcast transmission chance, the most often
4 send opportunity are waken up once, can send and listening broadcast information, the sequent in Sequence sequence
Element Sequencek=k.The broadcast transmission order of the most each broadcast transmission cycle interior nodes is as it is shown in figure 1, concrete
For:
In 1, the 0th broadcast transmission cycle, i-th broadcast transmission chance is taken by node mod (i+0, N),
I=0,1 ..., 7；
In 2, the 1st broadcast transmission cycle, i-th broadcast transmission chance is taken by node mod (i+1, N)；
In 3, the 2nd broadcast transmission cycle, i-th broadcast transmission chance is taken by node mod (i+2, N)；
4, by that analogy, in the jth broadcast transmission cycle, i-th broadcast transmission chance is by node
Mod (i+mod (j, N), N) takies.
From figure 1 it appears that general mode node can send the broadcast of this node in a broadcast cycle,
And listen to the broadcast of all neighbor nodes.Battery saving mode node every 4 send opportunity (TO, transmit
Opportunity) wake up once, then, within a broadcast transmission cycle, this node can be at 2 transmitters
It is transmitted in Hui or monitors, just can complete the most complete broadcast receiving and transmitting through 4 broadcast cycle.With
As a example by battery saving mode node Node2, it is assumed that it is waken up at the 1st send opportunity and the 5th send opportunity,
Then Node2 can listen to Node0 and Node4 in broadcast cycle 0, can listen in broadcast cycle 1
Node1 and Node5, can send own broadcast in broadcast cycle 2 and listen to Node6, in broadcast week
Node3 and Node7 can be listened in phase 3.Exactly because it can be seen that SequencekSequence in sequence
Element is different, so the identical send opportunity that Node2 is within the different broadcast transmission cycles listens to
Node is the most misaligned, and after 4 broadcast cycle, Node2 can collect the wide of all neighbor nodes
A broadcast transmission chance of Node2 is necessarily contained in broadcasting information, and these 4 broadcast cycle.
Embodiment 2
When the nodes in network is more, can be grouped node, each node group shares one extensively
Broadcast send opportunity.Present embodiment assumes that and have 32 nodes in self-organizing network, every 4 nodes constitute one
Individual network node group, has 8 node groups, and the node in each network node group uses time division way to share
One broadcast transmission chance.
The present embodiment uses mode same as in Example 1, and the sleep cycle arranging battery saving mode node is
P=4 broadcast transmission chance, every 8 broadcast transmission chances constitute a broadcast transmission cycle, broadcast transmission
Cycle numbering is designated as 0,1,2 successively ..., within a cycle, all node groups take broadcast transmission chance in turn,
Different node groups use order same as in Example 1 to carry out broadcast transmission.Each broadcast transmission cycle internal segment
Put the broadcast transmission order of group as shown in fig. 2, it can be seen that with embodiment 1 the most in like manner, general mode node
The broadcast of this node can be sent in a broadcast cycle, and listen to the broadcast of all neighbor nodes；Power saving
Every 4 send opportunity of mode node are waken up once, send and listening broadcast information, after four broadcast cycle
Complete the most complete broadcast receiving and transmitting.
One of ordinary skill in the art will appreciate that: all or part of step realizing said method embodiment can
Completing with the hardware relevant by programmed instruction, aforesaid program can be stored in an embodied on computer readable and deposit
In storage media, this program upon execution, performs to include the step of said method embodiment；And aforesaid storage
Medium includes: the various media that can store program code such as ROM, RAM, magnetic disc or CD.
Last it is noted that above example is only in order to illustrate technical scheme, rather than it is limited
System；Although the present invention being described in detail with reference to previous embodiment, those of ordinary skill in the art
It is understood that the technical scheme described in foregoing embodiments still can be modified by it, or to it
Middle part technical characteristic carries out equivalent；And these amendments or replacement, do not make appropriate technical solution
Essence departs from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (8)
1. the broadcast transmission method in self-organizing network, the method is:
The sleep cycle arranging battery saving mode node is P broadcast transmission chance, arranges network node sum N
For the multiple of P, the numbering of N number of network node is designated as 0,1 successively ..., N-1；
Every N number of broadcast transmission chance constitutes a broadcast transmission cycle, and broadcast transmission cycle numbering is designated as successively
0,1,2 ..., the i-th broadcast transmission chance in the jth broadcast transmission cycle is by numbered
mod(i+Sequencemod(j,N), N) node take, wherein, j=0,1,2 ..., i=0,1 ..., N-1, Sequence are
The sequence of a length of N, SequencekFor the sequential element of Sequence, k=0,1 ..., N-1, sequential element by
0,1 ..., N-1 random rearrangement is constituted.
Method the most according to claim 1, it is characterised in that:
Sequencek=k.
Method the most according to claim 1 and 2, it is characterised in that:
P=4, N=8.
4. the broadcast transmission method in self-organizing network, the method is:
The sleep cycle arranging battery saving mode node is P broadcast transmission chance, is divided into by all-network node
N group, N is the multiple of P, and often group shares a broadcast transmission chance, and the numbering of N number of network node group depends on
Secondary it is designated as 0,1 ..., N-1；
Every N number of broadcast transmission chance constitutes a broadcast transmission cycle, and broadcast transmission cycle numbering is designated as successively
0,1,2 ..., the i-th broadcast transmission chance in the jth broadcast transmission cycle is by numbered
mod(i+Sequencemod(j,N), N) node group take, wherein, j=0,1,2 ..., i=0,1 ..., N-1, Sequence
For the sequence of a length of N, SequencekFor the sequential element of Sequence, k=0,1 ..., N-1, sequential element
By 0,1 ..., N-1 random rearrangement is constituted.
Method the most according to claim 4, it is characterised in that:
Node in each network node group uses time division way to share a broadcast transmission chance.
Method the most according to claim 4, it is characterised in that:
Node in each network node group uses frequency division manner to share a broadcast transmission chance.
7. according to the method described in claim 4～6, it is characterised in that:
Sequencek=k.
8. according to the method described in claim 4～6, it is characterised in that:
P=4, the sum of network node is 32, and every 4 nodes constitute a network node group, N=8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510358384.9A CN106303979B (en) | 2015-06-25 | 2015-06-25 | A kind of broadcast transmission method in self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510358384.9A CN106303979B (en) | 2015-06-25 | 2015-06-25 | A kind of broadcast transmission method in self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106303979A true CN106303979A (en) | 2017-01-04 |
| CN106303979B CN106303979B (en) | 2019-06-21 |
Family
ID=57650193
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510358384.9A Expired - Fee Related CN106303979B (en) | 2015-06-25 | 2015-06-25 | A kind of broadcast transmission method in self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106303979B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060256737A1 (en) * | 2005-05-12 | 2006-11-16 | Samsung Electronics Co., Ltd. | Method and system for allocating multiple channels in a mesh network |
| CN101043407A (en) * | 2007-04-05 | 2007-09-26 | 华为技术有限公司 | Method and system for enquiring data of sensor network and sensor node |
| US20080150704A1 (en) * | 2006-09-07 | 2008-06-26 | Technology, Patents & Licensing, Inc. | Data Presentation from Multiple Sources Using a Wireless Home Entertainment Hub |
| CN101568124A (en) * | 2009-05-15 | 2009-10-28 | 重庆大学 | Channel allocation method in wireless mesh network |
| CN101808289A (en) * | 2010-04-07 | 2010-08-18 | 上海交通大学 | Method for acquiring data of wireless sensor network based on mobile sink node |
| CN101848461A (en) * | 2010-05-04 | 2010-09-29 | 中国人民解放军信息工程大学 | Method for secure routing and channel allocation in cognitive Mesh network |
| CN102497620A (en) * | 2011-12-01 | 2012-06-13 | 华为技术有限公司 | Method and system of information transmission in wireless sensor network |
-
2015
- 2015-06-25 CN CN201510358384.9A patent/CN106303979B/en not_active Expired - Fee Related
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060256737A1 (en) * | 2005-05-12 | 2006-11-16 | Samsung Electronics Co., Ltd. | Method and system for allocating multiple channels in a mesh network |
| US20080150704A1 (en) * | 2006-09-07 | 2008-06-26 | Technology, Patents & Licensing, Inc. | Data Presentation from Multiple Sources Using a Wireless Home Entertainment Hub |
| CN101043407A (en) * | 2007-04-05 | 2007-09-26 | 华为技术有限公司 | Method and system for enquiring data of sensor network and sensor node |
| CN101568124A (en) * | 2009-05-15 | 2009-10-28 | 重庆大学 | Channel allocation method in wireless mesh network |
| CN101808289A (en) * | 2010-04-07 | 2010-08-18 | 上海交通大学 | Method for acquiring data of wireless sensor network based on mobile sink node |
| CN101848461A (en) * | 2010-05-04 | 2010-09-29 | 中国人民解放军信息工程大学 | Method for secure routing and channel allocation in cognitive Mesh network |
| CN102497620A (en) * | 2011-12-01 | 2012-06-13 | 华为技术有限公司 | Method and system of information transmission in wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106303979B (en) | 2019-06-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101399757B (en) | Method and device for tracing time clock source | |
| CN106357305B (en) | A kind of automatic network-building method, the apparatus and system of tree structure network | |
| US6751248B1 (en) | Method for nodes in a multi-hop wireless network to acquire and maintain synchronization with a master node | |
| CN102158983B (en) | Method for constructing 6LoWPAN wireless sensor network | |
| CN103415045B (en) | A kind of method for designing of efficient wireless information interaction procotol | |
| CN102572015B (en) | Implementation method for dynamic IPv6 address configuration of mobile ad hoc network | |
| CN104244400B (en) | Non-cutting time benchmark Bootload based on precise synchronization self-organizing network | |
| CN103475524A (en) | Layered networking method based on master-slave node communication network | |
| CN104160678A (en) | Selection of synchronization stations in a peer-to-peer network environment | |
| CN102395126B (en) | Mobile Ad hoc network address configuration realization method based on tree structure | |
| CN102946631A (en) | Medium access control (MAC) layer node scheduling method based on beacon frame synchronization and communication asynchronization | |
| CN109121096B (en) | Method and apparatus for determining broadcast nodes in a mesh network | |
| CN103957570A (en) | Network communication system used for power load control and routing algorithm thereof | |
| CN103595461B (en) | A kind of resource allocation methods of ultra-large VSAT system frame structure | |
| CN105187548A (en) | Cluster monitoring information collection method and system | |
| CN103957589B (en) | A kind of distributed clock synchronous method of multi-hop low overhead | |
| RU2014129010A (en) | METHOD FOR DATA TRANSFER IN A COMMUNICATION NETWORK | |
| CN102594916B (en) | Networking method for deeper depth self-organizing wireless sensing network | |
| CN109360397A (en) | The system that method, data dispatching method and the multilist collection that multilist collection is copied are copied | |
| CN103259566B (en) | Method, central coordinator, station and system for power line communication network networking | |
| CN106330641B (en) | A kind of super low-power consumption CAN network means of communication | |
| CN103096441B (en) | Low power consumption communication method of low-bitrate wireless sensor network suitable for data collection | |
| Dhongdi et al. | Joint clustering and routing protocol for 3-D underwater acoustic sensor network | |
| CN103249048B (en) | A kind of neighbor networks disturbance coordination method and device | |
| CN106303979A (en) | A kind of broadcast transmission method in self-organizing network |
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 | ||
| PP01 | Preservation of patent right |
Effective date of registration: 20191121 Granted publication date: 20190621 |
|
| PP01 | Preservation of patent right | ||
| PD01 | Discharge of preservation of patent |
Date of cancellation: 20200710 Granted publication date: 20190621 |
|
| PD01 | Discharge of preservation of patent | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190621 Termination date: 20200625 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |