• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.217-232
• /
• 2003

QoS routing can improve network performance while providing support for QoS guarantees. These benefits, however, comes with additional routing costs such as more complex and frequent route computation and the protocol overheads to exchange dynamic network state information. Moreover, little has been done to mininize the impact of the QoS traffic to the best effort traffic or to enhance the routine Performance of the best effort traffic when QoS routing is deployed. In this paper, it is proposed that a sewer based routing mechanism, which supports the QoS routing without incurring the QoS routing protocol overhead for the network state update exchanges and enhances the performance of the best effort traffic without affecting the performance of QoS routing. Simulation results show that the proposed scheme enhances the routing performance for the QoS traffic while reducing the routing protocol overhead. The routing performance of the best traffic is also improved with virtually no impact to the routine performance of the QoS traffic. The proposed scheme is shown to be especially effective when the ratio of QoS traffic is high, that is, when the impact of the QoS traffic to the performance of best effort traffic is significant.

• Structural Engineering and Mechanics
• /
• v.55 no.2
• /
• pp.365-377
• /
• 2015

Large-amplitude vibration of overhead sign structures can cause unfavorable psychological responses in motorists, interfere with readability of the signs, and lead to fatigue cracking in the sign structures. Field experience in Texas suggests that an overhead sign structure can vibrate excessively when supported within the span of a highway bridge instead of at a bent. This study used finite element modeling to analyze the dynamic displacement response of three hypothetical sign structures subjected to truck-passage-induced vertical oscillations recorded for the girders from four actual bridges. The modeled sign bridge structures included several span lengths based on standard design practices in Texas and were mounted on precast concrete I-girder bridges. Results revealed that resonance with bridge girder vertical vibrations can amplify the dynamic displacement of sign structures, and a specific range of frequency ratios subject to undesirable amplification was identified. Based on these findings, it is suggested that this type of sign structure be located at a bridge bent if its vertical motion frequency is within the identified range of bridge structure excitation frequencies. Several alternatives are investigated for cases where this is not possible, including increasing sign structure stiffness, reducing sign mass, and installing mechanical dampers.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.1
• /
• pp.7-17
• /
• 2010

ITS(Intelligent Transport System) as things are used for Broadcast service using TDMB/TPEG/NAVI rather than personal seamless service. It is attaching weight to Traffic information gathering, Charging, Settlement service. This research is applied to improve DCCP(Datagram Congestion Control Protocol) which has function as protecting data and preserving message boundary. The improving method is like that we solve data trust in UDP because Connection and Transmission overhead in UDP is less than in TCP. We fix the data loss which is generated from unordered delivery section of IP base wireless service by using DCCP protocol. We guarantee of connection with OBE(On-Board Equipment) and reliance about transmission of data by complement to mapping table and multi-hoping. Finally, We evaluate the performance about transmission of IP based data. We constructed a test-bed near research center for this test.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.183-191
• /
• 2004

Single shortest path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal cost multiple shortest paths in OSPF and IS-IS does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, among all the equal cost multiple shortest paths in the network, a set of TE-aware shortest paths, which reduces the maximum link load significantly, can be found and used by IP routers without any change of existing routing protocols and serious configuration overhead. While calculating TE-aware shortest paths. the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next-hop toward the destination by looking up the destination prefix. In this paper, we present a problem formulation of finding a set of TE-aware shortest paths in ILP, and propose a simple heuristic for the problem. From the simulation results, it is shown that TE-aware shortest path routing performs better than default shortest path routing and ECMP in terms of the maximum link load with the marginal configuration overhead of changing the next-hops.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.781-783
• /
• 2014

Mobile ad hoc network(MANET) consists of node that has mobility. MANET has increased overhead that caused by frequent topology changes. For reducing overhead, hierarchical network that communicates through cluster head node has been researched. When traffic is concentrated on cluster head node, cluster member node can't send message. To solve this problem, we proposed Step Parent algorithm. Proposed algorithm, cluster member node checks traffic of cluster head node using route path of other cluster head node in efficient coverage area. When cluster head node has increased traffic, cluster member node make a new route path by route path by routing path to another cluster head node. So cluster member node sends a message to destination node, we check improving delivery ratio.

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.677-682
• /
• 2001

In a microcell environment having frequent inter-cell movement of a subscriber, the amount of signalling traffic rapidly increases due to the treatment of location update and other necessary actions. As a way to reduce such an overhead, this paper presents an algorithm that dynamically allocates subscribers paging and location areas each of which has a different size and shape, depending on the characteristics of subscriber mobility. Mathematical analysis results show that this algorithm allows reduced area management cost, compared to conventional algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1023-1041
• /
• 2010

In cognitive radio networks, cooperative spectrum sensing schemes are proposed to improve the performance of detecting licensees by secondary users. Commonly, the cooperative sensing can be realized by means of hard decision fusion (HDF) or soft decision fusion (SDF) schemes. The SDF schemes are superior to the HDF ones in terms of the detection performance whereas the HDF schemes are outperforming the SDF ones when the traffic overhead is taken into account. In this paper, a hybrid SFD-HDF cluster-based approach is developed to jointly exploit the advantages of SFD and HDF schemes. Different SDF schemes have been proposed and compared within a given cluster whereas the OR-rule base HDF scheme is applied to combine the decisions reported by cluster headers to a common receiver or base station. The computer simulations show promising results as the performance of the proposed scenario of hybridizing soft and hard fusion schemes is significantly outperforming other different combinations of conventional SDF and HDF schemes while it noticeably reduces the network traffic overhead.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.639-639
• /
• 2001

In this paper we describe a distributed location management scheme to reduce the bottleneck problem of HLR in Large Personal Communication Networks (LPCNs). Using analytical modeling and numerical simulation, we show that replicating location information is both appropriate and efficient for small Personal Communication Network (PCN). Then, we extend the scheme in a hierarchical environment to reduce overhead traffic and scale to LPCNs. Through extensive numerical results, we show the superiority of our scheme compared to the current IS-41 standard scheme.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.839-846
• /
• 2001

In this paper we describe a distributed location management scheme to reduce the bottleneck problem of HLR in Large Personal Communication Networks (LPCNs). Using analytical modeling and numerical simulation, we show that replicating location information is both appropriate and efficient for small Personal Communication Network (PCN). Then, we extend the scheme in a hierarchical environment to reduce overhead traffic and scale to LPCNs. Through extensive numerical results, we show the superiority of our scheme compared to the current IS-41 standard scheme.

• The KIPS Transactions:PartC
• /
• v.18C no.6
• /
• pp.445-450
• /
• 2011

In the vehicular ad hoc network environment, the clustering mechanism is one of the efficient mechanisms to deliver broadcast messages. Most clustering mechanisms require message exchanges between vehicles to build stable clusters, which causes overhead. In order to reduce this overhead, CF-IVC [1] proposes the mechanism to construct clusters based on the vehicle speed. However, since CF-IVC does not consider the road traffic condition and the driver's behavior, it may result in inefficient clusters. Therefore, in this paper, we propose a mechanism to establish efficient clusters based on the vehicle local information with considering the road maximum speed limit and the road traffic condition. The performance of the proposed mechanism is validated by comparing with those of the simple flooding and CF-IVC through NS-2 simulations.