• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8B
• /
• pp.839-845
• /
• 2009

The Vehicular Ad-hoc Network (VANET) has two main problems to be overcome due to high mobility and frequently changing density: one is short link duration time and the other is high packet loss ratio. To solve the problems, there have been many studies to predict vehicular mobility. Most of the studies try to enhance link expire time and link reliability, however the distance between two relay nodes becomes too short to have high network throughput. In this paper, we propose a new routing algorithm that considers both link expire time and network throughput in the VANET. The proposed algorithm aims to find path with long link expire time and high throughput. Our simulation results show that the proposed algorithm outperforms the legacy greedy algorithm and its variants.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.12
• /
• pp.120-127
• /
• 2008

HMIPv6 draws lots of attentions in recent years for providing an efficient handover and reducing the signaling overhead. HMIPv6 employs MAP(Mobility Anchor Point) in order to minimize a signaling overhead and a local mobility management. MAP completes an efficient mobility management in HMIPv6 network environment with frequent handover. However, HMIPv6 causes load concentration at a paricular MAP and may have unnecessary latency between HN(Mobile Node) and CN(Correspondent Node) within the same network. A MAP may also disturb the route optimization in HMIPv6 network because all packets must be transmitted through a MAP. In this paper, we propose a scheme to optimize the route in HMIPv6 networks according to MAP load. We configure a threshold in order to support the better service into MAP domain. The packets do not pass through MAP and are directly transmitted to AR(Access Router) if the number of current MNs attached to the MAP exceed the desired threshold. We simulate the performance of the proposed scheme and compare with HMIPv6. Resultly, the proposed scheme reduces signaling costs and mitigates concentration of a paticular MAP as well.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.733-742
• /
• 2002

It has been known that the host mobility feature has very significant impact on the QoS (Quality of Service), which is usually required to a real-time multimedia application. The existing QoS support mechanisms to provide the real-time services to fixed network environment, like as RSVP, are inadequate to accommodate the mobile hosts which can frequently change their point of attachments to the fixed network. So, MRSVP (Mobile RSVP) protocol has been proposed to reduce the impacts of host mobility on QoS guarantees, in which a mobile host needs to make advance resource reservations at multiple locations it may possibly visit during the lifetime of the connection. This paper proposes a dynamic dual anchor node (DDAN) architecture which integrates the MRSVP and RSVP tunnel, in addition to the Mobile IP Regional Registration protocol. By limiting the resource reserved in local area, it preserves the lower level of resource reservation, but provides approximately the same degree of QoS support as the existing MRSVP.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.3
• /
• pp.67-78
• /
• 2008

With the rapid development of wireless communication and mobile equipment, many applications for location-based services have been emerging. Moving objects such as vehicles and ships change their positions over time. Moving objects have their moving path, called the trajectory, because they move continuously. To monitor the trajectory of moving objects in a large scale database system, an efficient Indexing scheme to processed queries related to trajectories is required. In this paper, we focus on the issues of minimizing the dead space of index structures. The Minimum Bounding Boxes (MBBs) of non-leaf nodes in trajectory-preserving indexing schemes have large amounts of dead space since trajectory preservation is achieved at the sacrifice of the spatial locality of trajectories. In this thesis, we propose entry relocating techniques to reduce dead space and overlaps in non-leaf nodes. we present performance studies that compare the proposed index schemes with the TB-tree and the R*-tree under a varying set of spatio-temporal queries.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.323-335
• /
• 2015

Mobile healthcare is a fusion of information technology and biotechnology and is a new type of health management service to keep people's health at anytime and anywhere without regard to time and space. The WBAN(Wireless Body Area Network) technology that collects bio signals and the data analysis and monitoring technology using mobile devices are essential for serving mobile healthcare. WBAN consisting of users with mobile devices meet another WBAN during movement, WBANs transmit data to the other media. Because of WBAN conflict, several nodes transmit data in same time slot so a collision will occur, resulting in the data transmission being failed and need more energy for re-transmission. In this thesis, we proposed a MAC protocol for WBAN with mobility to solve these problems. First, we proposed a superframe structure for WBAN. The proposed superframe consists of a TDMA(Time Division Muliple Access) based contention access phase with which a node can transmit data in its own time slot and a contention phase using CSMA/CA algorithm. Second, we proposed a network merging algorithm for conflicting WBAN based on the proposed MAC protocol. When a WBAN with mobility conflicts with other WBAN, data frame collision is reduced through network reestablishment. Simulations are performed using a Castalia based on the OMNeT++ network simulation framework to estimate the performance of the proposed superframe and algorithms. We estimated the performance of WBAN based on the proposed MAC protocol by comparing the performance of the WBAN based on IEEE 802.15.6. Performance evaluation results show that the packet transmission success rate and energy efficiency are improved by reducing the probability of collision using the proposed MAC protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8B
• /
• pp.509-520
• /
• 2007

