• Information and Communications Magazine
• /
• v.29 no.8
• /
• pp.72-84
• /
• 2012

This paper introduces three vehicle trajectory-based data forwarding schemes, tailored for vehicular ad hoc networks. Nowadays GPS-based navigation systems are popularly used for providing efficient driving paths for drivers. With the driving paths called vehicle trajectories, we can make data forwarding schemes more efficient, considering the micro-scoped mobility of individual vehicles in road networks as well as the macro-scoped mobility of vehicular traffic statistics. This paper shows why the vehicle trajectory is a key ingredient in the design of the vehicle-to-infrastructure, infrastructure-to-vehicle, and vehicle-to-vehicle data forwarding schemes over multihop. Through the mathematical formulation, the key design techniques are shown for three forwarding schemes based on vehicle trajectory, compared with a state-of- the- art data forwarding scheme based on only vehicular traffic statistics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.657-666
• /
• 2008

The intersection collision avoidance service among various telematics application services is regarded as one of the most critical services with regard to safety. In such safety applications, real-time, correct transmission of service is required. In this paper, we study on efficient infrastructure architecture for intersection collision avoidance using a cooperative mechanism between vehicles and wireless infrastructure. In particular, we propose an infrastructure, called CISN (Cooperative Infrastructure associated with Sensor Networks), in which proper numbers of sensor nodes are deployed on each road, surrounding the intersection. In the proposed architecture, overall service performance is influenced by various parameters consisting of the infrastructure, such as the number of deployed sensor nodes, radio range and broadcast interval of base station, and so on. In order to test the feasibility of the CISN model in advance, and to evaluate the correctness and real-time transmission ability, an intersection sensor deployment simulator is developed. Through various simulations on several environments, we identify optimal points of some critical parameters to build the most desirable CISN.

• Genomics & Informatics
• /
• v.1 no.1
• /
• pp.1-6
• /
• 2003

In conclusion, the seemingly fuzzy and disorganized data of biology with thousands of different layers ranging from molecule to the Internet have refused so far to be mapped precisely and predicted successfully by mathematicians, physicists or computer scientists. Genomics and bioinformatics are the fields that process such complex data. The insights on the nature of biological entities as complex interaction networks are opening a door toward a generalization of the representation of biological entities. The main challenge of genomics and bioinformatics now lies in 1) how to data mine the networks of the domains of bioinformatics, namely, the literature, metabolic pathways, and proteome and structures, in terms of interaction; and 2) how to generalize the networks in order to integrate the information into computable genomic data for computers regardless of the levels of layer. Once bioinformatists succeed to find a general principle on the way components interact each other to form any organic interaction network at genomic scale, true simulation and prediction of life in silico will be possible.

• Journal of Communications and Networks
• /
• v.4 no.4
• /
• pp.292-301
• /
• 2002

Wireless LAN technology is complementary to 3G systems and could be used to provide high bandwidth hotspot coverage, for example in railway stations and offices, in order to provide the high bandwidth video and broadband services such as those emerging on DSL fixed access. The IST Projects BRAIN and MIND have investigated a number of key technical enablers for such a system beyond 3G. These include scenarios and business models, design of an all-IP access network, consideration of ad hoc network extensions, enhancing Wireless LAN efficiency and compatibility with IP and, finally, terminal middleware and signalling for rapid adaptations to network QoS changes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9A
• /
• pp.882-888
• /
• 2010

Vehicular Ad-Hoc Networks (VANETs) using inter-vehicle communication can potentially enhance traffic safety and facilitate many vehicular applications. Therefore, this paper proposes an inter-vehicle routing protocol called Junction-Assisted Routing (JAR) that uses fixed junction nodes to create the routing paths for VANETs in city environments. JAR is a proactive routing protocol that uses the Expected Transmission Count (ETC) for the road segment between two neighbor junctions as the routing paths between junction nodes. Simulation results showed that the proposed JAR protocol could outperform existing routing protocols in terms of the packet delivery ratio and average packet delay.

