• 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 Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.17-35
• /
• 1997

This paper considers the efficient design of routing path and wavelength assignment in the single-hop WDM optical transport networks. The connection demands between node-pairs are given and a connection between a pair of nodes must be made by only one lightpath. It is assumed that no wavelength conversion is allowed and the physical topology of the network and the number of available wavelengths of a physical link are also given. This paper proposes the method to route a path and assign a wavelength to the path, which guarantees fairness to every node pair. In order to guarantee fairness and maximize connections, an optimization model is established, which successively maximizes minimum connection ratio to the demand of each node pair. A heuristic algorithm with polynomial iterations is developed for the problem since the problem is NP-hard. The heuristic algorithm is implemented and applied to the networks with real problem sizes. The results of the application are compared with GAMS/OSL.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.17-28
• /
• 2011

Despite the fact that the deployment of sensor networks and target tracking could both be managed by taking full advantage of Voronoi diagrams, very little few have been made in this regard. In this paper, we designed an optimized barrier coverage and an energy-efficient clustering algorithm for forming Vonoroi-based Wireless Sensor Networks(WSN) in which we proposed a mobile target tracking scheme (CTT&MAV) that takes full advantage of Voronoi-diagram boundary to improve detectability. Simulations verified that CTT&MAV outperforms random walk, random waypoint, random direction and Gauss-Markov in terms of both the average hop distance that the mobile target moved before being detected and lower sensor death rate. Moreover, we demonstrate that our results are robust as realistic sensing models and also validate our observations through extensive simulations.

• Electronics and Telecommunications Trends
• /
• v.32 no.4
• /
• pp.67-77
• /
• 2017

최근 이슈가 되고 있는 자율주행차(Autonomous vehicle 또는 Self-driving car)를 실현하기 위해서는, 다양한 환경에서도 차량에 대한 끊김 없는 연결을 제공하는 커넥티드카(Connected car) 기술이 필수적이다. 현재 커넥티드카를 구현하기 위한 차량 네트워크(Vehicular network) 기술은 교통시스템 인프라 기반의 단일홉(Single-hop) 무선통신 기술이 주를 이루고 있다. 이러한 단일홉 통신은 커버리지가 교통시스템 인프라가 구축된 지역으로 제한된다. 따라서 차량 네트워크가 현재보다 더욱 넓은 지역을 커버하기 위해서는 차량 자체가 이동형 라우터 역할을 수행하여 차량 간의 전달을 통해 정보를 원거리로 전달할 수 있는 다중홉(Multi-hop) 통신 도입이 필요하다. 다중홉 차량 네트워크는 차량의 높은 동적 특성으로 인해 다수의 도전적인 기술적 이슈들을 가진다. 본고에서는 이러한 기술 이슈 중 차량 네트워크의 높은 이동성으로 발생할 수 있는 종단 노드 간 비연결성을 해결할 수 있는 기술인 지연감내형 차량 네트워킹(Delay-tolerant vehicular networking) 기술에 대한 주요 연구 동향을 살펴보고자 한다. 이를 위해 먼저 지연감내형 차량 네트워킹의 기술적 배경 및 주요 관련 기술들을 분석하고 이를 기반으로 향후 연구개발이 필요한 기술 이슈들을 정리한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.1
• /
• pp.33-43
• /
• 2013

This paper proposes a distributed MAC protocol called Carrier Sensing Multiple Access with Collision Resolution (CSMA/CR) considering fully-connected single hop network environments for next-generation wireless LAN with high density of stations. The proposed CSMA/CR is compatible with the conventional MAC protocols by observing the operation of CSMA/CA and is able to detect a collision promptly without RTS/CTS exchange by applying the technique of CSMA/CD to wireless environments. Moreover, once a collision is detected, the dedicated resource is allocated to the next transmission and so the collision that may occur again is resolved. We investigate some implementation issues for the practicality of CSMA/CR and compare it with the typical distributed MAC protocols. The simulation results show that the proposed CSMA/CR has a low overhead as detecting a collision without the RTS/CTS exploitation and achieves always the best throughput regardless of the number of access stations, by using the reservation-based collision resolution technique.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.1033-1036
• /
• 2013

