• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1541-1548
• /
• 2012

This paper proposes a new multipath-based routing protocol on MANETs with Fast-Recovery of failures. The proposed protocol establishes the primary and secondary paths between a source and a destination considering the end-to-end packet reception reliability of routes. The primary path is used to transmit messages, and the secondary path is used to recover the path when detecting failures on the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to recover locally the route failure, the proposed protocol can reduce the number of packet loss and the amount of control packets for setting up new paths. The simulation result using QualNet simulator shows that the proposed protocol was about 10-20% higher than other protocols in terms of end-to-end message delivery ratio and the fault recovery time in case of link fault was about 3 times faster than the other protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.255-263
• /
• 2009

In this paper, we propose an adaptive beacon scheduling algorithm to control a reception period of actual data according to variation of amount of traffic in IEEE 802.15.4 LR-WPAN(Low Rate-Wireless Personal Area Network) with the cluster-tree topology. If a beacon interval is shortened, the amount of the traffic a node receives can be increased while consumption of the energy can be also increased. In this sense, we can achieve optimal on orgy consumption by controlling the beacon interval when the amount of data to be received is being decreased. The result of simulation using NS-2 shows that the proposed algorithm improves performances in terms of packet loss rate and end-to-end delay compared with algorithm using a fixed beacon interval. For a design of cluster-tree based LR-WPAN managing delay-sensitive services, the proposed algorithm and the associated results can be applied usefully.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.422-429
• /
• 2013

Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1933-1954
• /
• 2013

Multiple wireless devices are being widely deployed in Intelligent Transportation System (ITS) services on the road to establish end-to-end connection between vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) networks. Vehicular ad hoc networks (VANETs) play an important role in supporting V2V and V2I communications (also called V2X communications) in a variety of urban environments with distinct topological characteristics. In fact, obstacles such as big buildings, moving vehicles, trees, advertisement boards, traffic lights, etc. may block the radio signals in V2X communications. Their impact has been neglected in VANET research. In this paper, we present a realistic and efficient radio propagation model to handle different sizes of static and moving obstacles for V2X communications. In the proposed model, buildings and large moving vehicles are modeled as static and moving obstacles, and taken into account their impact on the packet reception rate, Line-of-sight (LOS) obstruction, and received signal power. We use unsymmetrical city map which has many dead-end roads and open faces. Each dead-end road and open faces are joined to the nearest edge making a polygon to model realistic obstacles. The simulation results of proposed model demonstrates better performance compared to some existing models, that shows proposed model can reflect more realistic simulation environments.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.8
• /
• pp.261-270
• /
• 2014

As Internet traffic increases recently, much effort has been put on improving the performance of a web server. In addition to hardware side solutions such as replacement by high-end hardware or expansion of the number of servers, there are software side solutions to improve performance. Recent studies on these software side solutions have been actively performed. In this paper, we identify performance degradation problems occurring in a conventional TCP networking reception process and propose a way to solve them. We improve performance by combining three kinds of existing methods for Linux Networking Performance Improvement and two kinds of newly proposed methods in this paper. The three existing methods include 1) an allocation method of a packet flow to a core in a multi-core environment, 2) ITR(Interrupt Throttle Rate) method to control excessive interrupt requests, and 3) sk_buff data structure recycling. The two newly proposed methods are fd data structure recycling and epoll_event data structure recycling. Through experiments in a web server environment, we verify the effect of our two proposed methods and its combination with the three existing methods for performance improvement, respectively. We use three kinds of web servers: a simple web server, Lighttpd generally used in Linux, and Apache. In a simple web server environment, fd data structure recycling and epoll_event data structure recycling bring out performance improvement by about 7 % and 6%, respectively. If they are combined with the three existing methods, performance is improved by up to 40% in total. In a Lighttpd and an Apache web server environment, the combination of five methods brings out performance improvement by up to 36% and 20% in total, respectively.