EP1506643A1 - Acheminement de paquets de donnees par un reseau radiotelephonique - Google Patents

Acheminement de paquets de donnees par un reseau radiotelephonique

Info

Publication number
EP1506643A1
EP1506643A1 EP03719018A EP03719018A EP1506643A1 EP 1506643 A1 EP1506643 A1 EP 1506643A1 EP 03719018 A EP03719018 A EP 03719018A EP 03719018 A EP03719018 A EP 03719018A EP 1506643 A1 EP1506643 A1 EP 1506643A1
Authority
EP
European Patent Office
Prior art keywords
network
data packets
data
distance information
bandwidth
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.)
Withdrawn
Application number
EP03719018A
Other languages
German (de)
English (en)
Inventor
Keijo Lahetkangas
Kai Mustonen
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.)
Nokia Oyj
Original Assignee
Nokia Oyj
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 Nokia Oyj filed Critical Nokia Oyj
Publication of EP1506643A1 publication Critical patent/EP1506643A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
    • 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/30—Routing of multiclass traffic
    • 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/302—Route determination based on requested QoS
    • H04L45/306—Route determination based on the nature of the carried application
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • the present invention is concerned with the quality of service in wireless networks and particularly but not exclusively the quality of service in dynamically changing networks such as mobile ad hoc networks.
  • QoS quality of service
  • a communication path might for example be established between a sending application and a receiving application over a communication network which routes messages between nodes of that network on a hop-per-hop basis. Therefore if a sending application is aware of the quality of service that can be supported over a particular route through the network, then it is able to judge whether a particular application can be run at that instant in time. For example, if a sending terminal wanted to video conference with a receiving terminal it would be useful to know if the various routes through the communication network are able to support the bandwidth requirements imposed by such a video conference application.
  • a mobile ad hoc network is an autonomous system of mobile routers which are connected to one another over wireless communication channels. Due to the mobile nature of such a network the routers are free to move randomly so that the network architecture is of an arbitrary nature.
  • an Internet Engineering Task Force has set up a Mobile ad hoc Network (MANET) working group in trying to standardise work in this area.
  • MANET Mobile ad hoc Network
  • a Mobile ad hoc Network does not have defined communication routes due to its ever-changing topology and as such it is problematic in trying to establish a quality of service (QoS) for a particular application to be executed over such a network. For this reason, it is more realistic to consider the statistical nature of QoS in ad hoc networks, which can be done by calculating the probability of achieving a particular QoS over an ad hoc network.
  • the aim of the present invention is to provide a greater determination of prioritising traffic over a network.
  • the QoS is approximated with parameters of bandwidth and distance.
  • a method of routing data packets through a wireless network comprising: identifying bandwidth information for each data packet; determining distance information for each data packet; using the bandwidth and distance information to determine a priority indicator for transmitting the data packets over the network; and using the priority indicator at each node in said network to control transmission of the data packets through the network.
  • a system for routing data packets through a wireless network comprising: means for establishing bandwidth information for each data packet; means for determining distance information for each data packet; means for using the bandwidth and distance information to determine a priority indicator for transmitting the data packets over the network and arranged to control transmission of the data packets through the network based on the priority indicator.
  • the priority indicator is determined based on a substantially inverse relationship between the bandwidth and distance information to allow for fair allocation of ail data packets.
  • the priority indicator is determined based substantially on distance information so that packets having a short distance are forwarded with highest priority irrespective of the bandwidth.
  • the bandwidth and distance information are transmitted within a header portion of each data packet.
  • the priority indicator controls the order that each node forwards each received data packet so that packets having highest priority are forwarded first and wherein the priority indicator is selected from one of three priority levels being high, medium and low.
  • the priority indicator is selected from one of three priority levels being high, medium and low.
  • those having the shortest distance are given highest priority.
  • the data packets are categorised into classes depending on their bandwidth requirements.
  • each data packet includes the distance information upon entry to the network.
  • a reactive routing protocol is applied so that each node of the network is able to establish reactively the distance information.
  • the distance information is comprised of the distance in hops to the destination.
  • the distance information is comprised of the distance in hops from the source.
  • Figure 1 shows an example of an ad hoc network
  • Figure 2 shows the structure of a node of the ad hoc network according to one embodiment
  • Figure 3 shows the priority data within the header of the data packet according to one embodiment
  • Figure 4 shows a QoS routing strategy according to a first embodiment of the present application.
  • Figure 5 shows a QoS routing strategy according to a second embodiment of the present application.
  • FIG. 1 shows an example of a Mobile ad hoc Network according to the present invention.
  • the Mobile ad hoc Network will from now on be referred to as MANET, which, is a popular abbreviation used in this field to indicate these types of networks.
  • the MANET network is comprised of a plurality of network nodes 10, each node having at least one radio transceiver for transmitting and/or receiving from a neighbouring node.
  • each node will have a transmission range which defines a particular broadcast area or so called "cell”.
  • figure 2 shows an example of a block diagram representing the structure of each node of the network according to one embodiment of the present invention.
  • Figure 2 shows each node comprising a router 20, a ' plurality of wireless transceiver communication devices 22 and a plurality of hosts 24. It should be appreciated that while figure 2 indicates the transceiver device 22 to be attached to the router 20 and host units 24, in an alternative embodiment the transceiver device 22 need not be physically integrated into these units as shown. In a preferred embodiment the transceiver devices 22 are designed to transmit and/or receive radio frequency (RF) communication wireless communication channels. Such transceiver units 22 are typically equipped with RF antennas, which are capable of broadcast communications, point to point communications, etc.
  • RF radio frequency
  • Figure 1 represents a snap-shot of a MANET network at a particular instance in time, because by definition the ad hoc nature of such a network means that the topology shown in figure 1 is expected to change dynamically over time. That is, the nodes 10 in a MANET network are free to move arbitrarily. Also, the connectivity or communication links between nodes for example may be removed for some reason or another, one node no longer exists, the nodes have moved out of the cell transmission range, etc. Also communications over wireless networks are typically slower than can be expected from corresponding fixed-line networks, since wireless networks have other limitations such as multi-path effects, noise and other sources of interference.
  • IP Internet Protocol
  • OSI Open * System Interconnection
  • Each interface 26 connecting the various hosts 24 to the router 20 can be of a different wireless technology.
  • IP addressing for each host 24 and the IP protocol it is possible to route messages to these hosts at the network level irrespective of the different physical interfaces 26 used. More particularly, addressing a particular host device 24 in a MANET network can be done by IP addressing where each node has a node identifier and a interface identifier corresponding to a particular interface 26 of the addressed host device 24.
  • a sending host 12 in a first cell 16 is able to communicate with a receiver host (destination) 14 in another cell 18.
  • the sending host 12 and the destination host 14 can transfer data packets using IP address according to the IP protocol.
  • a reactive or proactive based approach For a reactive approach (also often called “demand-based") the routing algorithm to be implemented at any point in time is dependent on a demand or need basis. Thus, this approach can be seen as reactionary where the routing adapts depending on the traffic requirements of the network.
  • a proactive approach assumes a uniform traffic distribution and the routing strategy is established beforehand. Often designers of a network need to decide whether they would prefer the flexibility offered by the reactionary approach, but which often incurs additional processing overheads associated with maintaining an updated topology of the various routes through a changing MANET network.
  • the node sends out basic initialisation messages, for example "hello" messages, and waits for responses from surrounding nodes so that it is able to build up reactively the topology of the network at that time.
  • basic initialisation messages for example "hello" messages
  • each node decides which is the "best" path, assuming there is more than one, to be taken to reach the final destination.
  • path selection There are many well known algorithms used for path selection, which for example can be based on the shortest distance (number of hops) to the destination, the loading of a particular node or nodes in each path, the level of battery power of a particular node or nodes in each path, etc.
  • the node is imbued with information indicating the distance (number of hops) to the final destination, in which the received data packets are forwarded accordingly based on priority information as will be described later.
  • next node in the .selected path will check to see that the current topology is still the same and if so will automatically decrease the distance to the destination (by subtracting one hop from the number of hops to the destination) and forward the packet accordingly based on priority information as will be described later.
  • the size " and complexity of a MANET network can be roughly determined by the number of nodes in a network, the average degree of a network (i.e. the number of neighbouring nodes for a particular node), and the rate at which the MANET's topology is changing.
  • QoS QoS in the MANET networks since there is no guarantee of any connection in the network at any given point in time.
  • the nodes in a MANET network will receive data packets of the format shown in figure 3.
  • Each data packet 30 contains header information 32 as shown.
  • the router 20 within each node 10 is then able to forward each data packet using techniques that are well known in the art, for example using routing tables which determine the next best node onto which the data packet can be forwarded.
  • the connection distance is the number of hops, which will need to be made for the packets to reach the destination host 14.
  • the transmission of a packet from one router to another is known as a hop and it should be appreciated that the present application is capable of implementing the modern methods used by routers to forward packets for example, forwarding packets based on a defined per hop behaviour (PHB).
  • PHB per hop behaviour
  • packets may be forwarded according to category or priority information contained in a packet header.
  • this category information includes bandwidth or bit rate information 36 representing the speed of the transmission and a distance field 38 within the priority information 34 of the packet header 32.
  • bandwidth or bit rate information 36 representing the speed of the transmission
  • distance field 38 within the priority information 34 of the packet header 32.
  • packets are assigned to a particular data stream or class as in Diffserv networks so that packets being transmitted having different speeds fall into different classes.
  • the data packets through the MANET network can be grouped into three classes. Table 1 below shows how packets are categorised into their class depending on their speeds. In particular, a packet is assigned to a data speed class 1 if it has a bit rate greater than 1 mega bit per second. A packet is assigned to a data speed class 2 if there is a bit rate greater than 100 kilo bits per second but less than 1 mega bit per second. A data packet is categorised into a data speed class 3 if it has a bit rate between 0 and 100 kilo bits per second.
  • Figure 4 shows a first embodiment of a table for implementing an even probability at QoS routing strategy the present invention. More particularly, the table in figure 4 is set up so that each node 10 in the MANET network can establish along with the priority information 34 how to forward each data packet so as to achieve an even probability of all packets passing through the network. To achieve an even probability of QoS the routing strategy is set up to allow the fair allocation of bandwidth capacity for all data packets depending on the speed 36 and distance 38 data contained within each packet header 32. As shown in figure 4, packets that are in data speed class 1 (>1 Mbit s) and having only one more hop to reach their destination are determined to be of a high priority.
  • data speed class 1 >1 Mbit s
  • Packets in data speed class 2 (>100 Kbits/s and ⁇ 1 Mbit/s) and having two or less hops to reach their destination are also determined to be of a high priority.
  • Packets in data speed class 3 ( ⁇ 100 Kbits/s) and having five or less hops to their destination are also determined to be of a high priority.
  • Each node in the MANET network will forward each packet depending on the priority determined for each packet. That is, packets having a high priority are given preference and are forwarded first. However, if there are several high priority packets to be forwarded the packets closest to the destination are then forwarded first. Next the node will look for packets having medium priority and if there are several of these the packets closest to the destination are forwarded first. Lastly, the lowest priority packets are forwarded, again those closest to their destination are forwarded first.
  • the routing strategy in figure 4 tries to strike a compromise between the distance 38 and speed 36 parameters. In other words, to achieve an even probability of a desired QoS the greater the distance to the destination the less likely that a high priority will be given to packets in a high data speed class.
  • the probability of a packet being assigned a high priority is an inverse relation between the distance and speed parameters. This solves the problem where high-speed traffic is presented from given priority for long connections.
  • Figure 5 shows an alternative embodiment having a different routing strategy wherein the probability of achieving a desired QoS is now favoured for short connections. That is, from figure 5 it can be seen that each node will give preference to forwarding packets that are close to their destination (i.e. two or less hops) irrespective of the data speed class into which the packet is categorised. Also, packets which are further than two hops but less than or equal to five hops are given medium priority and are forwarded by each node in the MANET network in preference to packets having six or more hops to their destination, which are assigned the lowest priority. As in the embodiment of figure 4, if there is a plurality of packets having the same priority, preference is given to those packets closest to the destination.
  • the distance information 38 it might be preferable for the distance information 38 to be comprised of the distance from the source node 12 in hops, as opposed to the distance to the destination node 14. That is, in many routing algorithms it is possible for each packet to contain a hop count of the number of hops that have been traversed from the source. ⁇ For example, in geolocation-type routing algorithms, although a node might not know the exact distance to the destination, the node might know the distance so far travelled from the hop count information. Therefore, routing strategies for prioritising packets as shown in Figures 4 and 5 can be set-up, in which it can be presumed that packets that are near to a source have a relatively long distance to their destination.
  • a further routing strategy might be that higher priority is given to packets that have just entered the network depending on each packet's bandwidth requirement. For example, assuming all data packets at a node have the same bandwidth requirements, it may be preferable to give a higher priority to packets that have travelled less than 5 nodes from the source node 12 (i.e. closer to the source), whereas a lower priority is given to packets that are already well into the network (i.e. greater than 5 hops).
  • the two embodiments shown in figures 4 and 5 are only examples of the possible implementations of the present invention and that the distance and bandwidth information provide flexibility in allowing a routing strategy to be implemented, which best fits the requirements of a particular network. More particularly, the system designer is able to set up a particular routing strategy based on speed and distance information contained within each data packet and can decide on implementing a particular strategy, which might either be proactive or reactive. Moreover, although specific priority levels and three data speed classes were defined in the embodiments described herein, it should be appreciated that the present invention is flexible in that there can be more or less priority levels and the data speed classes can have different speed ranges depending on the requirements of a particular network.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention concerne un procédé et un système permettant d'améliorer la qualité de service dans les réseaux radioélectriques et notamment les réseaux ad hoc mobiles à changement dynamique. L'invention concerne également un procédé d'acheminement des paquets de données par un réseau en fonction d'une information prioritaire qui est basée sur les exigences de largeur de bande de chaque paquet et sur la distance jusqu'à la destination. Pour accomplir une qualité de service particulière, on utilise un indicateur de priorité pour retransmettre chaque paquet au niveau de chaque noeud du réseau. On détermine l'indicateur de priorité sur la base d'une relation prédéterminée entre la distance et l'information de largeur de bande.
EP03719018A 2002-05-16 2003-04-14 Acheminement de paquets de donnees par un reseau radiotelephonique Withdrawn EP1506643A1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
GB2112886 2002-05-16
GBGB0211286.0A GB0211286D0 (en) 2002-05-16 2002-05-16 Routing data packets through a wireless network
PCT/IB2003/001836 WO2003098882A1 (fr) 2002-05-16 2003-04-14 Acheminement de paquets de donnees par un reseau radiotelephonique

Publications (1)

Publication Number Publication Date
EP1506643A1 true EP1506643A1 (fr) 2005-02-16

Family

ID=9936840

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03719018A Withdrawn EP1506643A1 (fr) 2002-05-16 2003-04-14 Acheminement de paquets de donnees par un reseau radiotelephonique

Country Status (5)

Country Link
US (1) US7822023B2 (fr)
EP (1) EP1506643A1 (fr)
AU (1) AU2003223048A1 (fr)
GB (1) GB0211286D0 (fr)
WO (1) WO2003098882A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113099504A (zh) * 2019-12-23 2021-07-09 海能达通信股份有限公司 一种无线自组网络的通信方法及相关装置

Families Citing this family (56)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7756134B2 (en) 2006-05-02 2010-07-13 Harris Corporation Systems and methods for close queuing to support quality of service
US20070258459A1 (en) * 2006-05-02 2007-11-08 Harris Corporation Method and system for QOS by proxy
US7894509B2 (en) 2006-05-18 2011-02-22 Harris Corporation Method and system for functional redundancy based quality of service
US7813373B2 (en) * 2006-05-25 2010-10-12 Motorola, Inc. Systems, methods and apparatus for detecting time slot interference and recovering from time slot interference in an ad hoc wireless communication network
US7929546B2 (en) * 2006-05-25 2011-04-19 Motorola Solutions, Inc. Systems, methods and apparatus for allocating time slots in an ad hoc wireless communication network
US7856012B2 (en) 2006-06-16 2010-12-21 Harris Corporation System and methods for generic data transparent rules to support quality of service
US8064464B2 (en) 2006-06-16 2011-11-22 Harris Corporation Method and system for inbound content-based QoS
US8516153B2 (en) 2006-06-16 2013-08-20 Harris Corporation Method and system for network-independent QoS
US7990860B2 (en) 2006-06-16 2011-08-02 Harris Corporation Method and system for rule-based sequencing for QoS
US7916626B2 (en) 2006-06-19 2011-03-29 Harris Corporation Method and system for fault-tolerant quality of service
US8730981B2 (en) 2006-06-20 2014-05-20 Harris Corporation Method and system for compression based quality of service
US7769028B2 (en) 2006-06-21 2010-08-03 Harris Corporation Systems and methods for adaptive throughput management for event-driven message-based data
US20100241759A1 (en) * 2006-07-31 2010-09-23 Smith Donald L Systems and methods for sar-capable quality of service
US8300653B2 (en) 2006-07-31 2012-10-30 Harris Corporation Systems and methods for assured communications with quality of service
US8620784B2 (en) 2007-05-31 2013-12-31 International Business Machines Corporation Formation and rearrangement of ad hoc networks
US8320414B2 (en) * 2007-05-31 2012-11-27 International Business Machines Corporation Formation and rearrangement of lender devices that perform multiplexing functions
US7894828B2 (en) * 2007-05-31 2011-02-22 International Business Machines Corporation System and method for establishing peer-to-peer bandwidth sharing ad hoc networks
US7898993B2 (en) * 2007-05-31 2011-03-01 International Business Machines Corporation Efficiency and resiliency enhancements for transition states in ad hoc networks
US10623998B2 (en) 2007-05-31 2020-04-14 International Business Machines Corporation Price offerings for bandwidth-sharing ad hoc networks
US7873019B2 (en) * 2007-05-31 2011-01-18 International Business Machines Corporation Systems and methods for establishing gateway bandwidth sharing ad-hoc networks
US7860081B2 (en) 2007-05-31 2010-12-28 International Business Machines Corporation Optimization process and system for multiplexed gateway architecture
US10419360B2 (en) * 2007-05-31 2019-09-17 International Business Machines Corporation Market-driven variable price offerings for bandwidth-sharing ad hoc networks
US8520535B2 (en) 2007-05-31 2013-08-27 International Business Machines Corporation Optimization process and system for a heterogeneous ad hoc Network
US7843861B2 (en) * 2007-05-31 2010-11-30 International Business Machines Corporation Coalition formation and service provisioning of bandwidth sharing AD HOC networks
US7944878B2 (en) * 2007-05-31 2011-05-17 International Business Machines Corporation Filtering in bandwidth sharing ad hoc networks
US7979311B2 (en) 2007-05-31 2011-07-12 International Business Machines Corporation Payment transfer strategies for bandwidth sharing in ad hoc networks
US8040863B2 (en) * 2007-05-31 2011-10-18 International Business Machines Corporation Demand pull and supply push communication methodologies
US7817623B2 (en) 2007-05-31 2010-10-19 International Business Machines Corporation Optimization process and system for non-multiplexed peer-to-peer architecture
US8249984B2 (en) 2007-05-31 2012-08-21 International Business Machines Corporation System and method for fair-sharing in bandwidth sharing ad-hoc networks
US8619730B2 (en) * 2007-07-20 2013-12-31 Broadcom Corporation Method and system for establishing a connection outside a mesh by including network connectivity information in router configuration messages
CN101981990B (zh) * 2008-01-24 2015-09-23 发尔泰公司 用于无线接入网络的信道分配
JP5025506B2 (ja) * 2008-01-25 2012-09-12 アラクサラネットワークス株式会社 中継装置と、ネットワークシステムと、ネットワークシステムの制御方法
JP5035166B2 (ja) 2008-07-28 2012-09-26 富士通株式会社 基地局、通信端末、基地局の通信方法、通信端末の通信方法、通信システム
US8750126B2 (en) 2009-10-16 2014-06-10 Tekelec, Inc. Methods, systems, and computer readable media for multi-interface monitoring and correlation of diameter signaling information
EP2489161B1 (fr) 2009-10-16 2019-06-12 Tekelec, Inc. Procédés, systèmes et support lisible par un ordinateur permettant de doter un routeur de signalisation diameter d'une fonctionnalité de surveillance et/ou de pare-feu intégrée
LT2512581T (lt) 2009-12-17 2021-03-25 Taris Biomedical Llc Intravezikalinio suderinamumo implantuojamas medicininis įtaisas
CN102986169B (zh) 2010-02-12 2015-09-30 泰克莱克股份有限公司 用于在diameter节点处提供对等路由的方法、***
EP2534790B1 (fr) 2010-02-12 2016-04-27 Tekelec, Inc. Procédés, systèmes et supports lisibles par ordinateur pour partage de charge diameter en fonction de capacité de n ud homologue source
US8761201B2 (en) 2010-10-22 2014-06-24 Intel Corporation Reducing the maximum latency of reserved streams
WO2012119147A1 (fr) 2011-03-03 2012-09-07 Tekelec, Inc. Procédés, systèmes et support lisible par ordinateur pour enrichir un message de signalisation diameter
US8705391B2 (en) * 2011-03-24 2014-04-22 Intel Corporation Reducing latency of at least one stream that is associated with at least one bandwidth reservation
US9258248B2 (en) * 2011-04-01 2016-02-09 Alcatel Lucent Energy-efficient network device with coordinated scheduling and processor rate control
WO2012160417A1 (fr) * 2011-05-25 2012-11-29 Nokia Corporation Procédé et appareil pour faciliter des communications en cas de catastrophe
CN104350711B (zh) 2012-06-11 2018-11-06 泰科来股份有限公司 用于在diameter信令路由器处路由diameter消息的方法、***及装置
US9025461B2 (en) * 2012-08-01 2015-05-05 Qualcomm Incorporated Power optimized behavior in mesh networks
US10257099B2 (en) * 2014-09-30 2019-04-09 A 10 Networks, Incorporated Applications of processing packets which contain geographic location information of the packet sender
US9615200B2 (en) 2015-06-18 2017-04-04 International Business Machines Corporation Distributed cellular client tracking
US9648663B2 (en) 2015-06-18 2017-05-09 International Business Machines Corporation Distributed cellular client network
US20170163509A1 (en) * 2015-12-07 2017-06-08 Le Holdings (Beijing) Co., Ltd. Inter-node distance metric method and system
CN105897582A (zh) * 2015-12-07 2016-08-24 乐视云计算有限公司 节点间距离的度量方法及***
US10321300B2 (en) 2016-05-26 2019-06-11 Oracle International Corporation Methods, systems, and computer readable media for providing end-to-end priority service in long term evolution (LTE) or subsequent generation networks
JP6683090B2 (ja) * 2016-09-26 2020-04-15 株式会社デンソー 中継装置
US10425342B2 (en) 2016-12-16 2019-09-24 Oracle International Corporation Methods, systems, and computer readable media for priority routing of diameter messages
US10813169B2 (en) 2018-03-22 2020-10-20 GoTenna, Inc. Mesh network deployment kit
TWI821607B (zh) * 2018-04-03 2023-11-11 美商內數位專利控股公司 合作車間有效資源使用方法
EP3831021A1 (fr) 2018-07-27 2021-06-09 Gotenna Inc. ROUTAGE DE PAQUETS À COMMANDE NULLE VINEtm À L'AIDE D'UNE INSPECTION DE PAQUETS DE DONNÉES POUR DES RÉSEAUX MAILLÉS SANS FIL

Family Cites Families (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5224099A (en) * 1991-05-17 1993-06-29 Stratacom, Inc. Circuitry and method for fair queuing and servicing cell traffic using hopcounts and traffic classes
US6081505A (en) * 1997-03-20 2000-06-27 Nokia Telecommunications, Oy Cell scheduling system and method for networks nodes
US6047326A (en) * 1997-03-20 2000-04-04 Nokia Telecommunications, Oy Accounting system and method for a nominal bit rate network service
ATE211594T1 (de) 1998-03-11 2002-01-15 Swisscom Mobile Ag Leitweglenkungsverfahren für schnurlose und verteilte systeme
DE19844732A1 (de) * 1998-09-29 2000-03-30 Siemens Ag Schaltungsanordnung und Verfahren zur Durchschaltung von Kanälen in einem Kommunikationsnetz
US6657965B1 (en) * 1998-12-15 2003-12-02 Siemens Information & Communication Networks, Inc. System and method for enhanced routing and reservation protocol
US6859435B1 (en) * 1999-10-13 2005-02-22 Lucent Technologies Inc. Prevention of deadlocks and livelocks in lossless, backpressured packet networks
US6799202B1 (en) * 1999-12-16 2004-09-28 Hachiro Kawaii Federated operating system for a server
WO2001058237A2 (fr) * 2000-02-12 2001-08-16 Hrl Laboratories, Llc Routage unidirectionnel echelonnable comprenant des extensions de protocole de routage de zone pour reseaux mobiles ad-hoc
JP3539338B2 (ja) 2000-03-23 2004-07-07 日本電気株式会社 優先データ転送方法
WO2001099345A2 (fr) 2000-06-16 2001-12-27 The Regents Of The University Of California Protocole de routage de reperage de source optimisant la largeur de bande (best) destine a des reseaux sans fil
AU2001281038A1 (en) * 2000-08-01 2002-02-13 Hrl Laboratories, Llc Method and apparatus for signaling among a plurality of agents
US20020061001A1 (en) * 2000-08-25 2002-05-23 The Regents Of The University Of California Dynamic source tracing (DST) routing protocol for wireless networks
AU2001283464A1 (en) * 2000-08-31 2002-03-13 Padcom, Inc. Method and apparatus for routing data over multiple wireless networks
US6443891B1 (en) * 2000-09-20 2002-09-03 Medtronic, Inc. Telemetry modulation protocol system for medical devices
US7039058B2 (en) * 2000-09-21 2006-05-02 Avici Systems, Inc. Switched interconnection network with increased bandwidth and port count
FI112152B (fi) * 2000-09-29 2003-10-31 Nokia Corp Osoitteistus ja reititys ad hoc-liikkuvuusverkoissa
US20030026268A1 (en) * 2000-11-28 2003-02-06 Siemens Technology-To-Business Center, Llc Characteristic routing
US20030016655A1 (en) * 2001-01-29 2003-01-23 Docomo Communications Laboratories Usa, Inc. Fast dynamic route establishment in wireless, mobile access digital networks using mobility prediction
US6744740B2 (en) * 2001-12-21 2004-06-01 Motorola, Inc. Network protocol for wireless devices utilizing location information
US7283468B1 (en) * 2002-03-15 2007-10-16 Packeteer, Inc. Method and system for controlling network traffic within the same connection with different packet tags by varying the policies applied to a connection
US7616961B2 (en) * 2002-04-29 2009-11-10 Harris Corporation Allocating channels in a mobile ad hoc network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO03098882A1 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113099504A (zh) * 2019-12-23 2021-07-09 海能达通信股份有限公司 一种无线自组网络的通信方法及相关装置

Also Published As

Publication number Publication date
AU2003223048A1 (en) 2003-12-02
WO2003098882A8 (fr) 2006-10-05
US7822023B2 (en) 2010-10-26
US20050169257A1 (en) 2005-08-04
AU2003223048A8 (en) 2003-12-02
GB0211286D0 (en) 2002-06-26
WO2003098882A1 (fr) 2003-11-27

Similar Documents

Publication Publication Date Title
US7822023B2 (en) Routing data packets through a wireless network
CN110139319B (zh) 高动态时延网络传输时延最小化路由方法
Wang et al. Adaptive multipath source routing in ad hoc networks
EP1897295B1 (fr) Recherche de graphe acyclique dirige et distribution d'informations de prefixe de reseau par rapport a une tete de groupe dans un reseau mobile ponctuel
US7027426B2 (en) Multi-channel mobile ad hoc network
JP5037120B2 (ja) アドホック無線通信ネットワークにおける最適なルーティング
US7151769B2 (en) Prioritized-routing for an ad-hoc, peer-to-peer, mobile radio access system based on battery-power levels and type of service
US20070297388A1 (en) Method for routing data in networks
Cansever et al. Quality of service support in mobile ad-hoc IP networks
CA2450224A1 (fr) Algorithmes de routage integres mis en oeuvre sous une couche de routage ip d'une pile de protocoles a architecture logicielle dans un reseau ad hoc mobile
EP1936888A1 (fr) Protocole de routage adaptatif à la distance
US20110235550A1 (en) Network layer topology management for mobile ad-hoc networks and associated methods
WO2004098131A1 (fr) Selection de voies dans des reseaux sans fil
KR20060094473A (ko) 무선 메쉬 네트워크에서의 데이터 흐름 제어를 지원하는방법 및 장치
WO2006052715A2 (fr) Systeme et procede pour reduire le temps de convergence de voies d'acheminement et pour trouver des voies d'acheminement optimales dans un reseau de communication sans fil
KR20060031616A (ko) 무선 네트워크에서 링크의 품질을 특징짓는 시스템 및 방법
WO2003032584A1 (fr) Signalisation intra-bande
JP5252978B2 (ja) 経路制御方法、通信システムおよび通信装置
US9596619B2 (en) Mobile infrastructure assisted ad-hoc network
Kiani et al. Energy-load aware routing metric for hybrid wireless mesh networks
Potti et al. A packet priority approach to mitigate starvation in wireless mesh network with multimedia traffic
Luong et al. Channel allocation for multiple channels multiple interfaces communication in wireless ad hoc networks
Prokkola et al. On the effect of traffic models to the performance of ad hoc network
JP7389250B2 (ja) 無線通信装置、無線通信方法及びプログラム
KR200415521Y1 (ko) 무선 메쉬 네트워크에서의 데이터 흐름 제어를 지원하는메쉬 포인트

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20040906

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK

DAX Request for extension of the european patent (deleted)
17Q First examination report despatched

Effective date: 20061127

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20111027