• Title/Summary/Keyword: Traffic route selection

Search Result 46, Processing Time 0.026 seconds

Acoustic Signal based Optimal Route Selection Problem: Performance Comparison of Multi-Attribute Decision Making methods

  • Borkar, Prashant;Sarode, M.V.;Malik, L. G.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.647-669
    • /
    • 2016
  • Multiple attribute for decision making including user preference will increase the complexity of route selection process. Various approaches have been proposed to solve the optimal route selection problem. In this paper, multi attribute decision making (MADM) algorithms such as Simple Additive Weighting (SAW), Weighted Product Method (WPM), Analytic Hierarchy Process (AHP) method and Total Order Preference by Similarity to the Ideal Solution (TOPSIS) methods have been proposed for acoustic signature based optimal route selection to facilitate user with better quality of service. The traffic density state conditions (very low, low, below medium, medium, above medium, high and very high) on the road segment is the occurrence and mixture weightings of traffic noise signals (Tyre, Engine, Air Turbulence, Exhaust, and Honks etc) is considered as one of the attribute in decision making process. The short-term spectral envelope features of the cumulative acoustic signals are extracted using Mel-Frequency Cepstral Coefficients (MFCC) and Adaptive Neuro-Fuzzy Classifier (ANFC) is used to model seven traffic density states. Simple point method and AHP has been used for calculation of weights of decision parameters. Numerical results show that WPM, AHP and TOPSIS provide similar performance.

The Influence of Traffic Information based on VMS(Variable Message Sign) on the Selection of Drivers' Route (VMS(Variable Message Sign)를 통한 교통정보 제공이 운전자의 운행경로 전환에 미치는 영향 분석)

  • Jung, Hun Young;Son, Su Ran;Lee, Jeong Ho
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.31 no.2D
    • /
    • pp.193-201
    • /
    • 2011
  • The provision of traffic information plays an important role in increasing social benefit not only by saving travel time for individuals but also by improving the efficiency of road operation. VMS(Variable Message Sign) helps on-wheel drivers easily understand the road situation, and also provides real-time traffic information to people on the streets. However, it has not been sufficiently studied on how traffic information based on VMS influences on the drivers' selection of route. This study investigated how drivers use VMS traffic information and how they are satisfied with it. Then, the model of drivers' route selection was specified with the types of traffic information and the expected travel time to examine the influence on the selection of drivers' route. The model was estimated and analyzed in three types according to the condition of detour roads, and the rate of route change and the degree of sensitivity was calculated from the estimation. The results of analysis are as follows. the $1^{st}$ type model showed the 10% of route change for the travel time saving of 5minutes, and the 81.6% of route change for the travel time saving of 20minutes. The $2^{nd}$ type led to the range of route change from 14.2% to 92.7% over the 5 through 20 minutes of travel time saving. The $3^{rd}$ model resulted in the 99.1% of route change. The sensitivity of route change showed the highest for the travel time saving of 11 minutes with the $1^{st}$ type model, 9 minutes with the $2^{nd}$ type model, and 5 minutes with the $3^{rd}$ type model respectively.

A Route Selection Algorithm using a Statistical Approach (통계적 기법을 이용한 경로 선택 알고리즘)

  • Kim, Young-Min;Ahn, Sang-Hyun
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.1
    • /
    • pp.57-64
    • /
    • 2002
  • Since most of the current route selection algorithms use the shortest path algorithm, network resources can not be efficiently used also traffics be concentrated on specific paths resulting in congestgion. In this paper we propose the statistical route selections(SRS) algorithm which adopts a statistical mechanism to utilize the network resource efficiently and to avoid congestion. The SRS algorithm handles requests on demand and chooses a path that meets the requested bandwidth. With the advent of the MPLS it becomes possible to establish an explicit LSP which can be used for traffic load balancing. The SRS algorithm finds a set of link utilizations for route selection, computes link weights using statistical mechanism and finds the shortest path from the weights. Our statistical mechanism computes the mean and the variance of link utilizations and selects a route such that it can reduce the variance and the number of congested links and increase the utilization of network resources. Throughout the simulation, we show that the SRS algorithm performs better than other route selection algorithms on several metrics like the number of connection setup failures and the number of congested links.

An Effective Route Selection Scheme with Considering Traffic Density in VANET

  • An, Do-Sik;Cho, Gi-Hwan
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.6
    • /
    • pp.623-629
    • /
    • 2010
  • A geographical routing protocol is typically utilized for a route selection of VANET. Even if it is conceptually well adapted into VANET, message delivery tends to be unreliable with frequent network partitions, which mainly come from the inherent characteristics such as high mobility and irregular traffic density. In this paper, we deal with a method to enable reliable message delivery with reflecting the traffic density on routing decision. By concatenating the message delivery cost of each of inbetween junction section, $1^{st}$ and $2^{nd}$ shortest paths are initially determined. When it is not possible to deliver the message on a junction on the 1st path, we utilize two novel ideas, that is, letting the message stay on the junction to find out a new relay node, and putting a replicated copy to reach via a detour path. By using the NS-2 network simulator, our method has been examined in terms of message delivery rate and delay. It shows that our method is much efficient than the other method in the low density environment, while it brings similar results in the high density environment.

