Raed A. Alsaqour

Vehicular communication ad hoc routing protocols: A survey

Abstract Vehicular communications are now the dominant mode of transferring information between automobiles. One of the most promising applications of vehicular communications is the vehicular ad hoc network (VANET), an approach to the intelligent transportation system (ITS). VANET is a subclass of the mobile ad hoc network, which does not depend on fixed infrastructure, in which the nodes are highly mobile. Therefore, the network topology changes rapidly. The design of routing protocols in VANETs is crucial in supporting the ITS. As a prerequisite to communication, the VANET routing protocols must establish an efficient route between network nodes. Furthermore, they should adjust efficiently to the quickly varying topology of moving vehicles. In this paper, we discuss the main characteristics and the research challenge of routing in VANETs, which may be considered in designing various routing protocols. We also created taxonomy of the current routing protocols for VANETs, and we surveyed and compared symbolized instances for all the classes of protocols. This organization and description present the advantages and weaknesses of the current protocols in this field, and paves the way for solutions to unaddressed problems.

Review: Vehicular communication ad hoc routing protocols: A survey

Abstract Vehicular communications are now the dominant mode of transferring information between automobiles. One of the most promising applications of vehicular communications is the vehicular ad hoc network (VANET), an approach to the intelligent transportation system (ITS). VANET is a subclass of the mobile ad hoc network, which does not depend on fixed infrastructure, in which the nodes are highly mobile. Therefore, the network topology changes rapidly. The design of routing protocols in VANETs is crucial in supporting the ITS. As a prerequisite to communication, the VANET routing protocols must establish an efficient route between network nodes. Furthermore, they should adjust efficiently to the quickly varying topology of moving vehicles. In this paper, we discuss the main characteristics and the research challenge of routing in VANETs, which may be considered in designing various routing protocols. We also created taxonomy of the current routing protocols for VANETs, and we surveyed and compared symbolized instances for all the classes of protocols. This organization and description present the advantages and weaknesses of the current protocols in this field, and paves the way for solutions to unaddressed problems.

A local intrusion detection routing security over MANET network

Mobile Adhoc Network (MANET) is a group of wireless nodes that are distributed without relying on any standing network infrastructure. MANET routing protocols were designed to accommodate the properties of a self-organized environment without protection against any inside or outside network attacks. In this paper, we propose a Local Intrusion Detection (LID) security routing mechanism to detect Black Hole Attack (BHA) over Ad hoc On Demand Distance Vector (AODV) MANET routing protocol. In LID security routing mechanism, the intrusion detection is performed locally using the previous node of the attacker node instead of performing the intrusion detection via the source node as in Source Intrusion Detection (SID) security routing mechanism. By performing LID security routing mechanism, the security mechanism overhead would be decreased. Simulation results using the GloMoSim simulator show that the improvement ratio of the throughput gained by LID security routing mechanism and overall improvement reduction in the end-to-end delay and routing overhead.

Dynamic packet beaconing for GPSR mobile ad hoc position-based routing protocol using fuzzy logic

Greedy perimeter stateless routing (GPSR) is a well-known position-based routing protocol in mobile ad hoc network (MANET). In GPSR, nodes use periodic beaconing (PB) strategy in broadcasting beacon packets to maintain up-to-date information on the geographical position of their neighbor nodes within their transmission boundary range. The nodes that receive beacon packets save all known neighbor nodes, along with their geographical position information, in their neighbor list to make effective routing decisions. Most recent studies on position-based routing protocols assume that the position information in the neighbor list of a node is accurate, although only a rough estimate of such position information is actually available to the node. Node mobility causes frequent network topology changes in MANETs. Thus, neighbor-to-neighbor relationships change frequently. Using the PB strategy leads to inaccurate node position information in the neighbor list of a node. In addition, it may cause the routing protocol to make suboptimal decisions and not route packets through the best-located neighbor within the transmission range of the node. This study presents an analysis of the influence of position information inaccuracy caused by network parameters such as beacon packet interval time (BPIT) and node moving speed (NMS) on the performance of GPSR position-based routing protocols. To overcome the effect of position information inaccuracy in the neighbor list of a node, we proposed a fuzzy logic dynamic beaconing (FLDB) strategy to improve the reliability of the neighbor list of a node by optimizing time between transmissions of beacon packets in position-based routing protocols. Optimization is based on the correlation between NMS, number of neighboring nodes (NoNNs) and BPIT using fuzzy logic control (FLC) mechanism. The simulation experiment shows the effectiveness of the FLC mechanism in improving overall performance of GPSR position-based routing protocol in terms of beacon packet control overhead, end-to-end delay, non-optimal hop, and false node position.

