• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.11-16
• /
• 2003

This paper implements Multiple User Authentication System to which the system authenticating with password only has been upgraded. The 4-staged authentication including user ID, password, smart card and access control information, etc. is used at the suggested Multiple User Authentication System. The user authentication system that this paper suggests has been developed based on SecuROS/FreeBSD with the function of access control added to FreeBSD kernel. It provides both the function to limit accost range to the system to each user and the function to check that when inputting important information the demand is the one if the system ; thus, the reliability becomes increased. In the SecuROS/FreeBSD system, MAC and RBAC are being used. So, in the case of users accessing to the system, the Information about the policies of MAC and RBAC to which users would access is used in the authentication. At the time, the access to system if permitted only when the access control information that users demanded satisfies all the access control rules which have been defined In the system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1142-1150
• /
• 2009

In this paper, we propose an novel bandwidth scheduling algorithm for the MAC protocol employed by the Data Over Cable Service Interface Specifications (DOCSIS) 3.0 compliant cable networks. The proposed algorithm statistically improves the chances of request piggybacking to minimize the access delay. It utilizes the piggyback request feature of the segment packets that has been newly specified in DCOSIS 3.0. In DOCSIS 3.0, a bandwidth request can be granted to several upstream channels within an upstream bonding group. The grant on each individual channel is treated as a segment packet. We find the optimal segment placement to minimize the access delay in the proposed algorithm. We also use a self-similar traffic model for simulation and analysis to evaluate the performance of the proposed algorithm.

• Parasites, Hosts and Diseases
• /
• v.50 no.4
• /
• pp.301-308
• /
• 2012

In fascioliasis, T-helper 2 (Th2) responses predominate, while little is known regarding early immune phenomenon. We herein analyzed early immunophenotype changes of BALB/c, C57BL/6, and C3H/He mice experimentally infected with 5 Fasciola hepatica metacercariae. A remarkable expansion of $CD19^+$ B cells was observed as early as week 1 post-infection while $CD4^+/CD8^+$ T cells were down-regulated. Accumulation of $Mac1^+$ cells with time after infection correlated well with splenomegaly of all mice strains tested. The expression of tumor necrosis factor (TNF)-${\alpha}$ mRNA in splenocytes significantly decreased while that of IL-4 up-regulated. IL-$1{\beta}$ expression was down-modulated in BALB/c and C57BL/6 mice, but not in C3H/He. Serum levels of transforming growth factor (TGF)-${\beta}$ were considerably elevated in all mice during 3 weeks of infection period. These collective results suggest that experimental murine fascioliasis might derive immune suppression with elevated levels of TGF-${\beta}$ and IL-4 during the early stages of infection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12B
• /
• pp.838-846
• /
• 2005

In this paper, we consider the following two issues for implementing the synchronous Ethernet systems. First, a synchronous Ethernet system employs a fixed size superframe which is divided into a synchronous period and an asynchronous one. We note that the starting point of a superframe is not deterministic when an ordinary data frame's transmission is overlapped the superframe boundary. This overlap may be a fatal drawback for strict jitter bounded applications. Circumventing the problem, we propose a frame fragmentation scheme to provide a zero jitter, and compare its delay performance with the hold scheme which also provides the zero jitter. We next concern that IEEE 802.3x pause frames cannot be promptly transmitted in a synchronous period, and thus asynchronous traffics may be dramatically get dropped at the input buffer of a switch. To handle the problem, we propose an efficient flow control by allowing the transmission of the pause frame in a synchronous period, and investigate the blocking probability of the asynchronous traffics by the simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.2957-2986
• /
• 2013

The traditional approach of fixed spectrum allocation to licensed networks has resulted in spectrum underutilisation. Cognitive radio technology is envisioned as a promising solution that can be used to resolve the ineffectiveness of the fixed spectrum allocation policy by accessing the underutilised spectrum of existing technologies opportunistically. The implementation of cognitive radio networks (CRNs) faces distinct challenges due to the fact that two systems (i.e., cognitive radio (CR) and primary users (PUs)) with conflicting interests interact with each other. Specially, in self-organised systems such as ad-hoc CRNs (AHCRNs), the coordination of spectrum access introduces challenges to researchers due to rapid utilisation changes in the available spectrum, as well as the multi-hop nature of ad-hoc networks, which creates additional challenges in the analysis of resource allocation (e.g., power control, channel and rate allocation). Instead, game theory has been adopted as a powerful mathematical tool in analysing and modelling the interaction processes of AHCRNs. In this survey, we first review the most fundamental concepts and architectures of CRNs and AHCRNs. We then introduce the concepts of game theory, utility function, Nash equilibrium and pricing techniques. Finally, we survey the recent literature on the game theoretic analysis of AHCRNs, highlighting its applicability to the physical layer PHY, the MAC layer and the network layer.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4B
• /
• pp.184-191
• /
• 2008

