text:
Patent US20030204587 - Tracking traffic in a mobile Ad Hoc network - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsA mobile ad hoc network includes a plurality of wireless mobile nodes and a plurality of wireless communication links connecting the plurality of nodes together. The method of tracking traffic includes each node monitoring traffic communicated between nodes in the network, each node generating traffic...http://www.google.com/patents/US20030204587?utm_source=gb-gplus-sharePatent US20030204587 - Tracking traffic in a mobile Ad Hoc networkAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS20030204587 A1Publication typeApplicationApplication numberUS 10/134,948Publication dateOct 30, 2003Filing dateApr 29, 2002Priority dateApr 29, 2002Also published asCA2484495A1, CN1326067C, CN1650283A, DE60318428D1, DE60318428T2, EP1502200A1, EP1502200A4, EP1502200B1, US8578015, WO2003094028A1Publication number10134948, 134948, US 2003/0204587 A1, US 2003/204587 A1, US 20030204587 A1, US 20030204587A1, US 2003204587 A1, US 2003204587A1, US-A1-20030204587, US-A1-2003204587, US2003/0204587A1, US2003/204587A1, US20030204587 A1, US20030204587A1, US2003204587 A1, US2003204587A1InventorsTom BillhartzOriginal AssigneeHarris CorporationExport CitationBiBTeX, EndNote, RefManPatent Citations (32), Referenced by (54), Classifications (39), Legal Events (1) External Links: USPTO, USPTO Assignment, EspacenetTracking traffic in a mobile Ad Hoc network
US 20030204587 A1Abstract
A mobile ad hoc network includes a plurality of wireless mobile nodes and a plurality of wireless communication links connecting the plurality of nodes together. The method of tracking traffic includes each node monitoring traffic communicated between nodes in the network, each node generating traffic information based upon how much traffic is being communicated between various nodes in the network, and each node storing the traffic information in a traffic database. The traffic information may be based upon bandwidth and may include at least one of error rate, end-to-end delay, end-to-end delay variation, hop count, expected path durability, and priority. Each node may discover and select traffic routes based upon the stored traffic information. Images(14) Claims(41)
That which is claimed is: 1. A method for tracking traffic in a mobile ad hoc network comprising a plurality of wireless mobile nodes and a plurality of wireless communication links connecting the plurality of nodes together, the method comprising: at each node, monitoring traffic communicated between nodes in the network; at each node, generating traffic information based upon how much traffic is being communicated between various nodes in the network; and at each node, storing the traffic information in a traffic database. 2. A method according to claim 1 wherein the traffic information is based upon bandwidth. 3. A method according to claim 2 wherein the traffic information includes at least one of error rate, end-to-end delay, end-to-end delay variation, hop count, expected path durability, and priority. 4. A method according to claim 1 wherein the traffic database comprises a 1-hop traffic matrix. 5. A method according to claim 1 wherein monitoring comprises: broadcasting a traffic activity query; and processing replies to the traffic activity query. 6. A method according to claim 1 wherein monitoring comprises passively monitoring the traffic between nodes in the network. 7. A method according to claim 1 further comprising at each node, discovering and selecting traffic routes based upon the stored traffic information. 8. A method according to claim 1 further comprising: at each node, generating traffic destination information based upon how many destinations each of various nodes communicates with in the network; and at each node, storing the traffic destination information in a destination quantity database. 9. A method according to claim 8 further comprising at each node, discovering and selecting traffic routes based upon the stored traffic destination information. 10. A method according to claim 8 further comprising at each node, discovering and selecting traffic routes based upon the stored traffic information and the stored traffic destination information. 11. A method for tracking traffic at a node in a mobile ad hoc network comprising a plurality of wireless mobile nodes and a plurality of wireless communication links connecting the plurality of nodes together, the method comprising: monitoring traffic communicated between other nodes in the network; generating traffic information based upon how much traffic is being communicated between various nodes in the network; and storing the traffic information in a traffic database. 12. A method according to claim 11 wherein the traffic information is based upon bandwidth. 13. A method according to claim 12 wherein the traffic information includes at least one of error rate, end-to-end delay, end-to-end delay variation, hop count, expected path durability, and priority. 14. A method according to claim 11 wherein the traffic database comprises a 1-hop traffic matrix. 15. A method according to claim 11 wherein monitoring comprises: broadcasting a traffic activity query; and processing replies to the traffic activity query. 16. A method according to claim 11 wherein monitoring comprises passively monitoring the traffic between other nodes in the network. 17. A method according to claim 11 further comprising discovering and selecting traffic routes based upon the stored traffic information. 18. A method according to claim 11 further comprising: generating traffic destination information based upon how many destinations each of various nodes communicates with in the network; and storing the traffic destination information in a destination quantity database. 19. A method according to claim 18 further comprising discovering and selecting traffic routes based upon the stored traffic destination information. 20. A method according to claim 18 further comprising discovering and selecting traffic routes based upon the stored traffic information and the stored traffic destination information. 21. A method for determining routes in a mobile ad hoc network comprising a plurality of wireless mobile nodes and a plurality of wireless communication links connecting the nodes together, the method comprising: at each node, monitoring traffic communicated between nodes in the network; at each node, generating traffic information based upon traffic being communicated between various nodes in the network; at each node, storing the traffic information in a traffic database; at each node, processing the traffic information stored in the traffic database to select one of a reactive, proactive and hybrid route discovery process; at each node, discovering traffic routes with the selected route discovery process, each traffic route comprising a combination of wireless communication links; and at each node, selecting discovered routes for communication with other nodes. 22. A method according to claim 21 wherein the traffic information is based upon bandwidth. 23. A method according to claim 22 wherein the traffic information includes at least one of error rate, end-of-end delay, end-to-end delay variation, hop count, expected path durability, and priority. 24. A method according to claim 21 wherein the traffic database comprises a 1-hop traffic matrix. 25. A method according to claim 21 wherein monitoring comprises: broadcasting a traffic activity query; and processing replies to the traffic activity query. 26. A method according to claim 21 wherein monitoring comprises passively monitoring the traffic between nodes in the network. 27. A method according to claim 21 wherein selecting traffic routes comprises each node selecting traffic routes based upon the stored traffic information. 28. A method according to claim 21 further comprising: at each node, generating traffic destination information based upon how many destinations each of various nodes communicates with in the network; and at each node, storing the traffic destination information in a destination quantity database. 29. A method according to claim 28 wherein processing the traffic information further comprises selecting the route discovery process based upon the traffic destination information stored in the destination quantity database. 30. A method according to claim 28 wherein selecting discovered routes comprises each node selecting discovered routes based upon the stored traffic destination information. 31. A mobile ad hoc network comprising: a plurality of mobile nodes; and a plurality of wireless communication links connecting the plurality of mobile nodes together; each mobile node comprising a communications device to wirelessly and communicate with other nodes of the plurality of nodes via the wireless communication links, and a controller to route communications via the communications device, and comprising a traffic monitoring unit to monitor traffic communicated between nodes in the network, a traffic information generator to generate traffic information based upon how much traffic is being communicated between various nodes in the network, and a traffic information buffer to store the traffic information in a traffic database. 32. A network according to claim 31 wherein the traffic information is based upon bandwidth. 33. A network according to claim 32 wherein the traffic information includes at least one of error rate, end-to-end delay, end-to-end delay variation, hop count, expected path durability, and priority. 34. A network according to claim 31 wherein the traffic database comprises a 1-hop traffic matrix. 35. A network according to claim 31 wherein the traffic monitoring unit broadcasts a traffic activity query, and processes replies to the traffic activity query. 36. A network according to claim 31 wherein the traffic monitoring unit passively monitoring the traffic between nodes in the network. 37. A network according to claim 31 further comprising: a route discovery unit to discover routing to a destination node based upon the stored traffic information; and a route selection unit to select traffic routes to the destination node based upon the stored traffic information. 38. A network according to claim 31 wherein the route discovery unit processes the traffic information stored in the traffic database to select one of a reactive, proactive and hybrid route discovery process, and discovers traffic routes with the selected route discovery process, each traffic route comprising a combination of wireless communication links. 39. A network according to claim 31 further comprising: a traffic destination information generator to generate traffic destination information based upon how many destinations each of various nodes communicates with in the network; and a destination information buffer to store the traffic destination information in a destination quantity database. 40. A network according to claim 39 further comprising: a route discovery unit to discover routing to a destination node based upon the stored traffic destination information; and a route selection unit to select traffic routes to the destination node based upon the stored traffic destination information. 41. A network according to claim 39 further comprising: a route discovery unit to discover routing to a destination node based upon the stored traffic information and the stored traffic destination information; and a route selection unit to select traffic routes to the destination node based upon the stored traffic information and the stored traffic destination information.
FIELD OF THE INVENTION [0001] The present invention relates to the field of communication networks, and, more particularly, to mobile ad hoc wireless networks and related methods. BACKGROUND OF THE INVENTION [0002] Wireless networks have experienced increased development in the past decade. One of the most rapidly developing areas is mobile ad hoc networks. Physically, a mobile ad hoc network includes a number of geographically-distributed, potentially mobile nodes sharing a common radio channel. Compared with other type of networks, such as cellular networks or satellite networks, the most distinctive feature of mobile ad hoc networks is the lack of any fixed infrastructure. The network is formed of mobile nodes only, and a network is created on the fly as the nodes transmit with each other. The network does not depend on a particular node and dynamically adjusts as some nodes join or others leave the network. [0003] In a hostile environment where a fixed communication infrastructure is unreliable or unavailable, such as in a battle field or in a natural disaster area struck by earthquake or hurricane, an ad hoc network can be quickly deployed and provide limited but much needed communications. While the military is still a major driving force behind the development of these networks, ad hoc networks are quickly finding new applications in civilian or commercial areas. Ad hoc networks will allow people to exchange data in the field or in a class room without using any network structure except the one they create by simply turning on their computers or PDAs. [0004] As wireless communication increasingly permeates everyday life, new applications for mobile ad hoc networks will continue to emerge and become an important part of the communication structure. Mobile ad hoc networks pose serious challenges to the designers. Due to the lack of a fixed infrastructure, nodes must self-organize and reconfigure as they move, join or leave the network. All nodes are essentially the same and there is no natural hierarchy or central controller in the network. All functions have to be distributed among the nodes. Nodes are often powered by batteries and have limited communication and computation capabilities. The bandwidth of the system is usually limited. The distance between two nodes often exceeds the radio transmission range, and a transmission has to be relayed by other nodes before reaching its destination. Consequently, a network has a multihop topology, and this topology changes as the nodes move around. [0005] The Mobile Ad-Hoc Networks (MANET) working group of the Internet Engineering Task Force (IETF) has been actively evaluating and standardizing routing, including multicasting, protocols. Because the network topology changes arbitrarily as the nodes move, information is subject to becoming obsolete, and different nodes often have different views of the network, both in time (information may be outdated at some nodes but current at others) and in space (a node may only know the network topology in its neighborhood and not far away from itself). [0006] A routing protocol needs to adapt to frequent topology changes and with less accurate information. Because of these unique requirements, routing in these networks are very different from others. Gathering fresh information about the entire network is often costly and impractical. Many routing protocols are reactive (on-demand) protocols: they collect routing information only when necessary and to destinations they need routes to, and do not maintain unused routes. This way the routing overhead is greatly reduced compared to pro-active protocols which maintain optimal routes to all destinations at all time. This is important for a protocol to be adaptive. Ad Hoc on Demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA) are representatives of on-demand routing protocols presented at the MANET working group. [0007] Examples of other various routing protocols include Destination Sequenced Distance-Vector (DSDV) routing which is disclosed in U.S. Pat. No. 5,412,654 to Perkins, and Zone Routing Protocol (ZRP) which is disclosed in U.S. Pat. No. 6,304,556 to Haas. ZRP is a hybrid protocol using both proactive and reactive approaches. [0008] These conventional routing protocols use a best effort approach in selecting a route from the source node to the destination node. Typically, the number of hops is the main criteria in such a best effort approach. In other words, the route with the least amount of hops is selected as the transmission route. [0009] Quality-of-service (QoS) routing in mobile ad hoc networks is gaining interest. To provide quality-of-service, the protocol needs not only to find a route but also to secure the resources along the route. Because of the limited, shared bandwidth of the network, and lack of central controller which can account for and control these limited resources, nodes must negotiate with each other to manage the resources required for QoS routes. This is further complicated by frequent topology changes. Due to these constraints, QoS routing is more demanding than best-effort routing. [0010] Some examples of QoS routing approaches are set forth by Chenxi Zhu in the publication entitled “Medium Access Control and Quality-of-Service Routing for Mobile Ad Hoc Networks,” 2001, and by M. Mirhakkak et al. in the publication entitled “Dynamic Quality-of-Service for Mobile Ad Hoc Networks,” MITRE Corp., 2000. Zhu discusses establishing bandwidth guaranteed QoS routes in small networks whose topologies change at a low to medium rate. Mirhakkak et al. are concerned with resource reservation requests which specify a range of QoS values while the network makes a commitment to provide service within this range. [0011] At each node, admission control is performed to forward traffic from other nodes. Typically, conventional admission control protocols provide for full disclosure regarding routes and connectivity. In other words, each node shares all route and connectivity data with other nodes so that the best-effort routes are selected overall. SUMMARY OF THE INVENTION [0012] In view of the foregoing background, it is therefore an object of the present invention to provide traffic tracking for multihop routes in a mobile ad hoc network. [0013] This and other objects, features, and advantages in accordance with the present invention are provided by a method for tracking traffic in a mobile ad hoc network. The network includes a plurality of wireless mobile nodes and a plurality of wireless communication links connecting the plurality of nodes together. The method includes each node monitoring traffic communicated between nodes in the network, each node generating traffic information based upon how much traffic is being communicated between various nodes in the network, and each node storing the traffic information in a traffic database or table. [0014] In the method, the traffic information may be based upon bandwidth and may include at least one of error rate, end-to-end delay, end-to-end delay variation, hop count, expected path durability, and priority. The traffic database may comprise a 1-hop traffic matrix. Monitoring may include broadcasting a traffic activity query, and processing replies to the traffic activity query, or passively monitoring the traffic between nodes in the network. Each node may discover and select traffic routes based upon the stored traffic information. [0015] Furthermore, each node may generate traffic destination information based upon how many destinations each of various nodes communicates with in the network, and store the traffic destination information in a destination quantity database or table. Thus, each node may also discover and select traffic routes based upon the stored traffic destination information. [0016] A system aspect of the present invention is directed to a mobile ad hoc network having a plurality of mobile nodes, and a plurality of wireless communication links connecting the plurality of mobile nodes together. Each mobile node comprises a communications device to wirelessly and unidirectionally or bi-directionally communicate with other nodes of the plurality of nodes via the wireless communication links, and a controller to route communications via the communications device. The controller includes a traffic monitoring unit to monitor traffic communicated between nodes in the network, a traffic information generator to generate traffic information based upon how much traffic is being communicated between various nodes in the network, and a traffic information buffer to store the traffic information in a traffic database.
BRIEF DESCRIPTION OF THE DRAWINGS [0017] FIGS. 1-4 are schematic diagrams of a mobile ad hoc network including QoS routing in accordance with the present invention. [0018] [0018]FIG. 5 is a flowchart illustrating the method steps for QoS routing in a mobile ad hoc network in accordance with the present invention. [0019] [0019]FIG. 6 is a schematic diagram illustrating a router of a node in accordance with the network of the present invention. [0020] [0020]FIG. 7 is a schematic diagram illustrating the details of the controller of the router in FIG. 6. [0021] FIGS. 8-10 are schematic diagrams of a mobile ad hoc network including admission control in accordance with the present invention. [0022] [0022]FIG. 11 is a flowchart illustrating the method steps for admission control in a mobile ad hoc network in accordance with the present invention. [0023] [0023]FIG. 12 is a flowchart illustrating the method steps for policing traffic admission control in a mobile ad hoc network in accordance with the present invention. [0024] [0024]FIG. 13 is a schematic diagram of a mobile ad hoc network including traffic tracking in accordance with the present invention. [0025] [0025]FIG. 14 is a flowchart illustrating the method steps for tracking traffic in a mobile ad hoc network in accordance with the present invention. [0026] FIGS. 15-17 are schematic diagrams of a mobile ad hoc network including dynamic channle allocation in accordance with the present invention. [0027] [0027]FIG. 18 is a flowchart illustrating the method steps for dynamic channel allocation in a mobile ad hoc network in accordance with the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS [0028] The present invention will now be described more fully hereinafter with reference to the accompanying drawings, in which preferred embodiments of the invention are shown. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. Like numbers refer to like elements throughout, and prime notation is used to indicate similar elements in alternative embodiments. [0029] As will be appreciated by those skilled in the art, portions of the present invention may be embodied as a method, data processing system, or computer program product. Accordingly, these portions of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, portions of the present invention may be a computer program product on a computer-usable storage medium having computer readable program code on the medium. Any suitable computer readable medium may be utilized including, but not limited to, static and dynamic storage devices, hard disks, optical storage devices, and magnetic storage devices. [0030] The present invention is described below with reference to flowchart illustrations of methods, systems, and computer program products according to an embodiment of the invention. It will be understood that blocks of the illustrations, and combinations of blocks in the illustrations, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, implement the functions specified in the block or blocks. [0031] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture including instructions which implement the function specified in the flowchart block or blocks. The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. [0032] Referring initially to FIGS. 1-5, a method for determining a route from a source node to a destination node in a mobile ad hoc network 20 will now be described. The network 20 includes a plurality of mobile nodes 30 including the source node 1 and the destination node 4 with intermediate nodes 2, 3 and 5 therebetween. The nodes 30, such as laptop computers, personal digital assistants (PDAs) or mobile phones, are connected by wireless communication links 32 as would be appreciated by the skilled artisan. The method begins (block 100) and includes transmitting a quality-of-service (QoS) route request RREQQ from the source node 1 to discover routing to the destination node 4 based upon a QoS parameter, as indicated at block 102 in FIG. 5. The QoS parameter is preferably based upon available bandwidth, error rate, end-to-end delay, end-to-end delay variation, hop count, expected path durability, and/or priority as will be discussed in further detail below. The route request RREQQ includes a QOS flow identifier and an updatable QoS link metric. [0033] Furthermore, at block 104, the method includes each intermediate node 2, 3 and 5 determining whether the node can support the requested QoS parameter of the QoS route request RREQQ. If the node cannot support the QoS parameter of a particular request RREQQ, then the request is denied or simply not forwarded by the node (block 106). If the node, for example node 3, can support the QoS parameter of a particular request RREQQ, then the node updates the QoS link metric, forwards the QoS route request to other intermediate nodes 2 and 5, and temporarily reserves node resources for that QoS route request (block 108). Intermediate nodes 2 and 5 also must determine whether they can support the requested QoS parameter of the QoS route request RREQQ forwarded from node 3. If so, the route request RREQQ with the updated QoS link metric is then forwarded to the destination node 4. [0034] The destination node 4, upon receiving the QoS route request RREQQ, generates a reply RREPQ to the source node 1 including the flow identifier and updated QoS link metric for each discovered route (block 110). In other words, the destination node 4 may have received the forwarded route request RREQQ from any of various possible routes including, for example, 1-2-4 or 1-3-5-4. A reply RREPQ is generated in each case. At block 112, the source node 1 generates QoS route metrics based upon updated QoS link metrics in replies RREPQ from the destination node 4 for discovered routes. Also, at block 114, the source node 1 then selects a route to the destination node 4 based upon the QoS route metrics, and, at block 116, the source node transmits route confirmations CONFQ to intermediate nodes on the selected route. This is to confirm the use of the resources on the selected route that were temporarily reserved at block 108. Other temporarily reserved resources on discovered but non-selected routes may be permitted to time out by not transmitting CONFQ on those routes. [0035] Also, the source node 1 may select at least one standby route either with or without sending confirmations CONFQ to the intermediate nodes on the standby route (block 122). Such a standby route may be for duplicate transmissions, for additional reliability, or may be used as a backup route in case of route and/or QoS failure. At block 118, the intermediate nodes 2, 3 and 5, and/or the destination node 4, may detect at any time whether the node can continue to support the requested QoS parameter of the QoS route request RREQQ. If the node can continue to support the request RREQQ throughout propagation of the traffic, reserved resources and associated routes may be permitted to time out if determined inactive, at block 126, and be released, block 128, if not used for a period of time either by data traffic or by the sending of periodic CONFQ messages. [0036] If the node cannot continue to support the request RREQQ, then the node generates a QoS error notification RERRQ to the source node 1 (block 120). Here, the source node 1 may maintain the selected route, upon receiving the QoS error notification RERRQ, while again transmitting a quality-of-service (QoS) route request RREQQ to discover a new routing path to the destination node 4 based upon the QoS parameter (block 102). The source node 1 may also switch to the standby route upon receiving the QoS error notification RERRQ (block 124). [0037] The described method can be applied to any type of On-Demand or Reactive routing protocol, such as Dynamic Source Routing (DSR) or Ad-Hoc On-Demand Distance Vector (AODV) routing, or to any hybrid proactive/reactive protocol, such as Zone Routing Protocol (ZRP), as would be appreciated by the skilled artisan. [0038] A more specific example considering minimum bandwidth allocation and a maximum delay constraint as categories of QoS will now be described. For a fixed bandwidth allocation it is assumed that a node 30 is able to reserve a certain amount of capacity or bandwidth. Again, source node 1 of a traffic flow will send the QoS Route Request RREQQ for each required flow (the last Q in the notation indicates a QoS request). The RREQQ message performs the function of discovering a route that can support the required QoS. Nodes that forward the RREQQ to the destination 4 will note if they can meet the requested QoS before passing on the RREQQ and they will temporarily reserve resources if needed. A Route Reply RREPQ packet is returned from the destination with an indication that the requested QoS can be met over that path. The source node 1 may then collect multiple potential paths to the destination 4 before deciding upon the best choice to provide the desired QoS. Once this path is determined, a Confirm CONFQ message is sent to the destination 4 along the indicated path. Along the way on this path any temporary resource reservations are confirmed to be permanent reservations. QoS reservations are timed out if not used for a specified period of time. If a link fails along the route or if the QoS requirement cannot be met, a Route Error (RERRQ) packet is generated and returned to the source node. [0039] More specifically, when a new QoS route is needed to a given destination node 4, the source node 1 broadcasts a RREQQ packet to the destination node. This is a special type of packet similar to the conventional RREQ packet used in a protocol such as DSR or AODV. The conventional RREQ broadcast is used for “best effort” service. The method of the present invention may still follow the conventional procedures established by the protocol for best effort service. [0040] If a specified minimum capacity or bandwidth is required for a traffic flow, the special RREQQ packet is used to reserve a flow at a specified capacity to the destination 4. In this case, a flow ID is assigned to the RREQQ by the source node 1 which combined with the source node address uniquely identifies the flow to any node in the network 20 that is forwarding the flow. The RREQQ packet also indicates the capacity that is to be reserved. [0041] At each node 2, 3 and 5 in the path to the destination 4, the minimum capacity or bandwidth requirement is checked against available capacity to determine if a reservation can be made for the flow. If the node can accommodate the required traffic flow, then the capacity is temporarily reserved for that flow ID. This temporary reservation is released if a CONFQ message is not received within a short period of time. If the RREQQ is meant to insure that a path can be found that does not exceed a specified maximum delay, then each node along the path must be able to estimate its contribution to the total path delay and check to see if the total delay along the path so far plus its contribution exceeds the specified maximum delay bound. [0042] Unlike conventional application of DSR and AODV for “best effort” traffic, the RREQQ must be allowed to propagate all the way to the destination node 4 to determine if a valid path exists that satisfies the QoS requirement. If such a path is found, then the destination node 4 generates a RREPQ message to be returned to the source node 1. This message indicates to the source node that a valid path has been found to the destination node 4 that satisfies the requested QoS and a route has been established (in the case of DSR a source route is returned). Estimated path delay is included in the RREPQ for a request seeking a delay guarantee as well as for a path guaranteeing capacity. [0043] The source node 1 may receive multiple RREPQ for paths to the destination node 4 that can meet the required QoS. It will rank order these and send out a CONFQ message indicating its selection of a path on the highest ranked path. The other paths may be kept as backup paths, but if the CONFQ is not sent on these paths, there is no guarantee that the required resources will be available if needed as a backup alternate path. [0044] If at any intermediate node 2, 3 and 5 or the destination node 4, the requested QoS is violated and cannot be satisfied, then the RREQQ packet is discarded knowing that the path through this node cannot satisfy the requested QoS. However, other paths may be found by the discovery process. If at any time a link fails along the route or if the QoS requirement cannot be met, a Route Error RERRQ packet is generated and returned to the source node 1 for each traffic flow affected by the failure. In this case either a backup path must be used or the route discovery process is initiated again. [0045] The described procedures are easily applied to the DSR protocol. The conventional DSR message types RREQ, RREP, RRER are defined as optional packet types, and can be used as defined for the conventional operation of the protocol to support “best effort” traffic in a backwards compatibility mode. New optional packet types are defined to support QoS including the RREQQ, RREPQ, RRERQ, and CONFQ packet types to be used for managing QoS paths. Definition of the required header fields for these types is straightforward based on the functions defined above. A special type of QoS source routed packet for QoS mission data would also be included. This packet would include the flow ID to identify which flow the packet belonged and to allow for metering of flow traffic. [0046] The following procedures would be used if a failure causes a node to issue a RERRQ packet. If a RERRQ packet is received at the source node, then the current route is discarded and a backup route is tried. The first packet sent on the backup route will be another type of special QoS source routed packet, the RREQT, that includes the flow ID and the QoS parameters. This packet could also include mission data. Each node along the path will have to check to see if they are still maintaining a temporary reservation for the flow. If not they will recheck to see if they can support the flow and make a temporary reservation. If the packet reaches the destination with the flow supported at each intermediate node, then the destination node will return a RREPQ packet notifying the source that the path is valid. [0047] If any node cannot support the flow, then the packet is discarded and the node returns a RERRQ packet to the source node notifying it that the path cannot support the requested QoS parameters. If the source node receives a RREPQ packet, then it sends a CONFQ message along the selected path confirming the choice of path in addition to continuing to send the mission data for that traffic flow. [0048] If the source node receives a RERRQ packet, then it tries the same procedure on the next available backup path. If the source node has no more backup source routes to the destination, the source node begins another route discovery process for a new QoS path to the destination node. Mission data flow is interrupted until a new route is found. For any specific protocol, the data structures required to manage the resources allocated to each traffic flow can be defined, and how to identify the flows and how to look up the routes assigned to each flow can also be defined. [0049] Referring now additionally to FIGS. 6 and 7, a system aspect of the invention will be described. A mobile ad hoc network 20 includes a plurality of mobile nodes 30, and a plurality of wireless communication links 32 connecting the plurality of mobile nodes together. Each mobile node includes a router 40 (FIG. 6) that has a communications device 42 to wirelessly and uni-directionally or bi-directionally communicate with other nodes via the wireless communication links 32, and a controller 44 to route communications via the communications device 42. Also, a memory 46 may be included as part of the controller 44 or in connection with the controller. [0050] As shown in FIG. 7, the controller 44 includes a route discovery unit 50 to transmit the quality-of-service (QoS) route requests to other nodes to discover routing to a destination node based upon at least one QoS parameter. Again, the route request includes a flow identifier and a QoS link metric. Also, a route request processing unit 52 determines whether the node can support a requested QoS parameter of a QoS route request and to update the QoS link metric, and a temporary resource reservation table 54 contains temporary node resource reservations for QoS route requests having supportable QoS parameters. Furthermore, a route metric formation unit 56 generates QoS route metrics based upon updated QoS link metrics in replies from nodes with node resource reservations, and a route selection unit 58 selects a route to the destination node based upon the QoS route metrics and to transmit route confirmations to nodes on a selected route. [0051] The route selection unit 58 may select a standby route, such as for backup or duplicate transmissions, with or without sending confirmations CONFQ to the nodes on the standby route. The route request processing unit 52 detects whether the node can continue to support the requested QoS parameter of the QoS route request and, if not, generates the QoS error notification RERRQ. The route selection unit 58 preferably maintains the selected route, upon receiving a QoS error notification from another node, while the route discovery unit 50 transmits another quality-of-service (QoS) route request RREQQ to discover new routing to the destination node based upon the QoS parameter. The route selection unit 58 may switch to the standby route upon receiving the QoS error notification RERRQ from another node. [0052] Another embodiment of the present invention provides traffic admission control for multihop routes in the mobile ad hoc network 22 while maintaining the quality of service needed, and will be described with reference to FIGS. 8-11. Such an admission control method will adaptively allow a node to keep some resources for its own traffic, while sharing fairly in the forwarding of other's traffic. Again, the ad-hoc network is made up of a plurality of wireless mobile nodes 30 and a plurality of wireless communication links 32 connecting the plurality of nodes together. [0053] The method for controlling traffic admission in the mobile ad hoc network 22 begins (block 200) and includes a source node transmitting quality-of-service (QoS) route requests RREQQ to discover traffic routing based upon a QoS parameter (block 202). At block 208, each node 30 in the network 22 calculates a node QoS tag value to make traffic admission control decisions. The node QoS tag value is a function of at least one node specific QoS metric. The QoS parameter may be based upon, for example, bandwidth, error rate, end-to-end delay, end-to-end delay variation, hop count, expected path durability, and/or priority, while the node specific QoS metric may include one or more of available power, available bandwidth by the node, recent error rate, recent delay, available bandwidth by other nodes within a range, and node queue size, for example. The QoS tag value may be a weighted sum of each term, or a vector with each term as an element. [0054] Each node 30 determines admission based upon the calculated QoS tag value and the QoS parameter of QoS route requests RREQQ, and may reply to the source node, regarding whether traffic will be admitted in response to the QoS route requests (block 214). Furthermore, each node 30 may calculate route and connectivity information associated with the node (block 210), and transmit the route and connectivity information and the QoS tag value to other nodes for traffic route selection (block 212). [0055] Calculating the node QoS tag value 208 may include querying other nodes within a range for information regarding at least one QoS metric (block 204), and processing the QoS metric information received from the other nodes and the at least one node specific QoS metric to calculate the node QoS tag value. Calculating the node QoS tag value may further comprise verifying that each other node within the range has replied with QoS metric information (block 206). [0056] More specifically, most of the QoS metric terms such as available power, available bandwidth by the node, recent error rate, recent delay, and node queue size, are known locally to the node. However, available bandwidth by other nodes within a range, for example, is not known locally. Thus, referring to FIG. 8, if node 1 issues a request to node 4 for 5 Mbps of an 11 Mbps transmission medium, node 4 must check to see if any other nodes in range (here nodes 1, 3 and 5) have already made prohibitive commitments. So, node 4 broadcasts a CHECK message and any nodes within range that have committed bandwidth will send a CHECK REPLY back indicating such. Node 4 makes sure that it has heard a CHECK REPLY from all nodes that it has heard from lately. With the received information, node 4 can now make a decision on whether it can support the QoS parameter of the route request RREQQ. [0057] Replying to QoS route requests (block 214) may comprise indicating what traffic routing the node can support based upon the node QoS tag value, when the node cannot support the QoS parameter of the route request. For example, if node 4 cannot commit to the request, it may issue a reply that describes the most that it can support. Accordingly, the source can decide whether the level is good enough or whether to scale back the request and issue a relaxed QoS request RREQQ. [0058] As discussed, conventional approaches provide full disclosure regarding routes and connectivity. In other words, each node 30 shares all that it knows with others, so that “best” (usually fewest hops) routes are selected overall. In this invention, this route and connectivity information is tagged with a value that allows other nodes to use it based on the Quality of Service needed. Additionally, the node sharing the information can decide on the level of QoS that will be allowed to use that information. This decision can be based on a common set of rules, or per node since some nodes will be advantaged. For example, a node that finds itself forwarding many packets, whose battery is running out, and is having trouble finding bandwidth for its own traffic may advertise his routes and connectivity to certain other nodes with a tag that disallows all but the most important (high priority) packets. [0059] A system aspect of this embodiment of the present invention is directed to the mobile ad hoc network 22 including the plurality of mobile nodes 30, and the plurality of wireless communication links 32 connecting the plurality of mobile nodes together. As described earlier with reference to FIGS. 6 and 7, each mobile node has a router 40 that includes the communications device 42 to wirelessly and unidirectionally or bi-directionally communicate with other via the wireless communication links, and a controller 44 to route communications via the communications device. The controller 44 includes a route discovery unit 50 to transmit quality-of-service (QoS) route requests to other nodes to discover routing to a destination node based upon at least one QoS parameter. Here, a QoS tag calculation unit 60 calculates the node QoS tag value to make traffic admission control decisions. A traffic admission controller 62 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. [0060] The controller 44 may also include a connectivity calculator 64 to calculate route and connectivity information associated with the node, which may be transmitted to other nodes for traffic route selection. The QoS tag calculation unit 60 may query other nodes within a range for information regarding at least one QoS metric, and process the QoS metric information received from the other nodes and the at least one node specific QoS metric to calculate the node QoS tag value. Also, the QoS tag calculation unit 60 may verify that each other node within the range has replied with QoS metric information. [0061] Furthermore, the route request processing unit 52 replies to QoS route requests to indicate whether the node can support the QoS parameter of the route request and admit the traffic. Also, the route request processing unit 52 may indicate what traffic routing the node can support based upon the node QoS tag value, when the node cannot support the QoS parameter of the route request. [0062] Another embodiment of the present invention provides traffic policing for multihop routes in a mobile ad hoc network 22, and will be described with reference to FIG. 12. as previously described, the network 22 includes the plurality of wireless mobile nodes 30 and the plurality of wireless communication links 32 connecting the plurality of nodes together. The method begins at block 300 and includes nodes transmitting quality-of-service (QoS) route requests RREQQ to discover traffic routing based upon a QoS parameter (block 302) as described in the other embodiments. Here, the QoS route requests RREQQ include at least the traffic flow identifier. At block 304, 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 (block 306). Also, at block 308, 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. However, in this embodiment, 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 RREQQ (block 310). [0063] Again, the QoS parameter may be based upon available bandwidth, error rate, end-to-end delay, end-to-end delay variation, hop count, expected path durability, and/or priority, for example, while the node specific QoS tag value may be a function of at least one of available power, available bandwidth by the node, recent error rate, recent delay, available bandwidth by other nodes within a range, and node queue size, for example. In other words, if a request RREQQ includes a requirement for certain amount of bandwidth, for example, and the node admits the traffic associated with the request, then the node polices itself to ensure that the admitted traffic does not exceed the requested bandwidth. [0064] The method preferably includes each node preventing propagation of traffic that exceeds the QoS parameter of the QoS route request (block 312). This step may include buffering traffic that exceeds the QoS parameter of the QoS route request, and propagating buffered traffic at the QoS parameter of the QoS route request. Alternatively, each node may propagate buffered traffic when required resources become available, or simply discard traffic that exceeds the QoS parameter of the QoS route request. Furthermore, as described in the other embodiments, replying to QoS route requests may comprise indicating what traffic routing the node can support based upon the node QoS tag value, when the node cannot support the QoS parameter of the route request. [0065] Referring again to FIG. 7, the controller 44 includes a traffic policing unit 84 to police the admitted traffic based upon the traffic flow identifier to ensure that admitted traffic does not exceed the QoS parameter of the QoS route request. Also, the traffic policing unit 84 preferably includes an excess traffic buffer 86 for storing the excess traffic. [0066] More specifically, the traffic flow ID is used in route tables and in the QoS packets (both control and data). As discussed, this provides an identifier for performing admission control. The source node that has obtained a reservation for a path of a certain capacity, for example, to the destination node can use the flow ID and meter the traffic to perform policing of the traffic. This guarantees that it never admits more than agreed upon capacity for that flow ID. In addition, each node in the path to the destination can perform policing against the allocated capacity. Of course criteria other than the available capacity could be used as a criteria for deciding whether to support a given flow request. For example, a node running low on battery power may not want to support a given traffic flow. Then in this case, the RREQQ message can be ignored thereby disallowing use of the node as a forwarding node for the requested traffic flow. [0067] Another embodiment of the present invention provides traffic tracking for multihop routes in a mobile ad hoc network, and will be described with reference to FIGS. 13 and 14. As shown in FIG. 13, the network 24 again includes a plurality of wireless mobile nodes 30 and a plurality of wireless communication links 32 connecting the plurality of nodes together. The method begins at block 400 (FIG. 14) and includes each node monitoring traffic communicated between nodes 30 in the network 24 (block 402). Each node 30 generates traffic information based upon how much traffic is being communicated between various nodes in the network 24 (block 404), and each node stores the traffic information locally in a buffer as a traffic database (block 406). [0068] In the method, the traffic information is preferably based upon bandwidth and may include error rate, end-to-end delay, end-to-end delay variation, hop count, expected path durability, and/or priority. The traffic database may comprise a 1-hop traffic matrix. In other words, the database for a specific node 1 would include traffic information for each link 32 between nodes 2-8 in the network. In FIG. 13, node 1 needs a traffic route A to node 6. Here, if nodes 7 and 8 are sending large amounts of traffic, but nodes 1-6 are not, it would be better to route traffic through 1-2-3-4-5-6 rather than 1-7-8-6 even though it would result in more hops. [0069] The method may be advantageous to routing protocol selection, protocol parameter optimization, and route selection. A traffic matrix is shown in the example below. For a 7 node network, each element in the matrix denotes how much traffic, if any, is being sent from the source node on that row to the destination node on that column. Here, the traffic is quantified in terms bandwidth over some interval (recent bandwidth used may be weighted more), and may include packet loss rate, delay, etc. If the traffic matrix is sparsely populated (lots of zero or near zero bandwidth entries), a reactive routing protocol would be more advantageous, since routes are not constantly updated that will not be used anyway. Conversely, a dense traffic matrix would indicate lots of interaction between nodes 30 and a proactive or hybrid protocol may provide benefits. Accordingly, the method may include each node selecting a route discovery protocol, such as a reactive, proactive or hybrid protocol, based upon the stored traffic information and (block 412). Destination Source 1 2 3 4 5 6 7 1 N/A 1 0 0 0 1 300 Mbps Mbps kbps 2 0 N/A 10 0 0 0 kbps 3 0 0 N/A 0 0 10 0 kbps 4 10 kbps 0 0 N/A 0 1 0 Mbps 5 0 300 10 N/A 0 0 kbps kbps 6 0 0 1 0 0 N/A 10 Mbps kbps 7 300 0 300 0 0 0 N/A kbps kbps [0070] Nodes know what traffic they are sending, receiving and forwarding. To know traffic they are not directly involved with, they can monitor or be explicitly sent messages containing traffic data. Routing protocols such as DSR that collect route information promiscuously (by hearing other nodes' requests RREQ and replies RREP, or by observing the source route in data packets) could be adapted to build much of the traffic matrix. Link-state routing protocols, such as optimized link state routing (OLSR), already share route information, and could be extended to share traffic matrix information, since each node knows what it sends to whom, and at what quality. Also, a protocol could set timers according to expected delays through a sequence of hops, based upon the traffic matrix bandwidths, since it will know what delays to expect due to traffic congestion. This may reduce or eliminate unnecessary timeouts from occurring. [0071] Furthermore, at block 408, each node 30 may generate traffic destination information based upon how many destinations each of various nodes communicates with in the network 24, and store (block 410) the traffic destination information in a destination quantity database. Thus, each node 30 may also discover and select traffic routes based upon the stored traffic destination information. In other words, the destination quantity database would reveal the number of destinations that each of the particular nodes is communicating with. [0072] Referring again to FIG. 7, the controller 44 of a router 40 in a network 24 in accordance with this embodiment, includes a traffic monitoring unit 70 to monitor traffic communicated between nodes 30 in the network. A traffic information generator 76 generates traffic information based upon how much traffic is being communicated between various nodes in the network, and a traffic information buffer 78 stores the traffic information in a traffic database. [0073] The traffic monitoring unit 70 may broadcast a traffic activity query, and processes replies to the traffic activity query. Alternatively, the traffic monitoring unit 70 may passively monitor the traffic between nodes 30 in the network 24. The route discovery unit 50 discovers routing to a destination node based upon the stored traffic information, and the route selection unit 58 selects traffic routes to the destination node based upon the stored traffic information. Also, the route discovery unit 50 may process the traffic information stored in the traffic database to select one of a reactive, proactive and hybrid route discovery process, and discovers traffic routes with the selected route discovery process. Each traffic route comprises a combination of wireless communication links 32. [0074] A traffic destination information generator 72 generates traffic destination information based upon how many destinations each of various nodes 30 communicates with in the network 24, and a destination information buffer 74 stores the traffic destination information in a destination quantity database. The route discovery unit 50 may also discover routing to a destination node based upon the stored traffic destination information, and the route selection unit 58 may select traffic routes to the destination node based upon the stored traffic destination information. [0075] Another embodiment of the present invention provides dynamic channel allocation in the mobile ad hoc network to efficiently make use of a plurality of channels. A method for dynamic channel allocation will be described while referring to FIGS. 15-18. Here, the network 26 includes a plurality of wireless mobile nodes 30 and a plurality of wireless communication links 32 connecting the plurality of nodes together over a plurality of channels. IEEE 802.11 spinoffs like 802.11a will make use of the ISM spectrum in the 5 GHz band. In this band, there is more bandwidth available to support many channels. As a result, a process to automatically assign a channel to an 802.11 node would be important. Such a channel decision would be based on current channel utilization and sampling of the other channels. Using dynamic channel selection would provide better performance since the spectrum would be used evenly. Additionally, channel use could be throttled such that QoS is maintained for current stations using the channel. [0076] The method begins at block 500 (FIG. 18) and includes each node 30 monitoring link performance on a first channel. Link performance is based upon a quality of service (QoS) threshold, such as bandwidth, error rate, end-to-end delay, end-to-end delay variation, hop count, expected path durability, and priority, for example. At block 504) each node scouts one or more other available channels when the monitored link performance on the first channel falls below the QoS threshold, for example, minimum bandwidth or maximum delay. Scouting may include periodically monitoring other channels for link performance. [0077] Scouting may comprise switching to a second channel (block 512), broadcasting a channel activity query to determine the link performance for the second channel (block 516), and processing replies to the channel activity query to determine the link performance for the second channel at block 518. Furthermore, each node 30 may switch back to the first channel and broadcast a channel change message if the link performance on the second channel is above the QoS threshold (block 506), or switch to subsequent channels and broadcast channel activity queries to determine the link performance for the those channels if the link performance on the previous channel is below the QoS threshold (block 504). [0078] Alternatively, scouting may comprise switching to another channel (block 512), and passively monitoring the link performance for the second channel at block 514. Again, each node 30 may switch back to the first channel and broadcast a channel change message if the link performance on the second channel is above the QoS threshold (block 506), or switch to subsequent channels and passively monitor the link performance for those channels if the link performance on the previous channel is below the QoS threshold (block 504). Also, each node 30 may store link performance information of each of the plurality of channels (block 508) and/or store channel information for neighboring nodes at block 510. In other words, each node 30 may keep track of what channel other nodes are using. [0079] For example, as shown in FIGS. 15-17, the network 26 includes nodes 30 and links 32. Nodes 1A-5A are currently using a first channel, while nodes 1B-5B are currently using a second channel. Node 2B determines that the link performance for the second channel is falling or has fallen below a QoS threshold, such as below a minimum bandwidth. Node 2B switches to the first channel and broadcasts a channel activity query CAQ to nodes within 1-hop of node 2B (FIG. 16). Nodes 1A, 2A and 3A send channel activity replies CAR to node 2B with information on the link performance of the first channel (FIG. 17). If the bandwidth on the first channel is acceptable to node 2B, it will return to the second channel and broadcast a channel change message to inform any nodes 1B, 3B, 4B and 5B that it is changing to the first channel. These nodes would then note where node 2B can be found for future reference. If the bandwidth is not acceptable, node 2B will move to a third channel and repeat the steps. If all channels have been visited and node 2B has not found bandwidth above the QoS threshold, then it will select the best one, and may periodically search for a better channel. [0080] A system aspect of this embodiment of the present invention is directed to the mobile ad hoc network 26 having a plurality of mobile nodes 30, and a plurality of wireless communication links 32 connecting the plurality of mobile nodes together over a plurality of channels. Referring to FIGS. 6 and 7, each mobile node comprises a router 40 having a communications device 42 to wirelessly and unidirectionally or bi-directionally communicate with other nodes via the wireless communication links 32, and a controller 40 to route communications via the communications device. The controller 40 includes a link performance monitor 80 to monitor link performance on a first channel. A channel scouting unit 82 scouts one or more other available channels when the monitored link performance on the first channel falls below the QoS threshold. [0081] The channel scouting unit 82 switches to a second channel, broadcasts a channel activity query to determine the link performance for the second channel, and processes replies to the channel activity query to determine the link performance for the second channel. Also, the channel scouting unit 82 switches back to the first channel and broadcasts a channel change message if the link performance on the second channel is above the QoS threshold, or switches to subsequent channels and broadcasts channel activity queries to determine the link performance for those channels if the link performance on the previous channel is below the QoS threshold. Alternatively, the channel scouting unit 82 may switch to another channel and passively monitor the link performance for the second channel. A link performance information memory 66 stores the link performance information of each of the plurality of channels, and a channel information memory 68 stores channel information for neighboring nodes. [0082] The disclosures of related applications entitled “ADMISSION CONTROL IN A MOBILE AD HOC NETWORK” (atty. Docket No. 51259); “TRAFFIC POLICING IN A MOBILE AD HOC NETWORK” (atty. Docket No. 51263); “DETERMINING QUALITY OF SERVICE (QoS) ROUTING FOR MOBILE AD HOC NETWORKS” (atty. Docket No. 51264); and “ALLOCATING CHANNELS IN A MOBILE AD HOC NETWORK” (atty. Docket No. 51261) to the same assignee and concurrently filed herewith are incorporated by reference herein in their entirety. [0083] Many modifications and other embodiments of the invention will come to the mind of one skilled in the art having the benefit of the teachings presented in the foregoing descriptions and the associated drawings. Therefore, it is understood that the invention is not to be limited to the specific embodiments disclosed, and that modifications and embodiments are intended to be included within the scope of the appended claims. Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS33556 *Oct 22, 1861Alfred BImprovement in sewing-machinesUS5031093 *Mar 27, 1990Jul 9, 1991Nec CorporationSystem for establishing route by selecting minimum of time-independent link parameters of incremental valuesUS5233604 *Apr 28, 1992Aug 3, 1993International Business Machines CorporationMethods and apparatus for optimum path selection in packet transmission networksUS5412654 *Jan 10, 1994May 2, 1995International Business Machines CorporationHighly dynamic destination-sequenced destination vector routing for mobile computersUS5450408 *Sep 30, 1991Sep 12, 1995Hewlett-Packard CompanyMethod of ascertaining topology features of a networkUS5530963 *Dec 16, 1993Jun 25, 1996International Business Machines CorporationMethod and system for maintaining routing between mobile workstations and selected network workstation using routing table within each router device in the networkUS5778360 *Apr 25, 1997Jul 7, 1998Fujitsu LimitedMethod and apparatus for encoding and decoding a data unit whose structure is defined by a description conforming to abstract syntax according to a prescribed encoding ruleUS5987011 *Aug 30, 1996Nov 16, 1999Chai-Keong TohRouting method for Ad-Hoc mobile networksUS6046992 *Apr 24, 1998Apr 4, 2000Intermec Ip Corp.Radio frequency local area networkUS6130881 *Apr 20, 1998Oct 10, 2000Sarnoff CorporationTraffic routing in small wireless data networksUS6301244 *Dec 11, 1998Oct 9, 2001Nortel Networks LimitedQoS-oriented one-to-all route selection method for communication networksUS6304556 *Aug 24, 1998Oct 16, 2001Cornell Research Foundation, Inc.Routing and mobility management protocols for ad-hoc networksUS6304913 *Nov 9, 1998Oct 16, 2001Telefonaktiebolaget L M Ericsson (Publ)Internet system and method for selecting a closest server from a plurality of alternative serversUS6385174 *Nov 6, 2000May 7, 2002Itt Manufacturing Enterprises, Inc.Method and apparatus for transmission of node link status messages throughout a network with reduced communication protocol overhead trafficUS6678252 *Oct 28, 1999Jan 13, 2004Verizon Laboratories Inc.Method and apparatus for dynamic source routing in ad hoc wireless networksUS6754192 *Apr 29, 2002Jun 22, 2004Harris CorporationTemporal transition network protocol (TTNP) in a mobile ad hoc networkUS6954435 *Apr 29, 2002Oct 11, 2005Harris CorporationDetermining quality of service (QoS) routing for mobile ad hoc networksUS7007102 *Apr 29, 2002Feb 28, 2006Harris CorporationAdmission control in a mobile ad hoc networkUS7061895 *Sep 7, 2001Jun 13, 2006Koninklijke Philips Electronics N.V.Reconfiguration of an ad hoc networkUS7068600 *Apr 29, 2002Jun 27, 2006Harris CorporationTraffic policing in a mobile ad hoc networkUS7616961 *Apr 29, 2002Nov 10, 2009Harris CorporationAllocating channels in a mobile ad hoc networkUS20010010717 *Jan 31, 2001Aug 2, 2001Kenta GotoTraffic data collection techniqueUS20030005162 *Oct 24, 2001Jan 2, 2003Joerg HabethaNetwork comprising a plurality of sub-networks for determining bridge terminalsUS20030067941 *Oct 9, 2001Apr 10, 2003Fall Thomas C.Precedence-based routing/re-routingUS20030079003 *Oct 18, 2001Apr 24, 2003Intel CorporationMethod for discovery and routing using a priori knowledge in the form of application programme within mobile AD-HOC networksUS20030139187 *Jan 18, 2002Jul 24, 2003Microsoft CorporationFramework and method for Qos-aware resource discovery in mobile ad hoc networksUS20030202468 *Jun 19, 2002Oct 30, 2003Harris CorporationMobile ad-hoc network and methods for performing functions therein based upon weighted quality of service metricsUS20030202476 *Apr 29, 2002Oct 30, 2003Harris CorporationDetermining quality of service (QoS) routing for mobile AD HOC networksUS20030204616 *Apr 29, 2002Oct 30, 2003Harris CorporationAdmission control in a mobile ad hoc networkUS20040203820 *Apr 29, 2002Oct 14, 2004Harris CorporationAllocating channels in a mobile ad hoc networkUS20050128944 *Jan 27, 2005Jun 16, 2005Microsoft CorporationFramework and method for QoS-aware resource discovery in mobile ad hoc networksUS20050129000 *Dec 28, 2001Jun 16, 2005T.V.L.N SivakumarRouting method for mobile ad-hoc network* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7269147Oct 12, 2004Sep 11, 2007Samsung Electronics Co., Ltd.Relaying broadcast packet in a mobile Ad-hoc network including flushing buffer if broadcast count number exceed buffer sizeUS7277960 *Jul 25, 2003Oct 2, 2007Hewlett-Packard Development Company, L.P.Incorporating constraints and preferences for determining placement of distributed application onto distributed resource infrastructureUS7496366 *Dec 19, 2005Feb 24, 2009Motorola, Inc.Wireless communication system capacity control facilitation method and apparatusUS7512074Nov 12, 2004Mar 31, 2009Motorola, Inc.System and method to scout for routes in a wireless networkUS7656886Feb 2, 2010Chin-Tau LeaNon-blocking internet backbone networkUS7773569Aug 10, 2010Meshnetworks, Inc.System and method for efficiently routing data packets and managing channel access and bandwidth in wireless multi-hopping networksUS7898957Nov 2, 2006Mar 1, 2011The Hong Kong University Of Science And TechnologyNon-blocking destination-based routing networksUS7908075 *Nov 14, 2006Mar 15, 2011Nec (China) Co., Ltd.Traffic information query system and traffic information query methodUS8036224Dec 23, 2003Oct 11, 2011Telefonaktiebolaget Lm Ericsson (Publ)Method and system for efficient routing in Ad Hoc networksUS8036597Oct 11, 2011Interdigital Technology CorporationMethod and apparatus for determining a level of involvement of mesh points in a wireless communication systemUS8077713 *Dec 13, 2011Cisco Technology, Inc.Dynamic update of a multicast treeUS8085672 *Jul 8, 2005Dec 27, 2011Honeywell International Inc.Wireless routing implementationUS8218550 *Dec 23, 2003Jul 10, 2012Telefonaktiebolaget Lm Ericsson (Publ)Method and system for routing traffic in ad hoc networksUS8243603 *Aug 14, 2012Motorola Solutions, Inc.Method and system for improving a wireless communication routeUS8462691Mar 28, 2008Jun 11, 2013British Telecommunications PlcAd hoc communication systemUS8553560Dec 23, 2003Oct 8, 2013Telefonaktiebolaget Lm Ericsson (Publ)Predictive ad-hoc network routingUS8565218 *Oct 31, 2008Oct 22, 2013Hewlett-Packard Development Company, L.P.Flow path discovery in network to guarantee multiple metric QoS constraintsUS8929388Mar 6, 2013Jan 6, 2015Qualcomm IncorporatedSystems and methods for resource allocation serving communication requirements and fairnessUS9167463 *Sep 4, 2012Oct 20, 2015Telcordia Technologies, Inc.Communication node operable to estimate faults in an ad hoc network and method of performing the sameUS9191330 *Nov 14, 2013Nov 17, 2015International Business Machines CorporationPath selection for network service requestsUS9246796 *Aug 30, 2012Jan 26, 2016Metaswitch Networks LtdTransmitting and forwarding dataUS9401876 *Apr 29, 2009Jul 26, 2016Cray Uk LimitedMethod of data delivery across a network fabric in a router or Ethernet bridgeUS20050033844 *Jul 25, 2003Feb 10, 2005Artur AndrzejakIncorporating constraints and preferences for determining placement of distributed application onto distributed resource infrastructureUS20050180356 *Dec 10, 2002Aug 18, 2005Graviton, Inc.Multi-channel wireless broadcast protocol for a self-organizing networkUS20060015607 *Sep 4, 2003Jan 19, 2006Pierpaolo FavaProcedure and system for the analysis and the evaluation of the conditions for accessing data communication networks, and relative computer program productUS20060126524 *May 7, 2004Jun 15, 2006Tateson Jane EAd hoc communications systemUS20060171344 *Jul 8, 2005Aug 3, 2006Honeywell International Inc.Wireless routing implementationUS20060176809 *Oct 3, 2005Aug 10, 2006Hong Kong University Of Science And TechnologyNon-blocking internet backbone networkUS20060176863 *Aug 13, 2004Aug 10, 2006David RobinsonHierarchical routing in ad-hoc networksUS20060248385 *Mar 29, 2006Nov 2, 2006Interdigital Technology CorporationMethod and apparatus for determining a level of involvement of mesh points in a wireless communication systemUS20060262737 *Mar 7, 2006Nov 23, 2006Interdigital Technology CorporationQoS management in wireless mesh networksUS20060268792 *May 19, 2005Nov 30, 2006Meshnetworks, Inc.System and method for efficiently routing data packets and managing channel access and bandwidth in wireless multi-hopping networksUS20070076615 *Nov 2, 2006Apr 5, 2007The Hong Kong University Of Science And TechnologyNon-Blocking Destination-Based Routing NetworksUS20070118564 *Nov 14, 2006May 24, 2007Nec (China) Co., Ltd.Traffic information query system and traffic information query methodUS20070127379 *Dec 7, 2005Jun 7, 2007Hrishikesh GossainMethod and system for improving a wireless communication routeUS20070142056 *Dec 19, 2005Jun 21, 2007Harris John MWireless communication system capacity control facilitation method and apparatusUS20070263628 *Dec 23, 2003Nov 15, 2007Leif AxelssonMethod and System for Efficient Routing in Ad Hoc NetworksUS20080037477 *Dec 23, 2003Feb 14, 2008Leif AxelssonMethod And System For Routing Traffic In Ad Hoc NetworksUS20080159209 *Jan 3, 2007Jul 3, 2008Motorola, Inc.Method and system for allocating channels in a wireless networkUS20090067348 *Sep 11, 2007Mar 12, 2009Cisco Technology, IncDynamic update of a multicast treeUS20090080393 *Feb 13, 2007Mar 26, 2009Yukihiro TakataniWireless data communication systemUS20100128653 *Mar 28, 2008May 27, 2010British Telecommunications Pulbic LimitedAd hoc communication systemUS20100278069 *Oct 31, 2008Nov 4, 2010Puneet SharmaFlow Path Discovery In Network To Guarantee Multiple Metric QoS ConstraintsUS20110170553 *Apr 29, 2009Jul 14, 2011Jon BeecroftMethod of data delivery across a network fabric in a router or ethernet bridgeUS20130232277 *Aug 30, 2012Sep 5, 2013Metaswitch Networks Ltd.Transmitting and Forwarding DataUS20140298020 *Oct 12, 2012Oct 2, 2014Sony CorporationReception device and method, program, and information processing systemUS20140355454 *Sep 4, 2012Dec 4, 2014Telcordia Technologies, Inc.Communication Node Operable to Estimate Faults in an Ad Hoc Network and Method of Performing the SameUS20150134799 *Nov 14, 2013May 14, 2015International Business Machines CorporationPath selection for network service requestsEP1986379A1 *Feb 13, 2007Oct 29, 2008Hitachi, Ltd.Wireless data communication systemEP2787700A1 *Jul 15, 2010Oct 8, 2014Qualcomm IncorporatedSystems and methods for providing resource allocation meeting communication constraints for multi-hop network data flowsWO2005062552A1 *Dec 23, 2003Jul 7, 2005Telefonaktiebolaget Lm Ericsson (Publ)Predictive ad-hocWO2006097177A1Feb 21, 2006Sep 21, 2006Eastman Kodak CompanyMethod and equipment for data transmission by ad-hoc networkWO2006124221A2 *Apr 27, 2006Nov 23, 2006Meshnetworks, Inc.System and method for efficiently routing data packets and managing channel access and bandwidth in wireless multi-hopping networksWO2014088402A1 *Dec 3, 2013Jun 12, 2014Mimos Bhd.A system and method for routing in a network* Cited by examinerClassifications U.S. Classification709/224, 709/238International ClassificationH04B7/24, H04L12/56, H04L12/28, H04L12/26, H04B7/26Cooperative ClassificationH04L47/11, H04W24/00, H04L43/087, H04W40/28, H04L45/22, H04L43/0823, H04L45/302, H04L45/26, H04L45/28, H04L43/0852, H04L47/20, H04W84/18, H04L45/70, H04W40/02, H04L47/10, H04L47/14, H04L43/0811, H04L45/38European ClassificationH04L45/38, H04L45/22, H04L47/10, H04L45/26, H04L47/14, H04L47/11, H04L45/302, H04L43/08F, H04L45/70, H04L45/28, H04L43/08E, H04L47/20, H04W24/00, H04W40/28Legal EventsDateCodeEventDescriptionApr 29, 2002ASAssignmentOwner name: HARRIS CORPORATION, FLORIDAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BILLHARTZ, TOM;REEL/FRAME:012861/0344Effective date: 20020408RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services

