CN102573001B - Routing protocol applicable to central type underwater acoustic multi-hop network - Google Patents
Routing protocol applicable to central type underwater acoustic multi-hop network Download PDFInfo
- Publication number
- CN102573001B CN102573001B CN201110177853.9A CN201110177853A CN102573001B CN 102573001 B CN102573001 B CN 102573001B CN 201110177853 A CN201110177853 A CN 201110177853A CN 102573001 B CN102573001 B CN 102573001B
- Authority
- CN
- China
- Prior art keywords
- node
- route
- sink node
- nodes
- sink
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Abstract
The invention relates to a routing protocol applicable to a central type underwater acoustic multi-hop network. The protocol broadcasts a route broadcasting vector via a Sink node so that other nodes in the network establish and maintain the routes to the Sink node, and the routing protocol comprises the following steps: the Sink node periodically broadcasts a route vector message to the fixed nodes and the moving nodes, and the fixed nodes and the moving nodes receiving the route vector message update and maintain the multi-hop routes to the Sink node according to the route vector message; when one fixed node or one moving node transmits data, the multi-hop route stored on the node is directly utilized to transmit; and if the moving node transmitting data does not store the route to the Sink node, the moving node adopts an AODV (Ac hoc On-demand Distance Vector Routing) reconstruction policy to search the route to the Sink node, wherein the route vector message comprises the ID of the Sink node, the broadcasting ID of the Sink node and the route length of the Sink node, and the fixed node and the moving node are common nodes.
Description
Technical field
The invention belongs to underwater acoustic network field, particularly a kind of Routing Protocol that is applicable to center type underwater acoustic network multihop network.
Background technology
Underwater acoustic network has broad application prospects at aspects such as Ocean Surveying, resource exploration, hazard forecasting and military affairs.Because underwater sound propagation loss increases with distance, underwater acoustic network generally adopts the mode of multinode relaying to transmit, and therefore the selection of Routing Protocol is very important.
Underwater acoustic network belongs to cordless communication network, and the Routing Protocol of traditional computer network is not suitable for underwater acoustic network.Due to underwater acoustic network propagation delay, narrow bandwidth, the Routing Protocol of terrestrial radio network is directly applied in underwater acoustic network can not reach good service behaviour.
The Routing Protocol of wireless network is mainly divided into two classes at present: Proactive routing protocols and On-demand routing agreement.Proactive routing protocols is by regular broadcast exchanging routing information between node, and finally reaching all nodes of network, to converge to route consistent, and each node has the route that arrives arbitrary node in network.Proactive routing protocols postpones low, but periodically routing update has increased routing cost, can take massive band width simultaneously, in the underwater acoustic network of Bandwidth-Constrained, can not well work.On-demand routing agreement is ability query routing in network in the time having transfer of data, do not need to be maintained into the routing table of all nodes, save the expense of route, it is larger that but Route establishment postpones, On-demand routing protocol comparison is applicable to change in topology network fast simultaneously, in underwater acoustic network, many nodes are static or movement velocity is very slow, adopt On-demand routing agreement completely can not reach good performance.
Center type multihop network is a kind of basic topology form of underwater acoustic network.In center type multihop network, there is a Sink node and a large amount of ordinary node, ordinary node only has underwater sound communication module, Sink node has underwater sound communication module and wireless communication module simultaneously, ordinary node sends to Sink node data by multi-hop relay mode, and Sink node sends to center, land by wireless module data again.Because general of the data communication of center type multihop network is carried out between Sink node and ordinary node, if adopt Proactive routing protocols, a large amount of protocol overheads is used in the route of setting up between ordinary node, is obviously unnecessary; If adopt On-demand routing agreement, due to ordinary node regular will with Sink node communication, can cause route inundation frequently to search, simultaneously in ordinary node except the mobile nodes faster such as AUV, major part is the very slow or static data acquisition node of translational speed, and therefore the Routing Protocol of on-demand is also inapplicable.
Summary of the invention
The object of the invention is to, for addressing the above problem, propose a kind of Routing Protocol that is applicable to center type underwater acoustic network multihop network.
For this underwater acoustic network form of center type multihop network, the invention provides a kind of hybrid-type Routing Protocol and be referred to as UW-CAODV.
The invention provides a kind of Routing Protocol that is applicable to center type underwater sound multihop network, network node is divided into three types by this agreement: Sink node, stationary nodes and mobile node.This agreement is in order to pass through the periodic broadcast vector of Sink node, make the node in network set up the multi-hop route that arrives Sink node, in the time that node has data to send, can directly utilize this route to send, and need not set up route, the on-demand agreements such as relative AODV, can improve throughput.
In technique scheme, the method that described periodic Sink node broadcasts route vector is set up route is as follows:
The broadcast timer expiry of Sink node, Sink node adds 1 certainly by the broadcast ID of oneself, route length to Sink node is set to 0, then generate a route vector message ROUTE_BROADCAST, route vector message comprises Sink node ID, Sink node broadcasts ID, to the route length of Sink node.Finally this route vector message broadcasting is gone out.
The method that stationary nodes or mobile node updating maintenance arrive Sink node multi-hop route comprises following steps: arbitrary node receives after route vector message, judge that whether SINK_BID is larger than the SINK_BID in own routing table, if upgrade routing table more greatly,, if SINK_BID equates, judge relatively ROUTE_LENGT H, if the ROUTE_LENGTH in ROUTE_BROADCAST is less, upgrade routing table, otherwise do not upgrade, if SINK_BID is less than the SINK_BID in own routing table, do not upgrade routing table.If this node is mobile node, only upgrade routing table, if this node is stationary node, once routing table is upgraded, again broadcast away after also ROUTE_LENGTH in ROUTE_BROADCAST will being added to 1.
The described general sound multihop network of the center type water Routing Protocol that is applicable to, the Sink broadcast of periodic can meet the route need of stationary nodes network, but in the time there is mobile node, the broadcast of periodic can not adapt to the route variation that mobile node fast moving causes.In order to solve the access problem of mobile node, described agreement adopts periodic Sink node broadcasts and the AODV strategy of agreement combination as required to mobile node, the route that first mobile node is set up by last Sink node broadcasts is carried out transfer of data, if data transmission fails, adopts AODV algorithm to find new path.
Optimize, if when described mobile node sends data according to the multi-hop route of its storage, if data send unsuccessfully, further adopt AODV algorithm to find new path.
Described employing AODV algorithm is found new path and is specifically comprised the steps:
Step 1): arbitrary nodes X checks state;
Step 2): nodes X has been checked through lower floor's packet and has arrived;
Step 3): receiving packet is AODV packet;
Step 4): nodes X checks AODV type of data packet, and route requests data message RREQ if, forwards step 5 to); Routing reply data message RREP if, forwards step 12 to);
Step 5): check the type of nodes X, node is mobile node if, forwards step 17 to); Otherwise forward step 6 to);
Step 6): whether nodes X inspection receives this RREQ for the first time, if forward step 17 to); Otherwise forward step 7 to);
Step 7): be established to the reverse path of source node in RREQ, the ID of buffer memory RREQ;
Step 8): check the whether destination node of RREQ of nodes X.If forward step 10 to); Otherwise forward step 9 to);
Step 9): check that whether nodes X has to the effective routing to RREQ destination node, has and forwards step 10 to); Otherwise forward step 11 to);
Step 10): send the source node of routing reply data message RREP to RREQ; Forward step 17 to);
Step 11): the jumping figure information in RREQ is added to 1, then broadcast away; Forward step 17 to);
Step 12): nodes X checks that route in RREP is whether than the routing update in self routing table.If the routing update in RREP, forwards step 13 to); Otherwise forward step 17 to);
Step 13): upgrade routing table;
Step 14): send the DATA packet in buffer memory;
Step 15): check the whether destination node of RREP of nodes X, if so, forward described step 17 to); If not forwarding step 16 to);
Step 16): forward RREP to RREP destination node;
Step 17): forward step 1 to).
In sum: described routing policy of the present invention is:
In the time that node has data to send, first check the effective routing that whether has destination node in own routing table.If there is route, send data according to route down hop node.If there is no route or send data failure, if stationary nodes data cached guarantee for returns go out transmission flow, if first data cached bag of mobile node, then initiate AODV and seek footpath algorithm.
The invention has the advantages that, in center type underwater sound multihop network, relatively general AODV agreement, can obtain higher throughput performance, meanwhile, adopts AODV Reconstruction Strategy further to improve the packet receptance of mobile node to mobile node.
Brief description of the drawings
Fig. 1 is the software main flow chart of agreement of the present invention;
Fig. 2 is the overtime module flow chart of routing broadcast of the present invention;
Fig. 3 is sending module flow chart of the present invention;
Fig. 4 is receiver module flow chart of the present invention;
Fig. 5 is that AODV of the present invention seeks footpath module flow chart;
Fig. 6 is DATA receiver module flow chart of the present invention;
Fig. 7 is route vector message receiver module flow chart of the present invention;
Fig. 8 is AODV receiver module flow chart of the present invention;
Fig. 9 is that the real embodiment of the present invention adopts center type network topology structure figure;
Figure 10 is the comparison analogous diagram of the AODV agreement of UW-CAODV agreement of the present invention and prior art;
Figure 11 is that in UW-CAODV agreement of the present invention, mobile node adopts AODV strategy and do not adopt the analogous diagram of the comparison of AODV strategy.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention will be described in detail.
When the broadcast timer expiry of Sink node, Sink node adds 1 certainly by the broadcast ID of oneself, route length to described Sink node is set to 0, then generate a route vector message ROUTE_BROADCAST, route vector message comprises described Sink node ID, described Sink node broadcasts ID, to the route length of described Sink node; Finally this route vector message broadcasting is gone out; Arbitrary node receives after route vector message, judges that whether SINK_BID is larger than the SINK_BID in own routing table, if more greatly, upgrades routing table, if SINK_BID is equal, and relatively ROUTE_LENGT H of judgement; If the ROUTE_LENGTH in ROUTE_BROADCAST is less, upgrades routing table, otherwise do not upgrade; If SINK_BID is less than the SINK_BID in own routing table, do not upgrade routing table; If this node is mobile node, only upgrade routing table; If this node is stationary node, once routing table is upgraded, again broadcast away after also ROUTE_LENGTH in ROUTE_BROADCAST will being added to 1.
The described route of setting up and safeguard other nodes arrival Sink node by Sink node broadcasts routing broadcast vector, for mobile node, further adopt the strategy that Sink node broadcasts is safeguarded and the passive reconstruction route of AODV combines, improved the packet acceptance rate of mobile node to Sink node.
The process that the passive reconstruction route of described Sink node broadcasts and AODV combines comprises:
In the time that Sink node has data to send, first check the effective routing that whether has destination node in own routing table; If there is route, send data according to route down hop node; If there is no route or send data failure, if stationary nodes data cached guarantee for returns go out transmission flow, if first data cached bag of mobile node, then initiate AODV and seek footpath algorithm.
With reference to Fig. 1, Fig. 2, Fig. 7, the described routing broadcast for once being initiated by Sink node specifically comprises following steps:
Step 1): Sink node checks state;
Step 2): the routing broadcast timer expiry of Sink node, S adds 1, ROUTE_LENGTH SINK_BID and is set to 0, produces a route vector message broadcasting and goes out;
Step 3): it is 2000s that Sink node resets routing broadcast timer;
Step 4): arbitrary nodes X checks state;
Step 5): nodes X receives route vector message;
Step 6): the SINK_BID storing in the SINK_BID in nodes X comparison route vector message and self routing table, if the SINK_BID in route vector message is larger, forwards described step 8 to); If the SINK_BID in self routing table is larger, forward described step 12 to); If the two equates, forward described step 7 to);
Step 7): the RO UTE_LENGTH storing in the ROUTE_LENGTH in nodes X comparison route vector message and self routing table, if the ROUTE_LENGTH in route vector message is smaller, forwards described step 8 to); Otherwise forward described step 12 to);
Step 8): the route that arrives Sink node in the routing table of nodes X renewal oneself;
Step 9): check which kind of node is nodes X be, if nodes X is Sink node or mobile node, forward step 12 to); If nodes X is stationary node, forward described step 10 to);
Step 10): nodes X adds 1 certainly the ROUTE_LENGTH receiving in route vector message;
Step 11): nodes X is broadcasted new route vector message;
Step 12): nodes X forwards described step 4 to).
With reference to Fig. 1, Fig. 3 and Fig. 5, described specifically comprises following steps for a data transmission procedure:
Step 1): arbitrary non-Sink node Y checks state;
Step 2): node Y has upper layer data bag need to send to Sink node;
Step 3): whether node Y checks oneself has the effective routing that arrives Sink node, if had, forward step 4 to); If no, forward step 6 to);
Step 4): node Y sends data;
Step 5): check whether data send successfully, if sent successfully, forward step 10 to); If sent unsuccessfully, forward step 6 to);
Step 6): buffer memory sends packet;
Step 7): check that node Y is which kind node, if stationary node forwards step 10 to); If mobile node forwards step 8 to;
Step 8): node Y produces a route requests data message RREQ and broadcasts away;
Step 9): node Y arranges route requests overtime timer;
Step 10): node Y forwards step 1 to).
With reference to Fig. 1, Fig. 4, Fig. 5, Fig. 8, the described processing for once initiating after AODV request specifically comprises the steps:
Step 1): arbitrary nodes X checks state;
Step 2): nodes X has been checked through lower floor's packet and has arrived;
Step 3): receiving packet is AODV packet;
Step 4): nodes X checks AODV type of data packet, and route requests data message RREQ if, forwards step 5 to); Routing reply data message RREP if, forwards step 12 to);
Step 5): check the type of nodes X, node is mobile node if, forwards step 17 to); Otherwise forward step 6 to);
Step 6): whether nodes X inspection receives this RREQ for the first time, if forward step 17 to); Otherwise forward step 7 to);
Step 7): be established to the reverse path of source node in RREQ, the ID of buffer memory RREQ;
Step 8): check the whether destination node of RREQ of nodes X.If forward step 10 to); Otherwise forward step 9 to);
Step 9): check whether nodes X has to the effective routing of RREQ destination node, has and forwards step 10 to); Otherwise forward step 11 to);
Step 10): send the source node of routing reply data message RREP to RREQ; Forward step 17 to);
Step 11): the jumping figure information in RREQ is added to 1, then broadcast away; Forward step 17 to);
Step 12): nodes X checks that route in RREP is whether than the routing update in self routing table.If the routing update in RREP, forwards step 13 to); Otherwise forward step 17 to);
Step 13): upgrade routing table;
Step 14): send the DATA packet in buffer memory;
Step 15): check the whether destination node of RREP of nodes X, if so, forward described step 17 to); If not forwarding step 16 to);
Step 16): forward RREP to RREP destination node;
Step 17): forward step 1 to).
The initial position of each node as shown in Figure 9, uses UW-CAODV agreement in the network shown in Fig. 9, carry out emulation experiment in ns.The velocity of sound is got 1500m/s, simulating scenes is 1600m x 1600m, in 25 nodes, a Sink node is positioned at scene central authorities, 16 stationary nodes are lined up the square of 4x4 centered by Sink node, between stationary nodes, spacing is 400m, and node maximum communication distance is 500m, 8 mobile node random direction motions in simulating scenes.
UW-CAODV agreement and AODV agreement have been compared in Figure 10 emulation.Mobile node maximal rate is 2m/s.As can be seen from the figure, the throughput of UW-CAODV agreement is far away higher than AODV agreement, this is to carry out the whole network inundation route requests while not needing every data transfer because of UW-CAODV agreement, but directly uses the route of Sink routing broadcast stage foundation, has reduced the expense of route.
Figure 11 emulation has been compared mobile node in UW-CAODV agreement and has been adopted AODV algorithm to rebuild route and do not adopt AODV algorithm to rebuild the situation of route.This figure is the acceptance rate comparison that under different translational speeds, whether mobile node adopts AODV strategy, and CAODV is the agreement that adopts AODV strategy, and CNAODV is the agreement that does not adopt AODV strategy.As can be seen from the figure, along with the raising of mobile node translational speed, adopt AODV algorithm to rebuild after route, packet receptance changes very little, and does not adopt AODV algorithm to rebuild the agreement of route, and packet acceptance rate reduces rapidly.This is because do not adopt in the agreement of AODV algorithm, mobile node because of mobile cause original route break after, need to wait until that next time Sink node initiates routing broadcast and could set up route, because the broadcast cycle of Sink node is longer, thereby data-bag lost is serious.
It should be noted last that, above embodiment is only unrestricted in order to technical scheme of the present invention to be described.Although the present invention is had been described in detail with reference to embodiment, those of ordinary skill in the art is to be understood that, technical scheme of the present invention is modified or is equal to replacement, do not depart from the spirit and scope of technical solution of the present invention, it all should be encompassed in the middle of claim scope of the present invention.
Claims (3)
1. one kind is applicable to the Routing Protocol of center type underwater sound multihop network, the node of underwater sound multihop network is divided into three types by this agreement: Sink node, stationary nodes and mobile node, described Routing Protocol is: Sink node is to described stationary nodes and the periodic broadcast vector of mobile node message, it arrives the multi-hop route of described Sink node according to the updating maintenance of route vector message to receive the stationary nodes of this route vector message and mobile node, finally make other nodes in network all set up and be maintained into the route of this Sink node by the route vector message of Sink node broadcasts, in the time having stationary nodes or mobile node to have data to send, directly utilize the multi-hop route to described Sink node of storing on this node to send, if when the mobile node that has data to send does not store the route of Sink node into, this mobile node adopts AODV algorithm to find the path that arrives described Sink node,
Wherein, described route vector message comprises: Sink node ID, Sink node broadcasts ID and the route length to described Sink node; Described stationary nodes and mobile node are ordinary node;
The described periodic broadcast vector of Sink node message comprises following steps:
When the broadcast timer expiry of Sink node,
Step 201, Sink node is broadcasted ID and is added one, and is set to 0 to the route length of this Sink node;
Step 202, generates one and comprises Sink node ID, and Sink node broadcasts ID, to the route vector message of the route length of Sink node; Wherein, described Sink node broadcasts ID and the route length to Sink node are the value that step 201 obtains;
Step 203, described Sink node is gone out the route vector message broadcasting of generation;
The multi-hop route that described updating maintenance arrives Sink node comprises following steps:
Step 301, arbitrary receiving node receives after described route vector message, first judge that whether the Sink node broadcasts ID in route vector message is larger than the Sink node broadcasts ID storing in own routing table, if more greatly, upgrade routing table, if Sink node broadcasts ID is equal, enter next step; If be less than, do not upgrade routing table;
Step 302, described receiving node judges the route length that arrives Sink node with its storage to the route length of Sink node in more described route vector message again, if the route length to Sink node in route vector message is less, this receiving node upgrades routing table, otherwise does not upgrade;
Wherein, described receiving node is certain node in described stationary nodes and mobile node;
Also carry out following steps after described step 302: further judge the type of described receiving node, if described receiving node is stationary nodes, again broadcast after needing that the route length to Sink node in route vector message is added to one.
2. the Routing Protocol that is applicable to center type underwater sound multihop network according to claim 1, it is characterized in that, if when described mobile node sends data according to the multi-hop route of its storage, if data send unsuccessfully, further adopt AODV algorithm to find new path.
3. the Routing Protocol that is applicable to center type underwater sound multihop network according to claim 2, is characterized in that, described employing AODV algorithm is found new path and specifically comprised the steps:
Step 1): arbitrary nodes X checks state;
Step 2): nodes X has been checked through lower floor's packet and has arrived;
Step 3): receiving packet is AODV packet;
Step 4): nodes X checks AODV type of data packet, and route requests data message RREQ if, forwards step 5 to); Routing reply data message RREP if, forwards step 12 to);
Step 5): check the type of nodes X, if nodes X is stationary nodes, forward step 17 to); Otherwise forward step 6 to);
Step 6): whether nodes X inspection receives this RREQ for the first time, if forward step 17 to); Otherwise forward step 7 to);
Step 7): be established to the reverse path of source node in RREQ, the ID of buffer memory RREQ;
Step 8): check whether nodes X is the destination node of RREQ, if forward step 10 to); Otherwise forward step 9 to);
Step 9): check whether nodes X has to the effective routing of RREQ destination node, has and forwards step 10 to); Otherwise forward step 11 to);
Step 10): send the source node of routing reply data message RREP to RREQ; Forward step 17 to);
Step 11): the jumping figure information in RREQ is added to 1, then broadcast away; Forward step 17 to);
Step 12): nodes X checks that route in RREP is whether than the routing update in self routing table, if the routing update in RREP forwards step 13 to); Otherwise forward step 17 to);
Step 13): upgrade routing table;
Step 14): send the DATA packet in buffer memory;
Step 15): check whether nodes X is the destination node of RREP, if so, forwards step 17 to); If not forwarding step 16 to);
Step 16): forward RREP to RREP destination node;
Step 17): forward step 1 to).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110177853.9A CN102573001B (en) | 2010-12-30 | 2011-06-29 | Routing protocol applicable to central type underwater acoustic multi-hop network |
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010623324.2 | 2010-12-30 | ||
| CN201010623324 | 2010-12-30 | ||
| CN201110177853.9A CN102573001B (en) | 2010-12-30 | 2011-06-29 | Routing protocol applicable to central type underwater acoustic multi-hop network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102573001A CN102573001A (en) | 2012-07-11 |
| CN102573001B true CN102573001B (en) | 2014-11-12 |
Family
ID=46417181
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110177853.9A Expired - Fee Related CN102573001B (en) | 2010-12-30 | 2011-06-29 | Routing protocol applicable to central type underwater acoustic multi-hop network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102573001B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110166934B (en) * | 2019-05-21 | 2020-08-18 | 长安大学 | Mobile underwater acoustic network self-positioning method based on dynamic reference node selection |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101291285A (en) * | 2008-03-05 | 2008-10-22 | 中科院嘉兴中心微系统所分中心 | Novel wireless sensor network routing method forming convergence gradient |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020145978A1 (en) * | 2001-04-05 | 2002-10-10 | Batsell Stephen G. | Mrp-based hybrid routing for mobile ad hoc networks |
-
2011
- 2011-06-29 CN CN201110177853.9A patent/CN102573001B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101291285A (en) * | 2008-03-05 | 2008-10-22 | 中科院嘉兴中心微系统所分中心 | Novel wireless sensor network routing method forming convergence gradient |
Non-Patent Citations (4)
| Title |
|---|
| "Information-Carrying Based Routing Protocol for Underwater Acoustic Sensor Network";Wei Liang,Haibin Yu,Lin Liu,Bangxiang Li,Chang Che;《Proceedings of the 2007 IEEE International Conference on Mechatronics and Automation》;20070808;全文 * |
| "水声通信网络定向搜索AODV协议研究";刘旬,李宇,张春华,黄海宁;《应用声学》;20101130;第29卷(第6期);全文 * |
| Wei Liang,Haibin Yu,Lin Liu,Bangxiang Li,Chang Che."Information-Carrying Based Routing Protocol for Underwater Acoustic Sensor Network".《Proceedings of the 2007 IEEE International Conference on Mechatronics and Automation》.2007, * |
| 刘旬,李宇,张春华,黄海宁."水声通信网络定向搜索AODV协议研究".《应用声学》.2010,第29卷(第6期), * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102573001A (en) | 2012-07-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yang et al. | Improvement of GPSR protocol in vehicular ad hoc network | |
| US10849046B2 (en) | Density-based method for selecting a relay node | |
| CN102769888B (en) | Method for vehicle-mounted Ad Hoc network based on improved AODV (Ad Hoc Ondemand Distance Vector) protocol | |
| CN102970722A (en) | Multicasting route algorithm of low-time-delay delay tolerant and disruption tolerant sensor network | |
| CN102572994B (en) | Wireless self-organizing network fusing routing generation method based on node characteristics | |
| CN103260211A (en) | Improved AOMDV routing method | |
| CN103108374A (en) | Energy saving routing algorithm of composite structure mine emergency rescue wireless mesh network | |
| Divya et al. | Performance analysis of efficient energy routing protocols in MANET | |
| Liu et al. | PATCH: a novel local recovery mechanism for mobile ad-hoc networks | |
| Sharma et al. | A contemporary proportional exploration of numerous routing protocol in VANET | |
| Lawrence et al. | A comparative study of routing protocols for mobile ad-hoc networks | |
| CN103037436A (en) | Network coding perception wireless mesh routing protocol based on hybrid wireless mesh protocol (HWMP) | |
| Ito et al. | A novel routing method for improving message delivery delay in hybrid DTN-MANET networks | |
| CN103338490B (en) | A kind of method of network data route and network node | |
| CN102573001B (en) | Routing protocol applicable to central type underwater acoustic multi-hop network | |
| Wang et al. | A stable on-demand routing protocol for mobile ad hoc networks with weight-based strategy | |
| Gruber et al. | Ad hoc routing for cellular coverage extension | |
| Thongthavorn et al. | A study on overhead reduction for GPS-assisted mobile ad-hoc networks | |
| Goyal et al. | Improving the MANET routing algorithm by GC-efficient neighbor selection algorithm | |
| Nanda et al. | Multipath location aided routing in 2D and 3D | |
| Dong et al. | A new data transmission mechanism in aeronautical ad hoc network | |
| Di et al. | Connected dominating set based hybrid routing algorithm in ad hoc networks with obstacles | |
| Kim et al. | A study on the advanced inference routing network scheme for RODMRP | |
| Khaoua et al. | Gossip-based interest forwarding in NDN over MANETs | |
| Al-Bayati | Quality of Service Routing for MANET and Internet Hybrid Network to Support Communication Restoration Teams in Disaster Situations. |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141112 Termination date: 20200629 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |