• Title/Summary/Keyword: 멀티홉 통신

Search Result 241, Processing Time 0.026 seconds

An Efficient Addressing Scheme Using (x, y) Coordinates in Environments of Smart Grid (스마트 그리드 환경에서 (x, y) 좌표값을 이용한 효율적인 주소 할당 방법)

  • Cho, Yang-Hyun;Lim, Song-Bin;Kim, Gyung-Mok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.1
    • /
    • pp.61-69
    • /
    • 2012
  • Smart Grid is the next-generation intelligent power grid that maximizes energy efficiency with the convergence of IT technologies and the existing power grid. Smart Grid is created solution for standardization and interoperability. Smart Grid industry enables consumers to check power rates in real time for active power consumption. It also enables suppliers to measure their expected power generation load, which stabilizes the operation of the power system. Smart industy was ecolved actively cause Wireless communication is being considered for AMI system and wireless communication using ZigBee sensor has been applied in various industly. In this paper, we proposed efficient addressing scheme for improving the performance of the routing algorithm using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm has wasted address space. Therefore proposing x, y coordinate axes from divide address space of 16 bit to solve this problem. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verify performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduce multi hop than ZigBee distributed address assignment and another.

Distributive V2V Multi-hop Pre-caching scheme based on bidirectional vehicle mobility information in CCVNs (콘텐츠 중심 차량 네트워크에서 차량의 양방향 이동성 정보를 기반한 다중 홉 차량 분산 사전 캐싱 기법)

  • Min-Kyu Kim;Tae-Hyun Kim;Geon-Yong Shim;Ga-Yeong Kim;Eui-Sin Lee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.11a
    • /
    • pp.113-114
    • /
    • 2023
  • 본 논문은 다양한 방향성과 멀티 홉을 고려하여 최적의 콘텐츠 제공을 위한 릴레이 차량 선택 방안을 제안한다. 도로변 기지국의 제한성으로 인해 자율 주행 차량에 탑승한 승객들이 콘텐츠를 충분히 전달받는 데에 있어서, 지연시간과 버퍼링 등의 문제가 발생할 수 있다. 따라서, 도로변 기지국의 보조를 위하여 주위의 다른 차량들을 활용하여 요청된 콘텐츠를 원활하게 제공할 수 있다. 하지만, 기존 방안들은 한 대 또는 너무 많은 차량을 무분별하게 선택함으로써 최적화된 성능을 도출할 수 없었다. 그러므로, 본 논문은 요청 차량과 같은 방향으로 이동하는 1 차 릴레이 차량을 선발하는 데에 있어서 반대쪽에서 오는 2 차 릴레이 차량의 사전 캐싱량을 활용하는 방안을 제안한다. 1차 릴레이 차량의 충분한 요청 차량과의 연결 시간에 비교하여 부족한 사전 캐싱량을 2 차 릴레이 차량들로 보충함으로써 지연시간과 버려지는 패킷을 최소화할 수 있다.

A Study on the Performance of Home Embedded System Using a Wireless Mesh Network (무선 메쉬 네트워크를 이용한 홈 임베디드 시스템의 성능에 대한 연구)

  • Roh, Jae-Sung;Ye, Hwi-Jin
    • Journal of Digital Contents Society
    • /
    • v.8 no.3
    • /
    • pp.323-328
    • /
    • 2007
  • Communication systems beyond 3G should provide more than 100 Mbps for wireless access. In addition to smart antennas, wireless multi-hop networks are proposed to increase the cell size and throughput. For example, Zigbee technology is expected to provide low cost and low power connectivity and can be implemented in wireless mesh networks larger than is possible with Bluetooth. Also, home embedded system using wireless mesh network is one of the key market areas for Zigbee applications. If the line-of-sight path is shadowed by home obstacles, a direct connection between the access point (AP) and the node is not possible at high frequencies. Therefore, by using multi-hop relay scheme the end node can be reached to AP. In this paper, the relaying of data between the AP and the end node is investigated and the throughput and PER(Packet Error Rate) are evaluated in multi-hop wireless mesh networks by using DSSS/BPSK system.

  • PDF

