• Title/Summary/Keyword: hop distance

Search Result 184, Processing Time 0.024 seconds

해양통신에서 uplink coverage 확장을 위한 relay 송수신 기법연구

  • 이경제;김동구
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2022.06a
    • /
    • pp.77-78
    • /
    • 2022
  • Currently, communication at sea is more difficult than communication at inland due to the movement of route signs by waves. This paper conducts research on relay transmission and reception techniques to extend coverage in uplink situations. The uplink maritime communication environment between inland base stations and buoys located a certain distance inland was viewed as two hops, and a beam generated according to the number of antennas was selected and a performance analysis was conducted considering the movement of buoys measured by sensors.

  • PDF

A Study on Improvement of AODV for Hybrid Wireless Mesh Networks (혼합형 무선 메시 네트워크를 위한 AODV 개선 연구)

  • Kim, Ho-Cheal
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.8
    • /
    • pp.943-953
    • /
    • 2013
  • By the enormous increase in mobile nodes and diverse service requests on wireless networks, wireless mesh network(WMN) takes an interest as the solution for such requests. However, lots of issues which should be solved to deploy WMN are still remained. In the network layer, the performance improvement of routing protocols is the major issue of nowadays researches. WMN can be easily deployed by use of protocols for mobile ad-hoc networks(MANET) because it is much similar with MANET in multi-hop wireless routing and which node plays as host and router concurrently. Unfortunately, most routing protocols for MANET have drawbacks such as large traffic overhead and long delay time for route discovery due to the network extension. They are major factors of performance degradation of WMN and most researches are focused on them. In this paper, domain-based AODV which is amended AODV to be applied in hybrid WMN is proposed. The proposed scheme divides a hybrid WMN as several domains and performs route discovery by header layer domain. Therefore it can reduce the distance for route discovery as much as average hop count between domain header and member nodes. From the simulation, domain-based AODV was showed slowly increasing delay time due to the network extension.

Performance Analysis of Real-Time Video Management System Based on Multi-Hop Wi-Fi Direct Communication (멀티 홉 Wi-Fi Direct 통신 기반 실시간 영상관리 시스템 성능 분석)

  • Woo, Chae-yul;Jo, Mi-ran;Kwon, Soon-ryang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1472-1480
    • /
    • 2016
  • When disasters such as earthquake, flood, typhoon, fire and terrorism are occurred a video management system is required which can shoot video on the disaster site, and send it to a server located in the command center that can grasp at a glance the site conditions. In this paper, to know the performance elements information needed to construct the video management system. we presented a method of configuring an ad hoc network based on Wi-Fi direct communication. And we also evaluated the performance through built of environment for the video management system. The evaluated performance test items are 'packet flow tests according to the video compression ratios and the image sizes', 'packet flow tests according to the distance and traffic tests', 'packet flow tests according to whether LOS or not', and 'performance test of scenarios'.

Load Balancing Schemes in the MANET with Multiple Internet Gateways (다중 인터넷 게이트웨이를 갖는 MANET의 부하 균등화 기법)

  • Kim, Young-Min;Lim, Yu-Jin;Yu, Hyun;Lee, Jae-Hwoon;Ahn, Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.13C no.5 s.108
    • /
    • pp.621-626
    • /
    • 2006
  • A mobile ad hoc network (MANET) is an infrastructureless network that supports multi-hop communication. For the MANET nodes wishing to communicate with nodes in the wired Internet, the global Internet connectivity is required and this functionality can be achieved with the help of the Internet gateway. For the support of reliability and flexibility, multiple Internet gateways can be provisioned for a MANET. In this case, load-balancing becomes one of the important issues since the network performance such as the network throughput can be improved if the loads of the gateways are well-balanced. In this paper, we categorize the load-balancing mechanisms and propose a new metric for load-balancing. Simulation results show that our proposed mechanism using the hop distance and the number of routing table entries as a load-balancing metric enhances the overall network throughput.

Design and Application of LoRa-based Network Protocol in IoT Networks (사물 네트워크에서 LoRa 기반 네트워크 프로토콜 설계 및 적용)

  • Lee, Sung-Keun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.6
    • /
    • pp.1089-1096
    • /
    • 2019
  • Recently, small-scale IoT services using a small amount of information through low-performance computing have been spread. It requires low cost, low-power, and long-distance communication technologies with wide communication radius, relatively low power consumption. This paper proposes a MAC layer and routing protocol that supports multi-hop transmission in small-scale IoT environment distributed over a large area based on LoRa communication and delivering a small amount of sensing data. The terminal node is mobile and the communication type provides bidirectional transmission between the terminal node and the network application server. By applying the proposed protocol, a production line monitoring system for smart factory was implemented. It was confirmed that the basic monitoring functions are normally performed.

Sensor Positioning Scheme using Density Probability Models in Non-uniform Wireless Sensor Networks (비 균일 무선 센서 네트워크 환경에서 밀집 확률 모델링을 이용한 센서 위치 인식 기법)

  • Park, Hyuk;Hwang, Dong-Kyo;Park, Jun-Ho;Seong, Dong-Ook;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.3
    • /
    • pp.55-66
    • /
    • 2012
  • In wireless sensor networks, a positioning scheme is one of core technologies for sensor applications such as disaster monitoring and environment monitoring. The One of the most positioning scheme, called DV-HOP does not consider non-uniform sensor networks that are actual distributed environments. Therefore, the accuracy of the existing positioning scheme is low in non-uniform network environments. Moreover, because it requires many anchor nodes for high accuracy in non-uniform network environments, it is expensive to construct the network. To overcome this problem, we propose a novel sensor positioning scheme using density probability models in non-uniform wireless sensor networks. The proposed scheme consists of the density probability model using the deployment characteristics of sensor nodes and the distance refinement algorithm for high accuracy. By doing so, the proposed scheme ensures the high accuracy of sensor positioning in non-uniform networks. To show the superiority of our proposed scheme, we compare it with the existing scheme. Our experimental results show that our proposed scheme improves about 44% accuracy of sensor positioning over the existing scheme on average even in non-uniform sensor networks.

Clustering Algorithm for Extending Lifetime of Wireless Sensor Networks (무선 센서 네트워크의 수명연장을 위한 클러스터링 알고리즘)

  • Kim, Sun-Chol;Choi, Seung-Kwon;Cho, Yong-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.4
    • /
    • pp.77-85
    • /
    • 2015
  • Recently, wireless sensor network(WSN) have been used in various fields to implement ubiquitous computing environment. WSN uses small, low cost and low power sensors in order to collect information from the sensor field. This paper proposes a clustering algorithm for energy efficiency of sensor nodes. The proposed algorithm is based on conventional LEACH, the representative clustering protocol for WSN and it prolongs network and nodes life time using sleep technique and changable transmission mode. The nodes of the proposed algorithm first calculate their clustering participation value based on the distance to the neighbor nodes. The nodes located in high density area will have clustering participation value and it can turn to sleep mode. Besides, proposed algorithm can change transmission method from conventional single-hop transmission to multi-hop transmission according to the energy level of cluster head. Simulation results show that the proposed clustering algorithm outperforms conventional LEACH, especially non-uniformly deployed network.

Clustering for Improved Actor Connectivity and Coverage in Wireless Sensor and Actor Networks (무선 센서 액터 네트워크에서 액터의 연결성과 커버리지를 향상시키기 위한 클러스터 구성)

  • Kim, Young-Kyun;Jeon, Chang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.8
    • /
    • pp.63-71
    • /
    • 2014
  • This paper proposes an algorithm that forms the clusters on the basis of hop distance in order to improve the actor coverage and connectivity in the sink-based wireless sensor and actor networks. The proposed algorithm forms the clusters that are distributed evenly in the target area by electing the CHs(Cluster Heads) at regular hop intervals from a sink. The CHs are elected sequentially from the sink in order to ensure the connectivity between the sink and the actors that are located on the CHs. Additionally, the electing are achieved from the area of the higher rate of the sensors density in order to improve the actor coverage. The number of clusters that are created in the target area and the number of the actors that are placed on the positions of the CHs are reduced by forming the clusters with regular distribution and minimizing the overlap of them through the proposed algorithm. Simulations are performed to verify that the proposed algorithm constructs the actor network that is connected to the sink. Moreover, we shows that the proposed algorithm improves the actor coverage and, therefore, reduces the amount of the actors that will be deployed in the region by 9~20% compared to the IDSC algorithm.

An LV-CAST algorithm for emergency message dissemination in vehicular networks (차량 망에서 긴급 메시지 전파를 위한 LV-CAST 알고리즘)

  • Bae, Ihn-Han
    • Journal of the Korean Data and Information Science Society
    • /
    • v.24 no.6
    • /
    • pp.1297-1307
    • /
    • 2013
  • Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or disseminate useful traffic information to othet vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collision at the link layer due to an excessive number of broadcast packets. To solve broadcast storm problem, we propose an RPB-MACn-based LV-CAST that is a vehicular broadcast algorithm for disseminating safety-related emergency message. The proposed LV-CAST identifies the last node within transmission range by computing the distance extending on 1 hop from the sending node of an emergency message to the next node of receiving node of the emergency message, and the last node only re-broadcasts the emergency message. The performance of LV-CAST is evaluated through simulation and compared with other message dissemination algorithms.

An Improved Energy Aware Greedy Perimeter Stateless Routing Protocol for Wireless Ad Hoc Network (무선 Ad Hoc 네트워크를 위한 개선된 위치정보 기반의 에너지를 고려한 라우팅 프로토콜)

  • Kim, Hak-Je;Yoon, Won-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.11
    • /
    • pp.25-31
    • /
    • 2009
  • In this paper we propose an improved energy aware greedy perimeter stateless routing protocol (EAGPSR) for wireless ad hoc network. The existing greedy perimeter stateless routine (GPSR) has some problems with overloaded node and void situation. The improved EAGPSR protocol is proposed to remedy these problems. It also gives the solution for the fundamental problem in geographical routine called void communication. It considers two parameters (Residual Energy of battery and distance to the destination) for the next hop selection. In order to use efficiently limited-energy of node in wireless ad hoc network, network lifetime is focused. To evaluate the performance of our protocol we simulated EAGPSR in ns-2. The simulation results show that the proposed protocol achieves longer network lifetime compared with greedy perimeter stateless routing (GPSR) and the existing Energy aware greedy perimeter stateless routing protocol (EAGPSR).