Resilient Misbehaviour Detection MAC Protocol (MD-MAC) for Distributed Wireless Networks

Chaminda Alocious, Hannan Xiao, B. Christianson, 'Resilient Misbehaviour Detection MAC Protocol (MD-MAC) for Distributed Wireless Networks' paper presented at the 2016 IEEE Wireless Communications and Networking Conference (IEEE WCNC). Doha, Qatar. 3-6 April 2016Wireless network security requirements are becoming more important and critical. The modern network security architectures require more attention to provide security in each network layer. This will require understanding of protocol vulnerabilities in existing protocol architectures. However, providing security requirements are not just limited to confidentiality and integrity, also availability and fairness are important security elements. IEEE 802.11 MAC protocol is one of the most common standard in modern day networks and has been designed without a consideration for providing security protection at MAC layer. IEEE 802.11 assumes all the nodes in the network are cooperative. However, nodes may purposefully misbehave in order to obtain extra bandwidth, conserve resources and disrupt network performance. This research proposes a Misbehaviour Detection MAC protocol (MD-MAC) to address the problematic scenarios of MAC layer misbehaviours, which takes a novel approach to detect misbehaviours in Mobile Adhoc Networks (MANETs). The MD-MAC modifies the CSMA/CA protocol message exchange and uses verifiable backoff value generation mechanism with an incorporated trust model which is suitable for distributed networks. The MD-MAC protocol has been implemented and evaluated in ns2, simulation results suggest that the protocol is able to detect misbehaving wireless nodes in a distributed network environment

Backoff as Performance improvements Algorithms - A Comprehenssive Review

As a significant part of the Media Access Control protocol, the backoff algorithm purpose is to minimize number of collisions if not totally avoid any collision in Mobile Ad Hoc Networks, in the case of contention between nodes to access a channel. Researchers have proposed many algorithms for backoff to enhance the network performance and improve it. This paper aims at exploring the main and most studied backoff algorithms and how do these algorithms lead to an enhancement of the MANETs performance. This paper also compares between the algorithms proposed in the literature and evaluates to what extent they have affected the performance and enhance it

On backoff mechanisms for wireless Mobile Ad Hoc Networks

Since their emergence within the past decade, which has seen wireless networks being adapted to enable mobility, wireless networks have become increasingly popular in the world of computer research. A Mobile Ad hoc Network (MANET) is a collection of mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure. MANETs have received significant attention in recent years due to their easiness to setup and to their potential applications in many domains. Such networks can be useful in situations where there is not enough time or resource to configure a wired network. Ad hoc networks are also used in military operations where the units are randomly mobile and a central unit cannot be used for synchronization. The shared media used by wireless networks, grant exclusive rights for a node to transmit a packet. Access to this media is controlled by the Media Access Control (MAC) protocol. The Backoff mechanism is a basic part of a MAC protocol. Since only one transmitting node uses the channel at any given time, the MAC protocol must suspend other nodes while the media is busy. In order to decide the length of node suspension, a backoff mechanism is installed in the MAC protocol. The choice of backoff mechanism should consider generating backoff timers which allow adequate time for current transmissions to finish and, at the same time, avoid unneeded idle time that leads to redundant delay in the network. Moreover, the backoff mechanism used should decide the suitable action to be taken in case of repeated failures of a node to attain the media. Further, the mechanism decides the action needed after a successful transmission since this action affects the next time backoff is needed. The Binary exponential Backoff (BEB) is the backoff mechanisms that MANETs have adopted from Ethernet. Similar to Ethernet, MANETs use a shared media. Therefore, the standard MAC protocol used for MANETs uses the standard BEB backoff algorithms. The first part of this work, presented as Chapter 3 of this thesis, studies the effects of changing the backoff behaviour upon a transmission failure or after a successful transmission. The investigation has revealed that using different behaviours directly affects both network throughput and average packet delay. This result indicates that BEB is not the optimal backoff mechanism for MANETs. Up until this research started, no research activity has focused on studying the major parameters of MANETs. These parameters are the speed at which nodes travel inside the network area, the number of nodes in the network and the data size generated per second. These are referred to as mobility speed, network size and traffic load respectively. The investigation has reported that changes made to these parameters values have a major effect on network performance. Existing research on backoff algorithms for MANETs mainly focuses on using external information, as opposed to information available from within the node, to decide the length of backoff timers. Such information includes network traffic load, transmission failures of other nodes and the total number of nodes in the network. In a mobile network, acquiring such information is not feasible at all times. To address this point, the second part of this thesis proposes new backoff algorithms to use with MANETs. These algorithms use internal information only to make their decisions. This part has revealed that it is possible to achieve higher network throughput and less average packet delay under different values of the parameters mentioned above without the use of any external information. This work proposes two new backoff algorithms. The Optimistic Linear-Exponential Backoff, (OLEB), and the Pessimistic Linear-Exponential Backoff (PLEB). In OLEB, the exponential backoff is combined with linear increment behaviour in order to reduce redundant long backoff times, during which the media is available and the node is still on backoff status, by implementing less dramatic increments in the early backoff stages. PLEB is also a combination of exponential and linear increment behaviours. However, the order in which linear and exponential behaviours are used is the reverse of that in OLEB. The two algorithms have been compared with existing work. Results of this research report that PLEB achieves higher network throughput for large numbers of nodes (e.g. 50 nodes and over). Moreover, PLEB achieves higher network throughput with low mobility speed. As for average packet delay, PLEB significantly improves average packet delay for large network sizes especially when combined with high traffic rate and mobility speed. On the other hand, the measurements of network throughput have revealed that for small networks of 10 nodes, OLEB has higher throughput than existing work at high traffic rates. For a medium network size of 50 nodes, OLEB also achieves higher throughput. Finally, at a large network size of 100 nodes, OLEB reaches higher throughput at low mobility speed. Moreover, OLEB produces lower average packet delay than the existing algorithms at low mobility speed for a network size of 50 nodes. Finally, this work has studied the effect of choosing the behaviour changing point between linear and exponential increments in OLEB and PLEB. Results have shown that increasing the number of times in which the linear increment is used increases network throughput. Moreover, using larger linear increments increase network throughput

