CN107040884A - A kind of mobile ad hoc network data transmission method based on neighborhood strong connectedness - Google Patents
A kind of mobile ad hoc network data transmission method based on neighborhood strong connectedness Download PDFInfo
- Publication number
- CN107040884A CN107040884A CN201611048618.0A CN201611048618A CN107040884A CN 107040884 A CN107040884 A CN 107040884A CN 201611048618 A CN201611048618 A CN 201611048618A CN 107040884 A CN107040884 A CN 107040884A
- Authority
- CN
- China
- Prior art keywords
- route
- node
- probability
- cluster
- connectedness
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
-
- 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/14—Routing performance; Theoretical aspects
-
- 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/26—Route discovery packet
-
- 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
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/025—Services making use of location information using location based information parameters
- H04W4/027—Services making use of location information using location based information parameters using movement velocity, acceleration information
-
- 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
-
- 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/026—Route selection considering the moving speed of individual devices
-
- 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)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of mobile ad hoc network data transmission method based on neighborhood strong connectedness, including：Judge that the connected probability between certain time interval interior nodes and node sets up probability graph network model by the positional information and velocity information of mobile ad hoc network；Find to route by hop count and route connected ratio using the probability graph network model storage neighbor node set set up in abovementioned steps and the connected probability between neighbor node, and thus according to route discovery algorithm MDSR, finally return that a plurality of route；According to the quick mobility of mobile ad hoc network interior joint, the sub-clustering of node set is carried out based on neighborhood connectedness, route is screened in a plurality of route having been found that by cluster sectional, the selection being route according to the connectedness between the connected probability and node and neighborhood between node, and a complete route is formed after the section route combination based on selection, it is finally completed the forwarding of data.The present invention reduces data transfer delay, improves the reliability of data forwarding.
Description
Technical field
The invention belongs to mobile ad hoc network field, more particularly to a kind of mobile ad hoc network data based on neighborhood strong connectedness
Transmission method.
Background technology
In recent years, mobile ad hoc network (Mobile Ad hoc Network, MANET) is more and more widely applied to respectively
In each industry of row.During initial wireless self-networking design routing algorithm carried out around energy expenditure.But now increasingly
The practical application form of many mobile ad hoc networks is not too much paid close attention to energy expenditure, and how reliable the condition quickly moved is rapidly
Transmission data are only the very corn of a subject.Such as node in car self-organization network, social mobile network, these networks, which can be provided, to be held
Continuous energy, but the speed and reliability for data transfer but have higher requirement, because the user of these networks is
People, although be that data are transmitted between node and node, but the user of data is the owner for holding node.This is with initially wireless
The theoretical environment of MANET has very big difference.So, it is assumed that nodes energy expenditure considers not as principal element
When, corresponding data transmission policies are also required to corresponding change.
The content of the invention
Goal of the invention：In order to solve the problems of the prior art, the present invention proposes that data transfer delay can be reduced, improves number
According to a kind of mobile ad hoc network data transmission method based on neighborhood strong connectedness of the reliability of forwarding.
Technical scheme：A kind of mobile ad hoc network data transmission method based on neighborhood strong connectedness, comprises the following steps：
(1) network modelling based on connected probability, judges certain by the positional information and velocity information of mobile ad hoc network
Connected probability between time interval interior nodes and node sets up probability graph network model；
(2) the probability graph network model storage neighbor node set set up using step (1) and the company between neighbor node
Logical probability, and find to route by hop count and route connected ratio thus according to route discovery algorithm MDSR, return to a plurality of route；
(3) according to the quick mobility of mobile ad hoc network interior joint, point of node set is carried out based on neighborhood connectedness
Route is screened in cluster, a plurality of route returned by cluster sectional in the step (2), according to the connected probability between node and
A complete road is formed after the selection that connectedness between node and neighborhood is route, and the route combination of the section based on selection
By being finally completed the transmission forwarding of data.
Route discovery algorithm MDSR in the step (2) is specially：
When source node initiates route discovery, the probability graph network model set up according to step (1), node broadcasts information
(ID, x, y, v), node according to broadcast message find neighbor node after calculate neighbor node between connected probability and record this
Ground, the neighbor node collection of node i is denoted as between N (i), neighbor node being formed by way of response comprising from source node to terminal
Route, destination node returns to a plurality of route；
Define 1：It route connected probability, it is assumed that route L is by node 1,2,3 ..., what i was constituted, p1,p2,…,pi-1For L bags
The connected probability value on the side contained, the then connected probability for routeing L is defined as
Wherein
The distance between upper two neighboring node of explanation route both less than communication distance during P (L)=1；According to the shifting of node
Dynamic speed, sets the threshold value H of hop count and the threshold value P of route connected probability；The source that is routed back to for meeting two threshold values simultaneously is saved
Point, and cache all routing iinformations for meeting condition；When the route connectedness of setting is 1, then the choosing of conventional route is deteriorated to
Select.
In the step (3) based on neighborhood connectedness carry out node set sub-clustering be specially：From the angle pair of strong continune
Route carries out section partition, reduces the probability of route break；From the connective angle of figure, the figure of the route composition of caching is at least
It is 1- connected graphs；Assuming that the node that all routes for finding and caching by step (2) are included is designated as V={ 1,2 ..., k }, it is false
If source node is 1, destination node is k, then makes C1=N (1) ∪ { 1 }, C2=N (k) ∪ { k }.Make V'=V (V (C1)∪V
(C2)), to arbitrary node j ∈ V', if | V (C1) ∩ N (j) | >=| V' ∩ N (j) |, or | V (C2)∩N(j)|≥|V'∩N
(j)|；For without loss of generality, it is assumed that | V (C1) ∩ N (j) | >=| V' ∩ N (j) | set up, then make C1=C1∪ { j }, V'=V (V
(C1)∪V(C2)), repeat untill the node without satisfaction；If finalThen terminate the process of sub-clustering, C1,C2I.e.
For two final clusters；IfThen V' repeats said process, untill all nodes are assigned in some cluster；
The choosing being route in the step (3) according to the connectedness between the connected probability and node and neighborhood between node
Select, be specially：Assuming that all clusters are denoted as C1,C2,…,Cm, it is routed in each cluster；Assuming that L1,L2,…,Lm
It is C respectively1,C2,…,CmFirst route of prioritizing selection, condition is as follows：
P(Li)=max P (L) | L is cluster CiIn any route formula (1)
And H (P (Li))=min H (P (L)) | L is cluster CiThe middle any route for meeting formula (1) }；L1,L2,…,LmBetween appoint
Select the maximum side of a connected probability to carry out the transmission of message between cluster, form the loop structure transmitted in cluster between transmission, cluster, finally
Joint cluster-level routing will be route in cluster and constitutes whole piece route.
Beneficial effect：Compared with prior art, method provided by the present invention more meets actual environment, route discovery and road
By selecting more targetedly, the present invention carries out network modelling based on the connected probability between node can more realistically simulated environment；
DSR, which is improved, using the unrestricted advantage of the energy expenditure of node obtains route discovery algorithm MDSR；Simultaneously based on neighborhood connection
Property carry out sub-clustering, be routed by cluster sectional.Data transfer delay can be finally reduced, the reliable of data forwarding is improved
Property.
Brief description of the drawings
Fig. 1 (a), 1 (b) are the network modelling schematic diagrames based on connected probability in the present invention.
Embodiment
Below in conjunction with accompanying drawing, the case study on implementation of the present invention is described in detail；
A kind of mobile ad hoc network data transmission method based on neighborhood strong connectedness of the present invention, this method includes：
1st, the network modelling based on connected probability, positional information and velocity information based on mobile ad hoc network judge a timing
Between connected probability between interval interior nodes and node carry out the modeling of network；
2nd, the probability graph network model based on foundation, storage neighbor node set and the connected probability between neighbor node,
And a plurality of route is obtained thus according to proposition route discovery algorithm MDSR, the algorithm is based primarily upon DSR thought, fast with reference to node
The advantage that the mobile mobile ad hoc network of speed is not limited strictly energy expenditure, which is improved, to be obtained, and finally returns that a plurality of route；
3rd, according to the quick mobility of mobile ad hoc network, the sub-clustering of node set is carried out based on neighborhood connectedness, by cluster
Sectional in a plurality of route having been found that to route screen, according to the connected probability between node and route connect general
A complete route is formed after the selection that rate is route, and the route combination based on selection, the transmission of data is finally completed
Forwarding.
The relevant parameter used in the present invention of table 1
(1) network modelling based on connected probability.
As shown in Fig. 1 (a), 1 (b), the network modeling method based on connected probability is different from the foundation of conventional graph model.Figure
Circle represents that the dotted line between the label of the numeral expression node in the node in network, circle, circle represents connection in 1 (a)
Numerical value on straight line between 2 points, dotted line represents the beeline between 2 points, and unit is m.Fig. 1 (b) is different from Fig. 1 (a)
Part is distance modification for connected probability.Assuming that communication radius is 10m, and the threshold value of connected probability is set to 0.6, then
For node 1 and 4, the distance between communication radius and both are than being less than 0.6, therefore the side is not present.Node and node
Between relation represented without using simple 0,1, but represented using connected probability value.The network for making G=(V, E, W) to set up
Model, wherein V={ v1,v2,…,vnIn element represents is node in network；E={ e1,e2,…,emIn element generation
Table is connected between there is a line at 2 points between side that may be present between nodes and node, and if only if at 2 points
Threshold of the probability not less than setting；W={ p1,p2,…,pmIn element represent be exist between 2 points a line connection it is general
Rate value, and pi>=p, i=1,2 ..., m is the threshold value set as needed.
The connected probability defined between certain 2 points of 1 (connected probability) is defined as
Wherein R represent communication radius, d represent at 2 points between actual range.
It can be seen that, piIt is bigger, send data success rate higher.Here connected probability and probable value in general sense are not
Together, it is allowed to if limiting p more than 1.iNo more than 1, and p=1 is limited, then model can deteriorate to conventional graph model.
(2) route discovery algorithm MDSR (Modified Dynamic Source Routing).
Route discovery algorithm MDSR is developed by DSR.Core concept is inspired by DSR, the first time request of route discovery
Be also to carry out on demand, but it from unlike DSR not using energy expenditure as major consideration, so being protected in route discovery
The information deposited is more, and the information of calculating is more.So as to be laid a good foundation for the Route Selection of Part III.
When source node initiates route discovery, node broadcasts (ID, x, y, v), according to the process of step (1) network modelling,
Node finds to calculate after neighbor node and the connected probability between neighbor node and recorded local, and the neighbor node collection of node i is remembered
Make to be formed comprising the route from source node to terminal by way of response between N (i), neighbor node.In order to save in DSR
Energy expenditure, reduces the energy expenditure that a plurality of route maintenance is brought, so mainly one paths of caching, when path failure, then
This initiates route discovery, finds new route.Shortcoming of such method in quick mobile ad hoc network is more times
Consumption is ceaselessly being found in route.So when node is fixed or node motion is slower, DSR is applicable.But when section
Point is mobile quick, when change in topology is frequent, can not just accomplish promptness.So when finding route in the present invention, destination node
It can return to a plurality of route.Due to including positional information and velocity information in nodal information, even if so not in neighbor node
Data, as long as the positional information of the node in route can all be obtained, and it is general so as to calculate the connection between arbitrary node
Rate.
Define 1 (route connected probability) and assume that route L is by node 1,2,3 ..., what i was constituted, p1,p2,…,pi-1For L bags
The connected probability value on the side contained, the then connected probability for routeing L is defined as
Wherein
It can be seen that, the distance between upper two neighboring node of explanation route both less than communication distance during P (L)=1, so that here
Route connected probability is the popularization to conventional route definition.According to the translational speed of node, the threshold value H and route for setting hop count connect
The threshold value P of logical probability.By the source node that is routed back to of two threshold values of satisfaction simultaneously, and cache all routes letters for meeting condition
Breath.This is conducive to node is rapid when quickly moving to find new route to replace failure route.When the route connectedness of setting is 1
When, the selection of conventional route will be deteriorated to.Retain the route for meeting threshold condition, be that, because node is quickly moved, can cause
The connective quick change of route, so as to which in current route break, available road can be quickly selected in the route of caching
By.
(3) route selection method, algorithm in being shown in Table 2.
The process is divided into two stages：Route Selection based on the connective node clustering of neighborhood and based on cluster.
Node clustering：In the network quickly moved, change in location between neighbor node is fast, so the present invention is from connecting by force
Logical angle carries out section partition to route, reduces the probability of route break.From the connective angle of figure, the route structure of caching
Into figure be at least 1- connected graphs.Assuming that found by step (2) and node that all routes for caching are included be designated as V=1,
2 ..., k }, it is assumed that source node is 1, and destination node is k, then makes C1=N (1) ∪ { 1 }, C2=N (k) ∪ { k }.Make V'=V (V
(C1)∪V(C2)), to arbitrary node j ∈ V', if | V (C1) ∩ N (j) | >=| V' ∩ N (j) |, or | V (C2)∩N(j)|≥
|V'∩N(j)|.For without loss of generality, it is assumed that | V (C1) ∩ N (j) | >=| V' ∩ N (j) | set up, then make C1=C1∪ { j }, V'=
V\(V(C1)∪V(C2)), this process is repeated, untill the node without satisfaction.If finalThen terminate sub-clustering
Process, C1,C2Two as final clusters.IfThen V' repeats said process, until all nodes are assigned to certain
Untill in individual cluster.Guiding theory sparse close cluster in cluster has been used to carry out cluster during due to carrying out sub-clustering to route
Divide, so the data transfer in each cluster has mulitpath optional, and hop count is smaller, so as to ensure that data are transmitted in cluster
Multirouting and reliability.
Route Selection based on sub-clustering：Assuming that all clusters are denoted as C1,C2,…,Cm, route choosing is carried out in each cluster
Select.Assuming that L1,L2,…,LmIt is C respectively1,C2,…,CmFirst route of prioritizing selection, condition is as follows：
P(Li)=max P (L) | L is cluster CiIn any route formula (1)
And H (P (Li))=min H (P (L)) | L is cluster CiThe middle any route for meeting formula (1) }.L1,L2,…,LmBetween appoint
The maximum side of a connected probability is selected to carry out the transmission of message between cluster.Form and transmit such circulation knot in cluster between transmission, cluster
Structure, most route joint cluster-level routing constitutes whole piece route in cluster at last.Selection route connected probability highest and hop count in cluster
Minimum route, this ensure that route will not fail in a short time, without the selection being route.Even if route
Failure, because the degree of communication in cluster is higher, so there is interchangeable available route, has ensured the quick transmission of data between cluster,
The transmission of data between cluster, it is only necessary to select a node in two neighboring cluster respectively, it is possible to transmit data, and have selected side connection
Probability highest side, so as to substantially increase the successful probability of data transfer between cluster.For generally, such Route Selection side
Formula, has exchanged the stability and promptness of data transfer for more committed memory and more amount of calculation.
The characteristic that is quickly moved from node of the present invention, makes full use of its advantage, uses for reference DSR core concept, and
Quick mobile caused route selection failure is avoided during Route Selection.Therefore, the invention present invention and prior art phase
Than model more meets actual environment, reduces data transfer delay, improves the reliability of data forwarding.
Claims (4)
1. a kind of mobile ad hoc network data transmission method based on neighborhood strong connectedness, it is characterised in that comprise the following steps：
(1) network modelling based on connected probability, certain time is judged by the positional information and velocity information of mobile ad hoc network
Connected probability between interval interior nodes and node sets up probability graph network model；
(2) the probability graph network model storage neighbor node set set up using step (1) and the connection between neighbor node are general
Rate, and find to route by hop count and route connected ratio thus according to route discovery algorithm MDSR, return to a plurality of route；
(3) according to the quick mobility of mobile ad hoc network interior joint, the sub-clustering of node set is carried out based on neighborhood connectedness, is pressed
Route is screened in a plurality of route that cluster sectional is returned in step (2), according to the connected probability and node between node
And a complete route is formed after the selection that the connectedness between neighborhood is route, and the route combination of the section based on selection,
It is finally completed the transmission forwarding of data.
2. the mobile ad hoc network data transmission method as claimed in claim 1 based on neighborhood strong connectedness, it is characterised in that institute
The route discovery algorithm MDSR stated in step (2) is specially：
When source node initiates route discovery, the probability graph network model set up according to step (1), node broadcasts information (ID, x,
Y, v), node according to receive broadcast message find neighbor node after calculate neighbor node between connected probability and record this
Ground, the neighbor node collection of node i is denoted as between N (i), neighbor node being formed by way of response comprising from source node to terminal
Route, destination node returns to a plurality of route；
Define 1：It route connected probability, it is assumed that route L is by node 1,2,3 ..., what i was constituted, p1,p2,…,pi-1Included for L
The connected probability value on side, the then connected probability for routeing L is defined as
Wherein
The distance between upper two neighboring node of explanation route both less than communication distance during P (L)=1；According to the mobile speed of node
Degree, sets the threshold value H of hop count and the threshold value P of route connected probability；By the source node that is routed back to of two threshold values of satisfaction simultaneously, and
All routing iinformations for meeting condition of caching；When the route connectedness of setting is 1, then the selection of conventional route is deteriorated to.
3. the mobile ad hoc network data transmission method as claimed in claim 1 based on neighborhood strong connectedness, it is characterised in that institute
Stating the sub-clustering for carrying out node set based on neighborhood connectedness in step (3) is specially：Area is carried out to route from the angle of strong continune
Section is divided, and reduces the probability of route break；From the connective angle of figure, the figure that the route of caching is constituted is at least 1- connections
Figure；Assuming that the node that all routes for finding and caching by step (2) are included is designated as V={ 1,2 ..., k }, it is assumed that source node
For 1, destination node is k, then makes C1=N (1) ∪ { 1 }, C2=N (k) ∪ { k }.Make V'=V (V (C1)∪V(C2)), to any
Node j ∈ V', if | V (C1) ∩ N (j) | >=| V' ∩ N (j) |, or | V (C2)∩N(j)|≥|V'∩N(j)|；Not lose one
As property, it is assumed that | V (C1) ∩ N (j) | >=| V' ∩ N (j) | set up, then make C1=C1∪ { j }, V'=V (V (C1)∪V(C2)), weight
Again untill the node without satisfaction；If finalThen terminate the process of sub-clustering, C1,C2Two as final clusters；
IfThen V' repeats said process, untill all nodes are assigned in some cluster.
4. the mobile ad hoc network data transmission method as claimed in claim 1 based on neighborhood strong connectedness, it is characterised in that institute
The selection being route in step (3) according to the connectedness between the connected probability and node and neighborhood between node is stated, is specially：It is false
If all clusters are denoted as C1,C2,…,Cm, it is routed in each cluster；Assuming that L1,L2,…,LmIt is C respectively1,
C2,…,CmFirst route of prioritizing selection, condition is as follows：
P(Li)=max P (L) | L is cluster CiIn any route formula (1)
And H (P (Li))=min H (P (L)) | L is cluster CiThe middle any route for meeting formula (1) }；L1,L2,…,LmBetween optional one
The maximum side of bar connected probability carries out the transmission of message between cluster, forms the loop structure transmitted in cluster between transmission, cluster, most cluster at last
Interior route joint cluster-level routing constitutes whole piece route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611048618.0A CN107040884B (en) | 2016-11-23 | 2016-11-23 | Mobile ad hoc network data transmission method based on strong neighborhood connectivity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611048618.0A CN107040884B (en) | 2016-11-23 | 2016-11-23 | Mobile ad hoc network data transmission method based on strong neighborhood connectivity |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107040884A true CN107040884A (en) | 2017-08-11 |
| CN107040884B CN107040884B (en) | 2020-01-07 |
Family
ID=59530571
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611048618.0A Active CN107040884B (en) | 2016-11-23 | 2016-11-23 | Mobile ad hoc network data transmission method based on strong neighborhood connectivity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107040884B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110139400A (en) * | 2019-05-23 | 2019-08-16 | 烟台艾易新能源有限公司 | A kind of silo ambient intelligence monitoring system design method |
| CN111277497A (en) * | 2020-03-18 | 2020-06-12 | 常熟理工学院 | Method for realizing network service deployment and discovery based on distribution |
| CN112468963A (en) * | 2020-11-27 | 2021-03-09 | 北京信息科技大学 | Wireless sensor network connectivity repairing method, device, equipment and storage medium |
| US20220095393A1 (en) * | 2019-02-25 | 2022-03-24 | Ntt Docomo, Inc. | Device management system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102006651A (en) * | 2010-12-02 | 2011-04-06 | 电子科技大学 | Distributed ad hoc network stable path routing method based on link lifetime |
| CN103024856A (en) * | 2012-12-31 | 2013-04-03 | 上海交通大学 | Application method of location heuristic factor in establishment of wireless ad hoc network energy-saving routing |
| CN104080056A (en) * | 2014-07-09 | 2014-10-01 | 南京邮电大学 | Message distribution method for vehicle-mounted self-organizing network based on connectivity probability perception |
| CN104486715A (en) * | 2014-11-26 | 2015-04-01 | 南京邮电大学 | Mobile sensor network clustering method based on geographical position information |
| US20160069697A1 (en) * | 2014-09-10 | 2016-03-10 | Volkswagen Ag | Apparatus, system and method for clustering points of interest in a navigation system |
-
2016
- 2016-11-23 CN CN201611048618.0A patent/CN107040884B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102006651A (en) * | 2010-12-02 | 2011-04-06 | 电子科技大学 | Distributed ad hoc network stable path routing method based on link lifetime |
| CN103024856A (en) * | 2012-12-31 | 2013-04-03 | 上海交通大学 | Application method of location heuristic factor in establishment of wireless ad hoc network energy-saving routing |
| CN104080056A (en) * | 2014-07-09 | 2014-10-01 | 南京邮电大学 | Message distribution method for vehicle-mounted self-organizing network based on connectivity probability perception |
| US20160069697A1 (en) * | 2014-09-10 | 2016-03-10 | Volkswagen Ag | Apparatus, system and method for clustering points of interest in a navigation system |
| CN104486715A (en) * | 2014-11-26 | 2015-04-01 | 南京邮电大学 | Mobile sensor network clustering method based on geographical position information |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20220095393A1 (en) * | 2019-02-25 | 2022-03-24 | Ntt Docomo, Inc. | Device management system |
| US12048027B2 (en) * | 2019-02-25 | 2024-07-23 | Ntt Docomo, Inc. | Device management system |
| CN110139400A (en) * | 2019-05-23 | 2019-08-16 | 烟台艾易新能源有限公司 | A kind of silo ambient intelligence monitoring system design method |
| CN111277497A (en) * | 2020-03-18 | 2020-06-12 | 常熟理工学院 | Method for realizing network service deployment and discovery based on distribution |
| CN111277497B (en) * | 2020-03-18 | 2021-09-21 | 常熟理工学院 | Method for realizing network service deployment and discovery based on distribution |
| CN112468963A (en) * | 2020-11-27 | 2021-03-09 | 北京信息科技大学 | Wireless sensor network connectivity repairing method, device, equipment and storage medium |
| CN112468963B (en) * | 2020-11-27 | 2023-05-05 | 北京信息科技大学 | Method, device, equipment and storage medium for repairing connectivity of wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107040884B (en) | 2020-01-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhao et al. | An intelligent fuzzy-based routing scheme for software-defined vehicular networks | |
| CN103702387B (en) | Social network-based vehicle-mounted self-organization network routing method | |
| CN103906164B (en) | Maritime search and rescue wireless sensor network topology and topology control method | |
| CN107040884A (en) | A kind of mobile ad hoc network data transmission method based on neighborhood strong connectedness | |
| CN105101086B (en) | A kind of data transfer path system of selection based on traffic density distribution | |
| CN106060888B (en) | One kind being based on the central VANET cluster routing method of complex network | |
| CN105246119B (en) | A kind of the singlecast router retransmission method and device of vehicular ad hoc network | |
| CN106131161A (en) | Under a kind of urban environment, vehicle-mounted road based on stability sub-clustering is by protocol method | |
| CN105246117B (en) | A kind of implementation method of the energy-saving routing protocol suitable for mobile wireless Sensor Network | |
| CN105933947A (en) | Routing method for greedy geographical routing protocol tangent switching hole processing | |
| CN100471166C (en) | Distribution type QoS multi-broadcast routing method based on mobile Ad Hoc network | |
| Qiu et al. | Robustness Optimization for IoT Topology | |
| Abdulsaheb et al. | Improving ad hoc network performance by using an efficient cluster based routing algorithm | |
| Abuashour | An efficient Clustered IoT (CIoT) routing protocol and control overhead minimization in IoT network | |
| CN102420730B (en) | Safety topology construction method of high-speed mobile node | |
| Eslaminejad et al. | Classification of Energy-Efficient Routing Protocols for Wireless Sensor Networks. | |
| CN103974372B (en) | Delay tolerant network routing method based on fuzzy reasoning | |
| CN106713477A (en) | Internet of Vehicles network dynamic evolution method based on population competition | |
| Youneng et al. | A Comparative Study Cluster-Based Routing Protocols in VANETs for City Environment | |
| Ilyas et al. | A survey on the fundamental and advanced mobile ad hoc network routing protocols | |
| Hamatta et al. | Protocols in mobile ad-hoc networks: a review | |
| Dong et al. | Topology control mechanism based on link available probability in aeronautical ad hoc network | |
| Dhakan et al. | The role of social structures in mobile ad-hoc networks | |
| CN106028415A (en) | Routing method of delay tolerant network for applications of Internet of Things | |
| Pitchai et al. | Game theoretical computation based energy efficient routing for wireless sensor networks |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |