CN102088666B - Multicast route method of mobile self-organizing network system - Google Patents
Multicast route method of mobile self-organizing network system Download PDFInfo
- Publication number
- CN102088666B CN102088666B CN 201110052108 CN201110052108A CN102088666B CN 102088666 B CN102088666 B CN 102088666B CN 201110052108 CN201110052108 CN 201110052108 CN 201110052108 A CN201110052108 A CN 201110052108A CN 102088666 B CN102088666 B CN 102088666B
- Authority
- CN
- China
- Prior art keywords
- node
- information
- message
- data
- abandon
- 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
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention discloses a multicast route method of a mobile self-organizing network system. The method of the present invention is put forward against the prior art that the present multicast route method can not satisfy the self-organizing network with rapidly moving nodes, and the method comprises the steps as follows: a node regularly sends a HELLO message to perform detection and update of a neighbor node; a source node performs a route orientation prediction by using geological position of the node; the source node obtains positional information of a multicast group object node, then adds object node ID and the positional information into a data head object node domain, and sends a DATA message; and other nodes determine how to forward the data according to the head information. The present invention puts forward a data transmission guiding mechanism based on positional information prediction, and applies a delay tolerance technology to the network, therefore in an environment where the nodes move rapidly and topology changes quickly, the method of the present invention can raise use efficiency and data delivery rate of network data transmission with the precondition that the requirement of low time delay for the network is satisfied.
Description
Technical field
The invention belongs to the mobile communication technology field, be specifically related to a kind of routing method for mobile ad hoc network system.
Background technology
For traditional wireless self-organization network, node is in the state of static or low-speed motion usually.In this case, it is comparatively slow that network topology structure changes, lower to the delay requirement of the selection of route and node communication bandwidth and transmission.But in as unmanned plane movable self-organization mobile network system, the flight of unmanned plane network node high-speed mobile, and the mobile ad-hoc network that unmanned aerial vehicle group forms is of living in comparatively abominable such as ambient conditions such as battlefields, and the normal stable operation situation of whole network is relatively poor.In this case, such as indexs such as network data transmission energy consumptions not the main aspect of the whole algorithm network routing design studies of constraint.In the unmanned plane mobile ad hoc network system, node motion speed fast, network topology changes frequently, directly causes the raising that reselects frequency of very high data packet loss and network route and the increase of difficulty.The previous route of the setting up the transmission of data that might also not be able to do in time just need to resend link control message, rebulids routing link, like this, certainly will aggravate network congestion and affect the propagation delay time of data.In order to guarantee the efficient availability of self-organizing network, improve the ad hoc network communication quality, must improve the service efficiency of network data transmission, improve the selection strategy of network link, strengthen routing management, thereby improve robustness and the practicality of overall network.
Be suitable in order to study the multi-broadcast routing method that mobile ad-hoc network uses in node high-speed motion situation, by the analysis to domestic and international correlative study content, by theory analysis and related experiment, there are as can be known structure and structureless multicast protocol all can only satisfy to a certain extent the property row energy requirement of certain aspect, and are larger for the sacrifice of other aspect performances.As, in having the agreement of topological structure, satisfied the requirement of network for low time delay, sacrificed data delivery ratio; Agreement without topological structure is just in time opposite.They are all inappropriate self-organizing network in node high-speed motion situation.
Summary of the invention
The objective of the invention is the problem that exists for the multi-broadcast routing method that solves existing mobile ad hoc network system in node high-speed motion situation, proposed a kind of multi-broadcast routing method of mobile ad hoc network system.
In order to address the above problem, technical scheme of the present invention is: a kind of multi-broadcast routing method of mobile ad hoc network system specifically comprises the steps:
S1. node regularly sends HELLO message, comprise this node ID and positional information, carrying out neighbor node surveys and upgrades, the maximum relaying jumping figure of HELLO message is 1, be that HELLO message can not be forwarded, only one jump the node that can reach and can receive HELLO message, the node of receiving HELLO message is set up according to its node ID that comprises and positional information and is upgraded self neighbor table;
S2. source node utilizes the node geographical position to carry out the route bearing prediction, because node is only known this node and neighbor node positional information, therefore other nodes utilize the information of forecasting of source node gained to select route on this basis, and source node only carries out carrying out when data send the destination node location detection process at needs;
S3. source node is after the positional information that obtains multicast group destination node, add destination node ID and positional information in data head destination node territory, send DATA message, DATA message has comprised the information of needs transmission, and how intermediate node determines forwarding data according to its header information.
The detailed process of above-mentioned steps S2 is as follows:
S21. when source node has data to send, outwards broadcast RM message;
If S22. node is received the RM message of repetition, abandon;
If S23. multicast group membership node is received non-repetition RM message: if RM message is processed RM message not for empty; Otherwise, abandon; If comprise this nodal information in RM message, delete this nodal information from RM message, and send a RERM information; If this moment, RM message was not that sky and its TTL are not 0, continues broadcasting, otherwise abandon;
If S24. other nodes are received non-repetition RM message, and RM message is not 0 for sky and TTL, broadcasts this RM message; Otherwise, abandon;
If S25. node is received non-repetition RERM message, judge the whether source node of this multicast group of this node: if this node is source node, receive multicast group membership nodal information in RERM message; Otherwise, calculating book node and source node apart from l; Calculate neighbor node and source node apart from V
j, j is positive integer, if expression neighbor node number is any V
jBe not 0 less than l and its TTL, forward this RERM message; Otherwise, abandon; So, source node can be collected all-multicast group membership information.
The detailed process of above-mentioned steps S3 is as follows:
S31. source node is broadcasted DATA information;
S32. receive DATA information when node, judge whether repetition, if repeat, abandon; Otherwise, carry out following steps;
S33. judge whether this node ID is present in the destination node territory of DATA information, if exist, receive the data in DATA, delete this nodal information in DATA information object nodes domains;
If S34. this DATA information TTL is greater than 0, and its destination node this moment territory be sky, namely also has other destination node information, execution in step S35-S38; Otherwise, abandon this DATA information;
S35. in calculating book node and DATA aiming field node i apart from d
iAnd upper hop node and node i apart from l
i, i=1 wherein, 2, L, D-size, D-size represent nodal information number in aiming field;
S36. work as d
iLess than the node communication scope, but node i generates DT information wait node i and this node and meets not in this node neighbor table the time, namely detects when node i appears at this node communication range to send;
S37. work as d
i＞l
iThe time, the information of node i in deletion DATA targets of messages territory;
S38. execution in step S35-S37 is until DATA information object nodes domains is traversed;
S39. judgement this moment DATA information the destination node territory whether be empty, if be sky, send this information; Otherwise, abandon this information.
In said method, in order to reduce loss of data, to improve data delivery ratio, introduced the DT formation, the DATA information that temporarily can not pay and send has been put into the DT formation, utilize list item life span in historical information and formation to determine the priority of each list item in formation, detailed process is as follows:
S41. after upgrading neighbor table at every turn, if in formation, list item residue life span is T, just its frequency n of meeting is increased by 1, and neighbor table update times N is added 1;
S42. utilize this parameter and DT list item residue life span t, calculate queue priority P, queue priority P=n/N+k*t/T, k are weight coefficient.
On the basis of determining formation list item priority, as follows for the operation of DT formation:
S51. when neighbor node upgrades, check and upgrade item, if a certain in a renewal coupling DT formation, this is sent to the coupling neighbor node;
S52. upgrade formation list item residue life span T;
S53. overtime when list item, delete this;
S54. when queue overflow, according to priority remove entries from low to high;
Beneficial effect of the present invention: the present invention is directed to the mobile ad-hoc network that has under high-speed mobile and topological acute variation environment, proposed a kind of simple multi-broadcast routing method efficiently that is adapted to high-speed mobile environment, solved the problem that the multi-broadcast routing method of existing mobile ad hoc network system exists in node high-speed motion situation.Compare with existing other achievements in research, main contributions is the following aspects: the transfer of data guiding mechanism that 1) has proposed a kind of position-based information prediction; 2) the delay-tolerant technology is applied to network.By multiple multicast group node number and the different situations such as node motion speed have been carried out detailed analysis, with a large amount of simulated experiment data verifications under node fast moving and topological rapidly changing environment the superperformance of the inventive method, satisfying under the prerequisite of network for the requirement of low time delay, improving service efficiency and the data delivery ratio of network data transmission.
Description of drawings
Fig. 1 is the schematic flow sheet of the inventive method.
Fig. 2 is the DATA message processing flow schematic diagram of the inventive method.
Fig. 3 is that the node level of the inventive method is divided schematic diagram.
Fig. 4 is the DT queue operation schematic diagram of the inventive method.
Embodiment
The invention will be further described below in conjunction with the drawings and specific embodiments.
The multi-broadcast routing method of a kind of mobile ad hoc network system of the present invention, its schematic flow sheet specifically is unfolded as follows as shown in Figure 1:
S1. node regularly sends HELLO message (comprising this node ID (Identity) and positional information), carries out neighbor node and surveys and upgrade.The maximum relaying jumping figure of HELLO message is 1, and namely HELLO message can not be forwarded, and only one jumps the node that can reach and can receive HELLO message.The node of receiving HELLO message is according to foundation such as its node ID that comprises and positional informations and upgrade self neighbor table.
S2. source node utilizes the node geographical position to carry out the route bearing prediction, because node is only known this node and neighbor node positional information, therefore other nodes utilize the information of forecasting of source node gained to select route on this basis, and source node only carries out carrying out when data send the destination node location detection process at needs.Here the route bearing prediction draws after surveying by destination node location.
S3. source node is after the positional information that obtains multicast group destination node, adds destination node ID and positional information in data head destination node territory, sends DATA message (information that has wherein comprised needs transmission).Intermediate node is followed according to its header information and how to be determined forwarding data.
Because node is kept in motion, to send out when being forwarded to destination node when DATA information, the position of destination node has been compared with the position of detecting variation has been occured.Therefore, in data transfer, error can occur if use the destination node address detect to point to as route, strengthen the propagation delay time of data, loss of data even occurs.Therefore, before sending data, source node needs according to the destination node information that obtains, the position of destination node to be predicted.
Because the mobile ad-hoc network nodes such as unmanned plane have the geographical position auxiliary systems such as GPS, can learn the current geographical location information accurately of node self.Therefore, utilize the node geographical position to carry out the route bearing prediction, again because node is only known this node and neighbor node positional information, therefore need to carry out destination node location and survey before data send.Because this method belongs to route as required, source node only carries out carrying out when data send the destination node location detection process at needs.Specifically as shown in Figure 2, process is as follows:
S21. when source node has data to send, outwards broadcast RM (Require Multicast, multicast request) message.
S21. when source node has data to send, outwards broadcast RM message;
If S22. node is received the RM message of repetition, abandon;
If S23. multicast group membership node is received non-repetition RM message: if RM message is processed RM message not for empty; Otherwise, abandon; If comprise this nodal information in RM message, delete this nodal information from RM message, and send a RERM (Reply RM, multicast request-reply) information; If this moment, RM message was not that sky and its TTL (Time to Live, residue relaying jumping figure) are not 0, continues broadcasting, otherwise abandon;
If S24. other nodes are received non-repetition RM message, and RM message is not 0 for sky and TTL, broadcasts this RM message; Otherwise, abandon;
If S25. node is received non-repetition RERM message, judge the whether source node of this multicast group of this node: if this node is source node, receive multicast group membership nodal information in RERM message; Otherwise, calculating book node and source node apart from l; Calculate neighbor node and source node apart from V
j, j is positive integer, if expression neighbor node number is any V
jBe not 0 less than l and its TTL, forward this RERM message; Otherwise, abandon; So, source node can be collected all-multicast group membership information.
Source node adds destination node ID and positional information in data head destination node territory after the positional information that obtains multicast group destination node, send DATA message (information that has wherein comprised needs transmission).Intermediate node is followed according to its header information and how to be determined forwarding data, and specifically as shown in Figure 2, process is as follows:
S31. source node is broadcasted DATA information;
S32. receive DATA information when node, judge whether repetition, if repeat, abandon; Otherwise, carry out following steps;
S33. judge whether this node ID is present in the destination node territory of DATA information, if exist, receive the data in DATA, delete this nodal information from DATA information object nodes domains;
If S34. this DATA information TTL is greater than 0, and its destination node this moment territory be sky, namely also has other destination node information, execution in step S35-S38; Otherwise, abandon this DATA information;
S35. in calculating book node and DATA aiming field node i apart from d
iAnd upper hop node and node i apart from l
i, i=1 wherein, 2, L, D-size, D-size represent nodal information number in aiming field;
S36. work as d
iLess than node communication scope R, but node i generates DT (Delay Tolerant, delay-tolerant) information wait node i and this node and meets not in this node neighbor table the time, namely detects when node i appears at this node communication range to send;
S37. work as d
i＞l
iThe time, the information of node i in deletion DATA targets of messages territory;
S38. execution in step S35-S37 is until all nodes of DATA information object territory are traversed;
S39. whether judgement DATA information object this moment nodes domains is empty.If be not empty, send this information; Otherwise, abandon this information.
Concerning source node, all nodes are divided into three parts, as shown in Figure 3: "
Represent 1 hop node territory ", "
Represent 2 hop node territories ", " outermost layer represents the multi-hop nodes domains ".
Node in 1 hop node territory, innermost layer and source node distance be less than the node communication radius, and apart between 1～2 times of communication radius of node, all the other node division are in the multi-hop nodes domains with source node for the node in 2 hop node territories.In 1 hop node, the node in the territory directly can reach concerning source node, node in 2 hop node territories needs double bounce at least, all the other nodes need to just can reach through more handover number by that analogy, and namely data arrive this three part of nodes institute elapsed time from source node and should increase progressively in the ideal situation.Therefore, when the predicted time of selected node location, do suitable selection according to different nodes, can effectively improve the accuracy that route is pointed to, reduce data delay.If time_step is the unit value of predicted time, the scheme taked of this method is as follows:
At every turn when the destination node information updating, determine nodes domains under it by its existing positional information.That is, calculate the value apart from dis of destination node and this node, by distance value dis is compared with the communication radius Sensor_Range of node, utilize formula to obtain the value of corresponding predicted time Predict_time.
Utilize predicted time value Predict_time and existing positional information, calculate destination node predicted position information.When producing the DATA data, predicted position information is put into the data head in order to route.
In the method, in order to reduce loss of data, to improve data delivery ratio, introduced the DT formation, the DATA information that temporarily can not pay and send has been put into the DT formation.Namely that some DT list items are arranged in the DT formation, storage DT information in the DT list item.But the buffer memory of node is limited, and namely queue length is limited, and therefore a good Queue Management Algorithm is also very important for this method, and this method utilizes historical information and formation list item life span to determine the priority of list item, and detailed process is as follows:
S41. after upgrading neighbor table at every turn, if in formation, list item residue life span is T, just its frequency n of meeting is increased by 1, and neighbor table update times N is added 1.
S42. utilize this parameter and DT list item residue life span t, calculate queue priority P, queue priority P=n/N+k*t/T, k are weight coefficient, are 0.6≤k≤1.8 here.
Determining on the basis of formation list item priority, for the operation of DT formation as shown in Figure 4, detailed process is as follows:
S51. when neighbor node upgrades, check and upgrade item, if a certain in a renewal coupling DT formation, this is sent to the coupling neighbor node;
S52. upgrade formation list item residue life span T;
S53. overtime when list item, delete this;
S54. when queue overflow, according to priority remove entries from low to high.
Those of ordinary skill in the art will appreciate that, embodiment described here is in order to help reader understanding's principle of the present invention, should to be understood to that the protection range of inventing is not limited to such special statement and embodiment.Everyly make various possible being equal to according to foregoing description and replace or change, all be considered to belong to the protection range of claim of the present invention.
Claims (4)
1. the multi-broadcast routing method of a mobile ad hoc network system, specifically comprise the steps:
S1. node regularly sends HELLO message, comprise this node ID and positional information, carrying out neighbor node surveys and upgrades, the maximum relaying jumping figure of HELLO message is 1, be that HELLO message can not be forwarded, only one jump the node that can reach and can receive HELLO message, the node of receiving HELLO message is set up according to its node ID that comprises and positional information and is upgraded self neighbor table;
S2. utilize the node geographical position to carry out the route bearing prediction, because node is only known this node and neighbor node positional information, need to carry out destination node location and survey before data send;
S3. source node is after the positional information that obtains multicast group destination node, add destination node ID and positional information in data head destination node territory, send DATA message, DATA message has comprised the information of needs transmission, and how intermediate node determines forwarding data according to its header information;
The detailed process of described step S2 is as follows:
S21. when source node has data to send, outwards broadcast RM message;
If S22. node is received the RM message of repetition, abandon;
If S23. multicast group membership node is received non-repetition RM message: if RM message is processed RM message not for empty; Otherwise, abandon; If comprise this nodal information in RM message, delete this nodal information from RM message, and send a RERM information; If this moment, RM message was not that sky and its TTL are not 0, continues broadcasting, otherwise abandon;
If S24. other nodes are received non-repetition RM message, and RM message is broadcasted this RM message not for empty, TTL are not 0; Otherwise, abandon;
If S25. node is received non-repetition RERM message, judge the whether source node of this multicast group of this node: if this node is source node, receive multicast group membership nodal information in RERM message; Otherwise, calculating book node and source node apart from l; Calculate neighbor node and source node apart from V
j, j is positive integer, if expression neighbor node number is any V
jBe not 0 less than l and its TTL, forward this RERM message; Otherwise, abandon; So, source node can be collected all-multicast group membership information;
The detailed process of described step S3 is as follows:
S31. source node is broadcasted DATA information;
S32. receive DATA information when node, judge whether repetition, if repeat, abandon; Otherwise, carry out following steps;
S33. judge whether this node ID is present in the destination node territory of DATA information, if exist, receive the data in DATA, delete this nodal information in DATA information object nodes domains;
If S34. this DATA information TTL is greater than 0, and its destination node this moment territory be sky, namely also has other destination node information, execution in step S35-S38; Otherwise, abandon this DATA information;
S35. in calculating book node and DATA aiming field node i apart from d
iAnd upper hop node and node i apart from l
i, i=1 wherein, 2 ... D-size, D-size represent nodal information number in aiming field;
S36. work as d
iLess than the node communication scope, but node i generates DT information wait node i and this node and meets not in this node neighbor table the time, node i namely detected and appears at this node communication range and send constantly;
S37. work as d
iL
iThe time, the information of node i in deletion DATA targets of messages territory;
S38. execution in step S35-S37 is until DATA information object nodes domains is traversed;
S39. judgement this moment DATA information the destination node territory whether be empty, if be sky, send this information; Otherwise, abandon this information.
2. the multi-broadcast routing method of mobile ad hoc network system according to claim 1, it is characterized in that, the described DATA information that temporarily can not pay and send is put into the DT formation, utilize historical information and formation list item life span to determine the priority of list item, detailed process is as follows:
S41. after upgrading neighbor table at every turn, if in formation, list item residue life span is T, just its frequency n of meeting is increased by 1, and neighbor table update times N is added 1;
S42. utilize this parameter and DT list item residue life span t, calculate queue priority P, queue priority P=n/N+k*t/T, k are weight coefficient.
3. the multi-broadcast routing method of mobile ad hoc network system according to claim 2, is characterized in that, and is as follows for the specific operation process of described DT formation:
S51. when neighbor node upgrades, check and upgrade item, if a certain in a renewal coupling DT formation, this is sent to the coupling neighbor node;
S52. upgrade formation list item residue life span T;
S53. overtime when list item, delete this;
S54. when queue overflow, according to priority remove entries from low to high.
4. the multi-broadcast routing method of mobile ad hoc network system according to claim 2, is characterized in that, the span of described k is: 0.6≤k≤1.8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110052108 CN102088666B (en) | 2011-03-04 | 2011-03-04 | Multicast route method of mobile self-organizing network system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110052108 CN102088666B (en) | 2011-03-04 | 2011-03-04 | Multicast route method of mobile self-organizing network system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102088666A CN102088666A (en) | 2011-06-08 |
| CN102088666B true CN102088666B (en) | 2013-05-08 |
Family
ID=44100231
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110052108 Expired - Fee Related CN102088666B (en) | 2011-03-04 | 2011-03-04 | Multicast route method of mobile self-organizing network system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102088666B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103260132B (en) * | 2012-02-17 | 2016-08-03 | 中国科学院计算技术研究所 | The Mobile Multicast method for routing of wireless sensor network |
| CN103476059B (en) * | 2013-09-29 | 2016-04-13 | 天公（山东）信息科技有限公司 | A kind of dynamic networking method |
| US9826412B2 (en) | 2013-10-24 | 2017-11-21 | At&T Intellectual Property I, L.P. | Facilitating adaptive key performance indicators in self-organizing networks |
| CN104134332A (en) * | 2014-07-31 | 2014-11-05 | 国家电网公司 | Distribution-area integrated-reading-system dynamic ad hoc network method based on wireless sensor network technology |
| CN105634964B (en) * | 2015-12-21 | 2018-12-18 | 华南师范大学 | A kind of mobile ad-hoc network and its multicast route method |
| CN108134986B (en) * | 2016-12-01 | 2020-08-07 | 华为技术有限公司 | Message transmission method and device |
| CN106793178A (en) * | 2016-12-26 | 2017-05-31 | 南京理工大学 | A kind of software and hardware system construction method of Android regions portable mobile MANET |
| CN107820225B (en) * | 2017-11-02 | 2020-04-24 | 中山大学 | Energy-balanced wireless sensor network node code distribution method |
| CN108566614B (en) * | 2017-11-06 | 2020-08-14 | 南京大学 | End-to-end communication method and system for delay tolerant network |
| CN108124249A (en) * | 2017-11-29 | 2018-06-05 | 中国人民解放军陆军工程大学 | Unmanned aerial vehicle cluster data transmission method, device and system |
| CN117014363B (en) * | 2023-01-10 | 2024-03-19 | 广州精天信息科技股份有限公司 | Data communication method and device of parachuting system and electronic equipment |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101883330A (en) * | 2010-07-02 | 2010-11-10 | 湖南大学 | Network coding-based multicast routing method applied to vehicular ad hoc network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI265690B (en) * | 2003-12-31 | 2006-11-01 | Green Packet Inc | Network management |
-
2011
- 2011-03-04 CN CN 201110052108 patent/CN102088666B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101883330A (en) * | 2010-07-02 | 2010-11-10 | 湖南大学 | Network coding-based multicast routing method applied to vehicular ad hoc network |
Non-Patent Citations (2)
| Title |
|---|
| 一种优化链路状态预测的路由协议;刘伟、张可、张伟、李炜;《计算机工程》;20101130;113-115 * |
| 刘伟、张可、张伟、李炜.一种优化链路状态预测的路由协议.《计算机工程》.2010,113-115. |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102088666A (en) | 2011-06-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102088666B (en) | Multicast route method of mobile self-organizing network system | |
| CN102137462B (en) | Prediction-based routing method at intersection in vehicle self-organizing network | |
| CN101369982B (en) | Method for data packet greedy forwarding in vehicle-mounted Ad hoc network | |
| Sood et al. | Clustering in MANET and VANET: A survey | |
| CN101547491B (en) | Routing method for mobile ad hoc network system | |
| CN102572992A (en) | Vehicular network RSU (Roadside Unit) deploy method and data forwarding method thereof | |
| Attia et al. | Advanced greedy hybrid bio-inspired routing protocol to improve IoV | |
| Kulkarni et al. | Performance evaluation of AODV, DSDV & DSR for quasi random deployment of sensor nodes in wireless sensor networks | |
| CN104202724A (en) | AANET combined routing algorithm based on geographical location information | |
| Shi et al. | A centralized clustering based hybrid vehicular networking architecture for safety data delivery | |
| CN102781060B (en) | A kind of method, forward node and wireless network realizing route in the wireless network | |
| CN102625426B (en) | Double optimized topology control method of energy consumption equalization and delay in heterogeneous wireless networks | |
| Wahid et al. | Unicast geographic routing protocols for inter-vehicle communications: a survey | |
| Eltahir et al. | An enhanced hybrid wireless mesh protocol (E-HWMP) protocol for multihop vehicular communications | |
| Lim et al. | Multi-hop data harvesting in vehicular sensor networks | |
| Sachidhanandam et al. | Elevated Ensemble Dynamic Energy-Aware Routing Optimization Based Energy Management and Network Lifetime Improvement in WSN | |
| Wang et al. | An improved VANET intelligent forward decision-making routing algorithm | |
| Hamid et al. | Routing for Wireless Multi Hop Networks–Unifying and Distinguishing Features | |
| Harishankar et al. | E-MAnt net: An ACO-based energy efficient routing protocol for mobile ad hoc networks | |
| Qin et al. | Localized topology control and on-demand power-efficient routing for wireless ad hoc and sensor networks | |
| Khoza et al. | An ant colony hybrid routing protocol for vanet | |
| Wu et al. | Toward a totally distributed flat location service for vehicular ad hoc networks | |
| CN104618981A (en) | Position and direction based priority routing method in delay tolerant network (DTN) environment | |
| Hegde et al. | Implementation of VANET routing using computational intelligence | |
| De Rango et al. | Hierarchical trajectory-based routing protocol for Vehicular Ad Hoc Networks |
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: 20130508 Termination date: 20160304 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |