Abstract: An inventive method for data delivery in a multi-hop vehicular network with multiple vehicles and intersections is presented. The method comprises, at each source vehicle, initiating packet flow, labeling packets with destination coordinates and a current location, and forwarding the packet flow, and at each intersection, selecting a header vehicle, computing a backlog indicator and listening for broadcasts with a matrix and delay information, updating the matrix in accordance with the backlog indicator if the matrix is present, otherwise initializing the matrix, forwarding the packet flow, and broadcasting the matrix from the header vehicle. In one embodiment, selection of the header vehicle is performed based on random countdown and vehicle ID. The method converges to the optimal (lowest latency) state irrespective of the initial starting point of the network and continues to tend towards the optimal state even as the network conditions alter.

Abstract: A method of automatic calibration in which the simulation adapts itself to more closely resemble the actual network is provided. For a given network architecture and a probabilistic customer usage profile a simulation provides an estimate of key performance metrics. These simulated metrics are compared against actual measurements from the network. To the extent that they do not match within a prescribed tolerance, an iterative adaptive calibration procedure is used to perturb slightly the probabilistic model of network usage.

Abstract: In a telecommunications network in which a mobile handset is capable of communicating in both an IP domain and a non-IP domain, the handoff of an existing communications session between the mobile handset and a fixed user is facilitated by a handoff controller implemented in a service control point. The handoff controller implements different handoff methods depending on the status of the fixed user and the transition of the mobile user. Additionally 802.21 Media Independent Handover Function in conjunction with SIP is used to facilitate handover between IP and Non-IP points in the system.

Abstract: A MOAF algorithm is used to resize cells for balancing capacity. The MOAF algorithm bases its decision on a cell and all other cells which the algorithm decides are sufficiently close in a propagation sense to affect the results. The MOAF algorithm also automatically determines those cells in an area which are most heavily loaded and those cells which are lightly loaded. The MOAF algorithm will only decrease the size of a cell if it determines specific adjacent cells that are willing and able to accept the load, and the MOAF algorithm will increase the size of a cell only if there is a nearby heavily loaded cell that requires the removal of load. Moreover, the MOAF algorithm can be tuned (via the threshold parameter T) to shift the focus of the optimization from avoidance of coverage holes to the avoidance of creation of excessive handover legs.

Abstract: A method for high rate data delivery in a multi-hop vehicular network comprises at each source vehicle, initiating a packet having a flow tag, assigning an identifier of the content and the current location to the flow tag, and forwarding the packet; at each destination vehicle, setting a flow request and broadcasting at the current intersection; further on movement, setting the flow request at the new intersection, and at each intersection, selecting a header vehicle at the intersection, computing backlog and congestion indicators and listening for broadcasts with a matrix and the flow requests at the header vehicle, determining if the matrix is present, updating the matrix in accordance with the backlog and congestion indicators if the matrix is present, initializing the matrix and estimating the delay on the outgoing road segments if the matrix is not present, forwarding the packet flow, and broadcasting the matrix from the header vehicle.

Abstract: A MOAF algorithm is used to resize cells for balancing capacity. The MOAF algorithm bases its decision on a cell and all other cells which the algorithm decides are sufficiently close in a propagation sense to affect the results. The MOAF algorithm also automatically determines those cells in an area which are most heavily loaded and those cells which are lightly loaded. The MOAF algorithm will only decrease the size of a cell if it determines specific adjacent cells that are willing and able to accept the load, and the MOAF algorithm will increase the size of a cell only if there is a nearby heavily loaded cell that requires the removal of load. Moreover, the MOAF algorithm can be tuned (via the threshold parameter T) to shift the focus of the optimization from avoidance of coverage holes to the avoidance of creation of excessive handover legs.

