CN106973422B - Improved algorithm of DSR protocol - Google Patents
Improved algorithm of DSR protocol Download PDFInfo
- Publication number
- CN106973422B CN106973422B CN201710123177.4A CN201710123177A CN106973422B CN 106973422 B CN106973422 B CN 106973422B CN 201710123177 A CN201710123177 A CN 201710123177A CN 106973422 B CN106973422 B CN 106973422B
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- route
- nodes
- list
- 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
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- 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)
Abstract
The invention discloses an improved algorithm of a DSR (dedicated short range communication) protocol, which is characterized in that on the basis of the DSR protocol, a clustering algorithm is used for dividing network nodes into a plurality of mutually disjoint clusters, an identification mechanism is introduced, each cluster is allocated with a unique identification during formation, a route discovery process is only carried out in a backbone network, an obtained source route is composed of a cluster identification sequence, and nodes in the same cluster can cooperatively send data packets to the next cluster designated by the source route. According to the invention, the network is divided into clusters, and the route discovery is only carried out in the virtual backbone network, so that unnecessary nodes are reduced for grouping and forwarding the route request, and the flooding efficiency is improved; meanwhile, the source route obtained by route discovery only records the cluster identification sequence, so that the route size is reduced, and the protocol expansibility is improved; and a plurality of node paths can be indirectly provided, and the reliability of routing is improved.
Description
Technical Field
The invention relates to the field of wireless sensor networks, in particular to an improved algorithm of a DSR protocol.
Background
Since the birth of the first small network ARPANET, people have enjoyed various conveniences brought by network technology. Due to the fact that the application range is limited by the wired communication mode, the wireless network becomes an active research field of information technology science. A Mobile Ad Hoc network (MANET) is a centerless multi-hop wireless communication network formed by self-organizing a plurality of wireless Mobile terminals, and can help Mobile users to realize network service in an area without infrastructure, thereby widening the application range of the Mobile communication network. For emergency or temporary occasions such as military battlefields, emergency disaster relief, field investigation and the like where communication facilities are inconvenient to deploy, the mobile ad hoc network plays an important role, and is the only selectable communication support mode. The mobile ad hoc network supports the free networking of the wireless terminal, basically realizes the good desire of people to freely communicate anytime and anywhere, has very wide application scenes and technical advantages in the military field and the civil field, and makes the mobile ad hoc network become an attractive choice in the field of future wireless communication.
However, while good characteristics are obtained, mobile ad hoc networks also increase the complexity of their network-related designs. The problems of strong mobility, no fixed topology, limited resources and the like of the mobile ad hoc network need to be researched and solved. Among them, the routing protocol problem of the network layer is the most critical. DSR is a typical on-demand adaptive routing protocol, and is mainly characterized in that a source routing mode is adopted, data packets to be sent all contain source routes, and path information (node address sequences) formulated strictly along the source routes is forwarded to a sink hop by hop. The DSR protocol also uses a route caching technology, and the nodes acquire the latest route information for future needs in a way of overhearing or forwarding and the like, so that the route discovery efficiency is improved.
Although the DSR protocol has been well characterized and widely used and recognized, there are still disadvantages, such as: the DSR protocol searches for routes in a flooding mode, and each node participates in forwarding of routing request packets, so that large control overhead and resource waste are introduced; each data packet must be embedded with complete routing information, causing additional routing overhead; any movement of a node causes stale routes in the cache to affect the accuracy of the source route, resulting in frequent route failures.
Disclosure of Invention
The technical problem to be solved by the invention is to provide an improved algorithm of the DSR protocol aiming at the defects that each node participates in the forwarding of the routing request packet, and the control overhead and the resource waste are large in the prior art.
The technical scheme adopted by the invention for solving the technical problems is as follows:
the invention provides an improved algorithm of a DSR protocol, which comprises the following steps:
s1, dividing the network nodes into a plurality of clusters which are mutually irrelevant through a clustering algorithm, introducing an identification mechanism, and distributing a unique identification for each cluster when the clusters are formed; the cluster identification is formed by a cluster head node ID, is generated by a cluster head node and is transmitted in a cluster through broadcast messages, and all nodes in the same cluster have the same cluster identification;
s2, when a source node in the network nodes communicates with a target node, checking whether a route reaching the target node exists in a route cache of the source node, if so, establishing the route for data transmission; otherwise, broadcasting the RREQ packet to all neighbor nodes of the source node, and starting a route discovery process;
s3, after receiving the RREQ packet, the node checks whether the < scrAddr, reqID > sequence pair contained in the RREQ packet exists in the route request list where the node is located, if yes, the node processes the RREQ packet, and then directly discards the RREQ packet; then checking whether the cluster identifier of the node appears before other cluster identifiers recorded in the routing list in the RREQ grouping, and if so, directly discarding the node; otherwise, starting the checking process of the destination node;
s4, checking whether the node is a destination node, if so, the route request is successful, the node generates a RREQ packet which comprises a route table copied from the original RREQ packet, deletes the original RREQ packet, then reaches the source node along the reverse route in the route table, carries out data transmission according to the established route, and a plurality of nodes in the same cluster coordinate to send the data packet to the next cluster appointed by the route.
Further, the method for checking whether the node is the destination node in step S4 of the present invention further includes: if the node is not the destination node, judging whether the node is a cluster head or has a gateway function, and if the node is not the cluster head and does not have the gateway function, directly discarding the node; and if the cluster head or the gateway function is available, recording the node cluster identification into a routing list in the RREQ packet, and continuously broadcasting the updated routing request packet.
Further, the route discovery process in step S2 of the present invention is performed only in the backbone network, the obtained source route is composed of a cluster identification sequence, and the nodes in the same cluster can cooperate to send the data packet to the next cluster designated by the source route.
Further, the algorithm of the present invention also includes a method for maintaining cluster member nodes:
the nodes update and maintain the cluster member nodes by interacting with periodic Hello messages and utilizing the information extracted from the messages:
the node considers that the connection between the nodes is interrupted and relevant information of the corresponding node in a neighbor list is deleted if the node does not receive Hello messages sent by the neighbor nodes in two consecutive Hello-intervals periods, and the neighbor list records a data structure of a neighbor node ID, a state and a cluster identifier;
when the cluster member cannot receive the message sent by the cluster head within the specified time, the state of the cluster member is converted into an undetermined state and then the cluster member is distributed again;
in the moving process of the cluster head, when the cluster head detects that the cluster head is completely disconnected with a certain adjacent cluster, the cluster head sends a state updating list to the cluster members to try to abandon the role of the cluster head, then the cluster members wait for replying to confirm the replacement of the role, the cluster head role is replaced by the proper cluster members, and otherwise, the current state is kept unchanged;
and under the condition that the cluster head is successfully changed, the new cluster head keeps the original cluster identifier unchanged, so that the stability of the clustering network is kept.
Further, the criteria used in the process of selecting the new cluster head of the present invention are specifically:
the first standard: selecting nodes with the largest number of connectable adjacent clusters from the cluster member nodes, wherein the number of the adjacent clusters to which the selected nodes can be connected is more than that of the current cluster head;
and a second standard: and if a plurality of cluster member nodes meet the criterion one, selecting a node with the maximum number of adjacent nodes.
Further, the algorithm of the present invention further includes a method for updating a gateway list, specifically:
the nodes update and maintain the gateway list by interacting periodic Hello messages and utilizing the information extracted from the Hello messages;
after receiving the Hello message, the node x firstly checks whether the neighbor list records the neighbor node information carried in the Hello message, secondly determines whether to update the cluster adjacency list x.CC L and the gateway list x.GW L of the node according to the neighbor node cluster identification, and finally determines whether to update the gateway list x.GW L of the node by inquiring the cluster adjacency list hello.CC L table of the neighbor node through the Hello message;
wherein the gateway comprises nodes belonging to different clusters and located within communication range of each other, for communication between adjacent clusters; the gateway list records cluster identifications of adjacent clusters to which the nodes can be connected, IDs of gateway nodes through which the connection of the specified leading cluster passes and data structures of the identifications of the gateway nodes, and each node maintains a gateway list.
Further, the algorithm of the present invention further includes a method for updating a gateway list, specifically:
after receiving the Hello message, the node x firstly checks whether the neighbor node information carried in the Hello message is recorded in the neighbor list or not, secondly determines whether the cluster adjacency list x.CC L and the gateway list x.GW L of the node are updated or not according to the neighbor node cluster identification, and finally determines whether the gateway list x.GW L of the node is updated or not by inquiring the cluster adjacency list hello.CC L of the neighbor node through the Hello message.
Further, the method for data transmission in step S4 of the present invention specifically includes:
each data packet carries a source route formed by a cluster identification sequence to guide the transmission of the data packet, the cluster identification route is used for determining a cluster which is required to pass through in sequence when the data packet reaches a destination node from a source node, the node firstly determines the next appropriate forwarding node according to a gateway list and the identification route carried by the packet, and during data transmission, if a plurality of forwarding nodes which reach an adjacent cluster exist in the gateway list of the node, the node is selected according to the following priority:
the priority is one: preferentially selecting a node in a cluster identifier appointed neighbor cluster as a next hop node;
and the priority is two: and if at least two nodes meeting the priority level one still exist in the gateway list, selecting the node with the minimum ID as a next hop node.
Further, the algorithm of the present invention further includes a method for maintaining the route, specifically:
the node re-determines another suitable forwarding node according to the local gateway list and the cluster identification sequence in the data packet, namely, a new link is found for substitution;
if no other nodes meeting the conditions exist and the current node is not a cluster member, sending the data packet to the cluster head of the current node, searching other nodes meeting the requirements by the cluster head, and transmitting the data packet to the next cluster;
otherwise, the links between the adjacent clusters are all disconnected, and a routing error packet RERR is sent to the source node to inform the source node of the routing failure condition; after receiving the routing request, the source node deletes the corresponding route from the route cache of the source node, and determines whether the route discovery process needs to be restarted or not by inquiring the route cache of the source node.
The invention has the following beneficial effects: according to the DSR protocol improvement algorithm, the network is divided into clusters, and route discovery is only carried out in the virtual backbone network, so that unnecessary nodes are reduced for grouping and forwarding the route request, and the flooding efficiency is improved; meanwhile, the source route obtained by route discovery only records the cluster identification sequence, so that the route size is reduced, and the protocol expansibility is improved; a plurality of node paths can be indirectly provided, and the reliability of routing is improved; the clustering structure improves the network connectivity, a plurality of connections exist between adjacent clusters, when a certain link is detected to be disconnected, the redundant link can be used for local repair, the data packet delivery rate is improved, and the times of recalling the route discovery process are reduced.
Drawings
The invention will be further described with reference to the accompanying drawings and examples, in which:
FIG. 1 is a flow chart of a routing process of an embodiment of the present invention;
fig. 2 is a flowchart of a gateway list update algorithm according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
As shown in fig. 1, the improved algorithm of the DSR protocol of the embodiment of the present invention includes the following steps:
s1, dividing the network nodes into a plurality of clusters which are mutually irrelevant through a clustering algorithm, introducing an identification mechanism, and distributing a unique identification for each cluster when the clusters are formed;
s2, when a source node in the network nodes communicates with a target node, checking whether a route reaching the target node exists in a route cache of the source node, if so, establishing the route for data transmission; otherwise, broadcasting the RREQ packet to all neighbor nodes of the source node, and starting a route discovery process;
s3, after receiving the RREQ packet, the node checks whether the < scrAddr, reqID > sequence pair contained in the RREQ packet exists in the route request list where the node is located, if yes, the node processes the RREQ packet, and then directly discards the RREQ packet; then checking whether the cluster identifier of the node appears before other cluster identifiers recorded in the routing list in the RREQ grouping, and if so, directly discarding the node; otherwise, starting the checking process of the destination node;
s4, checking whether the node is a destination node, if so, the route request is successful, the node generates a RREQ packet which comprises a route table copied from the original RREQ packet, deletes the original RREQ packet, then reaches the source node along the reverse route in the route table, carries out data transmission according to the established route, and a plurality of nodes in the same cluster coordinate to send the data packet to the next cluster appointed by the route.
The embodiment of the invention provides an improved scheme aiming at the problems of the DSR protocol by combining the clustering idea, which comprises the following steps: on the basis of a DSR protocol, network nodes are respectively divided into a plurality of mutually disjoint clusters by using a clustering algorithm, an identification mechanism is introduced, each cluster is allocated with a unique identification during formation, a route discovery process is only carried out in a backbone network, an obtained source route is composed of a cluster identification sequence, and nodes in the same cluster can cooperatively send a data packet to the next cluster designated by the source route.
Each cluster is endowed with a unique identifier during creation, the cluster identifier is formed by cluster head node IDs, is generated by cluster head nodes and is transmitted in the cluster through broadcast messages, and all nodes in the same cluster have the same cluster identifier. Gateways are nodes belonging to different clusters but within communication range of each other for communication between adjacent clusters.
Gateway L ist, GW L records cluster identification of neighboring clusters to which a node can connect, ID of Gateway node through which the connection specifies leading cluster, and data structure of its identification, and each node i maintains a Gateway list i.gw L.
In terms of maintenance of the cluster: using new standards
The first standard: and selecting the node with the largest number of connectable adjacent clusters from the cluster member nodes, wherein the selected node can be connected to the node with the largest number of adjacent clusters, and the number of the adjacent clusters to which the selected node can be connected is more than that of the current cluster head.
And a second standard: and if a plurality of cluster member nodes meet the criterion one, selecting a node with the maximum number of adjacent nodes.
The improved scheme provides that the nodes do not receive Hello messages sent by Neighbor nodes in two consecutive Hello-Interval periods, the nodes are considered to have interrupted connection between the nodes and delete relevant information of corresponding nodes in a Neighbor list (Neighbor L ist, N L records a data structure of Neighbor node ID, state and cluster identification).
In terms of gateway list update:
after receiving the Hello message, the node x firstly checks whether the neighbor node information carried in the Hello message is recorded in the neighbor list, secondly determines whether to update the cluster adjacency list x.cc L and the gateway list x.gw L of the node according to the neighbor node cluster identification, and finally determines whether to update the gateway list x.gw L of the node by inquiring the cluster adjacency list hello.cc L table of the neighbor node through the Hello message.
In terms of the route discovery process:
after receiving the RREQ packet, the node first checks whether the < scrAddr, reqID > sequence pair contained in the RREQ packet exists in the route request list where the node is located, and if so, the RREQ packet is directly discarded without any processing, which indicates that the node has processed the RREQ packet. Secondly, whether the cluster identification of the node appears before other cluster identifications recorded in the routing list in the RREQ packet is checked again, and if the cluster identification of the node appears before other cluster identifications recorded in the routing list in the RREQ packet, the cluster identification of the node is directly discarded. Then checking whether the node is a destination node, if so, the route request is successful, the node generates an RREQ packet which contains a route table copied from the RREQ, deletes the RREQ packet and then reaches a source node along a reverse route in the route table; otherwise, if the node is the cluster head or has the gateway function, the node cluster identification is recorded in the route list in the RREQ packet, and the updated route request packet is continuously broadcast.
In terms of data transmission:
each data packet carries a source route formed by a cluster identification sequence to guide the transmission of the data packet. Because the cluster identification route can only determine the clusters that the data packets need to pass through in sequence from the source node to the destination node, the node must first determine the next appropriate forwarding node according to the gateway list and the identification route carried by the packets. When data is transmitted, if a plurality of forwarding nodes reaching the adjacent cluster exist in the node gateway list, selecting according to the following priority:
the priority is one: preferentially selecting a node in a cluster identifier appointed neighbor cluster as a next hop node;
and the priority is two: and if at least two nodes meeting the priority level one still exist in the gateway list, selecting the node with the minimum ID as a next hop node.
In terms of route maintenance:
1. and the node re-determines another proper forwarding node according to the local gateway list and the cluster identification sequence in the data packet, namely finding a new link for replacement.
2. And if no other nodes meeting the conditions exist and the current node is not a cluster member, sending the data packet to the cluster head of the current node, searching other nodes meeting the requirements by the cluster head, and transmitting the data packet to the next cluster.
3. Otherwise, the link between the adjacent clusters is completely disconnected, and a routing error packet RERR is sent to the source node to inform the source node of the routing failure condition. After receiving the routing request, the source node deletes the corresponding route from the route cache of the source node, and determines whether the route discovery process needs to be restarted or not by inquiring the route cache of the source node.
In another embodiment of the present invention, the steps of implementing the algorithm are:
step1, writing an OTel script. The configuration of network topology and service model parameters and other auxiliary processes are completed through an OTel script, a protocol agent (including the establishment of a communication service volume model and the protocol binding of nodes) is established, a Trace object is set so as to store the data of each step in the whole simulation process, and the running time of simulation is set.
Step2, interpreting and executing the OTel script written in Step1 by using NS2, and obtaining a Trace file with a large amount of data recorded.
Step3, the Trace file obtained in Step2 was processed and analyzed by using Gawk tool in NS2, and useful data was obtained.
Step4, drawing the data obtained in Step3 by using a drawing tool, and obtaining the performance of the network.
Compared with the traditional DSR protocol, the invention has the following advantages:
and (3) route discovery process: by dividing the network into clusters, the route discovery is only carried out in the virtual backbone network, thereby reducing unnecessary nodes for grouping and forwarding the route request and improving the flooding efficiency; meanwhile, the source route obtained by route discovery only records the cluster identification sequence, so that the route size is reduced, and the protocol expansibility is improved; and a plurality of node paths can be indirectly provided, and the reliability of routing is improved.
And (3) route maintenance process: the clustering structure improves the network connectivity, a plurality of connections exist between adjacent clusters, when a certain link is detected to be disconnected, the redundant link can be used for local repair, the data packet delivery rate is improved, and the times of recalling the route discovery process are reduced.
It will be understood that modifications and variations can be made by persons skilled in the art in light of the above teachings and all such modifications and variations are intended to be included within the scope of the invention as defined in the appended claims.
Claims (5)
1. An improved algorithm for a DSR protocol comprising the steps of:
s1, dividing the network nodes into a plurality of clusters which are mutually irrelevant through a clustering algorithm, introducing an identification mechanism, and distributing a unique identification for each cluster when the clusters are formed; the cluster identification is formed by a cluster head node ID, is generated by a cluster head node and is transmitted in a cluster through broadcast messages, and all nodes in the same cluster have the same cluster identification;
s2, when a source node in the network nodes communicates with a target node, checking whether a route reaching the target node exists in a route cache of the source node, if so, establishing the route for data transmission; otherwise, broadcasting the RREQ packet to all neighbor nodes of the source node, and starting a route discovery process;
s3, after receiving the RREQ packet, the node checks whether the < scrAddr, reqID > sequence pair contained in the RREQ packet exists in the route request list where the node is located, if yes, the node processes the RREQ packet, and then directly discards the RREQ packet; then checking whether the cluster identifier of the node appears before other cluster identifiers recorded in the routing list in the RREQ grouping, and if so, directly discarding the node; otherwise, starting the checking process of the destination node;
s4, checking whether the node is a destination node, if so, the route request is successful, the node generates an RREQ packet which comprises a route table copied from the original RREQ packet, deletes the original RREQ packet, then reaches a source node along a reverse route in the route table, carries out data transmission according to the established route, and a plurality of nodes in the same cluster coordinate to send the data packet to the next cluster appointed by the route;
the method for checking whether the node is the destination node in step S4 further includes: if the node is not the destination node, judging whether the node is a cluster head or has a gateway function, and if the node is not the cluster head and does not have the gateway function, directly discarding the node; if the cluster head or the gateway function is available, recording the node cluster identifier into a routing list in the RREQ packet, and continuously broadcasting the updated routing request packet;
the route discovery process in step S2 is performed only in the backbone network, the obtained source route is composed of a cluster identification sequence, and the nodes in the same cluster can cooperate to send the data packet to the next cluster designated by the source route;
the algorithm also comprises a method for maintaining the cluster member nodes:
the nodes update and maintain the cluster member nodes by interacting with periodic Hello messages and utilizing the information extracted from the messages:
the node considers that the connection between the nodes is interrupted and relevant information of the corresponding node in a neighbor list is deleted if the node does not receive Hello messages sent by the neighbor nodes in two consecutive Hello-intervals periods, and the neighbor list records a data structure of a neighbor node ID, a state and a cluster identifier;
when the cluster member cannot receive the message sent by the cluster head within the specified time, the state of the cluster member is converted into an undetermined state and then the cluster member is distributed again;
in the moving process of the cluster head, when the cluster head detects that the cluster head is completely disconnected with a certain adjacent cluster, the cluster head sends a state updating list to the cluster members to try to abandon the role of the cluster head, then the cluster members wait for replying to confirm the replacement of the role, the cluster head role is replaced by the proper cluster members, and otherwise, the current state is kept unchanged;
and under the condition that the cluster head is successfully changed, the new cluster head keeps the original cluster identifier unchanged, so that the stability of the clustering network is kept.
2. The DSR protocol improvement algorithm of claim 1 wherein the criteria used in selecting a new cluster head is specifically:
the first standard: selecting nodes with the largest number of connectable adjacent clusters from the cluster member nodes, wherein the number of the adjacent clusters to which the selected nodes can be connected is more than that of the current cluster head;
and a second standard: and if a plurality of cluster member nodes meet the criterion one, selecting a node with the maximum number of adjacent nodes.
3. The DSR protocol improvement algorithm of claim 1 further comprising means for updating a gateway list, specifically:
the nodes update and maintain the gateway list by interacting periodic Hello messages and utilizing the information extracted from the Hello messages;
after receiving the Hello message, the node x firstly checks whether the neighbor list records the neighbor node information carried in the Hello message, secondly determines whether to update the cluster adjacency list x.CC L and the gateway list x.GW L of the node according to the neighbor node cluster identification, and finally determines whether to update the gateway list x.GW L of the node by inquiring the cluster adjacency list hello.CC L table of the neighbor node through the Hello message;
wherein the gateway comprises nodes belonging to different clusters and located within communication range of each other, for communication between adjacent clusters; the gateway list records cluster identifications of adjacent clusters to which the nodes can be connected, IDs of gateway nodes through which the connection of the specified leading cluster passes and data structures of the identifications of the gateway nodes, and each node maintains a gateway list.
4. The DSR protocol improvement algorithm of claim 1, wherein the data transmission in step S4 is specifically performed by:
each data packet carries a source route formed by a cluster identification sequence to guide the transmission of the data packet, the cluster identification route is used for determining a cluster which is required to pass through in sequence when the data packet reaches a destination node from a source node, the node firstly determines the next appropriate forwarding node according to a gateway list and the identification route carried by the packet, and during data transmission, if a plurality of forwarding nodes which reach an adjacent cluster exist in the gateway list of the node, the node is selected according to the following priority:
the priority is one: preferentially selecting a node in a cluster identifier appointed neighbor cluster as a next hop node;
and the priority is two: and if at least two nodes meeting the priority level one still exist in the gateway list, selecting the node with the minimum ID as a next hop node.
5. The improved algorithm for DSR protocol of claim 1 further comprising means for maintaining a route, specifically:
the node re-determines another suitable forwarding node according to the local gateway list and the cluster identification sequence in the data packet, namely, a new link is found for substitution;
if no other nodes meeting the conditions exist and the current node is not a cluster member, sending the data packet to the cluster head of the current node, searching other nodes meeting the requirements by the cluster head, and transmitting the data packet to the next cluster;
otherwise, the links between the adjacent clusters are all disconnected, and a routing error packet RERR is sent to the source node to inform the source node of the routing failure condition; after receiving the routing request, the source node deletes the corresponding route from the route cache of the source node, and determines whether the route discovery process needs to be restarted or not by inquiring the route cache of the source node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710123177.4A CN106973422B (en) | 2017-03-03 | 2017-03-03 | Improved algorithm of DSR protocol |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710123177.4A CN106973422B (en) | 2017-03-03 | 2017-03-03 | Improved algorithm of DSR protocol |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106973422A CN106973422A (en) | 2017-07-21 |
| CN106973422B true CN106973422B (en) | 2020-07-28 |
Family
ID=59328342
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710123177.4A Active CN106973422B (en) | 2017-03-03 | 2017-03-03 | Improved algorithm of DSR protocol |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106973422B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107567066A (en) * | 2017-10-27 | 2018-01-09 | 中国航空无线电电子研究所 | FANETs Routing Protocols based on adaptive probability forwarding strategy |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101286930A (en) * | 2008-05-30 | 2008-10-15 | 华南理工大学 | Self-adapting routing method for congestion of multi-hop wireless self-organizing network |
| US7649884B1 (en) * | 2004-12-01 | 2010-01-19 | Hrl Laboratories, Llc | Collaborative multicast routing (CMR) for multicasting in unidirectional, hybrid, multi-tiered mobile wireless network |
| CN103096411A (en) * | 2013-01-05 | 2013-05-08 | 山东师范大学 | Internet of things communication method based on reverse power restriction route protocol |
| CN105049352A (en) * | 2015-07-24 | 2015-11-11 | 成都芯联电科科技技术有限公司 | Multipath improved method based on DSR protocol |
-
2017
- 2017-03-03 CN CN201710123177.4A patent/CN106973422B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7649884B1 (en) * | 2004-12-01 | 2010-01-19 | Hrl Laboratories, Llc | Collaborative multicast routing (CMR) for multicasting in unidirectional, hybrid, multi-tiered mobile wireless network |
| CN101286930A (en) * | 2008-05-30 | 2008-10-15 | 华南理工大学 | Self-adapting routing method for congestion of multi-hop wireless self-organizing network |
| CN103096411A (en) * | 2013-01-05 | 2013-05-08 | 山东师范大学 | Internet of things communication method based on reverse power restriction route protocol |
| CN105049352A (en) * | 2015-07-24 | 2015-11-11 | 成都芯联电科科技技术有限公司 | Multipath improved method based on DSR protocol |
Non-Patent Citations (1)
| Title |
|---|
| 基于簇的动态源路由协议研究;赵富强;《计算机仿真》;20060715;第23卷(第7期);第119-121页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106973422A (en) | 2017-07-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jain et al. | Geographical routing using partial information for wireless ad hoc networks | |
| US8331262B2 (en) | Apparatus and method for setup of optimum route using tree-topology | |
| Yi et al. | Efficient flooding in ad hoc networks using on-demand (passive) cluster formation | |
| WO2017020619A1 (en) | Routing method and device | |
| Mishra et al. | Comparison of MANET routing protocols | |
| CN103260211B (en) | A kind of AOMDV method for routing of improvement | |
| US11310716B2 (en) | Method of selecting a route in an ad hoc network | |
| JP5036602B2 (en) | Wireless ad hoc terminal and ad hoc network system | |
| CN106954243A (en) | Route implementation method based on wireless chain network | |
| CN110831104A (en) | Routing method for linear topology wireless ad hoc network | |
| Mu | An improved AODV routing for the zigbee heterogeneous networks in 5G environment | |
| Bhangwar et al. | On routing protocols for high performance | |
| CN106658635A (en) | Hierarchical routing method based on service quality in wireless multi-hop network | |
| KR100955246B1 (en) | Group dynamic source routing method for wireless mobile ad hoc network | |
| Joa-Ng et al. | A GPS-based peer-to-peer hierarchical link state routing for mobile ad hoc networks | |
| Shah et al. | Energy efficient routing protocols for mobile ad hoc networks | |
| CN109714260B (en) | Implementation method for building virtual backbone network based on UCDS algorithm in OLSR routing protocol | |
| CN106973422B (en) | Improved algorithm of DSR protocol | |
| Abolhasan et al. | LPAR: an adaptive routing strategy for MANETs | |
| KR101371651B1 (en) | A method for constructing a tree in mobile ad hoc network | |
| KR20120069439A (en) | Method and mobile node for routing in mobile wireless network system | |
| Yang et al. | Performance research of an improved hybrid routing protocol | |
| CN112423356B (en) | Unmanned equipment cluster AODV routing method based on energy balance | |
| JP4810606B2 (en) | Nodes in ad hoc networks and ad hoc network systems | |
| Lim et al. | Landmark guided forwarding |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 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 |