An Efficient and Reliable Algorithm for Wireless Sensor Network

It is our great pleasure to welcome you to the 3rd ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN'05), held in conjunction with the 12th ACM Conference on Computer and Communications Security (CCS'05), November 7, 2005, in Alexandria, Virginia.This year we received a total of 39 submissions on various aspects of ad-hoc and sensor network security. The program committee selected 6 as regular papers that cover a variety of topics, including trust establishment in Mobile Ad-Hoc Networks (MANETs), security of vehicular ad-hoc networks, secure group communication, key pre-distribution for sensor networks, jamming attacks against sensor network MAC protocols, and defense against Denial-of-Service (DoS) attacks. This year we continue the tradition of SASN'03 and SASN'04 to encourage the presentation and discussion of work-in-progress on ad-hoc and sensor network security. Among the 39 submissions, the program committee selected 7 papers to present in work-in-progress sessions, covering topics on anonymous routing for MANETs, key distribution for inter-group multicast in ad-hoc networks, improved topology assumptions for threshold cryptography in MANETs, RFID security, tracing in mobile wireless sensor networks, time synchronization attacks in sensor networks, and coordinated deployment for improving secure communications and sensing coverage in wireless sensor networks. In addition, the program includes a panel on Advances in Sensor and Ad-hoc Network Security and an invited keynote talk by Radha Poovandran (University of Washington) on Information Assurance in MANETs and Wireless Sensor Networks. We hope that these proceedings will serve as a valuable reference for security researchers and developers.

Automatic localization is one of the major issues in Wireless Sensor Networks (WSN). DV-hop algorithm is a well-known localization algorithm in WSN but with limited localization accuracy. In this paper, an improved DV-hop localization algorithm in hybrid optical wireless sensor networks is proposed based on the optimization of the parameters in WSN. Various factors that affect the localization accuracy of the DV-hop algorithm in WSN are investigated, including the communication radius of the node, the number of beacon nodes and the number of the total nodes. As the DV-hop algorithm is applied into hybrid optical sensor and WSNs (O-WSN) with rectangular topology, different parameters have to be optimized accordingly. Simulation results show that the square topology outperforms the rectangle topology more than 45 % under the same network parameters using the improved DV-hop algorithm. Therefore another improved DV-hop called Sub-Square Weighted DV-hop (SSW DV-hop) is proposed for the rectangle topology. Both simulation and experiment results demonstrate that applying the SSW DV-hop algorithmin O-WSNs could significantly improve the localization accuracy.

Vehicular Ad-hoc Network (VANET) is a subclass of Mobile Ad-hoc Network (MANET) which provides the safety measure and other different applications to the drivers of the vehicles. The goal of VANET is to fulfil the requirements of users on roadside area, which improves the safe and comfortable journey. Secure routing is the main issue in VANET. Dynamic topology and wireless networking makes the VANET vulnerable to numerous sorts of attacks. Wormhole is one of the extreme assaults in VANET. This type of attack disturbs the working of routing protocol such as Ad hoc On demand Distance Vector (AODV) routing protocol. The motivation of this research work is that by using proposed detection and prevention approach the VANET can be made more secure. The results show how the performance of AODV routing protocol is affected by wormhole. In this research paper the impact of wormhole attack is analysed in terms of throughput, packer delivery ratio, and end-to-end delay. An approach is also proposed to detect and prevent wormhole attack in VANET over a real map on different vehicle densities based on multipath concept.

A new concept such as smart city was introduced in the last years where the Intelligent Transportation system (ITS ) plays a critical role to provide road safety and manage Vehicular Ad Hoc Networks (VANETs) traffic. Nevertheless, VANETs have significant constraints like nodes high mobility, intermittent connectivity, variable network density and heterogeneity. However, the different types of traffic, the different Quality of Service requirements, the need to exchange mobile data, multi-services and data diversity leads mainly to load and time constraints in this specific and stringent type of networks. The main characteristic of this kind of networks is the very changing topology that poses supplementary constraints and makes achieving QoS constraints a very challenging task. In VANET network the vehicle generated traffic will be transferred to the data center from road side unit to the base station by using Long Term Evolution (LTE) in an urban area. Despite LTE has a larger system capacity and it provides a higher transmission speed, the network performance is affected by the implemented scheduling algorithm. In this context, we study the efficiency of LTE scheduler algorithms such as Proportional Fairness, Round Robin, Priority Set Scheduler, Maximum Throughput Scheduler and Throughput to Average Scheduler and Blind Equal Throughput mainly at the road side unit using Network Simulator 3(NS3) to determinate the most suitable scheduler for VANET traffic. Results demonstrate that the round robin algorithm is more effective for volumetric VANET traffic in terms of throughput, delay, packet loss rate and fairness.

