公开(公告)号：KR100462028B1

公开(公告)日：2004-12-17

申请号：KR1020020074684

申请日：2002-11-28

Applicant: 한국전자통신연구원

Inventor： 신재욱 ,  남상우

IPC: H04L12/66

Abstract: PURPOSE: A method for searching an IG(Internet Gateway) of an ad-hoc network is provided to maintain path information going toward an up-to-date IG for an ad-hoc node located within a certain area, and to transmit an AA(Agent Advertisement) message to an ad-hoc node located out of the certain area on behalf of the IG, thereby minimizing a network load. CONSTITUTION: An IG(210) transmits an AA message to all ad-hoc nodes(220_k-220_n)(S301). An ad-hoc node(220_k) located within a k-hop area registers in the IG(210) by using an address and path information of the IG(210)(S302). An ad-hoc node(220_n) located out of the k-hop area generates an agent request message and broadcasts the agent request message to an ad-hoc network(S303). If the ad-hoc node(220_k) receives the agent request message, the ad-hoc node(220_k) unicasts the AA message to the ad-hoc node(220_n)(S304). The ad-hoc node(220_n) registers in the IG(210)(S305).

Abstract translation: 目的：提供一种用于搜索自组织网络的IG（因特网网关）的方法，以保持路径信息朝向用于位于特定区域内的自组织节点的最新IG，并且发送AA （代理广告）消息发送到位于特定区域之外的特定节点以代表IG，从而最小化网络负载。 构成：IG（210）向所有专用节点（220_k-220_n）发送AA消息（S301）。 位于k跳区域内的ad-hoc节点（220_k）通过使用IG（210）的地址和路径信息在IG（210）中注册（S302）。 位于k跳区域之外的ad-hoc节点（220_n）生成代理请求消息并将该代理请求消息广播到ad-hoc网络（S303）。 如果自组织节点（220_k）接收到代理请求消息，则自组织节点（220_k）将该AA消息单播到自组织节点（220_n）（S304）。 ad-hoc节点（220_n）在IG（210）中注册（S305）。

公开(公告)号：KR1020040053850A

公开(公告)日：2004-06-25

申请号：KR1020020080304

申请日：2002-12-16

Applicant: 한국전자통신연구원

Inventor： 최지혁 ,  신재욱 ,  남상우

IPC: H04L12/28

CPC classification number: H04W40/02 ,  H04W40/24 ,  H04W84/18

Abstract: PURPOSE: A method for setting a route by weight in an AODV(Ad hoc On-demand Distance Vector) routing protocol is provided to reflect weight of each node in accordance with a network state, and to improve a process of transmitting or retransmitting an RREQ(Route Request) message, thereby efficiently setting a route in accordance with the reflected weight. CONSTITUTION: If an intermediate node receives an RREQ message(S401), the node decides whether the RREQ message is an overlapped message(S402). If so, the node compares a value of a weight cost with a weight value of a previously received RREQ message(S403). If weight of the currently received RREQ message is smaller, the node abandons the RREQ message(S404). If the received RREQ message is not overlapped, the node decides whether to know a route up to a destination node(S406). If so, the node unicasts the RREQ message by a reverse route(S407). If the node does not know the route, the node sets reverse route information(S409), records a previous weight value, and sets a new weight value to the RREQ message(S410), then broadcasts the RREQ message to an adjacent node(S411).

Abstract translation: 目的：提供一种在AODV（Ad hoc On-Demand Distance Vector，Ad hoc按需距离向量）路由协议中设置重要路由的方法，以反映每个节点根据网络状态的权值，并改善RREQ的发送或重发过程 （路由请求）消息，从而根据反映的权重有效地设置路由。 构成：如果中间节点接收到RREQ消息（S401），则节点判定RREQ消息是否是重叠消息（S402）。 如果是，则节点将重量成本的值与先前接收到的RREQ消息的权重值进行比较（S403）。 如果当前接收的RREQ消息的权重较小，则节点放弃RREQ消息（S404）。 如果接收到的RREQ消息不重叠，则节点决定是否知道到达目的地节点的路由（S406）。 如果是，则节点通过反向路由单播RREQ消息（S407）。 如果节点不知道路由，则节点设置反向路由信息（S409），记录先前的权重值，并将新的权重值设置为RREQ消息（S410），然后向相邻节点广播RREQ消息（S411 ）。

公开(公告)号：KR100198813B1

公开(公告)日：1999-06-15

申请号：KR1019960020996

申请日：1996-06-12

Applicant: 한국전자통신연구원

Inventor： 남상우 ,  우동진

IPC: G06Q10/04 ,  G06Q10/08 ,  G06Q50/32

CPC classification number: G01C21/3446

Abstract: 본 발명은 지리 정보 시스템에서의 두 지점 사이에서의 최단 경로를 찾기 위한 방버을 추출하고, 최단 경로 생성 방법과 관련된 응용 서비스를 위하여 지도와 관련 정보를 데이터베이스로 구성하고, 이를 통한 최단경로 생성에 대한 처리를 하므로써, 최단거리에 대한 정보를 요구하는 우편배달, 우편수집, 택배 및 일반도로 정보 안내 등에서 활용하는 서비스 제공이 가능한 우편경로 시스템 및 그 시스템에 따른 최단 경로 생성방법에 관한 것이다.