Abstract: A MOAF algorithm is used to resize cells for balancing capacity. The MOAF algorithm bases its decision on a cell and all other cells which the algorithm decides are sufficiently close in a propagation sense to affect the results. The MOAF algorithm also automatically determines those cells in an area which are most heavily loaded and those cells which are lightly loaded. The MOAF algorithm will only decrease the size of a cell if it determines specific adjacent cells that are willing and able to accept the load, and the MOAF algorithm will increase the size of a cell only if there is a nearby heavily loaded cell that requires the removal of load. Moreover, the MOAF algorithm can be tuned (via the threshold parameter T) to shift the focus of the optimization from avoidance of coverage holes to the avoidance of creation of excessive handover legs.

Abstract: A method for distributing a packet to a plurality of moving nodes comprising receiving a packet containing at least a message, a sender identifier, a location of a sender, an identifier for a relay node and distance from the sender and the relay node, determining if a node receiving the packet is the relay node and immediately distributing the packet to a plurality of moving nodes if the receiving node is the relay node. If the receiving node is not the relay node, the method further comprises steps of waiting a set period of time, determining if a packet is received from a different sender containing the same message, within the period of time and distributing the packet to a plurality of moving nodes if a packet containing the same message is not received within the period of time. The distributed packet includes an identifier for a successive relay node.

Abstract: In a telecommunications network in which a mobile handset is capable of communicating in both an IP domain and a non-IP domain, the handoff of an existing communications session between the mobile handset and a fixed user is facilitated by a handoff controller implemented in a service control point. The handoff controller implements different handoff methods depending on the status of the fixed user and the transition of the mobile user. Additionally 802.21 Media Independent Handover Function in conjunction with SIP is used to facilitate handover between IP and Non-IP points in the system.

Abstract: A method for high rate data delivery in a multi-hop vehicular network comprises at each source vehicle, initiating a packet having a flow tag, assigning an identifier of the content and the current location to the flow tag, and forwarding the packet; at each destination vehicle, setting a flow request and broadcasting at the current intersection; further on movement, setting the flow request at the new intersection, and at each intersection, selecting a header vehicle at the intersection, computing backlog and congestion indicators and listening for broadcasts with a matrix and the flow requests at the header vehicle, determining if the matrix is present, updating the matrix in accordance with the backlog and congestion indicators if the matrix is present, initializing the matrix and estimating the delay on the outgoing road segments if the matrix is not present, forwarding the packet flow, and broadcasting the matrix from the header vehicle.

Abstract: In a telecommunications network in which a mobile handset is capable of communicating in both an IP domain and a non-IP domain, the handoff of an existing communications session between the mobile handset and a fixed user is facilitated by a handoff controller implemented in a service control point. The handoff controller implements different handoff methods depending on the status of the fixed user and the transition of the mobile user. Additionally 802.21 Media Independent Handover Function in conjunction with SIP is used to facilitate handover between IP and Non-IP points in the system.

Abstract: An inventive method for data delivery in a multi-hop vehicular network with multiple vehicles and intersections is presented. The method comprises, at each source vehicle, initiating packet flow, labeling packets with destination coordinates and a current location, and forwarding the packet flow, and at each intersection, selecting a header vehicle, computing a backlog indicator and listening for broadcasts with a matrix and delay information, updating the matrix in accordance with the backlog indicator if the matrix is present, otherwise initializing the matrix, forwarding the packet flow, and broadcasting the matrix from the header vehicle. In one embodiment, selection of the header vehicle is performed based on random countdown and vehicle ID. The method converges to the optimal (lowest latency) state irrespective of the initial starting point of the network and continues to tend towards the optimal state even as the network conditions alter.

Abstract: A method for distributing a packet to a plurality of moving nodes comprising receiving a packet containing at least a message, a sender identifier, a location of a sender, an identifier for a relay node and distance from the sender and the relay node, determining if a node receiving the packet is the relay node and immediately distributing the packet to a plurality of moving nodes if the receiving node is the relay node. If the receiving node is not the relay node, the method further comprises steps of waiting a set period of time, determining if a packet is received from a different sender containing the same message, within the period of time and distributing the packet to a plurality of moving nodes if a packet containing the same message is not received within the period of time. The distributed packet includes an identifier for a successive relay node.

Abstract: Performance optimization of mobile wireless communication networks is complex and typically requires extensive offline modeling and simulation prior to deploying changes that may have unforeseen adverse effects on the live customer network. It is necessary to calibrate the simulation model against the actual network at a level of fidelity such that the engineer is confident that the simulation's response to network changes accurately reflects the results that would be experienced if those changes were deployed in an actual live network. This process is typically quite time consuming and requires significant case-by-case insight into the workings of the actual network as well as the simulation model. We have invented a method of automatic calibration in which the simulation adapts itself to more closely resemble the actual network. For a given network architecture and a probabilistic customer usage profile a simulation provides an estimate of key performance metrics.

Abstract: In a telecommunications network in which a mobile handset is capable of communicating in both an IP-domain and a non-IP domain, the handoff of an existing communications session between the mobile handset and a fixed user is facilitated by a handoff controller implemented in a service control point. The handoff controller implements different handoff methods depending on the status of the fixed user and the transition of the mobile user. Additionally 802.21 Media Independent Handover Function in conjunction with SIP is used to facilitate handover between IP and Non-IP points in the system.

Abstract: A MOAF algorithm is used to resize cells for balancing capacity. The MOAF algorithm bases its decision on a cell and all other cells which the algorithm decides are sufficiently close in a propagation sense to affect the results. The MOAF algorithm also automatically determines those cells in an area which are most heavily loaded and those cells which are lightly loaded. The MOAF algorithm will only decrease the size of a cell if it determines specific adjacent cells that are willing and able to accept the load, and the MOAF algorithm will increase the size of a cell only if there is a nearby heavily loaded cell that requires the removal of load. Moreover, the MOAF algorithm can be tuned (via the threshold parameter T) to shift the focus of the optimization from avoidance of coverage holes to the avoidance of creation of excessive handover legs.

Abstract: An approach for allocating bandwidth in a satellite communication system is disclosed. The system includes a set of global queues that store bandwidth requests, which are received from a number of satellite terminals. The received bandwidth request include a high priority rate request, a low priority rate request, a high priority volume request, and a low priority volume request. A bandwidth control processor determines bandwidth request type and priority of the received bandwidth requests and places the bandwidth requests in the appropriate global queues based upon the determined bandwidth request type and priority. Each of the global queues corresponds to a data rate associated with of each a plurality of channels. The system also utilizes a set of local queues that correspond to the channels. The BCP moves the bandwidth requests from the global queues to the local queues. The BCP then allocates the transmission slots in response to the bandwidth requests stored in the local queues.

Abstract: Methods and systems are provided for reducing interference across coverage cells using base stations interconnected by a packet network. A wireless device monitors the channel signal strength of its serving cell and its neighboring cell. The serving cell collects measurements from the wireless devices within its cell and informs its neighboring cell when one of the wireless device may be causing significant interference to the neighboring cell. The neighboring cell collects this information and executes a multi-user detection and cancellation algorithm on a subset of these interfering wireless devices.

Abstract: An approach for performing congestion avoidance in a switching communication system is disclosed. An input port of the switching communication system receives a bandwidth request from a source. The switching communication system includes a bandwidth control processor that examines the bandwidth request, and multiple output ports. The output ports communicate with various destination sites. A congestion avoidance logic within the switching communication system generates multiple clusters based upon a transmission constraint associated with the output ports; each of the clusters corresponds to a portion of the destination sites. The congestion avoidance logic determines a cluster threshold that corresponds to traffic load distribution among the critical clusters. Additionally, the congestion avoidance logic selectively grants the bandwidth request based upon the determined cluster threshold.

Abstract: A system (20) and method (30) for estimating the location of a terrestrial-based user terminal (23) is provided. The user terminal (23) is capable of measuring the relative signal strengths of a plurality of spot beams pilot signal emitted from a geostationary satellite (22). The user terminal (23) then estimates its position based on the measured relative signal strengths. Using this approach, the user terminal (23) can quickly determine its location without prior knowledge of its position or delay time.