value: This website is a search engine provided by Google. Handling over 3.5 billion searches per day, it has a 92% share of the global search engine market.


text:
Search Food Service Worker Jobs, Careers in Anderson, IN | Indeed.com
Food Service Worker jobs in Anderson, IN
Boar's Head (7)
Herdrich Petroleum (5)
ExecSEARCH by Hire Well Now (3)
We have 10 openings for a full-time FOOD SERVICE WORKER position. Prior food service and/or cooking experience is a plus!...
ADMIN. ASST-HRLY (FULL TIME) - ANDERSON UNIVERSITY - NOW HIR...
Responsible for clerical functions and administrative support of food service programs. Prior Admin support of a University / Food Svc Department a plus....
View all Compass Group jobs in Anderson, IN - Anderson jobsSalary Search: Administrative Assistant salaries in Anderson, INLearn more about working at Compass GroupCompass Group questions about work, benefits, interviews and hiring process:If you were to leave Compass Group, what would be the reason?How are the working hours?Related forums: Anderson, Indiana - Compass Group
FOOD SERVICE RELATED DUTIES:. Maintain food service area and equipment in clean and sanitary conditions. Prepare and serve all food products with established...
View all Herdrich Petroleum jobs in Daleville, IN - Daleville jobsSalary Search: Food Service Associate salaries in Daleville, INRelated forums: Daleville, Indiana - Herdrich Petroleum
View all Ultra Steak Inc. jobs in Anderson, IN - Anderson jobsSalary Search: Kitchen Worker salaries in Anderson, INRelated forums: Anderson, Indiana - Kitchen Worker
Beach Bound Group
$10,000 - $27,000 a year
Work making Food Box Lunches from 8am to 4pm. Work on Food Truck from 10am to 2pm, Or 4pm to 8pm. Need to have experience in working in a restaurant....
View all Beach Bound Group jobs in Indianapolis, IN - Indianapolis jobsSalary Search: Food Service Worker salaries in Indianapolis, INRelated forums: Food Service Worker - Indianapolis, Indiana - Beach Bound Group
Performs cashiering duties, including general food service work. We have 3 openings for a full-time FOOD SERVICE WORKER/CASHIER position....
View all Compass Group jobs in Muncie, IN - Muncie jobsSalary Search: Food Service Worker salaries in Muncie, INLearn more about working at Compass GroupCompass Group questions about work, benefits, interviews and hiring process:If you were to leave Compass Group, what would be the reason?How are the working hours?Related forums: Muncie, Indiana - Compass Group
View all Compass Group jobs in Elwood, IN - Elwood jobsSalary Search: Food Service Worker salaries in Elwood, INLearn more about working at Compass GroupCompass Group questions about work, benefits, interviews and hiring process:If you were to leave Compass Group, what would be the reason?How are the working hours?Related forums: Elwood, Indiana - Food Service Worker - Compass Group
View all Compass Group jobs in Anderson, IN - Anderson jobsSalary Search: Senior Food Service Worker salaries in Anderson, INLearn more about working at Compass GroupCompass Group questions about work, benefits, interviews and hiring process:If you were to leave Compass Group, what would be the reason?How are the working hours?Related forums: Anderson, Indiana - Food Service Worker - Compass Group
FOOD SERVICE, COMMISSARY (FULL-TIME) 2 openings Job
Prior food service experience is a plus! We have 2 openings for a full-time FOOD SERVICE, COMMISSARY position. Completes food production records....
View all Compass Group jobs in Muncie, IN - Muncie jobsSalary Search: Senior Food Service Worker salaries in Muncie, INLearn more about working at Compass GroupCompass Group questions about work, benefits, interviews and hiring process:If you were to leave Compass Group, what would be the reason?How are the working hours?Related forums: Muncie, Indiana - Compass Group
Culinary / Dietary Aide - Full Time Eve - Bridgewater
Warehouse Workers perform a wide range of warehouse functions. Don’t wait, you can be the next Warehouse Worker to join our team....
Be the first to see new Food Service Worker jobs in Anderson, IN