Route Selection Protocol based on Energy Drain Rates in Mobile Ad Hoc Networks (무선 Ad Hoc 통신망에서 에너지 소모율(Energy Drain Rate)에 기반한 경로선택 프로토콜)

  • Kim, Dong-Kyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7A
    • /
    • pp.451-466
    • /
    • 2003
  • Untethered nodes in mobile ad-hoc networks strongly depend on the efficient use of their batteries. In this paper, we propose a new metric, the drain rate, to forecast the lifetime of nodes according to current traffic conditions. This metric is combined with the value of the remaining battery capacity to determine which nodes can be part of an active route. We describe new route selection mechanisms for MANET routing protocols, which we call the Minimum Drain Rate (MDR) and the Conditional Minimum Drain Rate (CMDR). MDR extends nodal battery life and the duration of paths, while CMDR also minimizes the total transmission power consumed per packet. Using the ns-2 simulator and the dynamic source routing (DSR) protocol, we compare MDR and CMDR against prior proposals for power-aware routing and show that using the drain rate for power-aware route selection offers superior performance results.

DCAR: Dynamic Congestion Aware Routing Protocol in Mobile Ad Hoc Networks

  • Kim, Young-Duk;Lee, Sang-Heon;Lee, Dong-Ha
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.1 no.1
    • /
    • pp.8-13
    • /
    • 2006
  • In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.

  • PDF

A Route Search of Urban Traffic Network using Fuzzy Non-Additive Control (퍼지 비가법 제어를 이용한 도시 교통망의 경로 탐색)

  • 이상훈;김성환
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.1
    • /
    • pp.103-113
    • /
    • 2003
  • This paper shows alternative route search and preference route search for the traffic route search, and proposes the use of the fuzzy non-additive controller by the application of AHP(analytic hierarchy process). It is different from classical route search and notices thinking method of human. Appraisal element, weight of route is extracted from basic of the opinion gathering for the driving expert and example of route model was used for the finding of practice utility. Model evaluation was performed attribute membership function making of estimate element, estimate value setting, weight define by the AHP, non additive presentation of weight according to $\lambda$-fuzzy measure and Choquet fuzzy integral. Finally, alternative route search was possible to real time traffic route search for the well variable traffic environment, and preference route search showed reflection of traffic route search disposition for the driver individual. This paper has five important meaning. (1)The approach is similar to the driver's route selection decision process. (2)The approach is able to control of route appraisal criteria for the multiple attribute. (3)The approach makes subjective judgement objective by a non additive. (4)The approach shows dynamic route search for the alternative route search. (5)The approach is able to consider characteristics of individual drivers attributed for the preference route search.

A Reliable Route Selection Algorithm in Mobile Ad-hoc Networks (이동 애드혹 네트워크에서의 안정 경로 선택 알고리즘)

  • Kim, Won-Ik;Suh, Young-Joo;An, Syung-Og
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.314-323
    • /
    • 2002
  • The routing protocols designed for wired networks can hardly be used for mobile ad-hoc networks due to limited bandwidth of wireless transmission and unpredictable topological change. Recently, several routing protocols for mobile ad-hoc networks have been Proposed. However, when theme protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoc networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable route that is impervious to route failures by topological changes by mobile hoots. For reliable route selection, the concept of virtual zone (stable zone and caution zone) is proposed. The zone is located in a mobile node'transmission range and determined by mobile node's mobility information received by Global Positioning System (GPS). The proposed algorithm is applied to the route discovery procedure of the existing on-demand routing protocol, AODV, and evaluated by simulation in various traffic conditions and mobility patterns.

A Route Selection Scheme for WLAN Off-Loading in EPC Network with a Cloud Server (Cloud 서버를 포함한 EPC 망에서 WLAN 오프로딩 경로 선택)

  • Kim, Su-Hyun;Min, Sang-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2527-2532
    • /
    • 2013
  • There coexist various access network for mobile terminals, such as mobile phones, smart phones, and tablet PC, in mobile and wireless network. In these circumstance, the network traffic overload unexpected causes the service degradation or discontinuity. To solve this problem, we consider a off-loading route selection by a cloud server which monitors traffic volume and selects an appropriate route. With our proposed scheme, it is possible for the EPC network with untrusted WLAN access networks to operate efficiently to a trusted service level. Also, an optimal handover with satisfying service requirements could be achieved by the proposed offload scheme.

Evaluation of Techniques Linked GIS for Route Selecting of the Road (도로의 노선선정을 위한 GIS 연계 기법의 평가)

  • 이형석;배상호;한우철
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.4
    • /
    • pp.1-6
    • /
    • 2003
  • Route selecting of the road is a basic and important process. But the route selecting process must consider the technical, traffic and environment factor simultaneously. The optimum route that are able to reduce the construction cost, maximize utility value and investigate several alternative route must be selected. This study presents a reasonable plan for route selecting through subjective evaluation and classify the methods linked GIS from basic design of road construction.

  • PDF