• Journal of Korea Multimedia Society
• /
• v.17 no.4
• /
• pp.433-440
• /
• 2014

Wireless communication offers the flexibility to the node movement at the spatial dimension more than the wire communication not only in IP architecture but also in Content-Centric Networking. Although it gives such advantage, the intra-domain movement of a node especially the data source node affects the communication to the access point node which in the end affects the acceptance ratio of the client node that requests the data packets from the data source node. In this paper, we use time-division access method to maintain the acceptance ratio of the client node as the effect of the intra-domain data source node movement in Content-Centric Networking. The simulation result shows that the acceptance ratio of the client node can be maintained using the time-division access method as long as the interval access time is less than the coherence time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.10C
• /
• pp.945-950
• /
• 2002

In this paper the performance evaluations on Asynchronous Transfer Mode(ATM) access node are performed in the ATM access network which consists of access node and channel. The performance factors of access node are Cell Loss Ratio(CLR), buffer capacity and delay time. Both the ATM cell-scale queueing model and burst-scale queueing model are considered as the traffic model of access node for various traffic types such as Constant Bit Rate(CBR), Variable Bit Rate(VBR) and random traffic in the ATM access networks. Based on these situations, the relation of CLR, buffer capacity and delay time is analyzed in the ATM access node.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1158-1163
• /
• 2002

In this paper it is focused on the relation between CLR (Cell Loss Ratio) and blocking probability, GoS(Grade of Services) parameters in the wireless ATM (Asynchronous Transfer Mode) access network which consists of access node and wireless channel. Traffic model of wireless ATM access network is based on the cell scale, burst scale and call connection level. The CLR equation due to buffer overflow for wireless access node is derived for CBR (Constant Bit Rate) traffic. The CLR equation due to random bit errors and burst errors for wireless channel is derived. Using the CLR equation for both access node and wireless channel, the CLR equation of wireless ATM access network is derived. The relation between access network CLR and blocking probability is analyzed for CBR traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.605-613
• /
• 1994

In this paper, we evaluate performance of multiple access for distributed wireless communication network by CSMA protocol. It is envident that the existence of hidden node in an environment degrades the performance of CSMA. In order to improve performance due to the problem of hidden node, the previous paper used random multiple access protocols a as such as ISMA, BTMA, BCMA. In this paper, We propose a protocol that we can improve performance by allowing node to sense the carrier of any other transmission on the channel in the distributed wireless communication networks The probability of transmission success was obtained by steady stats analysis under given assumptions. We confirmed that hidden node problem be virtually elimated by using a new protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9B
• /
• pp.589-597
• /
• 2007

In this paper, a WDM metro ring consisting of access nodes with $FT-FR^n$ (Fixed Transmitter - n Fixed Receivers) is considered. A trade-off exists between node throughput and transmission fairness because the access nodes share wavelength channels. In order to eliminate the transmission unfairness and to increase throughput, the p-persistent medium access control (MAC) protocol is proposed: each node uses an empty optical slot to transmit a packet and make it available with the extraction of a transferred packet at the source access node, called source-stripping. The local empty slot can be used to transfer a head-of-line packet in the local buffer with probability p or it is used for the next downstream nodes with 1-p. The proposed MAC protocol provides better node throughput than the non-persistent protocol and exhibits better fairness index than the 1-persistent protocol in WDM ring networks. In addition, numerical analysis shows that the proposed MAC protocol maximizes the node throughput under uniform traffic conditions. For more detailed results, we use the network simulation under Poisson and self-similar traffic. Furthermore, unpredictable traffic constructed by the combination of the former and the latter is also considered. The reasonable probability of the p-persistent protocol for a given architecture can be determined through simulation.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.1 s.6
• /
• pp.107-115
• /
• 2005