In this paper, we propose a real-time sensor node platform that guarantees the real-time scheduling of periodic and aperiodic tasks through a multitask-based software decomposition technique. Since existing sensor networking operation systems available in literature are not capable of supporting the real-time scheduling of periodic and aperiodic tasks, the preemption of aperiodic task with high priority can block periodic tasks, and so periodic tasks are likely to miss their deadlines. This paper presents a comprehensive evaluation of how to structure periodic or aperiodic task decomposition in real-time sensor-networking platforms as regard to guaranteeing the deadlines of all the periodic tasks and aiming to providing aperiodic tasks with average good response time. A case study based on real system experiments is conducted to illustrate the application and efficiency of the multitask-based dynamic component execution environment in the sensor node equipped with a low-power 8-bit microcontroller, an IEEE802.15.4 compliant 2.4GHz RF transceiver, and several sensors. It shows that our periodic and aperiodic task decomposition technique yields efficient performance in terms of three significant, objective goals: deadline miss ratio of periodic tasks, average response time of aperiodic tasks, and processor utilization of periodic and aperiodic tasks.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.309-318
• /
• 2004

AAAv6-based Diameter method is using in the user authentication to satisfy the users' increasing user authentication demand and to supply a safe communication between mobile node and server in the Mobile IP. therefore, In this paper, We design a model of server capacity based on EAP-TLS that in one of AAAv6 models with mobility among domains to get the optimized capacity index of the server for user authentication accomplishment. We elicitat the authentication capacity index for each server of which is accomplishing in user authentication using DSA/RSA algorithm and purpose the optimized condition for the AAAv6 capacity by the index.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.1303-1306
• /
• 2005

최근 차량에 설치된 단말기를 통해 길안내 서비스, 교통정보 서비스 등 다양한 정보를 제공하는 텔레매틱스 서비스가 활발하게 연구되고 있다. 하지만 현재 대다수의 텔레매틱스 서비스는 최대 15m의 공간 오차를 가진 GPS 기술을 이용하기 때문에 차량의 정확한 위치정보를 파악하기는 힘들다. 따라서 본 연구에서는 무선 센서 노드를 이용해 GPS보다 정확한 차량의 위치정보와 속도를 감지해 교차로에서 발생할 수 있는 차량 충돌을 예측하고 충돌 위험 정보를 교차로에 근접한 자동차에게 알려주는 텔레매틱스 교통안전시스템을 구성하고 노드 간 통신 프로토콜로서 IEEE 802.15.4[1]를 채택한 후 고정 라우팅 방식으로 차량정보를 베이스 스테이션까지 보내어 교차로 주변차량 전체에 브로드캐스트하는 방식을 취하도록 한다. 빠르게 이동하는 차량의 특성상 교차로 차량 충돌 방지 서비스 구현에 있어서 높은 실시간성과 신뢰성을 갖춘 프로토콜이 요구된다. 따라서 본 차량 충돌 예측을 위한 교통안전시스템의 신뢰성과 실시간성을 평가하기 위하여 Network Simulator 2 (NS/2)[2]를 이용하여 시뮬레이션 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.122-127
• /
• 2006

RFID/USN 은 유비쿼터스 사회의 중요한 기반 인프라로서 고려되고 있다. 또한 다양한 연구를 통해 실용적인 접목이 시도 되고 있다. 특히 물류 시스템에서 물류의 입출 재고와 상태 관리를 위한 연구가 진행 중에 있으며 이는 물품 보관 단위인 파렛트(Pallet) 에 RFID 태그를 부착하여 입/출고시의 물품을 식별하고, Zigbee 무선 통신기능을 가진 센서 모듈에 의해 물품의 환경 상태 정보를 파악하는 형태로 이루어진다. 본 논문은 RFID/ USN 기반의 창고 상태 관리 시스템에서 상태정보 습득 과정의 보안적용을 위한 시스템을 구성을 주된 목적으로 한다. 부가적으로 상태정보 습득에 사용되는 이동형 단말장치의 기능에 대해서 제안한다. 창고 내에 배치되는 RFID 와 센서노드간의 적용 관계 또한 정의한다. 결과적으로 본 논문은 의사판단의 주체인 현장 관리자에 적절한 제어 정보의 제공과 센서의 동작을 제어하기 위한 RFID tag 보안 접근, 그리고 센서 노드 자체의 생존성 이라는 세 가지 관점의 절충점을 찾기 위한 시도로서 설계하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.93-101
• /
• 2010

Although various network management architectures such as centralized, distributed, and hybrid have been presented, any one is not always efficient in all the environment. In this paper, we propose a hierarchical and split network management architecture based on MA+SNMP in order to manage a network of many small NEs distributed over the wide area. Our hierarchical architecture has MA-based proxy management nodes for the flexibility and overhead reduction in NMS as well as SNMP-based NEs considering NE's capacity. Through the analysis with real experiments, we show that our proposal improves some drawbacks and the processing delay of the existing architectures in the given environment.