Application Platforms, Routing Algorithms and Mobility Behavior in Mobile Disruption-Tolerant Networks

Mobile disruption-tolerant networks (DTNs), experience frequent and long duration partitions due to the low density of mobile nodes. In these networks, traditional networking models relying on end-to-end communication cease to work. The topological characteristics of mobile DTNs impose unique challenges for the design and validation of routing protocols and applications. We investigate challenges of mobile DTNs from three different viewpoints: the application layer, a routing perspective, and by studying mobility patterns. In the application layer, we have built 7DS (7th Degree of Separation) as a modular platform to develop mobile disruption-tolerant applications. 7DS offers a class of disruption-tolerant applications to exchange data with other mobile users in the mobile DTN or with the global Internet. In the routing layer, we have designed and implemented PEEP as an interest-aware and energy efficient routing protocol which automatically extracts individual interests of mobile users and estimates the global popularity of data items throughout the network. PEEP considers mobile users' interests and global popularity of data items in its routing decisions to route data toward the community of mobile users who are interested in that data content. Mobility of mobile users impacts the conditions in which routing protocols for mobile DTNs must operate and types of applications that could be provided for mobile networks in general. The current synthetic mobility models do not reflect real-world mobile users' behavior. Trace-based mobility models, also, are based on traces that either represent a specific population of mobile users or do not have enough granularities in representing mobility of mobile users for example cell tower traces. We use Sense Networks' GPS traces that are being collected by monitoring a broad spectrum of mobile users. Using these traces, we employ a Markovian approach to extract inherent patterns in human mobility. We design and implement a new routing algorithm for mobile DTNs based on our Markovian analysis of the human mobility. We explore how the knowledge of the mobility improves the performance of our Markov based routing algorithm. We show that that our Markov based routing algorithm increases the rate of data delivery to popular destinations with consuming less energy than legacy algorithms

An Effective Wireless Sensor Network Routing Protocol Based on Particle Swarm Optimization Algorithm

Improving wireless communication and artificial intelligence technologies by using Internet of Things (Itoh) paradigm has been contributed in developing a wide range of different applications. However, the exponential growth of smart phones and Internet of Things (IoT) devices in wireless sensor networks (WSNs) is becoming an emerging challenge that adds some limitations on Quality of Service (QoS) requirements. End-to-end latency, energy consumption, and packet loss during transmission are the main QoS requirements that could be affected by increasing the number of IoT applications connected through WSNs. To address these limitations, an effective routing protocol needs to be designed for boosting the performance of WSNs and QoS metrics. In this paper, an optimization approach using Particle Swarm Optimization (PSO) algorithm is proposed to develop a multipath protocol, called a Particle Swarm Optimization Routing Protocol (MPSORP). The MPSORP is used for WSN-based IoT applications with a large volume of traffic loads and unfairness in network flow. For evaluating the developed protocol, an experiment is conducted using NS-2 simulator with different configurations and parameters. Furthermore, the performance of MPSORP is compared with AODV and DSDV routing protocols. The experimental results of this comparison demonstrated that the proposed approach achieves several advantages such as saving energy, low end-to-end delay, high packet delivery ratio, high throughput, and low normalization load.publishedVersio

Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks

This book presents collective works published in the recent Special Issue (SI) entitled "Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks”. These works expose the readership to the latest solutions and techniques for MANETs and VANETs. They cover interesting topics such as power-aware optimization solutions for MANETs, data dissemination in VANETs, adaptive multi-hop broadcast schemes for VANETs, multi-metric routing protocols for VANETs, and incentive mechanisms to encourage the distribution of information in VANETs. The book demonstrates pioneering work in these fields, investigates novel solutions and methods, and discusses future trends in these field

A Survey on Multihop Ad Hoc Networks for Disaster Response Scenarios