• ETRI Journal
• /
• v.45 no.6
• /
• pp.1065-1078
• /
• 2023

In vehicular networks, diverse safety information can be shared among vehicles through internet connections. In vehicle-to-internet communications, vehicles on the road are wirelessly connected to different cloud networks, thereby accelerating safety information exchange. Onboard sensors acquire traffic-related information, and reliable intermediate nodes and network services, such as navigational facilities, allow to transmit safety information to distant target vehicles and stations. Using vehicle-to-network communications, we minimize delays and achieve high accuracy through consistent connectivity links. Our proposed approach uses intermediate nodes with two-hop separation to forward information. Target vehicle detection and routing of safety information are performed using machine learning algorithms. Compared with existing vehicle-to-internet solutions, our approach provides substantial improvements by reducing latency, packet drop, and overhead.

• International Journal of Computer Science & Network Security
• /
• v.24 no.8
• /
• pp.139-144
• /
• 2024

VANETs have become one of the most attractive research areas in the world of wireless networks in recent years. Indeed, vehicular networks have become capable of optimizing road traffic, which significantly reduces the number of accidents through notifications exchanged between nearby vehicles. The routing function based on the opportunistic algorithm is a critical part of the vehicle's communication system and will therefore be an ideal target for attacks that could aim to prevent alert messages from reaching their destination, and thus endanger human lives. The black hole attack is a major threat to the security of VANETs. The main idea of this paper focuses on the analysis of this type of attack in VANETs using Discrete-Time Markov Chains (DTMC). and deduce at the end the effect of the number of malicious nodes on the delivery rate in the network.

• Journal of Korean Society of Transportation
• /
• v.19 no.4
• /
• pp.85-96
• /
• 2001

This paper discusses the problem of finding the Origin-Destination(O-D) shortest path in urban road networks that have variable special qualifies such as time windows for passing as well as geometrical special qualities such as U-turn and left-turn prohibition. The focus of this paper is motivated by the problem of finding minimum travel time paths for an advanced traveler information system (ATIS) in the context of intelligent transportation system(ITS) application. The transportation network with variable and geometrical special qualities is a more realistic representation of the urban road network in the real word. But, the traditional and existing shortest path algorithms can not search practical shortest path that variable special quality is reflected. This paper presents a shortest path algorithm which can search reasonable shortest path information for the urban ATIS application within a real time. The algorithm is based on genetic algorithm(GA). The high performance of the proposed algorithm is demonstrated by computer simulations.

• Journal of Korean Society of Transportation
• /
• v.26 no.2
• /
• pp.89-100
• /
• 2008

In an urban network controlled by traffic signals, there is an interaction between the signal timing and the routes chosen by individual road users. This study develops a bi level programming model for traffic signal optimization in networks with path based traffic assignment. In the bi level programming model, genetic algorithm approach has been proposed to solve upper level problem for a signalized road network. Path based traffic assignment using column generation technique which is proposed by M.H. Xu, is applied at the lower-level. Genetic Algorithm provieds a feasible set of signal timings within specified lower and upper bounds signal timing variables and feeds into lower level problem. The performance of this model is investigated in numerical experiment in a sample network. In result, optimal signal settings and user equilibrium flows are made.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.565-569
• /
• 2007

To find optimal path is killer application in the telematics system. The shortest path of conventional system, however, isn't always optimal path. That is, the path with minimum travelling time could be defined as optimal path in the road networks. There are techniques and algorithms for finding optimal path. Hierarchical path algorithm categorizes road networks into major layer and minor layer so that the performance of operational time increases. The path searched is accurate as much as optimal path. At above 2 system, a method to allocate minor roads to major road region influences the performance extremely. This paper proposes methods to determine search space for selecting major roads in the hierarchical path algorithm. In addition, methods which apply the proposed methods to hierarchical route algorithm is presented.