CN101184037B - Probability effective broadcast coefficient based flooding method - Google Patents
Probability effective broadcast coefficient based flooding method Download PDFInfo
- Publication number
- CN101184037B CN101184037B CN2007101766338A CN200710176633A CN101184037B CN 101184037 B CN101184037 B CN 101184037B CN 2007101766338 A CN2007101766338 A CN 2007101766338A CN 200710176633 A CN200710176633 A CN 200710176633A CN 101184037 B CN101184037 B CN 101184037B
- Authority
- CN
- China
- Prior art keywords
- node
- broadcast
- neighbor
- increment
- efficient
- 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
Abstract
The invention relates to a flooding method of efficient broadcasting coefficient based on probability, belonging to the technical field of wireless ad hoc network routing, comprising the steps that: 1) the concept of the efficient broadcasting increment of a node is defined; 2) the efficient broadcasting increment B of each node is calculated; 3) the efficient broadcasting coefficient P of the node is calculated according to the efficient broadcasting increment of the node; 4) if the efficient broadcasting coefficient P is greater than the setting threshold value Pval, the message received is broadcasted by the node, if not, the message is not forwarded. The invention has the advantages of effectively reducing the routing overhead, enjoying simple implementation, effectively reducing the network load and obtaining high reliability, ensuring good extensibility in large-scale ad hoc network.
Description
Technical field
The present invention relates to flooding method, belong to ad hoc route technology field based on probability effective broadcast coefficient.
Background technology
Multi-hop, autonomous system that ad hoc network (wireless self-organization network) is made up of the node that has wireless transmitting-receiving equipments, its mobile node has routing function simultaneously.Because it does not rely on network infrastructure, be easy to networking, be convenient to expand, removable, survivability is strong, so construct communication network rapidly or inconvenient occasion of setting up the network facilities in advance has broad application prospects at needs such as military affairs, information gathering, rescue and relief work, accident, open-air scientific investigation, personal communications.
Flooding algorithm and Gossiping algorithm are two the most classical and simple legacy network Routing Protocols, may be used in the ad hoc network.
Existing inundation algorithm dictates several message propagation rules: 1) whether oversize and should be dropped according to the time of message in network, TTL (Time to live is a life span) is a value in the IP protocol package, be used for the life span of banner message, ttl value stops forwarding message when being kept to zero; 2) abandon the message of having handled; 3) response message returns along original route.More than three rules can guarantee message can be in network Infinite Cyclic, and reduced the quantity that spreads news effectively.But because of adopting inundation mechanism to spread news in the network, can in network, produce bulk redundancy message inevitably, work as particularly that network size is bigger, the degree of communication between the node is than higher the time.With network shown in Figure 1 is example, comprises A, B, four nodes of C, D among the figure, supposes that four nodes interconnect.If adopt inundation mechanism, A sends to B, C, D to message, and B is transmitted to C, D after receiving message, and C is transmitted to B, D after receiving message, and D is transmitted to B, C after receiving message, supposes that more than B, C, D at first receive the message that A sends.Message transmitted has 9 in this network as can be seen, and wherein redundancy message is 6, accounts for 2/3 of message sum.In the P2P of reality network, redundancy message has increased the node processing burden, has taken a large amount of network bandwidths.
The Flooding algorithm is a kind of traditional route technology, does not require the topological structure of maintaining network, does not require that also carrying out route calculates, and the node that receives message is transmitted grouping with the forms of broadcasting.Sensor network for self-organizing, the inundation route is a kind of directly implementation method, and node produces or receives after the data to all neighbor nodes broadcasting, and packet is up to expired or arrive the destination and just stop to propagate, therefore, each request message is by exponential amplification.There is following major defect in this agreement:
Implosion: node is almost received many parts of identical datas from neighbor node simultaneously;
Overlap: node is successively received the data much at one that a plurality of nodes of monitoring the same area send;
Utilization of resources blindness: node is not considered the own resource restriction, under any circumstance all transmits data.
The Gossiping algorithm is the improvement to Flooding, and in the method, the data that node will produce or receive are transmitted at random.Though this method has been avoided implosion, has increased time-delay.
These two agreements do not need maintaining routing information, without any need for algorithm, though simple autgmentability is very poor yet.Along with prevailing of large-scale wireless network, press for a kind of effective means of communication.
Summary of the invention
For this reason, the present invention proposes a kind of flooding method based on probability effective broadcast coefficient, and in this method, node (is generally a smaller value) by a certain percentage and selects a part of node at random in its all adjacent nodes, searching request is transmitted to them.Compare with common flooding method, this method greatly reduces the generation quantity of message, has reduced network traffics, but has still covered most node, and efficient can be improved greatly.
The present invention is by the following technical solutions:
A kind of flooding method based on probability effective broadcast coefficient, it may further comprise the steps:
1) notion that the efficient broadcast increment is arranged of defined node;
That 2) calculates each node has an efficient broadcast increment B;
3) according to the effective broadcast coefficient P that efficient broadcast incremental computations egress is arranged of node;
4) if the effective broadcast coefficient P of node greater than the threshold value Pval that is provided with, then node is the information broadcast that receives, and handles otherwise this message do not done to transmit.
The efficient broadcast increment that has of described node is meant that this node receives the quantity of the new neighbor node that can be broadcast to after the broadcast.
Described step 2) further comprise following substep:
2.1) node v obtains the hop neighbor nodal information of oneself from the information of neighbor nodes tabulation of this locality storage;
2.2) by and a hop neighbor node between oneself a hop neighbor nodal information of exchange periodically, node v obtains the two-hop neighbor node information of oneself;
2.3) from the hop neighbor node of certain hop neighbor node a of node v, remove the common neighbor node number that covers of neighbor node a itself and node v and this neighbor node a, drawing by what neighbor node a obtained has an efficient broadcast increment;
2.4) computing node v's has an efficient broadcast increment by what all neighbor nodes obtained successively, getting maximum wherein has an efficient broadcast increment Bv as node v.
Compared with prior art, the invention has the beneficial effects as follows:
Designed a kind of flooding method based on probability effective broadcast coefficient, defined node has the notion of efficient broadcast increment, what the utilization locality algorithm was calculated each node has an efficient broadcast increment, according to node efficient broadcast incremental computations egress effective broadcast coefficient is arranged, and also is the forwards probable value of node.This method has been avoided non-directional, the blindness of inundation propagation effectively, has guaranteed the efficient of inundation again, propagates to have higher coverage.Theory analysis and simulation result all show, compare with traditional inundation algorithm, this method has reduced the forwarding of unnecessary request message effectively, and algorithm simply is easy to realize, has routing performance preferably, this method can improve its performance well at aspects such as reducing offered load, prolongation network life, and in extensive mobile ad-hoc network extensibility is preferably being arranged.
Analysis and analog result show that under the condition that obtains bigger query hit rate, resource localization message expense of the present invention is about 25% of inundation inquiry, and the time delay of inquiry is 30%～50% of inundation inquiry, and also is lower than gossiping.Performance of the present invention improves a lot, and can obtain and the approaching Query Result of inundation inquiry under the condition of low message overhead and low inquiry time delay.
Description of drawings
Fig. 1 is that inundation is given an example;
Fig. 2 is a hop neighbor notification packet;
Fig. 3 is the neighbor list that node is preserved.
Embodiment
Based on the characteristics of ad hoc network, that its routing algorithm requires to realize is simple, it is few to take resource, to improve the life cycle of network.Therefore the present invention proposes a kind of flooding method based on probability effective broadcast coefficient, each node is transmitted the message bag at random with certain probability, to reduce the expense of route messages.Consider that the node in the network that forwarding had influence on of each node counts difference, the capability of influence of our collector node (the efficient broadcast increment is arranged), the efficient broadcast increment that has of defined node is the quantity that node is received the new neighbor node that can be broadcast to after the broadcast, according to the capability of influence of node, for node is provided with corresponding forwarding probability.
Flooding method based on probability effective broadcast coefficient involved in the present invention can be divided into three steps: 1) notion and the definition of efficient broadcast increment and effective broadcast coefficient are arranged; What 2) the utilization locality algorithm was calculated each node has efficient broadcast increment and an effective broadcast coefficient (also being the forwards probable value of node); 3) strategy of transmitting based on probability.
Below respectively this three aspects content is described.
1 has the notion and the definition of efficient broadcast increment and effective broadcast coefficient
1.1 algorithm prerequisite
Suppose that node set is N in the network, Neighbor (n
i) be node n
iNeighbor node set.BroadcastEffect (n
i) representation node n
iThe efficient broadcast increment arranged.
1.2 the efficient broadcast increment is arranged
The forwarding probability of node is relevant with the quantity of the new neighbor node that node can be broadcast to, and the maximum broadcasting of node performance that participates in transmitting is influenced, and makes relatively many nodes of not receiving message receive the message of broadcasting on the network.Our defined node has efficient broadcast increment reaction node to the capability of influence of node on every side in the present invention, has the concept definition of efficient broadcast increment as follows:
It is the quantity that node is received the new neighbor node that can be broadcast to after the broadcast that definition has the efficient broadcast increment.That is: BroadcastEffct (n
i)=max{|neighbor (n
i) |-| neighbor (n
i) ∩ neighbor (n
k) |-1, nk ∈ neighbor (n
i(1)
1.3 based on the effective broadcast coefficient that the efficient broadcast increment is arranged
Effective broadcast coefficient P: the standard inundation is to grouping of its all adjacent node broadcasting since a source node, all adjacent nodes (only replaying once) that each adjacent node is replayed this grouping and given oneself again, also be to transmit with probability P=1 after each node receives message for the first time, the probability of Zhuan Faing all is 0 afterwards.In the algorithm that relates among the present invention, node is accepted to broadcast forwarding according to certain probable value (probability P＜1) after the message for the first time in the network, and receiving identical message forwarding probability afterwards is 0.And do not require that each node is all transmitted this message with probability 1 in the network.
Node can come dynamic negotiation to adjust probability P according to the duplicate message number of times that receives, and can also come dynamic negotiation to adjust probability P according to the efficient broadcast increment that has that local message calculates.
2 have the calculating of efficient broadcast increment and effective broadcast coefficient
Ad hoc network is the system of a continuous dynamic change, and node dynamically adds and logs off in running, below these behaviors is illustrated respectively.
2.1 node adds, logs off
Node initializing: a hop neighbor information that at first obtains oneself, periodically send the information of neighbor nodes tabulation of oneself then, and receive the hop neighbor notification packet that its neighbor node periodically sends, set up a hop neighbor of this node maintenance and the corresponding lists of two-hop neighbors.
The node accident logs off: because the node accident withdraws from, this inefficacy only can detect when this node is accessed, and this method is not handled especially to this inefficacy, when detecting this situation, and the information of failure node in the deletion tabulation.
Node normally logs off: under situation about normally withdrawing from, in order to safeguard the coverage rate of tabulation, node is carried out and is withdrawed from operation, and the list item of random distribution local cache is given neighbor node, and the list item of node is withdrawed from the deletion of notice neighbor node.
2.2 the calculating of efficient broadcast increment is arranged
At first node will obtain a corresponding hop neighbor information, and exchanges a hop neighbor notification packet with the one hop neighbor, the two-hop neighbors information that so just obtains the one hop neighbor and can reach through this node.Then this information is stored in this locality, according to this information, computing node the efficient broadcast increment arranged.
Obtaining of information of neighbor nodes tabulation
By there being the efficient broadcast increment to determine to transmit probability, what will make at first that node calculates oneself has an efficient broadcast increment, and each node also needs to preserve the information of a hop neighbor node and the information of two-hop neighbor node except storing message.The information of two-hop neighbor node obtains by the information that periodically exchanges the hop neighbor node of oneself between the neighbours.
Obtaining and upgrading of adjacent forward node table content need not extra control expense, and node periodically sends its 1 hop neighbor nodal information to the neighbor node of oneself, sends message format as shown in Figure 2:
Wherein, being explained as follows of field:
Packet Length: whole length of data package.
Validate Time: the information effective time that from then on obtains in the message, if overstepping the time limit does not have to upgrade, then this information of neighbor nodes should be deleted.
Message Type: the identification message type, according to dissimilar message different values is arranged, represent different notification packets respectively.
Source Node ID: the node ID of source node.
NeighborNum: the quantity of neighbor node.
NeighboursSeq: provide the sign ID of neighbor node successively, NodeID.
The characteristics of utilizing periodicity shown in Figure 21 hop neighbor notification packet locally broadcast to send.When receiving " join reply " message forwarding node, set up or upgrade corresponding two-hop neighbor node tabulation according to message information.The ttl value of this message is 1, and node is periodically initiatively initiated the neighbor list information of oneself, and after its neighbours received this message, renewal was done in the tabulation that oneself is kept.Validate Time then determines as neighbours' general vital values according to ordinary node in the network.
The node listing of each node institute buffer memory is in order to guarantee the maximum coverage rate of the information of sharing.According to the resource distribution pattern that is obtained, the resource location can be jumped inundation by 2 and be inquired about the big coverage rate that reaches the shared resource node, improves the performance of resource location.The data structure of node as shown in Figure 3, each node distributes a spatial cache, is used to deposit the information of one hop neighbor node and the neighbor node of one hop neighbor node, promptly jumps the node that can arrive by certain neighbor node 2.
Calculating has the efficient broadcast increment
According to formula (1), neighbor information tabulation in conjunction with own local storage, as shown in Figure 3, the perpendicular hop neighbor node of classifying node v as in a left side among the figure, remove neighbor node 1 itself again by removing neighbor node 1 and the common neighbor node number that covers of this node v in the hop neighbor node number, can obtain the efficient broadcast increment being arranged by what neighbor node 1 obtained.Wherein the neighbor node of neighbor node 1 is the right side first line number group.Neighbor node 1 and the also promptly left identical array element that erects row and upper right line of the common neighbor node that covers of this node v.
All hop neighbor nodes to oneself calculate successively, and what just draw corresponding different neighbor nodes has an efficient broadcast increment size.Get wherein maximum and the efficient broadcast increment size arranged as this node v.
2.3 the calculating of effective broadcast coefficient
If figure G represents non-structure ad hoc network, all can reach through limited jumping figure between any two nodes among the G.V is arbitrary node among the figure G, the message that M is transmitted for certain broadcasting.In network, whether arbitrary node v determines to its neighbor node pass-along message M, wherein according to probability P v: Pv=Bv/H (2) when receiving message M
In the formula: H is a certain constant factor, and H＞1, and what Bv represented node v has an efficient broadcast increment, if Bv greater than H then the value of Pv gets 1, also is that node v must transmit message M.
Choosing according to the concrete condition of network topology of H value decided, and 1.618 times of conducts generally choosing node degree mean value in the network are with reference to value.
3 strategies based on the probability forwarding
If arbitrary node only may be in two states among the figure G, promptly broadcast attitude B and resting state S.When node (comprising broadcast node) is received message M, calculate the effective broadcast coefficient P of this node, if P then changes the B attitude over to by the S attitude greater than the threshold value Pval that is provided with, with the message M broadcasting that receives; If P less than the threshold value Pval that is provided with, does not then do to transmit to this message and handles.
Can suitably adjust threshold value Pval according to the concrete condition of network topology in addition, as choose Pval=a, when the coverage rate of resource bigger, and each node receives the number of times of message when many, can suitably increase the value of Pval, uses a=a+0.01 as threshold value; Otherwise the coverage rate of resource then uses a=a-0.01 as threshold value inadequately.So until adjusting to proper threshold value benchmark.
Following false code has illustrated the step of each node forwarding message in the agreement of the present invention:
Procedure?probabilistic_forwarding()
{
// probability repeating process
BroadcastEffect(n
i)＝max{|neighbor(n
i)|-|neighbor(n
i)∩neighbor(n
k)|-1，nk∈neighbor(n
i)}
// computing node has the efficient broadcast increment
P＝probability(BroadcastEffect(n
i))；
// determine node forwarding probability according to the efficient broadcast increment that has of node
forward_or_no＝whether(P＞Pval)；
// judge whether greater than the probability threshold value of transmitting, if greater than, then transmit, if less than threshold value, then do not process
Node_do_send (forward_or_no); // send
}
The method that the probability that the present invention adopts effective broadcast coefficient to drive is transmitted, according to the effective broadcast coefficient information of each node for each node is provided with corresponding forwarding delivery probability.Analog result shows that the ad hoc probability multicast routing protocol that effective broadcast coefficient drives is under the situation that the delivery rate satisfies the demands, and the control expense of network reduces greatly, has increased network life, and the combination property of agreement is significantly improved.
The above only is embodiments of the present invention; should be understood that; scholar for the present technique field; under the prerequisite that does not break away from the flooding method principle that the present invention is based on probability effective broadcast coefficient; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (4)
1. flooding method based on probability effective broadcast coefficient is characterized in that may further comprise the steps:
1) notion that the efficient broadcast increment is arranged of defined node, it is the quantity that node is received the new neighbor node that can be broadcast to after the broadcast that the efficient broadcast increment is promptly arranged;
That 2) calculates each node has an efficient broadcast increment B;
3) according to the effective broadcast coefficient P that efficient broadcast incremental computations egress is arranged of node, promptly node accepts to broadcast after the message probable value of forwarding for the first time again in the network;
4) if the effective broadcast coefficient P of node greater than the threshold value Pval that is provided with, then node is the information broadcast that receives, and handles otherwise this message do not done to transmit;
Described step 2) further comprise following substep:
2.1) node v obtains the hop neighbor nodal information of oneself from the information of neighbor nodes tabulation of this locality storage;
2.2) by and a hop neighbor node between oneself a hop neighbor nodal information of exchange periodically, node v obtains the two-hop neighbor node information of oneself;
2.3) from the hop neighbor node of certain hop neighbor node a of node v, remove the common neighbor node number that covers of neighbor node a itself and node v and this neighbor node a, drawing by what neighbor node a obtained has an efficient broadcast increment;
2.4) computing node v's has an efficient broadcast increment by what all neighbor nodes obtained successively, getting maximum wherein has an efficient broadcast increment Bv as node v.
2. the flooding method based on probability effective broadcast coefficient as claimed in claim 1 is characterized in that:
Described broadcast coefficient P=B/H, H are the constant factor greater than 1.
3. the flooding method based on probability effective broadcast coefficient as claimed in claim 2 is characterized in that:
Choosing according to the concrete condition of network topology of described H value decided.
4. the flooding method based on probability effective broadcast coefficient as claimed in claim 3 is characterized in that:
Described H value is chosen 1.618 times of conducts of node degree mean value in the network with reference to value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101766338A CN101184037B (en) | 2007-10-31 | 2007-10-31 | Probability effective broadcast coefficient based flooding method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101766338A CN101184037B (en) | 2007-10-31 | 2007-10-31 | Probability effective broadcast coefficient based flooding method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101184037A CN101184037A (en) | 2008-05-21 |
| CN101184037B true CN101184037B (en) | 2010-06-02 |
Family
ID=39449126
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101766338A Expired - Fee Related CN101184037B (en) | 2007-10-31 | 2007-10-31 | Probability effective broadcast coefficient based flooding method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101184037B (en) |
Families Citing this family (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101291295B (en) * | 2008-06-10 | 2010-11-24 | 北京科技大学 | Probabilistic routing method with limited time delay based on intermittent communicated self-organizing network |
| JP5462252B2 (en) * | 2008-07-02 | 2014-04-02 | トムソン ライセンシング | Apparatus and method for transmitting content data between peers in P2P mode using two-part peer overlay |
| CN101414964B (en) * | 2008-12-04 | 2011-03-30 | 天津大学 | Method for reducing redundant message of delay-tolerant network and intermittently-connected network |
| CN101815337B (en) * | 2010-04-21 | 2012-04-18 | 无锡泛联软件科技有限公司 | Wireless ad hoc network reactive route method based on probability |
| CN101997775B (en) * | 2010-11-10 | 2012-06-13 | 南京大学 | Method for improving utility route in delay tolerant network |
| CN102905340B (en) * | 2011-07-28 | 2015-08-12 | 大唐联诚信息系统技术有限公司 | A kind of addressing method and device being applied to aeronautical communications network |
| CN102546634A (en) * | 2012-01-10 | 2012-07-04 | 北京邮电大学 | Method and node for anonymously obtaining file |
| CN102638820B (en) * | 2012-03-23 | 2015-11-11 | 山东大学 | Ad Hoc network link stability prediction method |
| CN103313235B (en) * | 2013-06-19 | 2015-10-28 | 湖北汽车工业学院 | Grey hole nodal test method in wireless mesh network |
| CN103402236A (en) * | 2013-06-28 | 2013-11-20 | 南京邮电大学 | Constructive interference based wireless sensor network flooding mechanism |
| CN103781144A (en) * | 2014-02-28 | 2014-05-07 | 东南大学 | Zigbee network tree-shaped routing method for neighbor table mode interaction |
| CN105704678B (en) * | 2016-01-20 | 2019-03-29 | 浙江工商大学 | Broadcasting method based on neighbours' successful broadcast rate in mobile ad-hoc network |
| CN105722181B (en) * | 2016-04-12 | 2019-03-29 | 江苏中科羿链通信技术有限公司 | The method of information of neighbor nodes is obtained in wireless chain multihop network |
| CN107182103B (en) * | 2017-04-27 | 2020-07-17 | 浙江工商大学 | Cooperative broadcasting method based on neighbor broadcasting coefficient in mobile self-organizing network |
| CN107294850B (en) * | 2017-06-02 | 2020-07-10 | 深圳市维申斯科技有限公司 | Industrial reliable wireless data communication method and system |
| CN117715094A (en) * | 2018-07-13 | 2024-03-15 | 中航通用电气民用航电系统有限责任公司 | Method, network and network node for realizing high-availability aircraft data network by using single network |
| CN108966309B (en) * | 2018-09-20 | 2021-01-12 | 电子科技大学 | Intelligent routing method based on reinforcement learning |
| CN112423242A (en) * | 2020-11-21 | 2021-02-26 | 中国人民解放军陆军工程大学 | Wireless network broadcasting method based on intelligent learning |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1731760A (en) * | 2005-08-05 | 2006-02-08 | 武汉理工大学 | Ad Hoc network routing method based on flooding mechanism |
-
2007
- 2007-10-31 CN CN2007101766338A patent/CN101184037B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1731760A (en) * | 2005-08-05 | 2006-02-08 | 武汉理工大学 | Ad Hoc network routing method based on flooding mechanism |
Non-Patent Citations (4)
| Title |
|---|
| 任智 等.移动ad hoc网组播路由协议研究进展.计算机科学31 3.2004,31(3),7-14. |
| 任智 等.移动ad hoc网组播路由协议研究进展.计算机科学31 3.2004,31(3),7-14. * |
| 孙强 等.一种分布式Ad hoc网络广播算法.武汉理工大学学报31 3.2007,31(3),415-417. |
| 孙强 等.一种分布式Ad hoc网络广播算法.武汉理工大学学报31 3.2007,31(3),415-417. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101184037A (en) | 2008-05-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101184037B (en) | Probability effective broadcast coefficient based flooding method | |
| US20090296704A1 (en) | Method for multi-path source routing in sensor network | |
| da Hora et al. | Enhancing peer-to-peer content discovery techniques over mobile ad hoc networks | |
| CN101883048A (en) | Routing method of multi-dimensional network | |
| CN102148756A (en) | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method | |
| CN104010343A (en) | Wireless network optimization method for intelligent meter reading system | |
| CN104754688A (en) | Routing method for entangled state based wireless Mesh quantum communication network | |
| Sharma et al. | Behavioral study of MANET routing protocols by using NS-2 | |
| Yujun et al. | The research on an AODV-BRL to increase reliability and reduce routing overhead in MANET | |
| Cheng et al. | Adaptive lookup protocol for two-tier VANET/P2P information retrieval services | |
| CN110178410A (en) | A kind of communication path determines method and the network equipment | |
| Xi et al. | An encounter-based multicast scheme for disruption tolerant networks | |
| Goyal et al. | Modified local link failure recovery multicast routing protocol for MANET | |
| Zheng et al. | A QoS Routing Protocol for Mobile Ad Hoc Networks Based on Multipath. | |
| Liu et al. | A swarm intelligence routing algorithm for MANETs. | |
| Mistry et al. | A survey: Use of ACO on AODV & DSR routing protocols in MANET | |
| Kasraoui et al. | Improvement of Zigbee routing protocol | |
| Oliveira et al. | Flooding techniques for resource discovery on high mobility MANETs | |
| Hwang et al. | Cross-layer design of P2P file sharing over mobile ad hoc networks | |
| Su et al. | An efficient multi-source multicast routing protocol in mobile ad hoc networks | |
| Suman et al. | Comparative study of routing protocols for mobile ad-hoc networks | |
| Kasraoui et al. | Zbr-M: A New Zigbee Routing Protocol. | |
| Onuara et al. | A Comprehensive Review of Routing Protocols for Mobile Ad Hoc Networks (Manets) | |
| Dholey et al. | ACOLBR: ACO Based Load Balancing Routing in MANET | |
| Johnson | QoS improvement in MANET using self organized balanced optimization |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100602 Termination date: 20131031 |