WO2014104454A1 - Système et procédé de routage au moyen d'informations géographiques - Google Patents

Système et procédé de routage au moyen d'informations géographiques Download PDF

Info

Publication number
WO2014104454A1
WO2014104454A1 PCT/KR2012/011841 KR2012011841W WO2014104454A1 WO 2014104454 A1 WO2014104454 A1 WO 2014104454A1 KR 2012011841 W KR2012011841 W KR 2012011841W WO 2014104454 A1 WO2014104454 A1 WO 2014104454A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
distance
packet
cost
increases
Prior art date
Application number
PCT/KR2012/011841
Other languages
English (en)
Korean (ko)
Inventor
강현국
최대인
김민수
이수진
Original Assignee
인텔렉추얼디스커버리 주식회사
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 인텔렉추얼디스커버리 주식회사 filed Critical 인텔렉추얼디스커버리 주식회사
Priority to PCT/KR2012/011841 priority Critical patent/WO2014104454A1/fr
Publication of WO2014104454A1 publication Critical patent/WO2014104454A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H04W40/16—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on interference
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point

Definitions

  • the present invention relates to a routing system and method using geographic information.
  • Routing using geographical information can solve the limitation of topology based routing by using additional information.
  • Each node participating in the communication uses its own location information, and each node obtains its own location information through GPS or other types of location services. In other words, the location service information is included in the sender's packet.
  • the location-based routing protocol uses location information and movement information for routing processing.
  • LAR Location Aided Routing
  • GREA Distence Routing Effect Algorithm for Mobility
  • GRS Grid Location Service
  • the LAR is one of the reactive routing protocols, and transmits a route request packet in a limited manner to perform route discovery more efficiently.
  • the transmitting node includes its location information in the transport packet.
  • Every node contains location information of every node participating in the network. At this time, the update period of the location information is determined according to the characteristics of the distance and mobility between nodes.
  • GLS is a location information service, not a routing protocol, and every node in GLS has a number of servers that provide location information in the network.
  • GLS can be used in dense, large-scale mobile ad hoc networks.
  • GLS has a server that provides a variety of location information in the network to obtain location information through this server.
  • LAR and DREAM use flooding to update and query location information, but GLS does not use flooding.
  • 1 is a diagram illustrating a conventional routing method.
  • the routing system includes a source node 10, a destination node 15, and a plurality of intermediate nodes.
  • the source node 10 serves to transmit a packet.
  • the destination node 15 serves to receive a packet.
  • a plurality of intermediate nodes are located between the source node 10 and the destination node 15 to provide a packet transmission path.
  • the source node 10 transmits a packet to the destination node 15, the source node 10 selects an intermediate node based on the shortest distance or the shortest hop.
  • the source node 10 selects and transmits the first intermediate node 11, which is the node closest to the destination node 15, among the plurality of intermediate nodes included in the packet transmission distance that is the distance at which the radio waves can be reached.
  • the first intermediate node 11 selects the next intermediate node in the same way as the source node 10 selects the intermediate node. Accordingly, the second intermediate node 13, which is the node closest to the destination node, is selected and transmitted among the nodes whose radio waves can be reached.
  • the first intermediate node 11 and the second intermediate node 13 there are buildings, trees, and the like, which can cause radio interference, so that radio waves are disturbed during packet transmission. Therefore, there is a problem in that the probability that a packet transmitted from the first intermediate node 11 to the second intermediate node 13 arrives normally decreases.
  • Korean Laid-Open Patent Publication No. 2012-0042089 name of the invention: a cluster head node and a communication method thereof
  • a cluster head node and a communication method thereof is used in communication between communication interfaces in a cluster head node that performs communication using two different types of communication interfaces.
  • Korean Patent Application Publication No. 2010-0034324 (name of the invention: apparatus and method for transmitting a packet in a node of a wireless sensor network) uses a priority queue in a node to minimize delay of a packet requiring real time
  • a packet transmission apparatus and method for a node of a wireless sensor network that implements reliable routing using queue information.
  • the present invention is to solve the above-described problems of the prior art, some embodiments of the present invention, when an obstacle is located in the packet path at the time of packet transmission in each node, select the node with the minimum distance cost and interference cost to transmit It is an object of the present invention to provide a routing system and method using geographical information.
  • a first aspect of the present invention provides a source node for transmitting a packet, a destination node for receiving a packet, and routing in a plurality of intermediate nodes located between the source node and the destination node.
  • a system comprising: a node selector for selecting an intermediate node located at a shortest distance from the destination node among a plurality of intermediate nodes included in a packet transmission distance of the source node or each intermediate node, and a routing path via the selected intermediate node And a packet transmitter for transmitting a packet by selecting a node, wherein the node selector selects an intermediate node having a minimum distance cost and an interference cost when an obstacle is located in a packet path corresponding to the shortest distance, and selects the distance cost.
  • the node selector selects an intermediate node having a minimum distance cost and an interference cost when an obstacle is located in a packet path corresponding to the shortest distance, and selects the distance cost.
  • a second aspect of the present invention provides a routing method in a source node for transmitting a packet, a destination node for receiving a packet, and a plurality of intermediate nodes located between the source node and the destination node, wherein the source node or each intermediate node is provided. Selecting an intermediate node located at the shortest distance from the destination node among a plurality of intermediate nodes included in the packet transmission distance of the node, and transmitting a packet by selecting a routing path through the selected intermediate node; When an obstacle is located in the packet path corresponding to the shortest distance, an intermediate node having a minimum distance cost and an interference cost is selected, and the distance cost is between a plurality of intermediate nodes included in the packet transmission distance and the destination node. Increases as the distance is greater, and the interference cost is located in the packet path. The more likely to cause interference due to the obstacles to provide a routing method to increase.
  • the packet can be transmitted by avoiding the section causing the radio interference, so that the packet can reach the destination node normally.
  • 1 is a diagram illustrating a conventional routing method.
  • FIG. 2 is a block diagram of a routing system according to an embodiment of the present invention.
  • 3A and 3B are diagrams illustrating an increase in distance cost in the present invention.
  • 4A and 4B are diagrams illustrating an increase in interference cost in the present invention.
  • FIG. 5 is a diagram illustrating a node selection method in the present invention.
  • FIG. 6 is a flowchart of a routing method according to an embodiment of the present invention.
  • FIG. 2 is a block diagram of a routing system 100 in accordance with an embodiment of the present invention.
  • the routing system 100 using geographic information according to the present invention includes a node selector 110 and a packet transmitter 120.
  • the components illustrated in FIG. 2 mean software components or hardware components such as a field programmable gate array (FPGA) or an application specific integrated circuit (ASIC), and perform predetermined roles. .
  • FPGA field programmable gate array
  • ASIC application specific integrated circuit
  • 'components' are not meant to be limited to software or hardware, and each component may be configured to be in an addressable storage medium or may be configured to reproduce one or more processors.
  • a component may include components such as software components, object-oriented software components, class components, and task components, and processes, functions, properties, procedures, and subs. Routines, segments of program code, drivers, firmware, microcode, circuits, data, databases, data structures, tables, arrays, and variables.
  • Components and the functionality provided within those components may be combined into a smaller number of components or further separated into additional components.
  • the node selector 110 selects an intermediate node located at the shortest distance from the destination node among a plurality of intermediate nodes included in the packet transmission distance of the source node or each intermediate node. In this case, when an obstacle is located in the packet path corresponding to the shortest distance, the node selector 110 selects an intermediate node having a minimum distance cost and an interference cost.
  • the node selector 110 may be located in a form included in each of the source node and the plurality of intermediate nodes to select an intermediate node to transmit the next packet from each node.
  • the position of the node selector 110 is not limited thereto and may be included in one server or the control management unit, instead of being included in each node, to select an intermediate node to transmit the next packet.
  • the node selector 110 determines whether an obstacle is located between packet paths based on a terrain map previously held. Therefore, the interference cost can be calculated by determining the presence of obstacles as well as the distance cost based on the terrain map stored in the DB.
  • the topographic map includes topographic information on the presence or absence of a road, a building, and the like. Specifically, the topographic map may include information about a structure such as a height of a building, a width of a building, and a number of buildings. However, the topographic map is not limited to storing only the information of the structure, but may also include information about natural objects. Therefore, the topographic map may also include information about the size, width, and location of natural objects such as trees, mountains, and rivers.
  • the distance cost used as a criterion for selecting an intermediate node in the node selector 110 increases as the distance between a plurality of intermediate nodes and a destination node included in the packet transmission distance increases.
  • the cost of interference increases as the probability of causing interference by obstacles located in the packet path increases.
  • the distance cost and the interference cost will be described with reference to FIGS. 3A to 4B.
  • 3A and 3B are diagrams illustrating an increase in distance cost in the present invention.
  • the distance cost is used both when there is a possibility of causing radio interference between the current node and a neighboring node and when there is no possibility of causing interference.
  • the distance cost may increase in five types as shown in FIGS. 3A and 3B.
  • the distance cost may appear in a form in which the considered cost increases as the distance increases. That is, the cost may increase in the form of a straight line in proportion to the distance, or the cost may increase in the form of an exponential function or a logarithmic function.
  • the distance cost may appear in a form in which the cost increases as the distance increases as shown in FIG. 3B.
  • the increased form of the distance cost is not limited thereto, and the cost increases as the distance increases to a predetermined distance as shown in FIG. 3A, and the cost may increase stepwise as the distance increases as shown in FIG. 3B. .
  • the cost increases as the distance increases up to a certain distance as shown in FIG. 3A, and after that, the cost may be maintained even if the distance increases.
  • up to a certain distance as the distance increases, as shown in FIG. 3B, the cost increases in a stepped manner, and after that, the same cost may be maintained even if the distance increases.
  • 4A and 4B are diagrams illustrating an increase in interference cost in the present invention.
  • the interference cost is used only if there is a possibility of causing radio interference between the current node and the neighbor node. In this case, the interference cost may be greatly increased in five forms as shown in FIGS. 4A and 4B.
  • the interference cost may appear in a form in which the cost considered increases as the degree of interference increases. That is, the cost may increase in a linear form in proportion to the degree of radio wave interference, or the cost may increase in the form of a quadratic function.
  • the interference cost may appear in a form in which the cost increases as the degree of interference increases as shown in FIG. 4B.
  • the type of increase in the cost of interference is not limited thereto, and the cost increases as the level of interference increases as shown in FIG. 4A until a certain level of interference, and the cost increases stepwise as the level of interference increases in FIG. 4B. You may.
  • the cost increases as the degree of interference increases, as shown in FIG. 4A. After that, the same cost may be maintained even if the degree of interference increases.
  • up to a certain degree of interference as the degree of interference increases as shown in FIG. 4B, the cost increases in a stepped manner, and after that, the same cost may be maintained even if the degree of interference increases.
  • the node selector 110 selects an intermediate node located in a packet path without an obstacle among a plurality of intermediate nodes included in the packet transmission distance. Can be. At this time, the selected intermediate node is selected to be located at the shortest distance from the destination node.
  • the node selector 110 may select the intermediate node based on the distance cost without considering the interference cost. Meanwhile, the node selector 110 will be described with reference to FIG. 5.
  • FIG. 5 is a view showing an example of a node selection method in the present invention.
  • the node selection unit 110 has been described as being located in a form included in each node, but is not necessarily limited thereto.
  • the node selector 110 included in the source node 50 selects an intermediate node located at the shortest distance from the destination node 57 among the plurality of intermediate nodes included in the packet transmission distance 60 of the source node to select a packet. send.
  • the node selector 110 included in the source node 50 may be configured for each intermediate node.
  • the intermediate node is selected by considering only the distance cost without considering the interference cost. Therefore, since the first intermediate node 51 has a minimum distance cost, the node selector 110 included in the source node 50 selects the first intermediate node 51 as the next transmission node.
  • the node selector 110 included in the first intermediate node 51 transmits a packet by selecting one intermediate node among a plurality of intermediate nodes included in the packet transmission distance 70 of the first intermediate node 51. Done. In this case, the node selector 110 included in the first intermediate node 51 determines whether an obstacle is located between packet paths with a plurality of intermediate nodes included in the packet transmission distance 70 of the first intermediate node 51. To judge.
  • the node selector 110 included in the first intermediate node 51 selects the intermediate node in consideration of the distance cost as well as the interference cost. If the node selector 110 included in the first intermediate node 51 selects the third intermediate node 55 and transmits the packet, since there is an obstacle in the packet path, the second intermediate node has no obstacle in the packet path. The cost of interference is greater than that of node 53. Therefore, the node selector 110 included in the first intermediate node 51 does not select the third intermediate node 55 having the minimum distance cost, and selects the second intermediate node 53 in consideration of the interference cost. To send the packet.
  • the intermediate node may be selected by considering only the distance cost of which the distance from the destination node is the closest. However, when there is an obstacle, not only the distance cost but also the interference cost is considered. To select an intermediate node.
  • the packet transmitter 120 selects a routing path via the selected intermediate node and transmits a packet.
  • a routing path via the selected intermediate node and transmits a packet.
  • FIG. 6 is a flowchart of a routing method according to an embodiment of the present invention.
  • the source node or each intermediate node determines whether an obstacle exists between packet paths to a plurality of intermediate nodes included in the packet transmission distance (S610).
  • the intermediate node when there is no obstacle between the packet paths, the intermediate node is selected in consideration of only the distance cost (S630 and S640).
  • the interference cost is first considered (S620), and then the intermediate node is selected in consideration of the distance cost (S630 and S640).
  • the distance cost increases as the distance between the plurality of intermediate nodes and the destination node included in the packet transmission distance increases
  • the interference cost increases as the possibility of causing interference by obstacles located in the packet path increases.
  • the distance cost and the interference cost are not limited thereto, and may be represented by various types of increase as described above with reference to FIGS. 3A to 4B.
  • the routing path via the selected intermediate node is selected to transmit the packet (S630).
  • the packet is transmitted using geographic information, a section causing radio wave interference can be avoided, thereby increasing the probability that the packet arrives normally.
  • Computer readable media can be any available media that can be accessed by a computer and includes both volatile and nonvolatile media, removable and non-removable media.
  • Computer readable media may include both computer storage media and communication media.
  • Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data.
  • Communication media typically includes computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave, or other transmission mechanism, and includes any information delivery media.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention concerne un système de routage permettant de router un nœud source permettant de transmettre un paquet, un nœud de destination permettant de recevoir le paquet, et une pluralité de nœuds centraux situés entre le nœud source et le nœud de destination, et le système de routage comprend : une unité de sélection de nœud permettant de sélectionner un nœud central situé à la distance la plus courte du nœud de destination parmi la pluralité de nœuds centraux dans une distance de transmission de paquets possible ou le nœud source de chacun des nœuds centraux ; et une unité transmettrice de paquets permettant de transmettre le paquet en sélectionnant un chemin de routage qui traverse le nœud central sélectionné, l'unité de sélection de nœud sélectionnant le nœud central qui minimise un coût de distance et un coût d'interférence quand un obstacle est présent sur un chemin de paquet qui correspond à la distance la plus courte, le coût de distance s'accroissant à mesure que la distance entre la pluralité de nœuds centraux dans la distance possible de transmission de paquets et le nœud de destination s'accroît, et le coût d'interférence s'accroissant à mesure que la possibilité de l'obstacle sur le chemin de paquet causant une interférence s'accroît.
