• Title/Summary/Keyword: 위치 기반의 라우팅 프로토콜

Search Result 119, Processing Time 0.037 seconds

Adaptive analysis of characteristic nodes using prediction method in DTN (DTN에서 예측 기반한 적응적 노드 속성 분석)

  • Dho, Yoon-Hyung;Jeon, Il-Kyu;Oh, Young-Jun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.11
    • /
    • pp.2771-2778
    • /
    • 2014
  • In this paper, we propose an algorithm that select efficient relay nodes using information of network environment and nodes. The proposed algorithm can be used changeable weight factors as following network environment in node density. The routing protocols adopting store-carry-forward method are used for solving network problems occurred by unstable end-to-end connection in Delay Tolerant Networks(DTNs). Exiting DTN routing algorithms have problems that large latency and overhead because of deficiency of network informations. The proposed algorithm could be provide a solution this problems using changeable weight factor and prediction of network environment. Thus, selected relay nodes work efficiently in unstable and stressed network environment. Simulation results show that enhancement performance as overhead, delivery ratio, average latency compared to exiting DTN routing algorithm.

Dynamic Local Update-based Routing Protocol(D-LURP) in Wireless Sensor Network with Mobile Sink (모바일 싱크노드를 갖는 무선 센서 네트워크에서 동적 지역 업데이트 기반의 라우팅 프로토콜(D-LURP))

  • Chung, Jae-Hoon;Park, Sung-Han
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.3
    • /
    • pp.116-122
    • /
    • 2009
  • Mobile Wireless Sensor Network is an organized collection of sensor nodes and mobile sink nodes, in which the sensor node transmits the signal to the sink node. In real environment, there are many cases in which sinks have mobility caused by the people, the vehicle and etc. Since all nodes in the sensor networks have limited energy, many researches have been done in order to prolong the lifetime of the entire network. In this paper we propose Dynamic Local Update-based Routing Protocol(D-LURP) that prolong the lifetime of the entire network to efficiently maintain frequent location update of mobile sink static sensor nodes in Mobile WSNs. When the sink node moves out of the local broadcasting area the proposed D-LURP configures dynamically the local update area consisted of the new local broadcasting area and the previous dissemination node(DN) and find the path between the DN and the sink node, instead of processing a new discovering path like LURP. In this way the processing of broadcasting sink node's location information in the entire network will be omitted. and thus less energy will be consumpted. We compare the performances of the proposed scheme and existing Protocols.

A Method of Selecting Candidate Core for Shared-Based Tree Multicast Routing Protocol (공유기반 트리 멀티캐스트 라우팅 프로토콜을 위한 후보 코어 선택 방법)

  • Hwang Soon-Hwan;Youn Sung-Dae
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.10
    • /
    • pp.1436-1442
    • /
    • 2004
  • A shared-based tree established by the Core Based Tree multicast routing protocol (CBT), the Protocol Independent Multicast Sparse-Mode(PIM-SM), or the Core-Manager based Multicast Routing(CMMR) is rooted at a center node called core or Rendezvous Point(RP). The routes from the core (or RP) to the members of the multicast group are shortest paths. The costs of the trees constructed based on the core and the packet delays are dependent on the location of the core. The location of the core may affect the cost and performance of the shared-based tree. In this paper, we propose three methods for selecting the set of candidate cores. The three proposed methods, namely, k-minimum average cost, k-maximum degree, k-maximum weight are compared with a method which select the candidate cores randomly. Three performance measures, namely, tree cost, mean packet delay, and maximum packet delay are considered. Our simulation results show that the three proposed methods produce lower tree cost, significantly lower mean packet delay and maximum packet delay than the method which selects the candidate cores randomly.

  • PDF

