• Title/Summary/Keyword: 멀티홉 통신

Search Result 241, Processing Time 0.021 seconds

Energy Efficiency of Cooperative Routing with EGC Over Rayleigh Fading Channel (레일리 페이딩 채널을 통해 결합된 등가 이득 협력 라우팅의 에너지 효율)

  • Kong, Hyung-Yun;Tran, Truc Thanh
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.5
    • /
    • pp.65-70
    • /
    • 2013
  • In this paper, we propose a multi-hop cooperative transmission protocol to obtain energy savings in static wireless networks. Each terminal in the network is equipped with a single antenna and each receiver uses equal gain combining technique (EGC) to combine received signals. We also propose a power allocation strategy which optimizes the total transmit power at each stage. Monte-Carlo simulations are presented to evaluate and compare performance of the proposed protocol with the multi-hop direct transmission (MDT) and the cooperative routing protocol proposed by Khadani [8], in terms of the average total transmit power and the average number of required stages.

Load Balancing Scheme in the MANET with Multiple Internet Gateways (다중 인터넷 게이트웨이를 갖는 MANET에서의 부하균등화 기법)

  • Kim Youngmin;Yu Hyun;Ahn Sanghyun;Lim Yujin
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.304-306
    • /
    • 2005
  • 이동 애드혹 네트워크(Mobile Ad Hoc Network: MANET)는 유선 인프라 없이 구축된 무선 네트워크로 멀티 홉 통신을 수행할 수 있다. 인터넷 노드와 통신하고자 하는 MANET 노드에게 인터넷 연결을 가능하게 하는 방법이 요구되며 인터넷 연결은 인터넷과 MANET을 중계하는 인터넷 게이트웨이를 통해 지원된다. 게이트웨이들 간의 부하를 잘 분배한다면 네트워크 성능 향상을 얻을 수 있으므로, MANET 내에 여러 개의 인터넷 게이트웨이가 존재할 경우 이들 간의 부하균등화는 중요한 이슈이다. 본 연구에서는 부하균등화 기법을 제어 메시지의 플러딩 방법과 인터넷 게이트웨이를 선택하는 주체에 따라 4가지로 분류하며, 부하균등화 문제를 해결하기 위한 새로운 메트릭(metric)을 제안한다. 시뮬레이션을 통하여 홉 수와 라우팅 엔트리의 수를 메트릭으로 이용하는 새로운 기법의 성능이 기존 기법에 비하여 향상되었음을 보인다.

  • PDF

Multi-Hop MAC Protocol for Wireless Sensor Networks (센서 네트워크를 위한 멀티 홉 MAC 프로토콜)

  • Cho, Kyong-Tak;Bahk, Sae-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.6A
    • /
    • pp.506-514
    • /
    • 2009
  • To minimize energy consumption, most of MAC Protocols in WSNs exploit low duty cycling. Among those, RMAC [4] allows a node to transmit a data packet for multiple hops in a single duty cycle, which is made possible by exploiting a control frame named Pioneer (PION) in setting up the path. In this paper, we present a MAC Protocol called Hop Extended MAC (HE-MAC) that transmits the data packet for more multiple hops in a single duty cycle. It employs an EXP (Explorer) frame to set up the multiple hop transmission, which contains the information of the maximum hop that a packet can be transmitted. With the use of the information in EXP and an internal state of Ready to Receive (RTR), HEMAC extends the relay of the packet beyond the termination of the data period by two more hops compared to RMAC. Along with our proposed adaptive sleeping method, it also reduces power consumption and handles heavy traffic efficiently without experiencing packet inversion observed in RMAC. We analytically obtain the packet delivery latency in HE-MAC and evaluate the performance through ns-2 simulations. Compared to RMAC, HE-MAC achieves 14% less power consumption and 20% less packet delay on average for a random topology of 300 nodes.

Multi-Hop Cooperative Communications using Multi-Relays in IEEE 802.11 (IEEE 802.11에서 다중 릴레이를 이용한 멀티홉 방식 협력 무선통신)

  • Lee, Sook-Hyoun;Lee, Tae-Jin
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.6
    • /
    • pp.528-535
    • /
    • 2009
  • This paper proposes a mechanism to increase performance using cooperative communications in IEEE 802.11 environment. Existing algorithms use one relay between a source and a destination, which is a 2 hop relay. The proposed algorithm utilizes more than one relay to complement inefficiency of using one relay. In the proposed mechanism, an AP manages network information (rate), which is used to select relays of a source by the AP. The AP notifies the selected relays to the source and neighbor nodes, and the source transmits data to the relays for cooperative communications. Moreover, relays are given to have an opportunity to send its own data right after relaying the source's data. So relays are compensated for the power to send the source's data and overall throughput is improved.

Query Technique for Quick Network Routing changing of Mobility Sensor Node in Healthcare System (헬스케어 시스템에서 이동형 센서노드의 신속한 네트워크 라우팅 변화를 위한 질의기법)

  • Lee, Seung-chul;Kwon, Tae-Ha;Chung, Wan-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.517-520
    • /
    • 2009
  • Healthcare application system has been actively researched to apply WSN technology to healthcare area with a mobile sensor node of low cost, low power, and small size. Sensor node has the problem for transmission range of RF power and time delay of the wireless routing connectivity between sensor nodes. In this paper, we proposes a new method utilizing mobile sensor nodes with relay sensor nodes for quick network routing changing using query technique in healthcare system. A query processor to control and manage the routing changing of sensor nodes in a wireless sensor network was designed and implemented. The user's PC transmits the beacon message which will change the quick link routing according to activity status of patient in wireless sensor network. We describe the implementation for query protocol that is very effective of power saving between sensor nodes.

  • PDF

