• International journal of advanced smart convergence
• /
• 제4권1호
• /
• pp.71-87
• /
• 2015

Mobile users want to be provided with undisrupted network services when they navigate on the Next-Generation (NG) wireless networks. For that, interlocking with a heterogeneous network is important, but there have been few studies on the method for guaranteeing global mobility. Thus, this paper proposes the Proxy-LMA technique, the mobile IP-based global inter-networking system, to enhance global mobility and interoperability within the Next-Generation (NG) network environment. The purpose of the proposed Proxy-LMA system is to expand the boundary of the mobility with regards to the existing mobility management protocol (PMIPv6 and MIPv6) in order to guarantee global mobility and interoperability within the heterogeneous network environment. The results of the performance evaluation showed that the proposed Proxy-LMA system was more efficient than other methods from the standpoint of signaling cost and delay in the heterogeneous network environment.

• 한국정보과학회논문지:정보통신
• /
• 제37권3호
• /
• pp.198-203
• /
• 2010

본 논문에서는 자신의 이익만을 극대화하도록 이기적인 행동을 하는 애드혹 네트워크의 노드들을 관리하는 새로운 라우팅 프로토콜을 제안한다. 제안된 라우팅 기법에서는 무선 노드간의 거리와 남은 에너지를 고려하여 노드 간의 전송 비용을 계산하고 이를 통해 에너지 효율적인 경로를 설정한다. 또한, 해당 경로상의 노드들에게 협조적인 행동을 유도하기 위해 메커니즘 디자인의 일종인 VCG 메커니즘을 이용하여 각 중계 노드에게 인센티브를 제공하고 이를 기반으로 대역폭 예약을 수행해 실시간 데이터에 대한 서비스 품질을 보장하도록 하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.305-308
• /
• 1998

GILS is decentralized collection of locators and associated information services used by the public either directly or through intermediaries to find information. This standard specifies how electronic network searches can be experessed and how results are returned. GILS is an innovative network approach to assist user in locating information resoruces. This thesis proposes architecture of GILS. First, we study fundamental implementation technologies by the way of GILS and Z39.50 protocol. And then, after surveying GILs related technologies we introduce web-based GILS implementation. This study failed to implement GILS in commercial sector, but have an impliction to raise further research issue.

• 한국CDE학회논문집
• /
• 제5권1호
• /
• pp.79-87
• /
• 2000

This paper presents an integrated but open product development environment for distributed and collaborative design. The web-based framework, called DOME, allows designers to build integrated models using both local and distributed resources, and to collaborate by exchanging services in a network-centric product development environment. Thus, an integrated model can be created while each participant focuses on his or her own area of expertise. A design problem model is created by connecting modules, which represent specific system components, analysis capabilities/software, disciplines, or organizations relevant to the problem. The modules interact with each other using service exchanges based upon the CORBA standard communication protocol. The goal of this framework is tall provide the ability to rapidly construct integrated design problem models to facilitate collaborative design work, improve product quality and reduce development time. Ultimately, it should allow specialized engineering applications and design problem models to operate under a common design environment.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.5-6
• /
• 2006

iSCSI is a block-oriented storage access protocol that enables a user to recognize a remote storage as their own local block device through general TCP/IP networks. This paper presents an alternative approach to overcome the limited storage space of mobile devices based on the iSCSI initiator driver in IPv6 environment, which was originally designed for wired networks.

• Journal of Information Processing Systems
• /
• 제11권4호
• /
• pp.616-629
• /
• 2015

A mobile terminal will expect a number of handoffs within its call duration. In the event of a mobile call, when a mobile node moves from one cell to another, it should connect to another access point within its range. In case there is a lack of support of its own network, it must changeover to another base station. In the event of moving on to another network, quality of service parameters need to be considered. In our study we have used the Markov decision process approach for a seamless handoff as it gives the optimum results for selecting a network when compared to other multiple attribute decision making processes. We have used the network cost function for selecting the network for handoff and the connection reward function, which is based on the values of the quality of service parameters. We have also examined the constant bit rate and transmission control protocol packet delivery ratio. We used the policy iteration algorithm for determining the optimal policy. Our enhanced handoff algorithm outperforms other previous multiple attribute decision making methods.

