Abstract: A method and system for peer to peer wide area network communication is provided. A peer in the network receives one or more media and one or more associated control signaling from any one of a plurality of Logical Media/Control Channels, wherein each Logical Media/Control Channel is associated with a Transport Resource on a base station; formats the media into a Formatted Media Packet; formats the control signaling into an Internet Peer to Peer Control Signaling; concatenates the Formatted Media with the Internet-Peer to Peer Control Signaling to form a Concatenated Packet comprising an Internet-Peer to Peer Control Signaling and a Media Packet; duplicates the Concatenated Packet, thereby forming a duplicated Concatenated Packet comprising at least one of a unicast packet and a multicast packet; and transmits the duplicated Concatenated Packets via the wide area network.

Abstract: In a network comprising a source, a destination, and intermediate nodes along a route between the source and the destination, techniques are provided for allocating one or more time slots to transmit a particular data stream along the route based on the QoS requirements to transmit the particular data stream. In one implementation, a Scout Request message (SRM) is sent from the source to the destination to allocate time slots along the route to transmit a particular data stream to the destination. The SRM can include QoS requirements to transmit the particular data stream. Each intermediate node along the route can allocate one or more time slots to transmit the particular data stream based on the QoS requirements needed to transmit the particular data stream along the route.

Abstract: Techniques and technologies are provided for managing establishment, maintenance and removal of security associations (SAs) between nodes in an ad hoc network, such as a wireless mesh network.

Abstract: A multi-hop wireless network includes an originator node, a proxy node, and at least one other node. The originator node generates a data packet and transmits the data packet to the proxy node. The proxy node receives and forwards to the at least one other node the data packet including an originator node address and a proxy node sequence number for an end-to-end groupcast sequence number.

Abstract: A terminal for operation within an ad-hoc, peer-to-peer radio system wherein the system includes a series of radio terminals forming a service group. The terminal having a transceiver for communicating with terminals in the same service group, computer means, and memory for storing program software. Within the system, the terminal establishes a connection with one radio terminal based on time-division access; initiating an outgoing call from the radio terminal including registering with another radio terminal for serving as a node in the call connection by transmitting a registration request; and initially transmitting said registration request on a last time slot (TS) of a respective time frame (TF), said last time slot serving as a configuration channel.

Abstract: Techniques and technologies are provided for dynamically selecting one of a default channel bandwidth and an alternate channel bandwidth for transmitting information over a wireless communication link which couples a transmitter node to a receiver node. The transmitter node and the receiver node are designed to transmit and receive at the default channel bandwidth and at the alternate channel bandwidth.

Abstract: A system and method for performing continuous accounting on a mobile node within a wireless ad-hoc network, using a sparse matrix method for compaction of the accounting data when forwarding data to a core network. The system and method perform continuous accounting of network traffic on a mobile node, and collected data is periodically transmitted in summary report form to a core network when accessible. During periods when the core network is inaccessible, collected data is maintained for subsequent transmission to the core network once access is re-established.

Abstract: A range equalization transceiver system (100) for increasing efficiency of a continuous duty communications link includes a first transceiver (105) for transmitting data traffic over a broadband traffic channel and a second transceiver (107) for determining routing information using a discovery channel based on link quality. A controller (103) is used for interpreting routing information from the second transceiver (107) where the controller (103) selects a transmitting scheme based on data traffic conditions on both the broadband traffic channel and link quality channel for sending data over a wireless network.

Abstract: A method for updating at a bridge node a virtual local area network (VLAN) status of a first node in a mesh network as provided enables improved network connectivity. The method includes processing a first VLAN status message that associates a first VLAN identifier with the first node, wherein the first VLAN status message was generated in response to a first bind request (BREQ) message. A second VLAN status message is then transmitted, wherein the second VLAN status message associates the first VLAN identifier with the first node. A third VLAN status message that associates a second VLAN identifier with the first node is then processed, wherein the third VLAN status message was generated in response to a second bind request (BREQ) message that associated the second VLAN identifier with the first node, and whereby the VLAN status of the first node is updated.

Abstract: A system and method of security authentication and key management scheme in a multi-hop wireless network is provided herein with a hop-by-hop security model. The scheme adapts the 802.11r key hierarchy into the meshed AP network. In this approach, a top key holder (R0KH) derives and holds the top Pairwise Master Key (PMK—0) for each supplicant wireless device after the authentication process. All authenticator AP take the level one key holder (R1KH) role and receive the next level Pairwise Master Key (PMK—1) from R0KH. The link level data protection key is derived from PMK—1 via the 802.11i 4-way handshaking.

Abstract: A method for merging of ad hoc network partitions within an ad hoc network, the method includes forming a plurality of network partitions by forming a security association among each of a group of partitioned nodes. Each network partition includes a Network Identifier. A node operating within one of the network partitions receives an update message from another node, compares its current Network Identifier to the received Network Identifier; and determines whether to update to the received Network Identifier using an arbitration method when the received Network Identifier is different from the current Network Identifier.