type: global

value: This website is an American worldwide employment website for job listings launched in November 2004. It is a subsidiary of Japan's Recruit Co.


text:
Auditing that matters by Norman D Marks, Paperback | Barnes & Noble® B&N Top 100 NY Times Bestsellers
by Norman D MarksNorman D Marks
Auditing that matters provides practical advice from an experienced chief audit executive (CAE) who is considered one of the most influential global thought leaders in the internal audit profession.
- Providing the assurance, advice, and insight that the leaders of the organization need
- Focusing on the risks and issues that matter to the executive management team and the board
- Practicing enterprise risk-based auditing
- Communicating effectively to management and the board what they need to know, when they need to know, in a useful and actionable form
- Building the team and processes to deliver world-class internal audit services
The book has been acclaimed by prominent leaders in the profession from around the world.
• This is a timely book for internal auditors who want to accelerate their careers. Norman provides powerful career advice and lessons learned for delivering outstanding customer service in a profession where the performance bar is rising daily as are stakeholder expectations.
I would make it a must read for my team members.
-	Larry Harrington, CAE at Raytheon and former Chairman of the Board of the IIA
• "For auditors looking for a book on "Value-added auditing"; this is the edition for you! Norman's clearly describes the how-to methods for auditing that matters, and this is a must read book for all auditing leaders!
-	Steve Goepfert, retired CAE of United Airlines and former Chairman of the Board of the IIA
• Norman has pulled clear, insightful and useful recommendations from his years of experience leading top notch internal audit programs. This book will prove valuable for new and experienced internal audit professionals.
-	Patty Miller, retired Deloitte partner and former Chairman of the Board of the Institute of Internal Auditors (IIA)
• This book is packed with lessons for the internal auditor. A first class opportunity to learn from the experience of others.
-	Michael Parkinson, Audit Committee member and member of the IIA's International Internal Auditing Standards Board
• This is the best book on the real world of internal auditing that I have read, because it gives numerous examples of practical problems and how best to approach and resolve them. Norman has captured his many years of executive audit experience into an easy to read and highly informative addition to the education of the next generation of internal auditors.
-	John Fraser, retired CAE and CRO with Hydro One
• Whenever I felt that I was making progress in this profession it was because of other Internal Audit professionals embracing fully our profession's motto "progress through sharing" and being generous with their experience, know-how and lessons learned from failures and successes. Norman's book is a wonderful act of generosity with multiple experiences and ideas shared in thoughtful way for us all to reflect upon and build our own progress.
-	Dominique Vincenti, CAE at Nordstrom, formerly Chief Officer - Global Internal Audit Practices with the IIA
• Internal Audit, as explained by one of the world's leading practitioners, reminds us all of the central importance and function that proper governance plays in a well-run organisation.
-	Tom McLeod, former CAE at Rio Tinto Group and member of the Board of the IIA (Australia)
book by norman c register ph.d
book by albert norman
book by norman l goss
A wonderful compilation of unique, compelling and engaging monologues specifically for women. Powerful points of ...
A wonderful compilation of unique, compelling and engaging monologues specifically for women. Powerful points of view combine with interesting characters to make these monologues explode with life. This is the 'secret weapon' material that Meisner trained actors and actesses have ...
Let's Trail The Normans
From their original homeland of Scandinavia, the Northmen or Normans in the 9th century swept ...
From their original homeland of Scandinavia, the Northmen or Normans in the 9th century swept down into northern France and then into England, Ireland, Sicily and southern Italy. They were a potent and conquering force wherever they settled. In Let's ...
Murder and Single Malt
Mike and his car appear to match a description given to police from a recent ...
Mike and his car appear to match a description given to police from a recent crime scene. The murder of two young women. He's taken into custody for further questioning. The worst possible outcome for a sloppy serial killer.Alcohol and ...
Operation Overlord, first published in 1952, is a detailed account of the strategy, planning and ...
Operation Overlord, first published in 1952, is a detailed account of the strategy, planning and execution of the massive campaign to free western Europe from the Nazis in World War II. The first phase of the operation was code-named Neptune ...

