• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.519-526
• /
• 2004

This paper presents an efficient interoperation scheme of a VPN(Virtual Private Network) and Mobile IP using a hierarchical structure of a FA(Foreign Agent). In the proposed scheme, the GFA(Gateway Foreign Agent) plays a role of VPN gateway on behalf of the MN(Mobile Node). When the MN moves in the same GFA domain, because the GFA has already an IPsec security association with a VPN gateway in the home network of the MN, the MN does not need an IPsec re-negotiaion. In this way, our mechanism reduces a message overhead and a delay resulted from an IPsec negotiation. And a MN can send a data to a correspondent node without a packet leakage. We show a performance of our scheme by using a discrete analytical model. Analytical results demonstrated that the total processing cost calculated by a registration update cost and a packet delivery cost is significantly reduced through our proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4844-4864
• /
• 2017

Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.7
• /
• pp.1873-1893
• /
• 2023

The development of lightweight, low energy and small-sized sensors incorporated with the wireless networks has brought about a phenomenal growth of Wireless Sensor Networks (WSNs) in its different fields of applications. Moreover, the routing of data is crucial in a wide number of critical applications that includes ecosystem monitoring, military and disaster management. However, the time-delay, energy imbalance and minimized network lifetime are considered as the key problems faced during the process of data transmission. Furthermore, only when the functionality of cluster head selection is available in WSNs, it is possible to improve energy and network lifetime. Besides that, the task of cluster head selection is regarded as an NP-hard optimization problem that can be effectively modelled using hybrid metaheuristic approaches. Due to this reason, an Improved Coyote Optimization Algorithm-based Clustering Technique (ICOACT) is proposed for extending the lifetime for making efficient choices for cluster heads while maintaining a consistent balance between exploitation and exploration. The issue of premature convergence and its tendency of being trapped into the local optima in the Improved Coyote Optimization Algorithm (ICOA) through the selection of center solution is used for replacing the best solution in the search space during the clustering functionality. The simulation results of the proposed ICOACT confirmed its efficiency by increasing the number of alive nodes, the total number of clusters formed with the least amount of end-to-end delay and mean packet loss rate.

• Industrial Engineering and Management Systems
• /
• v.15 no.3
• /
• pp.259-267
• /
• 2016

In Wireless Sensor Network, various routing protocols were employed by our Research and Development community to improve the energy efficiency of a network as well as to control the traffic by considering the terms, i.e. Packet delivery rate, the average end-to-end delay, network routing load, average throughput, and total energy consumption. While maintaining network connectivity for a long-term duration, it's necessary that routing protocol must perform in an efficient way. As we discussed Optimized Link State Routing protocol between all of them, we find out that this protocol performs well in the large and dense networks, but with the decrease in network size then scalability of the network decreases. Whenever a link breakage is encountered, OLSR is not able to periodically update its routing table which may create a redundancy problem. To resolve this issue in the OLSR problem of redundancy and predict link breakage, an enhanced protocol, i.e. S-OLSR (More Scalable OLSR) protocol has been proposed. At the end, a comparison among different existing protocols, i.e. DSR, AODV, OLSR with the proposed protocol, i.e. S-OLSR is drawn by using the NS-2 simulator.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.5
• /
• pp.125-132
• /
• 2017

Vehicular safety service reduces traffic accidents and traffic congestion by informing drivers in advance of threats that may occur while driving using vehicle-to-vehicle (V2V) communications in a wireless environment. For vehicle safety services, every vehicle must broadcasts a Basic Safety Message(BSM) periodically. In congested traffic areas, however, network congestion can easily happen, reduce the message delivery ratio, increase end-to-end delay and destabilize vehicular safety service system. In this paper, to solve the network congestion problem in vehicle safety communications, we approximate the relationship between channel busy ratio and the number of vehicles and use it to estimate the total network congestion. We propose a new context-aware transmit power control algorithm which controls the transmission power based on total network congestion. The performance of the proposed algorithm is evaluated using Qualnet, a network simulator. As a result, the estimation of total network congestion is accurately approximated except in specific scenarios, and the packet error rate in vehicle safety communication is reduced through transmit power control.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.113-118
• /
• 2015