Abstract: An ad hoc network includes a first node, a second node, and a third node. The first node and second node share a first shared secret key, and the first node and third node share a second shared secret key. The second node and third node share a temporal key. The first node generates a unique key, encrypts the unique key with a first shared secret key to generate a first encrypted unique key and transmits the first encrypted unique key to the second node. The first node encrypts the unique key with a second shared secret key to generate a second encrypted unique key and transmits the second encrypted unique key to the third node. To establish the temporal key, the second node decrypts the first encrypted unique key and the third node decrypts the second encrypted unique key thereby each generating the unique key.

Abstract: Techniques are provided for detecting an increase in congestion in a distributed ad hoc network architecture and transitioning from the distributed ad hoc network architecture to a cluster ad hoc network architecture when a sufficient increase in congestion is detected based on one or more congestion level indicator values (CLIVs). Other techniques are provided for detecting a decrease in congestion in cluster ad hoc network architecture and transitioning from the cluster ad hoc network architecture to a distributed ad hoc network architecture when a sufficient decrease in congestion is detected based on one or more congestion level indicator values (CLIVs).

Abstract: A method for calculating service redundancy of a wireless network is provided. The method comprises determining one or more of a plurality of routes through which a node can communicate to reach a destination. A routing metric is calculated for each of the plurality of routes. Using the calculated routing metrics a route having a best routing metric is identified as a best route to the destination. Service redundancy for each node within the wireless network is calculated using a sum of weighted ratios of the best routing metric to at least one alternate routing metric.

Abstract: The present invention provides a system and method for multihop packet forwarding within a multihop wireless communication network. The method uses a data frame format including at least the four address fields to forward packets in a multihop wireless network. The method includes generating a route request packet at a routable device in response to receiving a packet destined for an unknown destination. The route request packet includes an originating device field including an address of an originating device, wherein the originating device generated the packet originally; and a source field, wherein the source field includes an address of the first routable device which generated the route request packet.

Abstract: A method for routing data packets from a source to a destination in a wireless communication network comprising a plurality of nodes, wherein each node is in uplink-downlink association with at least one neighboring node, and wherein each node comprises a registration table identifying all downlink nodes that are associated with the node, the method comprising: sending an Open Stream message from a source node which specifies a destination node; and receiving the Open Stream message at the uplink node of the source node, wherein the uplink node relays the Open Stream message to the destination node if the destination node is registered in the registration table of the uplink node.

Abstract: A method and system for positioning a relay in a wide area communication network can enable improved operating efficiency of the network. The method includes processing a plurality of requests, received from a plurality of wireless communication devices, for connections to the network, where each device in the plurality of wireless communication devices can operate using a wide area networking standard and can operate using an ad hoc networking standard (step 305). A location in the network of each device in the plurality of wireless communication devices is then determined (step 310). An operating position for the relay is then determined based on an evaluation of the location in the network of each device in the plurality of wireless communication devices (step 315).

Abstract: A wide area network assisted multimedia content delivery system (200) includes a first wide area network handset (205) and a second wide area network handset (207) having one or more transceivers (208) for exchanging information over the wide band network as well as multimedia information via an ad hoc communication. A wide area base unit (201) is used for communicating with the first wide area network handset (205) and second wide area network handset (207) where a content distribution broker (203) associated with the wide area base unit (201) is used for brokering multimedia content (audio, video and text data) between the first wide area network handset (205) and the second wide area network handset (207). The transceiver (208) operates to exchange multimedia content in an ad hoc communication directly between the first wide area network handset (205) and second wide area network handset (207) when within a predetermined proximity.

Abstract: A novel software architecture protocol stack with embedded routing algorithms under the Internet Protocol (IP) routing layer in order to provide high quality distribution of multimedia (voice, video, and data) services. These routing algorithms may include Logical Link Control, Adaptive Transmission Protocol, Neighbor Discovery, Traffic Control, Ad-Hoc Routing, Flow Processing, Intelligent Access and Admission Control. These routing algorithms when implemented further provide for advantages in speed of service, reliability of service, self-healing in case of catastrophic failure of an infrastructure component, load-balancing and geographic reuse.

Abstract: An antenna arrangement (1000) for use in an RF communication terminal including a plurality of resonators (1003, 1005, 1007, 1009) formed from a plurality of conducting wires (1002, 1004, 1008, 1010, 1012) the resonators being operable to provide radio frequency resonances in at least two different operational frequency bands (VHF, UHF, 700/800 MHz, GPS ranges) the wires being mutually adjacent and at least three of the wires having different lengths, and a plurality of radio frequency feed channels (113, 115, 117, 119) each being operably connected to an associated one of the resonators to deliver an RF signal between that resonator and an associated radio.