CN101123576A - A Path Selection Method for Mobile Ad Hoc Networks Based on Bandwidth Constraint and Minimum Load - Google Patents
A Path Selection Method for Mobile Ad Hoc Networks Based on Bandwidth Constraint and Minimum Load Download PDFInfo
- Publication number
- CN101123576A CN101123576A CNA2007100532766A CN200710053276A CN101123576A CN 101123576 A CN101123576 A CN 101123576A CN A2007100532766 A CNA2007100532766 A CN A2007100532766A CN 200710053276 A CN200710053276 A CN 200710053276A CN 101123576 A CN101123576 A CN 101123576A
- Authority
- CN
- China
- Prior art keywords
- node
- route
- bandwidth
- service
- network
- 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.)
- Granted
Links
- 238000010187 selection method Methods 0.000 title claims abstract description 7
- 238000000034 method Methods 0.000 claims abstract description 10
- 230000005540 biological transmission Effects 0.000 claims description 13
- 238000004088 simulation Methods 0.000 abstract description 14
- 238000004904 shortening Methods 0.000 abstract 1
- 238000004364 calculation method Methods 0.000 description 6
- 230000004083 survival effect Effects 0.000 description 3
- 230000007423 decrease Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
本发明涉及一种基于带宽约束和最小负载的移动自组网路径选择方法，所采用的方法是：当节点需要和另外一个节点传输业务时，节点广播路由请求分组；中间节点收到路由请求报文时，比较本节点和目的节点的地址；当目的节点收到从源节点来的路请求时，检查当前的时间是否小于在规定的时间内接收路由请求的时间。本发明解决了移动自组网中由于拓扑结构动态变化而使带宽资源难以确定和由于负载分配不均衡而导致网络中负载重的节点快速耗尽能源，使网络的连接性快速减弱而最终缩短了网络总体生存时间的难题。并使用NS2仿真工具对本发明与现有的AODV协议进行了比较，仿真结果表明，BLLM在分组投递率、丢包率和吞吐量等方面都优于AODV。
The present invention relates to a mobile ad hoc network path selection method based on bandwidth constraints and minimum load. The method adopted is: when a node needs to transmit services with another node, the node broadcasts a routing request packet; the intermediate node receives the routing request packet Comparing the address of this node and the destination node; when the destination node receives the route request from the source node, check whether the current time is less than the time to receive the route request within the specified time. The invention solves the problem that the bandwidth resource is difficult to determine due to the dynamic change of the topological structure in the mobile ad hoc network and the heavy-loaded nodes in the network are rapidly exhausted due to the unbalanced load distribution, so that the connectivity of the network is rapidly weakened and the final shortening is shortened. The overall time-to-live problem of the network. And using NS2 simulation tool to compare the present invention with the existing AODV protocol, the simulation results show that BLLM is superior to AODV in terms of packet delivery rate, packet loss rate and throughput.
Description
Technical Field
The invention belongs to the field of mobile networks, and particularly relates to a mobile ad hoc network path selection method based on bandwidth constraint and minimum load.
Background
In recent years, with the increasing popularity of multimedia applications and the commercialization of mobile ad hoc networks, providing quality of service in mobile ad hoc networks has become an irrevocable problem, and quality of service guarantees have become an important function that must be supported by communication systems, and for mobile ad hoc networks as well, quality of service refers to quality agreements between users sending and receiving information and between users and an integrated service network transmitting information, which is a series of service requirements that need to be met when a network transmits traffic, and generally includes: bandwidth, time delay jitter, packet loss rate, etc. Quality of service guarantees are the quality of service promised by the network to ensure the service by taking a series of policies and measures. The service quality guarantee is a global problem, and all nodes in the network and all protocol layers on the nodes are secondarily and mutually cooperated to be jointly completed. In order to ensure the service quality, network state information as accurate as possible, such as available bandwidth and time delay of a link, needs to be grasped, so that a path with good link quality and enough available resources can be selected to transmit data according to the service quality requirement of the service.
In mobile ad hoc networks, routing protocols should fairly distribute routing tasks among mobile nodes due to power and bandwidth limitations. Most conventional ad hoc routing protocols operate to route many of the generated routes through a small percentage of nodes located centrally in the network. The transmission of a large amount of data through a small number of nodes inevitably leads to network appearance and bottleneck, so that packet queuing waiting time delay and packet loss are increased, the network connectivity is weakened, the call is finally lost due to the network division, and the overall survival time of the network is shortened. Therefore, it is necessary to consider the load and congestion conditions of each node in the network during routing to perform load balancing on the network, so that the network can keep, operate efficiently and stably, and the comprehensive performance of the network can be optimized.
NS2 is the abbreviation of network simulator, it is a discrete event simulator, by the United states Berkeley university LBL, xerox PARC, UCB and USC/ISI jointly developed network simulation integrated environment, have good, expansibility strong, suitable for Windows and Linux system platform characteristics, it is an outstanding simulation tool to study the network topology structure, analyze the network transmission. NS2 is written in two languages of OTc and C + +. The C + + language has high running speed and is easy to realize complex data types and accurate and complex algorithms, so that the method is suitable for detailed simulation and realization of specific protocols; the OTc language runs slower, but can be easily (and interactively) modified, does not require compilation, and is not prone to errors, so it is suitable for use in simulation configuration. The functions that NS2 can perform include: (1) and constructing a network topology. The network topology in NS2 is composed of nodes and links, where nodes can be regarded approximately as a simulation of implementing the bottom three layers of devices in the network, and links can be regarded as a simulation of the physical transmission link. (2) The Agent implementing the RTP protocol. In the NS2, the Agent is the simulation of a certain network protocol, and the NS2 realizes UDP Agent, TCP Agent and agents of some common network application protocols in advance. (3) Loading the Application data stream is achieved by Application/Traffic. The RTP Agent realizes the work of generating the data stream; without loading the Application.
Disclosure of Invention
The invention aims to provide a mobile ad hoc network path selection method based on bandwidth constraint and minimum load, which selects a path with minimum load for service transmission on the basis of ensuring that the bandwidth required by service transmission is provided, thereby ensuring the rapid, efficient and stable transmission of the service in the network, optimizing the comprehensive performance of the network, and solving the problem that the bandwidth resource is difficult to determine due to the dynamic change of a topological structure in the mobile ad hoc network; on the other hand, the energy sources are quickly exhausted by nodes with heavy loads in the network due to unbalanced load distribution, so that the connectivity of the network is quickly weakened, and finally the survival time of the whole network is shortened.
In order to achieve the purpose, the method adopted by the invention is as follows: when the transmission service is carried out in the mobile ad hoc network, the method is completed according to the following steps:
the first step is as follows: when a node needs to transmit service with another node, the node broadcasts a routing request packet, and the routing request packet comprises the following contents: the IP address and the serial number of the destination node, the IP address and the serial number of the source node, the bandwidth required by the service, the ID number of the service, the load information and the hop count;
the second step is as follows: when the intermediate node receives the routing request message, the addresses of the intermediate node and the destination node are compared;
the third step: when the destination node receives a route request from the source node, it checks whether the current time is less than the time for receiving the route request within the prescribed time.
The invention solves the problems that bandwidth resources are difficult to determine due to dynamic change of a topological structure in the mobile ad hoc network, and nodes with heavy loads in the network quickly exhaust energy due to unbalanced load distribution, so that the connectivity of the network is quickly weakened, and the overall survival time of the network is finally shortened. Compared with the existing AODV protocol, the invention is compared by using an NS2 simulation tool, and the simulation result shows that the BLLM is superior to the AODV in the aspects of packet delivery rate, packet loss rate, throughput and the like.
Drawings
Fig. 1 is a connectivity graph of 5 nodes.
Fig. 2 is a wireless network consisting of 7 nodes.
FIG. 3 is a flow chart of the present invention.
FIG. 4 is a graph of packet delivery rate for the present invention.
Fig. 5 is a packet loss rate chart according to the present invention.
Fig. 6 is a graph of throughput for the present invention.
Detailed Description
The present invention is described in further detail below with reference to the attached drawing figures.
Sharing transmission media among nodes in a mobile ad hoc network is one of the remarkable characteristics of a wireless network, and the characteristic causes signals among adjacent nodes to interfere with each other, thereby affecting the normal transmission of information. It is illustrated by a simple example that considering the bandwidth factor does make it possible to improve the performance of the network. Fig. 1 is a connectivity graph of 5 nodes, the points in the graph representing nodes in the network, and the edges in the graph representing wireless links between nodes, assuming that the capacity of the channel is C. When node 1 and node 5 are to communicate, the conventional shortest path based path selection method will select path C-D-E. As can be seen from the figure, since link C is interfered by links A, B, D and E, its effective bandwidth can only reach C/5. If the bandwidth required by the transmitted traffic exceeds C/5, the quality of the communication will not be guaranteed. If path a-B-D-E is selected, C/3 of the effective bandwidth will be obtained. Therefore, considering the mutual interference between the nodes, the better transmission performance can be obtained by taking the bandwidth resources of the nodes as the standard for path selection. Further, from the perspective of the queuing theory, there are data packets waiting to be sent in the queue in each node, and if the number of data packets in the queue is not considered during the path selection, the waiting time delay of the data packets in the queue can be greatly increased, so that the time delay of the data packets from the source node to the destination node is increased, and meanwhile, the packet loss phenomenon occurs because the number of data packets in the queue exceeds the limit of the buffer area.
For any mobile ad hoc network, it can be represented as a directed graph G = { V, E }, and V, E represents node set and link set, respectively, if P is represented by link 1 1 ，1 2 ，...，1 n-1 Or by node v 1 ，v 2 ，...，v n A path from node S to node D is formed, wherein link 1 1 Is node v 1 ，v 2 A link therebetween. The available bandwidth of path P is denoted by B (P) and the load of path P is denoted by L (P). Thus, in a mobile ad hoc network, the path selection problem based on bandwidth constraints and minimum load can be described as: in a given network G = (V, E), a source host S sends a traffic flow to a destination host D, the bandwidth required by the traffic flow is Bq, if there are n paths P from S to D 1 ，P 2 ，...，P n . Then satisfy the bookThe inventive path P should satisfy the following condition:
B(P)≥Bq
L(P)＝min{L(P i )|i＝1，2，...，n}
in a wireless network, when calculating the available bandwidth of a node, the influence of its neighboring nodes is also considered in addition to the node itself. Fig. 2 is a wireless network consisting of 7 nodes where two nodes connected by a solid line can communicate directly and the dashed line indicates that traffic flow is being sent between the nodes. If node a wants to send traffic to E via D, congestion may occur on link AD, however, this link does not carry any traffic, because in wireless transmission, the node shares frequency resources with all nodes within a certain range around it, and congestion may occur when the bandwidth requirement of all traffic within a certain range exceeds the transmission capability of the network. Therefore, when measuring the available bandwidth of a segment of link, not only the traffic of the node but also the usage of resources by the traffic around the node are considered.
The invention defines the 'shared frequency set' of any node D as I (D), and the I (D) is composed of nodes N meeting the following conditions: n is within direct communication range of node D, i.e., N may receive data transmitted by D or D may receive data transmitted by N. In FIG. 1, nodes A, B, C and E are in the "shared frequency set" of D.
The following are variables to be used in the bandwidth calculation:
b (D): total bandwidth of node D. To be more realistic, the total bandwidth of the nodes is randomly generated.
B all (D) The method comprises the following steps Total bandwidth occupied by node D.
B c (D) The method comprises the following steps The current available bandwidth of node D.
B (j): bandwidth of data stream j.
(1)B all (D) Is calculated by
The following two parts need to be considered for calculating the signal bandwidth of the currently occupied node D:
bs (D): the occupied bandwidth of node D itself, i.e. the total bandwidth reserved by node D for other traffic flows.
Bn (D): the sum of the occupied bandwidths of the nodes in the shared frequency set of node D.
Bs (D) and Bn (D) may be obtained from information held by the node. Thus, the remaining bandwidth of node D can be obtained by the following equation:
Ball(D)＝Bs(D)+Bn(D)
＝Bs(D)+Bs(A)+Bs(B)+Bs(C)+Bs(E)
(2)B c (D) Is calculated by
The available bandwidth of the node D is the total bandwidth of the node D minus the total bandwidth occupied by the node D:
Bc(D)＝B(D)-Ball(D)
when a service flow j passes through a node D, if the calculated available bandwidth Bc (D) of the D is more than or equal to B (j), the access of the data flow is allowed, otherwise, the access is refused.
The network load of a mobile node in a wireless mobile ad hoc network is related to traffic passing through the node, as well as traffic passing through its neighboring nodes, which is referred to as traffic interference. The following are variables used in the load calculation:
l (D): the traffic load of node D itself.
LI (D): the traffic of node D interferes with the load.
TL (D): node D total traffic load.
(1) Calculation of L (D)
Assuming that the link capacity is C, the average service length is L, and the node interface queue length is q, the load L (D) of any node D is:
L(D)＝μ D q D /(1+q D )
in the formula, mu D ＝C D /L D 。
(2) Calculation of LI (D)
Traffic interference LI (D) may be defined as the sum of the traffic loads of the nodes in node D's shared frequency set I (D):
(3) Calculation of TL (D)
The traffic load TL (D) of a node comprises the sum of its own traffic L (D) and the traffic interference LI (D) of the nodes in the shared frequency set I (D):
(4) Calculation of load on path
The load of the path P from the source node to the destination node is the sum of the traffic loads of all intermediate nodes I on the path:
the method comprises the following specific steps:
(1) When a node needs to transmit service with another node, the node broadcasts a routing request packet, wherein the routing request packet comprises the following contents:
the IP address and the serial number of the destination node, the IP address and the serial number of the source node, the bandwidth required by the service, the ID number of the service, the load information and the hop count;
(2) When the intermediate node receives the routing request message, the addresses of the node and the destination node are compared;
(1) if the node is not the destination node, judging whether the request is received, if so, discarding the request, otherwise, turning to the step (2);
(2) calculating the current residual bandwidth and comparing the current residual bandwidth with the bandwidth required by the service, if the current residual bandwidth is less than the bandwidth required by the service, discarding the request, and otherwise, turning to the step (3);
(3) calculating the total service load of the node, and updating the parameters recorded in the routing request packet: the load information in the route request packet is modified and the hop count is increased by 1. A reverse route is then established to the source node and the ID number of the traffic is recorded in the route entry. And finally broadcasting the routing request message to the adjacent node.
(3) When the destination node receives the route request from the source node, it checks whether the current time is less than the time for receiving the route request within the specified time.
(1) If yes, continuing to wait, otherwise, turning to the step (2);
(2) selecting one route request with the minimum load from the multiple route requests, performing route reply along a reverse route established by the request, performing resource reservation after the intermediate node receives the route reply, establishing a forward route to a destination node, and recording the ID number of the service in a route entry.
The time complexity represents the number of steps that need to be run to perform a protocol operation. In the invention, when the nodes communicate each time, the routing request needs to be sent for bandwidth reservation, therefore, the source node sends out a routing request packet, the destination node returns a routing reply packet to traverse the network twice, the time complexity is 2d order of magnitude, namely O (2 d), wherein d is the diameter of the network. The communication complexity refers to the number of information required to be transmitted to perform protocol operation, where the worst case of a routing request performed by a node is that routing queries are performed in a distributed manner and simultaneously at each node, and the communication complexity is O (2N), where N is the number of nodes in the network.
The RREQ in the flow chart (fig. 3) represents a route request packet and the RREP represents a route reply packet. T indicates positive and F indicates negative.
In order to analyze the performance of the invention, corresponding simulation experiments are carried out, the AODV protocol is selected as a reference object in the experiments, and the three indexes of the AODV protocol, namely the packet delivery rate, the throughput and the packet loss rate, are compared. The simulation implementation of the protocol is based on the network simulation software NS 2. In the experiment, a scene containing 30 nodes is selected, the size of the scene is a rectangular area of 800m multiplied by 1000m, each node randomly selects the motion direction and the motion speed, the maximum motion speed is respectively 10m/s,20m/s,35m/s,60m/s and 100m/s, and the scene maintaining time is 500s. The packet rate is 2/s, each request needs to transmit a data packet of 1000B, and the bandwidth value of each node is generated by using a random number ranging from (1-5) Mbps.
The simulation result shows that the performance of the invention is superior to that of AODV, and as can be seen from FIG. 4, the packet delivery rate of the invention and AODV under different speeds is higher than that of AODV, and as the moving speed increases, the packet delivery rate of the invention decreases slowly while the packet delivery rate of AODV decreases greatly. In fig. 5, the packet loss rate of the present invention is lower than AODV, and with the change of the moving speed, the packet loss rate of the present invention is in a relatively stable state, while AODV is rapidly increased. Fig. 6 is a comparison of the throughput of the two, and when the moving speed of the node is slow, the throughput of the invention is slightly higher than the AODV, and when the moving speed of the node is fast, the throughput of the invention is much higher than the AODV.
The details not described in the present specification and the prior art known to those skilled in the art.
Claims (3)
1. A mobile ad hoc network path selection method based on bandwidth constraint and minimum load adopts the following steps: when the transmission service is carried out in the mobile ad hoc network, the method is completed according to the following steps:
the first step is as follows: when a node needs to transmit service with another node, the node broadcasts a routing request packet, wherein the routing request packet comprises the following contents: the IP address and the serial number of the destination node, the IP address and the serial number of the source node, the bandwidth required by the service, the ID number of the service, the load information and the hop count;
the second step is as follows: when the intermediate node receives the routing request message, the addresses of the intermediate node and the destination node are compared;
the third step: when the destination node receives a route request from the source node, it checks whether the current time is less than the time for receiving the route request within the prescribed time.
2. The method of claim 1 for mobile ad hoc network path selection based on bandwidth constraints and minimum load, wherein: the second step is specifically as follows:
the first step is as follows: if the node is not the destination node, judging whether the request is received, if so, discarding the request, otherwise, turning to the second step;
the second step is that: calculating the current residual bandwidth and comparing the current residual bandwidth with the bandwidth required by the service, if the current residual bandwidth is less than the bandwidth required by the service, discarding the request, and otherwise, turning to the third step;
the third step: calculating the total service load of the node, and updating the parameters recorded in the routing request packet: modifying the load information in the route request packet, adding 1 to the hop count, then establishing a reverse route to the source node, recording the ID number of the service in the route entry, and finally broadcasting the route request message to the adjacent node.
3. The method of claim 1 for mobile ad hoc network path selection based on bandwidth constraints and minimum load, wherein: the third step is specifically as follows:
the first step is as follows: if yes, continuing to wait, otherwise, turning to the second step;
the second step is that: selecting one route request with the minimum load from the multiple route requests, performing route reply along a reverse route established by the request, performing resource reservation after the intermediate node receives the route reply, establishing a forward route to a destination node, and recording the ID number of the service in a route entry.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100532766A CN101123576B (en) | 2007-09-20 | 2007-09-20 | A Path Selection Method for Mobile Ad Hoc Networks Based on Bandwidth Constraint and Minimum Load |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100532766A CN101123576B (en) | 2007-09-20 | 2007-09-20 | A Path Selection Method for Mobile Ad Hoc Networks Based on Bandwidth Constraint and Minimum Load |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101123576A true CN101123576A (en) | 2008-02-13 |
| CN101123576B CN101123576B (en) | 2011-02-09 |
Family
ID=39085756
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007100532766A Expired - Fee Related CN101123576B (en) | 2007-09-20 | 2007-09-20 | A Path Selection Method for Mobile Ad Hoc Networks Based on Bandwidth Constraint and Minimum Load |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101123576B (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102404194A (en) * | 2010-09-16 | 2012-04-04 | 株式会社日立制作所 | Transport control server, transport control system, and transport control method |
| CN103155587A (en) * | 2010-10-28 | 2013-06-12 | 国际商业机器公司 | Method and system for transmitting data packets in a network |
| CN104301256A (en) * | 2014-10-31 | 2015-01-21 | 杭州华三通信技术有限公司 | Method for dynamically reserving bandwidths in SDN and controller |
| CN105516328A (en) * | 2015-12-18 | 2016-04-20 | 浪潮(北京)电子信息产业有限公司 | Dynamic load balancing method and system, and devices used for distributed storage system |
| CN106304184A (en) * | 2016-08-17 | 2017-01-04 | 上海交通大学 | The route discovery of many tolerance amount based on AODV and the method for foundation |
| CN106658605A (en) * | 2016-12-19 | 2017-05-10 | 中国电子科技集团公司第二十研究所 | Routing method based on distributed network load sensing |
| CN107241268A (en) * | 2017-07-20 | 2017-10-10 | 北京航空航天大学 | Local multipath method for routing and device based on satellite-based ADS B message satellite networks |
| WO2018210075A1 (en) * | 2017-05-18 | 2018-11-22 | 华为技术有限公司 | Network control method and apparatus, and network device |
| CN109768824A (en) * | 2019-01-17 | 2019-05-17 | 西安电子科技大学 | Low-orbit satellite data transmission method, system, computer equipment and storage medium |
| CN110418168A (en) * | 2019-08-05 | 2019-11-05 | 黄颖 | A kind of flow-medium transmission method |
| CN110912820A (en) * | 2019-10-30 | 2020-03-24 | 深圳马可孛罗科技有限公司 | Distributed routing method, distributed routing apparatus, and computer-readable storage medium |
| CN116155799A (en) * | 2023-01-09 | 2023-05-23 | 北京特立信电子技术股份有限公司 | Ad hoc network communication system, message communication method, and readable storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100425029C (en) * | 2004-04-19 | 2008-10-08 | 中国科学院计算技术研究所 | Internet Access Method Based on On-Demand Routing in Mobile Ad Hoc Networks |
-
2007
- 2007-09-20 CN CN2007100532766A patent/CN101123576B/en not_active Expired - Fee Related
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102404194B (en) * | 2010-09-16 | 2016-04-06 | 株式会社日立制作所 | Transmission Control Server, transmission control system and transfer control method |
| CN102404194A (en) * | 2010-09-16 | 2012-04-04 | 株式会社日立制作所 | Transport control server, transport control system, and transport control method |
| CN103155587A (en) * | 2010-10-28 | 2013-06-12 | 国际商业机器公司 | Method and system for transmitting data packets in a network |
| CN104301256A (en) * | 2014-10-31 | 2015-01-21 | 杭州华三通信技术有限公司 | Method for dynamically reserving bandwidths in SDN and controller |
| CN105516328A (en) * | 2015-12-18 | 2016-04-20 | 浪潮(北京)电子信息产业有限公司 | Dynamic load balancing method and system, and devices used for distributed storage system |
| CN106304184B (en) * | 2016-08-17 | 2020-11-06 | 上海交通大学 | A method of route discovery and establishment based on multi-metric metric of AODV |
| CN106304184A (en) * | 2016-08-17 | 2017-01-04 | 上海交通大学 | The route discovery of many tolerance amount based on AODV and the method for foundation |
| CN106658605A (en) * | 2016-12-19 | 2017-05-10 | 中国电子科技集团公司第二十研究所 | Routing method based on distributed network load sensing |
| CN106658605B (en) * | 2016-12-19 | 2020-02-07 | 中国电子科技集团公司第二十研究所 | Routing method based on distributed network load perception |
| WO2018210075A1 (en) * | 2017-05-18 | 2018-11-22 | 华为技术有限公司 | Network control method and apparatus, and network device |
| CN107241268A (en) * | 2017-07-20 | 2017-10-10 | 北京航空航天大学 | Local multipath method for routing and device based on satellite-based ADS B message satellite networks |
| CN109768824A (en) * | 2019-01-17 | 2019-05-17 | 西安电子科技大学 | Low-orbit satellite data transmission method, system, computer equipment and storage medium |
| CN110418168A (en) * | 2019-08-05 | 2019-11-05 | 黄颖 | A kind of flow-medium transmission method |
| CN110912820A (en) * | 2019-10-30 | 2020-03-24 | 深圳马可孛罗科技有限公司 | Distributed routing method, distributed routing apparatus, and computer-readable storage medium |
| CN116155799A (en) * | 2023-01-09 | 2023-05-23 | 北京特立信电子技术股份有限公司 | Ad hoc network communication system, message communication method, and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101123576B (en) | 2011-02-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101123576A (en) | A Path Selection Method for Mobile Ad Hoc Networks Based on Bandwidth Constraint and Minimum Load | |
| Senthilkumaran et al. | Dynamic congestion detection and control routing in ad hoc networks | |
| US9838166B2 (en) | Data stream division to increase data transmission rates | |
| US8000239B2 (en) | Method and system for bandwidth allocation using router feedback | |
| Santhi et al. | Fuzzy-cost based multiconstrained QoS routing with mobility prediction in MANETs | |
| Chughtai et al. | Congestion detection and alleviation in multihop wireless sensor networks | |
| Alghamdi | Route optimization to improve QoS in multi-hop wireless sensor networks | |
| Kotecha et al. | Multi objective genetic algorithm based adaptive QoS routing in MANET | |
| de Mello et al. | Improving load balancing, path length, and stability in low-cost wireless backhauls | |
| Qin et al. | A cross-layer QoS design with energy and traffic balance aware for different types of traffic in MANETs | |
| JP4847284B2 (en) | Wireless communication apparatus, wireless communication method, and wireless communication program | |
| He et al. | Using flow cost to globally allocate and optimize limited bandwidth in multipath routing | |
| Razi et al. | Nq-gpls: n-queen inspired gateway placement and learning automata-based gateway selection in wireless mesh network | |
| Ktari et al. | Load balanced multipath routing in mobile ad hoc network | |
| Vinya et al. | ANALYSIS OF UNICAST ROUTING IN COGNITIVE NETWORKS USING DDCR OVER TRADITIONAL NETWORKS. | |
| Alleema et al. | Cooperative and fresher encounter algorithm for reducing delay in MANET | |
| Shakya et al. | Investigation of TCP congestion control with reliable communication technique in MANET | |
| Roman et al. | A shim layer for heterogeneous wireless communications scheduling in intelligent transport systems | |
| Sundar et al. | Optimized Channel Awareness Routing For Congestion Avoidance by Dynamic Queue Space Management in MANET | |
| Maruthamuthu et al. | QoS aware power and hop count constraints routing protocol with mobility prediction for MANET using SHORT | |
| Asif et al. | Admission control protocols in mobile ad hoc networks provisioning QoS | |
| Rakas et al. | A survey on quality of service in MANET | |
| Ramraj | Bandwidth allocation and routing information for wireless mobile ad-hoc networks | |
| AlZabin et al. | A QoS based DSR routing protocol for MANETs using bandwidth | |
| Lega et al. | An Enhanced Scheduling Technique To Maintain Qos In Real Time Data Communication In Wireless Mesh Networking |
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: 20110209 Termination date: 20120920 |