• ETRI Journal
• /
• 제34권3호
• /
• pp.462-465
• /
• 2012

This letter proposes a new distributed scheduling scheme combined with routing to support the quality of service of real-time applications in wireless mesh networks. Next, this letter drives average end-to-end delay of the proposed scheduling scheme that sequentially schedules the slots on a path. Finally, this letter simulates the time division multiple access network for performance comparison. From the simulation results, when the average number of hops is 2.02, 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 28%, 10%, 17%, 27%, and 30%, respectively, compared to the conventional random scheduling scheme.

• 한국정보전자통신기술학회논문지
• /
• 제10권5호
• /
• pp.424-434
• /
• 2017

산업 무선 센서 네트워크에서는 많은 응용들이 복합적인 서비스 품질 지원을 요구한다. 본 논문에서는 산업 무선 센서 네트워크에서 실시간 서비스의 신뢰성을 향상시키기 위하여 기회적 실시간 모니터링 데이터 전달 프로토콜을 제안한다. 전송 실패를 복구하기 위해 가장 많이 알려진 재전송 기법들은 실시간 요구사항에 위배되는 추가적 딜레이를 발생시키기 때문에 실시간 데이터 전달에 적절치 않다. 제안 프로토콜은 무선 네트워크의 브로드캐스팅 특성과 시간적 기회 제공 방법을 사용한다. 브로드캐스팅 특성을 통해서 라디오 반경 내 모든 이웃에게 전달하고, 시간적 기회 제공 방법으로 중계 우선순위를 정하여 모든 노드들이 중계 기회를 얻을 수 있게 한다. 제안 방안은 최대한 많은 노드가 라우팅에 참여하여 실시간 데이터 전송 확률을 높인다. 시뮬레이션을 통하여 제안 방안이 실시간 데이터 전송과 신뢰성 측면에서 우월함을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3369-3385
• /
• 2019

There are various research challenges in vehicular ad hoc networks (VANETs) that need to be focused until an extensive deployment of it becomes conceivable. Design and development of a scalable routing algorithm for VANETs is one of the critical issue due to frequent path disruptions caused by the vehicle's mobility. This study aims to provide a novel road-aware routing protocol for vehicular networks named as Two-level hierarchical Hybrid Road-Aware (THERA) routing for vehicular ad hoc networks. The proposed protocol is designed explicitly for inter-vehicle communication. In THERA, roads are distributed into non-overlapping road segments to reduce the routing overhead. Unlike other protocols, discovery process does not flood the network with packet broadcasts. Instead, THERA uses the concept of Gateway Vehicles (GV) for the discovery process. In addition, a route between source and destination is flexible to changing topology, as THERA only requires road segment ID and destination ID for the communication. Furthermore, Road-Aware routing reduces the traffic congestion, bypasses the single point of failure, and facilitates the network management. Finally yet importantly, this paper also proposes a probabilistical model to estimate a path duration for each road segment using the highway mobility model. The flexibility of the proposed protocol is evaluated by performing extensive simulations in NS3. We have used SUMO simulator to generate real time vehicular traffic on the roads of Gangnam, South Korea. Comparative analysis of the results confirm that routing overhead for maintaining the network topology is smaller than few previously proposed routing algorithms.

• 한국시뮬레이션학회논문지
• /
• 제12권3호
• /
• pp.55-68
• /
• 2003

As mobile IP has been suggested only to support mobility of mobile station(MS) by which it dose nothing but guarantee MS's new connection to the network, it is for nothing in Quality of Service(QoS) after handoff of MS. QoS is very important factor in mobile IP network to provide multimedia applications and real-time services in mobile environment, and it is closely related to handoff delay Therefore as a main issue in mobile IP research area, handoff delay problem is actively studied to guarantee and promote QoS. In this paper, in order to resolve such a problem, we suggest Simple Network Management Network(SNMP) information-based routing that adds keyword management method to information-based routing in active network, and then propose QoS controlled handoff by SNMP information-based routing. After setting up routing convergence time, modeling of suggested method and existing handoff method is followed in order to evaluate the simulations that are carried out with NS-2. The result of simulation show the improvement of handoff delay, and consequently it turns off the QoS has been improved considerably.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2202-2217
• /
• 2012