Neighbor Caching for P2P Applications in MUlti-hop Wireless Ad Hoc Networks (멀티 홉 무선 애드혹 네트워크에서 P2P 응용을 위한 이웃 캐싱)

  • 조준호;오승택;김재명;이형호;이준원
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.5
    • /
    • pp.631-640
    • /
    • 2003
  • Because of multi-hop wireless communication, P2P applications in ad hoc networks suffer poor performance. We Propose neighbor caching strategy to overcome this shortcoming and show it is more efficient than self caching that nodes store data in theirs own cache individually. A node can extend its caching storage instantaneously with neighbor caching by borrowing the storage from idle neighbors, so overcome multi-hop wireless communications with data source long distance away from itself. We also present the ranking based prediction that selects the most appropriate neighbor which data can be stored in. The node that uses the ranking based prediction can select the neighbor that has high possibility to keep data for a long time and avoid caching the low ranked data. Therefore the ranking based prediction improves the throughput of neighbor caching. In the simulation results, we observe that neighbor caching has better performance, as large as network size, as long as idle time, and as small as cache size. We also show the ranking based prediction is an adaptive algorithm that adjusts times of data movement into the neighbor, so makes neighbor caching flexible according to the idleness of nodes

The Design, Implementation, and Evaluation of a User-Level Mobile Ad Hoc Network Routing with COTS Devices (사용자 계층 모바일 애드혹 라우팅 네트워크 설계와 실제 환경에서의 성능 검증)

  • Kim, Joon-Gyum;Gong, Taesik;Lee, Sung-Ju
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.7
    • /
    • pp.845-851
    • /
    • 2019
  • We design, implement, and evaluate a user-level ad hoc network routing protocol on the COTS (commercial off-the-shelf) mobile devices. In situations such as disaster recovery, emergency communication between mobile devices is necessary. For wide deployability and usability of such a system, we design and implement the networking protocols on the user level instead of modifying the kernel of mobile devices. In order to support reliable data transfer in high mobility scenarios, we selected to implement AODV (Ad Hoc On-Demand Distance Vector) as the routing protocol and TCP as the transport layer protocol. With our implementation of ad hoc networking stack on COTS smartphones, we conducted experiments in various networking environments. Our experimental results show that ad hoc networking is possible in up to 12 hops in a line topology and 5 concurrent devices in a star topology.

A Cluster-based Routing Algorithm for Wireless Sensor Network Considering Delay and Reliability (무선센서 네트워크 환경에서 지연 및 신뢰성을 고려한 클러스터 기반의 라우팅 알고리즘)

  • Shim, Myung-Sook;Park, Myong-Soon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.04a
    • /
    • pp.593-596
    • /
    • 2010
  • 본 논문에서는 선형적인 무선 센서 네트워크에서 지연 및 신뢰성을 고려한 클러스터 기반의 멀티홉 라우팅 알고리즘을 제안한다. 제안한 알고리즘은 선형적인 네트워크 환경에서 전송 지연시간 및 Single Point Of Failure 를 해결하기 위해 짝수 ID 노드일 경우 다음 짝수 ID 노드로 전송하고, 홀수 ID 노드일 경우 다음 ID 노드로 데이터를 전송하는 방법을 사용한다.

