CN113038535A - Bandwidth-based multi-source transmission load balancing method in wireless multi-hop network - Google Patents

Bandwidth-based multi-source transmission load balancing method in wireless multi-hop network Download PDF

Info

Publication number
CN113038535A
CN113038535A CN201911254070.9A CN201911254070A CN113038535A CN 113038535 A CN113038535 A CN 113038535A CN 201911254070 A CN201911254070 A CN 201911254070A CN 113038535 A CN113038535 A CN 113038535A
Authority
CN
China
Prior art keywords
node
content
bandwidth
nodes
packet
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
Application number
CN201911254070.9A
Other languages
Chinese (zh)
Other versions
CN113038535B (en
Inventor
邝建
丁若尧
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong University of Foreign Studies
Original Assignee
Guangdong University of Foreign Studies
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guangdong University of Foreign Studies filed Critical Guangdong University of Foreign Studies
Priority to CN201911254070.9A priority Critical patent/CN113038535B/en
Publication of CN113038535A publication Critical patent/CN113038535A/en
Application granted granted Critical
Publication of CN113038535B publication Critical patent/CN113038535B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H04W28/14—Flow control between communication endpoints using intermediate storage
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/26—Resource reservation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a multisource transmission load balancing method based on bandwidth in a wireless multi-hop network, and provides a load balancing method based on available bandwidth of nodes aiming at the defects of insufficient accuracy and the like of the traditional multisource transmission load balancing method. Firstly, content searching: the request node broadcasts a request packet to search for content providers existing in the network, and the request packet records node identifiers passing along; secondly, content determination: the content provider returns a request confirmation packet, and calculates the rate at which each content provider node should transmit the content according to the bandwidth conditions of the nodes and the neighbor nodes, namely, load balancing is carried out; thirdly, bandwidth reservation: the requester distributes different parts of the content transmitted by each content provider, informs the content providers to send the content at a load balanced rate and performs bandwidth reservation on the related nodes; and finally, content transmission: the content providers transmit the content in a load balancing manner.

Description

Bandwidth-based multi-source transmission load balancing method in wireless multi-hop network
Technical Field
The invention relates to the field of wireless multi-hop networks, in particular to a method for multi-source transmission in a wireless multi-hop network, and more particularly relates to a method for load balancing of multi-source transmission in the wireless multi-hop network based on available bandwidth of nodes.
Background
With the development of internet technology, accessing the internet through a wireless manner is gradually becoming a main manner of accessing the internet. There are many types of wireless networks. From the use of technology classes are: cellular networks represented by 4G and 5G, wireless networks based on IEEE802.11 protocol, and the like; the topological hop count from a wireless network is classified as: single hop wireless networks (e.g., cellular networks and IEEE802.11 based wireless local area networks, WLANs), multi-hop wireless networks (e.g., wireless multi-hop ad hoc networks based on the IEEE802.11 protocol).
In a wireless multi-hop network with access to the internet, a typical network consists of several access points and mobile terminals. The access point is a node which can access the internet, and the mobile terminal is a wireless device. For example, in a wireless multi-hop network based on IEEE802.11, an access point is a wireless router which has access to the internet inside a building, and a mobile terminal is a wireless device such as a mobile phone and a notebook computer; the mobile terminal can be connected with the wireless router by one hop and then connected with the internet, and can also be connected with other mobile terminals in a multi-hop mode and then connected with the wireless router to be connected with the internet. Compared with a single-hop wireless network, the multi-hop wireless network has the advantages of enlarging the network coverage area and the like.
In a wireless multi-hop network, a mobile terminal may join the internet through multiple access points. Thus, multi-source transmission may be implemented in a wireless multi-hop network. For example, a mobile terminal requesting resources on the internet via a wireless multihop network may find multiple paths to different access points. In the transmission process, the transmission efficiency is improved by transmitting different parts of the same content through different access point paths.
However, multi-source simultaneous transmissions where different access points transmit different portions of the same content requires solving the multi-source multi-path load balancing problem. On the other hand, the proportion of network traffic occupied by network multimedia applications such as video and audio has become larger and larger, and the network multimedia applications require the network to provide high Quality of Service (QoS) support. The transmission of multimedia applications in a network therefore requires resources such as network reserved bandwidth.
Disclosure of Invention
The invention aims to solve the problems in the prior art and provides a bandwidth-based multi-source transmission load balancing method for a wireless multi-hop network.
The purpose of the invention is realized by the following technical scheme:
a method for multi-source transmission load balancing based on bandwidth under a wireless multi-hop network comprises the following steps:
s1, content searching: requesting nodes in a wireless multi-hop network to broadcast REquest packets (REP) to search for content providers existing in the network, wherein the REquest packets record node identifiers passing along;
s2, content determination: if a plurality of nodes in the network cache the same content, the request packet finds a plurality of content providers; each content provider returns a Request Acknowledgement Packet (RAP) to Acknowledge the Request; in the process of confirmation, calculating the rate at which each content provider node should transmit the content according to the bandwidth conditions of the nodes and the neighbor nodes, namely performing load balancing;
s3, bandwidth reservation: after performing load balancing based on the bandwidth in step S2, the requester allocates different parts of the transmission content to each content provider, notifies each content provider to transmit the content at the load balanced rate, and performs bandwidth reservation for related nodes in the network;
s4, content transmission: the content providers transmit the content in a load balancing manner.
Further, the node in the wireless multi-hop network periodically calculates its Available Bandwidth (AB), and the specific method is as follows: the available bandwidth of the node is the ratio of the maximum transmission rate of the node multiplied by the idle time of the node in the period to the whole period time; and acquires the available bandwidth of the neighbor node through a beacon frame (e.g., the node periodically sends a Hello packet to the neighbor node).
Further, when requesting content, the content requester needs to broadcast a request packet REP, which contains the identifier of the target content, and when the REP is forwarded by a node in the network, records the identifier (e.g., IP address) of the forwarding node until encountering the node with the target content cached therein or the network does not have the target content.
Further, after receiving the request packet, each content provider returns a request acknowledgement packet RAP along the path recorded in the request packet, and performs load balancing according to the available bandwidth conditions of the forwarding node and its neighboring nodes in the returning process. The specific method comprises the following steps:
after receiving the request packet REP, the content provider generates a request acknowledgement packet RAP, which includes: a return path from the content provider to the requester (e.g., an IP address of a path node), a maximum Rate (DR) supportable by the content provider along the return path, and a Bloom Filter;
the Bloom Filter in the RAP packet is used to record the result of dividing the available bandwidth value of a node by the number of bandwidth competing nodes (denoted by letter c), where the number of bandwidth competing nodes of a certain node is defined as: the number of path nodes in a content transmission path (including a content provider node and a forwarding node in the path) which can consume the bandwidth of the node; the content transmission is sent from a content provider node, forwarded through a series of forwarding nodes and finally received by a content requester; the data packet can consume the bandwidth of related nodes (including nodes and other neighbor nodes in the path) in the network in the transmission process, and the bandwidth competition node number of a certain related node is the node number which can consume the bandwidth of the node in the content transmission path;
secondly, after the content provider generates a RAP packet, initializing DR to ∞ (the value can change in the load balancing process), and specifically initializing Bloom Filter:
assuming that a content provider node is e, a neighbor node set of the content provider node is set (e), and a node f is a neighbor node of the node e, namely f belongs to set (e); let each element of the Bloom Filter be ∞, and the term related to the node f in the Bloom Filter be
Figure BSA0000197000240000041
Then the values of the elements of the Bloom Filter satisfy:
Figure BSA0000197000240000042
wherein, cfCompeting for node f bandwidth, since only the bandwidth of the relevant node is consumed by the content provider node to send data packet, so cf＝1；
Then, the content provider sends the RAP packet to the next hop node in the path;
after receiving the RAP, the forwarding node needs to update the Bloom Filter and the DR therein, and the specific method comprises the following steps:
a. if the forwarding node only receives the RAP of one path, then:
assuming that the forwarding node is i, the relevant bandwidth consuming node (i.e. the node which consumes bandwidth during content transmission) is j, and the item related to j in the Bloom Filter is:
Figure BSA0000197000240000043
then the Bloom Filter is updated as:
cj←cj+1 (2)
Figure BSA0000197000240000044
wherein the value recorded by the element of the Bloom Filter is
Figure BSA0000197000240000045
When j ∈ set (i), the node i holds ABjSo that c can be obtainedj(ii) a For example, the query results in that the value of the node j in the Bloom Filter is BFjThen c isj＝ABj/BFj；
The data rate in updating RAPs is:
Figure BSA0000197000240000051
wherein, cjIs the value after update in Bloom Filter;
b. if the forwarding node receives RAPs sent from different content providers, each RAP represents a content provider and a corresponding path, the forwarding node needs to merge the RAPs sent from different content providers, which is specifically done in the following way:
assuming that node i receives K RAP packets, representing K content providers and K paths:
each path updates DR to:
Figure BSA0000197000240000052
order to
Figure BSA0000197000240000053
Then the Bloom Filter and DR in the RAP are updated as:
Figure BSA0000197000240000054
Figure BSA0000197000240000055
Figure BSA0000197000240000056
and fourthly, the forwarding node is used for forwarding the RAP packet by the upper mechanism in sequence until the request node receives the RAP packet.
Further, after receiving the acknowledgement RAP packets sent by a plurality of different providers, the content requester determines which segments of the content each provider provides and the required available bandwidth according to the data rate DR reported by the RAP. The requester then sends the request for each adjacency direction to the associated content provider along the path defined by the REP packet in a reservation message. In the process, the nodes in the path and the related neighbor nodes make bandwidth reservation, namely, the related nodes subtract the reserved bandwidth value from the available bandwidth of the related nodes.
Further, each content provider performs content transmission in a load balancing manner, that is, assembling data packets according to the data rate and content fragment condition determined by the requester and sending the data packets to the content requester.
Compared with the prior art, the invention has the following advantages and effects:
(1) the requester node of the wireless multi-hop network can find a plurality of content providers in the content searching stage and determine corresponding transmission paths.
(2) The multisource transmission load balancing method based on the bandwidth in the wireless multi-hop network can realize load balancing transmission based on the bandwidths of the transmission nodes and the neighbor nodes in the transmission process.
Drawings
FIG. 1 is a schematic diagram of a content search process in a wireless multi-hop network according to the present invention;
fig. 2 is a schematic diagram of content determination and load balancing in a wireless multi-hop network according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Examples
As shown in fig. 1, each node in the wireless multi-hop network periodically calculates its Available Bandwidth (AB) by using a statistical method, and the specific method is as follows: the available bandwidth of the node is the ratio of the maximum transmission rate of the node multiplied by the idle time of the node in the period to the whole period time; and acquires the available bandwidth of the neighbor node through a beacon frame (e.g., the node periodically sends a Hello packet to the neighbor node).
As shown in the schematic diagram of the content searching process in the wireless multi-hop network shown in FIG. 1, the node R is a content requester node, and the nodes P1 and P2 cache target content. In the content search phase, the requester R broadcasts a request packet REP; the REP is forwarded by the nodes in the network, via the path R → C → a → P1 and the path R → C → B → P2, to the content providers P1 and P2, respectively; the REP records the identity of the forwarding node, i.e., the IP address of the node in the path.
As shown in fig. 2, a schematic diagram of content determination and load balancing processes in a wireless multi-hop network, after receiving a request packet, content providers P1 and P2 respectively return a request acknowledgement packet RAP along a path recorded in a request packet REP, and in the return process, perform load balancing according to available bandwidth conditions of a forwarding node and its neighboring nodes.
For example, after receiving the request packet REP, the content provider P1 generates a request acknowledgement packet RAP, which includes: return path from P1 to requester R: p1 → A → C → R, the maximum rate DR supportable by the content provider along the return path, and a Bloom Filter. P1 initializes DR to ∞ (the value changes during load balancing), and initializes Bloom Filter specifically:
let the Set of neighbor nodes of P1 be Set (P1), i.e., Set (P1) ═ a, D }. Suppose node x is a neighbor node of the content provider P1, i.e. x ∈ Set (P1); let each element of the Bloom Filter be ∞, and the term in the Bloom Filter related to the node x be ∞
Figure BSA0000197000240000071
Then the values of the elements of the Bloom Filter satisfy:
Figure BSA0000197000240000072
wherein, cxCompete for node x bandwidth for node number, since currentlyComputing only the bandwidth of the relevant node consumed by the content provider node to send data packets, and cx＝1。
The content provider P1 then sends the RAP packet to the next hop node a in the path.
After receiving the RAP, the forwarding node a needs to update the Bloom Filter and DR therein, and since the forwarding node a only receives the RAP of one path, the updating method is as follows:
assuming that the relevant bandwidth consuming node (i.e. the node consuming bandwidth during content transmission) is j, the item related to j in the Bloom Filter is:
Figure BSA0000197000240000081
then the Bloom Filter is updated as:
cj←cj+1，j∈Set(A) (2)
Figure BSA0000197000240000082
wherein the value recorded by the element of the Bloom Filter is
Figure BSA0000197000240000083
When j ∈ set (A), the node A holds ABjSo that c can be obtainedj(ii) a For example, the query results in that the value of the node j in the Bloom Filter is BFjThen c isj＝ABj/BFj；
The data rate in updating RAPs is:
Figure BSA0000197000240000084
wherein, cjIs the value after the update in the Bloom Filter.
Then, the forwarding node a sends the updated RAP packet to the node C.
Since the forwarding node C receives 2 RAPs sent from different content providers P1 and P2, representing the content providers P1 and P2 and corresponding paths, respectively, the forwarding node C needs to merge the 2 RAPs sent from P1 and P2, specifically:
first, the DR is updated for the RAP of each path respectively as:
Figure BSA0000197000240000085
order to
Figure BSA0000197000240000086
Then, 2 RAPs are merged into one RAP, and the Bloom Filter and DR in the RAP after merging are as follows:
Figure BSA0000197000240000091
Figure BSA0000197000240000092
Figure BSA0000197000240000093
then, the forwarding node C returns the summarized RAP to the requesting node R.
After receiving the confirmation packet RAP, the content requester R determines which segments of the content each provider provides and the required available bandwidth according to the data rate DR reported by the RAP; then, the requester R puts the request for each adjacent direction in a reservation message, and sends the request to the relevant content provider along the path determined by the REP packet; in the process, the nodes in the path and the related neighbor nodes make bandwidth reservation, namely, the related nodes subtract the reserved bandwidth value from the available bandwidth of the related nodes.
Finally, the content providers P1 and P2 perform content transmission in a load-balanced manner, i.e., assemble packets for delivery to the content requester R at the previously determined data rate and content segment conditions.
The above embodiments are preferred embodiments of the present invention, but the present invention is not limited to the above embodiments, and any other changes, modifications, substitutions, combinations, and simplifications which do not depart from the spirit and principle of the present invention should be construed as equivalents thereof, and all such changes, modifications, substitutions, combinations, and simplifications are intended to be included in the scope of the present invention.

