公开(公告)号：KR100791365B1

公开(公告)日：2008-01-07

申请号：KR1020060120467

申请日：2006-12-01

Applicant: 한국과학기술원

Inventor： 임종태 ,  최홍석 ,  김진국 ,  구민성 ,  박찬민 ,  오준한

IPC: H04B7/26 ,  H04L12/28 ,  H04L12/12

CPC classification number: H04W84/18 ,  H04W4/02 ,  H04W4/90

Abstract: A method for producing the shortest safe path between two nodes in a home network system is provided to produce the shortest escape path efficiently by applying the concept of a node weight to an existing Dijkstra algorithm and easily modifying the whole network structure. A server expresses a home network system as nodes and edges(S21). Then the server appoints an NW(Node Weight) and an EW(Edge Weight) respectively to each node and edge(S22). If an emergency is detected from the information collected through sensor nodes(S23), the server updates the node weight of a specific node, where the emergency has been generated, to infinity(S24). Then the server applies a Dijkstra algorithm and produces the shortest path to an exit from the present location of a user(S25).

Abstract translation: 提供一种用于在家庭网络系统中产生两个节点之间的最短安全路径的方法，通过将节点权重的概念应用于现有的Dijkstra算法并且容易地修改整个网络结构来有效地产生最短的逃生路径。 服务器将家庭网络系统表示为节点和边缘（S21）。 然后，服务器分别向每个节点和边缘指定NW（节点权重）和EW（边缘权重）（S22）。 如果从通过传感器节点收集的信息中检测到紧急情况（S23），服务器将发生紧急情况的特定节点的节点权重更新为无穷大（S24）。 然后，服务器应用Dijkstra算法并产生到用户当前位置的出口的最短路径（S25）。