Game theoretic approach in routing protocols for wireless mobile ad hoc networks

Mobile Ad hoc Networks (MANETs) are becoming popular as a means of providing communication among a group of people. Because of self-configuring and self-organizing characteristics, MANETs can be deployed quickly. There is no infrastructure defined in the network, therefore all of the participating nodes relay packets for other nodes and perform routing if necessary. Because of the limitations in wireless transmission range, communication links could be multi-hop. Routing protocol is the most important element of MANET. Routing protocols for MANET can broadly be classified as proactive routing protocol and reactive routing protocol. In proactive routing protocols like Destination Sequence Distance Vector (DSDV), mobile nodes periodically exchange routing information among themselves. Hence proactive routing protocols generate high overhead messages in the network. On the other hand, reactive routing protocols like Ad hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR) work on-demand. Hence reactive routing protocols generate fewer number of overhead messages in the network compared to proactive routing protocols. But reactive routing protocols use a global search mechanism called flooding during the route discovery process. By flooding mechanism a source node can discover multiple routes to a destination. Flooding generates a large number of overhead packets in the network and is the root cause of scaling problem of reactive routing protocols. Hierarchical Dynamic Source Routing (HDSR) protocol has been proposed in this dissertation to solve that scaling problem. The DSR protocol has been modified and optimized to implement HDSR protocol. HDSR protocol reduces the flooding problem of reactive routing protocols by introducing hierarchy among nodes. Two game theoretic models, Forwarding Dilemma Game (FDG) and Forwarding Game Routing Protocol (FGRP), is proposed to minimize the \u27flooding\u27 effect by restricting nodes that should participate in route discovery process based on their status. Both FDG and FGRP protocols reduce overhead packet and improve network performances in terms of delay packet delivery ratio and throughput. Both protocols were implemented in AODV and the resulting protocol outperformed AODV in our NS-2 simulations. A thorough connectivity analysis was also performed for FDG and FGRP to ensure that these protocols do not introduce disconnectivity. Surprisingly, both FDG and FGRP showed better connectivity compared to AODV in moderate to high node density networks

A neural network propagation model for LoRaWAN and critical analysis with real-world measurements

Among the many technologies competing for the Internet of Things (IoT), one of the most promising and fast-growing technologies in this landscape is the Low-Power Wide-Area Network (LPWAN). Coverage of LoRa, one of the main IoT LPWAN technologies, has previously been studied for outdoor environments. However, this article focuses on end-to-end propagation in an outdoor–indoor scenario. This article will investigate how the reported and documented outdoor metrics are interpreted for an indoor environment. Furthermore, to facilitate network planning and coverage prediction, a novel hybrid propagation estimation method has been developed and examined. This hybrid model is comprised of an artificial neural network (ANN) and an optimized Multi-Wall Model (MWM). Subsequently, real-world measurements were collected and compared against different propagation models. For benchmarking, log-distance and COST231 models were used due to their simplicity. It was observed and concluded that: (a) the propagation of the LoRa Wide-Area Network (LoRaWAN) is limited to a much shorter range in this investigated environment compared with outdoor reports; (b) log-distance and COST231 models do not yield an accurate estimate of propagation characteristics for outdoor–indoor scenarios; (c) this lack of accuracy can be addressed by adjusting the COST231 model, to account for the outdoor propagation; (d) a feedforward neural network combined with a COST231 model improves the accuracy of the predictions. This work demonstrates practical results and provides an insight into the LoRaWAN’s propagation in similar scenarios. This could facilitate network planning for outdoor–indoor environments

Sustainability and Community Networks

Community networks are IP-based computer networks that are operated by a community as a common good. In Europe, the most well-known community networks are Guifi in Catalonia, Freifunk in Berlin, Ninux in Italy, Funkfeuer in Vienna and the Athens Wireless Metropolitan Network in Greece. This paper deals with community networks as alternative forms of Internet access and alternative infrastructures and asks: What does sustainability and unsustainability mean in the context of community networks? What advantages do such networks have over conventional forms of Internet access and infrastructure provided by large telecommunications corporations? In addition what disadvantages do they face at the same time? This article provides a framework for thinking dialectically about the un/sustainability of community networks. It provides a framework of practical questions that can be asked when assessing power structures in the context of Internet infrastructures and access. It presents an overview of environmental, economic, political and cultural contradictions that community networks may face as well as a typology of questions that can be asked in order to identify such contradictions

Factors affecting the performance of ad hoc on-demand distance vector protocol in simulated mobile ad hoc network scenarios using Taguchi approach

The performance of ad hoc on demand vector (AODV) protocol is affected hugely by some common major factors. These factors are terrain, network size, node velocity, pause time, transmission range, traffic load, and packet rates. The main purpose of this study is to analyse the effects of those factors and some selected two-way interactions on the performance measure of drop rates and average end-to-end delay. Taguchi approach was used in this study. Initially, L16 orthogonal array was used to determine the effects of the seven main factors and eight others two-way interactions between selected factors. The final results revealed that terrain, network size, transmission range, and traffic load have significant effects on drop rates. On the other hand, we discovered that terrain, transmission range, traffic load and interaction between node velocity and pause time have significant effects on average end-to-end. Interaction plot for L16 singled out strong interaction between node velocity and pause time for the effect on average end-to-end delay. Furthermore, L8 orthogonal array was applied to analyse the seven main factors only since most of the interactions effects from L16 were largely insignificant to the response. The most influential factors affecting the drop rates (in descending order) were terrain, transmission range, pause time, network size, packet rates, node velocity, and traffic load. For average end-to-end delay, the most influential factors (in descending order) were transmission range, pause time, terrain, network size, traffic load, packet rates, and node velocity. ANOVA results for L8 shows that terrain and transmission range have significant effects on drop rates. For average end-to-end delay, terrain, pause time and transmission range have significant effects on the response