Cloud Computing Adoption Model for Universities to Increase ICT Proficiency

Universities around the world especially those in developing countries are faced with the problem of delivering the level of information and communications technology (ICT) needed to facilitate teaching, learning, research, and development activities ideal in a typical university, which is needed to meet educational needs in-line with advancement in technology and the growing dependence on IT. This is mainly due to the high cost involved in providing and maintaining the needed hardware and software. A technology such as cloud computing that delivers on demand provisioning of IT resources on a pay per use basis can be used to address this problem. Cloud computing promises better delivery of IT services as well as availability whenever and wherever needed at reduced costs with users paying only as much as they consume through the services of cloud service providers. The cloud technology reduces complexity while increasing speed and quality of IT services provided; however, despite these benefits the challenges that come with its adoption have left many sectors especially the higher education skeptical in committing to this technology. This article identifies the reasons for the slow rate of adoption of cloud computing at university level, discusses the challenges faced and proposes a cloud computing adoption model that contains strategic guidelines to overcome the major challenges identified and a roadmap for the successful adoption of cloud computing by universities. The model was tested in one of the universities and found to be both useful and appropriate for adopting cloud computing at university level.

Enhanced binary exponential backoff algorithm for fair channel access in the ieee 802.11 medium access control protocol

The medium access control protocol determines system throughput in wireless mobile ad hoc networks following the ieee 802.11 standard. Under this standard, asynchronous data transmissions have a defined distributed coordination function that allows stations to contend for channel usage in a distributed manner via the carrier sensing multiple access with collision avoidance protocol. In distributed coordination function, a slotted binary exponential backoff BEB algorithm resolves collisions of packets transmitted simultaneously by different stations. The BEB algorithm prevents packet collisions during simultaneous access by randomizing moments at stations attempting to access the wireless channels. However, this randomization does not eliminate packet collisions entirely, leading to reduced system throughput and increased packet delay and drop. In addition, the BEB algorithm results in unfair channel access among stations. In this paper, we propose an enhanced binary exponential backoff algorithm to improve channel access fairness by adjusting the manner of increasing or decreasing the contention window based on the number of the successfully sent frames. We propose several configurations and use the NS2 simulator to analyze network performance. The enhanced binary exponential backoff algorithm improves channel access fairness, significantly increases network throughput capacity, and reduces packet delay and drop. Copyright

A comparison of various vehicular ad hoc routing protocols based on communication environments

Despite the stern actions by governments, road accidents have become unavoidable throughout the world. Hence it is crucial to take care of the safety of drivers. It is where the Vehicular Ad-Hoc Network (VANET) comes in to the picture, it has paved way for the introduction of a lot of applications, based on the inter-vehicle based communications and infrastructure based communications, which safeguards the drivers and regulates the influx of traffic. However, in order to successfully employ the VANET, the following aspects are mandatory: consistent network procedures, safe means of communication, wireless network with acceptable range and above all support from drivers. Basically, the VANETs are employed in two distinctive communications backgrounds. The traffic condition is very simple in highways but in cities and towns it is very complex. Due to the obstruction caused by the buildings, trees and other obstacles in cities, it is not always possible to have a direct line of communications in the direction of projected data communication. This paper is aimed at studying the routing protocols based on the communication environments of VANET. This study also summarizes and compares the advancements of the VANET protocols.