• 정보보호학회논문지
• /
• 제18권6B호
• /
• pp.259-269
• /
• 2008

Applying Varying Pseudonym (VP) to design of Radio Frequency Identification (RFID) authentication protocol outperforms the other existing approaches in several respects. However, this approach is prone to the well-known denial-ofservice (DOS) attack. In this paper, we examine the de-synchronization problems of VP-based RFID authentication protocols, and propose effective solutions to eliminate such weaknesses. We shall show that the proposed solutions indeed improve the security for these protocols, and moreover, these solutions require 0(1) computational cost for identitying a tag and 0(1) key space on the tag. These excellent performances make them very attractive to many RFID applications.

• International Journal of Computer Science & Network Security
• /
• 제22권3호
• /
• pp.107-112
• /
• 2022

The automotive industry is motivated to provide more and more amenities to its customers. The industry is taking advantage of artificial intelligence by increasing different sensors and gadgets in vehicles machoism is forward collision warning, at the same time road accidents are also increasing which is another concern to address. So there is an urgent need to provide an A.I based system to avoid such incidents which can be address by using artificial intelligence and global positioning system. Automotive/smart vehicles protection has become a major study of research for customers, government and also automotive industry engineers In this study a two layered novel hypothetical approach is proposed which include in-time vehicle/obstacle detection with auto warning mechanism for collision detection & avoidance and later in a case of an accident manifestation GPS & video camera based alerts system and interrupt generation to nearby ambulance or rescue-services units for in-time driver rescue.

• 한국정보과학회논문지:정보통신
• /
• 제34권6호
• /
• pp.435-445
• /
• 2007

Snoop 프로토콜은 유 무선 혼합망에서 무선 링크에서 발생하는 TCP 패킷 손실을 효과적으로 보상하여 TCP 전송률을 향상시킬 수 있는 효율적인 프로토콜이다. 하지만, 무선 링크에서 연집한 패킷 손실이 발생하는 경우에는 지역 재전송을 효과적으로 수행하지 못하여 전송 효율이 떨어진다는 문제점이 있다. 이러한 Snoop 프로토콜의 문제점을 개선하기위해 무선 구간에서 TCP-SACK의 장점을 활용한 SACK-Aware-Snoop, SNACK 메커니즘 등이 제안되었다. SACK-Aware-Snoop, SNACK 메커니즘은 연집한 패킷손실 환경에서도 Snoop 프로토콜보다 높은 전송률을 보장하지만 전송 계층의 ACK 패킷을 기반으로 재전송을 수행한다는 점은 ACK 패킷의 손실에 심각한 전송 성능 저하를 가져오며, 무선 구간에서 SACK 옵션의 사용은 무선망의 대역폭과 이동 단말의 한정된 에너지 자원을 불필요하게 낭비하는 문제를 초래하게 된다. 본 논문에서는 이러한 문제점을 개선하기 위해 Cross-layer 기법을 적용한 지역 재전송 기법인 C-Snoop(Cross-layer Snoop) 프로토콜을 제안한다. C-Snoop 프로토콜은 현재 유 무선 혼합망에서 가장 널리 사용되는 IEEE 802.11 MAC 프로토콜 기반의 지역 재전송 메커니즘으로서, MAC 계층의 ACK 패킷과 새로이 제안된 지역 재전송 타이머에 의해 효율적인 지역 재전송을 수행한다. ns-2 시뮬레이터를 이용한 실험을 통해 C-Snoop의 지역 재전송 기법은 무선 구간의 연집적인 패킷 손실에 대해 효율적인 보상을 수행하며, 이동 단말의 에너지 효율성을 향상시키는 것을 확인할 수 있었다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.