Patents by Inventor Anand S. Bedekar

Anand S. Bedekar 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: 20080151815
    Abstract: Various embodiments are described for facilitating network mobility in communication networks with an aim toward enhancing the scalability of MIP. Generally, in most of these embodiments, a network node (121) sends a message to a network device (131) to establish a data path for a remote unit (101) served by the network node. This message comprises a source link layer address which is associated with the remote unit. The message may or may not be sent in response to receiving signaling to facilitate wireless connectivity of a remote unit via the network node. In addition, the network device to which the message is sent may be an access router (AR) or a foreign agent (FA) of the remote unit.
    Type: Application
    Filed: December 26, 2006
    Publication date: June 26, 2008
    Applicant: MOTOROLA, INC.
    Inventors: Anand S. Bedekar, James A. Butler, Paul M. Erickson, Steven D. Upp, Narayanan Venkitaraman, Paula Tjandra
  • Publication number: 20080112440
    Abstract: A method and apparatus for transmitting packets in a wireless communication system (100). The method and apparatus determining a delay period from among the various delay times at each of a plurality of access nodes (106-110) wherein the delay time is the time it takes for a node to receive a data packet from a source (102) through a network (104). During transmission of data from the source, the nodes receive data packets and from the data packets, the wall clock time is determined. The packets are transmitted from the nodes at a time equivalent to the wall clock time and the delay period so that the packets are synchronously transmitted from the multiple nodes.
    Type: Application
    Filed: November 10, 2006
    Publication date: May 15, 2008
    Applicant: Motorola, Inc.
    Inventors: Anand S. Bedekar, Rajeev Agrawal
  • Publication number: 20070270118
    Abstract: A method and information processing system for wirelessly transmitting at least one of a downlink channel descriptor and an uplink channel descriptor for reception by at least one wireless device (104). The method comprises selecting at least one transmission time for transmitting a pointer that indicates a transmission time for a DCD and/or a UCD. The pointer is transmitted at a time between a first transmission and a second transmission of the at least one of downlink channel descriptor and uplink channel descriptor. The transmission time is selected to reduce a time interval for the at least one wireless device (104) to search for the at least one of the DCD and UCD. Also, a message that includes DCD information and/or UCD information associated with at least one neighboring cell can also be chosen to transmit at specifically chosen times to the at least one wireless device (104).
    Type: Application
    Filed: May 18, 2006
    Publication date: November 22, 2007
    Inventors: Vijay G. Subramanian, Anand S. Bedekar, Stavros Tzavidas
  • 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: 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
  • Patent number: 6763009
    Abstract: A base station of a code division, multiple access (CDMA) telecommunications system employs scheduling of data transmission signals to corresponding user transceivers in down-link channels of a data network. One or more user transceivers may be in communication with a base station within a cell, and each user may have a minimum data rate requirement. In accordance with the present invention, the scheduling of user data transmission follows the constraints that 1) each base station transmits to user transceivers one at a time, and 2) the base station uses full available power for the down-link channel when transmitting (for data networks only). Given a data network of users, the method of scheduling and data rates may be modeled in accordance with a linear programming problem optimized according to a predefined criterion. In addition, the present method may be employed in a hybrid CDMA/time-share system to reduce power of data channels in communication with user transceivers near the base station.
    Type: Grant
    Filed: December 3, 1999
    Date of Patent: July 13, 2004
    Assignee: Lucent Technologies Inc.
    Inventors: Anand S. Bedekar, Simon C. Borst, Kavita Ramanan, Philip A. Whiting, Edmund M. Yeh
  • Patent number: 6603753
    Abstract: A base station of a code division, multiple access (CDMA) telecommunications system employs scheduling of data transmission signals to corresponding user transceivers in down-link channels of a data network. One or more user transceivers may be in communication with a base station within a cell, and each user may have a minimum data rate requirement. In accordance with the present invention, the scheduling of user data transmission follows the constraints that 1) each base station transmits to user transceivers one at a time, and 2) the base station uses full available power for the down-link channel when transmitting (for data networks only). Given a data network of users, the method of scheduling and data rates may be modeled in accordance with a linear programming problem optimized according to a predefined criterion. In addition, the present method may be employed in a hybrid CDMA/time-share system to reduce power of data channels in communication with user transceivers near the base station.
    Type: Grant
    Filed: December 3, 1999
    Date of Patent: August 5, 2003
    Assignee: Lucent Technologies Inc.
    Inventors: Anand S. Bedekar, Simon C. Borst, Kavita Ramanan, Philip A. Whiting, Edmund M. Yeh