최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
DataON 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Edison 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Kafe 바로가기국가/구분 | United States(US) Patent 등록 |
---|---|
국제특허분류(IPC7판) |
|
출원번호 | US-0138566 (1998-08-24) |
발명자 / 주소 |
|
출원인 / 주소 |
|
대리인 / 주소 |
|
인용정보 | 피인용 횟수 : 483 인용 특허 : 16 |
Two network communication protocols, one for routing and one for mobility management, are presented that are particularly suited for use with ad-hoc networks. The routing protocol is a proactive-reactive hybrid routing protocol that limits the scope of the proactive procedure to the node's local nei
Two network communication protocols, one for routing and one for mobility management, are presented that are particularly suited for use with ad-hoc networks. The routing protocol is a proactive-reactive hybrid routing protocol that limits the scope of the proactive procedure to the node's local neighborhood. Routing zones are defined for each node that include nodes whose distance from the subject node in hops is at most some predefined number, referred to as the zone radius. Each node is required to know the topology of the network within its routing zone only. The reactive procedure is limited during route discovery to queries of only those nodes located on the periphery of routing zones. In this manner, the queries hop across nodes in distances of zone radius, thus limiting the scope of the reactive procedure. The zone radius is preferably adjustable to accommodate different and differing network topologies and network operational conditions in the most efficient manner. The mobility management protocol relies on some network nodes assuming the mobility management function. In this scheme, each network node is "associated" with one or more mobility management nodes. The mobility management nodes form a virtual network which is embedded within the actual ad-hoc network. Each mobility management node knows the location of all nodes within its zone, and communicates this information to any other mobility management node that requests it.
[ What is claimed is:] [1.]1. A method for locating a route in a communications network comprising the steps of:a) providing a network comprised of a plurality of communications nodes;b) defining a routing zone for each node, each said routing zone including all nodes in said network that are within
[ What is claimed is:] [1.]1. A method for locating a route in a communications network comprising the steps of:a) providing a network comprised of a plurality of communications nodes;b) defining a routing zone for each node, each said routing zone including all nodes in said network that are within a predefined maximum distance from a corresponding node;c) providing each node in said network with routing information for all nodes win said network that are within each node's corresponding routing zone;d) determining from said routing information whether a destination node is located within a same routing zone as a source node in said network, and if so, determining a route from said source node to said destination node from said information;e) if said destination node is not located within the same routing zone as said source node, then sending a route location query from said source node to at least one peripheral node on a periphery of said source node's routing zone;f) in response to said route location query, determining whether said destination node is located within a routing zone corresponding to said at least one peripheral node, and if so,g) determining at least one route from said source node through said at least one peripheral node to said destination node;h) if said destination node is not located within said at least one peripheral node's routing zone, then sending a route location query from said at least one peripheral node to at least one node on a periphery of said at least one peripheral node's routing zone; andi) repeating steps f-h as necessary to locate at least one route from said source node to said destination node.
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.