scispace - formally typeset
Search or ask a question

Showing papers on "Ad hoc wireless distribution service published in 2012"


Journal ArticleDOI
TL;DR: In this paper, a significant number of broadcasting protocols for VANETs reported in the literature are classified and an in-depth review of these protocols are provided.
Abstract: With the fast development in ad hoc wireless communications and vehicular technology, it is foreseeable that, in the near future, traffic information will be collected and disseminated in real-time by mobile sensors instead of fixed sensors used in the current infrastructure-based traffic information systems. A distributed network of vehicles such as a vehicular ad hoc network (VANET) can easily turn into an infrastructure-less self-organizing traffic information system, where any vehicle can participate in collecting and reporting useful traffic information such as section travel time, flow rate, and density. Disseminating traffic information relies on broadcasting protocols. Recently, there have been a significant number of broadcasting protocols for VANETs reported in the literature. In this paper, we classify and provide an in-depth review of these protocols.

286 citations


Journal ArticleDOI
TL;DR: A survey of the routing algorithms proposed for wireless networks is presented, which offers a comprehensive review of various categories such as Geographical, Geo-casting, Hierarchical, Multi-path, Power-aware, and Hybrid routing algorithms.

278 citations


Proceedings ArticleDOI
01 Dec 2012
TL;DR: This paper presents several existing security attacks and approaches to defend against them, and discusses possible future security attacks with critical analysis and future research possibilities.
Abstract: Vehicular Ad hoc Networks (VANETs) are emerging mobile ad hoc network technologies incorporating mobile routing protocols for inter-vehicle data communications to support intelligent transportation systems. Among others security and privacy are major research concerns in VANETs due to the frequent vehicles movement, time critical response and hybrid architecture of VANETs that make them different than other Ad hoc networks. Thus, designing security mechanisms to authenticate and validate transmitted message among vehicles and remove adversaries from the network are significantly important in VANETs. This paper presents several existing security attacks and approaches to defend against them, and discusses possible future security attacks with critical analysis and future research possibilities.

238 citations


Journal ArticleDOI
TL;DR: This paper deals with the optimal parameter setting of the optimized link state routing (OLSR), which is a well-known mobile ad hoc network routing protocol, by defining an optimization problem and finding automatically optimal configurations of this routing protocol.
Abstract: Recent advances in wireless technologies have given rise to the emergence of vehicular ad hoc networks (VANETs). In such networks, the limited coverage of WiFi and the high mobility of the nodes generate frequent topology changes and network fragmentations. For these reasons, and taking into account that there is no central manager entity, routing packets through the network is a challenging task. Therefore, offering an efficient routing strategy is crucial to the deployment of VANETs. This paper deals with the optimal parameter setting of the optimized link state routing (OLSR), which is a well-known mobile ad hoc network routing protocol, by defining an optimization problem. This way, a series of representative metaheuristic algorithms (particle swarm optimization, differential evolution, genetic algorithm, and simulated annealing) are studied in this paper to find automatically optimal configurations of this routing protocol. In addition, a set of realistic VANET scenarios (based in the city of Malaga) have been defined to accurately evaluate the performance of the network under our automatic OLSR. In the experiments, our tuned OLSR configurations result in better quality of service (QoS) than the standard request for comments (RFC 3626), as well as several human experts, making it amenable for utilization in VANET configurations.

194 citations


Journal ArticleDOI
TL;DR: This work provides an overview of existing multicast routing mechanisms based on routing categories that helps in multimedia communication over MANETs and point to directions for future research and development.

188 citations


