Patents by Inventor Uday S. Hegde
Uday S. Hegde 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: 20220361109Abstract: A method of reducing power consumption of a first wireless communication device is described. A charge level of a battery associated with the first wireless communication device is monitored. A wireless communication session between the first wireless communication device and a second wireless communication device is maintained. Based at least in part on the charge level of the battery being within a low battery threshold range, a wireless signal strength associated with the wireless communication session is monitored. Based at least in part on the wireless signal strength reaching a power saving threshold that is above a minimum connection threshold for maintaining the wireless communication session, a power saving action associated with a wireless interface that supports the wireless communication session is performed.Type: ApplicationFiled: May 10, 2021Publication date: November 10, 2022Applicant: Microsoft Technology Licensing, LLCInventors: Uday S. HEGDE, Prateek AGRAWAL
-
Patent number: 11057793Abstract: Techniques for reducing latency between terminal stations in a wireless local area network. In an aspect, two stations in close proximity may be configured to associate with a common access point, by causing one or more of the stations to disassociate from a current access point and reassociating with the common access point. The identity of the common access point may be independently derived at each terminal station using simple broadcast messaging procedures, without the need for extensive communications or handshaking between the stations. In an alternative aspect, a terminal station may repeat the disassociation and reassociation procedures without knowledge of the other station's BSSID, until a measured latency drops below a threshold.Type: GrantFiled: October 10, 2019Date of Patent: July 6, 2021Assignee: Microsoft Technology Licensing, LLCInventor: Uday S. Hegde
-
Publication number: 20200045575Abstract: Techniques for reducing latency between terminal stations in a wireless local area network. In an aspect, two stations in close proximity may be configured to associate with a common access point, by causing one or more of the stations to disassociate from a current access point and reassociating with the common access point. The identity of the common access point may be independently derived at each terminal station using simple broadcast messaging procedures, without the need for extensive communications or handshaking between the stations. In an alternative aspect, a terminal station may repeat the disassociation and reassociation procedures without knowledge of the other station's BSSID, until a measured latency drops below a threshold.Type: ApplicationFiled: October 10, 2019Publication date: February 6, 2020Inventor: Uday S. HEGDE
-
Patent number: 10477429Abstract: Techniques for reducing latency between terminal stations in a wireless local area network. In an aspect, two stations in close proximity may be configured to associate with a common access point, by causing one or more of the stations to disassociate from a current access point and reassociating with the common access point. The identity of the common access point may be independently derived at each terminal station using simple broadcast messaging procedures, without the need for extensive communications or handshaking between the stations. In an alternative aspect, a terminal station may repeat the disassociation and reassociation procedures without knowledge of the other station's BSSID, until a measured latency drops below a threshold.Type: GrantFiled: January 28, 2018Date of Patent: November 12, 2019Assignee: Microsoft Technology Licensing, LLCInventor: Uday S Hegde
-
Publication number: 20190239110Abstract: Techniques for reducing latency between terminal stations in a wireless local area network. In an aspect, two stations in close proximity may be configured to associate with a common access point, by causing one or more of the stations to disassociate from a current access point and reassociating with the common access point. The identity of the common access point may be independently derived at each terminal station using simple broadcast messaging procedures, without the need for extensive communications or handshaking between the stations. In an alternative aspect, a terminal station may repeat the disassociation and reassociation procedures without knowledge of the other station's BSSID, until a measured latency drops below a threshold.Type: ApplicationFiled: January 28, 2018Publication date: August 1, 2019Inventor: UDAY S HEGDE
-
Publication number: 20150358353Abstract: Systems, methods, and software are disclosed herein that enhance selective wipe technology and operations. In an implementation, an application initiates a request to authenticate a user with respect to the application. In some scenarios, the application receives a response to the request that includes a selective wipe instruction. Then the application receives such a response, the application selectively wipes data associated with the application.Type: ApplicationFiled: October 30, 2014Publication date: December 10, 2015Inventors: Mihai Costea, Mahesh K. Unnikrishnan, Uday S. Hegde
-
Patent number: 7921216Abstract: The present invention provides for an automated, user friendly way of constructing and using a binding object. A developer is presented with and selects binding elements that will ultimately be used to create a runtime communication channel for transporting a message between a client and service endpoint. After receiving the user input, metadata, a channel factory and listener factory are created. The metadata describes binding elements and provides an abstract representation of a protocol stack that implements communication aspects at runtime. The channel factory is configured to use the collection of metadata at runtime to generate the runtime communication channel. Further, the listener factory is configured to accept the runtime communication channel for de-multiplexing the communication aspects in order to process the message at a service endpoint. The present invention also provides for groupings of binding elements and standardized binding objects organized based on industry need.Type: GrantFiled: February 1, 2005Date of Patent: April 5, 2011Assignee: Microsoft CorporationInventors: Craig A. Critchley, David A. Wortendyke, Elliot L. Waingold, Eric K. Zinda, Erik B. Christensen, Giovanni M. Della-Libera, Kenneth D. Wolf, Michael S. Vernal, Shy Cohen, Stefan H. Pharies, Stephen J. Millet, Stephen T. Swartz, Tomasz Janczuk, Uday S. Hegde, Yaniv Pessach
-
Patent number: 7512957Abstract: A web services namespace pertains to an infrastructure for enabling creation of a wide variety of applications. The infrastructure provides a foundation for building message-based applications of various scale and complexity. The infrastructure or framework provides APIs for basic messaging, secure messaging, reliable messaging and transacted messaging. In some embodiments, the associated APIs are factored into a hierarchy of namespaces in a manner that balances utility, usability, extensibility and versionability.Type: GrantFiled: December 3, 2004Date of Patent: March 31, 2009Assignee: Microsoft CorporationInventors: Shy Cohen, Geary L. Eppley, Douglas M. Purdy, James E. Johnson, Stephen J. Millet, Stephen T. Swartz, Vijay K. Gajjala, Aaron Abraham Stern, Alexander Martin DeJarnatt, Alfred M. Lee, IV, Anand Rjagopalan, Anastasios Kasiolas, Chaitanya D. Upadhyay, Christopher G. Kaler, Craig Andrew Critchley, David Edwin Levin, David Owen Driver, David Wortendyke, Douglas A. Walter, Elliot Lee Waingold, Erik Bo Christensen, Erin P. Honeycutt, Eugene Shvets, Evgeny Osovetsky, Giovanni M. Della-Libera, Jesus Ruiz-Scougall, John David Doty, Jonathan T. Wheeler, Kapil Gupta, Kenneth David Wolf, Krishnan Srinivasan, Lance E. Olson, Matthew Thomas Tavis, Mauro Ottaviani, Max Attar Feingold, Michael James Coulson, Michael Jon Marucheck, Michael Steven Vernal, Michael Thomas Dice, Mohamed-Hany Essam Ramadan, Mohammad Makarechian, Natasha Harish Jethanandani, Richard Dievendorff, Richard Douglas Hill, Ryan Thomas Sturgell, Saurab Nog, Scott Christopher Seely, Serge Sverdlov, Siddhartha Puri, Sowmyanarayanan K. Srinivasan, Stefan Batres, Stefan Harrington Pharies, Tirunelveli Vishwanath, Tomasz Janczuk, Uday S. Hegde, Umesh Madan, Vaithialingam B. Balayogan, Vipul Arunkant Modi, Yaniv Pessach, Yasser Shohoud