• Title/Summary/Keyword: 다중 홉 네트워크

Search Result 203, Processing Time 0.027 seconds

Performance Analysis of Adaptive Modulation Based Incremental Hop Selection Scheme for Multi-Hop Networks (다중 홉 네트워크를 위한 적응 변조 기반 증분형 홉 선택 기법의 성능 분석)

  • Lee, Bumsoo;Kim, Dohoon;Lee, Chungyong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.11
    • /
    • pp.21-27
    • /
    • 2013
  • This paper proposes an adaptive modulation based incremental hop selection scheme which improves network coverage in half-duplex multi-hop networks. The proposed scheme guarantees wide coverage through the operation of multi-hop network while preventing spectral efficiency loss due to the usage of multiple time phases in the half-duplex protocol. Also, we evaluate the average spectral efficiency performance over Nakagami-m fading channel. The simulation results show that the proposed scheme outperforms the existing schemes and the derived evaluation is valid.

Route minimizing in multi-hop ad hoc network adopted IEEE 802.11 PSM (IEEE 802.11 PSM을 적용한 다중 홉 ad-hoc 네트워크에서 우회경로의 최소화)

  • Hwang, Do-Hyun;Kim, Sung-Chun
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.31-33
    • /
    • 2005
  • 이동 ad-hoc 네트워크는 기반 망의 도움 없이 모바일 노드들로만 구성되어진 임시적인 네트워크이다. ad-hoc 네트워크를 구성한 모바일 노드들은 지속적인 전원공급이 힘들기 때문에 자신의 한정된 에너지에 의존한다. 이러한 모바일 노드의 에너지 소비를 줄이기 위해 IEEE 802.11 PSM를 적용한 다중 홉 ad-hoc 네트워크 모델에 대해서 최근 많은 연구가 이루어졌다. 다중 홉 ad-hoc 네트워크에 802.11 PSM을 적용하면 송수신에 참여하지 않는 모바일 노드들의 에너지소비를 절약하게 되어 네트워크 활동시간을 증가시키게 된다.

  • PDF

An Efficient Mobility Support Scheme based Multi-hop ARP in Wireless Mesh Networks (무선메쉬 네트워크 환경에서 다중홉 ARP 기반의 효율적인 이동성 지원)

  • Jeon, Seung-Heub;Cho, Young-Bok;Lee, Sang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.11
    • /
    • pp.91-96
    • /
    • 2009
  • In this paper, interoperability in heterogeneous wireless mesh network, and mesh nodes for providing efficient IP mobility technique offers multi-hop ARP. Heterogeneous wireless mesh networks to MANETs based on a wireless mesh network backbone and non-MANET architecture is based on a client wireless mesh network and the two mobile networks, combined with a hybrid wireless mesh network are separate. In two different hybrid wireless mesh network routing protocols used to connect the two protocols in the protocol conversion at the gateway to parallel processing problems seriously overload occurs. All of the network reliability and stability are factors that reduce. Therefore, for efficient integration with L3 routing protocols, design techniques to build ARP multi-hop go through the experiment to increase the number of mesh nodes, the packet forwarding rate and an increased hop number of the node was to ensure reliability and stability.

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.

Dynamic-size Multi-hop Clustering Mechanism based on the Distance in Sensor Networks (센서 네트워크에서의 거리에 따른 동적 크기 다중홉 클러스터링 방법)

  • Ahn, Sang-Hyun;Lim, Yu-Jin
    • The KIPS Transactions:PartC
    • /
    • v.14C no.6
    • /
    • pp.519-524
    • /
    • 2007
  • One of the most important issues on the sensor network with resource limited sensor nodes is prolonging the network lifetime by effectively utilizing the limited node energy. The most representative mechanism to achieve a long lived sensor network is the clustering mechanism which can be further classified into the single hop mode and the multi hop mode. The single hop mode requires that all sensor nodes in a cluster communicate directly with the cluster head(CH) via single hop md, in the multi hop mode, sensor nodes communicate with the CH with the help of other Intermediate nodes. One of the most critical factors that impact on the performance of the existing multi hop clustering mechanism is the cluster size and, without the assumption on the uniform node distribution, finding out the best cluster size is intractable. Since sensor nodes in a real sensor network are distributed non uniformly, the fixed size mechanism may not work best for real sensor networks. Therefore, in this paper, we propose a new dynamic size multi hop clustering mechanism in which the cluster size is determined according to the distance from the sink to relieve the traffic passing through the CHs near the sink. We show that our proposed scheme outperforms the existing fixed size clustering mechanisms by carrying out numerical analysis and simulations.

Effect of Random Node Distribution on the Throughput in Infrastructure-Supported Erasure Networks (인프라구조 도움을 받는 소거 네트워크에서 용량에 대한 랜덤 노드 분포의 효과)

  • Shin, Won-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.5
    • /
    • pp.911-916
    • /
    • 2016
  • The nearest-neighbor multihop routing with/without infrastructure support is known to achieve the optimal capacity scaling in a large packet-erasure network in which multiple wireless nodes and relay stations are regularly placed and packets are erased with a certain probability. In this paper, a throughput scaling law is shown for an infrastructure-supported erasure network where wireless nodes are randomly distributed, which is a more feasible scenario. We use an exponential decay model to suitably model an erasure probability. To achieve high throughput in hybrid random erasure networks, the multihop routing via highway using the percolation theory is proposed and the corresponding throughput scaling is derived. As a main result, the proposed percolation highway based routing scheme achieves the same throughput scaling as the nearest-neighbor multihop case in hybrid regular erasure networks. That is, it is shown that no performance loss occurs even when nodes are randomly distributed.

A Control Channel Access Scheme for Clustered Multi-interface Multi-hop Cognitive Radio Networks (클러스터 형태의 다중 인터페이스 다중 홉 인지 라디오 네트워크를 위한 제어 채널 접근 기법)

  • Lee, Ji-Wun;Jeon, Wha-Sook;Jeong, Dong-Geun
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.4
    • /
    • pp.301-306
    • /
    • 2010
  • We propose the control channel access scheme for multi-interface multi-hop cognitive radio (CR) environment having a cluster structure. Due to the difficulty of obtaining common channels across the entire CR network, most multi-interface multi-hop CR networks put the control channel outside the CR bandwidth and dedicate one network interface to it in order to exchange the control information such as the activation of licensed users. However, this will be the waste of the network interface. Our focus is how to alternate between the control and the data channel without multichannel hidden node problem under the cluster structure where CR nodes connect with neighbors through multiple data channels. By using simulation, we evaluate the performance of the proposed scheme. The results show that the proposed scheme achieves higher network throughput than the dedicated scheme where one network interface card should dedicate to the control channel and cannot be used for data transmission.

Performance Evaluation of Wireless Network based on Mobile Multi-hop (모바일 다중 홉 기반의 무선 네트워크의 성능 평가)

  • Roh, Jae-Sung;Kim, Wan-Tae
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.6
    • /
    • pp.634-639
    • /
    • 2008
  • In mobile communication networks, the main power consumption is due to the actual transmissions power. Therefore, power efficiency network structures have gained considerable importance in mobile multi-hop systems and networks in recent years. In this paper, the performance of mobile multi-hop wireless system with M-QAM signal and forward error control (FEC) technique are analyzed The FEC technique uses extra processing power related to encoding and decoding, it is need complex functions to be built into the communication node. The probability of receiving a correct bit and codeword for relaying a data frame over h hop relay station to the final station is evaluated as a function of channel parameter and number of hops, and the distance between the different station.

  • PDF

Partial multipath routing Protocol for multi-hop mesh network (멀티홉 메쉬 네트워크를 위한 부분다중경로 라우팅프로토콜)

  • Lee, Kang-Gun;Park, Hyung-Kun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.598-599
    • /
    • 2015
  • For the wireless mesh networks, efficient routing protocol is required to transmit data from source to destination node through multi-hop transmission. Multipath routing enable the stable data transmission even in the case of traffic congestion or unstable link. In this paper, we propose partial multipath routing which does not make a full multipath but partial for some parts of unstable links. This partial multipath routing reduce the number of nodes for routing and minimized the required power.

  • PDF

Partial Multipath Routing Scheme to avoid interpath interference in Wireless Multimedia Sensor Networks (무선 멀티미디어 센서 네트워크에서 경로간 간섭회피를 위한 부분 다중경로 라우팅 기법)

  • Lee, Kang-Gun;Park, Hyung-Kun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.8
    • /
    • pp.1917-1924
    • /
    • 2015
  • Efficient routing algorithm is required to transmit data from source to destination by multi-hop transmission in wireless sensor networks. In the multi-hop transmission, multipath routing can be one of the solutions to cope with the traffic congestion and unstable link condition. In this paper, we propose partial multipath routing which does not establish a secondary full routing path but a partial multipath to complement some poor links, and it can enable stable data transmission and reduce the number of nodes in routing path and the required total power compared with conventional multipath routing.