Abstract: A method and system for propagating mutual authentication data in both a first wireless communication network and a second wireless communication network is useful for unifying wireless communication networks. The method includes mutually authenticating a first node operating in the first network and a second node operating in the second network (step 205). A unification message is then transmitted from the first node to a third node operating in the second network, where the unification message indicates that the first node is authenticated with the second network (step 210). In response to the unification message, authentication messages from the third node and the second node are then relayed through the first node, for mutually authenticating the third node and the second node (step 215).

Abstract: A method and system for communicating incident scene information between wireless devices in an ad hoc network is useful for providing an updated source of incident scene information. The method comprises providing an Incident Scene Services Database (ISSD) in a first wireless device (step 305). An update of the ISSD comprising a service advertisement from a second wireless device is then received at the first wireless device (step 315). An indication is then provided at the first wireless device of availability of a service described in the service advertisement received from the second wireless device (step 320).

Abstract: Techniques are provided which can allow a host to determine whether to send a DNS request via a distributed Domain Name Service (DNS) protocol or a regular DNS protocol.

Abstract: Techniques are provided which can allow a host to determine whether to send a DNS request via a distributed Domain Name Service (DNS) protocol or a regular DNS protocol.

Abstract: Techniques are provided for selecting a root node in an ad hoc network comprising a plurality of nodes including a first node. According to one implementation of these techniques, a first node can receive a message from at least one of the other nodes. Each message includes a number of primary factors associated with a particular node regarding capabilities of the particular node. The primary factors associated with each node can then be evaluated, and an attempt can be made to select the root node based on the primary factors associated with each node. If the first node is unable to select the root node based on the primary factors associated with each node, then the root node can be selected based on secondary factors associated with each node.

Abstract: Techniques are provided for selecting a root node in an ad hoc network comprising a plurality of nodes including a first node. According to one implementation of these techniques, a first node can receive a message from at least one of the other nodes. Each message includes a number of primary factors associated with a particular node regarding capabilities of the particular node. The primary factors associated with each node can then be evaluated, and an attempt can be made to select the root node based on the primary factors associated with each node. If the first node is unable to select the root node based on the primary factors associated with each node, then the root node can be selected based on secondary factors associated with each node.

Abstract: Techniques are provided for selecting a root node in an ad hoc network comprising a plurality of nodes including a first node. According to one implementation of these techniques, a first node can receive a message from at least one of the other nodes. Each message includes a number of primary factors associated with a particular node regarding capabilities of the particular node. The primary factors associated with each node can then be evaluated, and an attempt can be made to select the root node based on the primary factors associated with each node. If the first node is unable to select the root node based on the primary factors associated with each node, then the root node can be selected based on secondary factors associated with each node.

Abstract: Method and apparatus for packet scheduling in a wireless network is described. First values for a data transmission rate are measured for each of a plurality of mobile stations over time. Second values for a function of the data transmission rate are computed using at least one of the first values for each of the mobile stations. A rate of change of the data transmission rate is computed for each of the plurality of mobile stations using the second values associated therewith. A stability of the data transmission rate is computed for each of the plurality of mobile stations using the second values associated therewith. A channel quality factor is determined for each of the mobile stations using a current value of the second values, the rate of change of the function, and the stability of the function associated therewith.

Abstract: A system for facilitating bandwidth management in a routing domain (100), the system including: a domain bandwidth manager (116); and a plurality of area bandwidth managers (118, 120, 122, 124, 126, 128) coupled to the domain bandwidth manager and arranged in accordance with an OSPF hierarchical routing topology with the domain bandwidth manager at an upper level of the topology and each area bandwidth manager located in a different area of the routing topology in at least one lower level of the topology, wherein the domain bandwidth manager and the plurality of area bandwidth managers cooperatively coordinate admission control to a routing domain for facilitating a communication session between a source device and a destination device.

Abstract: Disclosed is a method for reliable multicasting. The method comprises receiving a multicast packet, sending a first acknowledgement for having received the multicast packet, and receiving a second acknowledgement in response to having sent the first acknowledgement.

Abstract: A method and system for data transmission by computational devices in a wireless network (100) are disclosed. A computational device (102) organizes the wireless network in a hierarchical topology having at least one root node and updates a list of interferers and a list of descendents. Then, the computational device allocates a Contention Free Period (CFP) slot to each computational device in the wireless network based on at least one of the list of interferers and the list of descendents and transmits data during the allocated CFP slot.

Abstract: A system and methods for providing a supplicant access to a communications network are disclosed. An authenticator receives an authentication request at an authenticator (210) from the supplicant. A state is created based on the authentication request at the authenticator (210). The authentication request is relayed towards a prime authenticator (215) where the prime authenticator is connected to an authentication server. Finally, the authenticator (215) receives authentication information from the prime authenticator and fulfills the authentication request using the authentication information.

Abstract: A self-learning geographically aware handoff method and system is disclosed. The system includes a handoff manager (108), which receives information about a position and movement of the mobile nodes (102a, 102b, 102c and 102d) present in the mobile network (100). The handoff manager learns the coverage capabilities of the access points (104a, 104b, 104c and 104d) in the mobile network. It then determines a second access point, to which a mobile node will handoff to, based on the learned coverage capabilities. The handoff manager then informs the mobile node about the second access point.

Abstract: Distributed DNS in a wireless communication network comprising broadcasting by a first node a request message to a second node is disclosed. The request message comprises a hostname of the second node. The first node forwards the request message to the second node through intermediate nodes in the wireless communication network and the second node transmits a response message to the first node. The response message comprises a MAC address of the second node.

Abstract: A method and system for managing bandwidth by a server in an IP network is disclosed. The method and system creates data structures of network topology information. The method and system receives requests from a first client to communicate with a second client and identifies a set of links to be traversed in the communication by utilizing the network topology information to build an end to end path for the communication. Further, the method and system determine whether each link of the identified set of links has sufficient bandwidth for the end to end path and if there is enough bandwidth, then allocating the bandwidth to allow the first client to communicate with the second client.