• Title/Summary/Keyword: Multi-hop communications

Search Result 243, Processing Time 0.032 seconds

Lifetime Maximization with Cooperative Wireless Energy Sharing in Wireless Multi-Hop Communications (무선 멀티 홉 통신에서 협력적인 무선 에너지 공유를 통한 생존시간 최대화)

  • Choi, Hyun-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.11
    • /
    • pp.1550-1553
    • /
    • 2020
  • In this paper, we maximize the lifetime of a multi-hop path through a cooperative wireless energy sharing scheme between constituent nodes in a wireless multi-hop communication. Considering a bidirectional multi-hop communication environment, we present an optimization problem to maximize path lifetime by adjusting the amount of energy each node needs to share with its neighboring nodes. On the basis of solidarity property, i.e., the lifetime of the multi-hop path is maximized when the lifetimes of all nodes are the same, we convert the considered optimization problem into a linear programming problem and solve it easily. Simulation result shows that the proposed two-way wireless energy sharing method maximizes the path lifetime of multi-hop communications and approximately doubles the path lifetime compared with the one-way energy sharing method.

Cognitive Routing for Multi-hop Mobile Cognitive Radio Ad Hoc Networks

  • Lee, Jae-Joon;Lim, Jaesung
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.155-161
    • /
    • 2014
  • Mobility can lead to continual loss of data and service interruptions during communications in multi-hop cognitive radio networks. Mobility of primary users (PUs) or cognitive users (CUs) requires adjustment of multi-hop communications among CUs to avoid any interference to PUs. To provide durable and reliable data routing that ensures continuous network service, we propose mobility-aware cognitive routing (MCR) for multi-hop cognitive radio networks. MCR examines the risk level of each node against interference regions and selects the most reliable path for data delivery using a Markov predictor. Through simulation, we verify that the proposed scheme can avoid route destruction preemptively and achieve reliable data delivery.

Cluster Routing Scheme using Multi-hop Pairwise Key for Distributed Sensor Networks (분산 센서 네트워크에서 Multi-hop Pairwise Key를 이용한 Cluster Routing 기법)

  • Park Soyoung;Kim Hyung Chan;Ramakrishina R.S.
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.484-486
    • /
    • 2005
  • 본 논문에서는 센서네트워크를 위한 기존의 클러스터 라우팅 기법에 multi-hop pairwise key를 적용시킴으로써 multi-hop pairwise key를 기반으로 하는 클러스터를 구성하고 이를 통한 클러스터 간의 통신을 제안한다. 이는 암호화된 클러스터 통신을 위한 키 분배에 있어서 메모리 효율성을 높이고, 클러스터 라우팅의 난제였던 클러스터 헤드 선택과 관리를 효과적으로 할 수 있게 한다.

  • PDF

Exploiting Multi-Hop Relaying to Overcome Blockage in Directional mmWave Small Cells

  • Niu, Yong;Gao, Chuhan;Li, Yong;Su, Li;Jin, Depeng
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.364-374
    • /
    • 2016
  • With vast amounts of spectrum available in the millimeter wave (mmWave) band, small cells at mmWave frequencies densely deployed underlying the conventional homogeneous macrocell network have gained considerable interest from academia, industry, and standards bodies. Due to high propagation loss at higher frequencies, mmWave communications are inherently directional, and concurrent transmissions (spatial reuse) under low inter-link interference can be enabled to significantly improve network capacity. On the other hand, mmWave links are easily blocked by obstacles such as human body and furniture. In this paper, we develop a multi-hop relaying transmission (MHRT) scheme to steer blocked flows around obstacles by establishing multi-hop relay paths. In MHRT, a relay path selection algorithm is proposed to establish relay paths for blocked flows for better use of concurrent transmissions. After relay path selection, we use a multi-hop transmission scheduling algorithm to compute near-optimal schedules by fully exploiting the spatial reuse. Through extensive simulations under various traffic patterns and channel conditions, we demonstrate MHRT achieves superior performance in terms of network throughput and connection robustness compared with other existing protocols, especially under serious blockage conditions. The performance ofMHRT with different hop limitations is also simulated and analyzed for a better choice of the maximum hop number in practice.

A Network Coding for Multi-Hop Ship-to-Ship Communications (다중-홉 선박간 통신을 위한 네트워크 부호화 기법)

  • Do, Thinh Phu;Shin, Dongryul;Lee, Seong Ro;Jeong, Min-A;Kim, Yun Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.7
    • /
    • pp.566-572
    • /
    • 2014
  • We propose a two-way multi-hop relaying scheme improving the throughput as well as enlarging the coverage for ship-to-ship communications in multi-ship marine networks. The proposed scheme reduces the time slots required for the data exchange by designing data transmission and network coding procedures in a sophisticated way based on two-phase digital network coding. Simulation results show that the proposed two-way multi-hop relaying scheme improves the throughput of the conventional one about 5/3 times.

Performance Analysis of Available Superframe Size and Device Discovery Time for Multi-hop Communications in IEEE 802.15.3 High-rate WPAN Mesh Network (IEEE 802.15.3 고속 WPAN 메쉬 네트워크의 멀티-홉 통신을 위한 가용 슈퍼프레임 크기와 디바이스 탐색 성능 분석)

  • Jung, Ssang-Bong;Yim, Soon-Bin;Kim, Hyun-Ki;Lee, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6B
    • /
    • pp.350-357
    • /
    • 2007
  • The IEEE 802.15.3 high-rate WPAN has been developed to communicate with devices within l0m. A piconet consists of one Piconet Coordinator (PNC) and several devices. The devices associated with a parent piconet can become child PNCs in order to form child piconets. A mesh network made up of a parent piconet and several child piconets can support multi-hop communications. In this paper, we analyze the maximum level and the avaliable superframe size to make the best use of bandwidth for multi-hop communications, and compare the analysis with the simulation results in terms of time to discover devices for multi-hop communications. The average number of levels in mesh networks is shown to be about 1.9 when the number of devices increases within a fixed area. We have also shown that the maximum available superframe size is 52ms and the discovery time is approximately 155ms.

Tensor-Based Channel Estimation Approach for One-Way Multi-Hop Relaying Communications

  • Li, Shuangzhi;Mu, Xiaomin;Guo, Xin;Yang, Jing;Zhang, Jiankang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.12
    • /
    • pp.4967-4986
    • /
    • 2015
  • Multi-hop relaying communications have great potentials in improving transmission performance by deploying relay nodes. The benefit is critically dependent on the accuracy of the channel state information (CSI) of all the transmitting links. However, the CSI has to be estimated. In this paper, we investigate the channel estimation problem in one-way multi-hop MIMO amplify-and-forward (AF) relay system, where both the two-hop and three-hop communication link exist. Traditional point-to-point MIMO channel estimation methods will result in error propagation in estimating relay links, and separately tackling the channel estimation issue of each link will lose the gain as part of channel matrices involved in multiple communication links. In order to exploit all the available gains, we develop a novel channel estimation model by structuring different communication links using the PARAFAC and PARATUCK2 tensor analysis. Furthermore, a two-stage fitting algorithm is derived to estimate all the channel matrices involved in the communication process. In particular, essential uniqueness is further discussed. Simulation results demonstrate the advantage and effectiveness of the proposed channel estimator.

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.

MAC Protocol for Reliable Multicast over Multi-Hop Wireless Ad Hoc Networks

  • Kim, Sung-Won;Kim, Byung-Seo;Lee, In-Kyu
    • Journal of Communications and Networks
    • /
    • v.14 no.1
    • /
    • pp.63-74
    • /
    • 2012
  • Multicast data communication is an efficient communication scheme, especially inmulti-hop ad hoc networks where the media access control (MAC) layer is based on one-hop broadcast from one source to multiple receivers. Compared to unicast, multicast over a wireless channel should be able to deal with varying channel conditions of multiple users and user mobility to provide good quality to all users. IEEE 802.11 does not support reliable multicast owing to its inability to exchange request-to-send/clear-to-send and acknowledgement packets with multiple recipients. Thus, several MAC layer protocols have been proposed to provide reliable multicast. However, additional overhead is introduced, as a result, which degrades the system performance. In this paper, we propose an efficient wireless multicast MAC protocol with small control overhead required for reliable multicast in multi-hop wireless ad hoc networks. We present analytical formulations of the system throughput and delay associated with the overhead.

Throughput-Delay Analysis of One-to-ManyWireless Multi-Hop Flows based on Random Linear Network

  • Shang, Tao;Fan, Yong;Liu, Jianwei
    • Journal of Communications and Networks
    • /
    • v.15 no.4
    • /
    • pp.430-438
    • /
    • 2013
  • This paper addresses the issue of throughput-delay of one-to-many wireless multi-hop flows based on random linear network coding (RLNC). Existing research results have been focusing on the single-hop model which is not suitable for wireless multi-hop networks. In addition, the conditions of related system model are too idealistic. To address these limitations, we herein investigate the performance of a wireless multi-hop network, focusing on the one-to-many flows. Firstly, a system model with multi-hop delay was constructed; secondly, the transmission schemes of system model were gradually improved in terms of practical conditions such as limited queue length and asynchronous forwarding way; thirdly, the mean delay and the mean throughput were quantified in terms of coding window size K and number of destination nodes N for the wireless multi-hop transmission. Our findings show a clear relationship between the multi-hop transmission performance and the network coding parameters. This study results will contribute significantly to the evaluation and the optimization of network coding method.