Patents by Inventor Xuan Tung Hoang

Xuan Tung Hoang 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).

  • Method for pruning perimeter walks in data-centric storage sensor networks
    Patent number: 8406174
    Abstract: A method for pruning perimeter walks includes: hashing a name or attributes of an event, when the event occurs, to figure out a destination location of the event; performing greedy forwarding of geographic routing so as to send a packet of the event towards the destination location; checking a distance D between the destination location and a current node where a packet transmission using greedy forwarding mode is impossible, when the packet reaches the current node; checking distances between the destination location and respective neighboring nodes of the current node to obtain a neighboring node having a minimum distance M, when the distance D between the current node and the destination location is same or less than half of radio transmission range; comparing the minimum distance M to the distance D; and determining which node is a rendezvous node, according to the comparison result.
    Type: Grant
    Filed: January 27, 2010
    Date of Patent: March 26, 2013
    Assignee: Lorea Advanced Institute of Science and Technology
    Inventors: Young Hee Lee, Xuan Tung Hoang, Dohyun Kim
  • METHOD FOR PRUNING PERIMETER WALKS IN DATA-CENTRIC STORAGE SENSOR NETWORKS
    Publication number: 20110182233
    Abstract: A method for pruning perimeter walks includes: hashing a name or attributes of an event, when the event occurs, to figure out a destination location of the event; performing greedy forwarding of geographic routing so as to send a packet of the event towards the destination location; checking a distance D between the destination location and a current node where a packet transmission using greedy forwarding mode is impossible, when the packet reaches the current node; checking distances between the destination location and respective neighboring nodes of the current node to obtain a neighboring node having a minimum distance M, when the distance D between the current node and the destination location is same or less than half of radio transmission range; comparing the minimum distance M to the distance D; and determining which node is a rendezvous node, according to the comparison result.
    Type: Application
    Filed: January 27, 2010
    Publication date: July 28, 2011
    Applicant: KOREA ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY
    Inventors: Young Hee LEE, Xuan Tung Hoang, Dohyun Kim