VANET (Vehicular Ad-hoc Network) is an ad-hoc wireless network which nodes are composed by mostly moving vehicles and infrastructure communications or access points along the road. It integrates adhoc networking, cellular technology, wireless LAN and other technologies, which include GPS(Global Positioning System), digital mapping, sensing technologies and advanced information processing tools to support Intelligent Traffic Systems (ITS). VANET is developed mainly to improve road safety and to increase the traffic efficiency. It is designed to support the exchange of warning messages among the vehicles to increase the passenger safety and other information related to VANET applications and services . To achieve these goals, there are several issues that should be addressed. One of these challenges is designing reliable and efficient Medium Access Control (MAC) protocol for VANET. Due to VANET’s distinguishing characteristics, such as high mobility of the nodes, dynamic network topology, enough battery power, high processing power, etc, the MAC protocols designed for MANET (Mobile Ad-hoc Network) are not suitable for VANET. The research community has been working to develop MAC protocols appropriate for this ad-hoc network by proposing new design or modifying the existing one.In this paper, the VANET’s architecture, characteristics, applications and standard are discussed and then a comprehensive study of several MAC protocols available in the literature is presented.

As a special type of mobile ad hoc networks (MANETs), vehicular ad hoc networks (VANETs) are expected to support vehicle to vehicle communication and vehicle to infrastructure communication. The conventional relay selection scheme proposed for MANETs may perform poorly in VANETs due to the unique characteristics of VANETs, including highly dynamic network topology, unstable link status and multiple types of services with various QoS requirements. In the paper, a relay vehicle selection algorithm is proposed for a VANET with multiple source vehicles (SVs) and relay vehicles (RVs). Stressing the cooperation and competitive relationship among SVs and RVs in relay selection, a cooperative Game model is formulated. To achieve the maximization of joint payoff functions of all the SVs and RVs, modified Kuhn-Munkres algorithm is applied and the optimal relay vehicle selection is obtained. Numerical results demonstrate that compared with previous scheme, the proposed scheme offers better performance in terms of throughput, successful transmission rate and transmission delay.

In modern vehicles Controller Area Network (CAN) bus has significant importance to transfer data from sensors to Engine Control Unit (ECU) by employing two wire system. CAN bus is very efficient in terms of throughput and reliability but it requires very careful sensor deployment and wiring. In this paper, we propose low cost and energy efficient communication between sensor nodes and ECU using Bluetooth Low Energy (BLE) within Vehicular Ad Hoc Network by employing Intra Vehicle Wireless Sensor Network. BLE can be readily employed in densely urban environment for inter vehicular (up to 50m range) and intra vehicular (up to 10m range) wireless communication. We have compared BLE and CAN bus for communicating actual engine data between ECUs and sensors, and ECU and Onboard Unit (OBU), in terms of energy efficiency, throughput, latency and coverage area. Proposed BLE based system exhibited very high successful packet delivery ratios for static and driving scenarios with acceptable average RSSI values of at least -10dBm. During extensive tests, BLE CC2540/CC2541 based system also achieved very low current consumption (in microamperes) and longer battery life time (around six months on a standard coin battery).

Recently, network localization systems that are based on inter-node ranges have received significant attention. Geographic routing has been considered an application which can utilize the location information from these localization systems. In this paper, we firstly recognize that sensor network localization algorithms generate positioning data with different error patterns compared to those networks where node positions are determined directly from GNSS measurements. Secondly, by simulating practical sensor network scenarios using data from our localization algorithm, we observe that existing geographic routing algorithms in wireless sensor networks (WSNs) adopt very simplistic methods in the treatment of position error, without due consideration of error distribution. Additionally, an insight is given into localization algorithms for WSNs with inhomogeneous error environments. Our observations represent an initial step toward a detailed understanding and design of efficient geographic routing algorithms in location aware WSNs.

