• Title/Summary/Keyword: multi-hop communications

Search Result 243, Processing Time 0.027 seconds

A Study on Cluster Lifetime in Multi-HopWireless Sensor Networks with Cooperative MISO Scheme

  • Huang, Zheng;Okada, Hiraku;Kobayashi, Kentaro;Katayama, Masaaki
    • Journal of Communications and Networks
    • /
    • v.14 no.4
    • /
    • pp.443-450
    • /
    • 2012
  • As for cluster-based wireless sensor networks (WSNs), cluster lifetime is one of the most important subjects in recent researches. Besides reducing the energy consumptions of the clusters, it is necessary to make the clusters achieve equal lifetimes so that the whole network can survive longer. In this paper, we focus on the cluster lifetimes in multi-hop WSNs with cooperative multi-input single-output scheme. With a simplified model of multi-hop WSNs, we change the transmission schemes, the sizes and transmission distances of clusters to investigate their effects on the cluster lifetimes. Furthermore, linear and uniform data aggregations are considered in our model. As a result, we analyze the cluster lifetimes in different situations and discuss the requirements on the sizes and transmission distances of clusters for equal lifetimes.

A Performance Bound of Mu1ti-hop Mu1ti-Relay Wireless Communication Systems with Optimal Path Selection (다중-홉 다중-릴레이 무선 통신 시스템에서 최적 경로 선택 기법의 성능 한계)

  • Almuradov, Kamol;Park, Jin-Bae;Kim, Yun-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1C
    • /
    • pp.1-7
    • /
    • 2011
  • Recently, multi-hop relay transmission has drawn much attention owing to its advantage of coverage extension at low power consumption. In this paper, we derive a performance bound of multi-hop communication systems with multiple amplify-and-forward relays when the optimal path is selected. The bound is derived in generalized Nakagami fading channels with different parameters for each hop by applying the geometric mean bound to the path signal-to-noise ratio (SNR) and obtaining the moment generation function of the bound. It is shown that the bound based on the geometric mean is closer to the actual performance of optimal path selection when the fading effect is small.

Clustering and Communications Scheduling in WSNs using Mixed Integer Linear Programming

  • Avril, Francois;Bernard, Thibault;Bui, Alain;Sohier, Devan
    • Journal of Communications and Networks
    • /
    • v.16 no.4
    • /
    • pp.421-429
    • /
    • 2014
  • We consider the problem of scheduling communications in wireless sensor networks (WSNs) to ensure battery preservation through the use of the sleeping mode of sensors.We propose a communication protocol for 1-hop WSNs and extend it to multi-hop WSNs through the use of a 1-hop clustering algorithm.We propose to schedule communications in each cluster in a virtual communication ring so as to avoid collisions. Since clusters are cliques, only one sensor can speak or listen in a cluster at a time, and all sensors need to speak in each of their clusters at least once to realize the communication protocol. We model this situation as a mathematical program.

Energy-Aware System Lifetime Maximization Algorithm in Multi-Hop Sensor Network (멀티홉 센서 네트워크에서 에너지 상황을 고려한 시스템 수명 최대화 알고리즘)

  • Kim, Tae-Rim;Kim, Bum-Su;Park, Hwa-Kyu
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.8 no.6
    • /
    • pp.339-345
    • /
    • 2013
  • This paper addresses the system lifetime maximization algorithm in multi-hop sensor network system. A multi-hop sensor network consists of many battery-driven sensor nodes that collaborate with each other to gather, process, and communicate information using wireless communications. As sensor-driven applications become increasingly integrated into our lives, we propose a energy-aware scheme where each sensor node transmits informative data with adaptive data rate to minimize system energy consumption. We show the optimal data rate to maximize the system lifetime in terms of remaining system energy. Furthermore, the proposed algorithm experimentally shows longer system lifetime in comparison with greedy algorithm.

Analysis of Three-Phase Multiple Access with Continual Contention Resolution (TPMA-CCR) for Wireless Multi-Hop Ad Hoc Networks

  • Choi, Yeong-Yoon;Nosratinia, Aria
    • Journal of Communications and Networks
    • /
    • v.13 no.1
    • /
    • pp.43-49
    • /
    • 2011
  • In this paper, a new medium access control (MAC) protocol entitled three-phase multiple access with continual contention resolution (TPMA-CCR) is proposed for wireless multi-hop ad hoc networks. This work is motivated by the previously known three-phase multiple access (TPMA) scheme of Hou and Tsai [2] which is the suitable MAC protocol for clustering multi-hop ad hoc networks owing to its beneficial attributes such as easy collision detectible, anonymous acknowledgment (ACK), and simple signaling format for the broadcast-natured networks. The new TPMA-CCR is designed to let all contending nodes participate in contentions for a medium access more aggressively than the original TPMA and with continual resolving procedures as well. Through the systematical performance analysis of the suggested protocol, it is also shown that the maximum throughput of the new protocol is not only superior to the original TPMA, but also improves on the conventional slotted carrier sense multiple access (CSMA) under certain circumstances. Thus, in terms of performance, TPMA-CCR can provide an attractive alternative to other contention-based MAC protocols for multi-hop ad hoc networks.

Distributed Multi-Hop Relay Scheme to Reduce Delay-Constrained Broadcast Outage Probability (전달 시간 제한이 있는 브로드캐스트 아웃티지 확률을 감소시키는 분산적인 다중 홉 중계 기법)

  • Ko, Byung Hoon;Byun, Ilmu;Rhee, Duho;Jeon, Ki Jun;Kim, Beom Mu;Lee, Seong Ro;Kim, Kwang Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.2
    • /
    • pp.219-226
    • /
    • 2013
  • Distributed multi-hop relay scheme to reduce delay-constrained outage probability for broadcast network is proposed. We consider multi-hop relay scheme, which is similar to distributed beamforming, where multiple nodes simultaneously relay packets, and we propose channel access control and power control for relaying nodes to satisfy energy constraint. Compared with flooding which is multi-hop relay scheme used for ZigBee, the proposed scheme is better in terms of outage probability and average reception throughput.