The cancellation performance of loop-back signal in wireless USN multihop relay node (무선 USN 멀티홉 중계 노드에서 루프백 신호의 제거 성능)

  • Lim, Seung-Gag;Kang, Dae-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.4
    • /
    • pp.17-24
    • /
    • 2009
  • This paper deals with the cancellation performance of loop back interference signal in the case of multihop relay of 16-QAM received signal at the USN radio network. For this, it is necessary to the exchange of information with long distance located station by means of the relay function between the node in the USN environment. In the relay node, the loop-back interference signal which the retransmitting signal is feedback to the receiver side due to the antenna of transmitter and receiver are co-used or very colsely located or using the nonlinear device. Due to this signal, the performance of USN system are degraded which are using the limited resource of frequency and power. For improve this, it is necessary to applying the adaptive signal processing algorithm in order to cancellating the unwanted loop-back interference signal at the frontend of receiver in relaying node, we can get the better system and multi hop performance. In the adaptive signal processing, we considered the 16-QAM signal which has a good spectral efficiency, firstly, than, the QR-Array RLS algorithm was used that has a fairly good convergence property and the solving the finite length problem in the H/W implementation. Finaly, we confirmed that the good elimination performanc was confirmed by computer simulation in the learing cuved and received signal constellation compared to the conventional RLS.

  • PDF

A Distributed address allocation scheme based on three-dimensional coordinate for efficient routing in WBAN (WBAN 환경에서 효율적인 라우팅을 위한 3차원 좌표 주소할당 기법의 적용)

  • Lee, Jun-Hyuk
    • Journal of Digital Contents Society
    • /
    • v.15 no.6
    • /
    • pp.663-673
    • /
    • 2014
  • The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. In this paper, we proposed the efficient addressing scheme for improving the performance of routing algorithm by using ZigBee in WBAN environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. Therefore proposing x, y and z coordinate axes from divided address space of 16 bit to solve this problems. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verified performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduced the multi hop better than ZigBee distributed address assignment

A Reputation based Cooperative Routing Scheme for End-to-End Reliable Communications in Multi-hop Wireless Networks (다중 홉 무선 네트워크에서 종단 간 신뢰성 통신을 위한 평판 기반의 협력적 라우팅 기법)

  • Kim, Tae-Hoon;Tak, Sung-Woo
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.11
    • /
    • pp.1593-1608
    • /
    • 2009
  • If a certain relay node in multi-hop wireless networks might become a malicious node that does not cooperate with other nodes or a selfish node, network throughput will be dramatically decreased. Most of existing ad hoc routing protocols assuming that the nodes will fully cooperate with other nodes do not resolve the problem of network performance degradation due to malicious and selfish nodes. This paper presents the CARE (Cooperative Ad hoc routing protocol based REputation) scheme incorporating the reputation management that can achieve a multi-hop wireless network with high throughput performance. The proposed scheme provides the horizontal cross-layer approach which can identify misbehaving malicious, selfish nodes dropped out of the hop-by-hop based packet processing in the network and then set up an optimal packet routing path that will detour misbehaving nodes. And the vertical cross-layer approach contained in the CARE scheme attempts to improve the quality of routing paths by exploiting the quality of link information received from the MAC layer. Besides, it provides high TCP throughput by exploiting the reputation values of nodes acquired from the network layer into the transport layer. A case study on experiments and simulations shows that the CARE scheme incorporating vertical and horizontal cross-layer approaches yields better performance in terms of the low rate of packet loss, fast average packet delivery time, and high TCP throughput between end-to-end nodes.

  • PDF

Real-time Remote Monitoring System of Chemical Accident Response based on Multi-hop Communication (멀티 홉 통신을 기반한 화학 사고 대응 실시간 원격 모니터링 시스템)

  • Lee, Seung-Chul;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.11
    • /
    • pp.1706-1712
    • /
    • 2022
  • Recently, the safety of chemical substances has gained attention due to incidents occurring in petrochemical industrial complexes, such as gas leaks and fires. In particular, industrial complexes in Ulsan and Yeosu (South Korea) are valuable as they significantly contribute to the petrochemical industry, but accidents may occur due to chemical leakage. Therefore, in this study, sensor nodes are configured at an interval of 20 [m] based on outdoor facilities standards to respond to chemical accidents, and exposure consideration of 8 h (TWA) and 15 min (STEL) are proposed in TLVs. The proposed system pre-processes data collected in multi-hop communication at a cycle of 0.6-0.75 [s] using Python and stores it in the MySQL database through SQL and a real-time remote monitoring system that updates the stored data once every 5 s is implemented by linking MySQL and Grafana.