Mobile wireless networks have received a lot of attention as a future wireless network due to its rapid deployment without communication infrastructure. In these networks communication path between two arbitrary nodes break down because some links in the path are beyond transmission range($r_0$) due to the mobility of the nodes. The set of total path break down time(${\bigcup}T_i$), which is the union of path break down time of every node pair, can be a good measure of the connectivity of the dynamic mobile wireless network. In this paper we show that the distribution of the total path break down time can be approximated as a exponential probability density function and confirms it through experimental data. Statistical knowledge of break down time enables quantitative prediction of delay, packet loss between two nodes, thus provides confidence in the simulation results of mobile wireless networks.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.1
• /
• pp.190-197
• /
• 2010

The ACR (Access Control Router) of WiBro processes location registration of the Correspondent Node and Home Agent as the Correspondent Node moves between ACRs. Therefore, the location update cost is low compared with MIPv6. However, all packets which are sent and received are sent through the ACR, so as the number of mobile nodes that are managed by the ACR increases, the cost of packet delivery also increases. Therefore, the communication state of the ACR domain remains smooth when the ACR which manages the mobile node in the ACR domain has good performance. However, network delays occur unless the ACR performs well, so the role of the ACR is important. In this paper, we analysis performance of the ACR for efficient realization of the WiBro standard. By using the Deny Probability and the Total Profit of ACR performance and apply it to the Random Walk Mobility model as the mobility model.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.518-528
• /
• 2009

IEEE 802.11 wireless local area network (WLAN) has become the prevailing solution for wireless Internet access while transport control protocol (TCP) is the dominant transport-layer protocol in the Internet. It is known that, in an infrastructure-based WLAN with multiple stations carrying long-lived TCP flows, the number of TCP stations that are actively contending to access the wireless channel remains very small. Hence, the aggregate TCP throughput is basically independent of the total number of TCP stations. This phenomenon is due to the closed-loop nature of TCP flow control and the bottleneck downlink (i.e., access point-to-station) transmissions in infrastructure-based WLANs. In this paper, we develop a comprehensive analytical model to study TCP dynamics in infrastructure-based 802.11 WLANs. We calculate the average number of active TCP stations and the aggregate TCP throughput using our model for given total number of TCP stations and the maximum TCP receive window size. We find out that the default minimum contention window sizes specified in the standards (i.e., 31 and 15 for 802.11b and 802.11a, respectively) are not optimal in terms of TCP throughput maximization. Via ns-2 simulation, we verify the correctness of our analytical model and study the effects of some of the simplifying assumptions employed in the model. Simulation results show that our model is reasonably accurate, particularly when the wireline delay is small and/or the packet loss rate is low.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.44-52
• /
• 2000

This paper is contented with packet transmission scheduling problem for repeating all-to-all broadcasts in WDM optical passive-star networks in which there are N nodes and k wavelengths. It is assumed that each node has one tunable transmitter and one fixed-tuned receiver, and each transmitter can tune to k different wavelengths. The tuning delay represents the time taken for a transmitter to tune from one wavelength to another and represented as ${\delta}$(>0) in units of packet durations. We define all-to-all broadcast as the one where every node transmits packets to all the other nodes except itself. So, there are in total N(N-1) packets to be transmitted for an all-to-all broadcast. The optimal transmission scheduling is to schedule In such a way that all packets can be transmitted within the minimum time. In this paper, we propose the condition for optimal transmission schedules and present an optimal transmission scheduling algorithm for arbitrary values of N, k, and ${\delta}$ The cycle length of the optimal schedules is $max{[\frac{N}{k}](M-1)$, $k{\delta}+N-1$}.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2954-2972
• /
• 1998

It is expected that the transport of compressed video will become a significant part of total network traffic because of the widespread introduction of multimedial services such as VOD(video on demand). Accordingly, VBR(variable bit-rate) encoded video will be widely used, due to its advantages in statistical multiplexing gain and consistent vido quality. Since the transport of video traffic requires larger bandwidth than that of voice and data, the characterization of video source and traffic modeling is very important for the design of proper resource allocation scheme in ATM networks. Suitable statistical source models are also required to analyze performance metrics such as packet loss, delay and jitter. In this paper, we analyzed and described on the characterization and traffic modeling of MPEG video sources. The models are broadly classified into two categories; i.e., statistical models and deterministic models. In statistical models, the models are categorized into five groups: AR(autoregressive), Markov, composite Marko and AR, TES, and selfsimilar models. In deterministic models, the models are categorized into $({\sigma},\;{\rho}$, parameterized model, D-BIND, and Empirical Envelopes models. Each model was analyzed for its characteristics along with corresponding advantages and shortcomings, and we made comparisons on the complexity of each model.