A study about collision resolution is needed because huge file, video and multimedia information are transmitted to wireless LAN. CSMA/CR protocol guarantees fairness, but doesn't consider QoS. To practicalize CSMA/CR protocol in saturation fully-connected single hop network environments, this paper proposes method of collision compensation. previous CSMA/CR protocol chooses CR Slot only considering fairness, but this paper chooses front CR Slot for compensation of collision to station experiencing collisions. The station transmits jam signal and has channel priority of transmission. So transmitting efficiency and successful transmission probability rise. This proposed simple method can offer benefit to station experiencing collisions without additional hardware cost.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.753-760
• /
• 2009

As it becomes increasingly important that Internet access is available anywhere at any time, providing MANET (Mobile Ad-Hoc Network) with the Internet access attracts more attention. The existing DHCP (Dynamic Host Configuration Protocol) address configuration schemes require message exchanges between MANET nodes and the DHCP server through multi-hop routes. Messages can be easily dropped in the wireless multi-hop communication environment and the address configuration may be instable and need long delay. In this paper, we propose a new address configuration scheme using the concept of address pool allocation. In the proposed scheme, the DHCP server assigns a part of its address pool to a node instead of a single address and the node can assign a part of its own address pool to its neighbor nodes. Through simulation studies, we show that our scheme yields about 77% of the address configuration delay and 61% of the control message overhead of the existing DHCP based mechanism.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.1
• /
• pp.62-77
• /
• 2010

Emerging applications with high data rates will need to transport bulk data reliably in wireless sensor networks. ARQ (Automatic Repeat request) or Forward Error Correction (FEC) code schemes can be used to provide reliable transmission in a sensor network. However, the naive ARQ approach drops the whole frame, even though there is a bit error in the frame and the FEC at the bit level scheme may require a highly complex method to adjust the amount of FEC redundancy. We propose a bulk data transmission scheme based on erasure-resilient code in this paper to overcome these inefficiencies. The sender fragments bulk data into many small blocks, encodes the blocks with LT codes and packages several such blocks into a frame. The receiver only drops the corrupted blocks (compared to the entire frame) and the original data can be reconstructed if sufficient error-free blocks are received. An incidental benefit is that the frame error rate (FER) becomes irrelevant to frame size (error recovery). A frame can therefore be sufficiently large to provide high utilization of the wireless channel bandwidth without sacrificing the effectiveness of error recovery. The scheme has been implemented as a new data link layer in TinyOS, and evaluated through experiments in a testbed of Zigbex motes. Results show single hop transmission throughput can be improved by at least 20% under typical wireless channel conditions. It also reduces the transmission time of a reasonable range of size files by more than 30%, compared to a frame ARQ scheme. The total number of bytes sent by all nodes in the multi-hop communication is reduced by more than 60% compared to the frame ARQ scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.33-41
• /
• 2007

The IEEE 802.11 DCF channel access function allows single transmission inside two-hop network in order to avoid collisions and eliminate the hidden and exposed terminal problems. Singular transmission capability causes data frames waiting for the entire roundtrip time in the transmitter neighborhood, and results in increased frame latency and lower network throughput. Real-time and pervasive applications are severely affected for the lower medium utilization; especially with high network traffic. This work proposes a new scheme with the help of Frame Aggregation technique in IEEE802.11n and overcomes the single transmission barrier maintaining the basic DCF functionality. Proposed scheme allows parallel transmissions in non-interfering synchronized slots. Parallel transmissions bypass the conventional physical carrier sense and random Backoff time for several cases and reduce the frame latency and increase the medium utilization and network capacity.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.111-120
• /
• 2005

A mobile ad-hoc network is an autonomous system of mobile nodes which are free to move around randomly and organize themselves arbitrarily, hence a routing protocol that handles the dynamic network topology changes is required for the network. In this paper we present a multi -Path on-demand routing protocol called R-DSR (Robust Dynamic Source Routing), an extension to the existing IETF protocol DSR. The proposed protocol has it that every pair of 2-hop away nodes on the single route is additionally connected via an alternative node. Throughout mathematical analysis we show the proposed protocol reveals higher message delivery rate than that of the Das's multi-path protocol, currently known as one of the most typical approaches related to DSR.