value: This website is an American bookseller. It is a Fortune 1000 company and the bookseller with the largest number of retail outlets in the United States.


text:
BBC Sport - Kent victory leaves Leicestershire bottom
 BBC Sport Home Page Cricket All Sport All Sport Home Football Formula 1 Cricket Rugby U Rugby L Tennis Golf Athletics BBC Sport Home Football Formula 1 Cricket Rugby Union Rugby League Tennis Golf Athletics A-Z Sports Athletics Boxing Cricket Cycling Disability Sport Football Formula 1 Gaelic Games Golf Horse Racing Motorsport Olympic Sports Rugby League Rugby Union Snooker Swimming Tennis Winter Sports Full Sports A-Z Events Glasgow 2014 World Cup 2014 Around the UK England Scotland Wales Northern Ireland Programmes Match of the Day 5 Live Sport Sport on the BBC Get Inspired All Programmes Cricket Counties Results Fixtures Tables Averages Live Scores All Teams Results Fixtures Tables Averages Counties Home More from Cricket Live Scores All Teams Cricket Home 1 June 2011
Kent victory leaves Leicestershire bottom
LV County Championship Division Two, Tunbridge Wells
Kent 459 & 157-5 beat Leicestershire 251 & 362 by five wickets
Kent 24pts, Leicestershire 3 pts
Kent sealed a five-wicket win at Tunbridge Wells to move from the foot of County Championship Division Two and leave Leicestershire bottom.
Joe Denly (74) and Sam Northeast (62) shared a second-wicket stand of 135 to help the hosts to their target of 155.
Claude Henderson (4-61) ensured a late wobble, but Martin var Jaarsveld (16 not out) saw Kent home.
Earlier, Henderson (38) and Jigar Naik (32) took their stand to 92 before the visitors were bowled out for 362.
Kent batsman Joe Denly told BBC Radio Kent:
"It's nice to finally spend some serious time in the middle and try and make up for my lack of runs from earlier in the season.
"I had a bit of luck early in my first innings when I was scratching around for runs, but at the end of the game I feel like I'm in pretty good nick.
"I always look forward to coming to Tunbridge Wells, the Nevill's a lovely ground, the crowds are always good and we always have great cricketing wickets.
"I'm looking forward to the Twenty 20 games now, to playing shots and expressing myself."
Kent close on victory over Leics	31 May 2011
Tredwell spins Kent into position	30 May 2011
Kent on top as Denly hits century	29 May 2011
BBC Sport on your mobile	External siteEngland and Wales Cricket Board	External siteWatch daily County Championship highlights on ECB website	External siteKent	External siteLeicestershire	More from Sport & Cricket
Live Ulster v Toulon

