• Title/Summary/Keyword: multi-hop transmission

Search Result 269, Processing Time 0.026 seconds

Enhanced Multi-Hop Routing Protocol using RSS in Sensor Network (센서 네트워크에서의 RSS(Received Signal Strength)를 이용한 향상된 멀티-홉 라우팅 프로토콜)

  • Lee, Min-Goo;Kang, Jung-Hoon;Yoo, Jun-Jae;Yoon, Myung-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 2005.05a
    • /
    • pp.206-208
    • /
    • 2005
  • Wireless sensor network's value has increased greatly in recent years in the fields of Ubiquitous Computing that function as solution to reduce both the limitation and collision about RFID Technology. The research for wireless sensor network technology is proceeding with the research for various sensor nodes, powerful routing algorithms, securities for data transmission, and valid applications. This paper suggests that we make the new multi-hop routing algorithm using RSS in order to implement enhanced multi-hop routing algorithm. This paper should demonstrate that the routing algorithm using suggested RSS is superior to routing algorithm based on established BSDV(Destination Sequenced Distance Vector).

  • PDF

Performance Analysis of Multi-Hop Decode-and-Forward Relaying with Selection Combining

  • Bao, Vo Nguyen Quoe;Kong, Hyung-Yun
    • Journal of Communications and Networks
    • /
    • v.12 no.6
    • /
    • pp.616-623
    • /
    • 2010
  • In this paper, exact closed-form expressions for outage probability and bit error probability (BEP) are presented for multi-hop decode-and-forward (DF) relaying schemes in conjunction with cooperative diversity, in which selection combining technique is employed at each node. We have shown that the proposed protocol offers remarkable diversity advantage over direct transmission as well as the conventional DF relaying schemes with the same combining technique. We then investigate the system performance when different diversity schemes are employed. It has been observed that the system performance loss due to selection combining relative to maximal ratio combining is not significant. Simulations are performed to confirm our theoretical analysis.

Ad-hoc based Multiple Access Scheme for VHF Oceanic Network (VHF 대양 네트워크를 위한 Ad-hoc 기반 다중접속기법)

  • Koo, Jayeul;Baek, Hoki;Lim, Jaesung
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.21 no.1
    • /
    • pp.15-22
    • /
    • 2013
  • In oceanic flight routes, HF radio and satellite data links have weather restrictions, long propagation delay and low data throughput. In this paper, we propose oceanic aeronautical communications scheme in the VHF band based on ad-hoc communication. The proposed scheme organizes autonomously a multi-hop network that is divided into multiple local network using aircraft to fly long-distance communication and supports a hybrid type of multiple access, which consists of random access and TDMA (Time Division Multiple Access) scheme. In addition, several algorithms to apply spatial reuse of transmission to multi-hop long range communication environments have been proposed. The proposed system proves performance improvement on delay time as an effective solution to communicate end-to-end on the oceanic flight routes and strengthens the reliability of oceanic aeronautical communication.

Power Performance Comparison using Dimming in the Indoor Multi-hop VLC Environment (실내 멀티홉 VLC환경에서 디밍을 적용한 파워 성능 비교)

  • Kim, Joo-Seok;Lee, Min-Jung;Kim, Kyung-Seok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.5
    • /
    • pp.71-78
    • /
    • 2017
  • Visible light communication (VLC) offers communication function in addition to illumination. Because the signal communication capacity per cable is 1,000 times compared to the power line communication (PLC), optical fiber is being advertised as the basis of the information and communication. Also dimming control of LED is an important component needed to provide energy savings and quality of life. This study configured multi-hop VLC system model in a building using optical fiber and analyzed the power performance of two of modulations using dimming techniques. The transmission power and received power were used to compare the power performance in multi-hop VLC environments.

Modeling and Analyzing Per-flow Throughput in IEEE 802.11 Multi-hop Ad Hoc Networks

  • Lei, Lei;Zhao, Xinru;Cai, Shengsuo;Song, Xiaoqin;Zhang, Ting
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4825-4847
    • /
    • 2016
  • In this paper, we focus on the per-flow throughput analysis of IEEE 802.11 multi-hop ad hoc networks. The importance of an accurate saturation throughput model lies in establishing the theoretical foundation for effective protocol performance improvements. We argue that the challenge in modeling the per-flow throughput in IEEE 802.11 multi-hop ad hoc networks lies in the analysis of the freezing process and probability of collisions. We first classify collisions occurring in the whole transmission process into instantaneous collisions and persistent collisions. Then we present a four-dimensional Markov chain model based on the notion of the fixed length channel slot to model the Binary Exponential Backoff (BEB) algorithm performed by a tagged node. We further adopt a continuous time Markov model to analyze the freezing process. Through an iterative way, we derive the per-flow throughput of the network. Finally, we validate the accuracy of our model by comparing the analytical results with that obtained by simulations.