Claims (6)

1. A multisource transmission load balancing method based on bandwidth in a wireless multi-hop network is characterized by comprising the following steps:
s1, content searching: requesting nodes in a wireless multi-hop network to broadcast REquest packets (REP) to search for content providers existing in the network, wherein the REquest packets record node identifiers passing along;
s2, content determination: if a plurality of nodes in the network cache the same content, the request packet finds a plurality of content providers; each content provider returns a Request Acknowledgement Packet (RAP) to Acknowledge the Request; in the process of confirmation, calculating the rate at which each content provider node should transmit the content according to the bandwidth conditions of the nodes and the neighbor nodes, namely performing load balancing;
s3, bandwidth reservation: after performing load balancing based on the bandwidth in step S2, the requester allocates different parts of the transmission content to each content provider, notifies each content provider to transmit the content at the load balanced rate, and performs bandwidth reservation for related nodes in the network;
s4, content transmission: the content providers transmit the content in a load balancing manner.
2. The method according to claim 1, wherein the nodes in the wireless multi-hop network periodically calculate their Available Bandwidth (AB), and the specific method is as follows: the available bandwidth of the node is the ratio of the maximum transmission rate of the node multiplied by the idle time of the node in the period to the whole period time; and acquires the available bandwidth of the neighbor node through a beacon frame (e.g., the node periodically sends a Hello packet to the neighbor node).
3. The method of claim 1, wherein a content requester needs to broadcast a request packet REP when requesting content, the REP packet includes an identifier of a target content, and when the REP is forwarded by a node in the network, the identifier (e.g., IP address) of a forwarding node is recorded until the node with the target content cached therein is encountered or the target content is absent from the network.
4. The method for bandwidth-based multi-source transmission load balancing in a wireless multi-hop network according to claims 1 to 3, wherein each content provider returns a Request Acknowledgement Packet (RAP) along a path recorded in the request packet after receiving the request packet, and performs load balancing according to available bandwidth conditions of a forwarding node and its neighboring nodes in the process of returning, specifically:
1) after receiving the request packet REP, the content provider generates a request acknowledgement packet RAP, which includes: a return path from the content provider to the requester (e.g., an IP address of a path node), a maximum Rate (DR) supportable by the content provider along the return path, and a Bloom Filter;
the Bloom Filter in the RAP packet is used to record the result of dividing the available bandwidth value of a node by the number of bandwidth competing nodes (denoted by letter c), where the number of bandwidth competing nodes of a certain node is defined as: the number of path nodes in a content transmission path (including a content provider node and a forwarding node in the path) which can consume the bandwidth of the node; the content transmission is sent from a content provider node, forwarded through a series of forwarding nodes and finally received by a content requester; the data packet can consume the bandwidth of related nodes (including nodes and other neighbor nodes in the path) in the network in the transmission process, and the bandwidth competition node number of a certain related node is the node number which can consume the bandwidth of the node in the content transmission path;
2) after the content provider generates the RAP packet, it initializes DR to ∞ (the value may change during the load balancing process), and the specific way to initialize Bloom Filter is:
assuming that a content provider node is e, a neighbor node set of the content provider node is set (e), and a node f is a neighbor node of the node e, namely f belongs to set (e); let each element of the Bloom Filter be ∞, and the term related to the node f in the Bloom Filter be
Figure FSA0000197000230000021
Then the values of the elements of the Bloom Filter satisfy:
Figure FSA0000197000230000031
wherein, cfCompeting for node f bandwidth, since only the bandwidth of the relevant node is consumed by the content provider node to send data packet, so cf＝1；
Then, the content provider sends the RAP packet to the next hop node in the path;
3) after receiving the RAP, the forwarding node needs to update the Bloom Filter and the DR therein, and the specific method comprises the following steps:
a. if the forwarding node only receives the RAP of one path, then:
assuming that the forwarding node is i, the relevant bandwidth consuming node (i.e. the node which consumes bandwidth during content transmission) is j, and the item related to j in the Bloom Filter is:
Figure FSA0000197000230000032
then the Bloom Filter is updated as:
cj←cj+1 (2)
Figure FSA0000197000230000033
whereinSince the value recorded by the element of Bloom Filter is
Figure FSA0000197000230000034
When j ∈ set (i), the node i holds ABjSo that c can be obtainedj(ii) a For example, the query results in that the value of the node j in the Bloom Filter is BFjThen c isj＝ABj/BFj；
The data rate in updating RAPs is:
Figure FSA0000197000230000035
wherein, cjIs the value after update in Bloom Filter;
b. if the forwarding node receives RAPs sent from different content providers, each RAP represents a content provider and a corresponding path, the forwarding node needs to merge the RAPs sent from different content providers, which is specifically done in the following way:
assuming that node i receives K RAP packets, representing K content providers and K paths:
each path updates DR to:
Figure FSA0000197000230000041
order to
Figure FSA0000197000230000042
Then the Bloom Filter and DR in the RAP are updated as:
Figure FSA0000197000230000043
Figure FSA0000197000230000044
Figure FSA0000197000230000045
4) the forwarding node forwards the RAP packet by using the above mechanisms in sequence until the request node receives the RAP packet.
5. The method for bandwidth-based multi-source transmission load balancing in a wireless multi-hop network according to claims 1 to 4, wherein after a content requester receives acknowledgement packets RAPs from a plurality of different providers, it determines which segments of the content each provider provides and the required available bandwidth according to the data rate DR reported by the RAPs; then, the requester puts the requirement for each adjacent direction in a reservation message and sends the requirement to the related content provider along the path determined by the REP packet; in the process, the nodes in the path and the related neighbor nodes make bandwidth reservation, namely, the related nodes subtract the reserved bandwidth value from the available bandwidth of the related nodes.
6. The method for bandwidth-based multi-source transmission load balancing in a wireless multi-hop network according to claims 1 and 5, wherein each content provider performs content transmission in a load balancing manner, that is, assembling data packets according to the data rate and content segment condition determined in claim 5 and sending the data packets to the content requester.
CN201911254070.9A 2019-12-09 2019-12-09 Multi-source transmission load balancing method based on bandwidth in wireless multi-hop network Active CN113038535B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911254070.9A CN113038535B (en) 2019-12-09 2019-12-09 Multi-source transmission load balancing method based on bandwidth in wireless multi-hop network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911254070.9A CN113038535B (en) 2019-12-09 2019-12-09 Multi-source transmission load balancing method based on bandwidth in wireless multi-hop network