A framework and mathematical modeling for the vehicular delay tolerant network routing

Vehicular ad hoc networks (VANETs) are getting growing interest as they are expected to play crucial role in making safer, smarter, and more efficient transportation networks. Due to unique characteristics such as sparse topology and intermittent connectivity, Delay Tolerant Network (DTN) routing in VANET becomes an inherent choice and is challenging. However, most of the existing DTN protocols do not accurately discover potential neighbors and, hence, appropriate intermediate nodes for packet transmission. Moreover, these protocols cause unnecessary overhead due to excessive beacon messages. To cope with these challenges, this paper presents a novel framework and an Adaptive Geographical DTN Routing (AGDR) for vehicular DTNs. AGDR exploits node position, current direction, speed, and the predicted direction to carefully select an appropriate intermediate node. Direction indicator light is employed to accurately predict the vehicle future direction so that the forwarding node can relay packets to the desired destination. Simulation experiments confirm the performance supremacy of AGDR compared to contemporary schemes in terms of packet delivery ratio, overhead, and end-to-end delay. Simulation results demonstrate that AGDR improves the packet delivery ratio (5-7%), reduces the overhead (1-5%), and decreases the delay (up to 0.02 ms). Therefore, AGDR improves route stability by reducing the frequency of route failures. © 2016 Mostofa Kamal Nasir et al

Improvement and Performance Evaluation for Multimedia Files Transmission in Vehicle-Based DTNs

In recent years, P2P file sharing has been widely embraced and becomes the largest application of the Internet traffic. And the development of automobile industry has promoted a trend of deploying Peer-to-Peer (P2P) networks over vehicle ad hoc networks (VANETs) for mobile content distribution. Due to the high mobility of nodes, nodes’ limited radio transmission range and sparse distribution, VANETs are divided and links are interrupted intermittently. At this moment, VANETs may become Vehicle-based Delay Tolerant Network (VDTNs). Therefore, this work proposes an Optimal Fragmentation-based Multimedia Transmission scheme (OFMT) based on P2P lookup protocol in VDTNs, which can enable multimedia files to be sent to the receiver fast and reliably in wireless mobile P2P networks over VDTNs. In addition, a method of calculating the most suitable size of the fragment is provided, which is tested and verified in the simulation. And we also show that OFMT can defend a certain degree of DoS attack and senders can freely join and leave the wireless mobile P2P network. Simulation results demonstrate that the proposed scheme can significantly improve the performance of the file delivery rate and shorten the file delivery delay compared with the existing schemes

TCP Performance in Mobile Ad hoc Networks

In this paper, we present a survey of TCP (Transmission Control Protocol) protocol for better performance in the MANET (Mobile Ad Hoc Network). After a short presentation of the main features of TCP, we give the most important problems from which TCP suffer in MANET. We present after that some approaches proposed in the literature in order to improve its performance. Our paper contains also a performance evaluation of TCP NewReno and TCP Vegas transport protocols under AODV and DSR routing protocols. The simulations are conducted under varying conditions of number of TCP connections, number of nodes and mobility.Hamrioui, S.; Lloret, J.; Lorenz, P.; Lalam, M. (2013). TCP Performance in Mobile Ad hoc Networks. Network Protocols and Algorithms. 5(4):117-142. doi:10.5296/npa.v5i4.4773S1171425

Improvement and Performance Evaluation for Multimedia Files Transmission in Vehicle-Based DTNs

In recent years, P2P file sharing has been widely embraced and becomes the largest application of the Internet traffic. And thedevelopment of automobile industry has promoted a trend of deploying Peer-to-Peer (P2P) networks over vehicle ad hoc networks(VANETs) for mobile content distribution. Due to the high mobility of nodes, nodes’ limited radio transmission range and sparsedistribution, VANETs are divided and links are interrupted intermittently. At this moment, VANETs may become Vehicle-basedDelay Tolerant Network (VDTNs). Therefore, this work proposes an Optimal Fragmentation-based Multimedia Transmissionscheme (OFMT) based on P2P lookup protocol in VDTNs, which can enable multimedia files to be sent to the receiver fast andreliably in wireless mobile P2P networks over VDTNs. In addition, a method of calculating the most suitable size of the fragmentis provided, which is tested and verified in the simulation. And we also show that OFMT can defend a certain degree of DoS attackand senders can freely join and leave the wireless mobile P2P network. Simulation results demonstrate that the proposed schemecan significantly improve the performance of the file delivery rate and shorten the file delivery delay compared with the existingschemes

Social internet of vehicles for smart cities

Open Access journa

Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks