CN107040884B - Mobile ad hoc network data transmission method based on strong neighborhood connectivity - Google Patents
Mobile ad hoc network data transmission method based on strong neighborhood connectivity Download PDFInfo
- Publication number
- CN107040884B CN107040884B CN201611048618.0A CN201611048618A CN107040884B CN 107040884 B CN107040884 B CN 107040884B CN 201611048618 A CN201611048618 A CN 201611048618A CN 107040884 B CN107040884 B CN 107040884B
- Authority
- CN
- China
- Prior art keywords
- route
- probability
- node
- nodes
- connectivity
- 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.)
- Active
Links
Images
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 mobile ad hoc network data transmission method based on neighborhood connectivity, which comprises the following steps: judging the connection probability between the nodes in a certain time interval according to the position information and the speed information of the mobile ad hoc network to establish a probability graph network model; storing the neighbor node set and the communication probability between the neighbor nodes by using the probability graph network model established in the previous step, discovering the route through hop count and route communication rate according to a route discovery algorithm MDSR, and finally returning a plurality of routes; according to the rapid movement characteristic of nodes in the mobile ad hoc network, clustering of a node set is carried out based on neighborhood connectivity, routes are screened from a plurality of discovered routes according to cluster subsections, the routes are selected according to the connectivity probability among the nodes and the connectivity among the nodes and the neighborhood, a complete route is formed after the routes are combined based on the selected sections, and finally the data forwarding is completed. The invention reduces the data transmission delay and improves the reliability of data forwarding.
Description
Technical Field
The invention belongs to the field of mobile ad hoc networks, and particularly relates to a mobile ad hoc network data transmission method based on neighborhood strong connectivity.
Background
In recent years, Mobile Ad hoc networks (MANETs) have been widely used in various industries. Many of the routing algorithms originally designed for wireless ad hoc networks were around energy consumption. However, the energy consumption of more and more practical application forms of the mobile ad hoc network is not very concerned, and how to reliably and quickly transmit data under the condition of quick movement is the core of the problem. Such as vehicle ad hoc networks and social mobile networks, nodes in these networks can provide continuous energy, but there is a higher demand for speed and reliability of data transmission, because users of these networks are people, and although data is transmitted from node to node, the users of the data are owners holding the nodes. This is very different from the theoretical environment of the original wireless ad hoc network. Therefore, assuming that the energy consumption of the nodes in the network is not considered as a main factor, the corresponding data transmission strategy also needs to be changed accordingly.
Disclosure of Invention
The purpose of the invention is as follows: in order to solve the problems in the prior art, the invention provides a mobile ad hoc network data transmission method based on the strong connectivity of the neighborhood, which can reduce the data transmission delay and improve the reliability of data forwarding.
The technical scheme is as follows: a mobile ad hoc network data transmission method based on neighborhood strong connectivity comprises the following steps:
(1) network modeling based on the connection probability, and judging the connection probability between nodes in a certain time interval through the position information and the speed information of the mobile ad hoc network to establish a probability graph network model;
(2) storing a neighbor node set and the communication probability between the neighbor node set and the neighbor node by using the probability graph network model established in the step (1), finding a route through hop count and route communication rate according to a route discovery algorithm MDSR, and returning a plurality of routes;
(3) clustering a node set based on neighborhood connectivity according to the rapid movement characteristic of nodes in the mobile ad hoc network, screening routes in a plurality of routes returned in the step (2) according to cluster subsections, selecting the routes according to the connectivity probability among the nodes and the connectivity among the nodes and the neighborhoods, forming a complete route based on the combination of the selected section routes, and finally finishing the transmission and the forwarding of data.
The route discovery algorithm MDSR in the step (2) is specifically:
when a source node initiates route discovery, according to the probability graph network model established in the step (1), the node broadcasts information (ID, x, y, v), after discovering neighbor nodes according to the broadcast information, the node calculates the communication probability between the node and the neighbor nodes and records the communication probability locally, the neighbor node set of the node i is recorded as N (i), a route from the source node to a destination node is formed between the neighbor nodes in a response mode, and the destination node returns a plurality of routes;
definition 1: probability of route connectivity, assuming that the route L is made up of nodes 1,2,3, …, i, p1,p2,…,pi-1The connection probability of the route L is defined as the connection probability value of the edge contained in the route L
When p (l) is 1, the distance between two adjacent nodes on the route is smaller than the communication distance; setting a hop threshold H and a route connection probability threshold P according to the moving speed of the node; returning the routes meeting the two thresholds to the source node, and caching all the route information meeting the conditions; when the set route connectivity is 1, the selection of the regular route is degraded.
The clustering of the node set based on neighborhood connectivity in the step (3) specifically comprises: the route is divided into sections from the angle of strong communication, so that the probability of route failure is reduced; from the perspective of graph connectivity, the graph of cached routes is at least a 1-connectivity graph; assuming that all the nodes included in the routes discovered and cached in step (2) are denoted as V ═ 1,2, …, k, and assuming that the source node is 1 and the destination node is k, let C be1＝N(1)∪{1}，C2N (k) u { k }. Let V' ═ V \ V (C)1)∪V(C2) For any node j ∈ V', if | V (C)1) N (j) | ≧ V' #N (j) |, or | V (C)2) andU N (j) | is more than or equal to | V'. N (j) |; without loss of generality, assume | V (C)1) If N (j) is greater than or equal to | V'. N (j) |, let C1＝C1∪{j}，V'＝V\(V(C1)∪V(C2) Repeating until no node is satisfied; if it is final
The clustering process is ended, C1,C2Namely the final two clusters; if it is notV' repeats the above process until all nodes are grouped into a cluster;
in the step (3), the route is selected according to the connectivity probability between the nodes and the connectivity between the nodes and the neighboring domains, specifically: suppose all clusters are labeled C1,C2,…,CmRouting is performed in each cluster; suppose L1,L2,…,LmAre respectively C1,C2,…,CmThe first route is selected preferentially, and the conditions are as follows:
P(Li) Max { p (L) | L is cluster CiArbitrary route of (1)
And H (P (L)i) Min { H (p (L)) | L is cluster CiAny route satisfying equation (1) in (b); l is1,L2,…,LmOptionally selecting an edge with the maximum communication probability to transmit the inter-cluster messages, forming a cyclic structure of intra-cluster transmission and inter-cluster transmission, and finally combining the intra-cluster route with the inter-cluster route to form the whole route.
Has the advantages that: compared with the prior art, the method provided by the invention is more in line with the actual environment, the routing discovery and the routing selection are more pertinent, and the environment can be simulated more truly by carrying out network modeling based on the connectivity probability among the nodes; improving DSR to obtain a routing discovery algorithm MDSR by using the advantage that the energy consumption of the nodes is not limited; and meanwhile, clustering is carried out based on neighborhood connectivity, and routing selection is carried out according to cluster subsections. Finally, the data transmission delay can be reduced, and the reliability of data forwarding is improved.
Drawings
Fig. 1(a) and 1(b) are schematic diagrams of network modeling based on connectivity probability in the present invention.
Detailed Description
The following describes embodiments of the present invention in detail with reference to the accompanying drawings;
the invention discloses a mobile ad hoc network data transmission method based on neighborhood strong connectivity, which comprises the following steps:
1. network modeling based on the connection probability, and performing network modeling by judging the connection probability between nodes in a certain time interval based on the position information and the speed information of the mobile ad hoc network;
2. based on the established probability graph network model, storing a neighbor node set and the communication probability between the neighbor node set and the neighbor node, and obtaining a plurality of routes according to the proposed route discovery algorithm MDSR, wherein the algorithm is mainly based on the thought of DSR, is obtained by combining the improvement of the advantages of the mobile ad hoc network with the nodes moving fast and having no strict limit on energy consumption, and finally returns a plurality of routes;
3. according to the fast moving characteristic of the mobile ad hoc network, clustering of a node set is carried out based on neighborhood connectivity, routes are screened in a plurality of discovered routes according to cluster subsections, the routes are selected according to the connectivity probability among the nodes and the connectivity probability of the routes, a complete route is formed after the selected routes are combined, and finally, data transmission and forwarding are completed.
Table 1 relevant parameters used in the invention
(1) Network modeling based on connectivity probabilities.
As shown in fig. 1(a) and 1(b), the network modeling method based on the connectivity probability is different from the establishment of the conventional graph model. In fig. 1(a), circles represent nodes in the network, numbers in the circles represent numbers of the nodes, a dotted line between the circles represents a straight line connecting two points, and a numerical value on the dotted line represents the shortest distance between the two points, and the unit is m. FIG. 1(b) is different from FIG. 1(a)In that the distance is modified to be the connectivity probability. Assuming that the communication radius is 10m and the threshold value of the connection probability is set to 0.6, the distance ratio between the communication radius and the two is less than 0.6 for nodes 1 and 4, so that the edge does not exist. The relationship between a node and a node is represented not by a simple 0, 1 but by a connected probability value. Let G ═ (V, E, W) be the established network model, where V ═ V1,v2,…,vnThe elements in the } represent nodes in the network; e ═ E1,e2,…,emThe element in the graph represents an edge which may exist between a node and a node in the network, and an edge exists between the two nodes if and only if the connection probability between the two nodes is not less than a set threshold; w ═ p1,p2,…,pmThe element in (j) represents the probability value of the connection between two points by an edge, and piAnd ≧ p, i ≧ 1,2, …, m is a threshold value set as necessary.
Definition 1 (connection probability) the connection probability between two points is defined as
It can be seen that piThe larger the transmission data success rate. Here, the probability of connectivity is different from the probability value in the general sense, and is allowed to exceed 1 if p is definediCannot exceed 1 and the limit p is 1, the model will degrade to a conventional graph model.
(2) The route discovery algorithm MDSR (modified Dynamic Source routing).
The route discovery algorithm MDSR evolved from DSR. The core idea is inspired by DSR, the first request of route discovery is also carried out as required, but the core idea is different from DSR in that energy consumption is not taken as a main consideration, so that more information is stored and more information is calculated during route discovery. Thereby laying a good foundation for the routing of the third part.
When a source node initiates route discovery, the node broadcasts (ID, x, y, v), according to the process of network modeling in the step (1), after discovering neighbor nodes, the node calculates the connection probability between the node and the neighbor nodes and records the connection probability locally, the neighbor node set of the node i is recorded as N (i), and a route from the source node to a destination is formed between the neighbor nodes in a response mode. In the DSR, in order to save energy expenditure and reduce energy consumption brought by maintenance of a plurality of routes, one route is cached mainly, and when the route fails, route discovery is initiated to search for a new route. A disadvantage of such an approach in fast moving ad hoc networks is that more time is spent on constantly finding routes. DSR is applicable when the node is stationary or the node is moving slower. However, when the node moves fast and the topology changes frequently, the timeliness cannot be achieved. The destination node may return multiple routes when finding a route in the present invention. Since the node information includes the position information and the speed information, even if data in the neighbor node is not included, the position information of the node on the route is available, and the connection probability between arbitrary nodes can be calculated.
Definition 1 (route connectivity probability) assume that the route L is made up of nodes 1,2,3, …, i, p1,p2,…,pi-1The connection probability of the route L is defined as the connection probability value of the edge contained in the route L
It can be seen that when p (l) is 1, it means that the distance between two adjacent nodes on the route is smaller than the communication distance, so that here, the route connectivity probability is a generalization of the conventional route definition. And setting a threshold value H of hop count and a threshold value P of route connection probability according to the moving speed of the node. And returning the routes meeting the two thresholds to the source node, and caching all the route information meeting the conditions. This facilitates rapid discovery of new routes to replace failed routes when nodes move rapidly. When the set route connectivity is 1, it is degenerated to the selection of the regular route. Retaining routes that meet the threshold condition is because nodes moving quickly can cause route connectivity to change quickly so that an available route can be quickly selected among the cached routes when the current route fails.
(3) Routing method, see algorithm in table 2.
The process is divided into two stages: node clustering based on neighborhood connectivity and cluster-based routing.
Node clustering: in a fast moving network, the position change between the adjacent nodes is fast, so the invention divides the route into sections from the angle of strong communication, and reduces the probability of route failure. From the perspective of graph connectivity, the graph of cached routes is at least a 1-connectivity graph. Assuming that all the nodes included in the routes discovered and cached in step (2) are denoted as V ═ 1,2, …, k, and assuming that the source node is 1 and the destination node is k, let C be1＝N(1)∪{1}，C2N (k) u { k }. Let V' ═ V \ V (C)1)∪V(C2) For any node j ∈ V', if | V (C)1) N (j) | ≧ V' #N (j) |, or | V (C)2) Andu N (j) | ≧ V' anduN (j) |. Without loss of generality, assume | V (C)1) If N (j) is greater than or equal to | V'. N (j) |, let C1＝C1∪{j}，V'＝V\(V(C1)∪V(C2) Repeat this process until there are no satisfied nodes. If it is final
The clustering process is ended, C1,C2I.e. the final two clusters. If it is not
V' repeats the above process until all nodes are grouped in a cluster. As the cluster division is carried out by using the guiding idea of close inter-cluster sparsity in the cluster in the process of clustering the route, a plurality of paths are selectable for data transmission in each cluster, and the hop count is small, thereby ensuring the multi-route and the reliability of data transmission in the cluster.
Routing based on clustering: suppose all clusters are labeled C1,C2,…,CmRouting is performed within each cluster. Suppose L1,L2,…,LmAre respectively C1,C2,…,CmThe first route is selected preferentially, and the conditions are as follows:
P(Li) Max { p (L) | L is cluster CiArbitrary route of (1)
And H (P (L)i) Min { H (p (L)) | L is cluster CiArbitrary routing satisfying equation (1) in. L is1,L2,…,LmOptionally selecting an edge with the maximum connection probability to carry out inter-cluster message transmission. And a cyclic structure of intra-cluster transmission and inter-cluster transmission is formed, and finally the intra-cluster route is combined with the inter-cluster route to form the whole route. The route with the highest route connection probability and the smallest hop number is selected in the cluster, so that the route is ensured not to fail in a short time, and the route does not need to be selected. Even if the routing fails, because the connectivity in the clusters is high, replaceable available routing exists, rapid transmission of data between the clusters is guaranteed, the data can be transmitted only by selecting one node from two adjacent clusters, and the edge with the highest edge connectivity probability is selected, so that the success probability of data transmission between the clusters is greatly improved. Generally, such a routing manner trades off the stability and timeliness of data transmission with more occupied memory and more computation.
The invention fully utilizes the advantages of the node from the characteristic of quick movement of the node, uses the core thought of DSR for reference, and avoids the routing failure caused by quick movement in the routing process. Therefore, compared with the prior art, the model of the invention is more in line with the actual environment, reduces the data transmission delay and improves the reliability of data forwarding.
Claims (1)
1. A mobile ad hoc network data transmission method based on neighborhood strong connectivity is characterized by comprising the following steps:
(1) network modeling based on the connection probability, and judging the connection probability between nodes in a certain time interval through the position information and the speed information of the mobile ad hoc network to establish a probability graph network model;
(2) storing a neighbor node set and the communication probability between the neighbor node set and the neighbor node by using the probability graph network model established in the step (1), finding a route through hop count and route communication rate according to a route discovery algorithm MDSR, and returning a plurality of routes;
(3) clustering a node set based on neighborhood connectivity according to the rapid movement characteristic of nodes in the mobile ad hoc network, screening routes in a plurality of routes returned in the step (2) according to cluster subsections, selecting the routes according to the connectivity probability among the nodes and the connectivity among the nodes and the neighborhoods, forming a complete route based on the combination of the selected section routes, and finally finishing the transmission and the forwarding of data;
the route discovery algorithm MDSR in the step (2) is specifically:
when a source node initiates route discovery, according to the probability graph network model established in the step (1), node broadcast information (ID, x, y, v) comprises the serial number ID of the node at the current moment, the position x, y and the speed v, the node discovers a neighbor node according to the received broadcast information, then calculates the communication probability between the node and the neighbor node and records the communication probability locally, the neighbor node set of the node i is recorded as N (i), a route from the source node to a destination node is formed between the neighbor nodes in a response mode, and a plurality of routes are returned by the destination node;
definition 1: probability of route connectivity, assuming that the route L is made up of nodes 1,2,3, …, i, p1,p2,…,pi-1The connection probability of the route L is defined as the connection probability value of the edge contained in the route L
When p (l) is 1, the distance between two adjacent nodes on the route is smaller than the communication distance; setting a hop threshold H and a route connection probability threshold P according to the moving speed of the node; returning the routes meeting the two thresholds to the source node, and caching all the route information meeting the conditions; when the set route connectivity is 1, the selection is degraded to the conventional route;
the clustering of the node set based on neighborhood connectivity in the step (3) specifically comprises: the route is divided into sections from the angle of strong communication, so that the probability of route failure is reduced; from the perspective of graph connectivity, the graph of cached routes is at least a 1-connectivity graph; assuming that all the nodes included in the routes discovered and cached in step (2) are denoted as V ═ 1,2, …, k, and assuming that the source node is 1 and the destination node is k, let C be1＝N(1)∪{1}，C2N (k) u { k }, let V' ═ V \ V (C)1)∪V(C2) For any node j ∈ V', if | V (C)1) N (j) | ≧ V' #N (j) |, or | V (C)2) andU N (j) | is more than or equal to | V'. N (j) |; without loss of generality, assume | V (C)1) If N (j) is greater than or equal to | V'. N (j) |, let C1＝C1∪{j}，V'＝V\(V(C1)∪V(C2) Repeating until no node is satisfied; if it is final
The clustering process is ended, C1,C2Namely the final two clusters; if it is not
V' repeats the above process until all nodes are grouped into a cluster;
in the step (3), the route is selected according to the connectivity probability between the nodes and the connectivity between the nodes and the neighboring domains, specifically: suppose all clusters are labeled C1,C2,…,CmRouting is performed in each cluster; suppose L1,L2,…,LmAre respectively C1,C2,…,CmThe first route is selected preferentially, and the conditions are as follows:
P(Li) Max { p (L) | L is cluster CiArbitrary route of (1)
And H (P (L)i) Min { H (p (L)) | L is cluster CiAny route satisfying equation (1) in (b); l is1,L2,…,LmOptionally selecting an edge with the maximum communication probability to transmit the inter-cluster messages, forming a cyclic structure of intra-cluster transmission and inter-cluster transmission, and finally combining the intra-cluster route with the inter-cluster route to form the whole 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 CN107040884A (en) | 2017-08-11 |
| CN107040884B true 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) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020174737A1 (en) * | 2019-02-25 | 2020-09-03 | 株式会社Ｎｔｔドコモ | Device management system |
| CN110139400A (en) * | 2019-05-23 | 2019-08-16 | 烟台艾易新能源有限公司 | A kind of silo ambient intelligence monitoring system design method |
| CN111277497B (en) * | 2020-03-18 | 2021-09-21 | 常熟理工学院 | Method for realizing network service deployment and discovery based on distribution |
| CN112468963B (en) * | 2020-11-27 | 2023-05-05 | 北京信息科技大学 | Method, device, equipment and storage medium for repairing connectivity of wireless sensor network |
Citations (4)
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9464908B2 (en) * | 2014-09-10 | 2016-10-11 | 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 (4)
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107040884A (en) | 2017-08-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hassanabadi et al. | Clustering in vehicular ad hoc networks using affinity propagation | |
| Nocetti et al. | Connectivity based k-hop clustering in wireless networks | |
| Jain et al. | Geographical routing using partial information for wireless ad hoc networks | |
| CN107040884B (en) | Mobile ad hoc network data transmission method based on strong neighborhood connectivity | |
| CN111741448B (en) | Clustering AODV (Ad hoc on-demand distance vector) routing method based on edge computing strategy | |
| Wang et al. | TIBCRPH: traffic infrastructure based cluster routing protocol with handoff in VANET | |
| CN108234316B (en) | A kind of unmanned plane network route selecting method based on cubic space region division | |
| Rahman et al. | Notice of violation of IEEE publication principles: clustering schemes in MANETs: performance evaluation, open challenges, and proposed solutions | |
| CN107105389B (en) | Geographic information routing method based on road topological structure in vehicle-mounted network | |
| Amiri et al. | Retracted article: Improved AODV based on Topsis and fuzzy algorithms in vehicular ad-hoc networks | |
| Khatri et al. | Performance study of ad-hoc reactive routing protocols | |
| CN108834100A (en) | A kind of efficient broadcast routing method | |
| Basarkod et al. | Mobility based estimation of node stability in MANETs | |
| Ortiz et al. | Intelligent route discovery for ZigBee mesh networks | |
| Liu et al. | A stability-considered density-adaptive routing protocol in MANETs | |
| CN109803342A (en) | A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission | |
| Rasheed et al. | Protocol independent adaptive route update for VANET | |
| Feyzi et al. | Application of fuzzy logic for selecting the route in AODV routing protocol for vehicular ad hoc networks | |
| CN109714260B (en) | Implementation method for building virtual backbone network based on UCDS algorithm in OLSR routing protocol | |
| Monika et al. | Border-node based movement aware routing protocol | |
| Ramachandran et al. | An intersection based traffic aware routing with low overhead in vanet | |
| Kouvatsos et al. | Broadcasting methods in mobile ad hoc networks: an overview | |
| CN111601351B (en) | Gateway node selection method, node, device and medium | |
| Sharma et al. | An extensive survey on different routing protocols and issue in VANETs | |
| Ding et al. | A ber and 2-hop routing information-based stable geographical routing protocol in manets for multimedia applications |
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 |