• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.340-342
• /
• 2003

Location based services based on positions of moving objects are expanding the business area gradually. The location is included all estimate position of the future as well as the position of the present and the past. Location based routing service is active business application in which the position information of moving objects is applied efficiently. This service includes the trajectory of past positions, the real-time tracing of present position of special moving objects, and the shortest and optimized paths combined with map information. In this paper, we describes the location based routing services is extend in distributed web GIS environment. Web GIS service systems provide the various GIS services of analyzing and displaying the spatial data with friendly user - interface. That is, we propose the efficient architecture and technologies for servicing the location based routing services in distributed web GIS environment. The position of moving objects is acquired by GPS (Global Positioning System) and converted the coordinate of real world by map matching with geometric information. We suppose the swapping method between main memory and storages to access the quite a number of moving objects. And, the result of location based routing services is wrapped the web-styled data format. We design the schema based on the GML. We design these services as components were developed in object-oriented computing environment, and provide the interoperability, language-independent, easy developing environment as well as re - usability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1034-1051
• /
• 2016

Mobility models are invaluable for determining the performance of routing protocols in opportunistic networks. The movement of nodes has a significant influence on the topological structure and data transmission in networks. In this paper, we propose a new mobility model called the campus-based community mobility model (CBCNM) that closely reflects the daily life pattern of students on a real campus. Consequent on a discovery that the pause time of nodes in their community follows a power law distribution, instead of a classical exponential distribution, we abstract the semi-Markov model from the movement of the campus nodes and analyze its rationality. Then, using the semi-Markov algorithm to switch the movement of the nodes between communities, we infer the steady-state probability of node distribution at random time points. We verified the proposed CBCNM via numerical simulations and compared all the parameters with real data in several aspects, including the nodes' contact and inter-contact times. The results obtained indicate that the CBCNM is highly adaptive to an actual campus scenario. Further, the model is shown to have better data transmission network performance than conventional models under various routing strategies.

• Journal of Information Processing Systems
• /
• 제13권6호
• /
• pp.1544-1553
• /
• 2017

The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.

• ETRI Journal
• /
• 제28권1호
• /
• pp.31-44
• /
• 2006

In a packet switching network, congestion is unavoidable and affects the quality of real-time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well-known solutions for quality-of-service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2009년도 정보 및 제어 심포지움 논문집
• /
• pp.45-47
• /
• 2009

Wireless Sensor Network(WSN) has been very popular in unattended surveillance systems recently. For Applying WSN into Building Automation system(BAS), a novel hierarchial network structure and static routing algorithm which eliminates the scalability limitation of Zigbee are proposed in this paper. The static routing algorithm relying on the hierarchial network address reduces the computational complexity to a great extent and has a real-time performance which satisfies urgent applications well.

• KIEE International Transactions on Power Engineering
• /
• 제4A권2호
• /
• pp.58-68
• /
• 2004

This paper presents an optimal routing algorithm (ORA) for maximizing voltage stability as well as for minimizing power loss in radial power systems. In the proposed ORA, a novel voltage stability index (VSI) for real-time assessment is newly introduced based on the conventional critical transmission path framework. In addition, the suggested algorithm can automatically detect the critical transmission paths resulting in voltage collapse when additional real or reactive loads are added. To implement an effective ORA, we have developed an improved branch exchange (IBE) method based on a loss calculation index and tie-branch power flow equations, which are suggested for real-time applications. The proposed algorithm has been tested with IEEE test systems as well as a large-scale power system in Korea to demonstrate its effectiveness and efficiency.

• 한국도로학회논문집
• /
• 제14권3호
• /
• pp.163-171
• /
• 2012

수요대응형 교통수단(Demand Responsive Transit)은 변화하는 이동수요에 대응하는 탄력적인 교통수단으로 단순히 노약자와 장애인을 위한 복지교통 서비스의 영역이 아니라, 무선통신과 위치정보서비스(Location Based Service: LBS)의 발달로 인하여 도심형 수단으로 보다 효율적인 교통수단으로 자리매김하고 있다. 그러나 문전서비스(Door-to-Door)를 제공하는 수요대응형 교통수단 시뮬레이션에 적합한 상용툴의 부재로 인하여 알고리즘이나 차량 운행 요소를 면밀하게 분석하기 힘든 어려움이 있었다. 본 연구는 수요대응형 교통수단에 연관된 다양한 차량 운영계획과 알고리즘을 구현, 평가할 수 있는 시뮬레이션 환경을 제안한다. 문전서비스(Door-to-Door) 기반의 차량 운행 모형을 적용하기 위하여 확보되어야 하는 시뮬레이션 입력 데이터를 정의하고 있으며, 수요대응형 교통수단의 대표적인 범주에 속하는 실시간 합승 택시(Shared-Taxi) 서비스를 서울시 교통망과 택시 수요를 이용하여 적용하였다. 합승 택시 운행 계획을 위하여 Nearest Vehicle Dispatch(NVD)와 Insertion Heuristic(IH), 두 종류의 알고리즘을 제안하였으며, 제안된 시뮬레이션을 통하여 성능을 비교하였다. 또한, 합승(Ride-sharing)을 허용하지 않는 일반적인 택시와의 비교를 통하여 시스템 효율 향상과 서비스 품질 변화를 분석하였다.

