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 system and method of resource allocation within a communication system is provided. A communication system comprises a plurality of nodes operating in a first architecture network mode, wherein at least a portion of the plurality of nodes are reconfigured to operate in a second architecture network mode in response to a change in one or more network performance requirements. When the plurality of nodes are operating in a distributed architecture network mode, at least a portion of the plurality of nodes are reconfigured to operate in a clustered architecture network mode in response to an increase in one or more network performance requirements. When the plurality of nodes are operating in a clustered architecture network mode, at least a portion of the plurality of nodes are reconfigured to operate in a distributed architecture network mode in response to a decrease in one or more network performance requirements.

Abstract: An overlay communication system (120) aides determining a route between nodes (101-103) in an underlay communication system (110). In particular, when a first node (102) wishes to discover a route to a second node (103), the first node notifies the overlay communication system, which notifies all nodes in the underlay communication system of the desire. Both the first and the second nodes begin flooding the underlay system simultaneously. When a node in the underlay system hears both the flood messages from the first and the second node, the overlay communication system is notified and stops all flooding. The route information is then provided to the first and the second nodes via the overlay communication system.

Abstract: During route discovery in an ad-hoc communication network, an overlay transceiver (104) determines a plurality of “seed” nodes that lie between the source and the destination node. The seed nodes are notified of the desire to discover a route between the source and the destination node. Once notified, the seed nodes immediately broadcast route discovery messages. All nodes (101) within the underlay communication system (110) periodically listen for route discovery messages. If any node within the underlay communication system (110) receives a route discovery message having the same route identification, route information between the two seeds will be provided to the overlay transceiver (104), giving the overlay communication system a “path” between the seeds. Once the overlay transceiver (104) receives route information between all seeds, it then determines an appropriate route between source and destination devices, and broadcasts this information to the source and the destination devices.

Abstract: Communication nodes, acting as intermediate routers for communication packets transmitted between a source node and a destination node, are provided with different access rights to the fields of the routed communication packets. Routes of intermediate routers between the source node and the destination node are discovered and the identities of intermediate routers on the discovered routes are collected. The aggregate trust levels of the intermediate routers are computed allowing the most trusted route to be selected. Encryption keys are securely distributed to intermediate routers on the most trusted route based on the trust level of the intermediate routers and fields of the communication packets are encrypted with encryption keys corresponding to the assigned trust level. Intermediated nodes are thereby prevented from accessing selected fields of the communication packets.

Abstract: The proposed method and apparatus reduces an amount of power required for nodes to both transmit and receive messages. In particular, broadcast packets are sent in an awake period (ATIM window) if the length of these messages is small. Because these packets do not need acknowledgment or they do not expect immediate reply, they may be broadcast in the ATIM window. Since all nodes are awake during the ATIM window, nodes may receive messages during this period of time which they ordinarily would need to stay awake to receive in the sleep period (post ATIM window).

Abstract: A method and apparatus for synchronizing a node (200) within an ad-hoc communication system (100) is described herein. During operation all nodes periodically broadcast a synchronization beacon for other nodes to utilize for synchronization when a coordinating access point (node) is unavailable. A particular node's synchronization beacon will have an associated “tier” number that is incremented from the tier number of the beacon used to synchronize the particular node. In the absence of an access point, a node that joins the ad-hoc communication system will listen for synchronization beacons transmitted by other nodes. If synchronization beacons are heard, the node will synchronize with a beacon having a lowest tier. The node will then broadcast its own beacon having its tier number incremented from the lowest tier beacon heard.

Abstract: A method and apparatus for synchronizing a node (200) within an ad-hoc communication system (100) is described herein. During operation all nodes periodically broadcast a synchronization beacon for other nodes to utilize for synchronization when a coordinating access point (node) is unavailable. A particular node's synchronization beacon will have an associated “tier” number that is incremented from the tier number of the beacon used to synchronize the particular node. In the absence of an access point, a node that joins the ad-hoc communication system will listen for synchronization beacons transmitted by other nodes. If synchronization beacons are heard, the node will synchronize with a beacon having a lowest tier. The node will then broadcast its own beacon having its tier number incremented from the lowest tier beacon heard.

Abstract: During operation, nodes that receive beacons from a different network will synchronize to the different network when a predetermined condition is met. Synchronization to the differing network will only take place if the node receiving the beacon from a different network does not have access to a fixed network coordinator and the predetermined condition is met. The predetermined condition may comprise such things as a Network ID for the different network being larger than the Network ID for the current network, or alternatively, the size of the different network being larger than a size of the current network.