Publications (2)

Publication Number Publication Date
CN113038535A true CN113038535A (en) 2021-06-25
CN113038535B CN113038535B (en) 2022-06-17

Family

ID=76451456

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911254070.9A Active CN113038535B (en) 2019-12-09 2019-12-09 Multi-source transmission load balancing method based on bandwidth in wireless multi-hop network

Country Status (1)

Country Link
CN (1) CN113038535B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101436985A (en) * 2008-10-23 2009-05-20 福建师范大学 High-efficiency Ad Hoc network anonymous QoS routing method
US20140092905A1 (en) * 2012-09-28 2014-04-03 Cisco Technology, Inc. Routing messages in a computer network using deterministic and probabilistic source routes
WO2017157126A1 (en) * 2016-03-15 2017-09-21 华为技术有限公司 Data management method and apparatus, and network device

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101436985A (en) * 2008-10-23 2009-05-20 福建师范大学 High-efficiency Ad Hoc network anonymous QoS routing method
US20140092905A1 (en) * 2012-09-28 2014-04-03 Cisco Technology, Inc. Routing messages in a computer network using deterministic and probabilistic source routes
WO2017157126A1 (en) * 2016-03-15 2017-09-21 华为技术有限公司 Data management method and apparatus, and network device

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
JIAN KUANG，SHUNZHENG YU: "Bandwidth-based QoS-aware Multisource Architecture for Information-Centric Wireless Multihop Networks", 《2018 1ST IEEE INTERNATIONAL CONFERENCE ON HOT INFORMATION-CENTRIC NETWORKING (HOTICN)》 *

