CN108024305A - A kind of system of selection of centralized control node for self-organizing network - Google Patents
A kind of system of selection of centralized control node for self-organizing network Download PDFInfo
- Publication number
- CN108024305A CN108024305A CN201610851379.6A CN201610851379A CN108024305A CN 108024305 A CN108024305 A CN 108024305A CN 201610851379 A CN201610851379 A CN 201610851379A CN 108024305 A CN108024305 A CN 108024305A
- Authority
- CN
- China
- Prior art keywords
- node
- connected degree
- centralized control
- maximum
- selection
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/08—Access restriction or access information delivery, e.g. discovery data delivery
- H04W48/10—Access restriction or access information delivery, e.g. discovery data delivery using broadcasted information
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention proposes a kind of system of selection of centralized control node for self-organizing network, and this method includes：The whole network sets the cycle of unified centralized control node selection and initial time offset, each node periodically to select a centralized control node according to following steps：Step a, in the Connected degree and the broadcast that calculate this node, the Connected degree is a metric for weighing the importance of node in a network；Step b, according to the Connected degree information of the Connected degree of this node and received other nodes, selects node and the broadcast of a Connected degree maximum；Step c, after current period terminates, using the node of the newest Connected degree maximum of self maintained as centralized control node.One optimal centralized control node can adaptively be selected using the present invention so that central controlled efficiency reaches highest.
Description
Technical field
The present invention relates to the selection of wireless communication field, more particularly to a kind of centralized control node for self-organizing network
Method.
Background technology
Wireless multi-hop network provides self-organizing, the peer-to-peer communications of self-coordinating between a kind of node, and each node has forwarding
Function, it is possible to achieve the multi-hop transmission between node, has the characteristics that flattening and transmission range are bigger.Generally army,
, at this time must be by non-cellular net if there is the situation of cellular network failure in airport, public security, the military and the police's application scene
The means of communication of network communicates, and ensures multiple participant effective cooperations of execution task.Self-organizing network passes through phase between node
Mutually coordinate, relay forwarding, realize that node interconnects.
Usual self-organizing network is all distributed network, and each node is equality in network, but in some special applications
Scene, for example the military is in confrontation, it may be necessary to conversion frequency point is constantly removed, to prevent adverse party from intercepting and capturing our message or to this
Square message is disturbed, and prevents we from communicating.For distributed network, each node can only take network
Either link communication quality situation can not take interference, service distribution or the link of the overall situation and lead to for local interference, service distribution
Believe quality condition, that is to say, that neither one centralized control node notifies between all nodes while does identical operation, if
The operation done between node is different, and may result in can not communicate between node.Therefore, it is necessary in existing self-organizing, self-coordinating
On the basis of increase a centralized control node selection function, various operations are so can be carried out in centralized control node,
Such as centralized scheduling, interference coordination, frequency point selection etc..The present invention mainly provides the selection for how carrying out centralized control node
Method.
The content of the invention
In order to solve the problems, such as that background technology proposes, the present invention proposes a kind of for self-organizing network centralized control node
System of selection, this method include：
The whole network sets the cycle of unified centralized control node selection and initial time offset, each node periodically to press
A centralized control node is selected according to following steps：
Step a, calculates the Connected degree of this node, then broadcasts the identity and Connected degree of this node, the Connected degree
It is a metric for weighing the importance of node in a network；
Step b, according to the Connected degree information of the Connected degree of this node and received other nodes, selects a Connected degree most
Big node, then broadcasts identity and the Connected degree of the node selected；
Step c, after current period terminates, using the node of the newest Connected degree maximum of self maintained as centralized Control
Node.
Preferably, the Connected degree is calculated according to the following formula：D=alpha*x+beta/y, wherein, x is represented this section
Bar number of the point as the route of relaying, y represent the average number of hops of all routes by this node, and alpha and beta are weights
The factor.
Preferably, specific messages field, the Connected degree for broadcast node are increased in broadcast message.
Preferably, in step b, described node broadcasts the time slot moment of PBCH in its transmission, selects Connected degree maximum
Node is simultaneously broadcasted：If not receiving the information of the Connected degree of other nodes, the node using this node as Connected degree maximum,
Otherwise the node of Connected degree maximum is selected from the node of all known Connected degrees, if the Connected degree of multiple nodes is maximum
It is worth and equal, node of the node of identity minimum as Connected degree maximum can be selected.
One optimal centralized control node can adaptively be selected using the present invention so that central controlled efficiency
Reach highest, and then more functions can be increased according to the demand of different scenes in centralized control node.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is attached drawing needed in technology description to be briefly described, it should be apparent that, drawings in the following description are this hairs
Some bright embodiments, for those of ordinary skill in the art, without creative efforts, can be with root
Other attached drawings are obtained according to these attached drawings.
Fig. 1 is the schematic diagram of the network topology structure of the embodiment of the present invention；
Fig. 2 is the step flow chart of the selection of the centralized control node of the embodiment of the present invention.
Embodiment
To make the purpose, technical scheme and advantage of the embodiment of the present invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, the technical solution in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is
Part of the embodiment of the present invention, instead of all the embodiments；It should be noted that in the case where there is no conflict, in the application
Embodiment and embodiment in feature can be mutually combined.Based on the embodiments of the present invention, those of ordinary skill in the art
All other embodiments obtained without creative efforts, belong to the scope of protection of the invention.
The present embodiment illustrates the selecting party of the centralized control node of the self-organizing network of the present invention by taking 4 meshed networks as an example
Method.For network topology structure as shown in Figure 1, in 4 nodes, node 1 and remaining node are all a hop nodes, node 2 and remaining one
Hop node is also all a hop node, and node 3 and node 4 are a hop node all with node 1,2, but node 3 and 4 is between each other
Two hop nodes.The selection course of centralized control node is as shown in Fig. 2, concretely comprise the following steps：
1, after the selecting switch of centralized control node is opened, each node carries out the calculating of node connectivity, and into
Row broadcast, obtained Connected degree is respectively D1, D2, D3, D4 after node 1~4 calculates, and D1=D2>D3=D4；
2, so when node NodeId3, NodeId4 receive broadcast and then the broadcast Connected degree of NodeId1, then
Broadcast the Connected degree of NodeId1；
After 3, NodeId2 receive the broadcast of NodeId1, because Connected degree is equal, but NodeId1<NodeId2, institute
Using select NodeId it is small be used as centralized control node.
After the step of being selected by above centralized control node, whole self-organizing network will select node NodeId1 as collection
Middle control node.
One of ordinary skill in the art will appreciate that：Realizing all or part of step of above method embodiment can pass through
The relevant hardware of programmed instruction is completed, and foregoing program can be stored in a computer read/write memory medium, the program
Upon execution, the step of execution includes above method embodiment；And foregoing storage medium includes：ROM, RAM, magnetic disc or light
Disk etc. is various can be with the medium of store program codes.
Finally it should be noted that：The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although
The present invention is described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that：It still may be used
To modify to the technical solution described in foregoing embodiments, or equivalent substitution is carried out to which part technical characteristic；
And these modification or replace, do not make appropriate technical solution essence depart from various embodiments of the present invention technical solution spirit and
Scope.
Claims (5)
- A kind of 1. system of selection of centralized control node for self-organizing network, it is characterised in that the described method includes：The whole network sets cycle and the initial time offset of unified centralized control node selection, each node periodically according to Lower step selects a centralized control node：Step a, calculates the Connected degree of this node, then broadcasts the identity and Connected degree of this node, and the Connected degree is one A metric for weighing the importance of node in a network；Step b, according to the Connected degree information of the Connected degree of this node and received other nodes, selects a Connected degree maximum Node, then broadcasts identity and the Connected degree of the node selected；Step c, after current period terminates, using the node of the newest Connected degree maximum of self maintained as centralized Control section Point.
- 2. according to the method described in claim 1, it is characterized in that, calculate the Connected degree according to the following formula：D=alpha*x+beta/y, wherein, x represents the bar number using this node as the route of relaying, and y represents all and passes through this The average number of hops of the route of node, alpha and beta are weight factors.
- 3. method according to claim 1 or 2, it is characterised in that：Increase specific messages field, the Connected degree for broadcast node in broadcast message.
- 4. according to the method described in claim 3, it is characterized in that：In step b, described node is in the time slot moment of its transmission broadcast PBCH, the node of selection Connected degree maximum and broadcast： If not receiving the information of the Connected degree of other nodes, the node using this node as Connected degree maximum, otherwise from all The node of Connected degree maximum is selected in the node of known Connected degree.
- 5. according to the method described in claim 4, it is characterized in that：If the Connected degree of multiple nodes is maximum and equal, then the node of identity minimum is selected as Connected degree Maximum node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610851379.6A CN108024305A (en) | 2016-09-26 | 2016-09-26 | A kind of system of selection of centralized control node for self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610851379.6A CN108024305A (en) | 2016-09-26 | 2016-09-26 | A kind of system of selection of centralized control node for self-organizing network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108024305A true CN108024305A (en) | 2018-05-11 |
Family
ID=62069473
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610851379.6A Pending CN108024305A (en) | 2016-09-26 | 2016-09-26 | A kind of system of selection of centralized control node for self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108024305A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070299950A1 (en) * | 2006-06-21 | 2007-12-27 | General Electric Company | System for creating optimally-sized clusters |
| CN101207572A (en) * | 2007-12-14 | 2008-06-25 | 北京科技大学 | Method for clustering vehicle mounted Ad hoc network based on signal strength |
| CN103945484A (en) * | 2014-03-11 | 2014-07-23 | 北京农业信息技术研究中心 | Farmland wireless self-organizing network topology density correlation path selecting and optimizing method |
-
2016
- 2016-09-26 CN CN201610851379.6A patent/CN108024305A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070299950A1 (en) * | 2006-06-21 | 2007-12-27 | General Electric Company | System for creating optimally-sized clusters |
| CN101207572A (en) * | 2007-12-14 | 2008-06-25 | 北京科技大学 | Method for clustering vehicle mounted Ad hoc network based on signal strength |
| CN103945484A (en) * | 2014-03-11 | 2014-07-23 | 北京农业信息技术研究中心 | Farmland wireless self-organizing network topology density correlation path selecting and optimizing method |
Non-Patent Citations (3)
| Title |
|---|
| 杨卫东: "Ad Hoc网络中分簇算法的研究", 《计算机工程与应用》 * |
| 毕海霞，魏志强，薛广然，贯林林: "基于WiFi的自组织网络路由协议算法研究", 《火控雷达技术》 * |
| 郭鹏远: "移动自组网DSR协议改进研究", 《信息科技辑》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Long et al. | Energy-aware real-time routing for large-scale industrial internet of things | |
| US7693119B2 (en) | Transmission power control over a wireless ad-hoc network | |
| US8307070B2 (en) | Resource allocation method in wireless network | |
| US11290295B2 (en) | Multi-network operation with member node for multicast groups | |
| US20190165964A1 (en) | Limiting forwarding of multicast communications | |
| CN103957570B (en) | A kind of network communicating system and its method for routing for electric power load control | |
| CN101237370B (en) | Network architecture method for code division and cluster division wireless sensor network with cluster relay node | |
| EP3573372B1 (en) | A role selection method for wireless communication systems | |
| CN101198167B (en) | Hybrid network system combining cell network and self-organizing network, and constructing method thereof | |
| CN110234146A (en) | Distributed self-adaption cluster-dividing method suitable for self-organizing network | |
| CN103108371A (en) | Single antenna multichannel cognitive wireless sensor network route control method | |
| CN110167100A (en) | The selection method of relay node in a kind of Internet of Things | |
| US10205665B2 (en) | Mesh network nodes configured to alleviate congestion in cellular network | |
| Li et al. | Joint optimization of BBU pool allocation and selection for C-RAN networks | |
| CN102386991B (en) | Timeslot interchange operating method for time division multiple address access system in wireless mobile self-organized network | |
| CN111757414B (en) | SDMANET network networking method based on multimode radio station | |
| Zhang et al. | Interference-aware robust topology design in multi-channel wireless mesh networks | |
| CN104837166B (en) | The method for building up of virtual backbone network in a kind of heterogeneous ad hoc network | |
| CN108024305A (en) | A kind of system of selection of centralized control node for self-organizing network | |
| Pal et al. | E-Darwin2: A smartphone based disaster recovery network using WiFi tethering | |
| CN106034280A (en) | Node-identity-feature-based clustering method in Ad-Hoc network | |
| CN107979871A (en) | For the communication system of wireless self-organization network, device, method and storage medium | |
| CN113965913A (en) | On-line monitoring data transmission method and system | |
| Srivastava et al. | Clustering based Load Balanced Gateway Placement Approach | |
| EP3231233B1 (en) | Transmission method in a "clustered" network |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180511 |
|
| WD01 | Invention patent application deemed withdrawn after publication |