value: This website is the BBC's online service. It is a large network of websites including such high-profile sites as BBC News and Sport, the on-demand video and radio services co-branded BBC iPlayer, the children's sites CBBC and CBeebies, and learning services such as Bitesize.


text:
Gertrude M McGarity (1887-1971) - Find A Grave Memorial
Gertrude M McGarity
148960244 · View Source
Find A Grave Memorial 148960244
Find A Grave, database and images (https://www.findagrave.com : accessed ), memorial page for Gertrude M McGarity (1887–1971), Find A Grave Memorial no. 148960244, citing Mount Hope Catholic Cemetery, Toronto, Toronto Municipality, Ontario, Canada ; Maintained by Islington (contributor 47351667) .
Add Photos for Gertrude M McGarity
Fulfill Photo Request for Gertrude M McGarity
your computer for Gertrude M McGarity memorial.
I thought you might like to see a memorial for Gertrude M McGarity I found on Findagrave.com.

value: This website is a website that allows the public to search and add to an online database of cemetery records. It is owned by Ancestry.com.


text: Clothing > Refine Price $ to $ Go Top brands Danskin Now Faded Glory Hanes No Boundaries Disney Frozen George Shopkins American Hawk Store availability Sort Best sellers Price: low to high Price: high to low Highest rating New $58.91 Microsoft Carrying Case (Messenger) for 17" Notebook - Black, Gray SAM39001 Sold & Shipped by Shoplet Free shipping In stores only Hard Candy Clamshell Sunglasses Case, Lace Print In stores only Hard Candy Clamshell Sunglasses Case, Dot Print In stores only Hard Candy Made You Look Clamshell Sunglasses Case, Aqua Stripes 1 Showing 4 of 4 results Departments Bags & Accessories Shipping & Pickup Show all Ship to Home Category Cases Brand Danskin Now Faded Glory Hanes No Boundaries Disney Frozen George Shopkins American Hawk Paw Patrol Avia Superman Star Wars Fruit of the Loom Monster High Teenage Mutant Ninja Turtles Tsum Tsum CTM Starter Op Eye Candy See more brands Retailer Walmart.com Shoplet See more retailers Price $ to $ Go $0 - $5 $5 - $10 $10 - $15 $15 - $20 $20+ Popular in Clothing Men's Long-sleeve Shirts Black Dresses White Dresses Men's Fruit Of the Loom Toddler Underwear Casual Dress Shirts Women's Sweatshirts Women's Shirts Compute- app-4983975-2-77778958, DC- prod-dfw1, ENV- prod-a, Ver- 47.0.0, SHA- 330b6d8b7fe1b5e8da2ce298fce537e03580ccc1, Log- 62f4e9e3-262bf-1575df70953000 Site Information Be the first to save! Email Address Sign up Privacy Policy Stay connected Mobile apps Help Feedback MoneyCenter Privacy & Security CA Privacy Rights Terms of Use Walmart services See All Services Walmart MoneyCenter Walmart Credit Card Product Care Plans Walmart Pay Get to know us About Walmart.com Corporate Suppliers Marketplace Careers @WalmartLabs Walmart.com Terms of Use About Our Ads Affiliate Program CA Privacy Rights Privacy & Security Customer service Returns Policy Product Recalls Int’l Customers Tax Exempt Program Contact Us Feedback Store Pickup In the spotlight Expand Baby Cribs Strollers Diapers Baby Feeding Car Seats Expand Electronics Cut the Cable Computers TVs iPads & Tablets Expand Fitness Exercise Machines Vitamins Ellipticals Treadmills Fitbit Expand Keep Cool Air Conditioners Fans Swimming Pools Pool Toys Popular Products Expand International Sites Argentina Brazil Canada Chile China Japan Mexico United Kingdom © Walmart Stores, Inc. To ensure we’re able to help you as best we can, please include your reference number: Ref:

value: This website is an American multinational retail corporation that operates a chain of hypermarkets , discount department stores, and grocery stores from the United States, headquartered in Bentonville, Arkansas.


text:
10 Best Casinos in Branson, MO for 2020 | Expedia
Casinos in Branson Casinos in Branson
Browse for Branson Casinos from $69
TonightJul 12 - Jul 13Check prices in Branson for tonight, Jul 12 - Jul 13
Tomorrow nightJul 13 - Jul 14Check prices in Branson for tomorrow night, Jul 13 - Jul 14
"Very friendly staff and clean room brand new pool"…""Very friendly staff and clean room brand new pool"WWW…"
Casinos and More in Branson
Branson isn't widely known for its casinos, but you'll find lots more to do here. Tourists speak highly of the entertainment venues, theaters, and shopping. You might want to visit top attractions like Veterans Memorial Museum and Dolly Parton's Stampede Dinner Attraction. When thinking about a place to stay, you can pick from 911 lodging choices in Branson.
If you're searching for hotels and other properties that get good reviews for their proximity to local casinos, you can try your luck at this option:
Lodge At the Falls - At this motel, you can enjoy free breakfast, an outdoor pool, and free WiFi. Customers have good things to say about this property's family-friendly amenities and overall value.
Planning Your Trip to Branson
When you're vacationing, weather can be a bit of a wildcard, so we've rounded up these temperature and rainfall averages to help you choose the best time to visit.
Sightseeing In and Around Branson
Branson is known for its entertainment venues, museums, and theaters, and you can check out cultural spots such as Veterans Memorial Museum and Hollywood Wax Museum. Some attractions to visit in the area are Silver Dollar City and Fritz's Adventure. Additionally, you might want to add Dolly Parton's Stampede Dinner Attraction and Titanic Museum to your itinerary.
Branson is also known for its:
You can fly into the nearest airport in Branson, MO (BKG), 8 mi (12.8 km) from the city center. If you'd like to venture out around the area, consider renting a car to take in more sights.
Searching for casino hotels in Branson?
Tourists speak highly of the entertainment venues, live music scene, and beautiful lakeside setting. You might want to visit top attractions like Branson Landing and Sight and Sound Theatres.
What's the best accommodation to visit the local casinos in Branson?
Lodge At the Falls is a property featuring free breakfast and free WiFi, and it’s a top choice near the casinos.
How many hotels that are good for gaming will I be able to find in Branson?
Practice your poker face at one of Expedia’s 2189 casino hotels in Branson.
What is there to do in Branson?
You can head to Branson Landing, Tanger Outlets, or The Shoppes at Branson Meadows to shop for the perfect souvenir. Branson is known for its entertainment venues, museums, and live music, and you can check out cultural spots such as Dolly Parton’s Stampede Dinner Attraction and The Mansion. In addition, you might want to add Sight and Sound Theatres and Titanic Museum to your list.
What's the best way to get around Branson?
You can fly into the nearest airport, which is Springfield-Branson National Airport (SGF), located 42.3 mi (68.1 km) away. If you’d like to explore around the area, you may want to rent a car for your trip.
Branson Waterpark HotelsEcono Lodge Inn & Suites Shepherd of the Hills ExpyBig Cedar LodgeResidence Inn by Marriott BransonCastle Rock Resort & WaterparkStormy Point Village ResortClarion HotelClosest Resort to Silver Dollar City - Outstanding Views and Deck!Amazing Walk-in Villa, Sleeps 10, Near Silver Dollar City, Close to ShowsCliffs Resort Table Rock LakeLodges at Timber Ridge By Welk ResortsBranson Nightly CondosHoliday Inn Club Vacations Holiday Hills ResortRoark Vacation ResortSurrey's Carriage PlaceCabins At Grand Mountain By Thousand Hills ResortMarriott's Willow Ridge LodgeThe Lodges at Table Rock Lake by Capital VacationsWorldMark BransonPalace View Resort by Spinnaker ResortsOzark Mountain ResortThe Branson HotelGrand Crowne ResortTable Rock Resorts at Indian PointBluegreen Vacations Paradise Point, Ascend Resort CollectionBranson 5 Star Star HotelsBranson's Best MotelBranson Hotels with Connecting RoomsAngel Inn by the StripThousand Hills Golf Resort
9ab304f1-8932-4bcd-8e03-350a4e3b7ea193da3891-3879-42a9-b972-7a0b32d4fe4500000000-0000-0000-eb34-e07f4d882bfe

value: This website is an online travel agency owned by Expedia Group, an American online travel shopping company based in Seattle.