For effective IP based service implementation on the wireless network environments, wireless network including the ITS network have to support QoS guaranteed protocol such as a RSVP. RSVP is a resource reservation protocol for Internet environment, and its scalability makes easy to implement RSVP over the various IP transport technologies. But for the If based ITS wireless network environment, RSVP is not suitable, since by its path setup procedure characteristic. In the wireless access network for ITS service, when a mobile node moves to other domain it must perform registration procedure. But the registration procedure is time consuming steps, so if a RSVP session was already established in the previous domain, the RSYP session may be disconnected and the time to re establish a new RSVP session is long enough to cause serious packet loss. In this paper, we propose a pre-path reservation mechanism for applying the RSVP in wireless access networks for ITS. In the pre-path reservation mechanism, the resource reservation procedure occurred during a mobile node's handoff time. An access point in wireless access network performs this procedure when the mobile node attempts handoff The access point executes pre-path reservation procedure as a proxy, since the mobile node does not have IP address until the address allocation procedure is finished in a new domain.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.40-42
• /
• 2004

Access Grid는 상호공동작업을 위하여 대용량의 컨텐츠 파일들을 주고받으며 공유한다. 특별히 중앙의 집중된 관리서버가 없는 Access Grid환경에서는 컨텐츠의 위치추적의 어려움, 부재, 병목 등의 현상이 발생하는데 이를 본 논문에서 1. 중앙 Hybrid서버의 구현 2. 집중컨텐츠의 거점노드복제 3. 중요컨텐츠의 24시간 공유보장 등의 기법으로 해결방안을 제안하였다. 그리고 이에 대한 효율성을 시뮬레이션 자료로 증명하였다.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.4
• /
• pp.340-349
• /
• 2017

This paper is proposed Hadoop security protocol to protect a reply attack and impersonation attack. The proposed hadoop security protocol is consists of user authentication module, public key based data node authentication module, name node authentication module, and data node authentication module. The user authentication module is issued the temporary access ID from TGS after verifing user's identification on Authentication Server. The public key based data node authentication module generates secret key between name node and data node, and generates OTKL(One-Time Key List) using Hash-chain. The name node authentication module verifies user's identification using user's temporary access ID, and issues DT(Delegation Token) and BAT(Block Access Token) to user. The data node authentication module sends the encrypted data block to user after verifing user's identification using OwerID of BAT. Therefore the proposed hadoop security protocol dose not only prepare the exposure of data node's secret key by using OTKL, timestamp, owerID but also detect the reply attack and impersonation attack. Also, it enhances the data access of data node, and enforces data security by sending the encrypted data.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.438-442
• /
• 1999

More and more residential and mobile users are requiring access to the Internet. This paper presents an architecture of the network solution for cost-effective Internet/intranet access between users and Network Service Providers(NSPs). It also presents a functional architecture of Internet access router in the integrated access node system. The proposed Internet access router provides the functionality that users select any of a number of NSPs and mutiple user PPP calls are multiplexed over each secure tunnel between the Internet access router and NSP.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.6
• /
• pp.1-10
• /
• 2021

The interest in underwater acoustic sensor networks (UWASNs), along with the rapid development of underwater industries, has increased. To operate UWASNs efficiently, it is important to adopt well-designed medium access control (MAC) protocols that prevent collisions and allow the sharing of resources between nodes efficiently. On the other hand, underwater channels suffer from a narrow bandwidth, long propagation delay, and low data rate, so existing terrestrial node pairing schemes for non orthogonal multiple access (NOMA) cannot be applied directly to underwater environments. Therefore, a multi-dimensional node pairing scheme is proposed to consider the unique underwater channel in UWASNs. Conventional NOMA schemes have considered the channel quality only in node pairing. Unlike previous schemes, the proposed scheme considers the channel gain and many other features, such as node fairness, traffic load, and the age of data packets to find the best node-pair. In addition, the sender employs a list of candidates for node-pairs rather than path loss to reduce the computational complexity. The simulation results showed that the proposed scheme outperforms the conventional scheme by considering the fairness factor with 23.8% increases in throughput, 28% decreases in latency, and 5.7% improvements in fairness at best.