Showing papers on "Ad hoc wireless distribution service published in 2013"
01 Sep 2013
TL;DR: This paper presents a dynamic trust prediction model to evaluate the trustworthiness of nodes, which is based on the nodes’ historical behaviors, as well as the future behaviors via extended fuzzy logic rules prediction, and integrated the proposed trust predication model into the Source Routing Mechanism.
Abstract: Mobile ad hoc networks (MANETs) are spontaneously deployed over a geographically limited area without well-established infrastructure. The networks work well only if the mobile nodes are trusty and behave cooperatively. Due to the openness in network topology and absence of a centralized administration in management, MANETs are very vulnerable to various attacks from malicious nodes. In order to reduce the hazards from such nodes and enhance the security of network, this paper presents a dynamic trust prediction model to evaluate the trustworthiness of nodes, which is based on the nodes’ historical behaviors, as well as the future behaviors via extended fuzzy logic rules prediction. We have also integrated the proposed trust predication model into the Source Routing Mechanism. Our novel on-demand trust-based unicast routing protocol for MANETs, termed as Trust-based Source Routing protocol (TSR), provides a flexible and feasible approach to choose the shortest route that meets the security requirement of data packets transmission. Extensive experiments have been conducted to evaluate the efficiency and effectiveness of the proposed mechanism in malicious node identification and attack resistance. The results show that TSR improves packet delivery ratio and reduces average end-to-end latency.
193 citations
TL;DR: Methods to mitigate resource depletion attacks at the routing protocol layer, which permanently disable networks by quickly draining nodes' battery power, are discussed, including a new proof-of-concept protocol that provably bounds the damage caused by Vampires during the packet forwarding phase.
Abstract: Ad hoc low-power wireless networks are an exciting research direction in sensing and pervasive computing. Prior security work in this area has focused primarily on denial of communication at the routing or medium access control levels. This paper explores resource depletion attacks at the routing protocol layer, which permanently disable networks by quickly draining nodes' battery power. These "Vampire” attacks are not specific to any specific protocol, but rather rely on the properties of many popular classes of routing protocols. We find that all examined protocols are susceptible to Vampire attacks, which are devastating, difficult to detect, and are easy to carry out using as few as one malicious insider sending only protocol-compliant messages. In the worst case, a single Vampire can increase network-wide energy usage by a factor of O(N), where N in the number of network nodes. We discuss methods to mitigate these types of attacks, including a new proof-of-concept protocol that provably bounds the damage caused by Vampires during the packet forwarding phase.
170 citations
TL;DR: This work proposes an Anonymous Location-based Efficient Routing proTocol (ALERT), a novel anonymous routing protocol that dynamically partitions the network field into zones and randomly chooses nodes in zones as intermediate relay nodes, which form a nontraceable anonymous route.
Abstract: Mobile Ad Hoc Networks (MANETs) use anonymous routing protocols that hide node identities and/or routes from outside observers in order to provide anonymity protection. However, existing anonymous routing protocols relying on either hop-by-hop encryption or redundant traffic, either generate high cost or cannot provide full anonymity protection to data sources, destinations, and routes. The high cost exacerbates the inherent resource constraint problem in MANETs especially in multimedia wireless applications. To offer high anonymity protection at a low cost, we propose an Anonymous Location-based Efficient Routing proTocol (ALERT). ALERT dynamically partitions the network field into zones and randomly chooses nodes in zones as intermediate relay nodes, which form a nontraceable anonymous route. In addition, it hides the data initiator/receiver among many initiators/receivers to strengthen source and destination anonymity protection. Thus, ALERT offers anonymity protection to sources, destinations, and routes. It also has strategies to effectively counter intersection and timing attacks. We theoretically analyze ALERT in terms of anonymity and efficiency. Experimental results exhibit consistency with the theoretical analysis, and show that ALERT achieves better route anonymity protection and lower cost compared to other anonymous routing protocols. Also, ALERT achieves comparable routing efficiency to the GPSR geographical routing protocol.
143 citations
TL;DR: An overview of the multichannel architecture proposed by standardization bodies in the United States and Europe is presented and the main contribution is the identification of the open challenges for multich channel coordination, synchronization, and access.
Abstract: Vehicular ad hoc networks are the key to provisioning safety-critical and commercial services on the road. Multiple channels are assigned in the 5 GHz spectrum to support these services. In this article an overview of the multichannel architecture proposed by standardization bodies in the United States and Europe is presented. The main contribution is the identification of the open challenges for multichannel coordination, synchronization, and access. Discussions on related countermeasures, fully explored in neither the standards nor the scientific literature, aim to serve as guidelines for designers of future protocols and applications in vehicular environments.
142 citations
Journal Article•
TL;DR: This paper gives an overview of Vehicular ad hoc networks (VANETs) and the existing VANET routing protocols; mainly it focused on vehicle to vehicle (V2V) communication and protocols.
Abstract: In recent years, the aspect of vehicular ad hoc network (VANET) is becoming an interesting research area; VANET is a mobile ad hoc network considered as a special case of mobile ad hoc network (MANET). Similar to MANET, VANET is characterized as autonomous and self-configured wireless network. However, VANET has very dynamic topology, large and variable network size, and constrained mobility; these characteristics led to the need for efficient routing and resource saving VANET protocols, to fit with different VANET environments. These differences render traditional MANET's protocols unsuitable for VANET. The aim of this work is to give a survey of the VANETs routing mechanisms, this paper gives an overview of Vehicular ad hoc networks (VANETs) and the existing VANET routing protocols; mainly it focused on vehicle to vehicle (V2V) communication and protocols. The paper also represents the general outlines and goals of VANETs, investigates different routing schemes that have been developed for VANETs, as well as providing classifications of VANET routing protocols (focusing on two classification forms), and gives summarized comparisons between different classes in the context of their methodologies used, strengths, and limitations of each class scheme compared to other classes. Finally, it extracts the current trends and the challenges for efficient routing mechanisms in VANETs.
139 citations
TL;DR: This paper presents an information-centric architecture for IEEE 802.11 wireless ad hoc networks, named E-CHANET, which performs routing, forwarding and reliable transport functions, specifically tailored to cope with the limitations and requirements of wireless distributed environments.
128 citations
TL;DR: PFQ-AODV is a flexible, portable, and practicable solution for routing in VANETs that learns the optimal route by employing a fuzzy constraint Q-learning algorithm based on ad hoc on-demand distance vector (A ODV) routing.
Abstract: Vehicular ad hoc networks (VANETs) have been attracting interest for their potential uses in driving assistance, traffic monitoring, and entertainment systems. However, due to vehicle movement, limited wireless resources, and the lossy characteristics of a wireless channel, providing a reliable multihop communication in VANETs is particularly challenging. In this paper, we propose PFQ-AODV, which is a portable VANET routing protocol that learns the optimal route by employing a fuzzy constraint Q-learning algorithm based on ad hoc on-demand distance vector (AODV) routing. The protocol uses fuzzy logic to evaluate whether a wireless link is good or not by considering multiple metrics, which are, specifically, the available bandwidth, link quality, and relative vehicle movement. Based on an evaluation of each wireless link, the proposed protocol learns the best route using the route request (RREQ) messages and hello messages. The protocol can infer vehicle movement based on neighbor information when position information is unavailable. PFQ-AODV is also independent of lower layers. Therefore, PFQ-AODV provides a flexible, portable, and practicable solution for routing in VANETs. We show the effectiveness of the proposed protocol by using both computer simulations and real-world experiments.
125 citations
TL;DR: An energy-efficient genetic algorithm mechanism to resolve quality of service (QoS) multicast routing problem, which is NP-complete, depends on bounded end-to-end delay and minimum energy cost of the multicast tree.
Abstract: The consideration of energy consumption in wireless ad hoc networks prevents the problem of the network exhausting batteries, thus partitioning the entire network. Power-aware multicasting is proposed to reduce the power consumption. This letter presents an energy-efficient genetic algorithm mechanism to resolve quality of service (QoS) multicast routing problem, which is NP-complete. The proposed genetic algorithm depends on bounded end-to-end delay and minimum energy cost of the multicast tree. Simulation results show that the proposed algorithm is effective and efficient.
123 citations
25 Nov 2013
TL;DR: The wmSDN software toolkit is formed by Open vSwitch, POX controller, OLSR daemon and the own Bash and Python scripts, showing its applicability to a traffic engineering use-case, in which the controller logic balances outgoing traffic among the Internet gateways of the mesh.
Abstract: In this paper we propose to integrate Software Defined Networking (SDN) principles in Wireless Mesh Networks (WMN) formed by OpenFlow switches. The use of a centralized network controller and the ability to setup arbitrary paths for data flows make SDN a handy tool to deploy fine-grained traffic engineering algorithms in WMNs. However, centralized control may be harmful in multi-hop radio networks formed by commodity devices (e.g. Wireless Community Networks), in which node isolation and network fragmentation are not rare events. To exploit the pros and mitigate the cons, our framework uses the traditional OpenFlow centralized controller to engineer the routing of data traffic, while it uses a distributed controller based on OLSR to route: i) OpenFlow control traffic, ii) data traffic, in case of central controller failure. We implemented and tested our Wireless Mesh Software Defined Network (wmSDN) showing its applicability to a traffic engineering use-case, in which the controller logic balances outgoing traffic among the Internet gateways of the mesh. Albeit simple, this use case allows showing a possible usage of SDN that improves user performance with respect to the case of a traditional mesh with IP forwarding and OLSR routing. The wmSDN software toolkit is formed by Open vSwitch, POX controller, OLSR daemon and our own Bash and Python scripts. The tests have been carried out in an emulation environment based on Linux Containers, NS3 and CORE tools.
122 citations
01 Jan 2013
TL;DR: The aim of this research is to provide a solution on the basis of reputation method to solve routing issues raised by misbehaving nodes.
Abstract: The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network infrastructure or administration. The protocol is composed of the two mechanisms of Route Discovery and Route Maintenance, which work together to allow nodes to discover and maintain source routes to arbitrary destinations in the ad hoc network. The aim of this research is to provide a solution on the basis of reputation method to solve routing issues raised by misbehaving nodes.
102 citations
01 Dec 2013
TL;DR: A fundamental but challenging problem in cooperation and control of multiple unmanned aerial vehicles (UAVs) is efficient networking of the UAVs over the wireless medium in rapidly changing environments, and it is highlighted that one important feature of the next-generation waveforms is their capability of Internet protocol based ad hoc networking, which allows Uavs to communicate with each other in a single- or multi-layer UAV ad hoc networks.
Abstract: A fundamental but challenging problem in cooperation and control of multiple unmanned aerial vehicles (UAVs) is efficient networking of the UAVs over the wireless medium in rapidly changing environments. In this paper, we introduce four communication architectures for networking UAVs and review some military communication standards applicable to UAV communications. After discussions of pros and cons of each communication architecture, we conclude that a UAV ad hoc network is the most appropriate architecture to network a team of UAVs, while a multi-layer UAV ad hoc network is more suitable for multiple groups of heterogeneous UAVs. By comparing various legacy and next-generation military data link systems, we highlight that one important feature of the next-generation waveforms is their capability of Internet protocol (IP) based ad hoc networking, which allows UAVs to communicate with each other in a single- or multi-layer UAV ad hoc networks.
TL;DR: Simulation results show that the proposed protocol can support traffic safety and increase vehicular ad hoc networks' (VANETs) efficiency, reliability, and stability of the cluster topology by increasing the CH's lifetime and the dwell time of its members.
Abstract: Since vehicular safety applications require periodic dissemination of status and emergency messages, contention-based medium-access-control (MAC) protocols such as IEEE 802.11p have problems in predictability, fairness, low throughput, latency, and high collision rate, particularly in high-density networks. Therefore, a distributed multichannel and mobility-aware cluster-based MAC (DMMAC) protocol is proposed. Through channel scheduling and an adaptive learning mechanism integrated within the fuzzy-logic inference system (FIS), vehicles organize themselves into more stable and nonoverlapped clusters. Each cluster will use a different subchannel from its neighbors in a distributed manner to eliminate the hidden terminal problem. Increasing the system's reliability, reducing the time delay for vehicular safety applications, and efficiently clustering vehicles in highly dynamic and dense networks in a distributed manner are the main contributions of the proposed MAC protocol. The reliability and connectivity of DMMAC are analyzed in terms of the average cluster size, the communication range within the cluster and between cluster heads (CHs), and the lifetime of a path. Simulation results show that the proposed protocol can support traffic safety and increase vehicular ad hoc networks' (VANETs) efficiency, reliability, and stability of the cluster topology by increasing the CH's lifetime and the dwell time of its members.
TL;DR: A passive clustering aided routing protocol, named PassCAR, to enhance routing performance in the one-way multi-lane highway scenario and significantly improves the packet delivery ratio and achieves a higher network throughput due to its preference for reliable, stable, and durable routing paths.
25 Feb 2013
TL;DR: The revised Ad Hoc On-demand Distance Vector (AODVv2) routing protocol is intended for use by mobile routers in wireless, multihop networks, offering on-demand convergence in dynamic topologies.
Abstract: The revised Ad Hoc On-demand Distance Vector (AODVv2) routing protocol
is intended for use by mobile routers in wireless, multihop networks.
AODVv2 determines unicast routes among AODVv2 routers within the
network in an on-demand fashion, offering on-demand convergence in
dynamic topologies.
01 Dec 2013
TL;DR: Numerical results show that Predictive-OLSR significantly outperforms OLSR and BABEL, providing a reliable communication even in very dynamic conditions.
Abstract: In this paper we examine mobile ad-hoc networks (MANET) composed by unmanned aerial vehicles (UAVs). Due to the high-mobility of the nodes, these networks are very dynamic and the existing routing protocols partly fail to provide a reliable communication. We present Predictive-OLSR an extension to the Optimized Link-State Routing (OLSR) protocol: it enables efficient routing in very dynamic conditions. The key idea is to exploit GPS information to aid the routing protocol. Predictive-OLSR weights the expected transmission count (ETX) metric, taking into account the relative speed between the nodes. We provide numerical results obtained by a MAC-layer emulator that integrates a flight simulator to reproduce realistic flight conditions. These numerical results show that Predictive-OLSR significantly outperforms OLSR and BABEL, providing a reliable communication even in very dynamic conditions.
25 Mar 2013
TL;DR: A novel History Based Prediction Routing protocol for infrastructure-less OppNets which utilizes the behavioral information of the nodes to find the best next node for routing and is compared with the Epidemic routing protocol.
Abstract: In Opportunistic Networks (OppNets), the existence of an end-to-end connected path between the sender and the receiver is not possible. Thus routing in this type of networks is different from the traditional Mobile Adhoc Networks (MANETs). MANETs assume the existence of a fixed route between the sender and the receiver before the start of the communication and till its completion. Routes are constructed dynamically as the source node or an intermediate node can choose any node as next hop from a group of neighbors assuming that it will take the message closer to the destination node or deliver to the destination itself. In this paper, we proposed a novel History Based Prediction Routing (HBPR) protocol for infrastructure-less OppNets which utilizes the behavioral information of the nodes to find the best next node for routing. The proposed protocol was compared with the Epidemic routing protocol. Through simulations it was found that the HBPR performs better in terms of number of messages delivered and the overhead ratio than the Epidemic protocol.
TL;DR: An analytical model for the performance evaluation of safety message dissemination in vehicular ad hoc networks with two priority classes is presented and a good tradeoff between network parameters such as vehicles' transmission range, safety traffic generation rate, and medium access control parameters to satisfy the required delay bounds for the critical high-priority traffic is determined.
Abstract: In vehicular ad hoc networks (VANETs), because all vehicles in range are shown as destination nodes and less time is spent for the medium access process, broadcast communication is considered a highly appropriate technique for the dissemination of safety messages in such networks. However, the lack of request-to-send/clear-to-send handshaking and packet acknowledgment makes the communication more vulnerable to interferences, thus resulting in lower communication reliability. In this paper, we present an analytical model for the performance evaluation of safety message dissemination in vehicular ad hoc networks with two priority classes. In particular, considering the IEEE 802.11 broadcast protocol and using 2-D Markov modeling, we derive the joint distribution of the numbers of low-priority periodic messages, which are in transmission mode and in a backoff process in a highway. Then, the result is used to derive the average dissemination delay of high-priority event-driven messages in the presence of the low-priority traffic in the network. The results are helpful in determining a good tradeoff between network parameters such as vehicles' transmission range, safety traffic generation rate, and medium access control (MAC) parameters to satisfy the required delay bounds for the critical high-priority traffic.
01 Jan 2013
TL;DR: This paper is describing the all prominent attacks described in literature in a consistent manner to provide a concise comparison on attack types in mobile ad hoc network.
Abstract: Security is an essential requirement in mobile ad hoc network (MANETs). Compared to wired networks, MANETs are more vulnerable to security attacks due to the lack of a trusted centralized authority and limited resources. Attacks on ad hoc networks can be classified as passive and active attacks, depending on whether the normal operation of the network is disrupted or not. In this paper, we are describing the all prominent attacks described in literature in a consistent manner to provide a concise comparison on attack types.
TL;DR: A novel bee colony optimization algorithm called bees life algorithm (BLA) applied to solve the quality of service multicast routing problem (QoS-MRP) for vehicular ad hoc networks as NP-Complete problem with multiple constraints is proposed.
TL;DR: FrAODV, a trust-based scheme for securing AODV routing protocol in MANET using the friendship mechanism is presented, believed to provide a robust environment where MANET nodes can trust each other in a secure community.
Abstract: Mobile Ad hoc Network (MANET) is a self-organizing wireless network for mobile devices. It does not require any fixed infrastructure to be configured which makes it more suitable to be used in environments that require on-the-fly setup. This paper discusses the challenging issues in MANET routing security. It presents FrAODV, a trust-based scheme for securing AODV routing protocol in MANET using the friendship mechanism. The nodes can evaluate the routing paths according to some selected features (such as node reputation and identity information) before forwarding the data through these routes. We have used two types of implementation in our scheme, simulation (using NS2) and real test-bed (using JADHOC). This scheme is believed to provide a robust environment where MANET nodes can trust each other in a secure community.
01 Jan 2013
TL;DR: Routing techniques which is the most challenging issue due to the dynamic topology of ad hoc networks are concentrates on.
Abstract: In recent years mobile ad hoc networks have become very popular and lots of research is being done on different aspects of MANET. Mobile Ad Hoc Networks (MANET)-a system of mobile nodes (laptops, sensors, etc.) interfacing without the assistance of centralized infrastructure (access points, bridges, etc.). There are different aspects which are taken for research like routing, synchronization, power consumption, bandwidth considerations etc. This paper concentrates on routing techniques which is the most challenging issue due to the dynamic topology of ad hoc networks. There are different strategies proposed for efficient routing which claimed to provide improved performance. There are different routing protocols proposed for MANETs which makes it quite difficult to determine which protocol is suitable for different network conditions .This paper provides an overview of different routing protocols proposed in literature and also provides a comparison between them.
TL;DR: This paper proposes the Cluster-based Certificate Revocation with Vindication Capability (CCRVC) scheme, and proposes the threshold-based mechanism to assess and vindicate warned nodes as legitimate nodes or not, before recovering them.
Abstract: Mobile ad hoc networks (MANETs) have attracted much attention due to their mobility and ease of deployment. However, the wireless and dynamic natures render them more vulnerable to various types of security attacks than the wired networks. The major challenge is to guarantee secure network services. To meet this challenge, certificate revocation is an important integral component to secure network communications. In this paper, we focus on the issue of certificate revocation to isolate attackers from further participating in network activities. For quick and accurate certificate revocation, we propose the Cluster-based Certificate Revocation with Vindication Capability (CCRVC) scheme. In particular, to improve the reliability of the scheme, we recover the warned nodes to take part in the certificate revocation process; to enhance the accuracy, we propose the threshold-based mechanism to assess and vindicate warned nodes as legitimate nodes or not, before recovering them. The performances of our scheme are evaluated by both numerical and simulation analysis. Extensive results demonstrate that the proposed certificate revocation scheme is effective and efficient to guarantee secure communications in mobile ad hoc networks.
09 Jun 2013
TL;DR: Detailed analysis and simulation-based evaluations show that iCAR significantly improves the network performance in terms of packet delivery ratio and end-to-end delay with a negligible cost of communication overhead.
Abstract: In this paper, we propose an intersection-based connectivity-aware routing protocol (iCAR) for vehicular ad hoc networks (VANETs) to enable infotainment and interactive applications, as well as multi-hop Internet access in urban environments. iCAR is a novel protocol that takes into consideration real-time vehicular traffic information and the experienced packet delivery delay per road, in order to improve the routing performance by dynamically selecting roads with a guaranteed connectivity and a reduced delivery delay. This is achieved by deploying a microscopic view of vehicles location to proactively estimate roads connectivity and the minimum link lifetime per road. Detailed analysis and simulation-based evaluations show that iCAR significantly improves the network performance in terms of packet delivery ratio and end-to-end delay with a negligible cost of communication overhead.
TL;DR: This paper extends the well-known ad hoc on-demand distance vector (AODV) routing protocol to propose a new vehicular reliability model to facilitate the reliable routing in VANETs and demonstrates that A ODV-R outperforms significantly the AODV routing protocol in terms of better delivery ratio and less link failures while maintaining a reasonable routing control overhead.
Abstract: In intelligent transportation systems, the cooperation between vehicles and the road side units is essential to bring these systems to fruition. Vehicular ad hoc networks (VANETs) are a promising technology to enable the communications among vehicles on one hand and between vehicles and road side units on the other hand. However, it is a challenging task to develop a reliable routing algorithm for VANETs due to the high mobility and the frequent changes of the network topology. Communication links are highly vulnerable to disconnection in VANETs; hence, the routing reliability of these ever-changing networks needs to be paid special attention. In this paper, we propose a new vehicular reliability model to facilitate the reliable routing in VANETs. The link reliability is defined as the probability that a direct communication link between two vehicles will stay continuously available over a specified time period. Furthermore, the link reliability value is accurately calculated using the location, direction and velocity information of vehicles along the road. We extend the well-known ad hoc on-demand distance vector (AODV) routing protocol to propose our reliable routing protocol AODV-R. Simulation results demonstrate that AODV-R outperforms significantly the AODV routing protocol in terms of better delivery ratio and less link failures while maintaining a reasonable routing control overhead.
TL;DR: This paper proposes a novel cross-layer QoS-aware routing protocol on OLSR (CLQ-OLSR) to support real-time multimedia communication by efficiently exploiting multi-radio and multi-channel method and demonstrates that the network aggregate throughput can almost be improved by 300% compared with the single radio case.
04 Jul 2013
TL;DR: This paper first discusses the applications and unique characteristics of VANETs that distinguish them from MANETs, then surveys existing trust models in VANets, and suggests desired properties towards effective trust management in VIANETs.
Abstract: Vehicular Ad hoc NETwork (VANET) is an emerging paradigm in networking. It is a new form of Mobile Ad hoc NETwork (MANET). VANET enables vehicle to vehicle (V2V) communication with the goal of providing road safety and reduce traffic congestion. However, dishonest (malicious) peers (vehicles) in a VANET many send out false information to maximize their own utility. Now a day, VANET has been taken more attention of researchers and automotive industries due to life saving factor. In this paper, we first discuss the applications and unique characteristics of VANETs that distinguish them from MANETs. We also discuss about different attacks and security issues in VANET. We then survey existing trust models in VANETs, and point out their key issues. Based on these studies, we suggest desired properties towards effective trust management in VANETs.
10 Apr 2013
TL;DR: A comprehensive survey of security threats in MANET is presented, examining all routing threats that can target the operation of routing protocol, whether they belong to selfish behaviors or malicious attacks, as well as countermeasures against such attacks.
Abstract: Mobile Ad-hoc Mobile ad hoc networks (MANET) are collections of self-organizing mobile nodes with dynamic topologies and have no fixed infrastructure. Because of their dynamic ad hoc nature, in which unknown devices develop spontaneous interactions between themselves, these networks are particularly vulnerable to various security threats. In recent years considerable efforts have been made to design secure and robust routing protocol, and many security schemes have been proposed to tackle these security issues. In this paper, we present a comprehensive survey of security threats in MANET. In particular, we examine all routing threats that can target the operation of routing protocol, whether they belong to selfish behaviors or malicious attacks, as well as countermeasures against such attacks. In order to analyze the existent countermeasures in a structured manner we have classified them into three classes; solutions based on cryptography; intrusion detection systems; and trust management and reputation-based solutions.
[...]
TL;DR: This work proposes a proactive routing protocol, named MQ-Routing, aimed at maximizing the minimum node lifetime and at rapidly adapting to network topology changes, and expresses a fully proactive approach to assure the protocol usage and reactivity in mobile scenarios.
Abstract: Mobile-Ad-Hoc-Networks (MANETs) are self-configuring networks of mobile nodes, which communicate through wireless links. The main issues in MANETs include the mobility of the network nodes, the scarcity of computational, bandwidth and energy resources. Thus, MANET routing protocols should explicitly consider network changes and node changes into the algorithm design. MANETs are particularly suited to guarantee connectivity in disaster relief scenarios, which are often impaired by the absence of network infrastructures. Moreover, such scenarios entail strict requirements on the lifetime of the device batteries and on the reactivity to possibly frequent link failures. This work proposes a proactive routing protocol, named MQ-Routing, aimed at maximizing the minimum node lifetime and at rapidly adapting to network topology changes. The proposed protocol modifies the Q-Routing algorithm, developed via Reinforcement Learning (RL) techniques, by introducing: (i) new metrics, which account for the paths availability and the energy in the path nodes, and which are dynamically combined and adapted to the changing network topologies and resources; (ii) a fully proactive approach to assure the protocol usage and reactivity in mobile scenarios. Extensive simulations validate the effectiveness of the proposed protocol, through comparisons with both the standard Q-Routing and the Optimized Link State Routing (OLSR) protocols.
TL;DR: A fast automatic methodology to search for energy-efficient OLSR configurations by using a parallel evolutionary algorithm is introduced and demonstrates that significant improvements over the standard configuration can be attained in terms of power consumption.
Abstract: This work tackles the problem of reducing the power consumption of the OLSR routing protocol in vehicular networks. Nowadays, energy-aware and green communication protocols are important research topics, specially when deploying wireless mobile networks. This article introduces a fast automatic methodology to search for energy-efficient OLSR configurations by using a parallel evolutionary algorithm. The experimental analysis demonstrates that significant improvements over the standard configuration can be attained in terms of power consumption, with no noteworthy loss in the QoS.
TL;DR: This article presents a tutorial on methods (at the network layer), encountered in recent literature, for small and large scale routing protocols, and geocasting (broadcasting, data dissemination, and warning delivery) protocols.
Abstract: Intermittent connectivity, abrupt changes in network topology and low reception rate are the most important properties that distinguish VANET (vehicular ad hoc networks) from other types of ad hoc networks. To optimize reliability and time criticality metrics in data communication protocols for VANET, novel ideas are needed. In this article, we present a tutorial on methods (at the network layer), encountered in recent literature, for small and large scale routing protocols, and geocasting (broadcasting, data dissemination, and warning delivery) protocols.