• 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.

• 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.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1593-1608
• /
• 2009

If a certain relay node in multi-hop wireless networks might become a malicious node that does not cooperate with other nodes or a selfish node, network throughput will be dramatically decreased. Most of existing ad hoc routing protocols assuming that the nodes will fully cooperate with other nodes do not resolve the problem of network performance degradation due to malicious and selfish nodes. This paper presents the CARE (Cooperative Ad hoc routing protocol based REputation) scheme incorporating the reputation management that can achieve a multi-hop wireless network with high throughput performance. The proposed scheme provides the horizontal cross-layer approach which can identify misbehaving malicious, selfish nodes dropped out of the hop-by-hop based packet processing in the network and then set up an optimal packet routing path that will detour misbehaving nodes. And the vertical cross-layer approach contained in the CARE scheme attempts to improve the quality of routing paths by exploiting the quality of link information received from the MAC layer. Besides, it provides high TCP throughput by exploiting the reputation values of nodes acquired from the network layer into the transport layer. A case study on experiments and simulations shows that the CARE scheme incorporating vertical and horizontal cross-layer approaches yields better performance in terms of the low rate of packet loss, fast average packet delivery time, and high TCP throughput between end-to-end nodes.

• 한국IT서비스학회:학술대회논문집
• /
• 2010.05a
• /
• pp.207-210
• /
• 2010

무선 센서 네트워크 시스템을 이용한 많은 응용 시스템이 연구되고 있는 가운데, 최근 무선 센서 네트워크 시스템의 신뢰성 확보에 대한 문제점이 대두되었다. 이러한 문제점을 해결하기 위하여 영상 데이터를 전송함으로써 보다 신뢰성 있는 정보를 제공할 수 있는 멀티미디어 센서 네트워크에 대한 연구가 활발히 진행되고 있다. 그러나 영상 데이터를 저속의 멀티 홉 무선 센서 네트워크 환경에서 효율적으로 전송하는 프로토콜에 관련된 연구는 비교적 많지 않다. 지금까지의 통신 프로토콜들은 비교적 단순한 센싱 데이터를 전송할 수 있도록 설계되었으며, 새로운 응용들을 지원하기 위해서는 새로운 통신 프로토콜이 필요하다. 따라서 본 논문에서는 연속적인 영상 데이터를 멀티 홉 환경에서 효율적으로 전송할 수 있는 다중 경로 간 간섭이 없는 간섭 회피 다중 경로 설정 기법을 제안한다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.114-121
• /
• 2008

Multi-path routing has been studied widely in wired networks. Multi-path routing is known to increase end-to-end throughput and provide load balancing in wired networks. However, its advantage is not obvious in wireless multi-hop network because the traffic along the multiple paths may interfere with adjacent paths. In the paper, we introduce a new multi-path routing scheme, Cluster-Based Multi-Path Routing for multi-hop wireless networks. The main idea of the proposed routing scheme is to extend the hop-by-hop multi-path to a cluster-by-cluster multi-path. In cluster network, each cluster can work independently from other clusters and hence reduce interference. The purpose of the proposed scheme is to find a less interfering path for wireless multi-hop networks. We also showed the throughput improvement of the proposed scheme through simulations.

• 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.

• 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.

• 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.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.237-239
• /
• 2011

본 논문에서는 클러스터 기반 다중 홉 무선 네트워크에서 중계기 협력 ARQ 를 이용한 기회적 중계 기법을 제안한다. 클러스터 간 통신 시 성능을 열악하게 만들 수 있는 채널 페이딩 효과를 줄이기 위하여 각 클러스터 간 통신에 중계기를 이용한 협력 통신을 적용한다. 또한 다중 홉 통신에서는 중간 홉에서 오류가 발생할 경우 전송 도중 정보를 잃게 되는 전송 실패의 가능성이 존재한다. 따라서 전송 실패의 가능성을 줄이기 위하여 중계기로부터 재전송을 받을 수 있는 중계기 협력 ARQ 기법을 적용한다. 본 논문에서는 제안한 기법에 대한 전송 실패 확률을 분석한다. 그리고 모의 실험에서는 제안한 기법이 ARQ 를 사용하지 않은 기법과 성능 비교하여 신뢰도 측면에서 더 좋은 성능을 보임을 확인한다.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.292-300
• /
• 2008

In multi-hop wireless networks like Wireless Mesh Networks (WMN) and Wireless Sensor Networks (WSN), nodes often rely on batteries as their power source. In such cases, energy efficient routing is critical. Many schemes have been proposed to find the most energy efficient path, but most of them do not achieve optimality on network lifetime. Once found, the energy efficient path is constantly used such that the energy of the nodes on the path is depleted quickly. As an alternative, the approaches that dynamically change the path at run time have also been proposed. These approaches, however, involve high overhead of establishing multiple paths. In this paper, we first find an optimal multi-path routing using LP. Then we apply an approximation algorithm to derive a near-optimal solution for single-path routing. We compare the performance of the proposed scheme with several other existing algorithms through simulation.