• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.1
• /
• pp.17-34
• /
• 2022

This paper develops a model for dynamic station assignment to optimize the Demand Responsive Transit (DRT) operation. In the process of optimization, we use the bus travel time as a variable for DRT management. In addition, walking time, waiting time, and delay due to detour to take other passengers (detour time) are added as optimization variables and entered for each DRT passenger. Based on a network around Anaheim, California, reserved origins and destinations of passengers are assigned to each demand responsive bus, using K-means clustering. We create a model for selecting the dynamic station and bus route and use Non-dominated Sorting Genetic Algorithm-III to analyze seven scenarios composed combination of the variables. The result of the study concluded that if the DRT operation is optimized for the DRT management, then the bus travel time and waiting time should be considered in the optimization. Moreover, it was concluded that the bus travel time, walking time, and detour time are required for the passenger.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.120-129
• /
• 2010

MANET(Mobile Ad Hoc NETwork) is a collection of mobile nodes that are free to move and organize themselves in an arbitrary manner without any fixed infrastructures. These mobile nodes are connected by wireless links and act as routers for all other nodes in the network. As a router each node in MANET consumes its batteries when forwarding a message, and the selection of the best path to minimize the total power needed to route packets is needed to maximize the lifetime of all nodes. In this paper, we propose a routing protocol considering the remaining battery capacity of nodes in the routing paths. The proposed scheme prevents the battery of each node from being overused and increases the lifetime of the network.

• Journal of Internet Computing and Services
• /
• v.15 no.2
• /
• pp.9-18
• /
• 2014

The sensors attached on/in a person are moved since human body frequency changes their activity, therefore in wireless body area networks, nodal mobility and non-line-of-sight condition will impact on performance of networks such as energy efficiency and reliable communication. We then proposed schemes which study on forwarding decisions against frequent change of topology and channel conditions to increase reliable connections and improve energy efficiency. In this work, we control the size of packets, forwarding rate based on ratio of input links and output links at each node. We also robust the network topology by extending the peer to peer IEEE 802.15.4-based. The adaptive topology from chain-based to grid-based can optimal our schemes. The simulation shows that these approaches are not only extending network lifetime to 48.2 percent but also increase around 6.08 percent the packet delivery ratio. The "hot spots" problem is also resolved with this approach.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.2
• /
• pp.1-5
• /
• 2007

Wavelength-division multiplexed (WDM) networks are emerging to be the right choice for the future transport networks. In WDM networks, the optical layer provides circuit-switched lightpath services to the client layer such as IP, SONET and ATM. The set of lightpaths in the optical layer defines the virtual topology. Since the optical switches are reconfigurable, the virtual topology can be reconfigured in accordance with the changing traffic demand pattern at theclient layer in order to optimize the network performance. We present a new approach to the virtual topology reconfiguration and loadbalancing problem for wavelength-routed, optical wide-area networks under dynamic traffic demand. By utilizing the measured Internet backbone traffic characteristics, our approach follows the changes in traffic without assuming that the future traffic pattern is known. For the simulation traffic modeling, we collected the data from real backbone traffic. Experiments show that the standard deviation compared to previous technique is reduced.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.199-202
• /
• 2013

In the cluster mechanism of the wireless sensor network, the network lifetime is affected by how cluster heads are selected. One of the representative clustering mechanisms, the low-energy adaptive clustering hierarchy (LEACH), selects cluster heads periodically, resulting in high energy consumption in cluster reconstruction. On the other hand, the adaptive clustering algorithm via waiting timer (ACAWT) proposes a non-periodic re-clustering mechanism that reconstructs clusters if the remaining energy level of a cluster head reaches a given threshold. In this paper, we propose a re-clustering mechanism that uses multiple remaining node energy levels and does re-clustering when the remaining energy level of a cluster head reaches one level lower. Also, in determining cluster heads, both of the number of neighbor nodes and the remaining energy level are considered so that cluster heads can be more evenly placed. From the simulations based on the Qualnet simulator, we validate that our proposed mechanism outperforms ACAWT in terms of the network lifetime.

• Journal of Digital Contents Society
• /
• v.18 no.2
• /
• pp.411-422
• /
• 2017

Current policies for sharing bandwidth increase average throughput and improve utilization of the bandwidth in the local network. However, with these policies, a central administer, which is responsible for allocating bandwidth to each network flow, cannot allocate resources based on user characteristics. Thus, it leads to unfair bandwidth allocation because it does not guarantee services based on user characteristics. Therefore, we propose a novel negotiation method to share the bandwidth in a limited bandwidth network, in which, a user negotiates with other users to gain more resource. Ideally, we use a fuzzy system to infer and determine whether a device will request bandwidth or not based on the current usage of the given device. We conduct two experiments consisting of a video streaming simulation in OPNET and a real-time video streaming in WebRTC. The results of the experiment indicate that the proposed method can flexibly share the bandwidth utilization based on user's requirement in the network.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.391-393
• /
• 2005