Using dendritic cell algorithm to detect the resource consumption attack over MANET

Artificial Immune Systems (AISs) and Mobile Ad Hoc Networks (MANETs) are two up to date attractive technologies. AIS is utilized to introduce efficient intrusion detection algorithms to secure both host based and network based systems, whilst MANET is defined as a collection of mobile, decentralized, and self organized nodes. Securing MANET is a problem which adds more challenges on the research. This is because MANET properties make it harder to be secured than the other types of static networks. We claim that AIS properties as robust, self-healing, and self-organizing system can meet the challenges of securing MANET environment. This paper objective is to utilize the benefits of one of the Danger Theory based AIS intrusion detection algorithms, namely the Dendritic Cell Algorithm (DCA) to detect a type of Denial of Service (DoS) attack called Resource Consumption Attack (RCA) and also called sleep deprivation attack over MANET. The paper introduces a Mobile Dendritic Cell Algorithm (MDCA) architecture in which DCA plugged to be applied by each MANET node.

Energy Efficient Multipath Routing Protocol for Mobile Ad-Hoc Network Using the Fitness Function

Mobile ad hoc network (MANET) is a collection of wireless mobile nodes that dynamically form a temporary network without the reliance of any infrastructure or central administration. Energy consumption is considered as one of the major limitations in MANET, as the mobile nodes do not possess permanent power supply and have to rely on batteries, thus reducing network lifetime as batteries get exhausted very quickly as nodes move and change their positions rapidly across MANET. This paper highlights the energy consumption in MANET by applying the fitness function technique to optimize the energy consumption in ad hoc on demand multipath distance vector (AOMDV) routing protocol. The proposed protocol is called AOMDV with the fitness function (FF-AOMDV). The fitness function is used to find the optimal path from source node to destination node to reduce the energy consumption in multipath routing. The performance of the proposed FF-AOMDV protocol has been evaluated by using network simulator version 2, where the performance was compared with AOMDV and ad hoc on demand multipath routing with life maximization (AOMR-LM) protocols, the two most popular protocols proposed in this area. The comparison was evaluated based on energy consumption, throughput, packet delivery ratio, end-to-end delay, network lifetime and routing overhead ratio performance metrics, varying the node speed, packet size, and simulation time. The results clearly demonstrate that the proposed FF-AOMDV outperformed AOMDV and AOMR-LM under majority of the network performance metrics and parameters.

Reliable Buffering Management Algorithm Support for Multicast Protocol in Mobile Ad-hoc Networks

Multicasting is one of the relevant issues of communication in infrastructure or centralized administration networks. The reliable delivery of multicast data packets needs feedback from all multicast receivers to indicate whether a retransmission is necessary. A reliable multicast delivery in the wireless Ad-hoc network requires a multicast packet to be received by all multicast receiver nodes. Thus, one or all members need to buffer data packet for possible error recovery. Furthermore, different buffer strategies are essentially used in existing reliable multicast protocols towards support error recovery and reducing buffer overflow. This study proposed two algorithms to improve the performance of the source tree reliable multicast (STRM) protocol. The first algorithm was developed to avoid buffer overflow in the sender node as the forward server (FS) nodes of STRM. This reduction is achieved by managing the buffer of the FS nodes, i.e., selecting the FS nodes depending on its empty buffer size and reducing the feedback sent from the receiver nodes to their FS node. The second algorithm was developed to decrease duplicated packets in the multicast members of the local group, which may be achieved by sending the repair packets to the requesting member. The FS in the local group should create a dynamic and temporary subgroup whose members are only those that requested the repair packet retransmission. The algorithms were tested using detailed discrete event simulation models encompassing messaging systems including error, delay, and mobility models to characterize the performance benefits of the proposed algorithms compared with the existing wireless Ad-hoc network protocols. Several experiments were conducted, revealing numerous results that verify the superior performance of the proposed algorithms over the existing algorithms.