Throughput and Delay of Single-Hop and Two-Hop Aeronautical Communication Networks

  • Wang, Yufeng;Erturk, Mustafa Cenk;Liu, Jinxing;Ra, In-ho;Sankar, Ravi;Morgera, Salvatore
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.58-66
    • /
    • 2015
  • Aeronautical communication networks (ACN) is an emerging concept in which aeronautical stations (AS) are considered as a part of multi-tier network for the future wireless communication system. An AS could be a commercial plane, helicopter, or any other low orbit station, i.e., Unmanned air vehicle, high altitude platform. The goal of ACN is to provide high throughput and cost effective communication network for aeronautical applications (i.e., Air traffic control (ATC), air traffic management (ATM) communications, and commercial in-flight Internet activities), and terrestrial networks by using aeronautical platforms as a backbone. In this paper, we investigate the issues about connectivity, throughput, and delay in ACN. First, topology of ACN is presented as a simple mobile ad hoc network and connectivity analysis is provided. Then, by using information obtained from connectivity analysis, we investigate two communication models, i.e., single-hop and two-hop, in which each source AS is communicating with its destination AS with or without the help of intermediate relay AS, respectively. In our throughput analysis, we use the method of finding the maximum number of concurrent successful transmissions to derive ACN throughput upper bounds for the two communication models. We conclude that the two-hop model achieves greater throughput scaling than the single-hop model for ACN and multi-hop models cannot achieve better throughput scaling than two-hop model. Furthermore, since delay issue is more salient in two-hop communication, we characterize the delay performance and derive the closed-form average end-to-end delay for the two-hop model. Finally, computer simulations are performed and it is shown that ACN is robust in terms of throughput and delay performances.

An Energy-Efficient Multi-Hop Scheme Based on Cooperative MIMO for Wireless Sensor Networks

  • Peng, Yu-Yang;Abn, Seong-Beom;Pan, Jae-Kyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9A
    • /
    • pp.796-800
    • /
    • 2011
  • An energy-efficient multi-hop scheme based on cooperative MIMO (multiple-input multiple-output) technique is proposed for wireless sensor networks, taking into consideration the modulation constellation size, transmission distance, and extra training overhead requirement. The scheme saves energy by selecting the hop length. In order to evaluate the performance of the proposed scheme, a detailed analysis of the energy and delay efficiencies in the proposed scheme compared with the equidistance scheme is presented. Results from numerical experiments indicate that by use of the proposed scheme significant savings in terms of total energy cousumption can be achieved.

Performance Analysis of Mobile Multi-hop Relay Uplink System in Multicell Environments (멀티셀 환경에서 Mobile Multi-hop Relay 상향링크 시스템의 성능 분석)

  • Kim, Seung-Yeon;Kim, Se-Jin;Lee, Hyong-Woo;Ryu, Seung-Wan;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4A
    • /
    • pp.394-400
    • /
    • 2010
  • Mobile Multi-hop Relaying (MMR) system can provide increased system capacity of wireless access network by coverage extension and enhanced transmission rate within the Base Station (BS) coverage area. The previous researches for the MMR system with a non-transparent mode Relay Station (RS) do not consider channel selection procedure of Mobile Station (MS), co-channel interference and Multi-hop Relay Base Station (MR-BS) coverage and RS coverage ratio in MMR system. In this paper, we investigate the performance of MMR uplink system in multicell environments with various topologies. The performance is presented in terms of call blocking probability, channel utilization, outage probability and system throughput by varying offered load. It is found that, for certain system parameters, the MMR uplink system achieve the maximum system throughput when MR-BS coverage to RS coverage ratio is 7.

Multi-Hop Clock Synchronization Based on Robust Reference Node Selection for Ship Ad-Hoc Network

  • Su, Xin;Hui, Bing;Chang, KyungHi
    • Journal of Communications and Networks
    • /
    • v.18 no.1
    • /
    • pp.65-74
    • /
    • 2016
  • Ship ad-hoc network (SANET) extends the coverage of the maritime communication among ships with the reduced cost. To fulfill the growing demands of real-time services, the SANET requires an efficient clock time synchronization algorithm which has not been carefully investigated under the ad-hoc maritime environment. This is mainly because the conventional algorithms only suggest to decrease the beacon collision probability that diminishes the clock drift among the units. However, the SANET is a very large-scale network in terms of geographic scope, e.g., with 100 km coverage. The key factor to affect the synchronization performance is the signal propagation delay, which has not being carefully considered in the existing algorithms. Therefore, it requires a robust multi-hop synchronization algorithm to support the communication among hundreds of the ships under the maritime environment. The proposed algorithm has to face and overcome several challenges, i.e., physical clock, e.g., coordinated universal time (UTC)/global positioning system (GPS) unavailable due to the atrocious weather, network link stability, and large propagation delay in the SANET. In this paper, we propose a logical clock synchronization algorithm with multi-hop function for the SANET, namely multi-hop clock synchronization for SANET (MCSS). It works in an ad-hoc manner in case of no UTC/GPS being available, and the multi-hop function makes sure the link stability of the network. For the proposed MCSS, the synchronization time reference nodes (STRNs) are efficiently selected by considering the propagation delay, and the beacon collision can be decreased by the combination of adaptive timing synchronization procedure (ATSP) with the proposed STRN selection procedure. Based on the simulation results, we finalize the multi-hop frame structure of the SANET by considering the clock synchronization, where the physical layer parameters are contrived to meet the requirements of target applications.