최근 유비쿼터스 네트워크 환경을 구축하기 위해 많은 무선 통신 기술들이 등장하였다. 그 중 무선랜 기술은 쉬운 설치와 저렴한 비용 덕에 폭발적인 보급이 이루어 겼다. IEEE 802.11 표준을 기반으로 만들어진 무선랜은 여러 개의 전송속도를 지원한다. 대표적으로 802.11b는 1, 2, 5.5, 11MbPs의 4가지 전송속도를 지원한다. 낮은 전송속도로 전송을 하면 패킷 전송시간은 증가하지만 비트 에러율은 감소된다. 각각의 전송속도에 따라 다른 패킷 전송 성공률을 갖게 된다. 한 무선랜 AP에 연결된 노드들은 각자 자신의 처리율을 최대화할 수 있는 전송속도를 결정하여 사용하게 된다. 이러한 상황은 전체 시스템 성능에는 문제를 발생시킬 수 있다. 본 논문에서는 각자의 전송속도를 각자가 결정하는 것이 전체 시스템 성능에 문제를 발생시키는 경우를 보이고, 그것을 해결하기 위해 AP가 각 노드의 전송속도를 결정하는 기법을 제안한다. 나아가 무선랜에서의 문제점인 Performance Anomaly 현상을 해결하고, [3]에서 언급된 Inefficient Equilibria 현상도 막아본다.

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

최근 유비쿼터스 네트워크 환경을 구축하기 위해 많은 무선 통신 기술들이 등장하였다. 그 중 무선랜 기술은 쉬운 설치와 저렴한 비용 덕에 폭발적인 보급이 이루어 졌다. IEEE 802.11 표준을 기반으로 만들어진 무선랜은 여러 개의 전송속도를 지원한다. 대표적으로 802.11b 는 1, 2, 5.5, 11Mbps 의 4 가지 전송속도를 지원한다. 낮은 전송속도로 전송을 하면 패킷 전송시간은 증가하지만 비트 에러율은 감소된다. 각각의 전송속도에 따라 다른 패킷 전송 성공률을 갖게 된다. 한 무선랜 AP 에 연결된 노드들은 각자 자신의 처리율을 최대화할 수 있는 전송속도를 결정하여 사용하게 된다. 이러한 상황은 전체 시스템 성능에는 문제를 발생시킬 수 있다. 본 논문에서는 각자의 전송속도를 각자가 결정하는 것이 전체 시스템 성능에 문제를 발생시키는 경우를 보이고, 그것을 해결하기 위해 AP 가 각 노드의 전송속도 및 전송시간을 결정하는 기법을 제안한다. 나아가 무선랜에서의 문제점인 Performance Anomaly 현상을 해결하고, [3]에서 언급된 Inefficient Equilibria 현상도 막아본다.

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.581-592
• /
• 2016

WebRTC has quickly grown to be the world's advanced real-time communication in several platforms such as web and mobile. In spite of the advantage, the current technology in WebRTC does not handle a big-streaming efficiently between peers and a large amount request of users on the Signaling server. Therefore, in this paper, we put our work to handle the problem by delivering the flow of data with dynamical load balancing algorithms. We analyze the request source users and direct those streaming requests to a load balancing component. More specifically, the component determines an amount of the requested resource and available resource on the response server, then it delivers streaming data to the requesting user parallel or alternately. To show how the method works, we firstly demonstrate the load-balancing algorithm by using a network simulation tool OPNET, then, we seek to implement the method into an Ubuntu server. In addition, we compare the result of our work and the original implementation of WebRTC, it shows that the method performs efficiently and dynamically than the origin.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.463-465
• /
• 2005

본 논문에서는 802.l1e MAC의 EDCA 모드를 기반으로 한 무선랜 환경에서 realtime data인 voice traffic의 QoS를 향상하기 위한 방안을 연구하였다. 동적으로 채널의 상태를 보고, 네트워크 상태를 예측하여 채널 경쟁에 참여할지를 결정하는 방안으로, 경쟁이 치열할 때 voice traffic에 차별화된 가중치를 더 줄 수 있어 전반적인 voice traffic의 성능 향상에 기여한다. 본 연구에서 SU(slot utilization)을 계산하여 PT(Probability of Transmission)을 구할 때, 기존의 DCC 알고리즘을 그대로 802.11e에 적용하게 되면 4개의 AC에 똑같은 알고리즘이 적용되어 802.11e의 핵심인 차별화된 QoS를 지원하는데 무리가 있다. 기존 DCC 알고리즘에서 재시도 회수만 고려해 구하는 것을 802.11e 구조에 맞추어 4개의 AC별로 차별화하여 전송확률(PT)를 구할 수 있게 하였다. 뿐만 아니라, 재시도 회수를 고려하여 재시도 회수가 않은 packet에는 PT값이 높게 나을 수 있게 하고, 최대 가능한 재시도 회수에 도달할 때에는 상위 AC 영역의 값이 나오게 하여 AC의 upgrade가 되는 효과를 가져오게 하였다. 이 때 각 AC의 lower bound와 upper bound를 정하고, 이 때 802.11e의 최대 재시도 회수 parameter와의 상관관계를 정의하여 하위 AC가 상위 AC의 영역을 침범하지 못하도록 정의하고 있다. 추가적으로 SU의 값을 구할 때에도 현재의 SU값 대신 누적된 평균 SU값을 사용해 PT값을 구하여, utilization, latency, Packet loss등 전반적인 부분의 성능개선을 확인할 수 있다.