Journal ArticleDOI
TL;DR: This article tackles the problem of opportunistic data transfer in mobile ad hoc networks with a pure network layer scheme that can be built atop off-the-shelf wireless networking equipment, and test CORMAN and compare it to AODV, and observe significant performance improvement in varying mobile settings.
Abstract: The link quality variation of wireless channels has been a challenging issue in data communications until recent explicit exploration in utilizing this characteristic. The same broadcast transmission may be perceived significantly differently, and usually independently, by receivers at different geographic locations. Furthermore, even the same stationary receiver may experience drastic link quality fluctuation over time. The combination of link-quality variation with the broadcasting nature of wireless channels has revealed a direction in the research of wireless networking, namely, cooperative communication. Research on cooperative communication started to attract interests in the community at the physical layer but more recently its importance and usability have also been realized at upper layers of the network protocol stack. In this article, we tackle the problem of opportunistic data transfer in mobile ad hoc networks. Our solution is called Cooperative Opportunistic Routing in Mobile Ad hoc Networks (CORMAN). It is a pure network layer scheme that can be built atop off-the-shelf wireless networking equipment. Nodes in the network use a lightweight proactive source routing protocol to determine a list of intermediate nodes that the data packets should follow en route to the destination. Here, when a data packet is broadcast by an upstream node and has happened to be received by a downstream node further along the route, it continues its way from there and thus will arrive at the destination node sooner. This is achieved through cooperative data communication at the link and network layers. This work is a powerful extension to the pioneering work of ExOR. We test CORMAN and compare it to AODV, and observe significant performance improvement in varying mobile settings.

173 citations


Journal ArticleDOI
Ze Li1, Haiying Shen1
TL;DR: It is found that the strategies of using a threshold to determine the trustworthiness of a node in the reputation system and of rewarding cooperative nodes in the price-based system may be manipulated by clever or wealthy but selfish nodes.
Abstract: In mobile ad hoc networks (MANETs), tasks are conducted based on the cooperation of nodes in the networks. However, since the nodes are usually constrained by limited computation resources, selfish nodes may refuse to be cooperative. Reputation systems and price-based systems are two main solutions to the node noncooperation problem. A reputation system evaluates node behaviors by reputation values and uses a reputation threshold to distinguish trustworthy nodes and untrustworthy nodes. A price-based system uses virtual cash to control the transactions of a packet forwarding service. Although these two kinds of systems have been widely used, very little research has been devoted to investigating the effectiveness of the node cooperation incentives provided by the systems. In this paper, we use game theory to analyze the cooperation incentives provided by these two systems and by a system with no cooperation incentive strategy. We find that the strategies of using a threshold to determine the trustworthiness of a node in the reputation system and of rewarding cooperative nodes in the price-based system may be manipulated by clever or wealthy but selfish nodes. Illumined by the investigation results, we propose and study an integrated system. Theoretical and simulation results show the superiority of the integrated system over an individual reputation system and a price-based system in terms of the effectiveness of cooperation incentives and selfish node detection.

161 citations


Journal ArticleDOI
TL;DR: This paper proposes a new hybrid location-based routing protocol that is particularly designed to address the issue of vehicle mobility and shows through analysis and simulation that the protocol is scalable and has an optimal overhead, even in the presence of high location errors.
Abstract: Vehicular ad hoc networks (VANETs) are highly mobile wireless networks that are designed to support vehicular safety, traffic monitoring, and other commercial applications. Within VANETs, vehicle mobility will cause the communication links between vehicles to frequently be broken. Such link failures require a direct response from the routing protocols, leading to a potentially excessive increase in the routing overhead and degradation in network scalability. In this paper, we propose a new hybrid location-based routing protocol that is particularly designed to address this issue. Our new protocol combines features of reactive routing with location-based geographic routing in a manner that efficiently uses all the location information available. The protocol is designed to gracefully exit to reactive routing as the location information degrades. We show through analysis and simulation that our protocol is scalable and has an optimal overhead, even in the presence of high location errors. Our protocol provides an enhanced yet pragmatic location-enabled solution that can be deployed in all VANET-type environments.

144 citations


Journal ArticleDOI
TL;DR: The main beamforming-related challenges facing the medium access control in ad hoc networks are discussed and taxonomy of the MAC protocols proposed in the literature based on their mode of operation and the mechanisms used to address the challenges are presented.
Abstract: The beamforming antenna technology is a promising solution to many challenges facing wireless ad hoc networks. Beamforming antennas have the ability to increase the spatial reuse, improve the transmission reliability, extend the transmission range and/or save the power consumption. If they are effectively used, they can significantly improve the network capacity, lifetime, connectivity and security. However, traditional Medium Access Control (MAC) protocols fail to exploit the potential benefits due to the unique characteristics of wireless ad hoc networks with beamforming antennas. To that end, numerous MAC protocols have been designed over the years to harness the offered potential. In this paper, we survey the literature on MAC protocols proposed for wireless ad hoc networks with beamforming antennas during the last decade. We discuss the main beamforming-related challenges facing the medium access control in ad hoc networks. We present taxonomy of the MAC protocols proposed in the literature based on their mode of operation and the mechanisms used to address the challenges. In addition, we provide a qualitative comparison of the protocols highlighting their features, benefits and requirements. Finally, we provide directions for possible future work.