Location based Ad-hoc Network Routing Protocol for Ubiquitous Port (지능형 항만을 위한 위치기반 Ad-hoc 네트워크 라우팅 프로토콜)

  • Lee, Bong-Hee;Choi, Young-Bok
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.1
    • /
    • pp.65-71
    • /
    • 2011
  • In this paper, the RFID / USN-based ad-hoc network structure is presented for efficient operation of a container terminal yard. Communication between fixed or mobile devices in the container terminal yard is accomplished through the ad-hoc node, to collect the status information of a container in real time. Any outside shipper of the container as well as central server allows to share the status information of a container through ad-hoc communication. In addition, to predict the maximum wireless transmission range of nodes by RFID tag position in the yard, LAODV (Location based AODV) routing protocol is proposed. The validity is proved by performance evaluation via computer simulation.

A Location-Aided Cooperative Transmission Method in Mobile Ad-hoc Wireless Sensor Networks (모바일 Ad-hoc 무선 센서 네트워크에서 위치도움 협력 전송 방법)

  • Son, Dong-Hwan;Lee, Joo-Sang;An, Beongku;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.2
    • /
    • pp.23-28
    • /
    • 2008
  • In this paper, we propose location-aided cooperative routing protocol (LACARP) for supporting power saving and stable route lifetime in mobile ad-hoc wireless sensor networks. The main ideas and features of the proposed routing protocol are as follows. First, the definition of the area of route search using location-based information to support power saving transmission. Second, the expect zone-based establishment of routing route within the area of route search. Third, the cooperative-aided transmission method. In the operation of data transmission over the established rout the datas are transmitted via both the established route and cooperative route aided by neighbor nodes. The performance evaluation using OPNET(Optimized Network Engineering Tool) shows the LACARP can improve the packet delivery ratio and power saving transmission efficiently.

  • PDF

An Efficient CBRP Based on Traffic Aware in Unbalanced Network (불균형 분포 네트워크에서 집중되는 트래픽을 고려한 효율적인 클러스터 기반 라우팅 프로토콜)

  • Hamm, Yong-gil;Kim, Yong-seok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.04a
    • /
    • pp.672-673
    • /
    • 2010
  • 애드 혹 네트워크는 모바일 노드의 이동성에 따라 특정 위치에 노드들이 집중 분포되는 형태를 보임으로써 부하가 집중되는 현상이 발생할 수 있다. 본 논문에서는 집중 분포되는 모바일 노드의 부하에 따라 능동적으로 대처함으로써 손실되는 패킷을 줄이고 종단 간 전송 속도를 향상 시키는 라우팅 알고리즘을 제안한다.

Energy-Efficient Routing Algorithm in Wireless Sensor Networks (무선 센서 네트워크에서의 에너지 효율적인 라우팅 알고리즘)

  • Yoo, Seong-Do;Park, Gwi-Tae
    • Proceedings of the KIEE Conference
    • /
    • 2007.10a
    • /
    • pp.491-492
    • /
    • 2007
  • 무선 센서 네트워크는 많은 수의 노드들로 구성되어 있고 각각의 노드들은 네트워크 일정 범위 안에 가깝게 또는 멀리 배열되어져 있다. 각각의 노드들의 수명은 전체 센서 네트워크의 수명에 중요하게 작용한다. 이러한 노드들은 네트워크 토플로지에서 배터리를 사용되고 이 배터리는 현실상 충전과 교체가 거의 불가능하므로 우리는 배터리의 에너지를 최대한 효율적으로 사용해야 한다. 효율적인 에너지 사용은 전체 센서 네트워크의 수명을 늘려주고 임무를 완수하게 해 준다. 이 논문에서는 지리 정보를 바탕으로 이루어진 센서 네트워크에서의 노드들의 효율적인 에너지 소비를 위한 라우팅 알고리즘을 제안한다. 지리 정보를 바탕으로 한 알고리즘 중 GAF(Geographic Aladaptive Fidelity) 알고리즘을 기반으로 보다 더 에너지를 효율적으로 소비하는 Improved GAF를 제안한다. GAF 알고리즘은 한 좌표(gird)당 자기 위치를 알고 있는 한 노드들이 라우팅을 유지하면서 필요 혀는 노드들은 sleeping mode로 전환하여 동등하게 에너지 소비하여 에너지를 보전한다. Improved GAF는 한 좌표당 하나의 센서노드가 아닌 두 개 이하의 센서 노드가 작동하여 기존의 GAF 알고리즘보다 최대 50%까지 에너지 낭비를 막을 수 있다. 따라서 각각의 노드들의 효율적인 에너지 소비로 인하여 전체 센서 네트워크의 수명도 늘어난다. 또한 모바일 싱크가 이동을 하였을 때, 전체 네트워크 라우팅 프로토콜이 아닌 지역적인 라우팅 프로토콜만 재구성하여 에너지 효율적인 데이터 수집 기법을 제안한다.

  • PDF