PCT/KR2012/011841 2012-12-31 2012-12-31 Système et procédé de routage au moyen d'informations géographiques WO2014104454A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/KR2012/011841 WO2014104454A1 (fr) 2012-12-31 2012-12-31 Système et procédé de routage au moyen d'informations géographiques

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/KR2012/011841 WO2014104454A1 (fr) 2012-12-31 2012-12-31 Système et procédé de routage au moyen d'informations géographiques

Publications (1)

Publication Number Publication Date
WO2014104454A1 true WO2014104454A1 (fr) 2014-07-03

Family

ID=51021497

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2012/011841 WO2014104454A1 (fr) 2012-12-31 2012-12-31 Système et procédé de routage au moyen d'informations géographiques

Country Status (1)

Country Link
WO (1) WO2014104454A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20190049599A (ko) 2017-11-01 2019-05-09 (주)솔빛시스템 트리 토폴로지를 사용하는 분산망에서 인접한 노드 전송을 통한 전송 신뢰성 향상 방법 및 장치
CN110024431A (zh) * 2016-12-22 2019-07-16 株式会社日立制作所 通信系统、通信管理方法、以及网络管理装置

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2005236632A (ja) * 2004-02-19 2005-09-02 Oki Electric Ind Co Ltd 無線ネットワーク装置、無線ネットワークシステム及び経路選択方法
JP2008187359A (ja) * 2007-01-29 2008-08-14 Kyocera Corp データ送信方法、データ送信管理システムおよびデータ伝送経路管理装置
KR20100122792A (ko) * 2009-05-13 2010-11-23 한양대학교 산학협력단 홈 자동화 시스템에서 무선 센서네트워크를 위한 라우팅 방법 및 이에 사용되는 센서 노드의 통신모듈
JP2011009974A (ja) * 2009-06-25 2011-01-13 Hitachi Ltd 無線通信システム及び無線通信方法
KR20120068427A (ko) * 2010-12-17 2012-06-27 고려대학교 산학협력단 애드혹 네트워크에서 에너지 소모를 최소화하는 경로 탐색 장치 및 방법
JP2012227707A (ja) * 2011-04-19 2012-11-15 Nec Corp パケット中継システム、パケット中継方法およびパケット中継用プログラム

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2005236632A (ja) * 2004-02-19 2005-09-02 Oki Electric Ind Co Ltd 無線ネットワーク装置、無線ネットワークシステム及び経路選択方法
JP2008187359A (ja) * 2007-01-29 2008-08-14 Kyocera Corp データ送信方法、データ送信管理システムおよびデータ伝送経路管理装置
KR20100122792A (ko) * 2009-05-13 2010-11-23 한양대학교 산학협력단 홈 자동화 시스템에서 무선 센서네트워크를 위한 라우팅 방법 및 이에 사용되는 센서 노드의 통신모듈
JP2011009974A (ja) * 2009-06-25 2011-01-13 Hitachi Ltd 無線通信システム及び無線通信方法
KR20120068427A (ko) * 2010-12-17 2012-06-27 고려대학교 산학협력단 애드혹 네트워크에서 에너지 소모를 최소화하는 경로 탐색 장치 및 방법
JP2012227707A (ja) * 2011-04-19 2012-11-15 Nec Corp パケット中継システム、パケット中継方法およびパケット中継用プログラム

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110024431A (zh) * 2016-12-22 2019-07-16 株式会社日立制作所 通信系统、通信管理方法、以及网络管理装置
EP3544329A4 (fr) * 2016-12-22 2020-06-10 Hitachi, Ltd. Système de communication, procédé de gestion de communication et dispositif de gestion de réseau
US11190950B2 (en) 2016-12-22 2021-11-30 Hitachi, Ltd. Communication system, communication management method, and network management apparatus
CN110024431B (zh) * 2016-12-22 2022-04-15 株式会社日立制作所 通信系统、通信管理方法、以及网络管理装置
KR20190049599A (ko) 2017-11-01 2019-05-09 (주)솔빛시스템 트리 토폴로지를 사용하는 분산망에서 인접한 노드 전송을 통한 전송 신뢰성 향상 방법 및 장치