142 citations


Journal ArticleDOI
TL;DR: Both theoretical analysis and simulation results show that POR achieves excellent performance even under high node mobility with acceptable overhead and the new void handling scheme also works well.
Abstract: This paper addresses the problem of delivering data packets for highly dynamic mobile ad hoc networks in a reliable and timely manner. Most existing ad hoc routing protocols are susceptible to node mobility, especially for large-scale networks. Driven by this issue, we propose an efficient Position-based Opportunistic Routing (POR) protocol which takes advantage of the stateless property of geographic routing and the broadcast nature of wireless medium. When a data packet is sent out, some of the neighbor nodes that have overheard the transmission will serve as forwarding candidates, and take turn to forward the packet if it is not relayed by the specific best forwarder within a certain period of time. By utilizing such in-the-air backup, communication is maintained without being interrupted. The additional latency incurred by local route recovery is greatly reduced and the duplicate relaying caused by packet reroute is also decreased. In the case of communication hole, a Virtual Destination-based Void Handling (VDVH) scheme is further proposed to work together with POR. Both theoretical analysis and simulation results show that POR achieves excellent performance even under high node mobility with acceptable overhead and the new void handling scheme also works well.

126 citations


Journal ArticleDOI
01 Jul 2012
TL;DR: A reactive routing protocol for mobile cognitive radio ad hoc networks able to achieve three goals to avoid interferences to primary users during both route formation and data forwarding and to take advantage of the availability of multiple channels to improve the overall performance.
Abstract: Although more than a decade has passed from the proposal of the Cognitive Radio paradigm, in these years the research has mainly focused on physical and medium access issues, and few recent works focused on the problem of routing in cognitive networks. This paper addresses such a problem by evaluating the feasibility of reactive routing for mobile cognitive radio ad hoc networks. More specifically, we design a reactive routing protocol for the considered scenario able to achieve three goals: (i) to avoid interferences to primary users during both route formation and data forwarding; (ii) to perform a joint path and channel selection at each forwarder; (iii) to take advantage of the availability of multiple channels to improve the overall performance. Two different versions of the same protocol, referred to as Cognitive Ad-hoc On-demand Distance Vector (CAODV), are presented. The first version exploits inter-route spectrum diversity, while the second one exploits intra-route spectrum diversity. An exhaustive performance analysis of both the versions of the proposed protocol in different environments and network conditions has been carried out via numerical simulations. The results state the suitability of the proposed protocol for small mobile cognitive radio ad hoc networks.

Journal ArticleDOI
TL;DR: This work proposes bee-inspired BeeSensor protocol that is energy-aware, scalable and efficient, which helped BeeSensor in achieving the best performance with the least communication and processing costs - two main sources of energy consumption in sensor networks - as compared to other SI based WSN routing protocols.

Journal ArticleDOI
TL;DR: This paper proposes HYbrid Multi-hop routiNg (HYMN) algorithm, which is a hybrid of the two contemporary multi-hop routing algorithm architectures, namely, flat multi- Hop routing that utilizes efficient transmission distances, and hierarchical multi-Hop routing algorithms that capitalizes on data aggregation.
Abstract: Power-aware routing in Wireless Sensor Networks (WSNs) is designed to adequately prolong the lifetime of severely resource-constrained ad hoc wireless sensor nodes}. Recent research has identified the energy hole problem in single sink-based WSNs, a characteristic of the many-to-one (convergecast) traffic patterns. In this paper, we propose HYbrid Multi-hop routiNg (HYMN) algorithm, which is a hybrid of the two contemporary multi-hop routing algorithm architectures, namely, flat multi-hop routing that utilizes efficient transmission distances, and hierarchical multi-hop routing algorithms that capitalizes on data aggregation. We provide rigorous mathematical analysis for HYMN-optimize it and model its power consumption. In addition, through extensive simulations, we demonstrate the effective performance of HYMN in terms of superior connectivity.

