City busses are operated on roads where the GPS signal is weak, because of the tall buildings surrounding these roads. The localization of city busses, needs to therefore rely on alternate technique in order to improve the accuracy. Recent standardization of inter vehicular communication has made this a readily available tool which can be used for localization. This thesis presents an approach towards localization of a city bus by means of vehicular ad hoc network. The two main components of localization by this approach is the initialization of location estimate component, and the real time location estimation component. In particular, the thesis develops the use of minimum mean square estimation for initialization and an extended Kalman filtering approach for real time location estimation. The localization method is mathematically described, considering the operating scenarios of a city bus. The accuracy of the proposed method is mathematically evaluated. The developed localization method is implemented in a simulation tool kit for inter vehicular communication. Simulation experiments were performed for operating scenarios of city bus. The result of initialization by minimum mean square error is compared to that of initialization by GPS, in-terms of localization accuracy. Different setups of road side units are compared in-terms of accuracy and update interval. The results show that the proposed method is feasible for localization of a city bus. This thesis was carried out in association with Scania AB, Södertälje. / Stadsbussar åker på vägar som är omgivna av byggnader, vilket försämrar stadsbussarnas GPSmottagning. Lokaliseringen av stadsbussar måste därför förlita sig på alternativ teknik för att förbättra noggrannheten. Nyligen standardiserad kommunikation mellan fordon har blivit till ett lättillgängligt verktyg som kan användas för lokalisering. Den här uppsatsen presenterar en strategi för lokalisering av en stadsbuss med hjälp av fordonets ad hoc-nätverk. Huvudkomponenterna för lokalisering är en initialiseringskomponent och realtidslägesuppskattningskomponent. Speciellt utvecklar arbetet användningen av minsta medelkvadratberäkning för initialisering och en utvidgad kalmanfiltreringsmetod för realtidslägesuppskattning. Lokaliseringsmetoden beskrivs matematiskt med tanke på driftsscenarierna för en stadsbuss. Noggrannheten hos den föreslagna metoden utvärderas matematiskt. Den utvecklade lokaliseringsmetoden implementeras i ett simuleringsverktyg för kommunikation mellan fordon. Simuleringsexperiment utfördes för driftsscenarier för stadsbussar. Resultatet av initialisering med minsta medelkvadratberäkning jämförs med initialiseringen med GPS, i termer av lokaliseringsnoggrannhet. Olika inställningar av vägrensenheter jämförs med avseende på noggrannhet och uppdateringsintervall. Resultaten visar att den föreslagna metoden är möjlig för lokalisering av en stadsbuss. Denna arbetet genomfördes i samarbete med Scania AB, Södertälje.

Vehicular ad hoc networks (VANETs) are a subclass of mobile ad hoc networks (MANETs) in which the mobile nodes are vehicles; these vehicles are autonomous systems connected by wireless communication on a peer-to-peer basis. They are self-organized, self-configured and self-controlled infrastructure-less networks. This kind of network has the advantage of being able to be set-up and deployed anywhere and anytime because it has no infrastructure set-up and no central administration. Distributing information between these vehicles over long ranges in such networks, however, is a very challenging task, since sharing information always has a risk attached to it especially when the information is confidential. The disclosure of such information to anyone else other than the intended parties could be extremely damaging, particularly in military applications where controlling the dissemination of messages is essential. This thesis therefore provides a review of the issue of security in VANET and MANET; it also surveys existing solutions for dissemination control. It highlights a particular area not adequately addressed until now: controlling information flow in VANETs. This thesis contributes a policy-based framework to control the dissemination of messages communicated between nodes in order to ensure that message remains confidential not only during transmission, but also after it has been communicated to another peer, and to keep the message contents private to an originator-defined subset of nodes in the VANET. This thesis presents a novel framework to control data dissemination in vehicle ad hoc networks in which policies are attached to messages as they are sent between peers. This is done by automatically attaching policies along with messages to specify how the information can be used by the receiver, so as to prevent disclosure of the messages other than consistent with the requirements of the originator. These requirements are represented as a set of policy rules that explicitly instructs recipients how the information contained in messages can be disseminated to other nodes in order to avoid unintended disclosure. This thesis describes the data dissemination policy language used in this work; and further describes the policy rules in order to be a suitable and understandable language for the framework to ensure the confidentiality requirement of the originator. This thesis also contributes a policy conflict resolution that allows the originator to be asked for up-to-date policies and preferences. The framework was evaluated using the Network Simulator (NS-2) to provide and check whether the privacy and confidentiality of the originators’ messages were met. A policy-based agent protocol and a new packet structure were implemented in this work to manage and enforce the policies attached to packets at every node in the VANET. Some case studies are presented in this thesis to show how data dissemination can be controlled based on the policy of the originator. The results of these case studies show the feasibility of our research to control the data dissemination between nodes in VANETs. NS-2 is also used to test the performance of the proposed policy-based agent protocol and demonstrate its effectiveness using various network performance metrics (average delay and overhead).