Patents by Inventor John J. Shackleton

John J. Shackleton 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: 8081573
    Abstract: A method of determining the sequence of traversing nodes in a communication network is provided. The method comprises with each node, determining other nodes in the network it can reach in a single hop. Creating a local sequence connection order based on the determined other nodes the node can reach in a single communication hop. Storing historical data of local sequence connection order information and determining a new local sequence connection order based in part on the historical data and communication information.
    Type: Grant
    Filed: November 12, 2010
    Date of Patent: December 20, 2011
    Assignee: Honeywell International Inc.
    Inventors: John J. Shackleton, Yunjung Yi
  • Patent number: 8064377
    Abstract: A method for enhancing the reliability of a simplified multicasting forwarding protocol in a wireless network is provided. The method comprises establishing a list of multi-point relaying (MPR) nodes for each of a plurality of nodes. The list of MPR nodes includes neighbor nodes that cover each of the plurality of nodes within two hops. A first set of nodes is identified that is not already in the list of MPR nodes. In a first approach, the first set of nodes includes nodes that are the only neighbor node to a node in the list of MPR nodes. In a second alternative approach, the first set of nodes includes nodes that are sequentially previous to a node in the list of MPR nodes. Once the first set of nodes is identified, the first set of nodes is added to the list of MPR nodes. If the first approach is used, the method further comprises identifying a second set of nodes that is not already in the list of MPR nodes. The second set of nodes comprises nodes that have the largest number of neighboring MPR nodes.
    Type: Grant
    Filed: January 24, 2008
    Date of Patent: November 22, 2011
    Assignee: Honeywell International Inc.
    Inventors: Yunjung Yi, John J. Shackleton
  • Publication number: 20110060828
    Abstract: A method of determining the sequence of traversing nodes in a communication network is provided. The method comprises with each node, determining other nodes in the network it can reach in a single hop. Creating a local sequence connection order based on the determined other nodes the node can reach in a single communication hop. Storing historical data of local sequence connection order information and determining a new local sequence connection order based in part on the historical data and communication information.
    Type: Application
    Filed: November 12, 2010
    Publication date: March 10, 2011
    Applicant: HONEYWELL INTERNATIONAL INC.
    Inventors: John J. Shackleton, Yunjung Yi
  • Patent number: 7864775
    Abstract: A method of determining the sequence of traversing nodes in a communication network is provided. The method comprises with each node, determining other nodes in the network it can reach in a single hop. Creating a local sequence connection order based on the determined other nodes the node can reach in a single communication hop. Storing historical data of local sequence connection order information and determining a new local sequence connection order based in part on the historical data and communication information.
    Type: Grant
    Filed: December 20, 2007
    Date of Patent: January 4, 2011
    Assignee: Honeywell International Inc.
    Inventors: John J. Shackleton, Yunjung Yi
  • Publication number: 20090190514
    Abstract: A method for enhancing the reliability of a simplified multicasting forwarding protocol in a wireless network is provided. The method comprises establishing a list of multi-point relaying (MPR) nodes for each of a plurality of nodes. The list of MPR nodes includes neighbor nodes that cover each of the plurality of nodes within two hops. A first set of nodes is identified that is not already in the list of MPR nodes. In a first approach, the first set of nodes includes nodes that are the only neighbor node to a node in the list of MPR nodes. In a second alternative approach, the first set of nodes includes nodes that are sequentially previous to a node in the list of MPR nodes. Once the first set of nodes is identified, the first set of nodes is added to the list of MPR nodes. If the first approach is used, the method further comprises identifying a second set of nodes that is not already in the list of MPR nodes. The second set of nodes comprises nodes that have the largest number of neighboring MPR nodes.
    Type: Application
    Filed: January 24, 2008
    Publication date: July 30, 2009
    Applicant: Honeywell International Inc.
    Inventors: Yunjung Yi, John J. Shackleton
  • Publication number: 20090160679
    Abstract: A method of determining the sequence of traversing nodes in a communication network is provided. The method comprises with each node, determining other nodes in the network it can reach in a single hop. Creating a local sequence connection order based on the determined other nodes the node can reach in a single communication hop. Storing historical data of local sequence connection order information and determining a new local sequence connection order based in part on the historical data and communication information.
    Type: Application
    Filed: December 20, 2007
    Publication date: June 25, 2009
    Applicant: HONEYWELL INTERNATIONAL INC.
    Inventors: John J. Shackleton, Yunjung Yi