A Unified Framework for Joint Optimal Design of Subchannel Matching and Power Allocation in Multi-hop Relay Network (멀티홉 중계 네트워크에서 최적 부채널 및 전력 할당을 위한 통합적 접근법)

  • Jang, Seung-Hun;Kim, Dong-Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7A
    • /
    • pp.646-653
    • /
    • 2010
  • This paper provides a unified framework for the joint optimal subchannel and power allocation in multi-hop relay network, where each node in the network has multiple parallel subchannels such as in OFDM or MIMO system. When there are multiple parallel subchannels between nodes, the relay node decides how to match the subchannel at the first hop with the one at the second hop aside from determining the power allocation. Joint optimal design of subchannel matching and power allocation is, in general, known to be very difficult to solve due to the combinatorial nature involved in subchannel matching. Despite this difficulty, we use a simple rearrangement inequality and show that seemingly difficult problems can be efficiently solved. This includes several existing solution methods as special cases. We also provide various design examples to show the effectiveness of the proposed framework.

Multihop Transmission in Cognitive Underlay Network Over Rayleigh Fading Channels (레일리 페이딩 채널에서 이상 인지 언더레이 네트워크 멀티 홉 전송)

  • Park, Sang-Young;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.6
    • /
    • pp.291-296
    • /
    • 2012
  • In this Paper, we propose a multi-hop transmission in cognitive underlay network. In Secondary network, We assume that a secondary source S attempts to transmit D its signal to a secondary destination via N+1 hops with help of N relays $R_1$, $R_2$, ${\ldots}$, $R_N$. At hop k between relay $R_k$ and relay $R_{k+1}$. we assume that there is a primary user $PU_k$. In this paper, we assume that these channels are Rayleigh fading channels. In underlay network, the secondary transmitter has to adapt its power so that the interference caused at the primary user is less than a maximum interference threshold. considering the hop transmission between the transmitter and the repeater, we find transmit power and signal-to-noise ratio(SNR). Between the transmitter from the receiver depending on the number of relay in the underlay network, we compared to find the transmit power and signal-to-noise ratio(SNR). Finally we find optimal number of relay and optimal threshold value.

Every-other-row-connecting bilayered shufflenet for WDM multihop lighwave networks (WDM 멀티홉 광 통신망을 위한 하나 걸른 행과 연결된 이중층 셔플넷 토폴로지)

  • 지윤규;심현정
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.5
    • /
    • pp.1064-1074
    • /
    • 1997
  • In this paper we propose an every-other-row-connecting bilayered ShuffkeNet for optical WDM(wavelength division multiplexing) multihop networks. We calculate the diameter and the average number of hops of the proposed every-other-row-connecting bilayered ShuffleNet. Using the result, we also calcuate throughputs and delays of the proposed topology, which show higher efficiencies compared to the conventional ShuffleNet, the bilayered ShuffleNet and asymmetric bilayered ShuffleNet.

  • PDF

ECMA-392 Cooperative MAC Protocol for QoS Guarantee in Multi-Hop Wireless Bridge in Ship Area (선박 내 멀티 홉 무선 브릿지에서 QoS 보장을 위한 ECMA-392 협력 MAC 프로토콜)

  • Lee, Seung Beom;Jeong, Hwan-Jong;Jeong, Min-A;Lee, Yeonwoo;Lee, Seong Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.12
    • /
    • pp.1289-1297
    • /
    • 2014
  • In this paper, we use the ECMA-392 standard, the first cognitive radio networks to meet the demand for IT services in the ship. We propose a ECMA-392 cooperative MAC protocol to ensure QoS to support multimedia services in the ship area in a multi-hop wireless bridge using ECMA-392 networks. Because the proposed protocol transmits directly or relay transmission by selecting efficient routes based on the information of the ECMA-392 devices, it provides communication to ensure QoS of the device. The simulation results show that the proposed cooperative MAC protocol improves a throughput of devices compared to the existing method.

k-hop Flooding-based Multicast Considering the Limited Mobility of Mobile Nodes and Intermittent Disconnection (노드의 제한적 이동성과 간헐적인 연결 단절을 고려한 k-홉 플러딩 기반 멀티캐스트)

  • Im, Kwang-Bin;Kang, Kyung-Ran;Cho, Young-Jong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.6A
    • /
    • pp.600-610
    • /
    • 2010
  • In this paper, a multicast mechanism is proposed for intermittently disconnected networks where the nodes move forward in formation or within a limited area. The proposed scheme extends the well-known tree-based multicast routing mechanism called MAODV by modifying the tree construction and data delivery scheme. Especially, an algorithm is introduced which determines the flooding hop count k estimating the degree of the movement of children in the tree. The performance evaluation was done by the simulation and the proposed scheme was compared with MAODV and two multicast routing schemes for DTN (Disruption Tolerant Network) including the Epidemic routing and ST-multicast. The evaluation results show that our scheme improves the original MAODV from the aspect of tree reconstruction events and message delivery ratio. Compared with the Epidemic routing scheme, our scheme achieves 85% message delivery ratio with less than 50% message delivery overhead.