Patents by Inventor Rajeev Agrawal

Rajeev Agrawal has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20070133488
    Abstract: A node (200) includes a processor (201) for determining neighbor nodes in a routing path to a destination based on a routing table associated with the node (200). The node (200) includes a memory for storing a first authenticated tokens. The node includes a transmitter (203) for transmitting a first request-to-route (RTR) message including an indication specifying information units (IUs) from the first node to the neighbor nodes in a routing path from the first node to the destination. The node (200) includes a receiver (205) for receiving a neighbor reply message from one of the neighbor nodes to the first node which indicates that the neighbor node will route the information units (IUs). The transmitter (203) transmits a second authenticated tokens from the first node to one of the neighbor nodes. The second authenticated tokens are converted into a tradable entity and provide compensation to the neighbor node selected.
    Type: Application
    Filed: December 14, 2005
    Publication date: June 14, 2007
    Inventors: Sivakumar Muthuswamy, Rajeev Agrawal, Yogesh Bhatt, Avinash Joshi, Surender Kumar
  • Publication number: 20070124735
    Abstract: A method and a system for scheduling requests generated for a plurality of mobile devices in a communication network (100) has been disclosed. The requests are generated for a transmission opportunity. The method includes computing a sort metric (302) for each request, based on an information update. A lead-time is then computed (304) with respect to a drop-dead time for each request, based on the sort metric for a time slice. The drop-dead time for a given time slice is the time before which scheduling has to be done so that data can be transmitted during the given time slice. Each request may be considered (306) for allocation in the time slice before the beginning of a next time slice, based on the lead-time.
    Type: Application
    Filed: November 30, 2005
    Publication date: May 31, 2007
    Inventors: Suresh Kalyanasundaram, Rajeev Agrawal, Jay Jayapalan, Ivan Vukovic
  • Publication number: 20070116139
    Abstract: A method and system for allocating a plurality of subcarriers to a plurality of subscriber devices in a wireless network. A set of characteristics is identified (302) for a transmission on each of the plurality of subcarriers. A dynamic weight is assigned (304) to at least one subscriber device of the plurality of subscriber devices at each decision instance of the transmission corresponding to the at least subscriber device. The assignment of the dynamic weight is based on at least one of a throughput, delay, packet-loss and queue length requirement of one or more flows of the subscriber device. Further, a set of optimum values is determined (306) for the set of characteristics based on the dynamic weights and channel feedback. The plurality of subcarriers are allocated (308) to the at least one subscriber device based on at least one optimum value of the set of optimum values.
    Type: Application
    Filed: November 22, 2005
    Publication date: May 24, 2007
    Inventors: Vijay Subramanian, Rajeev Agrawal, Randall Berry, Jiawei Huang
  • Publication number: 20070037576
    Abstract: A method and apparatus for handing over a mobile station (106) from a serving base station (104a) to a target base station (104b) within a wireless communication system (100) is described. A session is established between the mobile station and the serving base station and it is determined that the mobile station is to be handed over from the serving base station to the target base station. The target base station notifies the serving base station of identifying data of the target base station and added to the identifying data is a message to be sent to mobile station regarding the handover of the mobile station. The serving base station sends the message including the identifying data to the mobile station and the mobile station is handed over from the serving base station to the target base station using the identifying data of the target base station.
    Type: Application
    Filed: August 3, 2006
    Publication date: February 15, 2007
    Applicant: MOTOROLA, INC.
    Inventors: Vijay Subramanian, Rajeev Agrawal, Anand Bedekar, Stavros Tzavidas
  • Publication number: 20060146743
    Abstract: Communications are established between an originating mobile station (104) and a target mobile station (120) in an expedited manner. An initial short packet is transmitted from an originating mobile station (104) and the initial short packet is translated into an Internet Protocol (IP) packet. The IP packet is transmitted to a target Packet Control Unit (PCU) (116). An acknowledgment IP packet is responsively received from the target mobile station (120) via the target PCU (116) and a communication link is established between the originating mobile station (104) and the target mobile station (120).
    Type: Application
    Filed: December 30, 2004
    Publication date: July 6, 2006
    Inventors: Ronald Crocker, Rajeev Agrawal, Thomas Hart, Suresh Kalyanasundaram, Jeffrey Smolinske, Stephen Spear
  • Publication number: 20060133457
    Abstract: A method (1700) and apparatus (1801) provide channel estimation with extended bandwidth filters. Antenna (1813) receives a signal such as a pilot signal and detects a bandwidth associated with the pilot signal in a detector (320). One of a plurality of filters (603, 605, 607, and 609) including extended bandwidth filters (311) and a default filter (305) can be selected by a selector (617). If the detector detects activity associated with a wider bandwidth, the filter associated with the wider bandwidth is selected over the presently selected filter. If no activity is detected, the default filter is selected.
    Type: Application
    Filed: December 16, 2004
    Publication date: June 22, 2006
    Inventors: Michael Wang, Rajeev Agrawal, Xiangyang Chen, Ajoy Singh, Tyler Brown
  • Patent number: 7047310
    Abstract: A communication system that includes multiple nodes controls a flow of data from a first node of the multiple nodes to a second node of the multiple nodes without relying on an estimate of a rate at which data is drawn from a buffer of the second node and such that an overflow and an underflow of the buffer is avoided. The second node determines multiple flow control parameters, including a current occupancy (Q) of the buffer and an upper threshold (U) and a lower threshold (L) for an occupancy of the buffer and determines a desired data rate (r) based on the multiple flow control parameters. The desired data rate can be used to adjust a data rate for the flow of data. In another embodiment, the communication system further dynamically controls a rate at which flow control messages are conveyed by the second node to the first node.
    Type: Grant
    Filed: February 25, 2003
    Date of Patent: May 16, 2006
    Assignee: Motorola, Inc.
    Inventors: Anand S. Bedekar, Rajeev Agrawal, Rajeev Ranjan
  • Publication number: 20060031520
    Abstract: The present embodiments provide apparatuses, methods and systems for use in facilitating access with a distributed network. In some embodiments, and apparatus can comprise a controller, a plurality of persistent connections, and communication ports that receive requests for objects, wherein the requests are communicated over the plurality of persistent connections and the objects are received over the plurality of persistent connections, and at least two of the requests are received from two different client users and are communicated over the same persistent connection. In some implementations, the controller further dynamically adjusts the number of persistent connections. Some systems according to some embodiments can comprise a proxy and a plurality of persistent connections that are activated and maintained by the proxy. The proxy can further comprise a controller, memory and a load tracker, and in some instances a persistent connection controller and idle timer.
    Type: Application
    Filed: May 6, 2004
    Publication date: February 9, 2006
    Inventors: Anand Bedekar, Rajeev Agrawal, Peerapol Tinnakornsrisuphap
  • Publication number: 20050111488
    Abstract: A method and apparatus for resource allocation and scheduling within a wireless communication system is provided herein. During resource allocation, a maximum total system transmit power (P), a maximum number of codes available (N), a maximum number of codes for each user in the system (N=(N1, . . . , Nd)), a maximum SINR value (S=(S1, . . . , Sd)) for each user in the system, and a SINR per watt of transmit power for each user in the system (e=(e1, . . . , ed)) is received by a scheduler. Scheduler then outputs an optimal number of codes per user (n) and power levels per user to).
    Type: Application
    Filed: November 8, 2004
    Publication date: May 26, 2005
    Inventors: Vijay Subramanian, Rajeev Agrawal, Randall Berry
  • Publication number: 20040165530
    Abstract: A communication system that includes multiple nodes controls a flow of data from a first node of the multiple nodes to a second node of the multiple nodes without relying on an estimate of a rate at which data is drawn from a buffer of the second node and such that an overflow and an underflow of the buffer is avoided. The second node determines multiple flow control parameters, including a current occupancy (Q) of the buffer and an upper threshold (U) and a lower threshold (L) for an occupancy of the buffer and determines a desired data rate (r) based on the multiple flow control parameters. The desired data rate can be used to adjust a data rate for the flow of data. In another embodiment, the communication system further dynamically controls a rate at which flow control messages are conveyed by the second node to the first node.
    Type: Application
    Filed: February 25, 2003
    Publication date: August 26, 2004
    Inventors: Anand S. Bedekar, Rajeev Agrawal, Rajeev Ranjan
  • Publication number: 20030120813
    Abstract: An apparatus and method for generating compressed SIP messages from full sized SIP messages and vice versa in order to decrease call set up time in an IP based communication system. During registration of a device, the invention caches the device's static information in the core network in a “Registrar/Location Server.” Subsequently, during call set up, the device transmits its dynamic information to the SIP Agent in a compressed SIP message over an air interface. The SIP Agent retrieves the static information (from the Registrar/Location Server) along with the dynamic information in the compressed SIP message to generate a full sized SIP message. The SIP Agent forwards the full sized SIP message to a SIP Proxy, which is then transmitted to the IP system. Likewise, when a full sized SIP message is received from the IP system, the message is forwarded to the SIP Agent to generate a compressed SIP message for ultimate transmission to the device over the air interface.
    Type: Application
    Filed: December 21, 2001
    Publication date: June 26, 2003
    Inventors: Ishita Majumdar, Richard Jun La, Rajeev Agrawal