The transmission opportunities between nodes in Delay Tolerant Network (DTNs) are uncertain, and routing algorithms in DTNs often need nodes serving as relays for others to carry and forward messages. Due to selfishness, nodes may ask the source to pay a certain reward, and the reward may be varying with time. Moreover, the reward that the source obtains from the destination may also be varying with time. For example, the sooner the destination gets the message, the more rewards the source may obtain. The goal of this paper is to explore efficient ways for the source to maximize its total reward in such complex applications when it uses the probabilistic two-hop routing policy. We first propose a theoretical framework, which can be used to evaluate the total reward that the source can obtain. Then based on the model, we prove that the optimal forwarding policy confirms to the threshold form by the Pontryagin's Maximum Principle. Simulations based on both synthetic and real motion traces show the accuracy of our theoretical framework. Furthermore, we demonstrate that the performance of the optimal forwarding policy with threshold form is better through extensive numerical results, which conforms to the result obtained by the Maximum Principle.

• 전기학회논문지
• /
• 제64권11호
• /
• pp.1578-1586
• /
• 2015

Personal rapid transit (PRT) is getting attention as a new form of transportation. It is energy efficient and provides the high level of passenger service. In this study, the dynamic PRT dispatching and routing problem is dealt with. Passengers request transportation service on a complex network, and an operating system monitors passenger arrivals and coordinates vehicles in real time. A new online dispatching and routing algorithm is proposed, which minimizes the total travel distance of vehicles and the waiting time of passengers. The algorithm dispatches vehicles by considering multiple vehicles' state and multiple passengers at the same time. In particular, finding the shortest-time path is attempted by taking into account the future congestion on lanes. Discrete-event simulation is employed to validate the performance of the proposed algorithm. The results show the algorithm in this study outperforms others.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2003년도 추계학술대회 및 정기총회
• /
• pp.139-144
• /
• 2003

Mobile Node has to maintain communication as they move form place to place, so it doesn't guarantee Quality of Service(QoS). Fast Handoff is important to provide multimedia and real-time applications services in mobile, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to quarantee QoS as a main issue in mobile IP research area. Next generation Mobile IPv6 resolve this problem somewhat, triangle problem for first packet and handoff delay still remain. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-Based routing. After modeling of suggested method and existing handoff method, simulations are carried out with NS-2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.

• 한국농공학회지
• /
• 제36권3호
• /
• pp.60-66
• /
• 1994

This paper is to validate the proposed models for the real-time forecasting for the Keum river estuary dam such as tidal-level forecasting model, one-dimensional unsteady flood routing model, and Kalman filter models. The tidal-level forecasting model was based on semi-range and phase lag of four tidal constituents. The dynamic wave routing model was based on an implicit finite difference solution of the complete one-dimensional St. Venant equations of unsteady flow. The Kalman filter model was composed of a processing equation and adaptive filtering algorithm. The processng equations are second ordpr autoregressive model and autoregressive moving average model. Simulated results of the models were compared with field data and were reviewed.

• 한국시뮬레이션학회논문지
• /
• 제16권1호
• /
• pp.39-47
• /
• 2007

도심지내 이동시 지점 간 속도는 시간대와 해당 지점에 따라 차이가 발생한다. 또한 두 지점 사이에는 수많은 신호대기와 병목 구간 등으로 인한 지체가 빈번히 발생한다. 이러한 지체 시간은 차량 경로를 계획함에 있어서 상당히 중요한 요소로 작용한다. 하지만 기존 차량 경로 문제 중 지점 간 이동 거리와 이동 시간에 초점을 맞춘 연구에서 지점 이동시 발생하는 지체에 대해서는 연구가 활발히 진행되지 않았다. 이에 본 연구에서는 지체 시간을 고려한 현실적인 차량 경로 문제에 접근한다. 이를 위해 신호 대기 간 발생하는 지체 시간과 병목 구간에서 발생하는 지체 시간을 추정하는 모델을 제시한다. 추정된 결과를 반영한 최적 차량 경로를 도출하여 지체 시간을 고려하지 않은 경로와 결과를 비교해 봄으로써 본 연구에서 제시하고 있는 방법이 우수하며 효율적임을 제시한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권4호
• /
• pp.741-762
• /
• 2011

Recently, multicast routing protocols become increasingly important aspect in Mobile Ad hoc Networks (MANETs), as they effectively manage group communications. Meanwhile, multimedia and real-time applications are becoming essential need for users of MANET. Thus it is necessary to design efficient and effective Quality of Service (QoS) multicast routing strategies. In this paper, we address the scalability problem of multicast routing protocols to support QoS over MANETs. In particular, we introduce a Position-Based QoS Multicast Routing Protocol (PBQMRP). Basically, the protocol based on dividing the network area into virtual hexagonal cells. Then, the location information is exploited to perform efficient and scalable route discovery. In comparison with other existing QoS multicast routing protocols, PBQMRP incurs less control packets by eliminating network flooding behavior. Through simulation, the efficiency and scalability of PBQMRP are evaluated and compared with the well-known On-Demand Multicast Routing Protocol (ODMRP). Simulation results justify that our protocol has better performance, less control overhead and higher scalability.