Patents by Inventor Deepak V. Ayyagari
Deepak V. Ayyagari 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).
-
Patent number: 7856008Abstract: The embodiments of the present invention provide a mechanism to synchronize centralized networks. Each centralized network includes a central coordinator controlling and managing network activities. The embodiments provide a way of allocating beacon slots, such that one of the beacon slots is synchronized to the alternating current line cycle and thus functions as a master timing sequence. In some embodiments, methods, devices, and systems are provided for detecting transmissions of non-coordinating networks.Type: GrantFiled: May 31, 2006Date of Patent: December 21, 2010Assignee: Sharp Laboratories of America, Inc.Inventors: Deepak V. Ayyagari, Wai-Chung Chan, Sherman L. Gavette, Lawrence W. Yonge, III, Yiorgos Peponides, Neal Riedel
-
Patent number: 7848306Abstract: Embodiments of the invention provide methods, systems, and devices that coordinate access to a common medium between two networks. Typically, a gateway is employed that requests resources from a home central coordinator and/or access coordinator. If resources are not available from the home central coordinator and the access coordinator, a neighbor network protocol is performed to obtain additional resources.Type: GrantFiled: May 30, 2006Date of Patent: December 7, 2010Assignee: Sharp Laboratories of America, Inc.Inventors: Deepak V. Ayyagari, Wai-Chung Chan, Lawrence W. Yonge, III
-
Publication number: 20090112114Abstract: Methods and systems for continual self-monitoring of respiratory health and components for use therewith. The present methods and systems and their related components improve the standard of core in respiratory health self-monitoring by providing continual and unobtrusive monitoring that accounts for environmental, physiological and patient background information, and is capable of yielding a complex array of respiratory health-preserving responses. In some embodiments, the present methods and systems leverage ubiquitous handheld electronic devices [e.g. cell phones and personal data assistants (PDA)] for respiratory health self-monitoring.Type: ApplicationFiled: December 6, 2007Publication date: April 30, 2009Inventors: Deepak V. Ayyagari, Wai-Chung Chan
-
Patent number: 7506042Abstract: An ad hoc network organizational method which is employable with a collection of plural nodes in a setting where there is available a current overall network topology map containing at least the identities of, and the inter-nodal communication link qualities and capabilities associated with, each of the nodes. The method generally involves the steps of (a) examining the topology map to determine the current pattern of possible and not-possible direct communication links between pairs of nodes, thus to detect, from an inter-nodal, inter-communication point of view, hidden nodes and non-hidden nodes, and (b) on the basis of such examining, establishing a proxy networking scheme wherein pairs of nodes which are hidden with respect to one another can nonetheless communicate with one another through at least one, intermediary, selectable proxy node which is non-hidden with respect to each of the two nodes in such a pair.Type: GrantFiled: August 6, 2004Date of Patent: March 17, 2009Assignee: Sharp Laboratories of America, Inc.Inventor: Deepak V. Ayyagari
-
Patent number: 7443833Abstract: Disclosed herein is a method for performing ongoing ad hoc network topology discovery with regard to a collection of plural participating nodes. The method features the steps of (a) defining an appropriate topology-discovery condition to be associated with such nodes, (b) when that condition occurs, establishing and activating a dedicated, contention-free, discovery-communication time period wherein each node broadcasts, for reception by all other nodes, its attributes, including its identity, it operating characteristics, its capabilities, and its associated link qualities in relation to the other nodes, (c) utilizing the results of such establishing and activating steps, creating an overall network topology map associated with the nodes, and (d) then making that map available for use in subsequent network organizational activities, including the practices of creating suitable communication links between nodes, and enabling organization of a network into appropriate subnets and proxy networks.Type: GrantFiled: August 6, 2004Date of Patent: October 28, 2008Assignee: Sharp Laboratories of America, Inc.Inventor: Deepak V. Ayyagari
-
Patent number: 7342896Abstract: A method for the self-organization of a plural-node communication network which involves (1) selecting a central coordinator (CCo) node from a collection of nodes initially lacking a CCo, (2) employing the selected CCo to oversee a procedure for discovering, from the mentioned node collection, all nodes which are optimally capable of being organized into a network, in the sense that all such discovered, capable nodes may effectively be organized to communicate bidirectionally with all other nodes, and (3), with respect to such discovered, organizable nodes, creating a network-global connectivity database in the form of a network-organizing communication topology table that describes enablement of bidirectional communication between all nodes.Type: GrantFiled: February 9, 2004Date of Patent: March 11, 2008Assignee: Sharp Laboratories of America, Inc.Inventor: Deepak V. Ayyagari
-
Patent number: 6947407Abstract: 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.Type: GrantFiled: December 7, 2000Date of Patent: September 20, 2005Assignees: Verizon Laboratories Inc., University of MarylandInventors: Deepak V. Ayyagari, Anthony Ephremides
-
Patent number: 6894991Abstract: 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.Type: GrantFiled: November 30, 2000Date of Patent: May 17, 2005Assignees: Verizon Laboratories Inc., Genuity, Inc.Inventors: Deepak V. Ayyagari, Anthony Ephremides
-
Patent number: 6879572Abstract: 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.Type: GrantFiled: August 22, 2000Date of Patent: April 12, 2005Assignees: Verizon Laboratories Inc., Genuity, Inc.Inventors: Deepak V. Ayyagari, Anthony Ephremides
-
Publication number: 20040174829Abstract: A method for the self-organization of a plural-node communication network which involves (1) selecting a central coordinator (CCo) node from a collection of nodes initially lacking a CCo, (2) employing the selected CCo to oversee a procedure for discovering, from the mentioned node collection, all nodes which are optimally capable of being organized into a network, in the sense that all such discovered, capable nodes may effectively be organized to communicate bidirectionally with all other nodes, and (3), with respect to such discovered, organizable nodes, creating a network-global connectivity database in the form of a network-organizing communication topology table that describes enablement of bidirectional communication between all nodes.Type: ApplicationFiled: February 9, 2004Publication date: September 9, 2004Applicant: Sharp Laboratories of America, Inc.Inventor: Deepak V. Ayyagari
-
Publication number: 20020101822Abstract: 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.Type: ApplicationFiled: November 30, 2000Publication date: August 1, 2002Inventors: Deepak V. Ayyagari, Anthony Ephremides
-
Publication number: 20010040881Abstract: 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.Type: ApplicationFiled: December 7, 2000Publication date: November 15, 2001Inventors: Deepak V. Ayyagari, Anthony Ephremides