Also Published As

Publication number Publication date
CN113038535B (en) 2022-06-17

Similar Documents

Publication Publication Date Title
CN107852362B (en) Mesh network system and method
Toh A novel distributed routing protocol to support ad-hoc mobile computing
US8451807B2 (en) Configuration aware packet routing in an ad-hoc network
US7200149B1 (en) System and method for identifying potential hidden node problems in multi-hop wireless ad-hoc networks for the purpose of avoiding such potentially problem nodes in route selection
US7433965B2 (en) Packet transmission system, packet transmission method, packet transmission device, home agent, mobile terminal, and access router
US8665841B1 (en) Multiple simultaneous mesh routes
US9014051B2 (en) Updating multicast group information of a client device of a wireless mesh network
CN101854697B (en) Multi-constraint quality-of-service control routing method and system for wireless mesh network
CN1489870A (en) Method and system to provide routing protocal for wireless device
US20080159144A1 (en) Quality of service aware routing over mobile ad hoc networks (manets)
JP4072917B2 (en) Packet relay method, communication path setting method, and communication path setting system
KR20080081958A (en) System and method for utilizing multiple radios to increase the capacity of a wireless communication network
EP1956799A1 (en) Voice-over-internet protocol inter-vehicle communications
US8774130B2 (en) Access point, L2 switch and method of supporting multicast handover using the access point and L2 switch
Kalogeiton et al. A topology-oblivious routing protocol for NDN-VANETs
CN106304184B (en) Multi-metric route discovery and establishment method based on AODV (Ad hoc on-demand distance vector)
US10349331B2 (en) Packet processing method for software-defined network
US20070115828A1 (en) Method for sending requests in a network
CN111132236A (en) Multi-unmanned aerial vehicle self-organizing network MPR node selection method based on improved OLSR protocol
Miao et al. Study on research challenges and optimization for internetworking of hybrid MANET and satellite networks
Lim et al. A hybrid centralized routing protocol for 802.11 s WMNs
CN113038535B (en) Multi-source transmission load balancing method based on bandwidth in wireless multi-hop network
Narayana Rao et al. Way-point multicast routing framework for improving QoS in hybrid wireless mesh networks
WO2023070633A1 (en) D2d communication method
Zeng et al. Joint interference optimization and user satisfaction improvement for multicast routing and channel assignment in wireless mesh networks

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant