Verizon Laboratories Inc.

University System of Maryland

Other

USA As Represented by Secretary of the Navy

Genuity Inc.

Anthony Ephremides

Deepak V Ayyagari

Samuel Resheff

Gam D Nguyen

Jeffrey E Wieselthier

Gigla Janashia

Lasha Ephremidze

Dimitrios Stamatelos

Sastry Kompella

Clement Kam

Edem Lagvilava

Beiyu Rong

Systems and method are provided for controlling the age of information, or information freshness, for remote status updating through the use of a packet deadline. In an embodiment, a packet deadline determines how long a packet is allowed to wait in a queue at the source before being transmitted, and, if the deadline expires, it is dropped from the system and never transmitted. This mechanism can control the flow of packets into the system, which can be used to control and optimize the age of information, thus providing a fresh status at a monitor.

Packet deadlines in a queue to control the age of information

A new apparatus, system, and technique for performing Matrix Spectral Factorization has been developed, which can factorize in real time high-dimensional matrices with high-order polynomial or non-rational entries. The method can be used for efficient implementation of engineering solutions to problems in Data Compression, Filtering, Wireless Communications, and Radar Systems, etc., which are computationally reducible to matrix spectral factorization.

Matrix spectral factorization for data compression, filtering, wireless communications, and radar systems

User cooperation in wireless networks implemented on the Network Protocol layer level attains a higher stable throughput and improved transmission delay. The cooperation is designed between a set of source user nodes transmitting to a common destination, where users with channels providing a higher successful delivery probability, in addition to their own traffic, relay packets of other source users whose transmissions to the destination fails. Each source user node is provided with an ample queue buffer having capacity to accumulate packets inadvertently received from other users in the system in addition to its own packets. Ranking mechanism facilitates in determining the 'quality' of wireless channels, and the Acknowledgement mechanism facilitates in coordination of the transmissions in the system. The nodes exchange information on the queues status, and decision is made by a scheduling controller on the priority of transmission.

Method and system for cooperative transmission in wireless multi-hop networks

A Group TDMA multiple destination, multiple node wireless network includes a first destination having a first group of nodes (Group) in communication range and a second destination having a second group of nodes (Group) in communication range. A third group of nodes (Group) are within communication range of both first and second destinations. Each group of nodes is assigned a periodically recurring set of time slots for transmitting to a designated destination. A network processor is programmed for (a) dividing the frame into a number of fixed-length time slots; (b) assigning a fraction 1&#x2212;x of the time slots to the first and second groups of nodes; (c) assigning a fraction x of the time slots to the third group; (d) subdividing the third group into a fourth group of nodes and a fifth group of nodes; (e) assigning a fraction y of the fraction x time slots to the fourth group for transmission to the first destination and a fraction 1&#x2212;y of the fraction x time slots to the fifth group for transmission to the second destination; (f) applying a multiple-access protocol to each group in its assigned set of time slots; and (g) optimizing the values of x and y in order to realize the maximum possible value of stable throughput rate &#x3bb;*. Group TDMA provides increased throughput capacity as it provides a balance between scheduled access and pure random access. Nodes may be grouped according to geographical location as well as arbitrary criteria, such as priority or node mission.

Group TDMA frame allocation method and apparatus

With the addition of high-speed data traffic to traditional CDMA cellular networks, there is a need to efficiently utilize system capacity so that the quality of service of existing voice and low-speed data users is maintained while new high-speed data users are added to the network. Methods and systems are presented that control allocation of power to users, quality of service requirements, and/or user activity levels to enhance capacity utilization. These methods and systems are based on a method for estimating the capacity of a CDMA carrier with both voice and data users using an interference-based analysis of the reverse link. In particular, the methods enhance capacity utilization in a multi-code CDMA network architecture, in which several codes are allocated to a single high-speed data user for parallel transmission.

Capacity enhancement for multi-code CDMA with integrated services through quality of service and admission control

A method for maximizing the data throughput over a multi-code DS-CDMA network by controlling the number of codes assigned to each user while controlling the power budget of each user so that each users bit energy to noise ratio is met along with the quality of service and frame error rate requirements. A method is also provided for maximizing the throughput over a variable gain DS-CDMA network in which each user uses only one code and changes the data rate and power to meet quality of service requirements. In both systems, new users will be admitted so long as the power budget and bit energy to noise ratio requirements of each user is maintained. Both systems become closed to new admissions if the addition of a new user would cause any active user to not meet its required performance.

Power control based admission methods for maximum throughput in DS-CDMA networks with multi-media traffic

An integrated highly adaptive method is presented to perform scheduling, routing and access control in a network. The network is made up of a plurality of nodes interconnected by links between at least some of the nodes wherein at least one path interconnects all of the plurality of nodes. The nodes are organized into at least one of a cluster and a clique and the network has a network-wide capacity to send data packets in slots delineating time frames on the network between the nodes on the network defined by the links. The plurality of nodes can be configured to process at least one flow comprising at least a portion of a transmitted and received data packet for which the plurality of nodes must manage to get the data packets to a desired node on the network.

Integrated method for performing scheduling, routing and access control in a computer network

The present invention relates to a system and method for dynamically limiting the power of all users of a CDMA digital data link to maximize throughput and reduce interference among users of the link. In the operation of the data link, the maximum power available from each user of the link is determined along with the minimum power needed from each user to meet its link service requirement, that is, quality of service and frame error rate requirements. The maximum to minimum power ratio is derived for each user and the lowest power ratio, that is, the power ratio closest to unity is selected and used to scale upward the minimum power levels of all users of the data link. The resulting power level establishes the interference margin or slack available for all users of the data link and the interference slack available for new users to be admitted to the data link.

Power control for active link quality protection in CDMA networks

Capacity enhancement for multi-code CDMA with integrated services through quality of services and admission control

From layout and attenuation data of an area and an initial guess, the placement and power levels of base stations and the resulting attenuation and base station ranges are calculated based on any chosen propagation model. A cost function is calculated which indicates the merit of the initial guess placement. The cost function is a function of the transmitter locations and power levels and can be calculated as a linear combination of the uncovered and interference areas. Other cost functions can also be considered. The cost function is optimized by one of several optimization methods to give the optimal base station placement. The optimization can be continuous or discrete. Continuous optimization methods include the modified steepest descent method and the downhill simplex method, while discrete optimization methods include the Hopfield neural network method. The optimization can be performed several times for different initial guess placements to achieve a global, rather than simply local, optimization. The entire optimization process is packaged in the form of an interactive software tool that permits the designer to steer and adjust the solution according to any criteria that the designer may choose.

Growing community of inventors

North Bethesda, MD, United States of America

Anthony Ephremides