CN107172681A - A kind of mobile node dispatching method of nearest neighbor algorithm using optimization - Google Patents
A kind of mobile node dispatching method of nearest neighbor algorithm using optimization Download PDFInfo
- Publication number
- CN107172681A CN107172681A CN201710340082.8A CN201710340082A CN107172681A CN 107172681 A CN107172681 A CN 107172681A CN 201710340082 A CN201710340082 A CN 201710340082A CN 107172681 A CN107172681 A CN 107172681A
- Authority
- CN
- China
- Prior art keywords
- mobile node
- node
- cluster
- mobile
- cluster head
- 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/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0203—Power saving arrangements in the radio access network or backbone network of wireless communication networks
- H04W52/0206—Power saving arrangements in the radio access network or backbone network of wireless communication networks in access points, e.g. base stations
-
- 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)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of mobile node dispatching method of the nearest neighbor algorithm using optimization, its step includes：Sensor node in network system is divided into this two classes node of member in cluster head and cluster；Using the Clustering Routing based on mobile node, cluster head position is moved to using mobile node, the data message of leader cluster node collection is collected, and eventually through mobile node by these data information transfers to base station；Using the nearest neighbor algorithm of optimization, the mobile route of mobile node is obtained, mobile node is moved by this path, finally realizes the rational management of mobile node.Cluster head in the present invention is not required to and base station communication, it need to only be communicated with mobile node, positions of mobile nodes is located at cluster head position again, so the clustering route protocol based on mobile node is compared with traditional clustering route protocol, cluster head energy consumption greatly reduces, correspondingly, the life cycle of network system is also greatly improved, while the method achieve the rational management of mobile node.
Description
Technical field
The present invention relates to a kind of mobile node dispatching method of the nearest neighbor algorithm using optimization, belong to wireless sensor network
Network technical field.
Background technology
In wireless sensor network, the energy sustainable supply of sensor node is restricted, thus how Energy Efficient
Property utilization node energy so that the life cycle of maximization network system turn into important research topic.For maximum
Change the life cycle of network system, one of them method is the Clustering Routing using level.According to cluster algorithm, network system
Sensor node in system is divided into this two classes node of member in cluster head and cluster.The division of cluster be based between sensor node away from
From, thus the energy consumption of cluster head is much larger than the energy consumption of member in cluster.Using the mobility of node, network system is greatly improved
Life cycle.Clustering Routing based on mobile node, can greatly reduce the energy expenditure of each round leader cluster node, because communicate away from
From the energy expenditure exponent function relation with node, and the maximum power consumption of sensor node is the power consumption of communication module.Work as movable joint
Point is moved to cluster head position, and the communication distance of itself and cluster head is 0, can so greatly reduce the energy expenditure of leader cluster node.Utilize
Mobile node extends the life cycle of network system, will necessarily be related to the scheduling problem of mobile node, that is, how reasonable
Selection mobile node mobile route.
The content of the invention
The purpose of the present invention is to overcome the deficiencies in the prior art, it is proposed that a kind of nearest neighbor algorithm using optimization
Mobile node dispatching method, the rational management of mobile node is realized, so as to finally extend the life cycle of network system.
The technical scheme provided according to the present invention, a kind of mobile node dispatching party of nearest neighbor algorithm using optimization
Method comprises the following steps：
A kind of mobile node dispatching method of nearest neighbor algorithm using optimization, comprises the following steps：
Step 1：The sensor node carried out to the sensor node in network system in the division of cluster, network system is divided
For this two classes node of member in cluster head and cluster；
Step 2：Using the Clustering Routing based on mobile node, cluster head position is moved to using mobile node, is collected
Leader cluster node collection data message, and eventually through mobile node by these data information transfers to base station；
Step 3：Using the nearest neighbor algorithm of optimization, the mobile route of mobile node is obtained, mobile node is moved by this path
It is dynamic, finally realize the rational management of mobile node.
Further, the step 1, using Clustering Routing, the sensor node in wireless sensor network is divided into
This two classes node of member in cluster head and cluster, the cluster head collects the field data gathered with member in cluster in cluster, and to these
The information of collection carries out corresponding data fusion.
Further, the step 2, mobile node is moved to cluster head position and collects corresponding data message, each round cluster head
Node location is also mobile node dwell point position, thus mobile node mobile route must include dwell point position, original position
And end position；The original position of the mobile node is identical with end position, is all located at base station location.
Further, the step 3, using the nearest neighbor algorithm of optimization, is tried to achieve comprising all cluster head position and movement nodes
The Hamilton loops of the MINIMUM WEIGHT of initial position, finally give the mobile route of mobile node, and mobile node is moved by this path
It is dynamic, the scheduling of mobile node is realized, the most short mobile route of this scheduling by natwork system is exported.
Further, in step 1, in the establishment stage of cluster, the election process of each round cluster head is：Each sensor node is first
A random number is produced, the scope of random number is [0,1]；Then it is compared, is determined with these random numbers with the threshold value T of setting
Which node turns into cluster head；The random number that node turns into the condition of cluster head to produce is less than threshold value T (m), other accordingly to pass
Sensor node turns into member in cluster.
Further, in step 2, mobile node need to pass through and only by a cluster head position from original position, when
Its corresponding data message is collected during by cluster head position, initial position, that is, base station location is eventually returned to.
Further, step 3 is specifically included：
Step 3-1：Choose network system base station location s0As starting point, one and s are looked for0Association and minimum one of weights
Side e1, e1Also it is connected with another summit, this summit is designated as s1, a road s can be obtained0s1；
Step 3-2：It is assumed that having selected road s0s1Lsi, from remaining summitChoose one
With siNearest node, it is s to make iti+1, road s can be obtained0s1Lsisi+1；
Step 3-3：If i+1 ＜ n-1, i ← i+1 return to step 3-2 is made；Otherwise, C=s is remembered0s1Lsisi+1Lsns0, its
Just it is a Hamilton loop, produces the approximate solution of problem；
If C=s0s1Lsisi+1Lsns0It is the Hamilton loop that figure G is tried to achieve using nearest neighbor algorithm；To in the C of loop
1 ＜ i+1 ＜ j ＜ s of all satisfactions i, j, a new Hamilton loops C can be obtained according to step 3-4k：
Step 3-4：I ≠ j is checked whether there is on the C of loop so that sisj∈ E (G), si+1sj+1∈ E (G) and w (sisj)+w
(si+1sj+1) ＜ w (sisi+1)+w(sjsj+1), then constitute new Hamilton loops Ck=s1s2Lsisjsj-1Lsi+1sj+1Lsns1；
Step 3-5：Use CkInstead of C, and step 3-4 is gone to, untill not meeting the loop of condition in step 3-4,
The C finally given is the mobile route of the mobile node of this scheduling, realizes the rational management of mobile node.
Beneficial effects of the present invention are as follows：
In a kind of mobile node dispatching method of nearest neighbor algorithm using optimization of the present invention, cluster head is not required to logical with base station
Letter, it only needs to communicate with mobile node, and positions of mobile nodes is located at cluster head position again, so the sub-clustering road based on mobile node
By agreement compared with traditional clustering route protocol, cluster head energy consumption greatly reduces, correspondingly, and the life cycle of network system also obtains
Very big raising, while the method achieve the rational management of mobile node.
Brief description of the drawings
Fig. 1 is the flow chart of the present invention.
Fig. 2 is according to the scheduling result figure after of the present invention handled in embodiment.
Embodiment
The invention will be further described with reference to the accompanying drawings and examples.
As shown in figure 1, a kind of mobile node dispatching method of nearest neighbor algorithm using optimization of the present invention, it includes following
Step：
Step 0, input network system；
Step 1, using Clustering Routing, by the sensor node in wireless sensor network be divided into cluster head and cluster into
This two classes node of member, the cluster head collects the field data gathered with member in cluster in cluster, and the information of these collections is entered
The corresponding data fusion of row；
Step 2, mobile node are moved to cluster head position and collect corresponding data message, and each round leader cluster node position is also
Mobile node dwell point position, thus mobile node mobile route must include dwell point position, original position and end position；Institute
The original position for stating mobile node is identical with end position, is all located at base station location；
Step 3, the nearest neighbor algorithm using optimization, are tried to achieve comprising all cluster head position and movement node initial positions most
Little Quan Hamilton loops, finally give the mobile route of mobile node, and mobile node is moved by this path, realizes movement
The scheduling of node, exports the most short mobile route of this scheduling by natwork system.
A specific embodiment of the invention is illustrated below in conjunction with Fig. 2.
(1) division of cluster is carried out to the sensor node in network system first.In the establishment stage of cluster, each round cluster head
Election process it is as follows：Each sensor node produces a random number first, and the scope of random number is [0,1]；Then with setting
Threshold value T be compared with these random numbers, determine which node turn into cluster head.Node turn into cluster head condition for produce with
Machine number is less than threshold value T (m), and corresponding others sensor node turns into member in cluster.
(2) Clustering Routing based on mobile node.According to step (1), all sensor nodes are divided into cluster
This two classes node of member in head and cluster, as shown in Fig. 2 s in figure0For the initial position and end position of mobile node, s1~s10
For leader cluster node position.Mobile node need to pass through and only by once this 10 cluster head positions, when logical from original position
Its corresponding data message need to be collected when crossing cluster head position, initial position, that is, base station location is finally returned to.It is obvious that
The route of mobile node is a typical traveling salesman problem (TSP), can only approximate solution.
(3) rational management of mobile node is realized using the nearest neighbor algorithm of optimization, its algorithmic procedure is as follows：
3.1st, network system base station location s is chosen0As starting point, one and s are looked for0Association and the minimum a line e of weights1,
Obvious e1Also it is connected with another summit, this summit is designated as s1, a road s can be obtained0s1；
3.2nd, assume to have selected road s0s1Lsi, from remaining summitChoose one and si
Nearest node, it is s to make iti+1, road s can be obtained0s1Lsisi+1；
If the 3.3, i+1 ＜ n-1, make i ← i+1 return to step 3.2；Otherwise, C=s is remembered0s1Lsisi+1Lsns0, it is just
One Hamilton loop, produces the approximate solution of problem.
If C=s0s1Lsisi+1Lsns0It is the Hamilton loop that figure G is tried to achieve using nearest neighbor algorithm.To in the C of loop
1 ＜ i+1 ＜ j ＜ s of all satisfactions i, j, can obtain a new Hamilton loops C as followsk：
3.4th, i ≠ j is checked whether there is on the C of loop so that sisj∈ E (G), si+1sj+1∈ E (G) and w (sisj)+w(si+ 1sj+1) ＜ w (sisi+1)+w(sjsj+1), then constitute new Hamilton loops Ck=s1s2Lsisjsj-1Lsi+1sj+1Lsns1；
3.5th, C is usedkInstead of C, and step 3.4 is gone to, untill not meeting the loop of condition in step 3.4.Finally
Obtained C is the mobile route of the mobile node of this scheduling, realizes arrow in the rational management of mobile node, Fig. 2 and refers to
Understand the moving direction of mobile node.
The present invention carries out the division of cluster to network system first, thus sensor node in network system is divided into cluster head
With this two classes node of member in cluster, the energy consumption of leader cluster node is much larger than the energy consumption of member node in cluster；Then movable joint is utilized
Point is moved to cluster head position, collects the data message of leader cluster node collection, and eventually through mobile node by these data messages
Pass to base station；Finally using the nearest neighbor algorithm of optimization, the mobile route of mobile node is obtained, mobile node is moved by this path
It is dynamic, finally realize the rational management of mobile node.The present invention realizes the rational management to mobile node, greatly reduces cluster
The energy expenditure of head node, finally extends the life cycle of network system.
Above is presently preferred embodiments of the present invention, not makees any formal limitation, every foundation to the present invention
The technical spirit of the present invention belongs to inventive technique to any simple modification made for any of the above embodiments, equivalent variations and modification
In the range of scheme.
Claims (7)
1. a kind of mobile node dispatching method of nearest neighbor algorithm using optimization, comprises the following steps：
Step 1：The sensor node carried out to the sensor node in network system in the division of cluster, network system is divided into cluster
This two classes node of member in head and cluster；
Step 2：Using the Clustering Routing based on mobile node, cluster head position is moved to using mobile node, cluster head is collected
Node collection data message, and eventually through mobile node by these data information transfers to base station；
Step 3：Using the nearest neighbor algorithm of optimization, the mobile route of mobile node is obtained, mobile node is moved by this path, most
The rational management of mobile node is realized eventually.
2. a kind of mobile node dispatching method of nearest neighbor algorithm using optimization according to claim 1, its feature exists
In：The step 1, using Clustering Routing, by the sensor node in wireless sensor network be divided into cluster head and cluster into
This two classes node of member, the cluster head collects the field data gathered with member in cluster in cluster, and the information of these collections is entered
The corresponding data fusion of row.
3. a kind of mobile node dispatching method of nearest neighbor algorithm using optimization according to claim 1, its feature exists
In：The step 2, mobile node is moved to cluster head position and collects corresponding data message, and each round leader cluster node position is also
Mobile node dwell point position, thus mobile node mobile route must include dwell point position, original position and end position；Institute
The original position for stating mobile node is identical with end position, is all located at base station location.
4. a kind of mobile node dispatching method of nearest neighbor algorithm using optimization according to claim 1, its feature exists
In：The step 3, using the nearest neighbor algorithm of optimization, is tried to achieve comprising all cluster head position and movement node initial positions most
Little Quan Hamilton loops, finally give the mobile route of mobile node, and mobile node is moved by this path, realizes movable joint
The scheduling of point, exports the most short mobile route of this scheduling by natwork system.
5. a kind of mobile node dispatching method of nearest neighbor algorithm using optimization according to claim 1 or 2, its feature
It is：In step 1, in the establishment stage of cluster, the election process of each round cluster head is：Each sensor node produce first one with
Machine number, the scope of random number is [0,1]；Then with setting threshold value T be compared with these random numbers, determine which node into
For cluster head；The random number that node turns into the condition of cluster head to produce is less than threshold value T (m), corresponding others sensor nodes into
For member in cluster.
6. a kind of mobile node dispatching method of nearest neighbor algorithm using optimization according to claim 1 or 3, its feature
It is：In step 2, mobile node need to pass through and only by a cluster head position from original position, when passing through cluster head position
Its corresponding data message is collected when putting, initial position, that is, base station location is eventually returned to.
7. a kind of mobile node dispatching method of nearest neighbor algorithm using optimization according to claim 1 or 4, its feature
It is：Step 3 is specifically included：
Step 3-1：Choose network system base station location s0As starting point, one and s are looked for0Association and the minimum a line e of weights1,
e1Also it is connected with another summit, this summit is designated as s1, a road s can be obtained0s1；
Step 3-2：It is assumed that having selected road s0s1L si, from remaining summitChoose one and si
Nearest node, it is s to make iti+1, road s can be obtained0s1L sisi+1；
Step 3-3：If i+1 ＜ n-1, i ← i+1 return to step 3-2 is made；Otherwise, C=s is remembered0s1L sisi+1L sns0, it is just
For a Hamilton loop, the approximate solution of problem is produced；
If C=s0s1L sisi+1L sns0It is the Hamilton loop that figure G is tried to achieve using nearest neighbor algorithm；To institute in the C of loop
There are i, the j for meeting 1 ＜ i+1 ＜ j ＜ s, a new Hamilton loops C can be obtained according to step 3-4k：
Step 3-4：I ≠ j is checked whether there is on the C of loop so that sisj∈ E (G), si+1sj+1∈ E (G) and w (sisj)+w(si+ 1sj+1) ＜ w (sisi+1)+w(sjsj+1), then constitute new Hamilton loops Ck=s1s2L sisjsj-1L si+1sj+1L sns1；
Step 3-5：Use CkInstead of C, and step 3-4 is gone to, untill not meeting the loop of condition in step 3-4, final
To C be this scheduling mobile node mobile route, realize the rational management of mobile node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710340082.8A CN107172681A (en) | 2017-05-15 | 2017-05-15 | A kind of mobile node dispatching method of nearest neighbor algorithm using optimization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710340082.8A CN107172681A (en) | 2017-05-15 | 2017-05-15 | A kind of mobile node dispatching method of nearest neighbor algorithm using optimization |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107172681A true CN107172681A (en) | 2017-09-15 |
Family
ID=59816223
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710340082.8A Pending CN107172681A (en) | 2017-05-15 | 2017-05-15 | A kind of mobile node dispatching method of nearest neighbor algorithm using optimization |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107172681A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101977376A (en) * | 2010-10-18 | 2011-02-16 | 北京交通大学 | Mobile node-based wireless sensor network energy-saving secure routing method and system thereof |
| CN103593747A (en) * | 2013-11-07 | 2014-02-19 | 银江股份有限公司 | Large-scale client point classified dispatching method based on meanshift classification |
| CN103686922A (en) * | 2013-12-18 | 2014-03-26 | 浙江树人大学 | Optimization method for survival time of multi-Sink-node movement wireless sensor network |
| CN104936194A (en) * | 2015-06-08 | 2015-09-23 | 浙江理工大学 | Underwater acoustic sensor networks and node deployment and networking method thereof |
| JP2016502766A (en) * | 2012-12-05 | 2016-01-28 | 日本電気株式会社 | Wireless communication system and communication control method |
| CN106102112A (en) * | 2016-05-19 | 2016-11-09 | 东华大学 | A kind of mobile Sink node method of data capture based on ant group algorithm |
| CN106658642A (en) * | 2016-12-29 | 2017-05-10 | 长春理工大学 | Energy heterogeneous wireless sensor network clustering method and system |
-
2017
- 2017-05-15 CN CN201710340082.8A patent/CN107172681A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101977376A (en) * | 2010-10-18 | 2011-02-16 | 北京交通大学 | Mobile node-based wireless sensor network energy-saving secure routing method and system thereof |
| JP2016502766A (en) * | 2012-12-05 | 2016-01-28 | 日本電気株式会社 | Wireless communication system and communication control method |
| CN103593747A (en) * | 2013-11-07 | 2014-02-19 | 银江股份有限公司 | Large-scale client point classified dispatching method based on meanshift classification |
| CN103686922A (en) * | 2013-12-18 | 2014-03-26 | 浙江树人大学 | Optimization method for survival time of multi-Sink-node movement wireless sensor network |
| CN104936194A (en) * | 2015-06-08 | 2015-09-23 | 浙江理工大学 | Underwater acoustic sensor networks and node deployment and networking method thereof |
| CN106102112A (en) * | 2016-05-19 | 2016-11-09 | 东华大学 | A kind of mobile Sink node method of data capture based on ant group algorithm |
| CN106658642A (en) * | 2016-12-29 | 2017-05-10 | 长春理工大学 | Energy heterogeneous wireless sensor network clustering method and system |
Non-Patent Citations (1)
| Title |
|---|
| 谢光前: "《中国博士学位论文全文数据库 信息科技辑》", 15 March 2017 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102497679B (en) | Static clustering algorithm for wireless sensor network | |
| CN101286911B (en) | Networking method of wireless sensor network based on combination of cluster and Mesh | |
| US8737226B2 (en) | Method for two-stage packet aggregation facing wireless sensor network of hybrid topology structure | |
| Prabhu et al. | Capacity based clustering model for dense wireless sensor networks | |
| CN105813116B (en) | A method of minimizing software definition wireless sensor network energy consumption | |
| Zhang et al. | Performance analysis of cluster-based and tree-based routing protocols for wireless sensor networks | |
| CN106304234A (en) | A kind of wireless sensor network energy consumption optimization method based on clustering routing agreement | |
| CN101079772A (en) | Intelligent traffic control system based on ZigBee wireless communication | |
| CN105050095B (en) | A kind of topological construction method of the heterogeneous wireless sensor net based on energy predicting | |
| CN101360033A (en) | Mobile self-organizing network cluster dividing method based on state mechanism | |
| CN103281708B (en) | Wireless sensor node dispositions method | |
| CN103037467B (en) | Method and device for fusing data of wireless sensor network | |
| CN107040884A (en) | A kind of mobile ad hoc network data transmission method based on neighborhood strong connectedness | |
| CN107172681A (en) | A kind of mobile node dispatching method of nearest neighbor algorithm using optimization | |
| CN106412935B (en) | A kind of network topology structure method for building up based on Complex Networks Theory | |
| CN105682170A (en) | Clustering-type wireless sensor network data collection method based on energy consumption balance | |
| CN104284453B (en) | A kind of networking method of wireless sensor network of less redundant link | |
| CN106559345A (en) | Ranked data gathering algorithm based on network topology | |
| Jain et al. | Performance analysis of hierarchical agglomerative clustering in a wireless sensor network using quantitative data | |
| CN204102313U (en) | A kind of master-slave mode information collecting device being used for microenvironment monitoring based on WSN | |
| CN104301963B (en) | A kind of method improved and optimizated based on ZigBee wireless network Routing Algorithms Baseds | |
| CN107453997A (en) | A kind of optimization method for routing based on double costs | |
| CN113347680A (en) | Energy-saving routing method of cluster tree-shaped wireless sensor network based on ZigBee | |
| CN204166680U (en) | Wireless kilowatt meter reading-out system | |
| CN110212941A (en) | A kind of cluster-dividing method based on event driven heterogeneous nodes |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170915 |
|
| RJ01 | Rejection of invention patent application after publication |