公开(公告)号：US08406174B2

公开(公告)日：2013-03-26

申请号：US12694583

申请日：2010-01-27

Applicant: Young Hee Lee ,  Xuan Tung Hoang ,  Dohyun Kim

Inventor： Young Hee Lee ,  Xuan Tung Hoang ,  Dohyun Kim

IPC: H04W4/00

CPC classification number: H04W40/20 ,  H04L45/745

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.

Abstract translation: 修剪周边漫步的方法包括：在事件发生时散列事件的名称或属性，以计算出事件的目标位置; 执行地理路由的贪心转发，以便将事件的分组发送到目的地位置; 当分组到达当前节点时，检查目的地位置与当前节点之间的距离D，其中使用贪心转发模式的分组传输是不可能的; 当当前节点和目的地位置之间的距离D等于或小于无线电传输范围的一半时，检查目的地位置与当前节点的各个相邻节点之间的距离以获得具有最小距离M的相邻节点; 将最小距离M与距离D进行比较; 并根据比较结果确定哪个节点是会合点。