Similar Documents

Publication Publication Date Title
Lee et al. Efficient data harvesting in mobile sensor platforms
Jain et al. Geographical routing using partial information for wireless ad hoc networks
CN100548003C (zh) 在无线网络中转发分组的方法和装置
US6675009B1 (en) Automated configuration of a wireless communication device
De Couto et al. Location proxies and intermediate node forwarding for practical geographic forwarding
CN101611642B (zh) 网络中的通信组配置
EP1064760B1 (fr) Procede de routage pour systemes de communication sans fil et repartis et dispositifs connus a cet effet
Chen et al. DTN-FLOW: Inter-landmark data flow for high-throughput routing in DTNs
US7787429B2 (en) Method and apparatus for establishing path in wireless network
CN108040353A (zh) 一种q学习的无人机集群智能地理路由方法
CN106453626A (zh) 使用多用户分集进行对等网络发现的方法和系统
JPWO2011121671A1 (ja) ファームウェア更新方法、通信ユニット、およびプログラム
Huang et al. Coordinate-assisted routing approach to bypass routing holes in wireless sensor networks
WO2017188748A1 (fr) Procédé de formation d'un noeud formant pont dynamique d'un réseau maillé sans fil
US8391183B2 (en) System and method for operating a large-scale wireless network
Stathopoulos et al. Mote herding for tiered wireless sensor networks
WO2014104453A1 (fr) Système de routage pour sélectionner un nœud d'accès au moyen d'informations géographiques, et procédé pour sélectionner un nœud d'accès
Venkatramana et al. CISRP: connectivity-aware intersection-based shortest path routing protocol for VANETs in urban environments.
WO2013115602A1 (fr) Procédé de routage dynamique dans un réseau ad hoc et dispositif de réseau correspondant
KR20110094544A (ko) 엘아이지알 알고리즘을 이용한 무선 센서 및 무선 애드혹 네트워크
WO2014104454A1 (fr) Système et procédé de routage au moyen d'informations géographiques
US7295533B2 (en) Method for location tracking using vicinities
US8493943B1 (en) Geographical communications networking system and method
KR101243244B1 (ko) 애드혹 네트워크에서 에너지 소모를 최소화하는 경로 탐색 장치 및 방법
Kalogeiton et al. Equipping NDN-VANETs with directional antennas for efficient content retrieval

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12890794

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12890794

Country of ref document: EP

Kind code of ref document: A1