Conference Paper

Ant-Based Topology Convergence Algorithms for Resource Management in VANETs.

DOI: 10.1007/978-3-540-75867-9_124 Conference: Computer Aided Systems Theory - EUROCAST 2007, 11th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria, Spain, February 12-16, 2007, Revised Selected Papers
Source: DBLP

ABSTRACT Frequent changes caused by IP-connectivity and user-oriented services in Inter-Vehicular Communication Networks (VCNs) set
great challenges to construct reliable, secure and fast converged topology formed by trusted mobile nodes and links. In this
paper, based on a new metric for network performance called topology convergence and a new Object-Oriented Management Information
Base - active MIB (O:MIB), we propose an ant-based topology convergence algorithm that applies the swarm intelligence metaphor
to find the near-optimal converged topology in VCNs which maximizes system performance and guarantee a further sustainable
and maintainable system topology to achieve Quality of Service (QoS) and system throughput. This algorithm is essentially
a distributed approach in that each node collects information from local neighbor nodes by invoking the methods from each
localized O:MIB, through the sending and receiving of ant packets from each active node, to find the appropriate nodes to
construct a routing path. Simulation results show this approach can lead to a fast converged topology with regards to multiple
optimization objectives, as well as scale to network sizes and service demands.

1 Bookmark
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Communication protocol tuning can yield significant gains in energy efficiency, resource requirements, and the overall network performance, all of which is of particular importance in vehicular ad-hoc networks (VANETs). In this kind of networks, the lack of a predefined infrastructure as well as the high level of dynamism usually provoke problems such as the congestion of intermediate nodes, the appearance of jitters, and the disconnection of links. Therefore, it is crucial to make an optimal configuration of the routing protocols previously to the network deployment. In this work, we address the optimal automatic parameter tuning of a well-known routing protocol: Ad Hoc On Demand Distance Vector (AODV). For this task, we have used and compared five optimization techniques: PSO, DE, GA, ES, and SA. For our tests, a urban VANET scenario has been defined by following realistic mobility and data flow models. The experiments reveal that the produced configurations of AODV significantly improve their performance over using default parameters, as well as compared against other well-known routing protocols. Additionally, we found that PSO outperforms all the compared algorithms in efficiency and accuracy.
    Applications of Evolutionary Computation, EvoApplications 2010: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoMUSART, and EvoTRANSLOG, Istanbul, Turkey, April 7-9, 2010, Proceedings, Part II; 01/2010
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Intelligent transportation systems (ITS) is focusing on "smart" vehicles- vehicles equipped with significant computing, communicating and sensing capabilities to provide services to travelers or the goal of providing safety massages in emergencies situations. Vehicular network may also be used for Internet access, inter- passengers communications and entertainments. To understand the network behavior as well as to provide a good services to the travelers many issues have to be managed, some of them are: call handover between vehicles in vehicular network, speed Vs capacity, security of call, network topology, and network fragmentation. In this paper we explain these issues and the related work with some new idea to manage the vehicular network.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents an optimization example using a new paradigm for viewing the work of Wireless Sensor Networks. In our ear-lier paper [1] the Observed Field (OF) is described as a multi-dimensional “Information Space” (ISp). The Wireless Sensor Network is described as a “Transformation Space” (TS), while the information collector is a single point consumer of information, described as an “Information Sink” (ISi). Formal mathematical descriptions were suggested for the OF and the ISp. We showed how the TS can be formally thought of as a multi-dimensional transform function between ISp and ISi. It can be aggregated into a no-tional multi-dimensional value between{0,1}.In this paper,this formal mathematical description is used to create a genetic algorithm based optimization strategy for creating routes through the TS, using a cost function based on mutual information. The example uses a connectivity array, a mutual information array and the PBIL algorithm.
    Computer Aided Systems Theory - EUROCAST 2011 - 13th International Conference, Las Palmas de Gran Canaria, Spain, February 6-11, 2011, Revised Selected Papers, Part II; 01/2011


Available from
May 26, 2014