Coherent, automatic address resolution for vehicular ad hoc networks

Published in: Int. J. of Ad Hoc and Ubiquitous Computing, 2017 Vol.25, No.3, pp.163 - 179. DOI: 10.1504/IJAHUC.2017.10001935The interest in vehicular communications has increased notably. In this paper, the use of the address resolution (AR) procedures is studied for vehicular ad hoc networks (VANETs). We analyse the poor performance of AR transactions in such networks and we present a new proposal called coherent, automatic address resolution (CAAR). Our approach inhibits the use of AR transactions and instead increases the usefulness of routing signalling to automatically match the IP and MAC addresses. Through extensive simulations in realistic VANET scenarios using the Estinet simulator, we compare our proposal CAAR to classical AR and to another of our proposals that enhances AR for mobile wireless networks, called AR+. In addition, we present a performance evaluation of the behaviour of CAAR, AR and AR+ with unicast traffic of a reporting service for VANETs. Results show that CAAR outperforms the other two solutions in terms of packet losses and furthermore, it does not introduce additional overhead.Postprint (published version

Cross-layer design of multi-hop wireless networks

MULTI -hop wireless networks are usually defined as a collection of nodes equipped with radio transmitters, which not only have the capability to communicate each other in a multi-hop fashion, but also to route each others’ data packets. The distributed nature of such networks makes them suitable for a variety of applications where there are no assumed reliable central entities, or controllers, and may significantly improve the scalability issues of conventional single-hop wireless networks. This Ph.D. dissertation mainly investigates two aspects of the research issues related to the efficient multi-hop wireless networks design, namely: (a) network protocols and (b) network management, both in cross-layer design paradigms to ensure the notion of service quality, such as quality of service (QoS) in wireless mesh networks (WMNs) for backhaul applications and quality of information (QoI) in wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of this Ph.D. dissertation, different network settings are used as illustrative examples, however the proposed algorithms, methodologies, protocols, and models are not restricted in the considered networks, but rather have wide applicability. First, this dissertation proposes a cross-layer design framework integrating a distributed proportional-fair scheduler and a QoS routing algorithm, while using WMNs as an illustrative example. The proposed approach has significant performance gain compared with other network protocols. Second, this dissertation proposes a generic admission control methodology for any packet network, wired and wireless, by modeling the network as a black box, and using a generic mathematical 0. Abstract 3 function and Taylor expansion to capture the admission impact. Third, this dissertation further enhances the previous designs by proposing a negotiation process, to bridge the applications’ service quality demands and the resource management, while using WSNs as an illustrative example. This approach allows the negotiation among different service classes and WSN resource allocations to reach the optimal operational status. Finally, the guarantees of the service quality are extended to the environment of multiple, disconnected, mobile subnetworks, where the question of how to maintain communications using dynamically controlled, unmanned data ferries is investigated

Light Load Path Selection Techniques for Control Congestion in MANET (ENBA)

The nodes have limited bandwidth and processing capability. The routing protocols cannot handle the congestion due to heavy load in mobile ad hoc networks. Several routes are established in the network, and some intermediate nodes are common. The dynamic behaviour of the network creates problems for strong link establishment. The routing protocol establishes the connection between the sender and receiver. The efficient routing approach uses the concept of load balancing to reduce packet loss in a network. The heavy load on the network affects the node’s buffer capacity and link capacity. The research proposed the Effective Network Behavior Analyze (ENBA) for route sections to control congestion in MANET. This paper’s effort is driven by the idea of considering several aspects of the routing design of Mobile Ad hoc Networks (MANETs) in a unified manner. ENBA is a routing strategy that uses the shortest path for routing and balances the load by managing incoming and outgoing packets on links and nodes. In this routing scheme, the shortest path measures the buffer capacity of the nodes with higher TTL values selected for sending the data packets in the network. The link capacity is based on the flow of packets in the network. Queue optimisation is a continuous optimisation in which we count the number of packets incoming and decide the link reliability in a dynamic network. The performance of ENBA is compared with the Ad hoc On-demand Multipath Distance Vector -Modified (AOMDV-M) routing protocol. The ENDA strategy outperforms the competition in terms of performance over a shorter period. In the proposed technique, performance matrices like PDR, overhead, and delay provide better results than the previous AOMDV-M routing approach