A Media Access Control Protocol for Wireless Adhoc Networks with Misbehaviour Avoidance

The most common wireless Medium Access Control (MAC) protocol is IEEE 802.11. Currently IEEE 802.11 standard protocol is not resilient for many identified MAC layer attacks, because the protocol is designed without intention for providing security and with the assumption that all the nodes in the wireless network adhere to the protocol. However, nodes may purposefully show misbehaviours at the MAC layer in order to obtain extra bandwidth con-serve resources and degrade or disrupt the network performance. This research proposes a secure MAC protocol for MAC layer which has integrated with a novel misbehaviour detection and avoidance mechanism for Mobile Ad Hoc Networks (MANETs). The proposed secure MAC protocol the sender and receiver work collaboratively together to handshakes prior to deciding the back-off values. Common neighbours of the sender and receiver contributes effectively to misbehaviours detection and avoidance process at MAC layer. In addition the proposed solution introduces a new trust distribution model in the network by assuming none of the wireless nodes need to trust each other. The secure MAC protocol also assumes that misbehaving nodes have significant levels of intelligence to avoid the detectio

Available Bandwidth Estimation for Adaptive Video Streaming in Mobile Ad Hoc

[EN] We propose in this paper an algorithm for available bandwidth estimation in mobile ad hoc networks and its integration into a conventional routing protocol like AODV for improving the rate-adaptive video streaming. We have introduced in our approach a local estimation of the available bandwidth as well as a prediction of the consumed bandwidth. This information allows video application to adjust its transmission rate avoiding network congestion. We conducted a performance evaluation of our solution through simulation experiments using two network scenarios. In the simulation study, transmission of video streams encoded with the H.264/MPEG-4 advanced video coding standard was evaluated. The results reveal performance improvements in terms of packet loss, delay and PSNR.Castellanos, W.; Guerri Cebollada, JC.; Arce Vila, P. (2019). Available Bandwidth Estimation for Adaptive Video Streaming in Mobile Ad Hoc. International Journal of Wireless Information Networks. 26(3):218-229. https://doi.org/10.1007/s10776-019-00431-0S21822926

Modelling and performance analysis of mobile ad hoc networks

