• Title/Summary/Keyword: multi hop network

Search Result 582, Processing Time 0.034 seconds

Interference Cancellation for Relay-Assisted D2D Communication

  • Zhao, Hongyi;Cao, Yang;Liu, Yingzhuang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3276-3292
    • /
    • 2015
  • Relay-assisted D2D communication extends the communication range of the D2D pairs and helps users to form D2D pairs effectively. However, due to the introduction of the multi-hop relaying, the D2D communication has to occupy extra transmission time, which may decrease the efficiency of the communication system. In this paper, we propose a scheme to make node receive D2D signal and BS signal at overlapping time to improve the spectrum efficiency according to ZigZag decoding and successive-interference-cancellation (SIC). In this way, more data can be delivered during the same duration, thus the network throughput can be further improved. Numerical results verify the performance improvement of the proposed scheme when compared with a baseline scheme. Moreover, we expand the proposed scheme from one-hop relay scenario to multi-hop relay scenario.

An Effective Cross Layer-based Multimedia Transmission Algorithm over Multi-hop Mobile Ad Hoc Network (다중 홉 이동 애드 혹 네트워크에서 크로스레이어 기반의 효과적인 멀티미디어 전송 알고리즘)

  • Lee, Gyeong-Cheol;Kim, Wan;Song, Hwang-Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5A
    • /
    • pp.474-481
    • /
    • 2010
  • In this paper, we present an effective cross layer-based video transmission algorithm over multi-hop mobile ad hoc networks. The proposed algorithm selects the most efficient PHY mode of wireless LAN multi-rate service at each node in a distributed way based on the available information at application, MAC, and physical layers in order to minimize end-to-end delay and maintain packet loss rate in tolerable range at the receiver. Finally, experimental results are provided to show superior performance of the proposed algorithm.

Efficient Aggregation and Routing Algorithm using Local ID in Multi-hop Cluster Sensor Network (다중 홉 클러스터 센서 네트워크에서 속성 기반 ID를 이용한 효율적인 융합과 라우팅 알고리즘)

  • 이보형;이태진
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.135-139
    • /
    • 2003
  • Sensor networks consist of sensor nodes with small-size, low-cost, low-power, and multi-functions to sense, to process and to communicate. Minimizing power consumption of sensors is an important issue in sensor networks due to limited power in sensor networks. Clustering is an efficient way to reduce data flow in sensor networks and to maintain less routing information. In this paper, we propose a multi-hop clustering mechanism using global and local ID to reduce transmission power consumption and an efficient routing method for improved data fusion and transmission.

  • PDF

Performance Analysis of Coded FSK System for Multi-hop Wireless Sensor Networks (멀티 홉 무선 센서 네트워크를 위한 부호화된 FSK 시스템의 성능 해석)

  • Oh, Kyu-Tae;Roh, Jae-Sung
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.4
    • /
    • pp.408-414
    • /
    • 2007
  • Research advances in the areas of micro-sensor device and wireless network technology, has made it possible to develop energy efficient and low cost wireless sensor nodes. In this paper, the forward error control (FEC) scheme for lower power consumption and excellent BER(Bit Error Rate) performance during transmission propose in multi-hop wireless sensor network based on FSK modem. The FEC technique uses extra processing power related to encoding and decoding, it is need complex functions to be built into the sensor node. The probability of receiving a correct bit and codeword for relaying a frame over h nodes to the sink node is calculated as a function of channel parameter, number of hops, number of bits transmitted and the distance between the different nodes.

  • PDF

Throughput Analysis of Opportunistic Routing in Long-Haul Multi-hop Wireless Networks (롱 홀 다중 홉 무선 네트워크에서의 Opportunistic 라우팅의 전송 용량 분석)

  • Lee, Goo-Yeon;Lee, Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.8
    • /
    • pp.19-24
    • /
    • 2012
  • In this paper, we analyze the maximum throughput of opportunistic routing along a long-haul multi-hop wireless network path for a single data stream, while considering link-level interference among the network nodes. Surprisingly, we find out that opportunistic routing does not provide much improvement in throughput for long-haul paths. The results of this research show that when we compare the extra cost for the complex implementation of the opportunistic routing scheme to the performance improvement obtained from it, opportunistic routing scheme needs to be applied to only short-haul multi-hop wireless network paths.

