CN1650578A - Traffic policing in a mobile ad hoc network - Google Patents
Traffic policing in a mobile ad hoc network Download PDFInfo
- Publication number
- CN1650578A CN1650578A CNA038096633A CN03809663A CN1650578A CN 1650578 A CN1650578 A CN 1650578A CN A038096633 A CNA038096633 A CN A038096633A CN 03809663 A CN03809663 A CN 03809663A CN 1650578 A CN1650578 A CN 1650578A
- Authority
- CN
- China
- Prior art keywords
- qos
- node
- communication
- route
- route requests
- 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.)
- Pending
Links
Images
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
- H04L45/302—Route determination based on requested QoS
-
- 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/20—Hop count for routing purposes, e.g. TTL
-
- 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
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/11—Identifying congestion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/20—Traffic policing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
- H04L47/724—Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
- H04L47/726—Reserving resources in multiple paths to be used simultaneously
- H04L47/728—Reserving resources in multiple paths to be used simultaneously for backup paths
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/74—Admission control; Resource allocation measures in reaction to resource unavailability
- H04L47/746—Reaction triggered by a failure
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/78—Architectures of resource allocation
- H04L47/783—Distributed allocation of resources, e.g. bandwidth brokers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/822—Collecting or measuring resource availability data
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/824—Applicable to portable or mobile terminals
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/28—Connectivity information management, e.g. connectivity discovery or connectivity update for reactive routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
- H04W8/04—Registration at HLR or HSS [Home Subscriber Server]
-
- 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
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- 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
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/26—Network addressing or numbering for mobility support
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The method includes nodes transmitting quality-of-service (QoS) route requests to discover traffic routing based upon a QoS parameter, and the QoS route requests including a traffic flow identifier. Each node calculates a node QoS tag value to make traffic admission control decisions, and each node determines whether to admit traffic in response to QoS route requests based upon the calculated QoS tag value and the QoS parameter of QoS route requests. Also, each node replies to QoS route requests to indicate whether the node can support the QoS parameter of the route request and admit the traffic, and each node polices admitted traffic based upon the traffic flow identifier to ensure that admitted traffic does not exceed the QoS parameter of the QoS route request.
Description
Technical field
The present invention relates to communication network field, relate in particular to and move from organizing wireless network and correlation technique.
Background technology
In the past ten years, wireless network has experienced the development that increases.Development zone the most rapidly is mobile self-grouping network (mobile ad hoc network).From physically, a mobile self-grouping network comprises mobile node that disperse, potential on a plurality of geography of sharing a common radio channel.Compare with the network of other types, for example cellular network or satellite network, mobile self-grouping network is the most outstanding to be characterised in that without any fixing basis instrument.Network only is made up of mobile node, and network is aloft created during transmission signals each other at node.Network does not rely on a specific node, and dynamically adjusts when some node adding or other node deviated from network.
In a unreliable or disabled hostile environment of fixed communication basis instrument, for example afield or in by the natural calamity zone of earthquake or hurricane invasion and attack, an ad-hoc network can be disposed rapidly, and provide limited but very necessary communication.Though military these networks development main driving force behind that is still, ad-hoc network is just finding new application rapidly in civilian or commercial field.Ad-hoc network makes that people can be in (except only by opening the network configuration that its computer or PDA create) under the situation of not using any network configuration, swap data in the work-yard or in the classroom.
Along with radio communication is penetrated in the daily life more and more, the new application of mobile self-grouping network emerges in large numbers continuing, and becomes pith of communication structure.Mobile self-grouping network has proposed serious challenge to the designer.Owing to lack the immobilizing foundation setting, when node motion, adding or deviated from network, must organize voluntarily and reconfigure.All nodes all are identical in essence, and do not have the classification or the central controller of nature in the network.All functions all must distribute between node.Node is normally battery-powered, has limited communication and computing capability.The bandwidth of system is normally limited.Distance between two nodes has surpassed the scope of wireless radio transmission usually, and one is transmitted in that arrive must be by other node relayings before its target.Therefore, a network has the multi-hop topological structure, and this topological structure changes along with node motion.
Mobile self-grouping network (MANET) working group of the Internet engineering duty group (IETF) actively assessing and the standardization Routing Protocol, comprises the multileaving agreement.Because topology of networks changes arbitrarily along with node motion, therefore information may become out-of-date, and different nodes have different views usually for network, the difference of this view is that temporal (information may be out-of-date at some node, but at other nodes still is up-to-date), also be on the space (node may only understand near it and not away from himself network topology structure).
A Routing Protocol need adapt to frequent topologies change, and lacks accurate information.Because these unique requirements, the route in these networks is very different with other networks.The fresh information of collecting whole network normally both expensive and be unpractiaca.Many Routing Protocols are reaction equation (should need formula on-demand) agreements: they only where necessary and the target that only needs is routed to collect routing iinformation, and do not keep the route do not used.In this way, compare with the proactive protocols route of the best route that remains to all targets at any time, routing cost greatly reduces.This has adaptability to an agreement is very important.Should need formula distance vector (AODV), DSR (DSR), temporary order routing algorithm (TORA) from group is the representative that should need the formula Routing Protocol that MANET working group proposes.
The example of other various Routing Protocols comprises by No. 5412654 disclosed targets ordering distance vector (DSDV) routes of the United States Patent (USP) of Perkins, and the region Routing Protocol (ZRP) that is proposed for No. 6304556 by the United States Patent (USP) of Haas.ZRP is a kind of active hybrid protocol that also uses reactive approach that both used.
These conventional Routing Protocols have used a kind of doing one's best (best effort) method when route selecting from the source node to the destination node.Usually, in this method of doing one's best, the number of hop is a main standard.In other words, the route with minimum hop is chosen as transmission route.
Service quality in the mobile self-grouping network (QoS) route appeals to.For service quality is provided, agreement not only needs to find a route, and needs the resource of assurance along this route.Since the limited bandwidth of sharing of network, and lack the central controller that can solve and control these Limited resources, and node must consult to manage the desired resource of QoS route each other.This is further complicated by frequent topologies change.Route request is higher because these restrictions, Qos route ratio are done one's best.
Some example of QoS method for routing is proposed in the publication that is entitled as " medium access control of mobile self-grouping network and service quality route " of calendar year 2001 by Chenxi Zhu, and is proposed in the publication that is entitled as " dynamic quality of service of mobile self-grouping network " of MITRE company in 2000 by people such as M.Mirhakkak.Zhu has discussed and set up the Qos route that guarantees bandwidth in topologies change is compared low mininet with medium rate.People such as Mirhakkak pay close attention to the resource reservation request, and a qos value scope has been determined in described resource reservation request, and the network promise provides service in this scope.
Control so that communication is forwarded to other nodes at each node place execute permission.Usually, Chang Gui permission control protocol provides about route and connective full detail.In other words, route and connectivity data that each node and other nodes sharing are all are so that generally select to do one's best route.
Summary of the invention
Because therefore aforementioned background an object of the present invention is to provide the telecommunication management of a multi-hop route in the mobile self-grouping network.
According to of the present invention this be to provide with other purposes, feature and advantage by a kind of method that is used for managing the permission control of communicating by letter of a mobile self-grouping network.This network comprises a plurality of wireless mobile nodes and many wireless communication links that a plurality of nodes are coupled together.This method comprises that node sends service quality (QoS) route requests, so that find the communication route according to a qos parameter, and described QoS route requests comprises a traffic flow id.Each node calculates a node QoS label value, and making communication permission control decision, and each node determines whether to respond the QoS route requests according to the qos parameter of QoS label value that calculates and QoS route requests and permits and communicate by letter.In addition, each node is answered the QoS route requests, whether can support the qos parameter of route requests and permission to communicate by letter with instructs node, and each node is no more than the qos parameter of QoS route requests according to the communication of traffic flow id management permission with the communication of guaranteeing to permit.
Qos parameter can comprise according at least one a request in available bandwidth, error rate, end-to-end delay, end-to-end delay change, hop number, desirable path duration and the priority, and node specific QoS label value can be in bandwidth that other nodes in available horsepower, bandwidth that node can be used, nearest error rate, nearest time-delay, the scope can use and the node queue's size function of at least one.This method comprises that also each node prevents the communication propagation above the qos parameter of QoS route requests.This step can comprise that buffering surpasses the communication of the qos parameter of QoS route requests, and propagates the communication that is cushioned with the qos parameter of QoS route requests.As an alternative, but the communication that each node also can become the time spent propagate buffer in desired resource perhaps just abandons the communication above the qos parameter of QoS route requests simply.In addition, answer the QoS route requests and can comprise when node can not be supported the qos parameter of route requests, can support what communication route according to node QoS label value instructs node.
A system aspects of the present invention is intended to a mobile self-grouping network, and it comprises a plurality of mobile nodes, and a plurality of wireless communication links that a plurality of mobile nodes are coupled together.Each mobile node comprises a communication equipment, be used for by wireless communication link wirelessly and unidirectional or two-waylyly with other node communications of a plurality of nodes, and controller is used for by the communication equipment routing to communicate.Controller comprises a route discovery unit, is used for sending service quality (QoS) route requests to other nodes, and being found to the route of a destination node according at least one qos parameter, and the QoS route requests comprises a traffic flow id.Also have, a QoS tag calculation unit is calculated a node QoS label value, making communication permission control decision, and a communication permission controller, be used for qos parameter according to QoS label value that calculates and QoS route requests and determine whether to respond the QoS route requests and permit and communicate by letter.In addition, a route requests processing unit response QoS route requests, whether instructs node can support the qos parameter of route requests, and permission communication, a communications management unit is managed the communication of permitting according to traffic flow id, is no more than the qos parameter of QoS route requests with the communication of guaranteeing to permit.
Description of drawings
Fig. 1-the 4th is according to a schematic diagram that comprises the mobile self-grouping network of QoS route of the present invention.
Fig. 5 is the flow chart of describing according to the method step of the QoS route in the mobile self-grouping network of the present invention.
Fig. 6 is the schematic diagram of description according to a router of a node of network of the present invention.
Fig. 7 is the schematic diagram of details of controller of describing the router of Fig. 6.
Fig. 8-the 10th is according to one of the present invention schematic diagram that comprises the mobile self-grouping network of permission control.
Figure 11 is the flow chart of describing according to the method step of the control of the permission in the mobile self-grouping network of the present invention.
Figure 12 is the flow chart of describing according to the method step of the permission of the supervisory communications in the mobile self-grouping network of the present invention control.
Figure 13 is according to a schematic diagram that comprises the mobile self-grouping network of communication tracking of the present invention.
Figure 14 is the flow chart of describing according to the tracking method for communicating step in the mobile self-grouping network of the present invention.
Figure 15-the 17th is according to a schematic diagram that comprises the mobile self-grouping network of dynamic channel allocation of the present invention.
Figure 18 is the flow chart of describing according to the method step of the dynamic channel allocation in the mobile self-grouping network of the present invention.
Embodiment
With reference to the more complete description the present invention of accompanying drawing, shown first-selected execution mode of the present invention in the accompanying drawing.But the present invention can realize with many different forms, should not be understood that to be limited to the execution mode that proposes herein.On the contrary, it is in order to make the present invention detailed and complete that these execution modes are provided, and scope of the present invention is intactly conveyed to the art technology practician.Identical from the beginning to the end numeral components identical, and " ' " number be used to indicate the similar components of replacing in the execution mode.
As those of skill in the art will appreciate that, part of the present invention will be implemented as a kind of method, data handling system or computer program.Therefore, these parts of the present invention will be taked following form: the execution mode of the execution mode of a complete hardware, a complete software or an execution mode that combines the software and hardware aspect.In addition, part of the present invention can be a computer program on the computer-usable storage medium, has computer readable program code on medium.Any suitable computer-readable medium be can adopt, static and dynamic memory, hard disk drive, light storage device and magnetic storage apparatus included but not limited to.
Below with reference to flowchart illustrations explanation the present invention according to method, system and the computer program of an embodiment of the invention.To understand graphic, and the combination of the piece in the diagram, can realize by computer program instructions.These computer program instructions can be provided for a processor of all-purpose computer, special-purpose computer or other programmable data processing device, to produce a machine, so that realize the function of one or more middle appointments by the instruction of computer or the execution of other programmable data processing device.
These computer program instructions also can be stored in the computer-readable memory, it can indicate a computer or other programmable data processing device to work in a kind of specific mode, so that the instruction that is stored in the computer-readable memory produces a product, it comprises the instruction of function of the one or more middle appointments of realization flow figure.Computer program instructions also can be loaded on a computer or other programmable data processing device, on computer or other programmable devices, carry out the sequence of operations step to cause, producing a computer implemented process, so that the instruction of carrying out on computer or other programmable devices is provided for the step of function of the one or more middle appointments of realization flow figure.
At first with reference to figure 1-5, will illustrate that now a kind of being used for determine from the method for the route of source node to a destination node at a mobile self-grouping network 20.Network 20 comprises a plurality of mobile nodes 30, comprising source node 1 and destination node 4, intermediate node 2,3 and 5 is arranged therebetween.As the art technology practician can realize, connect by wireless communication link 32 such as the node 30 of notebook computer, personal data assistants (PDA) or mobile phone.This method begins (piece 100), comprises from source node 1 sending a service quality (QoS) route requests RREQQ, so that be found to the route of destination node 4 according to a qos parameter, shown in the piece among Fig. 5 102.As hereinafter will going through, qos parameter is preferably according to available bandwidth, error rate, end-to-end delay, end-to-end delay change, hop number, desirable path duration and/or priority.Route requests RREQQ comprises a QOS flow identifier and a renewable QoS link metric.
In addition, at piece 104 places, this method comprises whether each intermediate node 2,3 and 5 definite these nodes can support the qos parameter of QoS route requests RREQQ request.If this node can not be supported the qos parameter of a specific request RREQQ, then request is rejected or is not just transmitted (piece 106) by node simply.If this node, for example node 3, can support the qos parameter of a specific request RREQQ, and then node updates QoS link metric is forwarded to other intermediate nodes 2 and 5 with the QoS route requests, and is the interim reserves node resources of this QoS route requests (piece 108). Intermediate node 2 and 5 must determine also whether they can support to transmit from node 3 qos parameter of the QoS route requests RREQQ request that comes.If can, the route requests RREQQ that then has the QoS link metric after the renewal is forwarded to destination node 4.
In addition, source node 1 can send or not send and confirm that CONFQ selects at least one alternate routing (piece 122) by the intermediate node on alternate routing.This alternate routing can be used for duplicate transmissions, is used for additional reliability, perhaps can be as an alternate routing under the situation of route and/or QoS failure.At piece 118 places, intermediate node 2,3 and 5, and/or destination node 4, whether detection node can continue to support the qos parameter of QoS route requests RREQQ request at any time.If node can continue to support the RREQQ of request between the whole propagation periods of communication, if predetermined resource is confirmed as inactive with relevant route, then can be allowed to overtime at piece 126 places, if and do not used for some time by the transmission of the CONFQ message in data communication or cycle, then can be released at piece 128 places.
If node can not continue to support request RREQQ, then node generates a QoS error notification RERRQ (piece 120) to source node 1.Herein, source node 1 is after receiving QoS error notification RERRQ, can keep selected route, and send a service quality (QoS) route requests RREQQ once more, so that be found to a new routed path (piece 102) of destination node 4 according to qos parameter.Source node 1 also can switch to alternate routing (piece 124) after receiving QoS error notification RERRQ.
As the art technology practician can be appreciated that, what described method can be used for any kind should need formula or reaction equation Routing Protocol, for example DSR (DSR) or certainly the group should need formula distance vector (AODV) route, active/the reactive protocols that perhaps is used for any mixing, for example region Routing Protocol (ZRP).
An example more specifically will be described now, wherein be considered as minimum bandwidth allocation and a maximum delay restriction of the kind of QoS.For a fixing allocated bandwidth, suppose that a node 30 can be scheduled to the capacity or the bandwidth of a specified quantitative.Equally, the source node 1 of a communication stream will send QoS route requests RREQQ (last Q in the symbol represents a QoS request) for the stream of each requirement.RREQQ message carry out to be found the function that can support the route of the QoS that requires.The node that RREQQ is forwarded to target 4 will notice whether they can satisfy the QoS of request before transmitting RREQQ, and if necessary with temporary transient predetermined resource.A route is answered the RREPQ grouping and is returned from target, has an indication to the QoS that can satisfy request on this path.Source node 1 can be collected many possible paths of target 4 before the optimal selection of the QoS that determines to provide required then.In case this path is determined, then confirm that CONFQ message is sent to target 4 along the path of indication for one.Predetermined being confirmed to be forever of any temporary resource in the road in this path is scheduled to.If one specific period is not used, then QoS is predetermined overtime.If along one on route link failure, if perhaps can not satisfy qos requirement, then a routing error (RERRQ) grouping is generated and is returned to source node.
More specifically, when one that need arrive a given destination node 4 new QoS route, source node 1 is to RREQQ grouping of destination node broadcasting.This is and the grouping that is used for such as the similar a kind of specific type of the conventional RREQ grouping of DSR or AODV agreement.Conventional RREQ broadcasting is used for " doing one's best " service.Method of the present invention still can be followed the conventional program of being set up by the agreement of the service of doing one's best.
If a communication stream requires a specific minimum capacity or bandwidth, then special RREQQ grouping is used to a predetermined stream to the specified vol of target 4.In the case, by source node 1 flow identifier is distributed to RREQQ, it combines with source node address, unique identification the stream of any node in the network 20 of transmitting this stream.The capacity that will be scheduled to has also been indicated in the RREQQ grouping.
At each node 2,3 and 5 places to the path of target 4, the contrast active volume is checked minimum capacity or bandwidth requirement, with determine whether to can be this stream make one predetermined.If node can adapt to desired communication stream, then be the interim predetermined volumes of this flow identifier.If do not receive a CONFQ message in one period short time, then this is scheduled to be released temporarily.If RREQQ wants to guarantee the path of finding one to be no more than the maximum delay of an appointment, then must be able to estimate its contribution, and inspection adds along total time-delay in path whether its contribution surpasses the maximum delay restriction of appointment up to now for the total path time-delay along each node in path.
Different with the routine application of DSR that is used for " doing one's best " communication and AODV, RREQQ must propagate into destination node 4 always, with an active path that determines whether to exist to satisfy a qos requirement.If find such paths, then destination node 4 generates a RREPQ message that turns back to source node 1.This message is indicated the active path to destination node 4 of having found a QoS who satisfies to be asked to source node, and (returning a source path under the situation of DSR) set up in a path.For the request that guarantees and of seeking to delay time, in RREPQ, comprised the path delay of estimating for the path of a guaranteed capacity.
If in any intermediate node 2,3 and 5 or destination node 4 places, the QoS of request is violated and can not be satisfied, then under the situation of knowing the QoS that can not satisfy request by the path of this node, abandon the RREQQ grouping.But discovery procedure can be found other paths.If if any moment along one of path link failure or can not satisfy qos requirement, then for each communication stream that is influenced by failure generates a routing error RERRQ grouping, and turns back to source node 1 with this RERRQ grouping.In the case, perhaps must use a backup path, perhaps restart route finding process.
Described process easily is applied to the DSR agreement.Conventional DSR type of message RREQ, RREP, RRER are defined as optional packet type, and can be used as the routine operation of the agreement of supporting " doing one's best " communication in the backward compatible mode.New optional packet type is defined as supporting QoS, comprises RREQQ, the RREPQ, RRERQ and the CONFQ grouping that are used to manage the QoS path.The definition of the header field of the requirement of these types is directly according to the function of above definition.The QoS source routed packet that is used for the QoS task data that also can comprise a kind of specific type.This grouping will comprise flow identifier, belong to which stream with identification packet, and allow the tolerance stream communication.
If a failure causes that a node sends a RERRQ grouping, then will use following process.If receive a RERRQ grouping at the source node place, then current route is dropped, and attempts an alternate routing.First grouping that sends on alternate routing will be the special QoS source routed packet of another type, RREQT, and it comprises flow identifier and qos parameter.This grouping also can comprise task data.To check along each node in path whether they also keep interim predetermined for one of this stream.If no, then they will check oneself whether to support stream once more, and make interim being scheduled to.If grouping arrives target and each intermediate node is supported described stream, then destination node will return a RREPQ grouping, and this path of notification source is effective.
If any node can not be supported stream, then grouping is dropped, and node returns RERRQ grouping to source node, notifies its path can not support the qos parameter of asking.If source node receives a RREPQ grouping, then it sends a CONFQ message along the path of choosing, and confirms the selection in path, and continues to send the task data of this communication stream.
If source node receives a RERRQ grouping, then it attempts identical process on the available backup path of next bar.If source node no longer includes the Back Up Source route of target, then source node begins another route finding process, attempts being found to a new QoS path of destination node.Task data flow is interrupted, up to finding a new route.For any specific protocol, being used to manage the required data structure of resource of distributing to each communication stream can be defined, and also how definable identifies stream, and how to search the route of distributing to each stream.
Again with reference to figure 6 and 7, a system aspects of the present invention will be described now.A mobile self-grouping network 20 comprises a plurality of mobile nodes 30, and a plurality of wireless communication links 32 that a plurality of mobile nodes are coupled together.Each mobile node comprises a router four 0 (Fig. 6), it has a communication equipment 42, be used for by wireless communication link 32 wirelessly and unidirectional or two-waylyly with other node communications, and controller 44 is used for by communication equipment 42 routing to communicate.In addition, a memory 46 can be used as the part of controller 44, perhaps is connected to controller 44.
As shown in Figure 7, controller 44 comprises a route discovery unit 50, is used for sending service quality (QoS) route requests to other nodes, to be found to the route of a destination node according at least one qos parameter.Equally, route requests comprises a flow identifier and a QoS link metric.In addition, a route requests processing unit 52 determines whether node can support the qos parameter of QoS route requests request, and upgrade the QoS link metric, and the interim node resource that temporary resource reservation chart 54 comprises the QoS route requests with supported qos parameter is predetermined.In addition, a route metric forms unit 56 and generates the QoS route metric according to the QoS link metric from the renewal in the answer with the predetermined node of node resource, and a route of destination node is chosen according to the QoS route metric in Route Selection unit 58, and route is confirmed to send to a node on the route of choosing.
An alternate routing can be selected sending or do not send under the situation of confirming CONFQ to the node on the alternate routing in Route Selection unit 58, for example is used for standby or duplicate transmissions.Whether route requests processing unit 52 detection node can continue to support the qos parameter of QoS route requests request, if can not, then generate QoS error notification RERRQ.Route Selection unit 58 is after receiving a QoS error notification from other nodes, preferably keep selected route, and route discovery unit 50 sends another service quality (QoS) route requests RREQQ, to be found to the new route of destination node according to qos parameter.Route Selection unit 58 can switch to alternate routing behind the QoS error notification RERRQ that receives from another node.
Another embodiment of the invention provides under the situation of the required service quality of maintenance, is used for the communication permission control of the multi-hop route of mobile self-grouping network 22, will this execution mode be described with reference to figure 8-11.This permission control method will allow a node to keep some resource for the communication of himself adaptively, share liberally in the communication of transmitting other nodes simultaneously.Equally, ad-hoc network is made up of a plurality of wireless mobile nodes 30 and a plurality of wireless communication links 32 that a plurality of nodes are connected together.
The method that is used for controlling the communication permission of mobile self-grouping network 22 begins (piece 200), comprises from a source node sending service quality (QoS) route requests RREQQ, so that find communication route (piece 202) according to a qos parameter.At piece 208 places, each node 30 in the network 22 calculates a node QoS label value, to make communication permission control decision.The node QoS label value is the function of at least one node specific QoS tolerance.Qos parameter can based on, for example, bandwidth, error rate, end-to-end delay, end-to-end delay change, hop number, desirable path duration and/or priority, and node specific QoS tolerance can comprise one or more in other nodes can be used in available horsepower for example, bandwidth that node can be used, recent error rate, recent time-delay, the scope bandwidth and the node queue's size.The QoS label value can be the weighted sum of each, perhaps with each vector as an element.
Each node 30 is determined permission according to the qos parameter of QoS label value that calculates and QoS route requests RREQQ, and can permit to communicate by letter and answer source node (piece 214) with regard to whether respond the QoS route requests.In addition, each node 30 can calculate route relevant with node and connectivity (piece 210), and route and connectivity and QoS label value are sent to other nodes, the Route Selection that is used to communicate by letter (piece 212).
Computing node QoS label value 208 can comprise the information (piece 204) that other nodes in scope of inquiry are measured about at least one QoS, and handle QoS metric and described at least one node specific QoS tolerance of receiving from other nodes, come computing node QoS label value.Computing node QoS label value can further comprise verifies whether each interior other node of scope have carried out answering (piece 206) with the QoS metric.
More specifically, most of QoS tolerance, for example the bandwidth that can use of available horsepower, node, error rate, time-delay and node queue's size in the recent period in the recent period are that node is known in this locality.But, for example, other nodes in scope can with bandwidth unknown in this locality.Thereby, referring to Fig. 8, if node 1 sends a request to node 4, the 5Mbps of a 11Mbps transmission medium of request, then whether node 4 must have been made limiting and promise to undertake by interior other any nodes (herein being node 1,3 and 5) of examination scope.Therefore, " inspection " message of node 4 broadcasting, the node of any guaranteed bandwidth will send it back one " check and answer " in the scope, with the indication this point.Node 4 guarantees that it hears one " check answer " from any node of hearing its message in the recent period.The information that receives has been arranged, and node 4 can determine now whether it can support the qos parameter of route requests RREQQ.
Answer QoS route requests (piece 214) and can be included in node can not support the qos parameter of route requests the time, can support what communication route according to node QoS label value instructs node.For example, if node 4 can not be promised to undertake request, then it can send an answer, illustrates what its multipotency supports.Therefore, the source can determine whether that this level is enough good, perhaps whether reduces request, sends so not strict QoS request RREQQ.
Just as already discussed, conventional method provides about route and connective full detail.In other words, whole known to it of each node 30 and other nodes sharing are so that " the best " (normally hop is minimum) route is selected in general.In the present invention, this route and connectivity are to be designated as a value, and it allows other nodes to use it according to required service quality.In addition, the node of sharing this information can determine to be allowed to use the rank of the QoS of this information.This decision can be based on a public regular collection, perhaps based on the rule of each node, because some node will be preferential.For example, find for one oneself to use up soon, and can't find the node of bandwidth for the communication of himself at the many groupings of forwarding, battery, can be to its route of some other node broadcasts and connectedness, and, show all groupings that do not allow except that most important (high priority) grouping with a label.
A system aspects of this execution mode of the present invention is intended to mobile self-grouping network 20, and it comprises a plurality of mobile nodes 30, and a plurality of wireless communication links 32 that a plurality of mobile nodes are coupled together.As previous illustrated with reference to figure 6 and 7, each mobile node has a router four 0, it has a communication equipment 42, be used for by wireless communication link 32 wirelessly and unidirectional or two-waylyly with other node communications, and a controller 44, be used for by the communication equipment routing to communicate.Controller 44 comprises a route discovery unit 50, is used for sending service quality (QoS) route requests to other nodes, to be found to the route of a destination node according at least one qos parameter.Herein, QoS tag calculation unit 60 computing node QoS label values are to make communication permission control decision.Communication permission controller 62 qos parameters according to QoS label value that calculates and QoS route requests determine whether to respond the permission of QoS route requests and communicate by letter.
In addition, route requests processing unit 52 is answered the QoS route requests, whether can support the qos parameter and the permission communication of route requests with instructs node.In addition, when node can not be supported the qos parameter of route requests, route requests processing unit 52 can be supported any communication route according to node QoS label value instructs node.
Another embodiment of the invention provides the telecommunication management of the multi-hop route in the mobile self-grouping network 22, will be described with reference to Figure 12.As previously mentioned, network 20 comprises a plurality of wireless mobile nodes 30, and a plurality of wireless communication links 32 that a plurality of nodes are coupled together.As explanation in other embodiments, this method begins at piece 300 places, and comprises that node sends service quality (QoS) route requests RREQQ (piece 302), so that find the communication route according to a qos parameter.Herein, QoS route requests RREQQ comprises traffic flow id at least.At piece 304 places, each node calculates a node QoS label value, and making communication permission control decision, and each node determines whether to respond QoS route requests permission communicate by letter (piece 306) according to the qos parameter of QoS label value that calculates and QoS route requests.In addition, at piece 308 places, each node is answered the QoS route requests, whether can support the qos parameter of route requests with instructs node, and permits communication.But in this execution mode, each node is managed the communication of permission according to traffic flow id, is no more than the qos parameter (piece 310) of QoS route requests RREQQ with the communication of guaranteeing to permit.
Equally, qos parameter can be based on for example available bandwidth, error rate, end-to-end delay, end-to-end delay change, hop number, desirable path duration and/or priority, and node specific QoS label value can be bandwidth that other nodes in available horsepower for example, bandwidth that node can be used, recent error rate, recent time-delay, the scope can use and at least one the function in node queue's size.In other words, if request RREQQ for example comprises a requirement for the bandwidth of specified quantitative, and the node permission with ask relevant communication, node administration self then is no more than the bandwidth of request with the communication of guaranteeing to permit.
This method preferably includes the communication that each node prevents to surpass the qos parameter of QoS route requests and propagates (piece 312).This step can comprise that buffering surpasses the communication of the qos parameter of QoS route requests, and propagates the communication that is cushioned with the qos parameter of QoS route requests.As an alternative, but the communication that each node also can become the time spent propagate buffer in desired resource perhaps just abandons the communication above the qos parameter of QoS route requests simply.In addition,, answer the QoS route requests and can comprise when node can not be supported the qos parameter of route requests, can support what communication route according to node QoS label value instructs node as illustrated in other execution modes.
With reference to figure 7, controller 44 comprises a communications management unit 84 again, is used for the communication according to traffic flow id management permission, is no more than the qos parameter of QoS route requests with the communication of guaranteeing to permit.In addition, communications management unit 84 preferably includes the communication buffer 86 that exceeds the quata, and is used to store the communication that exceeds the quata.
More specifically, traffic flow id is used in the routing table and is used in the QoS grouping (both dividing into groups also in packet in control).Such as discussed, this provides an identifier that is used for execute permission control.For example obtained the source node of the paths with a specified vol of destination node, can use flow identifier and tolerance communication, managed with executive communication.This has guaranteed that it can not permit the capacity that is agreed more than this flow identifier.In addition, each node in the path of target can be carried out the management to the capacity that distributes.Certainly, the standard of other except that active volume can be used as and determines whether to support a standard to the constant current request.For example, the lower node of the power of battery may not want to support a given communication stream.Thereby in the case, RREQQ message can be left in the basket, thereby does not allow to use the forward node of this node as requested communication stream.
Another embodiment of the invention provides the communication tracking of the multi-hop route in the mobile self-grouping network, will be described with reference to Figure 13 and 14.As shown in figure 13, network 24 comprises a plurality of wireless mobile nodes 30 equally, and a plurality of wireless communication links 32 that a plurality of nodes are coupled together.This method begins at piece 400 places (Figure 14), and comprises the communication (piece 402) of transmission between the node 30 in each monitoring nodes network 24.Each node 30 generates the communication information (piece 404) according to transmitting how many communications between the different nodes of network 24, and each node is stored in communication information this locality in the buffer, as a communications database (piece 406).
In the method, the communication information is preferably according to bandwidth, and can comprise error rate, end-to-end delay, end-to-end delay change, hop number, desirable path duration and/or priority.Communications database can comprise one 1 hop communication matrix.In other words, the database of a specific node 1 can comprise the communication information of each link 32 between the node 2-8 in the network.In Figure 13, node 1 needs a communication route A to node 6.Here, if node 7 and 8 is sending mass communication, but node 1-6 do not have, and is preferably by 1-2-3-4-5-6 rather than by the 1-7-8-6 routing to communicate then, even this will cause more multi-hop point.
This method is favourable for Routing Protocol selection, protocol parameter optimization and Route Selection.A communication matrix is displayed in the following example.For one 7 meshed network, how much communication (if communication is arranged) each element representation in the matrix has sent from the source node on this row to this destination node that lists.Herein, communication is quantized according to the bandwidth on some time interval (weight of most recently used bandwidth is bigger), and can comprise packet loss rate, time-delay etc.If communication matrix is sparse (a lot of zero or approaching bandwidth entries of zero is arranged), then a reaction equation Routing Protocol will be more favourable, because obsolete route can not brought in constant renewal in.On the contrary, intensive communication matrix will be represented a large amount of reciprocations between the node 30, and an active or hybrid protocol can provide benefit.Therefore, this method can comprise each node according to the communication information of storage and select a route discovery protocols, for example reaction equation, active or hybrid protocol (piece 412).
| Target | |||||||
| The source | ????1 | ???2 | ?3 | ????4 | ????5 | ????6 | ???7 |
| ????1 | ????N/A | ???1Mbps | ?0 | ????0 | ????0 | ????1Mbps | ???300kbps |
| ????2 | ????0 | ???N/A | ????10kbps | ????0 | ????0 | ???0 | |
| ????3 | ????0 | ???0 | ?N/A | ????0 | ????0 | ????10kbps | ???0 |
| ????4 | ????10kbps | ???0 | ?0 | ????N/A | ????0 | ????1Mbps | ???0 |
| ????5 | ????0 | ???300kbps | ????10kbps | ????N/A | ????0 | ???0 | |
| ????6 | ????0 | ???0 | ?1Mbps | ????0 | ????0 | ????N/A | ???10kbps |
| ????7 | ???300kbps | ???0 | ?300kbps | ????0 | ????0 | ????0 | ????N/A |
Communications database
Node is understood them and is being sent, receiving and what is transmitted communicating by letter.In order to understand the communication that they directly do not relate to, they can monitor or send clearly the message that comprises communication data.(by request RREQ and the answer RREP that listens to other nodes, perhaps by the source routing in the observed data grouping) collects the Routing Protocol of routing iinformation applicable to setting up many communication matrixs such as the so indiscriminate ground of DSR.The linking status Routing Protocol, for example optimization linking status route (OLSR) has been shared routing iinformation, and can expand to the common share communication matrix information, what quality what whom to send because each node is understood it to.In addition, an agreement can be provided with timer according to the time-delay of expecting on the hop sequence according to traffic matrix bandwidths, and how many time-delays communication blocking will expect because it will be understood.This will reduce or eliminate unnecessary overtime generation.
In addition, at piece 408 places, each node 30 can generate traffic destination information according to each node in a plurality of nodes in the network 24 and how many destinations traffics, and in a destination quantity database storing communication target information (piece 410).Thereby route be found and be selected to communicate by letter to each node 30 also can according to the traffic destination information of storing.In other words, destination quantity database can show the number of the target that each specific node is being communicated by letter with it.
Referring to Fig. 7, the controller 44 according to a router four 0 in the network 24 of this execution mode comprises a communication monitoring unit 70 again, is used for the communication of transmitting between the node 30 of monitor network.A communication information maker 76 generates the communication information according to transmitting how many communications between each node in the network, and a traffic information buffer 78 storing communication information in a communications database.
A traffic activity query can be broadcasted in communication monitoring unit 70, and handles the answer to traffic activity query.As an alternative, the also communication between the node 30 in the monitor network 24 passively of communication monitoring unit 70.Route discovery unit 50 is found to the route of a destination node according to the communication information of storage, and the communication route of destination node is chosen in Route Selection unit 58 according to the communication information of storage.In addition, route discovery unit 50 can be handled the communication information that is stored in the communications database, with choice reaction formula, active and mix one of route finding process, and finds the communication route with the route finding process of choosing.Each communication route comprises a combination of wireless communication link 32.
A traffic destination information maker 72 generates traffic destination information according to each node in each node 30 in the network 24 and what destinations traffics, a destination information buffer 74 storing communication target information in a destination quantity database.Route discovery unit 50 also can be found to the route of a destination node according to the traffic destination information of storage, and Route Selection unit 58 can be chosen the communication route of destination node according to the traffic destination information of storage.
Another embodiment of the invention provides the dynamic channel allocation in the mobile self-grouping network, to effectively utilize a plurality of channels.A kind of method that is used for dynamic channel allocation will be described in reference to figure 15-18.Herein, network 26 comprises a plurality of wireless mobile nodes 30, and a plurality of wireless communication links 32 that on a plurality of channels a plurality of nodes coupled together.The continuous part of IEEE 802.11 for example 802.11a will use ISM frequency spectrum in the 5GHz frequency band.In this frequency band, there is more bandwidth to use, to support many channels.Therefore, it will be very important distributing a channel to give the process of one 802.11 node automatically.The decision of this channel can be used and to the sampling of other channels according to current channel.Frequency spectrum use dynamic channel to select more performance can be provided, because will evenly be used.In addition, channel uses and can be suppressed, so that keep QoS for using working as of channel to set out in advance to make arrangements.
This method starts from piece 500 (Figure 18), and comprises the link performance on one first channel of each node 30 monitoring.Link performance depends on a service quality (QoS) threshold value, for example bandwidth, error rate, end-to-end delay, end-to-end delay change, hop number, desirable path duration and priority.At piece 504 places, in the time of under link performance monitored on first channel drops to QoS threshold value (for example minimum bandwidth or maximum delay), one or more other available channels of each node searching.Search can comprise the link performance of periodic other channels of monitoring.
Search can comprise and switches to a second channel (piece 512), broadcasts a channel activity query, determining the link performance (piece 516) of second channel, and at piece 518 places, handles the answer to channel activity query, to determine the link performance of second channel.In addition, if the link performance on the second channel is higher than the QoS threshold value, 30 changeable times first channels of each node then, and broadcast a channel and change message (piece 506), if the link performance on the perhaps previous channel is lower than the QoS threshold value, then switch to the channel of back, and the broadcast channel activity query, to determine the link performance (piece 504) of those channels.
As an alternative, search can comprise and switches to another channel (piece 512), and monitor the link performance of second channel at piece 514 places passively.Equally, if the link performance on the second channel is higher than the QoS threshold value, 30 changeable times first channels of each node then, and broadcast a channel and change message (piece 506), if the link performance on the perhaps previous channel is lower than the QoS threshold value, then switch to the channel of back, and monitor the link performance (piece 504) of those channels passively.In addition, each node 30 can store in a plurality of channels each link performance information (piece 508) and/or at piece 510 places, the storage adjacent node channel information.In other words, each node 30 can be followed the tracks of other nodes and use what channel.
For example, shown in Figure 15-17, network 26 comprises node 30 and link 32.Node 1A-5A is current to use one first channel, is using a second channel and node 1B-5B is current.Node 2B determines that the link performance of second channel will drop to or drop to below the QoS threshold value, for example drop to one below the minimum bandwidth.Node 2B switches to first channel and broadcasts a channel activity query CAQ to the interior node (Figure 16) of the hop of node 2B.Node 1A, 2A and 3A wherein have the information (Figure 17) about the link performance of first channel to the movable answer of node 2B transmitting channel.If the bandwidth on first channel is acceptable for node 2B, it will return second channel and broadcast a channel change message, and to notify any one among node 1B, 3B, 4B and the 5B, it will be changed to first channel.These nodes will notice where to find node 2B then, in order to reference in the future.If bandwidth is unacceptable, node 2B will move on to one the 3rd channel and repeat these steps.If visited all channels, and node 2B does not also find the bandwidth that is higher than the QoS threshold value, then it will select that best channel, and will periodically search for a better channel.
A system aspects of this execution mode of the present invention is intended to mobile self-grouping network 26, and it has a plurality of mobile nodes 30, and a plurality of wireless communication links 32 that on a plurality of channels a plurality of mobile nodes coupled together.Referring to Fig. 6 and 7, each mobile node comprises a router four 0, and it has a communication equipment 42, be used for by wireless communication link 32 wirelessly and unidirectional or two-waylyly with other node communications, and a controller 40, be used for by the communication equipment routing to communicate.Controller 40 comprises a link performance monitor 80, is used to monitor one first link performance on the channel.In the time of under link performance monitored on first channel is reduced to the QoS threshold value, one or more other available channels of channel search unit 82 search.
Channel search unit 82 switches to a second channel, channel activity query of broadcasting, and with the link performance of definite second channel, and processing is to the answer of channel activity query, to determine the link performance of second channel.In addition, if the link performance on the second channel is higher than the QoS threshold value, then channel search unit 82 switches back first channel, and broadcast a channel change message, if the link performance on the perhaps previous channel is lower than the QoS threshold value, then change to the channel of back, and the broadcast channel activity query, to determine the link performance of those channels.As an alternative, channel search unit 82 switches to another channel, and monitors the link performance of second channel passively.The link performance information of each in a plurality of channels of link performance information memory 66 storages, the channel information of channel information memory 68 storage adjacent nodes.
Claims (12)
1. the method for a supervisory communications permission control in a mobile self-grouping network, described mobile self-grouping network comprises a plurality of wireless mobile nodes and a plurality of wireless communication links that a plurality of nodes are coupled together, this method comprises:
At each node place, calculate a node service quality (QoS) label value, make communication permission control decision with response QoS route requests, to find the communication route according to a qos parameter, wherein the QoS route requests comprises a traffic flow id;
At each node place, determine whether to respond the QoS route requests according to the qos parameter of QoS label value that calculates and described QoS route requests and permit and communicate by letter; And
At each node place, manage the communication of permission according to described traffic flow id, be no more than the qos parameter of QoS route requests with the communication of guaranteeing to permit.
2. according to the method for claim 1, further be included in each node place, answer the QoS route requests, whether can support the qos parameter of route requests to indicate this node, and permission communication.
3. according to the method for claim 2, wherein answer the QoS route requests and comprise when node can not be supported the qos parameter of route requests, can support what communication route according to described node QoS label value instructs node.
According to the process of claim 1 wherein qos parameter be according in available bandwidth, error rate, end-to-end delay, end-to-end delay change, hop number, desirable path duration and the priority one of at least.
5. according to the function that one of the process of claim 1 wherein in other nodes can be used in node specific QoS label value is an available horsepower, node can be used bandwidth, recent error rate, recent time-delay, the scope bandwidth and the node queue's size at least.
6. according to the method for claim 1, further be included in each node place, prevent to surpass the propagation of communication of the qos parameter of QoS route requests.
7. according to the method for claim 6, prevent that wherein the propagation of communicating by letter from comprising, each node buffering surpasses the communication of the qos parameter of QoS route requests.
8. mobile self-grouping network comprises:
A plurality of mobile nodes; And
A plurality of wireless communication links that a plurality of mobile nodes are coupled together;
Each mobile node comprises
A communication equipment, be used for by described wireless communication link wirelessly with other node communications of described a plurality of nodes, and
A controller is used for by described communication equipment routing to communicate, and comprises
A route discovery unit is used for sending service quality (QoS) route requests to other nodes, and to be found to the route of a destination node according at least one qos parameter, described QoS route requests comprises a traffic flow id,
A QoS tag calculation unit is used to calculate a node QoS label value, determines to make communication permission control, and
A communication permission controller is used for qos parameter according to QoS label value that calculates and described QoS route requests and determines whether to respond the QoS route requests and permit and communicate by letter,
A route requests processing unit is used to answer the QoS route requests, and whether instructs node can support the qos parameter of route requests, and permission communication, and
A communications management unit is used for managing according to traffic flow id the communication of permission, is no more than the qos parameter of QoS route requests with the communication of guaranteeing to permit.
9. network according to Claim 8, wherein qos parameter be according in available bandwidth, error rate, end-to-end delay, end-to-end delay change, hop number, desirable path duration and the priority one of at least.
10. network according to Claim 8, wherein the node QoS label value comprises one or more in bandwidth that other nodes in available horsepower, bandwidth that node can be used, recent error rate, recent time-delay, the scope can be used and the node queue's size.
11. network according to Claim 8, wherein communications management unit stops the propagation of the communication of the qos parameter that surpasses the QoS route requests.
12. according to the network of claim 11, wherein communications management unit comprises a buffer, is used to store the communication above the qos parameter of QoS route requests.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US10/134,714 US7068600B2 (en) | 2002-04-29 | 2002-04-29 | Traffic policing in a mobile ad hoc network |
| US10/134,714 | 2002-04-29 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1650578A true CN1650578A (en) | 2005-08-03 |
Family
ID=29249278
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA038096633A Pending CN1650578A (en) | 2002-04-29 | 2003-04-28 | Traffic policing in a mobile ad hoc network |
Country Status (9)
| Country | Link |
|---|---|
| US (1) | US7068600B2 (en) |
| EP (1) | EP1502393B1 (en) |
| JP (1) | JP2005524336A (en) |
| CN (1) | CN1650578A (en) |
| AT (1) | ATE407497T1 (en) |
| AU (1) | AU2003234262A1 (en) |
| CA (1) | CA2484501A1 (en) |
| DE (1) | DE60323360D1 (en) |
| WO (1) | WO2003094404A2 (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102111316A (en) * | 2011-03-22 | 2011-06-29 | 广州海格通信集团股份有限公司 | Automatic networking method of network system |
| US8014389B2 (en) | 2005-12-06 | 2011-09-06 | Lippershy Celestial Llc | Bidding network |
| US8055897B2 (en) | 2005-12-06 | 2011-11-08 | Lippershy Celestial Llc | Digital object title and transmission information |
| CN101336427B (en) * | 2005-12-06 | 2012-01-18 | 利珀赛天上有限责任公司 | Digital object routing based on a service request |
| CN102474793A (en) * | 2009-07-15 | 2012-05-23 | 高通股份有限公司 | Systems and methods for providing resource allocation meeting communication constraints for multi-hop network data flows |
| US8194701B2 (en) | 2005-12-06 | 2012-06-05 | Lippershy Celestial Llc | System and/or method for downstream bidding |
| CN101394337B (en) * | 2007-09-21 | 2012-11-07 | 华为技术有限公司 | Method, system and device for message routing between network nodes based on P2P |
| CN101647238B (en) * | 2007-02-07 | 2013-05-08 | 汤姆逊许可公司 | A radio and bandwidth aware routing metric for multi-radio multi-channel multi-hop wireless networks |
| CN103609074A (en) * | 2011-06-17 | 2014-02-26 | 微软公司 | Application specific WEB request routing |
| CN104104603A (en) * | 2014-08-07 | 2014-10-15 | 中国人民解放军信息工程大学 | Method and system for establishing data transmission links |
| US8929388B2 (en) | 2009-07-15 | 2015-01-06 | Qualcomm Incorporated | Systems and methods for resource allocation serving communication requirements and fairness |
| CN108370531A (en) * | 2015-12-30 | 2018-08-03 | 华为技术有限公司 | Method for determining transmission link and terminal device |
| CN108924776A (en) * | 2018-07-13 | 2018-11-30 | 上海邮电设计咨询研究院有限公司 | A kind of fire fighting monitoring communication system |
Families Citing this family (135)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8578015B2 (en) * | 2002-04-29 | 2013-11-05 | Harris Corporation | Tracking traffic in a mobile ad hoc network |
| US7218644B1 (en) * | 2002-05-29 | 2007-05-15 | Nokia Corporation | Dynamic bandwidth allocation for bluetooth access point connections |
| GB0215013D0 (en) * | 2002-06-28 | 2002-08-07 | Nokia Corp | Communications system and method |
| US8089887B2 (en) * | 2002-11-19 | 2012-01-03 | Massachusetts Institute Of Technology | Method for automatic signal routing in ad hoc networks |
| JP4045936B2 (en) * | 2002-11-26 | 2008-02-13 | 株式会社日立製作所 | Address translation device |
| US20040156388A1 (en) * | 2003-02-07 | 2004-08-12 | Lockheed Martin Corporation | System for maintaining quality of service |
| JP5037120B2 (en) * | 2003-06-05 | 2012-09-26 | メッシュネットワークス インコーポレイテッド | Optimal routing in ad hoc wireless communication networks |
| KR20060018882A (en) * | 2003-06-06 | 2006-03-02 | 메시네트웍스, 인코포레이티드 | A method to provide a measure of link reliability to a routing protocol in an ad hoc wireless network |
| US8223637B2 (en) * | 2003-06-17 | 2012-07-17 | Avaya Inc. | Quality-of-service and call admission control |
| KR100526183B1 (en) * | 2003-07-15 | 2005-11-03 | 삼성전자주식회사 | Apparatus and Method for efficient data transmission/reception in Mobile Ad-hoc Network |
| US7408885B2 (en) * | 2003-08-19 | 2008-08-05 | Avaya Inc. | Method and apparatus for automatic determination of performance problem locations in a network |
| DE10350904B4 (en) | 2003-10-31 | 2005-12-01 | Siemens Ag | Method for determining a path in a local radio communication system |
| US20050152373A1 (en) * | 2004-01-08 | 2005-07-14 | Interdigital Technology Corporation | Packet scheduling in a wireless local area network |
| AU2005201005A1 (en) * | 2004-03-05 | 2005-09-22 | General Dynamics C4 Systems, Inc | A method and system for capacity analysis for on the move adhoc wireless packet-switched networks |
| GB0407144D0 (en) | 2004-03-30 | 2004-05-05 | British Telecomm | Networks |
| DE102004021319B4 (en) * | 2004-04-30 | 2010-11-11 | Siemens Ag | Setup of multihop communication connections depending on limit values |
| US7995489B2 (en) * | 2004-06-14 | 2011-08-09 | The Boeing Company | Topology and quality of service management apparatus and methods for communication networks |
| US20060099933A1 (en) * | 2004-06-16 | 2006-05-11 | Avaya Technology Llc | Call admission control of a shared-access resource during a handover |
| US8665714B2 (en) * | 2004-06-16 | 2014-03-04 | Avaya Inc. | Call admission control of shared-access resources through a call-handling server |
| CN100514961C (en) | 2004-08-02 | 2009-07-15 | 华为技术有限公司 | Signaling interactive method for Internet protocol service mass |
| KR100659351B1 (en) | 2004-08-07 | 2006-12-19 | 학교법인 울산공업학원 | A DiffServ module for QoS in Mobile ad hoc networks and a congestion control method |
| US20060095546A1 (en) * | 2004-10-07 | 2006-05-04 | Nokia Corporation | Method and system for locating services in proximity networks for legacy application |
| US7719972B2 (en) * | 2004-12-03 | 2010-05-18 | Intel Corporation | Methods and apparatus for providing an admission control system in a wireless mesh network |
| KR100703726B1 (en) * | 2004-12-11 | 2007-04-05 | 삼성전자주식회사 | Method for managing neighbor node and determining routing path in mobile ad hoc network, and network apparatus thereof |
| US7656886B2 (en) * | 2005-02-07 | 2010-02-02 | Chin-Tau Lea | Non-blocking internet backbone network |
| TWI454106B (en) | 2005-03-11 | 2014-09-21 | Interdigital Tech Corp | Method and apparatus for implementing path-based traffic stream admission control in a wireless mesh network |
| US20060218353A1 (en) * | 2005-03-11 | 2006-09-28 | Interdigital Technology Corporation | Method and apparatus for implementing path-based traffic stream admission control in a wireless mesh network |
| US20060251119A1 (en) * | 2005-05-04 | 2006-11-09 | Sridhar Ramesh | Methods and apparatus to setup end-to-end flows in wireless mesh networks |
| EP1727316B1 (en) * | 2005-05-23 | 2009-10-14 | Alcatel Lucent | Extension to RSVP protocol for supporting OAM configuration |
| CN101297524B (en) | 2005-08-23 | 2011-01-26 | 艾利森电话股份有限公司 | Convergence type resource obligation of data flow |
| US8339948B2 (en) * | 2005-09-16 | 2012-12-25 | Ntt Docomo, Inc. | Method for improving capacity in multi-hop wireless mesh networks |
| US7898957B2 (en) * | 2005-10-03 | 2011-03-01 | The Hong Kong University Of Science And Technology | Non-blocking destination-based routing networks |
| US8385193B2 (en) | 2005-10-18 | 2013-02-26 | Qualcomm Incorporated | Method and apparatus for admission control of data in a mesh network |
| US20070101018A1 (en) * | 2005-11-01 | 2007-05-03 | Meral Shirazipour | Inter-domain QoS reservation establishment and modification |
| WO2007053141A1 (en) * | 2005-11-02 | 2007-05-10 | Thomson Licensing | Method for determining a route in a wireless mesh network using a metric based on radio and traffic load |
| WO2007060536A2 (en) * | 2005-11-28 | 2007-05-31 | Iwics Inc | Intelligent video, data streaming and access to distributed resources in a wireless network |
| US7894447B2 (en) | 2005-12-06 | 2011-02-22 | Lippershy Celestial Llc | Digital object routing |
| US8243603B2 (en) * | 2005-12-07 | 2012-08-14 | Motorola Solutions, Inc. | Method and system for improving a wireless communication route |
| US7496366B2 (en) * | 2005-12-19 | 2009-02-24 | Motorola, Inc. | Wireless communication system capacity control facilitation method and apparatus |
| US8514861B2 (en) * | 2006-01-03 | 2013-08-20 | Meshnetworks, Inc. | Apparatus and method for multicasting data in a communication network |
| US8483123B2 (en) * | 2006-06-30 | 2013-07-09 | Nokia Corporation | QoS request and information distribution for wireless relay networks |
| US8570859B1 (en) * | 2006-07-21 | 2013-10-29 | Sprint Spectrum L.P. | Hybrid mesh network |
| US7768929B2 (en) * | 2006-07-31 | 2010-08-03 | Avaya Inc. | Determination of endpoint device location for efficient analysis of network performance |
| US20100011244A1 (en) * | 2006-08-30 | 2010-01-14 | France Telecom | Method of routing data in a network comprising nodes organized into clusters |
| US8649264B2 (en) * | 2006-10-04 | 2014-02-11 | Qualcomm Incorporated | IP flow-based load balancing over a plurality of wireless network links |
| US8248999B2 (en) * | 2006-11-13 | 2012-08-21 | Motorola Solutions, Inc. | Method and apparatus for resource reservation in a multihop wireless network |
| US9030934B2 (en) * | 2007-09-07 | 2015-05-12 | Qualcomm Incorporated | Host-based quality of service for wireless communications |
| US7801153B2 (en) * | 2007-10-01 | 2010-09-21 | Powerwave Cognition, Inc. | Communication scheduling of network nodes using fair access and weighting techniques |
| US7965671B2 (en) * | 2007-10-01 | 2011-06-21 | Powerwave Cognition, Inc. | Dynamic channel sharing using bandwidth metrics |
| US8472315B2 (en) * | 2008-02-07 | 2013-06-25 | Belair Networks Inc. | Method and system for controlling link saturation of synchronous data across packet networks |
| US20110164527A1 (en) * | 2008-04-04 | 2011-07-07 | Mishra Rajesh K | Enhanced wireless ad hoc communication techniques |
| US9236933B2 (en) | 2008-05-23 | 2016-01-12 | Electronics And Telecommunications Research Institute | Apparatus and method for transmitting and receiving data using multi-path in wireless communication system of distributed MAC |
| WO2009144756A1 (en) * | 2008-05-29 | 2009-12-03 | Selex Communications S.P.A. | Modified ad-hoc on-demand di stance -vector routing protocol |
| US8548428B2 (en) | 2009-01-28 | 2013-10-01 | Headwater Partners I Llc | Device group partitions and settlement platform |
| US8275830B2 (en) | 2009-01-28 | 2012-09-25 | Headwater Partners I Llc | Device assisted CDR creation, aggregation, mediation and billing |
| US8391834B2 (en) | 2009-01-28 | 2013-03-05 | Headwater Partners I Llc | Security techniques for device assisted services |
| US8406748B2 (en) | 2009-01-28 | 2013-03-26 | Headwater Partners I Llc | Adaptive ambient services |
| US8346225B2 (en) | 2009-01-28 | 2013-01-01 | Headwater Partners I, Llc | Quality of service for device assisted services |
| US8402111B2 (en) | 2009-01-28 | 2013-03-19 | Headwater Partners I, Llc | Device assisted services install |
| US8635335B2 (en) | 2009-01-28 | 2014-01-21 | Headwater Partners I Llc | System and method for wireless network offloading |
| US8725123B2 (en) | 2008-06-05 | 2014-05-13 | Headwater Partners I Llc | Communications device with secure data path processing agents |
| US8832777B2 (en) | 2009-03-02 | 2014-09-09 | Headwater Partners I Llc | Adapting network policies based on device service processor configuration |
| US8589541B2 (en) | 2009-01-28 | 2013-11-19 | Headwater Partners I Llc | Device-assisted services for protecting network capacity |
| US8626115B2 (en) | 2009-01-28 | 2014-01-07 | Headwater Partners I Llc | Wireless network service interfaces |
| US8898293B2 (en) | 2009-01-28 | 2014-11-25 | Headwater Partners I Llc | Service offer set publishing to device agent with on-device service selection |
| US8340634B2 (en) | 2009-01-28 | 2012-12-25 | Headwater Partners I, Llc | Enhanced roaming services and converged carrier networks with device assisted services and a proxy |
| US8924469B2 (en) | 2008-06-05 | 2014-12-30 | Headwater Partners I Llc | Enterprise access control and accounting allocation for access networks |
| US8924543B2 (en) | 2009-01-28 | 2014-12-30 | Headwater Partners I Llc | Service design center for device assisted services |
| US8250207B2 (en) | 2009-01-28 | 2012-08-21 | Headwater Partners I, Llc | Network based ambient services |
| US8175101B2 (en) * | 2008-08-15 | 2012-05-08 | Raytheon Company | Multicasting in a network using neighbor information |
| US8094637B1 (en) * | 2008-12-01 | 2012-01-10 | Marvell International Ltd. | Avoiding mesh path discovery in wireless mesh networks |
| US9980146B2 (en) | 2009-01-28 | 2018-05-22 | Headwater Research Llc | Communications device with secure data path processing agents |
| US9572019B2 (en) | 2009-01-28 | 2017-02-14 | Headwater Partners LLC | Service selection set published to device agent with on-device service selection |
| US9557889B2 (en) | 2009-01-28 | 2017-01-31 | Headwater Partners I Llc | Service plan design, user interfaces, application programming interfaces, and device management |
| US10326800B2 (en) | 2009-01-28 | 2019-06-18 | Headwater Research Llc | Wireless network service interfaces |
| US10779177B2 (en) | 2009-01-28 | 2020-09-15 | Headwater Research Llc | Device group partitions and settlement platform |
| US9571559B2 (en) | 2009-01-28 | 2017-02-14 | Headwater Partners I Llc | Enhanced curfew and protection associated with a device group |
| US9647918B2 (en) | 2009-01-28 | 2017-05-09 | Headwater Research Llc | Mobile device and method attributing media services network usage to requesting application |
| US8745191B2 (en) | 2009-01-28 | 2014-06-03 | Headwater Partners I Llc | System and method for providing user notifications |
| US9955332B2 (en) | 2009-01-28 | 2018-04-24 | Headwater Research Llc | Method for child wireless device activation to subscriber account of a master wireless device |
| US9706061B2 (en) | 2009-01-28 | 2017-07-11 | Headwater Partners I Llc | Service design center for device assisted services |
| US9755842B2 (en) | 2009-01-28 | 2017-09-05 | Headwater Research Llc | Managing service user discovery and service launch object placement on a device |
| US9954975B2 (en) | 2009-01-28 | 2018-04-24 | Headwater Research Llc | Enhanced curfew and protection associated with a device group |
| US10798252B2 (en) | 2009-01-28 | 2020-10-06 | Headwater Research Llc | System and method for providing user notifications |
| US9270559B2 (en) | 2009-01-28 | 2016-02-23 | Headwater Partners I Llc | Service policy implementation for an end-user device having a control application or a proxy agent for routing an application traffic flow |
| US10264138B2 (en) | 2009-01-28 | 2019-04-16 | Headwater Research Llc | Mobile device and service management |
| US8351898B2 (en) * | 2009-01-28 | 2013-01-08 | Headwater Partners I Llc | Verifiable device assisted service usage billing with integrated accounting, mediation accounting, and multi-account |
| US8606911B2 (en) | 2009-03-02 | 2013-12-10 | Headwater Partners I Llc | Flow tagging for service policy implementation |
| US10715342B2 (en) | 2009-01-28 | 2020-07-14 | Headwater Research Llc | Managing service user discovery and service launch object placement on a device |
| US9578182B2 (en) | 2009-01-28 | 2017-02-21 | Headwater Partners I Llc | Mobile device and service management |
| US10783581B2 (en) | 2009-01-28 | 2020-09-22 | Headwater Research Llc | Wireless end-user device providing ambient or sponsored services |
| US10484858B2 (en) | 2009-01-28 | 2019-11-19 | Headwater Research Llc | Enhanced roaming services and converged carrier networks with device assisted services and a proxy |
| US9253663B2 (en) | 2009-01-28 | 2016-02-02 | Headwater Partners I Llc | Controlling mobile device communications on a roaming network based on device state |
| US9565707B2 (en) | 2009-01-28 | 2017-02-07 | Headwater Partners I Llc | Wireless end-user device with wireless data attribution to multiple personas |
| US10200541B2 (en) | 2009-01-28 | 2019-02-05 | Headwater Research Llc | Wireless end-user device with divided user space/kernel space traffic policy system |
| US10064055B2 (en) | 2009-01-28 | 2018-08-28 | Headwater Research Llc | Security, fraud detection, and fraud mitigation in device-assisted services systems |
| US11218854B2 (en) | 2009-01-28 | 2022-01-04 | Headwater Research Llc | Service plan design, user interfaces, application programming interfaces, and device management |
| US10841839B2 (en) | 2009-01-28 | 2020-11-17 | Headwater Research Llc | Security, fraud detection, and fraud mitigation in device-assisted services systems |
| US8893009B2 (en) | 2009-01-28 | 2014-11-18 | Headwater Partners I Llc | End user device that secures an association of application to service policy with an application certificate check |
| US8793758B2 (en) | 2009-01-28 | 2014-07-29 | Headwater Partners I Llc | Security, fraud detection, and fraud mitigation in device-assisted services systems |
| US9392462B2 (en) | 2009-01-28 | 2016-07-12 | Headwater Partners I Llc | Mobile end-user device with agent limiting wireless data communication for specified background applications based on a stored policy |
| US9351193B2 (en) | 2009-01-28 | 2016-05-24 | Headwater Partners I Llc | Intermediate networking devices |
| US10237757B2 (en) | 2009-01-28 | 2019-03-19 | Headwater Research Llc | System and method for wireless network offloading |
| US10492102B2 (en) | 2009-01-28 | 2019-11-26 | Headwater Research Llc | Intermediate networking devices |
| US9858559B2 (en) | 2009-01-28 | 2018-01-02 | Headwater Research Llc | Network service plan design |
| US10248996B2 (en) | 2009-01-28 | 2019-04-02 | Headwater Research Llc | Method for operating a wireless end-user device mobile payment agent |
| US10057775B2 (en) | 2009-01-28 | 2018-08-21 | Headwater Research Llc | Virtualized policy and charging system |
| EP2230803A1 (en) * | 2009-03-16 | 2010-09-22 | BRITISH TELECOMMUNICATIONS public limited company | Path characterisation in networks |
| EP2579518B1 (en) * | 2010-05-28 | 2016-09-28 | Nec Corporation | Transmission device, bandwidth control method and computer program |
| KR101136375B1 (en) | 2010-07-12 | 2012-04-18 | 아주대학교산학협력단 | Method and apparatus for establishing a routing path on a multi-hop network |
| US9154826B2 (en) | 2011-04-06 | 2015-10-06 | Headwater Partners Ii Llc | Distributing content and service launch objects to mobile devices |
| US9842498B2 (en) * | 2011-07-05 | 2017-12-12 | Qualcomm Incorporated | Road-traffic-based group, identifier, and resource selection in vehicular peer-to-peer networks |
| US9167463B2 (en) * | 2011-09-02 | 2015-10-20 | Telcordia Technologies, Inc. | Communication node operable to estimate faults in an ad hoc network and method of performing the same |
| WO2014159862A1 (en) | 2013-03-14 | 2014-10-02 | Headwater Partners I Llc | Automated credential porting for mobile devices |
| KR101505624B1 (en) | 2014-01-03 | 2015-03-24 | 아주대학교산학협력단 | Mobility prediction scheme based on Relative Mobile Characteristics |
| US20150195189A1 (en) * | 2014-01-07 | 2015-07-09 | Alcatel Lucent Usa, Inc. | Multiple tree routed selective randomized load balancing |
| US9756549B2 (en) | 2014-03-14 | 2017-09-05 | goTenna Inc. | System and method for digital communication between computing devices |
| US9462025B2 (en) | 2014-05-04 | 2016-10-04 | Valens Semiconductor Ltd. | Increasing link throughput to enable admission without exceeding latency variation limits |
| JP6369317B2 (en) | 2014-12-15 | 2018-08-08 | ソニー株式会社 | Information processing apparatus, communication system, information processing method, and program |
| CN106664252B (en) * | 2015-06-10 | 2019-11-29 | 华为技术有限公司 | Realize method, equipment and the system of service chaining |
| KR20170014458A (en) * | 2015-07-30 | 2017-02-08 | 엘지전자 주식회사 | Mobile terminal, watch-type mobile terminal and method for controlling the same |
| US9900230B2 (en) * | 2016-01-07 | 2018-02-20 | Avaya Inc. | Dissemination of quality of service information in a distributed environment |
| US10171350B2 (en) * | 2016-04-27 | 2019-01-01 | Cisco Technology, Inc. | Generating packets in a reverse direction of a service function chain |
| WO2018165182A1 (en) | 2017-03-07 | 2018-09-13 | 128 Technology, Inc. | Router device using flow duplication |
| US10541937B2 (en) * | 2017-07-18 | 2020-01-21 | Cisco Technology, Inc. | Multi-level resource reservation |
| US11165863B1 (en) | 2017-08-04 | 2021-11-02 | 128 Technology, Inc. | Network neighborhoods for establishing communication relationships between communication interfaces in an administrative domain |
| US10542127B2 (en) * | 2017-09-06 | 2020-01-21 | Sap Se | Fault tolerant communication in a distributed system |
| US10944669B1 (en) | 2018-02-09 | 2021-03-09 | GoTenna, Inc. | System and method for efficient network-wide broadcast in a multi-hop wireless network using packet echos |
| US20190253341A1 (en) | 2018-02-15 | 2019-08-15 | 128 Technology, Inc. | Service Related Routing Method and Apparatus |
| US10813169B2 (en) | 2018-03-22 | 2020-10-20 | GoTenna, Inc. | Mesh network deployment kit |
| GB2574875B (en) * | 2018-06-21 | 2021-04-14 | Tcl Communication Ltd | Route selection and QoS support in a wireless access network |
| CA3107919A1 (en) | 2018-07-27 | 2020-01-30 | GoTenna, Inc. | Vinetm: zero-control routing using data packet inspection for wireless mesh networks |
| WO2020185707A1 (en) | 2019-03-08 | 2020-09-17 | goTenna Inc. | Method for utilization-based traffic throttling in a wireless mesh network |
| CN110262533B (en) * | 2019-06-25 | 2021-06-15 | 哈尔滨工业大学 | Modular reconfigurable satellite self-reconfiguration method and device based on hierarchical task network planning and computer storage medium |
| CN115428411A (en) | 2020-04-23 | 2022-12-02 | 瞻博网络公司 | Session monitoring using session establishment metrics |
Family Cites Families (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5412654A (en) * | 1994-01-10 | 1995-05-02 | International Business Machines Corporation | Highly dynamic destination-sequenced destination vector routing for mobile computers |
| US5623495A (en) * | 1995-06-15 | 1997-04-22 | Lucent Technologies Inc. | Portable base station architecture for an AD-HOC ATM lan |
| US5717689A (en) * | 1995-10-10 | 1998-02-10 | Lucent Technologies Inc. | Data link layer protocol for transport of ATM cells over a wireless link |
| US5872773A (en) * | 1996-05-17 | 1999-02-16 | Lucent Technologies Inc. | Virtual trees routing protocol for an ATM-based mobile network |
| US5787080A (en) * | 1996-06-03 | 1998-07-28 | Philips Electronics North America Corporation | Method and apparatus for reservation-based wireless-ATM local area network |
| US5987011A (en) * | 1996-08-30 | 1999-11-16 | Chai-Keong Toh | Routing method for Ad-Hoc mobile networks |
| FI110987B (en) * | 1998-03-31 | 2003-04-30 | Nokia Corp | Method of connecting data transfer streams |
| US6304556B1 (en) * | 1998-08-24 | 2001-10-16 | Cornell Research Foundation, Inc. | Routing and mobility management protocols for ad-hoc networks |
| US6683852B2 (en) * | 1998-12-15 | 2004-01-27 | Lucent Technologies Inc. | Call admission control methods and apparatus for improving route selection in packet networks |
| FI107772B (en) * | 1998-12-16 | 2001-09-28 | Nokia Networks Oy | Method and system for limiting the quality of data transmission service |
| US6678252B1 (en) * | 1999-10-28 | 2004-01-13 | Verizon Laboratories Inc. | Method and apparatus for dynamic source routing in ad hoc wireless networks |
| US6385174B1 (en) * | 1999-11-12 | 2002-05-07 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for transmission of node link status messages throughout a network with reduced communication protocol overhead traffic |
| US6459898B1 (en) * | 1999-11-19 | 2002-10-01 | Comsat Corporation | Information traffic and performance monitoring for multi-beam satellites with on-board switching |
| WO2001058237A2 (en) * | 2000-02-12 | 2001-08-16 | Hrl Laboratories, Llc | Scalable unidirectional routing for mobile ad-hoc networks |
| JP4879436B2 (en) * | 2000-02-23 | 2012-02-22 | マイクロソフト コーポレーション | Quality of service over communication paths with wireless links |
| US6894991B2 (en) * | 2000-11-30 | 2005-05-17 | Verizon Laboratories Inc. | Integrated method for performing scheduling, routing and access control in a computer network |
| US7113796B2 (en) * | 2002-01-18 | 2006-09-26 | Microsoft Corporation | Framework and method for QoS-aware resource discovery in mobile ad hoc networks |
-
2002
- 2002-04-29 US US10/134,714 patent/US7068600B2/en not_active Expired - Lifetime
-
2003
- 2003-04-28 JP JP2004502518A patent/JP2005524336A/en active Pending
- 2003-04-28 AT AT03728575T patent/ATE407497T1/en not_active IP Right Cessation
- 2003-04-28 AU AU2003234262A patent/AU2003234262A1/en not_active Abandoned
- 2003-04-28 DE DE60323360T patent/DE60323360D1/en not_active Expired - Lifetime
- 2003-04-28 CN CNA038096633A patent/CN1650578A/en active Pending
- 2003-04-28 EP EP03728575A patent/EP1502393B1/en not_active Expired - Lifetime
- 2003-04-28 WO PCT/US2003/013138 patent/WO2003094404A2/en active Application Filing
- 2003-04-28 CA CA002484501A patent/CA2484501A1/en not_active Abandoned
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9686183B2 (en) | 2005-12-06 | 2017-06-20 | Zarbaña Digital Fund Llc | Digital object routing based on a service request |
| US8014389B2 (en) | 2005-12-06 | 2011-09-06 | Lippershy Celestial Llc | Bidding network |
| US8055897B2 (en) | 2005-12-06 | 2011-11-08 | Lippershy Celestial Llc | Digital object title and transmission information |
| CN101336427B (en) * | 2005-12-06 | 2012-01-18 | 利珀赛天上有限责任公司 | Digital object routing based on a service request |
| US11539614B2 (en) | 2005-12-06 | 2022-12-27 | Zarbaña Digital Fund Llc | Digital object routing based on a service request |
| US8194701B2 (en) | 2005-12-06 | 2012-06-05 | Lippershy Celestial Llc | System and/or method for downstream bidding |
| US10892975B2 (en) | 2005-12-06 | 2021-01-12 | Zarbaña Digital Fund Llc | Digital object routing based on a service request |
| CN101647238B (en) * | 2007-02-07 | 2013-05-08 | 汤姆逊许可公司 | A radio and bandwidth aware routing metric for multi-radio multi-channel multi-hop wireless networks |
| CN101394337B (en) * | 2007-09-21 | 2012-11-07 | 华为技术有限公司 | Method, system and device for message routing between network nodes based on P2P |
| CN102474793A (en) * | 2009-07-15 | 2012-05-23 | 高通股份有限公司 | Systems and methods for providing resource allocation meeting communication constraints for multi-hop network data flows |
| US8929388B2 (en) | 2009-07-15 | 2015-01-06 | Qualcomm Incorporated | Systems and methods for resource allocation serving communication requirements and fairness |
| CN102111316A (en) * | 2011-03-22 | 2011-06-29 | 广州海格通信集团股份有限公司 | Automatic networking method of network system |
| CN103609074A (en) * | 2011-06-17 | 2014-02-26 | 微软公司 | Application specific WEB request routing |
| CN104104603B (en) * | 2014-08-07 | 2017-05-24 | 中国人民解放军信息工程大学 | Method and system for establishing data transmission links |
| CN104104603A (en) * | 2014-08-07 | 2014-10-15 | 中国人民解放军信息工程大学 | Method and system for establishing data transmission links |
| CN108370531A (en) * | 2015-12-30 | 2018-08-03 | 华为技术有限公司 | Method for determining transmission link and terminal device |
| CN108924776A (en) * | 2018-07-13 | 2018-11-30 | 上海邮电设计咨询研究院有限公司 | A kind of fire fighting monitoring communication system |
Also Published As
| Publication number | Publication date |
|---|---|
| EP1502393A2 (en) | 2005-02-02 |
| WO2003094404A3 (en) | 2004-02-12 |
| DE60323360D1 (en) | 2008-10-16 |
| ATE407497T1 (en) | 2008-09-15 |
| US20030202469A1 (en) | 2003-10-30 |
| EP1502393B1 (en) | 2008-09-03 |
| EP1502393A4 (en) | 2005-10-12 |
| US7068600B2 (en) | 2006-06-27 |
| AU2003234262A1 (en) | 2003-11-17 |
| CA2484501A1 (en) | 2003-11-13 |
| AU2003234262A8 (en) | 2003-11-17 |
| JP2005524336A (en) | 2005-08-11 |
| WO2003094404A2 (en) | 2003-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1322719C (en) | Admission control in a mobile ad hoc network | |
| CN1650578A (en) | Traffic policing in a mobile ad hoc network | |
| CN1650650A (en) | Allocating channels in a mobile ad hoc network | |
| EP1502200B1 (en) | Tracking traffic in a mobile ad hoc network | |
| CN1224281C (en) | Mobile AD-HOC network based on weighting quality measuration and executive function thereof | |
| EP1500229B1 (en) | DETERMINING QUALITY OF SERVICE (QoS) ROUTING FOR MOBILE AD HOC NETWORKS | |
| Al-Gifran et al. | Load-Balancing Technique in Clustered Mobile Ad-Hoc Networks | |
| Nikate et al. | Energy Efficient Self Adaptive on Demand Geographical Routing Protocols in MANET |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Open date: 20050803 |