PhD ThesisMobile Ad hoc Networks (MANETs) are becoming very attractive and useful in many kinds of communication and networking applications. This is due to their efficiency, relatively low cost, and flexibility provided by their dynamic infrastructure. Performance evaluation of mobile ad hoc networks is needed to compare various architectures of the network for their performance, study the effect of varying certain network parameters and study the interaction between various parameters that characterise the network. It can help in the design and implementation of MANETs. It is to be noted that most of the research that studies the performance of MANETs were evaluated using discrete event simulation (DES) utilising a broad band of network simulators. The principle drawback of DES models is the time and resources needed to run such models for large realistic systems, especially when results with a high accuracy are desired. In addition, studying typical problems such as the deadlock and concurrency in MANETs using DES is hard because network simulators implement the network at a low abstraction level and cannot support specifications at higher levels. Due to the advantage of quick construction and numerical analysis, analytical modelling techniques, such as stochastic Petri nets and process algebra, have been used for performance analysis of communication systems. In addition, analytical modelling is a less costly and more efficient method. It generally provides the best insight into the effects of various parameters and their interactions. Hence, analytical modelling is the method of choice for a fast and cost effective evaluation of mobile ad hoc networks. To the best of our knowledge, there is no analytical study that analyses the performance of multi-hop ad hoc networks, where mobile nodes move according to a random mobility model, in terms of the end-to-end delay and throughput. This work ii presents a novel analytical framework developed using stochastic reward nets and mathematical modelling techniques for modelling and analysis of multi-hop ad hoc networks, based on the IEEE 802.11 DCF MAC protocol, where mobile nodes move according to the random waypoint mobility model. The proposed framework is used to analysis the performance of multi-hop ad hoc networks as a function of network parameters such as the transmission range, carrier sensing range, interference range, number of nodes, network area size, packet size, and packet generation rate. The proposed framework is organized into several models to break up the complexity of modelling the complete network and make it easier to analyse each model as required. This is based on the idea of decomposition and fixed point iteration of stochastic reward nets. The proposed framework consists of a mathematical model and four stochastic reward nets models; the path analysis model, data link layer model, network layer model and transport layer model. These models are arranged in a way similar to the layers of the OSI protocol stack model. The mathematical model is used to compute the expected number of hops between any source-destination pair; and the average number of carrier sensing, hidden, and interfering nodes. The path analysis model analyses the dynamic of paths in the network due to the node mobility in terms of the path connection availability and rate of failure and repair. The data link layer model describes the behaviour of the IEEE 802.11 DCF MAC protocol. The actions in the network layer are modelled by the network layer model. The transport layer model represents the behaviour of the transport layer protocols. The proposed models are validated using extensive simulations

