CN102158929B - Method for realizing wireless sensing network multi-node route optimization and dynamic ad hoc network - Google Patents
Method for realizing wireless sensing network multi-node route optimization and dynamic ad hoc network Download PDFInfo
- Publication number
- CN102158929B CN102158929B CN201110070310.7A CN201110070310A CN102158929B CN 102158929 B CN102158929 B CN 102158929B CN 201110070310 A CN201110070310 A CN 201110070310A CN 102158929 B CN102158929 B CN 102158929B
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- cluster
- leader cluster
- state
- 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
Images
Landscapes
- Small-Scale Networks (AREA)
Abstract
The invention relates to a method for realizing wireless sensing network multi-node route optimization and dynamic ad hoc network, which comprises the following steps: after throwing about the nodes of a wireless ad hoc network, organizing the nodes into a cluster which is managed in grades according to a dynamic ad hoc network rule; using a communication radius of one cluster-head node as a basic cellular grain; defining the directly connected nodes in the middle and head of the cluster as the member nodes; and defining the node which is outside of the direct communication radius of the cluster-head node as a guest node and adding into the cluster through the member nodes, wherein the nodes have six different states: (1) waiting election state; (2) cluster election state; (3) abandoning election qualification waiting state; (4) cluster-head node, at the core position of the cluster; (5) member node, managed by the cluster-head node; and (6) guest node, connected to the member nodes and managed by the cluster-head. Compared with the prior art, the method provided by the invention has the advantages that the problem of network connection which cannot be solved by the using of a wired manner can be quickly and conveniently solved by the using of the communication radius of one cluster-head node as the basic cellular grain and guiding the guest node for flexibly adjusting the node distribution at position of breaking joint.
Description
Technical field
The invention belongs to wireless sense network and dynamic ad hoc network technical field, be specifically related to based on technology of Internet of things and build infrared array sensor network technology, realized wireless sensing network multi-node routing optimality and the dynamic ad hoc network of digitlization multinode route.
Background technology
In the building automation network that adopts wire transmission mode is built, not only long construction period, on the impact of surrounding enviroment comprehensive wiring system often, the riding position of the network equipment is subject to the restriction of position, network information site, and because cable network lacks flexibility, this just require the network planner of building automation system look to the future as much as possible development needs, this often needs the default lower information point of a large amount of utilances, if building automation system is re-started to transformation, for cable network, eliminate original old system and new system carried out to new layout and will bring huge engineering cost, this just requires a kind of technology can solve quickly and easily the network link problem that use wired mode is difficult for realization.
Summary of the invention
Technical problem to be solved by this invention is: a kind of wireless sensing network multi-node routing optimality and dynamic ad hoc network implementation method are provided, can solve quickly and easily and use wired mode to be difficult for the network link problem realizing.
In order to solve upper technical problem the present invention, adopt following technical scheme:
A kind of wireless sensing network multi-node routing optimality and dynamic ad hoc network implementation method, adopt technology of Internet of things, build infrared array wireless sense network, it is characterized in that: the node of wireless ad hoc network is after shedding, according to dynamic ad hoc network regular weaves become press hierarchical management bunch, with the communication radius of a leader cluster node as a basic honeycomb particulate, what in bunch, be directly connected with leader cluster node is member node, when outside the Direct Communication radius of node at leader cluster node, can become guest's node and add this bunch by member node, node can be divided into 6 kinds of different states altogether:
(1) wait for election contest state, this state is the initial state of node;
(2) election contest bunch head status, fashionable without bunch adding near node, can independently initiate at random composition bunch;
(3) abandon campaigning for qualification wait state, this state is an intermediateness, for becoming guest's node, prepares;
(4) leader cluster node, in the core position of bunch, the management things of responsible bunch;
(5) member node, belongs to the management of leader cluster node;
(6) guest's node, is connected on member node, belongs to bunch head tube reason, once can with other bunch Direct Communication, become the member node of another bunch.
Node is when waiting for election contest state, if a has leader cluster node near detecting in the communication radius of this node, the state of this node becomes member node, and the property value of oneself is identical with leader cluster node; If when b has member node without leader cluster node near detecting in the communication radius of this node, this node enters abandons campaigning for qualification wait state, if c near detecting during without leader cluster node and without member node in the communication radius of this node, in the region that further detection is S at area, shed at random the random number of N node and choose whether meet election contest requirement, satisfied enter into the election contest state waited for, do not meet and remain on previous status.
Node in leader cluster node will remain on previous status, while running into the situations such as suspension, node short-term inefficacy: if a. guest's node, member node detect and original bunch out of touch, get back to and wait for election contest state, re-execute networking sub-clustering; B. leader cluster node is found own compass of competency and other bunch compass of competency conflict.If there is the member node of other bunch near finding, or leader cluster node, get back to and wait for election contest state, re-execute networking sub-clustering.
Node, when election contest bunch head status, if the node that has election contest bunch head in neighbours' neighbours detected in the communication radius of this node, is got back to original wait election contest state, if in neighbours' neighbor node without election contest leader cluster node, election contest bunch head success.
When node is when abandoning campaigning for qualification wait state, if near have leader cluster node, join this bunch, become member node; If near nothing bunch head, and only have member node, become guest's node.
In the node of guest's node state, if there is leader cluster node near detecting, join this bunch, become member node.
Node in member node will remain on previous status.
The initial principle that random number is chosen: shed at random N node in the region that is S at area, communication radius is R, the nodes n of the appearance in certain node communication radius, should obey shellfish slave profit and distribute, and is designated as b (n, p), wherein p=π R
2/ S,
according to central-limit theorem, when trend towards+∞ of N, n obeys
normal distribution, so the number of communication radius interior nodes should be in a node
.
The present invention compared with prior art has following beneficial effect: with the communication radius of a leader cluster node as a basic honeycomb particulate, introduced guest's node, node as flexible breaking joint place distributes, can solve quickly and easily and use wired mode to be difficult for the network link problem realizing, improve the antijamming capability of radio communication, improve the accuracy rate of communication and the MANET mode of providing convenience, realize digitlization multinode route.
Accompanying drawing explanation
Fig. 1 wireless sensor network structural representation
Fig. 2～Fig. 9 sheds at random posterior nodal point networking process and different conditions switches key diagram
The networking diagram that Figure 10 is plotted by state diagram.
Embodiment
Referring to Fig. 1, Fig. 1 is wireless sensor network structural representation, and the present invention adopts technology of Internet of things, has built infrared array wireless sense network, has realized digitlization multinode route.The node of wireless ad hoc network is after shedding, according to certain dynamic ad hoc network regular weaves become to press hierarchical management bunch, it is sensor node, when dissociating to monitor area, node starts to converge, by wireless transfer channels such as the Internet and satellites, be sent to task management centre management node again, be finally sent to user side.
Referring to Fig. 2-Fig. 9, Fig. 2-Fig. 9 sheds posterior nodal point networking process and different conditions switching key diagram at random, Fig. 2 represents the sensor node of random distribution in certain region, Fig. 3 is that the each node after sensor network forms belongs to one bunch, in Fig. 3, a circle represents one bunch, and each bunch is only had a leader cluster node, with the communication radius of a leader cluster node as a basic honeycomb particulate, leader cluster node is in the core position of bunch, the management things of being responsible for bunch; In Fig. 3, node 3 and node 9 are leader cluster nodes, are in charge of this bunch of things, and what in bunch, be directly connected with leader cluster node is member node, and member node belongs to the management of leader cluster node; One bunch of leader cluster node and multiple member node composition, node the 1,2,4,5,7,8,11, the 12nd in Fig. 3, member node, when outside the Direct Communication radius of node at leader cluster node, can become guest's node and add this bunch by member node, guest's node is connected on member node, belong to bunch head tube reason, once can with other bunch Direct Communication, become the member node of another bunch.In Fig. 3, node 6 and node 10 are guest's nodes, referring to Fig. 4, in Fig. 4, node 1 and node 12 are bunch heads, node 3, 8, 9, the 11st, member node, node 2, 4, 5, 7, 10 is guest's node, node 6 does not have bunch can add, at this moment in waiting for election contest state, referring to Fig. 5, in Fig. 5, node 1 and node 12 are bunch heads, node 3, 8, 9, the 11st, member node, node 2, 4, 5, 7, 10 is guest's node, node 6 is recommended oneself as leader cluster node, at this moment it will inquire about node situation around, when around occur while waiting for the node of election contest state or guest's node, can make these two kinds of nodes become the member node of oneself, form one new bunch.Fig. 6 is that node 6 is campaigned for successfully, other guest's nodes of two bunches 4,7,10 has been become to the member node (in the Direct Communication radius of node 4,7,10 in node 6, can with node 6 Direct Communications) of oneself.Fig. 7 is that plural node is campaigned for a bunch head simultaneously, as node 3 and 6 enters election contest bunch head status simultaneously.Fig. 8 is that node 3 and 6 is all abandoned election contest bunch head, gets back to original election contest wait state, waits for new for ambient conditions detecting result.Fig. 9 is node 5 election contest bunch heads, detects and within the scope of election contest, has other bunch of member node 7, and node 7 is in the communication radius of node 5, and node 5 is read the member node that the attribute status of node 7 is other bunches, abandons campaigning for qualification.
The block diagram of Figure 10 MANET implementation method, node can be divided into following 6 kinds of different states, each node is given a unique sign and is referred to as node serial number, each node has state value, node can only be in one of following 6 kinds of states, and which bunch the property value of node represents to belong to, bunch sign utilize the numbering of leader cluster node to represent, if the numbering of node is identical with property value, this node is leader cluster node, not identically shows that this node is under the jurisdiction of certain bunch.
6 kinds of different conditions of node are:
(1) node is in waiting for election contest state, and this state is the initial state of node.If a has leader cluster node (numbering of node is identical with property value) near detecting in the communication radius of this node, now this node can be directly and leader cluster node communication, the state of this node becomes member node, and the property value of oneself is identical with leader cluster node.If when b has member node without leader cluster node near detecting in the communication radius of this node, this node is in abandoning campaigning for qualification wait state, and this state is an intermediateness, for becoming guest's node, prepares.If c near detecting during without leader cluster node and without member node in the communication radius of this node, in the region that further detection is S at area, shed at random the random number of N node and choose whether meet election contest requirement, satisfied enter into the election contest state waited for, do not meet and remain on previous status.The initial principle that random number is chosen: shed at random N node in the region that is S at area, communication radius is R, the nodes n of the appearance in certain node communication radius, should obey shellfish slave profit and distribute, and is designated as b (n, p), wherein p=π R
2/ S,
according to central-limit theorem, when trend towards+∞ of N, n obeys
normal distribution, so the number of a node communication radius interior nodes should be
(meeting the election contest that random number chooses requires).
(2) node is in election contest bunch head status, near node, nothing bunch can add fashionable, can independently initiate at random composition bunch: if the node that has election contest bunch head in neighbours' neighbours detected in the communication radius of this node, get back to original wait election contest state, if, without election contest leader cluster node, election contest bunch head is successful in neighbours' neighbor node.
(3) when node is when abandoning campaigning for qualification wait state, if near have leader cluster node, join this bunch, become member node; If near nothing bunch head, and only have member node, become guest's node.
(4) node in guest's node state, if having leader cluster node near detecting in the communication radius of this node, joins this bunch, becomes member node.
(5) node in member node will remain on previous status.
(6) node in leader cluster node will remain on previous status.
When running into the situations such as suspension, node short-term inefficacy: if a. guest's node, member node detect and original bunch out of touch, get back to and wait for election contest state, re-execute networking sub-clustering.B. leader cluster node is found own compass of competency and other bunch compass of competency conflict, if there is the member node of other bunch near finding, or leader cluster node, get back to and wait for election contest state, re-execute networking sub-clustering.
Claims (1)
1. a wireless sensing network multi-node routing optimality and dynamic ad hoc network implementation method, adopt technology of Internet of things, build infrared array wireless sense network, it is characterized in that: the node of wireless ad hoc network is after shedding, according to dynamic ad hoc network regular weaves become press hierarchical management bunch, with the communication radius of a leader cluster node as a basic honeycomb particulate, what in bunch, be directly connected with leader cluster node is member node, when outside the Direct Communication radius of node at leader cluster node, can become guest's node and add this bunch by member node, node can be divided into 6 kinds of different states altogether:
(1) wait for election contest state, this state is the initial state of node;
(2) election contest bunch head status, fashionable without bunch adding near node, can independently initiate at random composition bunch;
(3) abandon campaigning for qualification wait state, this state is an intermediateness, for becoming guest's node, prepares;
(4) leader cluster node, in the core position of bunch, the management things of responsible bunch;
(5) member node, belongs to the management of leader cluster node;
(6) guest's node, is connected on member node, belongs to bunch head tube reason, once can with other bunch Direct Communication, become the member node of another bunch;
Node in leader cluster node will remain on previous status, when running into suspension, node short-term and losing efficacy: if a. guest's node, member node detect and original bunch out of touch, get back to and wait for election contest state, re-execute networking sub-clustering; B. leader cluster node is found own compass of competency and other bunch compass of competency conflict, if there is the member node of other bunch near finding, or leader cluster node, get back to and wait for election contest state, re-execute networking sub-clustering.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110070310.7A CN102158929B (en) | 2011-03-23 | 2011-03-23 | Method for realizing wireless sensing network multi-node route optimization and dynamic ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110070310.7A CN102158929B (en) | 2011-03-23 | 2011-03-23 | Method for realizing wireless sensing network multi-node route optimization and dynamic ad hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102158929A CN102158929A (en) | 2011-08-17 |
| CN102158929B true CN102158929B (en) | 2014-05-07 |
Family
ID=44440026
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110070310.7A Expired - Fee Related CN102158929B (en) | 2011-03-23 | 2011-03-23 | Method for realizing wireless sensing network multi-node route optimization and dynamic ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102158929B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102802175A (en) * | 2012-02-24 | 2012-11-28 | 东北电力大学 | Energy-consumption-based routing optimization algorithm for wireless sensor network |
| CN106851596A (en) * | 2017-01-10 | 2017-06-13 | 扬州大学 | A kind of dynamic ad hoc network method of agricultural environment wireless sense network |
| CN113765795B (en) * | 2021-10-15 | 2023-07-04 | 北京小米移动软件有限公司 | Networking method, networking device, networking system and storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360033A (en) * | 2008-09-28 | 2009-02-04 | 熊猫电子集团有限公司 | Mobile self-organizing network cluster dividing method based on state mechanism |
-
2011
- 2011-03-23 CN CN201110070310.7A patent/CN102158929B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360033A (en) * | 2008-09-28 | 2009-02-04 | 熊猫电子集团有限公司 | Mobile self-organizing network cluster dividing method based on state mechanism |
Non-Patent Citations (1)
| Title |
|---|
| 陈冬松.移动Ad_hoc网络管理中基于节点定位的簇生成算法.《兵工学报》.2007,第1200-1204页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102158929A (en) | 2011-08-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100542138C (en) | L 3 architecture for radio sensor network | |
| CN101237366B (en) | Realization method of wireless sensor network for collaborative energy sensing | |
| CN101241177B (en) | Wireless sensor network positioning system facing to three dimensional space | |
| CN102158929B (en) | Method for realizing wireless sensing network multi-node route optimization and dynamic ad hoc network | |
| CN102883400B (en) | Method for forwarding data of hierarchal wireless sensor network based on semantic routing | |
| KR20080075806A (en) | Method for allocating a beacon slot using a beacon table in wireless personal area network(wpan) and wpan device | |
| AU2003234263A1 (en) | Hierarchical mobile ad-hoc network and methods for performing reactive routing therein using dynamic source routing (dsr) | |
| CN102083085A (en) | Wireless sensor network optimizing method | |
| CN104539542B (en) | A kind of low energy consumption based on mobile Sink Data Collections route tree shears method | |
| CN101237370A (en) | Network architecture method for code division and cluster division wireless sensor network with cluster relay node | |
| CN101252543B (en) | Rapid data anastomosing algorithm used for wireless sensor network | |
| CN101364938A (en) | Network constructing method for code division clustered wireless sensor network | |
| CN102420859A (en) | Data acquisition system based on wireless sensing network and virtual apparatus technology | |
| Zhang et al. | Neighbor discovery and rendezvous maintenance with extended quorum systems for mobile applications | |
| Zhou et al. | Long link wireless sensor routing optimization based on improved adaptive ant colony algorithm | |
| CN101867988A (en) | Centralized self-adaptation network manager node selection algorithm in Ad Hoc network | |
| Tchendji et al. | Virtual architecture and energy-efficient routing protocols for 3D wireless sensor networks | |
| CN102083167A (en) | Query-based routing method for multi-sink-node wireless sensor network | |
| Lin et al. | Hilbert-chain topology for energy conservation in large-scale wireless sensor networks | |
| Chen et al. | A QoS-based adaptive clustering algorithm for wireless sensor networks | |
| Chuang et al. | Hypercube-based data gathering in wireless sensor networks | |
| CN108427284A (en) | A kind of cascaded structure multi-agent system coordinative coherence control method | |
| CN103702445A (en) | Body and inference rule of task combination in WSN (wireless sensor network) semantic communication | |
| CN101127627A (en) | Detection method and device for wireless sensor network topology | |
| Navimipour | Control the Topology and Increase the Tolerance of Heterogeneous 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140507 Termination date: 20160323 |