Disastrous events are one of the most challenging applications of multihop ad hoc networks due to possible damages of existing telecommunication infrastructure.The deployed cellular communication infrastructure might be partially or completely destroyed after a natural disaster. Multihop ad hoc communication is an interesting alternative to deal with the lack of communications in disaster scenarios. They have evolved since their origin, leading to differentad hoc paradigms such as MANETs, VANETs, DTNs, or WSNs.This paper presents a survey on multihop ad hoc network paradigms for disaster scenarios.It highlights their applicability to important tasks in disaster relief operations. More specifically, the paper reviews the main work found in the literature, which employed ad hoc networks in disaster scenarios.In addition, it discusses the open challenges and the future research directions for each different ad hoc paradigm

Wireless social networks: a survey of recent advances, applications and challenges

With the ubiquitous use of smartphones and other connected pieces of equipment, the number of devices connected to the Internet is exponentially growing. This will test the efficiency of the envisioned 5G network architectures for data acquisition and its storage. It is a common observation that the communication between smart devices is typically influenced by their social relationship. This suggests that the theory of social networks can be leveraged to improve the quality of service for such communication links. In fact, the social networking concepts of centrality and community have been investigated for an efficient realization of novel wireless network architectures. This work provides a comprehensive introduction to social networks and reviews the recent literature on the application of social networks in wireless communications. The potential challenges in communication network design are also highlighted, for a successful implementation of social networking strategies. Finally, some future directions are discussed for the application of social networking strategies to emerging wireless technologies such as non-orthogonal multiple access and visible light communications

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

SNGF Selected Node Geographic Forwarding Routing Protocol for VANETs

This thesis presents a protocol for intervehicle communication for use in Vehicular Ad Hoc Networks (VANET). VANET is a natural extension of mobile ad hoc networks (MANET) in which the restrictions related to power and mobility are relaxed. The routing protocols used for MANETs are generally dependent on the state of the network. With changes in the network topology, routing messages are generated so that the states of the routers in the network are updated. In the case of VANETs, in which the level of node mobility is high, message-routing overhead has serious implications for the scalability and throughput of the routing protocol. This thesis introduces criteria that are recommended for use when protocols are designed for VANET applications and presents the Selected Node Geographic Forwarding (SNGF) protocol. The SNGF protocol implements controlled flooding in an efficient manner in order to reduce unnecessary communication overhead. The protocol has a destination discovery mechanism that allows it to initiate correspondence between nodes without reliance on static location services. The protocol avoids formation of clusters by using the concept of selective forwarding, thus providing the advantages of cluster based approaches without actually forming one itself. It effectively deals with blind flooding by introducing a comprehensive retransmission time delay in the nodes. This retransmission delay favors the nodes in the direction of the destination and prevents other nodes from retransmitting the same message. The SNGF protocol does not use routing tables, which require frequent updates in mobile networks, instead it relies on directing the messages to geographic locations which are forwarded by any available intermediary nodes. The protocol also provides techniques for handling network fragmentation which can be a frequent problem in vehicular networks. It is capable of delayed message transmission and multiple route discovery in the case of the non-availability of the shortest path to the destination. To evaluate the performance of the SNGF protocol, an extensive study of mobile networks was conducted using the NS2 simulator. The simulation results demonstrate the reachability of the protocol, its scalability advantages and its total independence from location services. The SNGF protocol allows each participating node to operate independently of other nodes in the network. Nodes in the network are able to communicate with other nodes without ever becoming dependent on intermediary nodes. This feature opens new possibility for individual node based application development in ad hoc networks. The traffic profiling is described as it would be observed by an independent node participating in VANET using the SNGF protocol. The node communicates with other nodes and collects relevant data through the discourse capability of SNGF. The data collected by the node is viewed as a snapshot in time of the traffic conditions down the road based upon which future traffic condition is predicted. Traffic profiling is investigated for different levels of VANET deployment. The simulation results show that the proposed method of traffic profiling in a VANET environment using the SNGF protocol is viable for even lower levels of deployment

A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs

In mobile ad hoc networks connectivity is always an issue of concern. Due to dynamism in the behavior of mobile nodes, efficiency shall be achieved only with the assumption of good network infrastructure. Presence of critical links results in deterioration which should be detected in advance to retain the prevailing communication setup. This paper discusses a short survey on the specialized algorithms and protocols related to energy efficient load balancing for critical link detection in the recent literature. This paper also suggests a machine learning based hybrid power-aware approach for handling critical nodes via load balancing

Self-organizing Network Optimization via Placement of Additional Nodes

Das Hauptforschungsgebiet des Graduiertenkollegs "International Graduate School on Mobile Communication" (GS Mobicom) der Technischen Universität Ilmenau ist die Kommunikation in Katastrophenszenarien. Wegen eines Desasters oder einer Katastrophe können die terrestrischen Elementen der Infrastruktur eines Kommunikationsnetzwerks beschädigt oder komplett zerstört werden. Dennoch spielen verfügbare Kommunikationsnetze eine sehr wichtige Rolle während der Rettungsmaßnahmen, besonders für die Koordinierung der Rettungstruppen und für die Kommunikation zwischen ihren Mitgliedern. Ein solcher Service kann durch ein mobiles Ad-Hoc-Netzwerk (MANET) zur Verfügung gestellt werden. Ein typisches Problem der MANETs ist Netzwerkpartitionierung, welche zur Isolation von verschiedenen Knotengruppen führt. Eine mögliche Lösung dieses Problems ist die Positionierung von zusätzlichen Knoten, welche die Verbindung zwischen den isolierten Partitionen wiederherstellen können. Hauptziele dieser Arbeit sind die Recherche und die Entwicklung von Algorithmen und Methoden zur Positionierung der zusätzlichen Knoten. Der Fokus der Recherche liegt auf Untersuchung der verteilten Algorithmen zur Bestimmung der Positionen für die zusätzlichen Knoten. Die verteilten Algorithmen benutzen nur die Information, welche in einer lokalen Umgebung eines Knotens verfügbar ist, und dadurch entsteht ein selbstorganisierendes System. Jedoch wird das gesamte Netzwerk hier vor allem innerhalb eines ganz speziellen Szenarios - Katastrophenszenario - betrachtet. In einer solchen Situation kann die Information über die Topologie des zu reparierenden Netzwerks im Voraus erfasst werden und soll, natürlich, für die Wiederherstellung mitbenutzt werden. Dank der eventuell verfügbaren zusätzlichen Information können die Positionen für die zusätzlichen Knoten genauer ermittelt werden. Die Arbeit umfasst eine Beschreibung, Implementierungsdetails und eine Evaluierung eines selbstorganisierendes Systems, welche die Netzwerkwiederherstellung in beiden Szenarien ermöglicht.The main research area of the International Graduate School on Mobile Communication (GS Mobicom) at Ilmenau University of Technology is communication in disaster scenarios. Due to a disaster or an accident, the network infrastructure can be damaged or even completely destroyed. However, available communication networks play a vital role during the rescue activities especially for the coordination of the rescue teams and for the communication between their members. Such a communication service can be provided by a Mobile Ad-Hoc Network (MANET). One of the typical problems of a MANET is network partitioning, when separate groups of nodes become isolated from each other. One possible solution for this problem is the placement of additional nodes in order to reconstruct the communication links between isolated network partitions. The primary goal of this work is the research and development of algorithms and methods for the placement of additional nodes. The focus of this research lies on the investigation of distributed algorithms for the placement of additional nodes, which use only the information from the nodes’ local environment and thus form a self-organizing system. However, during the usage specifics of the system in a disaster scenario, global information about the topology of the network to be recovered can be known or collected in advance. In this case, it is of course reasonable to use this information in order to calculate the placement positions more precisely. The work provides the description, the implementation details and the evaluation of a self-organizing system which is able to recover from network partitioning in both situations