Ad Hoc usually relates to an explanation of planning to address a particular issue or function, which although not generic, but also is inappropriate for the achievement of the other objectives. The ad-hoc networks have been particularly designed for establishing communications in environments where they are extremely complicated or infeasible for creating the specific network infrastructure. Most of these ad hoc networks are spontaneously formed by the consumers. The astounding reality is that the number of devices which are able to maintain wireless communications is increasing on a daily basis. Ad hoc networks are beneficial for implementation in considerable sets of scenarios, for instance, in universities, museums, emergency relief or investigation tasks, where the ability to allocate resources and services is one of the primary attentions. In this paper detailed clarifications of the wireless ad-hoc networks, their historical reviews and application in present scenarios. It clarifies several types of such networks like, mobile ad hoc networks (MANETs), wireless sensor networks (WSNs), wireless mesh networks (WMNs), and vehicular ad hoc networks (VANETs). Then, it also concentrates primarily on the utilization of the MANET, besides achieving the crucial task of classifications, characteristics, challenges, potential fields for the implementation of the ad hoc, differences and the developments of routing protocols.

Vehicular Ad Hoc Networks (VANETs), a subclass of Mobile Ad Hoc Networks (MANETs), rely on efficient routing protocols to maintain reliable communication in highly dynamic and decentralized environments. While numerous routing strategies have been proposed, their performance varies significantly with the choice of underlying mobility models that simulate real vehicular movement. This study presents a two-phase evaluation of five widely used routing protocols—Ad hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), Destination-Sequenced Distance Vector (DSDV), Optimized Link State Routing (OLSR), and Geographic Routing Protocol (GRP)—across fourteen realistic mobility models, including the Intelligent Driver Model (IDM), Car-Following Model (CFM), and Lighthill–Whitham–Richards (LWR) model. Simulations are executed using Simulation of Urban Mobility (SUMO), Network Simulator 3 (NS-3), and the Veins framework. The performance is assessed using eight key metrics: Packet Delivery Ratio (PDR), End-to-End Delay (E2ED), Throughput, Jitter, Energy Consumption, Packet Loss Ratio (PLR), Normalized Routing Load (NRL), and Link Breakage Rate (LBR). Among the evaluated protocol–mobility combinations, AODV paired with the CFM model demonstrated comparatively favorable performance under the considered simulation configuration: 93% PDR, 79.4 ms E2ED, 332 kbps throughput, 3.4 ms jitter, 3.48 J energy consumption, 7% PLR, 0.3 NRL, and 5 link breakages per simulation. This study provides a systematic and unified comparative evaluation of five widely used routing protocols across fourteen simulation-based vehicular mobility models. The findings provide scenario-specific comparative insights for simulation-based VANET performance evaluation and offer practical, simulation-based guidance for selecting suitable protocol–mobility model combinations under the evaluated experimental conditions.

OF DISSERTATION Secure and Authenticated Message Dissemination in Vehicular ad hoc Networks and an Incentive-based Architecture for Vehicular Cloud Vehicular ad hoc Networks (VANETs) allow vehicles to form a self-organized network. VANETs are likely to be widely deployed in the future, given the interest shown by industry in self-driving cars and satisfying their customers various interests. Problems related to Mobile ad hoc Networks (MANETs) such as routing, security, etc. have been extensively studied. Even though VANETs are special type of MANETs, solutions proposed for MANETs cannot be directly applied to VANETs because all problems related to MANETs have been studied for small networks. Moreover, in MANETs, nodes can move randomly. On the other hand, movement of nodes in VANETs are constrained to roads and the number of nodes in VANETs is large and covers typically large area. The following are the contributions of the thesis. Secure, authenticated, privacy preserving message dissemination in VANETs: When vehicles in VANET observe phenomena such as accidents, icy road condition, etc., they need to disseminate this information to vehicles in appropriate areas so the drivers of those vehicles can take appropriate action. When such messages are disseminated, the authenticity of the vehicles disseminating such messages should be verified while at the same time the anonymity of the vehicles should be preserved. Moreover, to punish the vehicles spreading malicious messages, authorities should be able to trace such messages to their senders when necessary. For this, we present an efficient protocol for the dissemination of authenticated messages. Incentive-based architecture for vehicular cloud: Due to the advantages such as flexibility and availability, interest in cloud computing has gained lot of attention in recent years. Allowing vehicles in VANETs to store the collected information in the cloud would facilitate other vehicles to retrieve this information when they need. In this thesis, we present a secure incentive-based architecture for vehicular cloud. Our architecture allows vehicles to collect and store information in the cloud; it also provides a mechanism for rewarding vehicles that contributing to the cloud. Privacy preserving message dissemination in VANETs: Sometimes, it is sufficient to ensure the anonymity of the vehicles disseminating messages in VANETs. We present a privacy preserving message dissemination protocol for VANETs.

