• Journal of KIISE:Information Networking
• /
• v.34 no.1
• /
• pp.1-15
• /
• 2007

Increase in the wireless mobile network users brings the issue of mobility management into the Virtual Private Network (VPN) services. We propose a provider edge (PE)-based provider provisioned mobile VPN mechanism, which enables efficient communication between a mobile VPN user and one or more correspondents located in different VPN sites. The proposed mechanism not only reduces the IPSec tunnel overhead at the mobile user node to the minimum, but also enables the traffic to be delivered through optimized paths among the (mobile) VPN users without incurring significant extra IPSec tunnel overhead regardless of the user's locations. The proposed architecture and protocols are based on the BGP/MPLS VPN technology that is defined in RFC24547. A service provider platform entity named PPVPN Network Server (PNS) is defined in order to extend the BGP/MPLS VPN service to the mobile users. Compared to the user- and CE-based mobile VPN mechanisms, the proposed mechanism requires less overhead with respect to the IPSec tunnel management. The simulation results also show that it outperforms the existing mobile VPN mechanisms with respect to the handoff latency and/or the end-to-end packet delay.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2627-2640
• /
• 1998

In this paper, we analyze the performance of the virtual cell system[1] for the transmission of IP datagrams in mobile computer communications. A virtual cell consistsof a group of physical cells shose base stationsl are implemented b recote bridges and interconnected via high speed datagram packet switched networks. Host mobility is supported at the data link layer using the distributed hierachical location information of mobile hosts. Given mobility and communication ptems among physical cells, the problem of deploying virtual cells is equivalent to the optimization cost for the entire system where interclster communication is more expesive than intracluster communication[2]. Once an iptimal partitionof disjoint clusters is obtained, we deploy the virtual cell system according to the topology of the optimal partition such that each virtual cell correspods to a cluser. To analyze the performance of the virtual cell system, we adopt a BCMP open multipel class queueing network model. In addition to mobility and communication patterns, among physical cells, the topology of the virtual cell system is used to determine service transition probabilities of the queueing network model. With various system parameters, we conduct interesting sensitivity analyses to determine network design tradeoffs. The first application of the proposed model is to determine an adequate network bandwidth for base station networking such that the networks would not become an bottleneck. We also evaluate the network vlilization and system response time due to various types of messages. For instance, when the mobile hosts begin moving fast, the migration rate will be increased. This results of the performance analysis provide a good evidence in demonsratc the sysem effciency under different assumptions of mobility and communication patterns.

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

The number of industry wireless networks based on IEEE 802.11 WLAN technology deployed in large outdoor work sites, such as freight container terminal, is increasing these days. Wider service coverage, frequent movements of stations and high requirement on service reliability are main characteristics of these networks compared to the conventional IEEE 802.11 networks used in home, office and school. While the importance of these networks Bets higher, we can hardly find previous studies including concrete analysis on these networks based on actual experiments. We carried out several field experiments at a freight container terminal to analyze its IEEE 802.11 network and found out some problematic situations, such as over 50% retransmission rates and frequent disruption of communication link while a station is moving. We explain why these problematic situations happen and suggest some solutions, such as application of mesh technology, smart handoff based on location and movement pattern and adjustment of signal strength and channel allocation. Methods and tools used in the experiments are also detailed in the paper which may be helpful for similar future studies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.117-128
• /
• 2006

For the legacy IEEE 802.15.3 WPAN protocol, an unpredictable piconet coordinator(PNC) leaving from a piconet without a proper handoff procedure causes an absence of PNC, and thus the piconet gets collapsed. In addition, several beacons from PNCs in adjacent piconets may be collided on a device(DEV) located between those piconets. This beacon collision eventually makes the DEV leave from the piconet. To remedy these two problems, we here propose an Active Seamless Coordinator Switching(ASCS) scheme and a PNC HB based Beacon Alignment(PHBA) one. In the ASCS scheme, a PNC assigns a number of DEVs as next possible PNCs in sequence for provisioning against the abrupt breakdown of the current active PNC. Each nominated DEV proactively sends a probe frame to confirm the operation status of the active PNC. For the case of no response from the PNC, the nominated DEV tries to become a new PNC immediately. In the second PHBA scheme, each PNC is allow to broadcast a special Heart Beat(HB) frame randomly during a superframe period. When a DEV receives a HB frame from other PNC, it promptly sends the related PNCs a special Hiccup Beat(HCB) frame with the superframe information of its associated PNC. As a result, the HCB frame makes both PNCs align their superframe beginning time in order to yield no more beacon collisions. For these two proposed schemes, we show the performance by simulations. We can confirm the enhancement of throughput for each superframe and average frame transfer delay, since each scheme can reduce the duration of piconet collapse. Finally, it is worth while to note that the proposed schemes can be operated with frames those are permitted in the legacy WPAN standard.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.461-473
• /
• 2003

Multimedia applications are much more sensitive to QoS(Quality of Service) than text based ones due to their data continuity. In order to provide a fast moving MH(Mobil Host) using multimedia application with a consistent QoS,an efficient call admission mechanism is in need. This paper proposes the 2SCA(2-Step Call Admission) scheme based on cal admission scheme using pripority to guarantee the consistent QoS for mobile multimedia applications. A calls of MH are classified new calls, hand-off calls, and QoS upgrading calls. The 2SCA is composed of the basic call admission and advanced call admission; the former determines the call admission based on bandwidth available in each cell and the latter determines the call admission by applying DTT(Delay Tolerance Time), PQeueu(Priority Queue), and UpQueue(Upgrade Queue) algorithm according to the type of each call blocked at the basic call admission stage. In order to evaluate the performance of our mechanism, we measure the metrics such as the dropping probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The result shows that the performance of our mechanism is superior to that of existing mechanisms such as CSP(Complete Sharing Policy), GCP(Guard Channel Policy) and AGCP(Adaptive Guard Channel Policy).

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.377-386
• /
• 2003

In this paper, we present an application layer protocol to support secure wireless Internet services, called Application Layer Security(ALS). The drawbacks of the two traditional approaches to secure wireless applications motivated the development of ALS. One is that in the conventional application-specific security protocol such as Secure HyperText Transfer Protocol(S-HTTP), security mechanism is included in the application itself. This gives a disadvantage that the security services are available only to that particular application. The other is that a separate protocol layer is inserted between the application and transport layers, as in the Secure Sockets Layer(SSL)/Transport Layer Security(TLS). In this case, all channel data are encrypted regardless of the specific application's requirements, resulting in much waste of network resources. To overcome these problems, ALS is proposed to be implemented on top of HTTP so that it is independent of the various transport layer protocols, and provides a common security interface with security applications so that it greatly improves the portability of security applications. In addition, since ALS takes advantages of well-known TLS mechanism, it eliminates the danger of malicious attack and provides applications with various security services such as authentication, confidentiality integrity and digital signature, and partial encryption. We conclude this paper with an example of applying ALS to the solution of end-to-end security in a present commercial wireless protocol stack, Wireless Application Protocol.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.247-256
• /
• 2002

In a wireless multicasting when a mobile host moves to the new bate station being in the same multicast group it needs to exchange information about data delivery between base stations to receive data from the new base station at once. However it is inefficient to use the existence schemes because it takes too much time to exchange information and many overheads. The next, a mobile host moving to the base station not being in the same multicast group, the old base station will pre-forward data to neighboring base stations to avoid transmission delay. However, if other mobile hosts move at short interval, the old base station may retransmit the same data to the same neighboring base stations. In this paper we proposed called Information Exchange Scheme (IES). In IES in the same multicast grope the base stations exchange information locally so it takes the minimum time and overheads to use IES. Also in IES the neighboring base stations delay to delete data for continuous moving of other MHs. We also present how our scheme is efficient by producing cost ad simulating.

• Journal of Korean Clinical Nursing Research
• /
• v.28 no.3
• /
• pp.223-232
• /
• 2022

Purpose: The purpose of this study was to apply patient-engaged bedside handoffs in comprehensive care units, and to evaluate the effects of bedsides to nurses and patients. Methods: This study employed a cluster randomized cross-over design.Electrical Medical Record (EMR)-based handoffs and patient-engaged bedside handoffs were alternatively applied to 104 patients, who were assigned to a total of 30 clusters (nursing handoff teams) in 4 comprehensive care units at the S medical center in Seoul, and the patients evaluated each type of handoffs. A total of 139 nurses were also participated in the same units and evaluated each type of handoffs. Data were analyzed using t-test, Wilcoxon rank sum test, ANOVA, and Kruskal-Walls test. Results: The patient's satisfaction of the patient-engaged bedside handoffs was higher than that of the EMR-based handoffs (Z=-5.16, p<.001). On the other hand, the nurse's satisfaction of the patient-engaged bedside handoffs was significantly lower than that of the EMR-based handoffs (t=13.21, p<.001). There were no differences in length of the reporting time between two types of handoffs (t=-0.48, p=.634). Conclusion: Patient satisfaction with the patient-engaged bedside handoffs was higher than that of EMR-based handoffs, and nurses' satisfaction with the patient-engaged bedside handoffs was significantly lower than that of EMR-based handoffs. Future studies are needed regarding the impacts of patient-engaged bedside handoffs on the quality of healthcare by identifying the benefits of the handoffs.

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

Recent advances in Cognitive Radio Networks (CRN) have elevated them to the status of a critical instrument for overcoming spectrum limits and achieving severe future wireless communication requirements. Collaborative spectrum sensing is presented for efficient channel selection because spectrum sensing is an essential part of CRNs. This study presents an innovative cooperative spectrum sensing (CSS) model that is built on the Firefly Algorithm (FA), as well as machine learning artificial neural networks (ANN). This system makes use of user grouping strategies to improve detection performance dramatically while lowering collaboration costs. Cooperative sensing wasn't used until after cognitive radio users had been correctly identified using energy data samples and an ANN model. Cooperative sensing strategies produce a user base that is either secure, requires less effort, or is faultless. The suggested method's purpose is to choose the best transmission channel. Clustering is utilized by the suggested ANN-FA model to reduce spectrum sensing inaccuracy. The transmission channel that has the highest weight is chosen by employing the method that has been provided for computing channel weight. The proposed ANN-FA model computes channel weight based on three sets of input parameters: PU utilization, CR count, and channel capacity. Using an improved evolutionary algorithm, the key principles of the ANN-FA scheme are optimized to boost the overall efficiency of the CRN channel selection technique. This study proposes the Artificial Neural Network with Firefly Algorithm (ANN-FA) for cognitive radio networks to overcome the obstacles. This proposed work focuses primarily on sensing the optimal secondary user channel and reducing the spectrum handoff delay in wireless networks. Several benchmark functions are utilized We analyze the efficacy of this innovative strategy by evaluating its performance. The performance of ANN-FA is 22.72 percent more robust and effective than that of the other metaheuristic algorithm, according to experimental findings. The proposed ANN-FA model is simulated using the NS2 simulator, The results are evaluated in terms of average interference ratio, spectrum opportunity utilization, three metrics are measured: packet delivery ratio (PDR), end-to-end delay, and end-to-average throughput for a variety of different CRs found in the network.