Journal ArticleDOI
TL;DR: A distributed adaptive opportunistic routing scheme for multihop wireless ad hoc networks that utilizes a reinforcement learning framework to opportunistically route the packets even in the absence of reliable knowledge about channel statistics and network model is proposed.
Abstract: A distributed adaptive opportunistic routing scheme for multihop wireless ad hoc networks is proposed. The proposed scheme utilizes a reinforcement learning framework to opportunistically route the packets even in the absence of reliable knowledge about channel statistics and network model. This scheme is shown to be optimal with respect to an expected average per-packet reward criterion. The proposed routing scheme jointly addresses the issues of learning and routing in an opportunistic context, where the network structure is characterized by the transmission success probabilities. In particular, this learning framework leads to a stochastic routing scheme that optimally "explores" and "exploits" the opportunities in the network.

Journal ArticleDOI
TL;DR: Performance evaluation is conducted through simulations, and the results reveal the benefits of adopting the proposed routing metric for cognitive radio ad hoc networks, known as OPERA.
Abstract: Two main issues affect the existing routing metrics for cognitive radio ad hoc networks: i) they are often based on heuristics, and thus they have not been proved to be optimal; ii) they do not account for the route diversity effects, and thus they are not able to measure the actual cost of a route. In this paper, an optimal routing metric for cognitive radio ad hoc networks, referred to as OPERA, is proposed. OPERA is designed to achieve two features: i) Optimality: OPERA is optimal when combined with both Dijkstra and Bellman-Ford based routing protocols; ii) Accuracy: OPERA exploits the route diversity provided by the intermediate nodes to measure the actual end-to-end delay, by taking explicitly into account the unique characteristics of cognitive radio networks. A closed-form expression of the proposed routing metric is analytically derived for both static and mobile networks, and its optimality is proved rigorously. Performance evaluation is conducted through simulations, and the results reveal the benefits of adopting the proposed routing metric for cognitive radio ad hoc networks.

Posted Content
TL;DR: A new QoS algorithm for mobile ad hoc network has been proposed that combines the idea of Ant Colony Optimization (ACO) with Optimized Link State Routing (OLSR) protocol to identify multiple stable paths between source and destination nodes.
Abstract: Mobile Ad Hoc Network (MANET) is a dynamic multihop wireless network which is established by a set of mobile nodes on a shared wireless channel. One of the major issues in MANET is routing due to the mobility of the nodes. Routing means the act of moving information across an internet work from a source to a destination. When it comes to MANET, the complexity increases due to various characteristics like dynamic topology, time varying QoS requirements, limited resources and energy etc. QoS routing plays an important role for providing QoS in wireless ad hoc networks. The biggest challenge in this kind of networks is to find a path between the communication end points satisfying user’s QoS requirement. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for MANETs. In this paper, a new QoS algorithm for mobile ad hoc network has been proposed. The proposed algorithm combines the idea of Ant Colony Optimization (ACO) with Optimized Link State Routing (OLSR) protocol to identify multiple stable paths between source and destination nodes.

Journal ArticleDOI
TL;DR: This paper proposes FUZZBR (FUZZy BRoadcast), a fuzzy logic based multi-hop broadcast protocol for information dissemination in vehicular ad hoc networks that has low message overhead and uses a lightweight retransmission mechanism to retransmit a packet when a relay fails.
Abstract: Vehicular ad hoc networks have been attracting the interest of both academic and industrial communities on account of their potential role in Intelligent Transportation Systems (ITS). However, due to vehicle movement and fading in wireless communications, providing a reliable and efficient multi-hop broadcast service in vehicular ad hoc networks is still an open research topic. In this paper, we propose FUZZBR (FUZZy BRoadcast), a fuzzy logic based multi-hop broadcast protocol for information dissemination in vehicular ad hoc networks. FUZZBR has low message overhead since it uses only a subset of neighbor nodes to relay data messages. In the relay node selection, FUZZBR jointly considers multiple metrics of inter-vehicle distance, node mobility and signal strength by employing the fuzzy logic. FUZZBR also uses a lightweight retransmission mechanism to retransmit a packet when a relay fails. We use computer simulations to evaluate the performance of FUZZBR.