Vehicular ad hoc networks (VANETs) are a special form of wireless networks made by vehicles communicating among themselves on roads. The conventional routing protocols proposed for mobile ad hoc networks (MANETs) work poorly in VANETs. As communication links break more frequently in VANETs than in MANETs, the routing reliability of such highly dynamic networks needs to be paid special attention. To date, very little research has focused on the routing reliability of VANETs on highways. In this paper, we use the evolving graph theory to model the VANET communication graph on a highway. The extended evolving graph helps capture the evolving characteristics of the vehicular network topology and determines the reliable routes preemptively. This paper is the first to propose an evolving graph-based reliable routing scheme for VANETs to facilitate quality-of-service (QoS) support in the routing process. A new algorithm is developed to find the most reliable route in the VANET evolving graph from the source to the destination. We demonstrate, through the simulation results, that our proposed scheme significantly outperforms the related protocols in the literature.

Vehicular Ad Hoc Networks (VANET) are key to realizing Intelligent Transportation Systems (ITS). Although VANETs belong to the class of Mobile Ad Hoc Networks (MANET), and there are numerous routing protocols for MANETs, none of these protocols are applicable for VANETs. In particular, VANETs are highly dynamic due to high speed mobility of vehicles and traditional routing algorithms for MANETs cannot deal with such dynamicity of network nodes. Several comparative studies have suggested AODV (Ad hoc On-Demand Distance Vector), a well known MANET protocol that is adaptive to dynamic changes in network and makes efficient utilization of network resources, to be the best candidate for dealing with VANETs. However, verbatim adoption of AODV is not an efficient routing solution for VANETs. Recent works therefore proposed various modifications and/or additions to AODV to make it suitable for VANETs. It is particularly important to control congestion in VANETs by efficiently dealing with the AODV "Route Request" (RREQ) packets. In this paper, we propose Pro-AODV (Proactive AODV), a protocol that uses information from the AODV routing table to minimize congestion in VANETs, yet sustains other performance metrics at acceptable levels. The novelty and elegance in Pro-AODV comes from the fact that it does not require the execution of any additional logic, it is sufficient to know only the size of the routing table at each node.

Vehicular Ad-Hoc Networks (VANETs) attract considerable research and commercial interest with promising applications in a number of areas including cooperative vehicle-highways systems, sensor networks, and safety systems. However, as a result of high speed and variable driver behavior, automotive ad-hoc networks behave in fundamentally different ways to the most prevalent models in Mobile Ad-Hoc Network (MANET) research. Previous work in MANETs has mostly assumed that the mobile nodes move randomly with an unconstrained mobility model, and it is clear that a random mobility model is not adequate to represent the major characteristics of real-world vehicle motions and may therefore lead to unreliable results. Recent studies of VANETs have attempted to introduce macro- and micromobility constraints to model vehicle motions, but they have mostly focused on modeling the mobility of generic private vehicles. Given the potential for the coordinated deployment of network nodes on centrally managed fleet vehicles, it has become important to model the characteristics of a VANET featuring vehicles of different types, with systematically different behavior patterns. In this article, the authors study the connectivity of mobile ad-hoc networks that consist of buses moving in urban area and examine the implications for transport-related services. Buses have a unique set of behavior characteristics (e.g., fixed routes, schedules, bus stops, specific priorities), which gives rise to distinct effect on node connectivity in the communication network. Through extensive simulations on the basis of real bus routes in central London, the authors (a) demonstrated the effect of the locations of stops and the prevailing traffic patterns on node connectivity (including the distributions of contact duration and intercontact time between buses) and (b) explored its implication on the design of a dissemination system to capture and disseminate data. Their results give a key message that the mobility of buses has to be modeled explicitly, and such kind of knowledge of connectivity among buses will be significant for the studies of routing algorithms and other networking functions in interbus communication networks.

Vehicular Ad Hoc Networks (VANETs) are based on network technology where cars act as mobile nodes to form a communication network. In VANETs, routing protocols have a significance regarding the overall network performance since they determine the way of sending and receiving packets between mobile nodes. Most of the protocols proposed for VANETs are adapted from Mobile ad hoc networks (MANETs) routing protocols. However, due to the specific characteristics of VANETs, especially high mobility, and dynamic topology, the routing protocols in ad hoc networks do not adapt immediately to VANETs. Therefore, secure routing of Vehicular ad hoc networks (VANETs) against attacks, which are of various types, is still a challenging issue. This paper is going to present a synthesis of the most relevant protocols that have addressed the secure routing issue in VANETs. It also establishes a comparison regarding the offered features and the studied performance aspects through which it is notified that a security mechanism depends not only on the level of efficiency but also on the network constraints.