• 한국정보통신학회논문지
• /
• 제25권8호
• /
• pp.1088-1094
• /
• 2021

본 논문에서는 DAMA 기반 MF-TDMA 위성시스템에서 Full Mesh 라우팅을 지원하기 위해 제한적 BMA네트워크 구조와 D-ARP 기법을 제안한다. 제안하는 네트워크 구조를 통해 기존의 상용 라우터 및 라우팅 프로토콜을 위성통신시스템에 바로 적용할 수 있으며, 라우팅 프로토콜에 의한 메시지 오버헤드를 경감시킬 수 있다. 또한, 브로드캐스팅 통신이 제한되는 네트워크에서 원격지 단말들의 MAC 주소 정보를 개별 단말에서 획득할 수 있는 D-ARP 기법을 제안한다. D-ARP 기법은 Hub 단말이 획득한 Spoke 단말들의 IP 주소 및 MAC 주소 정보를 브로드캐스팅 채널을 통해 Spoke 단말들에게 공유한다. 마지막으로 네트워크 시뮬레이션을 통해 제안하는 네트워크 구조 및 D-ARP 기법의 성능을 분석한다.

• 전자공학회논문지CI
• /
• 제49권1호
• /
• pp.39-45
• /
• 2012

무선 센서 네트워크(Wireless Sensor Network)는 사람이 직접 접근하기 불가능한 군사지역이나 자연 환경의 감시, 혹은 안전감시를 위한 목적으로 각 상황의 특성에 맞는 다양한 정보를 수집하는데 많이 이용되고 있다. 지금까지 제시된 프로토콜 중 LEACH 프로토콜은 에너지의 균등한 소모를 특징으로 많이 쓰이고 있다. 하지만 거리에 따른 에너지 소모의 증가로 원거리 노드의 에너지 소모 문제가 대두되었는데, 지금까지 여러 가지 해결방안들이 제시되었는데 대부분 중앙 시스템 방식이다. 본 논문에서는 LEACH 프로토콜을 사용한 무선 센서 네트워크를 모델로 하여, 네트워크 규모가 커질수록 1-hop 전송방식에서 발생할 수 있는 원거리 센서 노드의 에너지 불균형 문제를 해결하였다. 또한, 중앙 시스템 방식이 아닌 센서 노드 자체에서 클러스터링 문제를 해결할 수 있는 분산 시스템 방식의 라이프타임 향상 알고리즘을 제안하였다.

• 한국전자거래학회지
• /
• 제5권1호
• /
• pp.105-122
• /
• 2000

Enterprise integration and virtual enterprise are practical visions of industrial information implementations in the information society. In these environments, the distributed and heterogeneous data sources should be exchanged and shared in effective and integrated way. However, the distributed and heterogeneous data sources are managed by independent and heterogeneous computer systems, thus system users and developers are faced difficulties in implementing enterprise integration environments, In this study, we designed and developed a database broker system utilizing a routing broker method to provide transparent location access mechanisms for the distributed and heterogeneous data sources. The proposed mechanism is designed to act as a middle tier between clients and multiple servers, and adopts Java, CORBA, and JDBC as its state-of-the-art techniques.

• Journal of information and communication convergence engineering
• /
• 제13권4호
• /
• pp.248-256
• /
• 2015

With the dramatic increase in mobile traffic in recent years, some of the limitations of mobility management frameworks have magnified. The current centralized mobility management (CMM) strategy has various problems, such as a suboptimal routing path, low scalability, signaling overhead, and a single point of failure. To overcome these weaknesses in the CMM strategy, the Internet Engineering Task Force has been discussing distributed mobility management (DMM) strategies. The fundamental concept of a DMM strategy is to distribute the mobility anchors closer to the users. While the distribution of mobility anchors results in low-cost traffic delivery, it increases the signaling cost. To reduce this higher signaling cost, we propose a new DMM strategy applying the pointer forwarding technique. The proposed strategy keeps the existing tunnels and extends the traffic path as much as possible. In this paper, we analyze the performance of the pointer forwarding-DMM strategy and discuss its pros and cons.

• 한국통신학회논문지
• /
• 제39B권1호
• /
• pp.8-16
• /
• 2014

본 논문에서는 IP 기반의 이동 네트워크에서 빠르고 확장성이 용이한 상태 보존형 (Stateful) 플로우 라우팅을 포함하는 플로우 이동성 관리 방법을 제안하였다. 제안된 방식은 단말의 이동성을 고려하여 플로우 라우팅을 수행하는 크로스오버 플로우 라우터를 도입하여 분산적으로 플로우 이동성을 관리하도록 하였고, 이로써 기존의 IP 패킷 라우팅에 의한 기존의 이동성 지원 방법의 문제점인 긴 지연 시간과 이동성 관리 오버헤드 문제를 완화시킬수 있도록 하였다. 제안된 방식의 성능 분석을 수행하여 기존의 IP 기반 이동성 지원 방식들과 비교하였으며, 이를 통해 제안된 방식의 우수성을 증명하였다.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
• /
• pp.81-84
• /
• 2005