Journal ArticleDOI
TL;DR: A survey of current routing solutions is presented, where routing protocols for opportunistic networks are classified based on the network graph employed and the need to capture performance trade-offs from a multi-objective perspective is highlighted.
Abstract: This article examines the evolution of routing protocols for intermittently connected ad hoc networks and discusses the trend toward socialbased routing protocols. A survey of current routing solutions is presented, where routing protocols for opportunistic networks are classified based on the network graph employed. The need to capture performance trade-offs from a multi-objective perspective is highlighted.

Journal Article
TL;DR: This paper has concluded that MMBCR gives more network lifetime by selecting route with maximum battery capacity thereby outperforming DSR and Ad hoc OnDemand Distance Vector Routing Protocol.
Abstract: In mobile ad hoc network nodes have limited battery power. If a node is used frequently for transmission or overhearing of data packets, more energy is consumed by that node and after certain amount of time the energy level may not be sufficient for data transmission resulting in connection failure. In this paper, we have considered three routing protocols-Dynamic Source Routing (DSR) & Minimum Maximum Battery cost Routing (MMBCR), Ad hoc OnDemand Distance Vector Routing Protocol (AODV) and studied their performances in terms of network lifetime for the same network scenario. Simulations are carried out using NS2. Finally from the simulation results we have concluded that MMBCR gives more network lifetime by selecting route with maximum battery capacity thereby outperforming DSR.

Proceedings ArticleDOI
25 Mar 2012
TL;DR: This paper proposes a fully-distributed broadcast protocol in multi-hop CR ad hoc networks without a common control channel that can provide very high successful broadcast ratio while achieving the shortest average broadcast delay and eliminate broadcast collisions.
Abstract: Broadcast is an important operation in wireless ad hoc networks where control information is usually propagated as broadcasts for the realization of most networking protocols. In traditional ad hoc networks, since the spectrum availability is uniform, broadcasts are delivered via a common channel which can be heard by all users in a network. However, in cognitive radio (CR) ad hoc networks, different unlicensed users may acquire different available channel sets. This non-uniform spectrum availability imposes special design challenges for broadcasting in CR ad hoc networks. In this paper, a fully-distributed broadcast protocol in multi-hop CR ad hoc networks without a common control channel is proposed. In our design, we consider practical scenarios that each unlicensed user is not assumed to be aware of the global network topology, the spectrum availability information of other users, and time synchronization information. By intelligently downsizing the original available channel set and designing the broadcasting sequences and scheduling schemes, our proposed broadcast protocol can provide very high successful broadcast ratio while achieving the shortest average broadcast delay. It can also eliminate broadcast collisions. To the best of our knowledge, this is the first work that addresses the broadcasting challenges specifically in multi-hop CR ad hoc networks under practical scenarios.

Journal ArticleDOI
TL;DR: A secure node disjoint multipath routing protocol for wireless sensor networks is proposed and shows better results in terms of packet delivery fraction, energy consumption, and end-to-end delay compared to the ad hoc on-demand multipath distance vector routing.
Abstract: The objective of energy efficient routing protocol is to increase the operational lifetime of the wireless sensor networks Multipath routing protocols enhance the lifetime of the wireless sensor networks by distributing traffic among multiple paths instead of a single optimal path Transmission of secured data is also an important research concern in the wireless sensor networks In this paper, a secure node disjoint multipath routing protocol for wireless sensor networks is proposed Here, the data packets are transmitted in a secure manner by using the digital signature crypto system It is compared with an ad hoc on-demand multipath distance vector routing protocol It shows better results in terms of packet delivery fraction, energy consumption, and end-to-end delay compared to the ad hoc on-demand multipath distance vector routing

Journal ArticleDOI
TL;DR: A quality of service enabled ant colony-based multipath routing (QAMR) algorithm based on the foraging behaviour of ant colony for selecting path and transmitting data that is scalable and performs better at higher traffic load compared to the existing algorithms.
Abstract: Mobile ad hoc networks (MANETs) are dynamically changing and self-configuring networks. Owing to their widespread use for many applications, multipath routing in MANETs has been widely discussed for providing fault-tolerance routing, quality-of-service (QoS) and various other purposes. The authors propose a quality of service enabled ant colony-based multipath routing (QAMR) algorithm based on the foraging behaviour of ant colony for selecting path and transmitting data. In this approach, the path is selected based on the stability of the nodes and the path preference probability. The authors have considered bandwidth, delay and hop count as the QoS parameters along with the stability of node, number of hops and path preference probability factors. Simulations performed with network simulator 2 shows that the proposed algorithm is scalable and performs better at higher traffic load compared to the existing algorithms.

Journal ArticleDOI
TL;DR: This paper presents an efficient routing protocol for VANETs, called the Reliable Inter-VEhicular Routing (RIVER) protocol, which performs real-time, active traffic monitoring and uses data and other data gathered through passive mechanisms to assign a reliability rating to each street edge.

Proceedings ArticleDOI
01 Dec 2012
TL;DR: An effective geographic mobility prediction routing protocol is proposed to improve the performance of routing among UAVs and can provide effective and reliable data routing with acceptable communication overhead in the highly dynamic environment of Ad Hoc UAV Network.
Abstract: Unmanned Aerial Vehicles (UAVs) play more and more important roles in modern warfare. However, the data routing for communication among UAVs faces several challenges, such as packet loss or routing path failure etc. The main problem of UAVs data routing is caused by the high mobility of UAVs. In this paper, an effective geographic mobility prediction routing protocol is proposed to improve the performance of routing among UAVs. First, a Gaussian distribution of UAVs movement probability density function is deduced to reduce the impact of high mobility. Then, two-hop perimeter forwarding is proposed to reduce the impact of routing void. The experiment results show that the proposed approach can provide effective and reliable data routing with acceptable communication overhead in the highly dynamic environment of Ad Hoc UAV Network.

Journal ArticleDOI
TL;DR: This paper has proposed an approach to verify the correct forwarding of packets by an intermediate node, and compared it with the watchdog and the 2-hop ACK which are well-known approaches in the literature.

Journal ArticleDOI
TL;DR: The protocol verification, analysis, and simulation results show the robustness and superior performance of the DSDMAC protocol, which can achieve a much higher network throughput and lower delay utilizing the spatial multiplexing gain of the directional antennas.
Abstract: Applying directional antennas in wireless ad hoc networks can theoretically achieve higher spatial multiplexing gain and, thus, higher network throughput. However, in practice, deafness, hidden-terminal, and exposed terminal problems are exaggerated with directional antennas, and they cause the degradation of the overall network performance. Although there are several random-access-based medium-access control (MAC) protocols being proposed in the literature for networks with directional antennas, the deafness, hidden-terminal, and exposed terminal problems have yet to be fully solved. In this paper, we present a new MAC protocol called the dual-sensing directional MAC (DSDMAC) protocol for wireless ad hoc networks with directional antennas. Different from existing protocols, the DSDMAC protocol relies on the dual-sensing strategy to identify deafness, resolve the hidden-terminal problem, and avoid unnecessary blocking. The integrity of the DSDMAC protocol is verified and validated using , which is a formal protocol verification and validation tool. We further develop an analytical framework to quantify the performance of the DSDMAC protocol and conduct extensive simulations, which verify the accuracy of the analysis. The protocol verification, analysis, and simulation results show the robustness and superior performance of the DSDMAC protocol, which can achieve a much higher network throughput and lower delay utilizing the spatial multiplexing gain of the directional antennas. The results presented in this paper show that the proposed DSDMAC protocol can substantially outperform the state-of-the-art protocols.

