Context Of Mobile Ad-hoc Networks Research Articles

Enhancing MANET Performance: A Novel Approach Through Nature-Inspired Scheduling Algorithms

In the rapidly evolving landscape of Mobile Ad Hoc Networks (MANETs), the quest for optimal performance through efficient scheduling remains paramount. This paper, titled "Enhancing MANET Performance: A Novel Approach Through Nature-Inspired Scheduling Algorithms," introduces an innovative methodology that leverages the intricate mechanisms of nature to address the complex challenges inherent in MANET scheduling. Drawing inspiration from the adaptive behaviors observed in natural systems, we have developed a suite of nature-inspired algorithms—encompassing the genetic algorithm, particle swarm optimization, and ant colony optimization—tailored specifically to enhance the scheduling efficiency within the dynamic and decentralized context of MANETs.
 Our research undertakes a comprehensive evaluation of these algorithms against traditional scheduling methods, showcasing a notable improvement in key performance metrics such as network throughput, latency, and energy consumption. The novel contribution of this study lies in the adaptation and optimization of these bio-inspired algorithms for the unique demands of MANET scheduling, culminating in the development of a proprietary analytical model that significantly outperforms existing strategies. Through a rigorous comparative analysis, our results illuminate the superiority of our approach, demonstrating not only enhanced network efficiency but also improved scalability and reliability under varying conditions.
 The implications of this research extend beyond the immediate enhancements to MANET performance, proposing a paradigm shift in how scheduling challenges are approached within ad hoc networks. By bridging the gap between biological principles and technological applications, this study paves the way for future innovations in network management, offering a blueprint for the development of more adaptive, robust, and efficient networking solutions.

Securing a mobile ad hoc NETwork against the man in the middle attack

Mobile Ad hoc NETworks (MANET) are a special kind of wireless net- works where there is neither centralized authority nor pre-existing infrastructure. Hence, in such situation, authenticating nodes becomes a challenging task. This is even more true that some nodes may be tempted by spoofing other nodes identity in order to gain some rights and privileges. In such context, a protocol based on keys exchange such as Diffie-Hellman can be used. However, even such protocol is vulnerable to impersonation attack e.g. the Man in the Middle (MIM) attack. The main objective of this work is then, to evaluate the impact of a MIM attack on the context of MANET and to propose a security solution to such situation. This is done by (1) estimating the needed ratio of attackers to achieve a MIM attack in a given MANET and (2) proposing a security process based on the well known Diffie-Helman protocol.

Interference and SINR coverage in spatial non-slotted Aloha networks

In this paper we propose two analytically tractable stochastic-geometric models of interference in ad-hoc networks using pure (non-slotted) Aloha as the medium access. In contrast the slotted model, the interference in pure Aloha may vary during the transmission of a tagged packet. We develop closed form expressions for the Laplace transform of the empirical average of the interference experienced during the transmission of a typical packet. Both models assume a power-law path-loss function with arbitrarily distributed fading and feature configurations of transmitters randomly located in the Euclidean plane according to a Poisson point process. Depending on the model, these configurations vary over time or are static. We apply our analysis of the interference to study the Signal-to-Interference-and-Noise Ratio (SINR) outage probability for a typical transmission in pure Aloha. The results are used to compare the performance of non-slotted Aloha to the slotted one, which has almost exclusively been previously studied in the same context of mobile ad-hoc networks.

Leveraging Seminal Protocol Stacks to Support MANETs

In this paper, we investigate the suitability of some protocol stacks (mainly the UDP/IP model) that were firstly proposed for wired networks, to the mobile ad hoc networks (MANETs). These latter, are known to be dynamic as the topology is constantly changing, which affects the validity of the established routes as time tics farther from the start of every routing period. In the UDP/IP model for instance, the IP layer forecasts an IP packet as soon as it receives a data unit coming from the upper layer independently of when this packet will effectively be sent by the lower layer (i.e., the underlying MAC). As such, if a newly created packet using a routing decision relative to its instant of creation, is delayed at the lower layer for some reason, it will be sent using an out of date routing decision and then will wander through established invalid routes leading to poor performances. We first investigate the inherent functioning of such a model (firstly proposed for static networks) and exhibit its drawbacks in a MANETs context. Then, we propose practical enhancements to accommodate a proper behavior suitable to dynamic networks and that firstly provides a priority treatment to control traffc and secondly makes the routing decisions (fills up the IP next hop field) only when the MAC is ready to handle the packet. We conducted an extensive set of simulations to compare both implementations using different load and mobility scenarios and performance metrics but the same routing protocol (OLSR). These simulations show that our proposal solves the malfunctioning of current implementations, yet it allows a better behavior of the OLSR protocol and thus more accurate network performances.

A methodology for designing of intelligent services in ubiquitous communications

Mobile ad hoc networks (MANETs) are recognised as one of the key infrastructures in ambient intelligence (AmI) due to their promising ubiquitous connectivity. Key factors for reliable performance of service protocols in MANETs are the manner in which they adapt to route changes caused by mobility and communicating traffic patterns. Our main idea to support AmI ubiquitous communications is to use fuzzy C-mean clustering as data mining technique to extract knowledge and dependencies from high-level information of the application scenario. We use the resulting knowledge to predict the upcoming context and make MANETs services context-aware. Thus, a mobile node builds dynamic models determined by IF-THEN rules for its various environments and adapts its service protocols. We propose a methodology for storing and processing MANETs context, online fuzzy reasoning about it and improving the performance of underlying service protocols based on simple distributed, unobtrusive and handling different scenarios intelligent algorithm.

Discovering timely information in MANETs

Timely information refers to information whose ‘most recent’ or ‘latest’ instance is most valuable. In mobile ad hoc networks (MANETs), multiple instances of a piece of timely information may be produced by different nodes at different points in time. The problem is to discover the ‘latest’ instance among all existing instances. Within the context of MANETs, timely information discovery is fundamentally different from the existing resource/service discovery problem whose goal is to discover either any instance or a subset of instances which satisfy a local query constraint that can be specified and evaluated using only local attributes of each individual node. In contrast, the timely information discovery problem imposes the global (timeliness) constraint which should best be evaluated when all the instances are considered to determine the latest instance. The complication of discovering timely information arises from the existence of multiple instances of the information, which are produced at different points in time by different nodes in the network, and the need to collect all these instances to decide the latest instance. For MANETs, the lack of infrastructure supports, frequent topology changes, and potential packet loss in wireless communications further challenge the problem of timely information discovery. This paper describes a self-organizing, peer-to-peer based approach, termed ALADIN, to discovering timely information in MANETs. In ALADIN, nodes that produce instances of the timely information are peers who self-organize an adaptive and distributed ‘search infrastructure’ to facilitate the discovery of the latest instance. A simulation study shows that ALADIN is scalable without incurring network-wide flooding in the case of large-scale networks and popular timely information, and yields a high chance of discovering the latest instance in the presence of mobility.