• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.11
• /
• pp.1550-1553
• /
• 2020

In this paper, we maximize the lifetime of a multi-hop path through a cooperative wireless energy sharing scheme between constituent nodes in a wireless multi-hop communication. Considering a bidirectional multi-hop communication environment, we present an optimization problem to maximize path lifetime by adjusting the amount of energy each node needs to share with its neighboring nodes. On the basis of solidarity property, i.e., the lifetime of the multi-hop path is maximized when the lifetimes of all nodes are the same, we convert the considered optimization problem into a linear programming problem and solve it easily. Simulation result shows that the proposed two-way wireless energy sharing method maximizes the path lifetime of multi-hop communications and approximately doubles the path lifetime compared with the one-way energy sharing method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.593-596
• /
• 2010

본 논문에서는 선형적인 무선 센서 네트워크에서 지연 및 신뢰성을 고려한 클러스터 기반의 멀티홉 라우팅 알고리즘을 제안한다. 제안한 알고리즘은 선형적인 네트워크 환경에서 전송 지연시간 및 Single Point Of Failure 를 해결하기 위해 짝수 ID 노드일 경우 다음 짝수 ID 노드로 전송하고, 홀수 ID 노드일 경우 다음 ID 노드로 데이터를 전송하는 방법을 사용한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1446-1448
• /
• 2009

이동 Ad Hoc 네트워크에서는 노드가 신뢰받은 인증기관을 통해 인증을 받는 형식이 아니기 때문에, 멀티홉 방식에 의해 라우팅을 수행할 경우 악의적인 중간 노드에 의해 데이터의 무결성 및 기밀성 문제가 발생할 수 있다. 따라서 이동 Ad Hoc 네트워크에서 안전하게 통신하기 위해서는 네트워크에 참여한 노드 중 악의적 중간 노드를 찾아내 격리시키고, 서로 신뢰할 수 있는 노드만이 네트워크에 참여할 수 있도록 하는 방안이 필요하다. 본 논문에서는 신뢰받는 인증기관이 없는 이동 Ad Hoc 네트워크에서 신뢰도 측정을 바탕으로 노드간 상호 인증할 수 있는 새로운 방안을 제시한다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.7
• /
• pp.37-48
• /
• 2014

Wireless mesh networks have emerged as a key technology in environment that needs wireless multi-hop communication without infrastructure and IEEE 802.11s mesh network standard have currently been established. One of big differences between this standard and the legacy IEEE 802.11 is that MCCA MAC is included to support QoS. MCCA supports bandwidth reservations between neighbors, so it can satisfy the QoS of bandwidth guarantee. However, MCCA has dis-advantages as follow; 1) it can not guarantee end-to-end bandwidth, 2) in multi-interface multi-channel wireless environments, the IEEE 802.11s does not provide a bandwidth reservation protocol and a wireless channel assignment etc. In this paper, we have proposed MIMC R-HWMP, which expands R-HWMP that was proposed in our previous work[3], to support multi-interface multi-channel. By simulation, we showed end-to-end bandwidth guarantee and the increase in the available bandwidth in multi-interface multi-channel wireless mesh networks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.259-266
• /
• 2013

Since the wireless communications have a limited transmission, the devices just around a master node can exchange data. Though Bluetooth and Zigbee support ad hoc, they are not appropriate for real-time voice communications. In this paper, we present a TDMA-based relay protocol for several users to communicate simultaneously. The proposed protocol can relay data or voice to other nodes in real-time by the multi-hop transmission method using TDMA. And the proposed protocol improves the network performance by allocating different frequencies to the slaves depending on the routing path scheduled by the routing table. NS-2 simulation shows that the performance of the proposed protocol is good in terms of the transmission delay and pecket loss probability in the real-time voice transmission.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.6
• /
• pp.1089-1096
• /
• 2019

Recently, small-scale IoT services using a small amount of information through low-performance computing have been spread. It requires low cost, low-power, and long-distance communication technologies with wide communication radius, relatively low power consumption. This paper proposes a MAC layer and routing protocol that supports multi-hop transmission in small-scale IoT environment distributed over a large area based on LoRa communication and delivering a small amount of sensing data. The terminal node is mobile and the communication type provides bidirectional transmission between the terminal node and the network application server. By applying the proposed protocol, a production line monitoring system for smart factory was implemented. It was confirmed that the basic monitoring functions are normally performed.

• The Journal of the Korea Contents Association
• /
• v.10 no.6
• /
• pp.91-105
• /
• 2010

A wireless sensor network communication technique has been broadly studied with continuous advances in ubiquitous computing environment. Especially, because the resource of the sensor node is limited, it is important to reduce the communication energy by using an energy-efficient routing protocol. The existing cluster-based routing protocols have a problem that they cannot select a cluster head efficiently by randomly choosing a head. In addition, because the existing cluster-based routing protocols do not support the large scale of network, they cannot be used for various applications. To solve the above problems, we, in this paper, propose a new cluster-based routing protocol using representative paths. The proposed protocol constructs an efficient cluster with distributed cluster heads by creating representative paths based on hop count. In addition, a new routing protocol supports multi-hop routing for data communication between a cluster member node and a cluster head as well as between cluster heads. Finally, we show that our protocol outperforms LEACH and Multihop-LEACH in terms of reliability and scalability.

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

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.77-85
• /
• 2015

Recently, wireless sensor network(WSN) have been used in various fields to implement ubiquitous computing environment. WSN uses small, low cost and low power sensors in order to collect information from the sensor field. This paper proposes a clustering algorithm for energy efficiency of sensor nodes. The proposed algorithm is based on conventional LEACH, the representative clustering protocol for WSN and it prolongs network and nodes life time using sleep technique and changable transmission mode. The nodes of the proposed algorithm first calculate their clustering participation value based on the distance to the neighbor nodes. The nodes located in high density area will have clustering participation value and it can turn to sleep mode. Besides, proposed algorithm can change transmission method from conventional single-hop transmission to multi-hop transmission according to the energy level of cluster head. Simulation results show that the proposed clustering algorithm outperforms conventional LEACH, especially non-uniformly deployed network.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.6
• /
• pp.1297-1307
• /
• 2013

Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or disseminate useful traffic information to othet vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collision at the link layer due to an excessive number of broadcast packets. To solve broadcast storm problem, we propose an RPB-MACn-based LV-CAST that is a vehicular broadcast algorithm for disseminating safety-related emergency message. The proposed LV-CAST identifies the last node within transmission range by computing the distance extending on 1 hop from the sending node of an emergency message to the next node of receiving node of the emergency message, and the last node only re-broadcasts the emergency message. The performance of LV-CAST is evaluated through simulation and compared with other message dissemination algorithms.