Journal ArticleDOI
TL;DR: This research paper describes the characteristics of ad hoc routing protocols Ad-hoc On Demand Distance Vector Routing (AODV), Optimized link State R routing (OLSR), Temporally Ordered Routing Algorithm (TORA), Dynamic Source Routing(DSR), Destination-Sequenced Distance-Vector Routed (DSDV) based on the performance metrics like packet delivery fraction, Average delay, Normalized Routing load, Throughput and Jitter.
Abstract: Mobile Ad-Hoc Networks (MANETs) are autonomous and decentralized wireless systems. Mobile Ad hoc Network is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many Routing protocols have been proposed so far to improve the routing performance and reliability. This research paper describes the characteristics of ad hoc routing protocols Ad-hoc On Demand Distance Vector Routing (AODV), Optimized link State Routing (OLSR), Temporally Ordered Routing Algorithm (TORA), Dynamic Source Routing (DSR), Destination-Sequenced Distance-Vector Routing (DSDV) based on the performance metrics like packet delivery fraction, Average delay, Normalized Routing load, Throughput and Jitter under low mobility and low traffic network as well as under high mobility and high traffic network. Results show that AODV has maximum throughput under low traffic and DSDV has maximum throughput under high traffic. As network becomes dense OLSR, DSR and DSDV perform well in terms of Throughput than AODV and TORA. TORA performs well in dense networks in terms of packet delivery fraction but at the same time Normalized Routing load of TORA is maximum among all the protocols in both the networks. DSDV has least Normalized Routing load in both low and high traffic. OLSR and DSDV give the least Jitter and Average Delay in both networks.

Proceedings ArticleDOI
12 Apr 2012
TL;DR: This paper seeks to study the impact of RPL's various parameters and external factors on its performance and obtain insights on RPL tuning for its use in VANETs.
Abstract: This paper focuses on routing for vehicles getting access to infrastructure either directly or via multiple hops though other vehicles We study Routing Protocol for Low power and lossy networks (RPL), a tree-based routing protocol designed for sensor networks Many design elements from RPL are transferable to the vehicular environment We provide a simulation performance study of RPL and RPL tuning in VANETs More specifically, we seek to study the impact of RPL's various parameters and external factors (eg, various timers and speeds) on its performance and obtain insights on RPL tuning for its use in VANETs

Proceedings ArticleDOI
25 Jun 2012
Abstract: From the security perspective Mobile Ad hoc Networks (MANETs) are amongst the most challenging research areas and one of the key reasons for this is the ambiguous nature of insider attacks in these networks. In recent years, many attempts have been made to study the intrinsic attributes of these insider attacks but the focus has generally been on the analysis of one or very few particular attacks, or only the survey of various attacks without any performance analysis. Therefore, a major feature that research has lately lacked is a detailed and comprehensive study of the effects of various insider attacks on the overall performance of MANETs. In this paper we investigate, in detail, some of the most severe attacks against MANETs namely the blackhole attack, sinkhole attack, selfish node behavior, RREQ flood, hello flood, and selective forwarding attack. A detailed NS-2 implementation of launching these attacks successfully using Ad hoc On-Demand Distance Vector (AODV) routing protocol has been presented and a comprehensive and comparative analysis of these attacks is performed. We use packet efficiency, routing overhead, and throughput as our performance metrics. Our simulationbased study shows that flooding attacks like RREQ flood and hello flood drastically increase the routing overhead of the protocol. Route modification attacks such as sinkhole and blackhole are deadly and severely affect the packet efficiency and bring down the throughput to unacceptable ranges.

Book
11 Jun 2012
TL;DR: This book offers an in-depth discussion of the most representative mobility models for major next generation wireless network application scenarios, including WLAN/mesh networks, vehicular networks, wireless sensor networks, and opportunistic networks.
Abstract: Mobility Models for Next Generation Wireless Networks: Ad Hoc, Vehicular and Mesh Networksprovides the reader with an overview of mobility modelling, encompassing both theoretical and practical aspects related to the challenging mobility modelling task. It also:Provides up-to-date coverage of mobility models for next generation wireless networksOffers an in-depth discussion of the most representative mobility models for major next generation wireless network application scenarios, including WLAN/mesh networks, vehicular networks, wireless sensor networks, and opportunistic networksDemonstrates the practices for designing effective protocol/applications for next generation wireless networksIncludes case studies showcasing the importance of properly understanding fundamental mobility model properties in wireless network performance evaluation