CN104754683B - Radio sensor network data collection method based on multihop routing and mobile element - Google Patents
Radio sensor network data collection method based on multihop routing and mobile element Download PDFInfo
- Publication number
- CN104754683B CN104754683B CN201510154493.9A CN201510154493A CN104754683B CN 104754683 B CN104754683 B CN 104754683B CN 201510154493 A CN201510154493 A CN 201510154493A CN 104754683 B CN104754683 B CN 104754683B
- Authority
- CN
- China
- Prior art keywords
- sensor node
- node
- network
- mobile element
- base station
- 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
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/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/46—Cluster building
-
- 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/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- 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
Abstract
The present invention provides a kind of radio sensor network data collection method based on multihop routing and mobile element, by wireless sensor node and base station network consisting, it is determined by the determination of sensor node position and identity, mobile element track route is planned, the information completed between sensor node and mobile element is transmitted, mobile element is transmitted to base station for the information come is collected during walking, until network is dead.The present invention adapts to the features such as extensive wireless sensor network, self-organizing, random placement, complicated environment, it is suitble to largely dispose and use under the environment such as the field environment of scarcity, mobile element and traditional cluster algorithm are combined, can efficiently and accurately transmission data, and reduce the energy consumption of sensor node, follow node death transformation topology structure, again cluster head node and second level cluster head are chosen, the energy consumption for utmostly reducing leader cluster node, increases the time-to-live of network totality.
Description
Technical field
The present invention relates to the communications field, especially a kind of method for routing of wireless sensor network.
Background technique
Wireless sensor network is the sensor network of a new generation, has very extensive application prospect, develops and answers
With, it will the every field of life and production to the mankind brings profound influence.Early in 1970s, there have been will pass
System sensor constitutes sensor network blank using point-to-point transmission, connection sensing controler, we it return for first
For sensor network.With the continuous development and progress of related discipline, sensor network is also provided with acquisition much information simultaneously
The comprehensive treatment capability of signal, and by being connected with sensing controler, constitute the sensing of informix and processing capacity
Device network, this is second generation sensor network.And since last century end, field bus technique starts to be applied to sensor network
Network, people set up intellectualized sensor network with it, and a large amount of Multifunction Sensors are employed, and are connected using wireless technology, nothing
Line sensor network gradually forms.
Such as U.S. of developed country, pays much attention to the development of wireless sensor network, and IEEE is making great efforts to promote wireless sensing
The application and development of device network, Boston University also in having established measurement and control network association of sensor China recently
(SensorNetworkConsortium), it is desirable to promote sensor cluster technological development." technology review " magazine in the U.S. exists
When discussing the following emerging ten big technology, wireless sensor network is even more classified as first item future emerging technology, Business Week
In the big new technology of future four of prediction, wireless sensor network is also included in wherein.It is contemplated that wireless sensor network is extensive
It is a kind of inexorable trend, its appearance will bring great change to human society.
The core missions of wireless sensor network are the information Perception and data collection to surrounding network environment.Traditional number
It is completed according to collection mode by the wireless telecommunications between sensor node and network base station, but will lead to higher sensor node
Energy consumption, and there is the unbalanced situation of nodes energy consumption, to reduce network normal working hours.In addition, traditional data
Collection mode requires network that must have connectivity.In order to guarantee connectivity, need to dispose a large amount of sensor section into network
Point, to inevitably lead to the redundancy of node and increase network cost.
Mobile element is while having mobile and data collection capability personnel or equipment.The shifting that mobile element passes through itself
It is dynamic to access to the sensor node in network, and completed using close range wireless communication to data produced by sensor node
Collection.Data collection is completed by introducing mobile element into network, the energy consumption of sensor node is significantly improved,
Requirement of the data collection to network connectivty is also reduced simultaneously.
Summary of the invention
For overcome the deficiencies in the prior art, the present invention devises a kind of wireless sensor network based on mobile element
Routing Protocol, the agreement are able to achieve the energy consumption of data network entirety while obtaining efficiently and accurately and receiving of network as far as possible
The features such as reducing, and adapting to extensive wireless sensor network, self-organizing, random placement, complicated environment, and be suitble in spy
It largely disposes and uses under different environment, such as field environment of scarcity etc..And pass through the comprehensive of mobile element and cluster algorithm
It closes and uses, the energy consumption of sensor node is reduced while realizing efficiently and accurately transmission sensor data, to make network
Overall survival time extend as far as possible.
The technical solution adopted by the present invention to solve the technical problems is:
Step 1: wireless sensor node is shed and network struction
It establishes one and square wireless sensor network is formed by wireless sensor node and base station, base station is located at wireless pass
Sensor network area center, sensor node are shed around base station at random by unmanned plane, and each sensor node has specific
ID number；
Step 2: sensor node position is determining and identity determines
Each sensor node obtains the location information of oneself by the GPS positioning system that itself is installed, and by the position of oneself
Confidence breath passes to base station by way of each sensor node multi-hop transmission, and base station is close according to the distribution of each node location information
Degree chooses first order cluster head CH (Cluster Heads), and the mechanism for choosing cluster head is as follows: setting the data transmit-receive half of sensor node
Diameter is up to r, determines in the number that each sensor node is the effective sensor node in circle that center r is radius, and
The ID of effective sensor node is recorded, how much is made by the number of effective sensor node around each sensor node
Routing table, and arranged from big to small according to the number of effective sensor node, it is maximum to choose surrounding effective sensor node number
Point be the routing table gauge outfit point be CH, later check surrounding effective sensor node number whether come deputy point
It selects and is present in the routing table of CH point, if in the routing table, coming deputy node locating is ordinary node；If
Not in the routing table, then it is set to CH, and so on, until nodes all in routing table screening finishes；
Step 3: the planning of mobile element track route
The present invention regards mobile element ME (Mobile Element) track route problem as traveling salesman problem, using nearest
The optimization algorithm of adjacent algorithm carries out the planning of ME track route: choosing data of the linear distance away from track route less than ME and receives
The sensor node for collecting covering radius R is that secondary cluster head VH (Virtual Heads) i.e. is calculated after the track route of ME determines
Each sensor node to the route vertical range, if vertical range is less than the covering radius of ME, that is, the sensor section
Point is within the covering radius of ME, i.e. ME can receive the information that the point transmits, and otherwise the point is chosen as VH；
Step 4: the information transmission between sensor node and mobile element
Each sensor node receives the identity information of the other sensors node transmitted base station in network and data pass
After passing information, each sensor node collects all information that the sensor node can be collected into, including temperature, humidity, pressure,
Magnetic field, sound, gas and radiology information, and the information being collected into is transferred to the CH or VH nearest from the sensor node and is saved
Information temporary storage is waited ME to transmit information to ME when passing through, ME is from entire square area by point, nearest CH or VH node
Center set out along the good ME of base station planning track route walking；
Step 5: after mobile element ME returns to base station, and next all information are collected from CH or VH node during ME is walked
It is transmitted to base station, mobile element ME repeats to walk according to programme path；Walk since ME is just until have the death of node when
Between be denoted as the time-to-live of the node in a network, when there is a node death in network, be considered as the network death, base station weight
It is new to execute step 2, i.e., according to the distribution density of each node location information, re-starts position determination and identity determines, and most
ME is informed in new route planning, and in the ME walking of next round, ME will collect data according to new route；
Mobile element and traditional sub-clustering method are combined, number collected by each sensor node of the transmission of efficiently and accurately
According to, and the energy consumption of each sensor node is reduced as far as possible, keep the network overall survival time as long as possible.
The beneficial effects of the invention are as follows be the present invention adapt to wireless sensor network extensive, self-organizing, random placement,
The features such as environment is complicated, and be suitble to largely dispose and use under the particular surroundings such as the field environment of scarcity, the present invention will
Mobile element is combined with traditional cluster algorithm, can data collected by each sensor node of transmission of efficiently and accurately, and
The energy consumption for reducing each sensor node as far as possible makes the overall survival time extend as far as possible of network.The present invention follows
Node death transformation topology structure chooses cluster head node and second level cluster head again, can be utmostly to reduce leader cluster node
Energy consumption is carried out pair by the data of the network survival time with other vantageous methods to increase the time-to-live of network totality
Than this method has embodied apparent advantage.
Detailed description of the invention
Fig. 1 is the wireless sensor routing mechanism implementation flow chart based on mobile element.
Fig. 2 is ME track route planning chart.
Fig. 3 is to scheme the 20-35 meshed network time-to-live, and wherein ordinate is network survival time, and abscissa is network section
Point number.
Fig. 4 is to scheme the 100-400 meshed network time-to-live, and wherein ordinate is network survival time, and abscissa is network
Node number.
Fig. 5 was 100 meshed network time-to-live with the variation relation of CH radius, and wherein ordinate is network survival time,
Abscissa is CH radius size.
Specific embodiment
Present invention will be further explained below with reference to the attached drawings and examples.
Step 1: wireless sensor node is shed and network struction
It establishes one and square wireless sensor network is formed by wireless sensor node and base station, base station is located at wireless pass
Sensor network area center, sensor node are shed around base station at random by unmanned plane, and each sensor node has specific
ID number；
Such as the configuration steps block diagram that Fig. 1 is entire inventive method, n sensor node is evenly distributed on one at random
In 100*100 square area, mobile element can arbitrarily walk about in square area, each node has a data
The limitation r of transmission range.Assuming that each node has ID to number and is respectively arranged with GPS, their geographical location letter can be obtained
Breath.And it can carry out data transmission when around ME walking to sensor node.
Step 2: sensor node position is determining and identity determines
Each sensor node obtains the location information of oneself by the GPS positioning system that itself is installed, and by the position of oneself
Confidence breath passes to base station by way of each sensor node multi-hop transmission, and base station is close according to the distribution of each node location information
Degree chooses first order cluster head CH (Cluster Heads), and the mechanism for choosing cluster head is as follows: setting the data transmit-receive half of sensor node
Diameter is up to r, determines in the number that each sensor node is the effective sensor node in circle that center r is radius, and
The ID of effective sensor node is recorded, how much is made by the number of effective sensor node around each sensor node
Routing table, and arranged from big to small according to the number of effective sensor node, it is maximum to choose surrounding effective sensor node number
Point be the routing table gauge outfit point be CH, later check surrounding effective sensor node number whether come deputy point
It selects and is present in the routing table of CH point, if in the routing table, coming deputy node locating is ordinary node；If
Not in the routing table, then it is set to CH, and so on, until nodes all in routing table screening finishes；
Step 3: the planning of mobile element track route
The present invention regards mobile element ME (Mobile Element) track route problem as traveling salesman problem, using nearest
The optimization algorithm of adjacent algorithm carries out the planning of ME track route: choosing data of the linear distance away from track route less than ME and receives
The sensor node for collecting covering radius R is secondary cluster head VH (Virtual Heads)；That is it after the track route of ME determines, calculates
Each sensor node to the route vertical range, if vertical range is less than the covering radius of ME, that is, the sensor section
Point is within the covering radius of ME, i.e. ME can receive the information that the point transmits, and otherwise the point is chosen as VH；
In the case where ME track route has determined, chooses data collection of the linear distance away from route less than ME and cover
The sensor node of radius R is VH.After base station selection good all CH and VH, each node is set to obtain oneself by broadcast
Identity information and surroundings nodes identity information.
The planning of the mobile element track route of the invention patent, calculates, its step are as follows using nearest neighbor algorithm:
(1) an optional sensor node V1Make starting point, looks for one and V1The smallest a line e of associated weight value1, e1It is another
End point is denoted as V2Obtain a road V1V2；
(2) it sets and has selected road V1, V2... Vi, in point set V (G)-{ V1, V2..., ViIn take one and ViNearest is adjacent
Vertex Vi+1, obtain V1, V2... Vi, Vi+1；
(3) if i+1 < P (G), (2) is returned for i+1 with i, otherwise remember P=V1V2...VpV1, wherein P (G) is the point inside G
Total number；
(4) i, j and 1 < i+1 < j < p, and W (V if it existsi, Vj)+W(Vi+1, Vj+1) < W (Vi, Vi+1)+W(Vj, Vj+1),
Then Cij=V1, V2... ViVj, Vj-1... Vi+1Vj+1, V2..., VpV1, wherein Cij is the circuit of near-optimization, W (Vi, Vj)
For Vi, VjThe weight of point-to-point transmission, W (Vi+1, Vj+1) it is Vi+1, Vj+1The weight of point-to-point transmission, W (Vi, Vi+1) it is Vi, Vi+1Point-to-point transmission
Weight, W (Vj, Vj+1) it is Vj, Vj+1The weight of point-to-point transmission, p are the total numbers still survived a little, can be obtained by above-mentioned path planning
Path planning figure shown in Fig. 2.
Step 4: the information transmission between sensor node and mobile element
Each sensor node receives the identity information of the other sensors node transmitted base station in network and data pass
After passing information, each sensor node collects all information that the sensor node can be collected into, including temperature, humidity, pressure,
Magnetic field, sound, gas and radiology information, and the information being collected into is transferred to the CH or VH nearest from the sensor node and is saved
Information temporary storage is waited ME to transmit information to ME when passing through, ME is from entire square area by point, nearest CH or VH node
Center set out along the good ME of base station planning track route walking；
ME can send the information that broadcast tells node oneself that will reach during walking, and each node is usually
The information transmitted will be needed to have sent CH or VH to, the information cached can be transferred to by the two when detecting that ME passes through
ME。
Step 5: after mobile element ME returns to base station, and next all information are collected from CH or VH node during ME is walked
It is transmitted to base station, mobile element ME repeats to walk according to programme path；Walk since ME is just until have the death of node when
Between be denoted as the time-to-live of the node in a network, when there is a node death in network, be considered as the network death, base station weight
It is new to execute step 2, i.e., according to the distribution density of each node location information, re-starts position determination and identity determines, and most
ME is informed in new route planning, and in the ME walking of next round, ME will collect data according to new route.
Mobile element and traditional sub-clustering method are combined, number collected by each sensor node of the transmission of efficiently and accurately
According to, and the energy consumption of each sensor node is reduced as far as possible, keep the network overall survival time as long as possible.
The present invention has also carried out the optimization of CH covering radius, since present invention data obtained are taken in CH covering radius
Maximum value 25, and only consider to carry out under the condition of single-hop information transmission, change CH radius will certainly to network survival time with
And data transmit-receive time delay impacts, therefore the present invention is again further studied the above problem, changes the radius of CH, it is right
The change for answering network survival time has found CH radius value when network survival time longest, is equivalent to and does to CH radius value
Optimization.
The present invention has simulated network survival time in the case where 100 node and has seen figure with the variation relation of CH radius
5, by changing the radius of CH, emulation is obtained the overall survival time of different CH radius lower networks, and is obtained by analyzing data
Out when the radius of CH takes 10 or so, network survival time can not only lengthened but also be unlikely to keep the walking distance of ME too long and
Increase time delay, therefore be best with 10 when choosing CH covering radius, it can guarantees network survival time, and the walking of ME can be made
Distance will not be too long, to reduce time delay.
Show that result of the invention meets theoretical actual analysis by emulation, concrete results are as follows:
The present invention has carried out the comparison of network overall survival length of time in the case where different node numbers.Each data
It is averaged to obtain by continuously measuring 100 times.By correlation data discovery the taken node number of network be located at 20-35 it
Between when, the network survival time of this paper improves 1-2 times than current existing method；When the taken number of node is located at 100-400, this
The network survival time of text improves 4-5 times than existing method.Network survival time is that wireless sensor network routing is examined to set
Count the important indicator of quality, it can be seen that the method for this offers for wireless sensor network routing Design with important
Value.
Fig. 3 and Fig. 4 is the network survival time comparison diagram of the method for the present invention and the paper result, and wherein Fig. 3 is 20-35 section
Spot net time-to-live figure, Fig. 4 are 100-400 meshed network time-to-live figure.The data of each figure, which pass through, continuously measures 100
It is secondary to be averaged to obtain.Logical comparison discovery network survival time of this paper in 20-35 node mentions than the paper mentioned method
1-2 times high, in 100-400 node, the network survival time of this paper improves 4-5 times than the paper mentioned method, preliminary analysis
This is that VH is utilized to reduce the burden of CH, so that the total energy consumption of network reduces.
Claims (1)
1. a kind of radio sensor network data collection method based on multihop routing and mobile element, it is characterised in that including under
State step:
Step 1: wireless sensor node is shed and network struction
It establishes one and square wireless sensor network is formed by wireless sensor node and base station, base station is located at wireless sensor
Network area center, sensor node are shed around base station at random by unmanned plane, and each sensor node has specific ID
Number；
Step 2: sensor node position is determining and identity determines
Each sensor node obtains the location information of oneself by the GPS positioning system that itself is installed, and the position of oneself is believed
Breath passes to base station by way of each sensor node multi-hop transmission, and base station is selected according to the distribution density of each node location information
First order cluster head CH (Cluster Heads) is taken, the mechanism for choosing cluster head is as follows: setting the data transmit-receive radius of sensor node most
Greatly r, the number of effective sensor node of the determination in the circle that each sensor node is that center r is radius, and will have
The ID of effect sensor node is recorded, and how much makes routing by the number of effective sensor node around each sensor node
Table, and arranged from big to small according to the number of effective sensor node, choose the maximum point of surrounding effective sensor node number
I.e. the point of the routing table gauge outfit is CH, checks that surrounding effective sensor node number comes whether deputy point has been selected later
And be present in the routing table of CH point, if in the routing table, coming deputy node locating is ordinary node；If not existing
In routing table, then it is set to CH, and so on, until nodes all in routing table screening finishes；
Step 3: the planning of mobile element track route
Regard mobile element ME (Mobile Element) track route problem as traveling salesman problem, utilizes the excellent of nearest neighbor algorithm
Change algorithm to carry out the planning of ME track route: choosing the data collection covering radius that the linear distance away from track route is less than ME
The sensor node of R is that secondary cluster head VH (Virtual Heads) i.e. calculates each sensor section after the track route of ME determines
Point arrives the vertical range of the route, if vertical range is less than the covering radius of ME, that is, the sensor node covering in ME
Within lid radius, i.e. ME can receive the information that the sensor node transmits, and otherwise the sensor node is chosen as VH；
The optimization algorithm of the nearest neighbor algorithm specifically includes:
(1) an optional sensor node V1Make starting point, looks for one and V1The smallest a line e of associated weight value1, e1The other end note
For V2；
(2) it sets and has selected road V1,V2…Vi, in point set V (G)-{ V1,V2…ViIn take one and ViNearest adjacent vertex Vi+1,
V1,V2…Vi,Vi+1；
(3) if i+1 < P (G), with i for i+1 return step (2), otherwise remember P=V1V2…VpV1, wherein being the total of the point inside G
Number；
(4) i, j and 1 < i+1 < j < P, and W (V if it existsi,Vj)+W(Vi+1,Vj+1) < W (Vi,Vi+1)+W(Vj,Vj+1), then
Cij=V1,V2,…ViVj,Vj-1,…Vi+1Vj+1,V2,…VPV1, wherein CijIt is the circuit of near-optimization, W (Vi,Vj) it is Vi,VjTwo
Weight between point, W (Vi+1,Vj+1) it is Vi+1,Vj+1Weight between two o'clock, W (Vi,Vi+1) it is Vi,Vi+1Power between two o'clock
Value, W (Vj,Vj+1) it is Vj,Vj+1Weight between two o'clock, P are the total number still survived a little；
Step 4: the information transmission between sensor node and mobile element
Each sensor node receives the identity information and data transmitting letter of the other sensors node transmitted base station in network
After breath, each sensor node collects all information that the sensor node can be collected into, including temperature, humidity, pressure, magnetic
Field, sound, gas and radiology information, and the information being collected into is transferred to the CH or VH nearest from the sensor node and is saved
Information temporary storage is waited ME to transmit information to ME when passing through, ME is from entire square area by point, nearest CH or VH node
Center set out along the good ME of base station planning track route walking；
Step 5: after mobile element ME returns to base station, and collecting all information come from CH or VH node during ME is walked and be transmitted to
Base station, mobile element ME repeat to walk according to programme path；Walking is up to there is the time of node death note since ME is just
It is considered as network death, base station is held again when there is a node death in network for the time-to-live of the node in a network
Row step 2 re-starts position determination and identity determines, and newest that is, according to the distribution density of each node location information
ME is informed in route planning, and in the ME walking of next round, ME will collect data according to new route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510154493.9A CN104754683B (en) | 2015-04-02 | 2015-04-02 | Radio sensor network data collection method based on multihop routing and mobile element |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510154493.9A CN104754683B (en) | 2015-04-02 | 2015-04-02 | Radio sensor network data collection method based on multihop routing and mobile element |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104754683A CN104754683A (en) | 2015-07-01 |
| CN104754683B true CN104754683B (en) | 2019-01-29 |
Family
ID=53593629
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510154493.9A Expired - Fee Related CN104754683B (en) | 2015-04-02 | 2015-04-02 | Radio sensor network data collection method based on multihop routing and mobile element |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104754683B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106203697A (en) * | 2016-07-08 | 2016-12-07 | 西北大学 | A kind of paths planning method during Unmanned Aerial Vehicle Data collection |
| CN106559757A (en) * | 2016-11-23 | 2017-04-05 | 宁波大红鹰学院 | A kind of UAV Communication method |
| CN107212860A (en) * | 2017-06-28 | 2017-09-29 | 深圳源广安智能科技有限公司 | A kind of physiological signal intelligent monitor system |
| CN107613480B (en) * | 2017-09-24 | 2020-04-17 | 中南大学 | Data collection method based on tree cluster and mobile element |
| CN108200056B (en) * | 2017-12-29 | 2021-03-16 | 广东工业大学 | Identity verification method and system for unmanned device |
| CN110519820B (en) * | 2019-08-27 | 2021-06-15 | 中科芯(苏州)微电子科技有限公司 | Routing method applied to cluster unmanned aerial vehicle communication |
| CN110972230B (en) * | 2019-12-23 | 2021-07-27 | 杭州电子科技大学 | Method for LEACH two-stage clustering routing protocol based on cuckoo algorithm |
| CN111212455B (en) * | 2020-01-16 | 2022-02-22 | 中国人民解放军陆军工程大学 | Dynamic clustering system and method for wireless self-organizing network |
| CN113311779B (en) * | 2021-05-27 | 2022-03-01 | 湖南国天电子科技有限公司 | Buoy data acquisition processing control system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102740395A (en) * | 2012-07-12 | 2012-10-17 | 南京邮电大学 | Self-organizing routing method facing mobile sensor network |
| CN103152792A (en) * | 2013-03-28 | 2013-06-12 | 东南大学 | Mobile data collecting method based on rail assistance in wireless sensor network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8855050B2 (en) * | 2010-09-02 | 2014-10-07 | Weixiang Chen | Soft state framework for mobile WSN routing |
-
2015
- 2015-04-02 CN CN201510154493.9A patent/CN104754683B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102740395A (en) * | 2012-07-12 | 2012-10-17 | 南京邮电大学 | Self-organizing routing method facing mobile sensor network |
| CN103152792A (en) * | 2013-03-28 | 2013-06-12 | 东南大学 | Mobile data collecting method based on rail assistance in wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| A Hybrid Approach Using Mobile Element and Hierarchical Clustering for Data Collection in WSNs;Ruonan Zhang etc;《2015 IEEE wireless communication and Networking Conference》;20150312;第II-IV节 |
| 无线传感器网络中一种基于移动sink的数据收集算法;张蕾等;《传感技术学报》;20120531;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104754683A (en) | 2015-07-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104754683B (en) | Radio sensor network data collection method based on multihop routing and mobile element | |
| Zheng et al. | Energy-efficient localization and tracking of mobile devices in wireless sensor networks | |
| Ayaz et al. | A survey on routing techniques in underwater wireless sensor networks | |
| CN105451290B (en) | A kind of micropower wireless network ad hoc network method and micropower wireless network | |
| CN105745852B (en) | System and method for non-cellular wireless access | |
| CN103974367B (en) | Fault tolerant and multi-path optimization method based on HEED algorithms in wireless sensor network | |
| CN104854901A (en) | Method to guide pacement of new small cell | |
| CN103347288B (en) | A kind of wireless sensor network does not wait width hierarchical routing protocol method | |
| CN103095577B (en) | Context-sensitive Uneven Cluster routing algorithm | |
| Ma et al. | UAV-aided cooperative data collection scheme for ocean monitoring networks | |
| CN107205254B (en) | Mobile sink node access and interference rejection method and system based on tight delay constraint | |
| CN107110951A (en) | Radio signal source is positioned | |
| CN105611502A (en) | Indoor positioning system and method based on WiFi Mesh network | |
| CN103179582B (en) | A kind of room subsystem site selecting method and system | |
| CN103337142A (en) | Wireless networking method for electric energy meter management system | |
| CN103532844A (en) | Micro-power wireless networking and communication method, master node and system | |
| CN105722174A (en) | Node link scheduling method of heterogeneous integrated power consumption information collection network | |
| CN103068038A (en) | Indoor bidirectional positioning method based on Zigbee network | |
| Ma et al. | UAV-assisted data collection for ocean monitoring networks | |
| CN108566664A (en) | A kind of WSN clustering routing optimization methods of distribution high energy efficiency | |
| CN106559731A (en) | A kind of sewage monitoring wireless sensor network | |
| CN105873160A (en) | Cluster establishing and routing method for cognitive radio sensor network without common control channel | |
| CN101835233B (en) | Wireless sensor network oriented random route selecting method | |
| CN103701647B (en) | A kind of wireless network topology optimization generates method | |
| CN103428724B (en) | Spectrum resource cooperation cut-in method based on geographical location information and system |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190129 Termination date: 20210402 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |