Quantifying Link Stability in Ad Hoc Wireless Networks Subject to Ornstein-Uhlenbeck Mobility

The performance of mobile ad hoc networks in general and that of the routing algorithm, in particular, can be heavily affected by the intrinsic dynamic nature of the underlying topology. In this paper, we build a new analytical/numerical framework that characterizes nodes' mobility and the evolution of links between them. This formulation is based on a stationary Markov chain representation of link connectivity. The existence of a link between two nodes depends on their distance, which is governed by the mobility model. In our analysis, nodes move randomly according to an Ornstein-Uhlenbeck process using one tuning parameter to obtain different levels of randomness in the mobility pattern. Finally, we propose an entropy-rate-based metric that quantifies link uncertainty and evaluates its stability. Numerical results show that the proposed approach can accurately reflect the random mobility in the network and fully captures the link dynamics. It may thus be considered a valuable performance metric for the evaluation of the link stability and connectivity in these networks.Comment: 6 pages, 4 figures, Submitted to IEEE International Conference on Communications 201

Information Leakage Games

We consider a game-theoretic setting to model the interplay between attacker and defender in the context of information flow, and to reason about their optimal strategies. In contrast with standard game theory, in our games the utility of a mixed strategy is a convex function of the distribution on the defender's pure actions, rather than the expected value of their utilities. Nevertheless, the important properties of game theory, notably the existence of a Nash equilibrium, still hold for our (zero-sum) leakage games, and we provide algorithms to compute the corresponding optimal strategies. As typical in (simultaneous) game theory, the optimal strategy is usually mixed, i.e., probabilistic, for both the attacker and the defender. From the point of view of information flow, this was to be expected in the case of the defender, since it is well known that randomization at the level of the system design may help to reduce information leaks. Regarding the attacker, however, this seems the first work (w.r.t. the literature in information flow) proving formally that in certain cases the optimal attack strategy is necessarily probabilistic

Enhanced dynamic source routing for verifying trust in mobile ad hoc network for secure routing

Secure data transfer in mobile ad hoc network (MANET) against malicious attacks is of immense importance. In this paper, we propose a new enhanced trust model for securing the MANET using trust-based scheme that uses both blind trust and referential trust. In order to do this, the trust relationship function has to be integrated with the dynamic source routing (DSR) protocol for making the protocol more secure. We thoroughly analyze the DSR protocol and generate the performance matrices for the data pertaining to packets sent, packets received, packets loss, and throughput. We also analyze the outcome attained from the improvised trust establishment scheme by using the three algorithm implementations in NS2 simulator for detecting and preventing various types of attacks

Biometric Based Intrusion Detection System using Dempster-Shafer Theory for Mobile Ad hoc Network Security

In wireless mobile ad hoc network, mainly, two approaches are followed to protect the security such as prevention-based approaches and detection-based approaches. A Mobile Ad hoc Network (MANET) is a collection of autonomous wireless mobile nodes forming temporary network to interchange data (data packets) without using any fixed topology or centralized administration. In this dynamic network, each node changes its geographical position and acts as a router for forwarding packets to the other node. Current MANETs are basically vulnerable to different types of attacks. The multimodal biometric technology gives possible resolves for continuous user authentication and vulnerability in high security mobile ad hoc networks (MANETs). Dempster’s rule for combination gives a numerical method for combining multiple pieces of data from unreliable observers. This paper studies biometric authentication and intrusion detection system with data fusion using Dempster–Shafer theory in such MANETs. Multimodal biometric technologies are arrayed to work with intrusion detection to improve the limitations of unimodal biometric technique

Overview of Hybrid MANET-DTN Networking and its Potential for Emergency Response Operations

Communication networks for emergency response operations have to operate in harsh environments. As fixed infrastructures may be unavailable (e.g., they are destroyed or overloaded), mobile ad-hoc networks (MANETs) are a promising solution to establish communication for emergency response operations. However, networks for emergency responses may provide diverse connectivity characteristics which imposes some challenges, especially on routing. Routing protocols need to take transmission errors, node failures and even the partitioning of the network into account. Thus, there is a need for routing algorithms that provide mechanisms from Delay or Disruption Tolerant Networking (DTN) in order to cope with network disruptions but at the same time are as efficient as MANET routing schemes in order to preserve network resources. This paper reviews several hybrid MANET-DTN routing schemes that can be found in the literature. Additionally, the paper evaluates a realistic emergency response scenario and shows that MANET-DTN routing schemes have the potential to improve network performance as the resulting network is diverse in terms of connectivity. In particular, the network provides well-connected regions whereas other parts are only intermittently connected

Systems Methodology and Framework for Problem Definition in Mobile Ad Hoc Networks

Mobile Ad Hoc Networks are communication networks built up of a collection of mobile devices which can communicate through wireless connections. Mobile Ad Hoc Networks have many challenges such as routing, which is the task of directing data packets from a source node to a given destination. This task is particularly hard in Mobile Ad Hoc Networks: due to the mobility of the network elements and the lack of central control, robustness and adaptability in routing algorithms and work in a decentralized and self organizing way. Through the principles of systems architecting and Engineering; the problem statement in Mobile Ad Hoc Networks could be defined more specifically and accurately. The uncertainties and techniques for mitigating and even taking positive advantages of them can be achieved through a framework of uncertainties as in [1]. The systems methodology framework called Total Systems Intervention (TSI) described by Flood and Jackson [2] select a systems methodology for Mobile Ad Hoc Networks. The purpose of this paper is to show how TSI when integrated with a framework created to understand the risks and opportunities can help develop strategies to minimize the risks and to take advantage of the opportunities for facing challenges in Mobile Ad Hoc Networks

Usage of Network Simulators in Machine-Learning-Assisted 5G/6G Networks

Without any doubt, Machine Learning (ML) will be an important driver of future communications due to its foreseen performance when applied to complex problems. However, the application of ML to networking systems raises concerns among network operators and other stakeholders, especially regarding trustworthiness and reliability. In this paper, we devise the role of network simulators for bridging the gap between ML and communications systems. In particular, we present an architectural integration of simulators in ML-aware networks for training, testing, and validating ML models before being applied to the operative network. Moreover, we provide insights on the main challenges resulting from this integration, and then give hints discussing how they can be overcome. Finally, we illustrate the integration of network simulators into ML-assisted communications through a proof-of-concept testbed implementation of a residential Wi-Fi network

On the Distribution of Random Geometric Graphs

Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random topology, properties (e.g., connectedness), or Shannon entropy as a measure of the graph's topological uncertainty (or information content). Moreover, the distribution is also relevant for determining average network performance or designing protocols. However, a major impediment in deducing the graph distribution is that it requires the joint probability distribution of the $n(n-1)/2$ distances between $n$ nodes randomly distributed in a bounded domain. As no such result exists in the literature, we make progress by obtaining the joint distribution of the distances between three nodes confined in a disk in $\mathbb{R}^2$. This enables the calculation of the probability distribution and entropy of a three-node graph. For arbitrary $n$, we derive a series of upper bounds on the graph entropy; in particular, the bound involving the entropy of a three-node graph is tighter than the existing bound which assumes distances are independent. Finally, we provide numerical results on graph connectedness and the tightness of the derived entropy bounds.Comment: submitted to the IEEE International Symposium on Information Theory 201