NanoQplus, which is an embedded operating system for wireless sensor networks (WSNs) and developed by Electronics and Telecommunications Research Institute (ETRI), provides programmer-friendly preemptive multi-threading programming technique, but it has poor network protocol stack, as compared to TinyOS, one of the famous operating systems for WSNs. In this paper, we apply dynamic MANET on-demand routing (DYMO) protocol, which is being standardized in Internet Engineering Task Force (IETF), to NanoQplus. Since DYMO has been proposed for mobile ad-hoc networks (MANETs) and MANETs have less resource restrictions than WSNs, the basic DYMO protocol cannot be applied to WSNs without modifications. Moreover, coherence with MAC protocol should be considered in order to eliminate redundant data between MAC and network layers. Thus, we propose a modified version of the basic DYMO protocol for NanoQplus. The experimental results from a real sensor network test-bed show that the DYMO implementation using NanoQplus works efficiently in WSNs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3B
• /
• pp.183-198
• /
• 2006

We define the incomplete medium sharing system as a multi-channel shared medium communication system where constraints are imposed to the set of channels that may be allocated to some transmitter-receiver node pairs. To derive a centralized MAC scheme of a incomplete medium sharing system, we address the problem of optimal channel allocation The optimal channel allocation problem is then translated into a max-flow problem in a multi-commodity flow graph, and it is shown that the optimal solution can then be obtained by solving a linear programming problem. In addition, two suboptimal channel allocation schemes are proposed to bring down the computational complexity to a practical/feasible level; (1) one is a modified iSLIP channel allocation scheme, (2) the other is sequential channel allocation scheme. From the results of a extensive set of numerical experiments, it is found that the suboptimal schemes evaluate channel utilization close to that of the optimal schemes while requiring much less amount of computation than the optimal scheme. In particular, the sequential channel allocation scheme is shown to achieve higher channel utilization with less computational complexity than . the modified iSLIP channel allocation scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.154-161
• /
• 2010

In wireless sensor networks, due to the many-to-one convergence of upstream traffic, congestion more probably appears. The existing congestion control protocols avoid congestion by controlling incoming traffic, but the duty-cycle operation of MAC(Medium Access Control) layer has not considered. In this paper, we propose DCA(Duty-cycle Based Congestion Avoidance), an energy efficient congestion control scheme using duty-cycle adjustment for wireless sensor networks. The DCA scheme uses both a resource control approach by increasing the packet reception rate of the receiving node and a traffic control approach by decreasing the packet transmission rate of the sending node for the congestion avoidance. Our results show that the DCA operates energy efficiently and achieves reliability by its congestion control scheme in duty-cycled wireless sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3B
• /
• pp.91-99
• /
• 2008

In this paper, we design the function of ULSLE(Upper Layer Shared LAN Emulation) to provide both the efficient LAN service and compatibility with 802.1D bridge in Hybrid two-stage AWG based WDM-PON. The ULSLE layer lies above MAC control layer in order to provide a mean to interface WDM-PON and 802.1D bridge. It also performs LAN emulation based on PON-Tag which is only used to decide both the transmission mode and the destination of frames transmitted from ONUs. That is, the PON-Tag is not used for downstream frames but destination address field in original frame instead. This decreases the processing overhead and complexity caused by PON-Tag at OLT and ONU. The verification of designed ULSLE is performed according to the specific scenarios based on transmission mode and destination using OPNET.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.455-462
• /
• 2009

In this paper, we propose a buffer management scheme for decreasing the packet loss due to buffer overflow and improving the packet fairness between nodes in IEEE 802.11 based multi-hop mesh networks. In the proposed scheme, each mesh router that is an intermediate node receives fairly packet sent from neighboring mesh routers and mobile nodes, and it improves the reception ratio of multi-hop traffic of neighboring mesh routers. Therefore, the proposed scheme can reduce transmission delay and energy consumption. In order to improving the packet loss and the packet fairness, the proposed scheme uses the modified RTS/CTS under the IEEE 802.11 MAC protocol and reduces the packet loss by recognizing the packet size to send to the destination in advance. By using the simulation, we evaluated the proposed scheme in terms of the packet loss ratio and the number of received packet in each mesh router, and compare it to a traditional scheme.