• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.215-217
• /
• 2004

In wireless sensor networks, fair allocation of bandwidth among different nodes is one of the critical problems that effects the serviceability of the entire system. Fair bandwidth allocation mechanisms, like fair queuing, usually need to maintain state, manage buffers, and perform packet scheduling on a per flow basis, and this complexity may prevent them from being cost-effectively implemented and widely deployed. It is a very important and difficult technical issue to provide packet scheduling architecture for fairness in wireless sensor networks. In this paper, we propose an packet scheduling architecture for sensor node, called FISN (Fairness Improvement Sensor Network), that significantly reduces this implementation complexity yet still achieves approximately fair bandwidth allocations. Sensor node for sensing estimate the incoming rate of each sensor device and insert a label into each transmission packet header based on this estimate. Sensor node for forwarding maintain no per flow state; they use FIFO packet scheduling augmented by a probabilistic dropping algorithm that uses the packet labels and an estimate of the aggregate traffic at the gathering node. We present the detailed design, implementation, and evaluation of FISN using simulation. We discuss the fairness improvement and practical engineering challenges of implementing FISN in an experimental sensor network test bed based on ns-2.

• Journal of Korean Society of Transportation
• /
• v.27 no.5
• /
• pp.17-28
• /
• 2009

There are many limitations in dealing with rapidly changing traffic demand in urban cities. Thus recently, traffic operation and management skills are more emphasized rather than the expansion of traffic facilities. In particular, in the interrupted flow formed by signalized intersections, it is quite important to give optimal signal timing to each intersection with consideration of progression. However, as fixed signal times per direction can affect passing capacity in signalized intersections, the present four-signal phase including a left-turn signal has many limitations, including reduction of directional road capacity when traffic demand is increases dramatically during peak hours. Because of this problem, lots of studies about internal metering techniques for oversaturated signal control skills have progressed but these techniques are not used widely due to the absence of detectors for queue sensing in real-time signal control systems. In this research, a new methodology called the "restrictive left-turn signal control", which is already used at the intersection above Samsung subway station, is suggested in order to reduce control delay of urban arterial roads. The restrictive left-turn signal control allows a driver to make a U-turn and then a right turn instead of turning left in that intersection. With this change, the restrictive left-turn signal control can contribute to increased intersection capacity by reducing the number of signal phases and maximizing the through phase time. However, road structure and traffic conditions at the target intersections should be considered before the adoption of the proposed signal control.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.318-321
• /
• 2004

The damage scale and damage area in the coast have been increased dramatically because of calamities such as typhoon. tidal wave. flood and storm. Especially. 409 cases. which reach to about $40.9\%$ of natural disasters of 1,000 cases for the recent 15 years have happened on coast area. More than $40\%$ of natural disasters also occurred every year is happening in coastland. Therefore, there is a great need to construct all related GIS database such as atmospheric phenomena (typhoon. tidal wave, flood and storm). harbor facility, harbor traffic and ebb and flow. Furthermore. the certain system should be developed and integrated with NDMS (National Disaster Management System) by using 3D web GIS technology. In this study. the coast disaster area management system was designed and developed by using 3D web GIS technique so that the coast disaster area could be monitored and managed in real time and in visual. Finally. the future disaster in coast area could be predicted scientifically.

• Journal of KIISE:Information Networking
• /
• v.37 no.4
• /
• pp.272-283
• /
• 2010

Wireless Mesh Networks (WMNs) have gained a lot of attention recently. Based on the characteristic of WMNs as a highly connected wireless infrastructure, many efforts from research organizations are made in order to improve the performance of the flow throughput in WMNs. Therefore, it is very critical issue to establish efficient routing paths for multiple concurrent ongoing flows. In this paper, we propose a general modeling methodology to analyze the end-to-end throughput of multiple concurrent flows by analytical calculation taking into account the carrier sensing behaviors, interference and the IEEE 802.11 Distributed Coordination Function mechanism. After the comparison of the average service time for each successful transmission at each node, we analyze the bottlenecks of flows, and hence obtain the maximum end-to-end throughput of them. By using our proposed model, it is possible to predicate the throughput of several candidate routing paths for multiple concurrent ongoing data flows, so we can select the most efficient route that can achieve the highest throughput. We carry out simulations with various traffic patterns of multiple flows in WMNs to validate our modeling and our efficient route selection mechanism.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.843-845
• /
• 2003

Shortest Path Problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is the route determination service, where various kinds of shortest path problems need to be solved in location-based service. Our research aim is to propose a route technique in real-time locationbased service (LBS) environments according to user’s route preferences such as shortest, fastest, easiest and so on. Turn costs modeling and computation are important procedures in route planning. There are major two kinds of cost parameters in route planning. One is static cost parameter which can be pre-computed such as distance and number of traffic-lane. The other is dynamic cost parameter which can be computed in run-time such as number of turns and risk of congestion. In this paper, we propose a new cost modeling method for turn costs which are traditionally attached to edges in a graph. Our proposed route determination technique also has an advantage that can provide service interoperability by implementing XML web service for the OpenLS route determination service specification. In addition to, describing the details of our shortest path algorithms, we present a location-based service system by using proposed routing algorithms.