Various design schemes for network using wireless sensor nodes have been widely studied on the several application areas ranging from the real world information collection to environmental monitor. Currently, the schemes are focused on the design of sensor network for low power consumption, power-aware routing protocol, micro miniature operating system and sensor network middleware. The indoor localization system that identifies the location of the distributed nodes in a wireless sensor network requires features dealing with mobility, plurality and other environmental constraints of a sensor node. In this paper, we present an efficient location system to cope with mobility of multiple mobile nodes by designing a location handler that processes location information selectively depending on the nodes' density in a specific region. In order to resolve plurality of multiple mobile nodes, a routing method for the location system is also proposed to avoid the occurrence of overlapped location data.

• 한국정보과학회논문지:정보통신
• /
• 제28권4호
• /
• pp.508-516
• /
• 2001

본 논문에서는 VOD(Video On Demand)나 실시간 방송 데이타 전송과 같은 비상호적 멀티미디어 응용을 위한 멀티캐스트 라우팅 알고리즘을 제안한다. 비상호적 멀티미디어 응용에서는 송신자가 다수로 존재할 수 있다. 송신자가 다수로 존재할 때 적용할 수 있는 멀티캐스트 라우팅 알고리즘을 설계하고 기존의 단 하나의 송신자가 존재할 때와 비교하여 지연 시간 및 비용 측면에서 현저한 성능향상을 가져올 수 있음을 실험적으로 증명한다. 제안된 알고리즘의 성능 검증을 위해 광역 ATM(Asynchronous Transfer Mode)네트워크를 모델링하고 모의 실험을 수행하였다. 모의 실험 결과 다양한 네트워크 환경하에서 다수의 송신자 존재시 하나의 송신자만 존재할 때와 비교하여 현저한 성능향상을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4661-4676
• /
• 2014

In Wireless Mesh Networks (WMN), an authentication technique can be compromised due to the distributed network architecture, the broadcast nature of the wireless medium and dynamic network topology. Several vulnerabilities exist in different protocols for WMNs. Hence, in this paper, we propose trust based authentication and key establishment for secure routing in WMN. Initially, a trust model is designed based on Ant Colony Optimization (ACO) to exchange the trust information among the nodes. The routing table is utilized to select the destination nodes, for which the link information is updated and the route verification is performed. Based on the trust model, mutual authentication is applied. When a node moves from one operator to another for accessing the router, inter-authentication will be performed. When a node moves within the operator for accessing the router, then intra-authentication will be performed. During authentication, keys are established using identity based cryptography technique. By simulation results, we show that the proposed technique enhances the packet delivery ratio and resilience with reduced drop and overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2267-2285
• /
• 2016

Information Centric Networking that uses content name instead of IP address as routing identifier can handle challenges such as traffic explosion and user mobility, but it also suffers from scalability and incompatibility problems. In this paper by combining the concept of software defined networking and Internet end to end arguments, we propose a wide area deployable software defined information centric networking service model named SD-ICN. SD-ICN employs a dual space structure that separates edge service network and core transmission network. The enhanced SDN techniques are used in edge service network in order to implement intelligent data routing and caching, while traditional IP technique is reserved in core transmission network so as to provide wide area high speed data transmission. Besides, a distributed name resolution system based on the cooperation of different controllers is also presented. The prototype experiments in our campus network show that SD-ICN can be deployed in a scalable and incremental way with no modification of the core network, and can support typical communication modes such as multicast, mobility, multihoming, load balancing, and multipath data transmission effectively.

• Journal of Communications and Networks
• /
• 제18권4호
• /
• pp.580-588
• /
• 2016

Energy efficiency is the main objective in the design of a wireless sensor network (WSN). In many applications, sensing data must be transmitted from sources to a sink in a timely manner. This paper describes an investigation of the trade-off between two objectives in WSN design: minimizing energy consumption and minimizing end-to-end delay. We first propose a new distributed clustering approach to determining the best clusterhead for each cluster by considering both energy consumption and end-to-end delay requirements. Next, we propose a new energy-cost function and a new end-to-end delay function for use in an inter-cluster routing algorithm. We present a multi-hop routing algorithm for use in disseminating sensing data from clusterheads to a sink at the minimum energy cost subject to an end-to-end delay constraint. The results of a simulation are consistent with our theoretical analysis results and show that our proposed performs much better than similar protocols in terms of energy consumption and end-to-end delay.