MIMO Two-way Cooperative Relay to Improve End to End Capacity in Non-equidistant Topology

  • Niyizamwiyitira, Christine;Kang, Chul-Gyu;Oh, Chang-Heon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.465-467
    • /
    • 2010
  • This paper proposes MIMO two-way cooperative relay scheme to optimize the end to end capacity in wireless multi-hop mesh network. The basic idea is to perform data transmission via multi-hop relay nodes, in equidistant topology, this method is quite efficient. However, on one hand this topology is very rare in practical situation, on the other hand, in real practical situation where the topology is most likely non equidistant, the end to end capacity significantly degrades due to bottleneck link caused by uneven SNR. Moreover, the end to end capacity degrades at high SNR due to overreach interference from far nodes existing in multi-hop relay networks. In this paper, MIMO two-way cooperative relay in the region of non equidistant nodes is found efficient to improve the end to end capacity. The proposed scheme is validated using numerical simulation.

  • PDF

A Hierarchical Multicast Routing Protocol based on Zone Routing Technique for Wireless multi-hop Network (무선 다중 홉 네트워크에서의 지역 기반의 계층적 멀티캐스트 라우팅 프로토콜)

  • Gui, Yi-Qi;Zhang, Jie;Yang, Dong-Il
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.3
    • /
    • pp.149-156
    • /
    • 2011
  • In wireless multi-hop network, many applications need multicast communication where the group leader needs to send data to all members of the group. Multicast routing provides a balanced, efficient, and fairness network environment for the group members. However, large load for transmission management to leader node and signal interference between several paths for multi-hop links always took long transmission delay and low throughput efficiency. In this paper, we propose a Zone-based Hierarchical Multicast Routing Protocol (ZHMP). This routing protocol is designed based on zone routing schemes, where proactive routing is applied for intra-zone node level multicasting and reactive routing is used for searching inter-zone paths. By each hierarchical and independent multicast working in separated zones, load of multicast source node will be distributed by several zone-level routings for a better load balance and signal interference between each multi-hop paths will be resisted for a maximum multicast throughput.

An Analysis of Energy Efficient Cluster Ratio for Hierarchical Wireless Sensor Networks (계층적 센서네트워크에서 에너지 효율성을 위한 최적의 클러스터 비율 분석)

  • Jin, Zilong;Kim, Dae-Young;Cho, Jinsung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.6
    • /
    • pp.446-453
    • /
    • 2013
  • Clustering schemes have been adopted as an efficient solution to prolong network lifetime and improve network scalability. In such clustering schemes cluster ratio is represented by the rate of the number of cluster heads and the number of total nodes, and affects the performance of clustering schemes. In this paper, we mathematically analyze an optimal clustering ratio in wireless sensor networks. We consider a multi-hop to one-hop transmission case and aim to provide the optimal cluster ratio to minimize the system hop-count and maximize packet reception ratio between nodes. We examine its performance through a set of simulations. The simulation results show that the proposed optimal cluster ratio effectively reduce transmission count and enhance energy efficiency in wireless sensor networks.

A Dynamic Resource Allocation scheme with a GPS algorithm in Cellular-based Hybrid and Distributed Wireless Multi-hop Systems (셀룰라 기반의 하이브리드 분산식 멀티홉 시스템에서의 GPS 알고리즘을 이용한 동적 자원할당 기법)

  • Bae, Byung-Joo;Kim, Dong-Kun;Shin, Bong-Jhin;Kang, Byoung-Ik;Hong, Dae-Hyoung;Choe, Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.11A
    • /
    • pp.1120-1127
    • /
    • 2007
  • In this paper, we propose a generalized processor sharing - dynamic resource allocation (GPS-DRA) scheme which allocates the required amount of resources to each hop dynamically in cellular-based multi-hop systems. In the hybrid-distributed system considered in this paper, a central controller such as a base station (BS) should allocate resources properly to each hop. However, due to changing channel condition with time, it is difficult to allocate as much amount of resources as each hop needs for transmission. GPS-DRA scheme allocates the required amount of resources dynamically to each hop based on the amount of resources used in previous frames by each hop. The amount of control overhead generated by GPS-DRA scheme can be very small because a central controller doesn't need to collect all link information for resource allocation. Our simulation results show that channel utilization increased about 16% and cell capacity increased about 65% compared to those of fixed resource allocation (FRA) scheme.

New Contention Window Control Algorithm for TCP Performance Enhancement in IEEE 802.11 based Wireless Multi-hop Networks (IEEE 802.11 기반 무선 멀티홉 망에서 TCP의 성능향상을 위한 새로운 경쟁 윈도우 제어 알고리즘)

  • Gi In-Huh;Lee Gi-Ra;Lee Jae-Yong;Kim Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.9 s.351
    • /
    • pp.165-174
    • /
    • 2006
  • In this paper, we propose a new contention window control algorithm to increase TCP performance in wireless multi-hop networks. The new contention window control algorithm is suggested to reduce the hidden and exposed terminal problems of wireless multi-hop networks. Most of packet drops in wireless multi-hop networks results from hidden and exposed terminal problems, not from collisions. However, in normal DCF algorithm a failed user increases its contention window exponentially, thus it reduces the success probability of fined nodes. This phenomenon causes burst data transmissions in a particular node that already was successful in packet transmission, because the success probability increases due to short contention window. However, other nodes that fail to transmit packet data until maximum retransmission attempts try to set up new routing path configuration in network layer, which cause TCP performance degradation and restrain seamless data transmission. To solve these problems, the proposed algorithm increases the number of back-of retransmissions to increase the success probability of MAC transmission, and fixes the contention window at a predetermined value. By using ns-2 simulation for the chain and grid topology, we show that the proposed algorithm enhances the TCP performance.