Abstract: Remote units within a first communication system (121) utilizes frequencies (channels) from a second communication system (120) when placing a call. When a first remote unit (106) wants to call a second remote unit (107) using the channels, the first remote unit sends a base station (103) a list of top N traffic channel blocks from the second communication system along with the identity of the second remote unit. The base station then pages the second remote unit using a signaling channel reserved by second system. The second remote unit responds to the page with its list of best traffic channel blocks/chunks. The base station then picks the best overlap of idle channels from the list received by the remote units, and sends the list to the remote units instructing them use those traffic channels. Once the remote units receive the available channels, they can begin their call.

Abstract: A method and apparatus for channel assignment within an ad-hoc communication system utilizing multiple channels is provided herein. Individual nodes receive and send route-request (RREQ) packets on all channels rather than a single channel. Each route-request packet comprises a first and a second table. The first table comprises a channel state for the link and the second table comprises a channel quality metric for the link. Each node updates the channel state and channel quality tables and forwards them in the RREQ packet as part of the route-discovery process. When channel selection is made, the channel selection is based on the channel state and the channel quality tables.

Abstract: A method (700), and apparatus (100-600) provide for the establishment of a wireless network connection between a remote unit (110) and a wireless network (130) through a communication unit (120) acting as a relay. In one embodiment an ad-hoc connection (101) is established between the remote unit (110) and the communication unit (120). An identifier (119) associated with the remote unit (110) is adopted by the communication unit (120) for the purpose of authenticating the establishment of a wireless network connection (102) with the wireless network (130), such that a session may be established between the remote unit (110) and the wireless network (130).

Abstract: During route discovery in an ad-hoc communication network, an overlay transceiver (104) determines a plurality of “seed” nodes that lie between the source and the destination node. The seed nodes are notified of the desire to discover a route between the source and the destination node. Once notified, the seed nodes immediately broadcast route discovery messages. All nodes (101) within the underlay communication system (110) periodically listen for route discovery messages. If any node within the underlay communication system (110) receives a route discovery message having the same route identification, route information between the two seeds will be provided to the overlay transceiver (104), giving the overlay communication system a “path” between the seeds. Once the overlay transceiver (104) receives route information between all seeds, it then determines an appropriate route between source and destination devices, and broadcasts this information to the source and the destination devices.

Abstract: An overlay communication system (120) aides determining a route between nodes (101-103) in an underlay communication system (110). In particular, when a first node (102) wishes to discover a route to a second node (103), the first node notifies the overlay communication system, which notifies all nodes in the underlay communication system of the desire. Both the first and the second nodes begin flooding the underlay system simultaneously. When a node in the underlay system hears both the flood messages from the first and the second node, the overlay communication system is notified and stops all flooding. The route information is then provided to the first and the second nodes via the overlay communication system.

Abstract: Remote units within a first communication system (121) utilizes frequencies (channels) from a second communication system (120) when placing a call. When a first remote unit (106) wants to call a second remote unit (107) using the channels, the first remote unit sends a base station (103) a list of top N traffic channel blocks from the second communication system along with the identity of the second remote unit. The base station then pages the second remote unit using a signaling channel reserved by second system. The second remote unit responds to the page with its list of best traffic channel blocks/chunks. The base station then picks the best overlap of idle channels from the list received by the remote units, and sends the list to the remote units instructing them use those traffic channels. Once the remote units receive the available channels, they can begin their call.

Abstract: Mitigation of battery consumption will occur by prioritizing those units utilized for relay purposes. The prioritization scheme favors actively transmitting units over inactive units. In yet another embodiment, those units using real-time services are prioritized over active units using non-real time services.

Abstract: A registration from a subscriber is delivered to the cellular network via an ad hoc network. Based on registration information, several return paths are prepared for delivery of a page from the cellular network to the subscriber regardless of the initial or final coverage state of the subscriber and regardless of the final coverage or operational state of its assigned relays.

Abstract: Mitigation of battery consumption will occur by prioritizing those units utilized for relay purposes. The prioritization scheme favors actively transmitting units over inactive units. In yet another embodiment, those units using real-time services are prioritized over active units using non-real time services.

Abstract: The invention provides a method for controlling pilot power within a CDMA system by either conditionally increasing or conditionally decreasing the pilot power of a cell when a transcoder loss per frame of the cell exceeds a threshold value. A cell performance matrix of the cell, and a cluster performance matrix of a cell cluster neighboring the cell are computed when a transcoder loss per frame of the cell exceeds the threshold value. The pilot power is increased when both the cell performance matrix is equal to or greater than the cluster performance matrix and the pilot power is greater than a minimum level. The pilot power is decreased when both the cell performance matrix is less than the cluster performance matrix and the pilot power is less than a maximum level.