Position-based routing and MAC protocols for wireless ad-hoc networks

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This thesis presents the Forecasting Routing Technique (FORTEL), a routing protocol for Mobile Ad-Hoc Networks (MANETs) based on the nodes’ Location Information. FORTEL stores the nodes’ location information in the Location Table (LT) in order to construct routes between the source and the destination nodes. FORTEL follows the source routing strategy, which has rarely been applied in position-based routing. According to the source routing strategy, the end-to-end route is attached to the packet, therefore, the processing cost, in regards to the intermediate nodes that simply relay the packet according to route, is minimized. FORTEL’s key mechanisms include: first, the location update scheme, employed to keep the LT entries up-to-date with the network topology. Besides the mobility variation and the constant rate location update schemes applied, a window location update scheme is presented to increase the LT’s information accuracy. Second, the switching mechanism, between “Hello” message and location update employed, to reduce the protocol’s routing overhead. Third and most important is the route computation mechanism, which is integrated with a topology forecasting technique to construct up-to-date routes between the communication peers, aiming to achieve high delivery rate and increase the protocol robustness against the nodes’ movement. FORTEL demonstrates higher performance as compared to other MANET’s routing protocols, and it delivers up to 20% more packets than AODV and up to 60 % more than DSR and OLSR, while maintaining low levels of routing overhead and network delay at the same time. The effectiveness of the window update scheme is also discussed, and it proves to increase FORTEL’s delivery rate by up to 30% as compared to the other update schemes. A common and frequently occurring phenomenon, in wireless networks, is the Hidden Terminal problem that significantly impacts the communication performance and the efficiency of the routing and MAC protocols. Beaconless routing approach in MANETs, which delivers data packets without prior knowledge of any sort `of information, suffers from packet duplication caused by the hidden nodes during the contention process. Moreover, the throughput of the IEEE MAC protocol decreases dramatically when the hidden terminal problem occurs. RTS/CTS mechanism fails to eliminate the problem and can further degrade the network’s performance by introducing additional overhead. To tackle these challenges, this thesis presents two techniques, the Sender Suppression Algorithm and the Location-Aided MAC, where both rely on the nodes’ position to eliminate packet duplication in the beaconless routing and improve the performance of the 802.11 MAC respectively. Both schemes are based on the concept of grouping the nodes into zones and assign different time delay to each one. According to the Sender Suppression Algorithm, the sender’s forwarding area is divided into three zones, therefore, the local timer, set to define the time that the receiver has to wait before responding to the sender’s transmission, is added to the assigned zone delay. Following the first response, the sender interferes and suppresses the receivers with active timer of. On the other hand, the Location-Aided MAC, essentially a hybrid MAC, combines the concepts of time division and carrier sensing. The radio range of the wireless receiver is partitioned into four zones with different zone delays assigned to each zone. Channel access within the zone is purely controlled by CSMA/CA protocol, while it is time-based amongst zones. The effectiveness of the proposed techniques is demonstrated through simulation tests. Location-Aided MAC considerably improves the network’s throughput compared to CSMA/CA and RTS/CTS. However, remarkable results come when the proposed technique and the RTS/CTS are combined, which achieves up to 20% more throughput as compared to the standalone RTS/CTS. Finally, the thesis presents a novel link lifetime estimation method for greedy forwarding to compute the link duration between two nodes. Based on a newly introduced Stability-Aware Greedy (SAG) scheme, the proposed method incorporates the destination node in the computation process and thus has a significant advantage over the conventional method, which only considers the information of the nodes composing the link

Internet Access and QoS in Ad Hoc Networks

It is likely that the increased popularity of wireless local area networks (WLANs) together with the continuous technological advances in wireless communication, also increase the interest for ad hoc networks. An ad hoc network is a wireless, autonomous, infrastructure-less network composed of stations that communicate with each other directly in a peer-to-peer fashion. When discussing mobile ad hoc networks (MANETs), we often refer to an ad hoc network where the stations cooperate in forwarding packets on behalf of each other to allow communication beyond their transmission range over multi-hop paths. In order to realize the practical benefits of ad hoc networks, two challenges (among others) need to be considered: distributed quality of service (QoS) guarantees and multi-hop Internet access. This thesis presents conceivable solutions to both of these problems. The first two papers focus on the network layer and consider the provisioning of Internet access to ad hoc networks whereas the last two papers focus on the data link layer and investigate the provisioning of QoS to ad hoc networks. The first paper studies the interconnection between a MANET and the Internet. In addition, it evaluates three approaches for gateway discovery, which can be initiated by the gateway (proactive method), by the mobile station (reactive method) or by mixing these two approaches (hybrid method). The second paper also studies Internet access for MANETs, but with focus on micro mobility, i.e. mobile stations moving from one gateway to another. In particular, it evaluates a solution that allows mobile stations to access the Internet and roam from gateway to gateway. The third paper, gives an overview of the medium access mechanisms in IEEE 802.11 and their QoS limitations. Moreover, it proposes an enhancement to the contention-free medium access mechanism of IEEE 802.11e to provide QoS guarantees in WLANs operating in ad hoc network configuration. The fourth paper continues the work from the third paper by enhancing the scheme and dealing with the problems that occur due to hidden stations. Furthermore, it discusses how to deal with the problems that occur when moving from single-hop ad hoc networks (i.e. WLANs in ad hoc network configuration) to multi-hop ad hoc networks

Cross-layer signalling and middleware: a survey for inelastic soft real-time applications in MANETs

This paper provides a review of the different cross-layer design and protocol tuning approaches that may be used to meet a growing need to support inelastic soft real-time streams in MANETs. These streams are characterised by critical timing and throughput requirements and low packet loss tolerance levels. Many cross-layer approaches exist either for provision of QoS to soft real-time streams in static wireless networks or to improve the performance of real and non-real-time transmissions in MANETs. The common ground and lessons learned from these approaches, with a view to the potential provision of much needed support to real-time applications in MANETs, is therefore discussed