Mobile-Based Relay Selection Schemes for Multi-Hop Cellular Networks

  • Zhang, Hao;Hong, Peilin;Xue, Kaiping
    • Journal of Communications and Networks
    • /
    • v.15 no.1
    • /
    • pp.45-53
    • /
    • 2013
  • Multi-hop cellular networks (MCNs), which reduce the transmit power, mitigate the inter-cell interference, and improve the system performance, have been widely studied nowadays. The relay selection scheme is a key technique that achieves these advantages, and inappropriate relay selection causes frequent relay switchings, which deteriorates the overall performance. In this study, we analyze the conditions for relay switching in MCNs and obtain the expressions for the relay switching rate and relay activation time. Two mobile-based relay selection schemes are proposed on the basis of this analysis. These schemes select the relay node with the longest relay activation time and minimal relay switching rate through mobility prediction of the mobile node requiring relay and available relay nodes. We compare the system performances via simulation and analyze the impact of various parameters on the system performance. The results show that the two proposed schemes can obtain a lower relay switching rate and longer relay activation time when there is no reduction in the system throughput as compared with the existing schemes.

CE-OLSR: a Cartography and Stability Enhanced OLSR for Dynamic MANETs with Obstacles

  • Belghith, Abdelfettah;Belhassen, Mohamed
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.1
    • /
    • pp.270-286
    • /
    • 2012
  • In this paper, we propose a novel routing protocol called the Cartography Enhanced OLSR (CE-OLSR) for multi hop mobile ad hoc networks (multi hop MANETs). CE-OLSR is based on an efficient cartography gathering scheme and a stability routing approach. The cartography gathering scheme is non intrusive and uses the exact OLSR reduced signaling traffic, but in a more elegant and efficient way to improve responsiveness to the network dynamics. This cartography is a much richer and accurate view than the mere network topology gathered and used by OLSR. The stability routing approach uses a reduced view of the collected cartography that only includes links not exceeding a certain distance threshold and do not cross obstacles. In urban environments, IEEE 802.11 radio signals undergo severe radio shadowing and fading effects and may be completely obstructed by obstacles such as buildings. Extensive simulations are conducted to study the performances of CE-OLSR and compare them with those of OLSR. We show that CE-OLSR greatly outperforms OLSR in delivering a high percentage of route validity, a much higher throughput and a much lower average delay. In particular the extremely low average delay exacerbated by CE-OLSR makes it a viable candidate for the transport of real time data traffic in multi hop MANETs.

A Design of Blockchain-based LoRa Multi-hop Network for Smart Grid (스마트 그리드를 위한 블록체인 기반 LoRa 멀티홉 네트워크 설계)

  • Jeon, Seongho;Kim, Seungku
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.3
    • /
    • pp.440-448
    • /
    • 2021
  • This paper presents problems of network technology in smart grid and implements a blockchain-based LoRa multi-hop network to solve them. Since some smart grid applications are operated in harsh environments, it is difficult to establish communication infrastructure. We propose a LoRa network with multi-hop using the Flooding routing protocol. Smart grid environment composes an independent network using various power grid protocols depending on the application. Since this has a problem that an independent infrastructure must be established for each network, a single gateway device supports multiple power grid protocols to implement a method for network integration. Lastly, the author applied Hyperledger-based blockchain to the LoRa network to ensure the integrity of data in a smart grid environment, and strengthened security by physically distributing it. After constructing the three suggestions on the actual test bed, we confirmed that the network operates normally through experiments.

Optimal Routing Path Selection Algorithm in Ad-hoc Wireless Sensor Network (Ad-hoc 센서 네트워크를 위한 최적 라우팅 경로 설정 알고리즘)

  • Jang In-Hun;Sim Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.6
    • /
    • pp.736-741
    • /
    • 2005
  • The highly popular algorithm to determine routing path for the multi-hopping wireless sensor network is DSR(Dynamic Source Routing), which is one of the Demand-Driven way to makes the route only when there is a request for sending data. However, because DSR attaches the route's record on the sending packet, the bigger number of sensor node is, the heavier packet in DSR becomes. In this paper, we try to propose the new optimal routing path selecting algorithm which does not make the size of packet bigger by using proper routing table even though the number of sensor node increases, and we try to show our algorithm is more stable and reliable because it is based on the cost function considering some network resources of each sensor node such as power consumption, mobility, traffic in network, distance(hop) between source and destination.

An Efficient ARQ for Multi-Hop Underwater Acoustic Channel with Long Propagation Delay and High Bit-Error Rate

  • Lee, Jae-Won;Jang, Youn-Seon;Cho, Ho-Shin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.30 no.2
    • /
    • pp.86-91
    • /
    • 2011
  • In the underwater communications, the acoustic channel is in poor communication conditions, such as long propagation delay, narrow bandwidth, and high bit-error rate. For these bad acoustic channels, we propose an efficient automatic repeat request (ARQ) for multi-hop underwater network by using the concepts of concurrent bi-directional transmission, multiple sub-packets, and overhearing data packet instead of the acknowledgement signal. Our results show that the proposed ARQ significantly reduces the transmission latency especially in high BER compared with the existing Stop and Wait ARQ.