A Cluster-based Routing Protocol with Energy Consumption Balance in Distributed Wireless Sensor Networks (분산 무선센서 네트워크의 클러스터-기반 에너지 소비 균형 라우팅 프로토콜)

  • Kim, Tae-Hyo;Ju, Yeon-Jeong;Oh, Ho-Suck;Kim, Min-Kyu;Jung, Yong-Bae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.15 no.4
    • /
    • pp.155-161
    • /
    • 2014
  • In this paper, a cluster-based routing protocol in distributed sensor network is proposed, which enable the balanced energy consumption in the sensor nodes densely deployed in the sensor fields. This routing protocol is implemented based on clusters with hierarchical scheme. The clusters are formed by the closely located sensor nodes. A cluster node with maximum residual energy in the cluster, can be selected as cluster head node. In routing, one of the nodes in the intersection area between two clusters is selected as a relay-node and this method can extend the lifetime of all the sensor nodes in view of the balanced consumption of communication energy.

Energy-efficient Data Dissemination Protocol for Detouring Routing Holes in Wireless Sensor Networks (무선 센서 네트워크에서 라우팅 홀을 우회하기 위한 에너지 효율적 데이타 전달 프로토콜)

  • Ye, Tian;Yu, Fucai;Choi, Young-Hwan;Park, Soo-Chang;Lee, Eui-Sin;Jin, Min-Sook;Kim, Sang-Ha
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.3
    • /
    • pp.321-325
    • /
    • 2008
  • Void areas(holes) as an inevitable phenomenon exist in geographic routing of wireless sensor networks, because the unpredictable and harsh nature application environment or uneven energy consumption. Most of the existing schemes for the issue tend to construct a static detour path to bypass a hole. The static detour path may lead to uneven energy consumption of the nodes on the perimeter of the hole; thus it may enlarge the hole. At the same time, traffic would concentrate on the peripheral node of the hole; thus the nodes on the perimeter of the hole tend to be depleted quietly. In previous work, we have proposed a hole geometric model to reduce the energy consumption and packet collisions of the nodes on the hole boundary. This scheme, however, still has the static detour path problem. Therefore, we extend the previous work by constructing a dynamic detour path hole geometric model for wireless sensor networks in this paper. The location of hole detour anchors is dynamically shifted according to Gaussian function, just generating dynamic hole detour paths.

A Study on an Efficient Routing Algorithm for Wireless Sensor Network (무선 센서네트워크에서 효율적인 라우팅 알고리즘에 관한 연구)

  • Kim, Byoung-Chan;Yim, Jae-Hong;Choi, Hong-Seok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.5
    • /
    • pp.887-898
    • /
    • 2009
  • Conventional routing protocols proposed for wireless sensor networks (WSNs) cannot fully accommodate the characteristics of WSNs. In particular, although it is possible to largely obtain benefits in the solution of energy consumption and global identification problems through applying position information, there are few protocols that actively apply such position information. In the case of geographical and energy aware routing (GEAR) that is a typical algorithm, which uses position information, it does not fully represent the characteristics of WSNs because it is limited to forward query messages and assumed as fixed network environments. The routing protocols proposed in this paper defines the direction of data, which is routed based on the position information of individual and target nodes, in which each node configures its next hop based on this direction and routes signals. Because it performs data-centric routing using position information, it does not require certain global identifications in order to verify individual nodes and is able to avoid unnecessary energy consumption due to the forwarding of packets by defining its direction.