• Water Engineering Research
• /
• 제2권2호
• /
• pp.113-121
• /
• 2001

The objective of this study is to develop a prediction mode for a flood forecasting system in the downstream of the Nakdong river basin. Ranging from the gauging station at Jindong to the Nakdong estuary barrage, the hydraulic flood routing model(DWOPER) based on the Saint Venant equation was calibrated by comparing the calculated river stage with the observed river stages using four different flood events recorded. The upstream boundary condition was specified by the measured river stage data at Jindong station and the downstream boundary condition was given according to the tide level data observed at he Nakdong estuary barrage. The lateral inflow from tributaries were estimated by the rainfall-runoff model. In the calibration process, the optimum roughness coefficients for proper functions of channel reach and discharge were determined by minimizing the sum of the differences between the observed and the computed stage. In addition, the forecasting lead time on the basis of each gauging station was determined by a numerical simulation technique. Also, we suggested a model structure for a real-time flood forecasting system and tested it on the basis of past flood events. The testing results of the developed system showed close agreement between the forecasted and observed stages. Therefore, it is expected that the flood forecasting system we developed can improve the accuracy of flood forecasting on the Nakdong river.

• 한국통신학회논문지
• /
• 제28권12B호
• /
• pp.1135-1144
• /
• 2003

본 논문에서는 IEEE 802.11 무선 LAN의 불완전한 link mobility를 해결하기 위한 semi-soft 핸드오프 방안을 고찰하였다. 제안한 방법은 AP와 portal 부분에 버퍼와 MAC 라우팅 테이블을 추가하여 이동 단말이 핸드오프 시간동안 받지 못하는 프레임을 기존 AP의 버퍼에 저장하고 핸드오프 후에 갱신된 MAC 라우팅 테이블을 이용하여 프레임을 Portal에서 이동한 AP로 reroute 하였다. 이후 이동 단막은 이동 중에도 프레임의 손실 없이 지속적으로 프레임의 수신이 가능하게 되어 IEEE 802.11 무선 LAN 환경에 mobile IP나 voice over IP (VoIP) 같은 길시간 서비스의 구현을 가능하게 한다. 제안한 핸드오프 방법의 성능 측정을 위하여 시뮬레이션을 수행하였으며 프레임 손실 없이 실시간 서비스에 적합한 지연 시간안에 프레임이 이동 단말로 전달되는 것을 확인할 수 있었다.

• 대한교통학회:학술대회논문집
• /
• 대한교통학회 2000년도 제37회 학술발표회논문집
• /
• pp.25-47
• /
• 2000

In route guidance systems fastest-path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this study is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e. Pareto optimal) paths for real-time vehicle routing which reflect the drivers' preferences and route choice behaviors. We propose two pruning algorithms that reduce the search area based on a context-dependent linear utility function and thus reduce the computation time. The basic notion of the proposed approach is that ⅰ) enumerating all nondominated paths is computationally too expensive, ⅱ) obtaining a stable mathematical representation of the drivers' utility function is theoretically difficult and impractical, and ⅲ) obtaining optimal path given a nonlinear utility function is a NP-hard problem. Consequently, a heuristic two-stage strategy which identifies multiple routes and then select the near-optimal path may be effective and practical. As the first stage, we utilize the relaxation based pruning technique based on an entropy model to recognize and discard most of the nondominated paths that do not reflect the drivers' preference and/or the context-dependency of the preference. In addition, to make sure that paths identified are dissimilar in terms of links used, the number of shared links between routes is limited. We test the proposed algorithms in a large real-life traffic network and show that the algorithms reduce CPU time significantly compared with conventional multi-criteria shortest path algorithms while the attributes of the routes identified reflect drivers' preferences and generic route choice behaviors well.