Patents by Inventor Lance E. Hester
Lance E. Hester 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: 9923757Abstract: This document describes techniques for reducing a size of data sets related to network security alarms or logs, or other messages. Preferably, the reduction is performed via a clustering and compressing algorithm that, among other things, enables an operator to provide customized control in the form of ordered, per-attribute thresholds, or “stop” points. These thresholds function to preserve important information while still achieving excellent clustering and compression results. In some embodiments, the technique described herein can be used to reliably produce reduced-size data sets composed entirely of unique entries. The unique entries can thus be used as keys into a database, e.g., for storage and later analysis or other purposes.Type: GrantFiled: October 3, 2017Date of Patent: March 20, 2018Assignee: Akamai Technologies, Inc.Inventor: Lance E. Hester
-
Patent number: 7724765Abstract: A method and apparatus for providing quality of service over a contention access period of a wireless personal area network is provided herein. Particularly, the layers above the MAC are allowed to reserve portions of a contention access period (CAP) in order to schedule their QoS actions cooperatively thereby avoiding the dependence on the MAC for QoS performance. By using cooperative scheduling, a node can send a QoS packet from the QoS_Layer to the MAC, and know that it will be transmitted according to the specified QoS requirement. As a result, whenever a node sends a QoS packet in the reserved portion of the CAP, the channel will be guaranteed to be free from competing nodes' packets because those competing nodes will delay their transmissions based on the shared schedule.Type: GrantFiled: December 7, 2006Date of Patent: May 25, 2010Assignee: Motorola, Inc.Inventors: Yan Huang, Lance E. Hester, Matthew R. Perkins
-
Publication number: 20080137684Abstract: A method and apparatus for providing quality of service over a contention access period of a wireless personal area network is provided herein. Particularly, the layers above the MAC are allowed to reserve portions of a contention access period (CAP) in order to schedule their QoS actions cooperatively thereby avoiding the dependence on the MAC for QoS performance. By using cooperative scheduling, a node can send a QoS packet from the QoS_Layer to the MAC, and know that it will be transmitted according to the specified QoS requirement. As a result, whenever a node sends a QoS packet in the reserved portion of the CAP, the channel will be guaranteed to be free from competing nodes' packets because those competing nodes will delay their transmissions based on the shared schedule.Type: ApplicationFiled: December 7, 2006Publication date: June 12, 2008Applicant: Motorola, Inc.Inventors: Yan Huang, Lance E. Hester, Matthew R. Perkins
-
Patent number: 7362724Abstract: A method for peer-to-peer ranging and discovery of a rigid body existing in a scatternet having piconets and nodes includes the steps of defining a node (12) in a piconet (10) to be a piconet controller (PNC) having controller functions, locating a rigid body seed including the node (12), and discovering a rigid body by sequentially downloading controller functions of the piconet controller (12) to at least one border node. Also provided is a communications node including a receiver for receiving communications from other communications nodes in a communications range (R), a transmitter for sending communications to other communications nodes in the communications range (R), a memory storing at least ranging information and a unique identification for describing the node, and a processor connected to the receiver, to the transmitter, and to the memory, the processor being programmed to carry out the method according to the present invention.Type: GrantFiled: July 9, 2003Date of Patent: April 22, 2008Assignee: Motorola, Inc.Inventors: Jian Huang, Lance E. Hester, Yan Huang, Spyros Kyperountas, Feng Niu, Qicai Shi
-
Patent number: 7277394Abstract: A wireless network (100) and method (200) for assigning a set of channels to a set of wireless devices (102-126) in the network where there are less channels than devices such that wireless devices are grouped in channel groups such that the wireless devices assigned to each channel group are positioned so as not to interfere with each other. In assigning an nth wireless device to a kth channel group, the nth and preferably one member of the kth channel group at a time are instructed to transmit simultaneously in order to ascertain if the nth wireless device interferes with or is interfered with by any member of the kth channel group.Type: GrantFiled: May 12, 2003Date of Patent: October 2, 2007Assignee: Motorola, Inc.Inventors: Lance E. Hester, Chung-Chieh Lee
-
Patent number: 7203729Abstract: A communication device (111) determines whether to operate as a cluster head in a network of communication devices (100). The device performs a self-assessment regarding its ability to operate as a cluster head based on a formula that assigns weights to factors related to its capabilities and preferably its environment (410, 420, 430). The ability of the device is combined with a random value component in determining whether to operate as a cluster head (440). In the preferred embodiment, upon assumption of cluster head status, the device communicates with neighboring devices to signal its cluster head status, and to invite others to participate in the formation of a cluster.Type: GrantFiled: March 27, 2002Date of Patent: April 10, 2007Assignee: Motorola Inc.Inventors: Priscilla L. Chen, Lance E. Hester, Yan Huang
-
Patent number: 7002938Abstract: An apparatus and method for a spanning tree network. A communication device can connect to a piconet network and the communication device can transmit at least one available piconet identifier prior to receiving a request for the available piconet identifier from a dependent communication device, the available piconet identifier providing a parent piconet coordinator identification for the dependent communication device. A dependent communication device can connect to the piconet network, determine if the communication device can support a dependent piconet, and receive at least one available piconet identifier prior to requesting information regarding establishing a dependent piconet, the available piconet identifier providing parent piconet identification for the communication device for the dependent piconet.Type: GrantFiled: December 23, 2003Date of Patent: February 21, 2006Assignee: Motorola, Inc.Inventors: Lance E. Hester, Yan Huang, Padmaja Ramadas
-
Patent number: 6982960Abstract: A network protocol for low-cost, low-power devices coupled to a self-organizing wireless network using a spanning tree backbone architecture is described. In this protocol, physical and logical network construction and maintenance operations, which supports efficient data routing in the network, are performed. The construction phase in conjunction with the maintenance phase insures the self-organizing capability of the network. At the same time, the maintenance operations provide a self-healing mechanism so that the network can recover from node failures and a self-updating mechanism so that the network can expand as more nodes enter the system. Also, the logical backbone hierarchy will facilitate multi-hop communication. The construction of a logical layered spanning tree backbone architecture from an underlying physical topology allows seamless data communication routing between all nodes in the network.Type: GrantFiled: March 9, 2001Date of Patent: January 3, 2006Assignee: Motorola, Inc.Inventors: Chung-Chieh Lee, Lance E. Hester, Robert J. O'Dea, Priscilla Chen, Vernon A. Allen, Monique J. Bourgeois
-
Patent number: 6925064Abstract: In order to discover neighboring nodes (203, 207, 208) within a particular piconet, a first node (206) determines a list of all nodes (205-207) within its piconet (201) and then transmits to each node within the piconet, a message requiring a response. Depending upon which nodes are heard from, a list is formulated by the first node comprising those nodes neighboring the first node. In order for neighboring nodes within other piconets to “discover” the first node, the first node will also scan its environment to determine piconet identifications for other piconets, and then broadcast a “discovery” message having a piconet identification of a neighboring piconet. In a similar manner, the first node will also scan its environment to determine discovery messages transmitted by other nodes, thus determining neighboring nodes outside its piconet.Type: GrantFiled: September 11, 2003Date of Patent: August 2, 2005Assignee: Motorola, Inc.Inventors: Lance E. Hester, Jian Huang, Yan Huang, Padmaja Ramadas, Matthew R. Perkins
-
Publication number: 20040228300Abstract: A wireless network (100) and method (200) for assigning a set of channels to a set of wireless devices (102-126) in the network where there are less channels than devices such that wireless devices are grouped in channel groups such that the wireless devices assigned to each channel group are positioned so as not to interfere with each other. In assigning an nth wireless device to a kth channel group, the nth and preferably one member of the kth channel group at a time are instructed to transmit simultaneously in order to ascertain if the nth wireless device interferes with or is interfered with by any member of the kth channel group.Type: ApplicationFiled: May 12, 2003Publication date: November 18, 2004Inventors: Lance E. Hester, Chung-Chieh Lee
-
Patent number: 6788650Abstract: The invention provides methods (300) for organizing and assigning network address to network nodes in clusters (108, 110, 112, 114, 116, 118, 120, 212, 214, 216, 218, 220), and forming new clusters and also provides a method 700 for routing messages in clusters. According to the invention, clusters are organized into hierarchical tree arrangements, with addresses assigned in a manner that facilitates routing messages.Type: GrantFiled: November 26, 2002Date of Patent: September 7, 2004Assignee: Motorola, Inc.Inventors: Priscilla Chen, Vernon A. Allen, Oleg Andric, Lance E. Hester, Yan Huang
-
Publication number: 20030235158Abstract: A network protocol for low-cost, low-power devices coupled to a self-organizing wireless network using a spanning tree backbone architecture is described. In this protocol, physical and logical network construction and maintenance operations, which supports efficient data routing in the network, are performed. The construction phase in conjunction with the maintenance phase insures the self-organizing capability of the network. At the same time, the maintenance operations provide a self-healing mechanism so that the network can recover from node failures and a self-updating mechanism so that the network can expand as more nodes enter the system. Also, the logical backbone hierarchy will facilitate multi-hop communication. The construction of a logical layered spanning tree backbone architecture from an underlying physical topology allows seamless data communication routing between all nodes in the network.Type: ApplicationFiled: March 9, 2001Publication date: December 25, 2003Inventors: Chung-Chieh Lee, Lance E. Hester, Robert J. O'Dea, Priscilla Chen, Vernon A. Allen, Monique J. Bourgeois
-
Publication number: 20030227931Abstract: The invention provides methods (300) for organizing and assigning network address to network nodes in clusters (108, 110, 112, 114, 116, 118, 120, 212, 214, 216, 218, 220), and forming new clusters and also provides a method 700 for routing messages in clusters. According to the invention, clusters are organized into hierarchical tree arrangements, with addresses assigned in a manner that facilitates routing messages.Type: ApplicationFiled: November 26, 2002Publication date: December 11, 2003Inventors: Priscilla Chen, Vernon A. Allen, Oleg Andric, Lance E. Hester, Yan Huang
-
Publication number: 20020169846Abstract: A communication device (111) determines whether to operate as a cluster head in a network of communication devices (100). The device performs a self-assessment regarding its ability to operate as a cluster head based on a formula that assigns weights to factors related to its capabilities and preferably its environment (410, 420, 430). The ability of the device is combined with a random value component in determining whether to operate as a cluster head (440). In the preferred embodiment, upon assumption of cluster head status, the device communicates with neighboring devices to signal its cluster head status, and to invite others to participate in the formation of a cluster.Type: ApplicationFiled: March 27, 2002Publication date: November 14, 2002Inventors: Priscilla L. Chen, Lance E. Hester, Yan Huang