Ad-hoc networks are specifically designed to facilitate communication in environments where establishing a dedicated network infrastructure is exceedingly complex or impractical. The integration of clustering concepts into various ad-hoc network scenarios, including Wireless Sensor Networks (WSN), Mobile Ad-hoc Networks (MANET), Vehicular Ad-hoc Networks (VANET), Delay-Tolerant Networks (DTN), Wireless Ad-hoc Networks (WANET), Underwater Wireless Sensor Networks (UWSN), Unmanned Aerial Vehicle Networks (UAV), commonly known as "drones," Space Networks (SN), and Satellite Networks (TN), presents abundant opportunities for refining strategies in event tracking and area monitoring across both deterministic and uncertain environments. This paper conducts a comparative analysis of diverse proposed strategies leveraging clustering concepts to address coverage challenges within deterministic and uncertain environments. As a result, it addresses current and future challenges inherent in clustering-based WANET, elucidating the merits, shortcomings, and weaknesses of clustering models. Lastly, it identifies potential avenues for addressing coverage issues in existing and emerging technologies.
Fast data synchronization in wireless ad hoc networks is a challenging and critical problem. It is fundamental for efficient information fusion, control and decision in distributed systems. Previously, distributed data synchronization was mainly studied in the latency-tolerant distributed databases, or assuming the general model of wireless ad hoc networks. In this paper, we propose a pair of linear network coding (NC) and all-to-all broadcast based fast data synchronization algorithms for wireless ad hoc networks whose topology is under operator's control. We consider both data block selectio…
In dynamic wireless ad-hoc networks (DynWANs), autonomous computing devices set up a network for the communication needs of the moment. These networks require the implementation of a medium access control (MAC) layer. We consider MAC protocols for DynWANs that need to be autonomous and robust as well as have high bandwidth utilization, high predictability degree of bandwidth allocation, and low communication delay in the presence of frequent topological changes to the communication network. Recent studies have shown that existing implementations cannot guarantee the necessary satisfaction of t…
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by these mobile devices are different from those used in a wired network; which helps to save computation time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance Vector routing protocol for enhancing mobile nodes performance and lifetime in a cl…
Ad hoc network enables network creation on the fly without support of any predefined infrastructure. The spontaneous erection of networks in anytime and anywhere fashion enables development of various novel applications based on ad hoc networks. However, at the same ad hoc network presents several new challenges. Different research proposals have came forward to resolve these challenges. This chapter provides a survey of current issues, solutions and research trends in wireless ad hoc network. Even though various surveys are already available on the topic, rapid developments in recent years ca…
The number of contending neighbors of a node in a multihop ad hoc network has to be adjusted while analyzing the performance of the network such as computing the end-to-end delays along a path from a given source to a destination. In this paper, we describe a method to adjust the number of contending neighbors of a node in a multihop wireless ad hoc network. Our method is based on the minimum number of neighbors that has to be common between two consecutive nodes along a path. We derive an analytical expression for the adjustment factor.
In Wireless Ad-hoc Networks, nodes are free to move randomly and organize themselves arbitrarily, thus topology may change quickly and capriciously. In Mobile Ad-hoc NETworks, specially Wireless Multi-hop Networks provide users with facility of quick communication. In Wireless Multi-hop Networks, routing protocols with energy efficient and delay reduction techniques are needed to fulfill users demands. In this paper, we present Linear Programming models to assess and enhance reactive routing protocols. To practically examine constraints of respective Linear Programming models over reactive pro…
For stationary wireless ad hoc networks, one of the key challenging issues in routing and multicasting is to conserve as much energy as possible without compromising path efficiency measured as end-to-end delay. In this paper, we address the problem of path efficient and energy aware multicasting in static wireless ad hoc networks. We propose a novel distributed scalable algorithm for finding a virtual multicast backbone (VMB). Based on this VMB, we have further developed a multicasting scheme that jointly improves path efficiency and energy conservation. By exploiting inherent broadcast advan…
In this paper we present a distributed clustering protocol for mobile wireless sensor networks. A large majority of research in clustering and routing algorithms for WSNs assume a static network and hence are rendered inefficient in cases of highly mobile sensor networks, which is an aspect addressed here. MECP is an energy efficient, mobility aware protocol and utilizes information about movement of sensor nodes and residual energy as attributes in network formation. It also provides a mechanism for fault tolerance to decrease packet data loss in case of cluster head failures.
Many clustering schemes have been proposed for ad hoc networks. A systematic classification of these clustering schemes enables one to better understand and make improvements. In mobile ad hoc networks, the movement of the network nodes may quickly change the topology resulting in the increase of the overhead message in topology maintenance. Protocols try to keep the number of nodes in a cluster around a pre-defined threshold to facilitate the optimal operation of the medium access control protocol. The clusterhead election is invoked on-demand, and is aimed to reduce the computation and commu…
We propose a new platform for implementing secure wireless ad hoc networks. Our proposal is based on a modular architecture, with the software stack constructed directly on the Ethernet layer. Within our platform we use a new security protocol that we designed to ensure mutual authentication between nodes and a secure key exchange. The correctness of the proposed security protocol is ensured by Guttman's authentication tests.
Multihop ad hoc wireless networks consist of mobile nodes that communicate with each other without any fixed infrastructure. The nodes in these networks are power constrained, since they operate in limited battery energy. Cooperative caching is an attractive solution for reducing network traffic and bandwidth demands in mobile ad hoc networks. Deploying caches in mobile nodes can reduce the overall traffic considerably. Cache hits eliminate the need to contact the data source frequently, which avoids additional network overhead. In this paper we propose a cache discovery policy for cooperative…
At the same time as the emergence of multimedia in mobile Ad hoc networks, research for the introduction of the quality of service (QoS) has received much attention. However, when designing a QoS solution, the estimation of the available resources still represents one of the main issues. This paper suggests an approach to estimate available resources on a node. This approach is based on the estimation of the busy ratio of the shared canal. We consider in our estimation the several constraints related to the Ad hoc transmission mode such as Interference phenomena. This approach is implemented o…
In Wireless Ad hoc networks (WANETs), nodes separated by considerable distance communicate with each other by relaying their messages through other nodes. However, it might not be in the best interests of a node to forward the message of another node due to power constraints. In addition, all nodes being rational, some nodes may be selfish, i.e. they might not relay data from other nodes so as to increase their lifetime. In this paper, we present a fair and incentivized approach for participation in Ad hoc networks. Given the power required for each transmission, we are able to determine the p…
Energy efficiency is an important performance measure of wireless network protocols, especially for battery-powered mobile devices such as smartphones. This paper presents a new energy-efficient medium access control (MAC) scheme for fully connected wireless ad hoc networks. The proposed scheme reduces energy consumption by putting radio interfaces in the sleep state periodically and by reducing transmission collisions, which results in high throughput and low packet transmission delay. The proposed MAC scheme can also address the energy saving in realtime traffics which require very low packe…
Adapting applications' data rates in multi-hop wireless ad-hoc networks is inherently challenging. Packet collision, channel contention, and queue buildup contribute to packet loss but are difficult to manage in conventional TCP/IP architecture. This work explores a data-centric approach based on Name Data Networking (NDN) architecture, which is considered more suitable for wireless ad-hoc networks. We show that the default NDN transport offers better performance in linear topologies but struggles in more extensive networks due to high collision and contention caused by excessive Interests fro…
Mobile Adhoc Network is a wireless network without infrastructure.It is a kind of wireless adhoc network,and is a self configuring network of mobile routers connected by wireless links.The routers are free to move randomly and organize themselves arbitrarily,thus the network's wireless topology may change rapidly and unpredictably. Such a network may operate in a standalone fashion,or may be connected to the larger Internet.There are various routing protocols available for MANET.The most popular ones are DSR,AODV and DSDV.This paper examines two routing protocols for mobile ad hoc networks :th…
This paper conducts a detailed simulation study of stateless anycast routing in a mobile wireless ad hoc network. The model covers all the fundamental aspects of such networks with a routing mechanism using a scheme of orientation-dependent inter-node communication links. The simulation system Winsim is used which explicitly represents parallelism of events and processes in the network. The purpose of these simulations is to investigate the effect of node s maximum speed, and different TTL over the network performance under two different scenarios. Simulation study investigates five practicall…
We deal with the problem of streaming multiple video streams between pairs of nodes in a multi-hop wireless ad hoc network. The nodes are static, know their locations, and are synchronized (via GPS). We introduce a new interference model that uses variable interference radiuses. We present an algorithm for computing a frequency assignment and a schedule whose goal is to maximize throughput over all the video streams. In addition, we developed a localized flow-control mechanism to stabilize the queue lengths. We simulated traffic scheduled by the algorithm using OMNET++/MixiM (i.e., physical SI…
Secured communication in ad hoc wireless networks is primarily important, because the communication signals are openly available as they propagate through air and are more susceptible to attacks ranging from passive eavesdropping to active interfering. The lack of any central coordination and shared wireless medium makes them more vulnerable to attacks than wired networks. Nodes act both as hosts and routers and are interconnected by Multi- hop communication path for forwarding and receiving packets to/from other nodes. The objective of this paper is to propose a key exchange and encryption me…
Efficient radio spectrum utilization and low energy consumption in mobile devices are essential in developing next generation wireless networks. This paper presents a new medium access control (MAC) mechanism to enhance spectrum efficiency and reduce energy consumption in a wireless ad hoc network. A set of coordinator nodes, distributed in the network area, periodically schedule contention-free time slots for all data transmissions/receptions in the network, based on transmission requests from source nodes. Adjacent coordinators exchange scheduling information to effectively increase spatial …
Adhoc wireless sensor network is an architecture of connected nodes, each node has its main elements such as sensors, computation and communications capabilities. Adhoc WSNs restrained energy sources result in a shorter lifetime of the sensor network and inefficient topology. In this paper, a new approach for saving and energy controlling is introduced using quality of service, the main reason is to reduce the nodes energy through discovering the best optimum route that meets quality of service requirements; quality of service technique is used to find the optimum methodology for nodes packets…
In this paper, we study how to determine concurrent transmissions and the transmission power level of each link to maximize spectrum efficiency and minimize energy consumption in a wireless ad hoc network. The optimal joint transmission packet scheduling and power control strategy are determined when the node density goes to infinity and the network area is unbounded. Based on the asymptotic analysis, we determine the fundamental capacity limits of a wireless network, subject to an energy consumption constraint. We propose a scheduling and transmission power control mechanism to approach the o…
Wireless ad hoc networks, in particular mobile ad hoc networks (MANETs), are growing very fast as they make communication easier and more available. However, their protocols tend to be difficult to design due to topology dependent behavior of wireless communication, and their distributed and adaptive operations to topology dynamism. Therefore, it is desirable to have them modeled and verified using formal methods. In this paper, we present an actor-based modeling language with the aim to model MANETs. We address main challenges of modeling wireless ad hoc networks such as local broadcast, unde…
Time division multiple access (TDMA) is a method for sharing communication media. In wireless communications, TDMA algorithms often divide the radio time into timeslots of uniform size, $ξ$, and then combine them into frames of uniform size, $τ$. We consider TDMA algorithms that allocate at least one timeslot in every frame to every node. Given a maximal node degree, $δ$, and no access to external references for collision detection, time or position, we consider the problem of collision-free self-stabilizing TDMA algorithms that use constant frame size. We demonstrate that this problem has no …
The wireless network places vital role in the present day communication scenario. The ad hoc nature of wireless communication adds flavour to suit various real world applications. This improves the performance of the network tremendously while the clustering mechanism gets added to the ad hoc network. It has been found out that the existing WCA lacks in forming efficient clusters. Thus, this work proposes an Extended weighted partitioning around cluster head mechanism by considering W-PAC as a base to form clusters. The cluster members are configured with IPv6 address. This IPv6 clusters forme…
Wireless ad hoc networks are power constrained since nodes operate with limited battery energy. Thus, energy consumption is crucial in the design of new ad hoc routing protocols. In order to maximize the lifetime of ad hoc networks, traffic should be sent via a route that can be avoid nodes with low energy. In addition, considering that the nodes of ad hoc networks are mobile, it is possible that a created path is broken because of nodes mobility and establishment of a new path would be done again. This is because of sending additional control packets, accordingly, energy consumption increases…
In wireless ad hoc networks, protecting source and destination nodes location privacy is a challenging task due to malicious traffic analysis and privacy attacks. Existing solutions, such as incorporating fake source destination pairs in the network, provide some privacy of real source and destination nodes against attackers. Moreover, ad hoc networks need stronger privacy protection against powerful global attacker which has knowledge of overall network topology and, that can also eavesdrop and visualize network wide data transmissions. In this paper, we present a novel privacy technique, (EX…
Routing tables in ad hoc and wireless routing protocols can be represented using rooted trees. The constant need for communication and storage of these trees in routing protocols demands an efficient rooted tree coding algorithm. This efficiency is defined in terms of the average code length, and the optimality of the algorithm is measured by comparing the average code length with the entropy of the source. In this work, TreeExplorer is introduced as an easy-to-implement and nearly optimal algorithm for coding rooted tree structures. This method utilizes the number of leaves of the tree as an …
We study how long range directional beams can be used for self-organization of a wireless network to exhibit small world properties. Using simulation results for randomized beamforming as a guideline, we identify crucial design issues for algorithm design. Subsequently, we propose an algorithm for deterministic creation of small worlds. We define a new centrality measure that estimates the structural importance of nodes based on traffic flow in the network, which is used to identify the optimum nodes for beamforming. This results in significant reduction in path length while maintaining connec…
Motivated by the benefits of small world networks, we propose a self-organization framework for wireless ad hoc networks. We investigate the use of directional beamforming for creating long-range short cuts between nodes. Using simulation results for randomized beamforming as a guideline, we identify crucial design issues for algorithm design. Our results show that, while significant path length reduction is achievable, this is accompanied by the problem of asymmetric paths between nodes. Subsequently, we propose a distributed algorithm for small world creation that achieves path length reduct…
Apple Wireless Direct Link (AWDL) is a proprietary and undocumented wireless ad hoc protocol that Apple introduced around 2014 and which is the base for applications such as AirDrop and AirPlay. We have reverse engineered the protocol and explain its frame format and operation in our MobiCom '18 paper "One Billion Apples' Secret Sauce: Recipe of the Apple Wireless Direct Link Ad hoc Protocol." AWDL builds on the IEEE 802.11 standard and implements election, synchronization, and channel hopping mechanisms on top of it. Furthermore, AWDL features an IPv6-based data path which enables direct comm…
nTorrent is a BitTorrent-like application that is based on NDN (Named Data Networking). Ad hoc environments introduce additional challenges to the dissemination of files among peers. Some issues that we encounter are that not all peers in the neighborhood or environment run the nTorrent application or desire the same torrent file. These issues cause nTorrent interests to be unable to be processed or prevent peers from downloading their desired torrent files. In order to solve this issue, I implemented pure forwarding nodes that represent peers that do not run the nTorrent application and also …
Clustering of mobile ad hoc networks is a largely growing field. The perceived benefits of clustering are comprehensively analyzed in open literature. This paper considers the development of a new connected-dominated-set clustering algorithm called Ring Clustering Algorithm (RCA). RCA is a heuristic algorithm that groups mobile nodes in a network into rings. Each ring consists of three ring-nodes. The priority of a ring is determined according to a new parameter, the ring degree. This paper presents the proof that the maximum number of rings that can be formed by RCA in any disk area equals th…
Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator also the wireless nodes that can dynamically form a network to exchange information without using any existing fixed network infrastructure. And it's an autonomous system in which mobile hosts connected by wireless links are free to be dynamically and some time act as routers at the same time, and we discuss in this paper the distinct characteristics of traditional wire…
Over the past decade we have witnessed a rapid growth and development in wireless communication systems, to the point that conventional spectrum allocation policies may not be able to fulfill them all. Federal Communications Commission (FCC) licenses certain frequency segments to a particular user in a particular geographic area. Industrial, Scientific and Medical (ISM) radio bands have also been envisioned for all other unlicensed user to share, as long as they follow certain power regulations. But with the recent boom in the wireless technologies, these open channels have become overcrowded …
This work is the second of a two-part series of papers on the effectiveness of cooperative techniques in non-centralized carrier sense-based ad hoc wireless networks. While Part I extensively discussed reactive cooperation, characterized by relayed transmissions triggered by failure events at the intended receiver, Part II investigates in depth proactive solutions, in which the source of a packet exploits channel state information to preemptively coordinate with relays in order to achieve the optimal overall rate to the destination. In particular, this work shows by means of both analysis and …
We investigate the design of the optimal routing path in a moving vehicles involved the internet of things (IoT). In our model, jammers exist that may interfere with the information exchange between wireless nodes, leading to worsened quality of service (QoS) in communications. In addition, the transmit power of each battery-equipped node is constrained to save energy. We propose a three-step optimal routing path algorithm for reliable and energy-efficient communications. Moreover, results show that with the assistance of moving vehicles, the total energy consumed can be reduced to a large ext…
The emerging paradigm of Information-Centric Networking is an exciting field of research, opening opportunities in many areas, such as forwarding strategies, caching placement policies, applications (e.g. video streaming and instant messaging), to name a few. In this paper, we address the mobility aspect of ICN, as well as how it performs in tactical wireless ad hoc environments. In this paper, we present results from a simulation study that investigates the performance of Named Data Networking, an instantiation of ICN, in such environments. We perform a series of simulations based on ndnSIM s…
In this work, we evaluate local capacity of wireless ad hoc networks with several medium access protocols and identify the most optimal protocol. We define local capacity as the average information rate received by a receiver randomly located in the network. We analyzed grid pattern protocols where simultaneous transmitters are positioned in a regular grid pattern, pure ALOHA protocols where simultaneous transmitters are dispatched according to a uniform Poisson distribution and exclusion protocols where simultaneous transmitters are dispatched according to an exclusion rule such as node color…
Leibniz University of Hannover（汉诺威莱布尼茨大学）；Technische Universität Braunschweig（布伦瑞克工业大学）
We propose and evaluate an immuno-inspired approach to misbehavior detection in ad hoc wireless networks. Node misbehavior can be the result of an intrusion, or a software or hardware failure. Our approach is motivated by co-stimulatory signals present in the Biological immune system. The results show that co-stimulation in ad hoc wireless networks can both substantially improve energy efficiency of detection and, at the same time, help achieve low false positives rates. The energy efficiency improvement is almost two orders of magnitude, if compared to misbehavior detection based on watchdogs…
This paper studies the problem of computing Nash equilibrium in wireless networks modeled by Weighted Timed Automata. Such formalism comes together with a logic that can be used to describe complex features such as timed energy constraints. Our contribution is a method for solving this problem using Statistical Model Checking. The method has been implemented in UPPAAL model checker and has been applied to the analysis of Aloha CSMA/CD and IEEE 802.15.4 CSMA/CA protocols.
Random 1/2-disk routing in wireless ad-hoc networks is a localized geometric routing scheme in which each node chooses the next relay randomly among the nodes within its transmission range and in the general direction of the destination. We introduce a notion of convergence for geometric routing schemes that not only considers the feasibility of packet delivery through possibly multi-hop relaying, but also requires the packet delivery to occur in a finite number of hops. We derive sufficient conditions that ensure the asymptotic \emph{convergence} of the random 1/2-disk routing scheme based on…
Topology control, including topology construction and maintenance phases, is a vital conception for wireless ad-hoc networks of any kind, expressly the wireless sensor networks (WSN). Topology maintenance, the latter phase, concerns several problems, such as optimizing the energy consumption, increasing the data rate, making clusters, and sustaining the connectivity. A disconnected network, among other strategies, can efficiently be connected again using a Movement-based Connectivity Restoration (MCR) method, where a commensurate number of nodes move (or are moved) to the desired positions. Ho…
Energy consumption and delay incurred in packet delivery are the two important metrics for measuring the performance of geographic routing protocols for Wireless Adhoc and Sensor Networks (WASN). A protocol capable of ensuring both lesser energy consumption and experiencing lesser delay in packet delivery is thus suitable for networks which are delay sensitive and energy hungry at the same time. Thus a smart packet forwarding technique addressing both the issues is thus the one looked for by any geographic routing protocol. In the present paper we have proposed a Fermat point based forwarding …
novel algorithm is presented to deduce individual nodal forwarding behavior from standard end-to-end acknowledgments. The algorithm is based on a well-established mathematical method and is robust to network related errors and nodal behavior changes. The proposed solution was verified in a network simulation, during which it achieved sound results in a challenging multihop ad-hoc network environment.
Clustering in wireless sensor networks (WSNs) is an important technique to ease topology management and routing. Clustering provides an effective method for prolonging lifetime of a WSN. This paper proposes energy efficient multi-level clustering schemes for wireless sensor networks. Wireless sensor nodes are extremely energy constrained with a limited transmission range. Due to large area of deployment, the network needs to have a multi-level clustering protocol that will enable far-off nodes to communicate with the base station. Simulation is used to analyze the proposed protocols and compar…
We study the minimum latency broadcast scheduling (MLBS) problem in Single-Radio Multi-Channel (SR-MC) wireless ad-hoc networks (WANETs), which are modeled by Unit Disk Graphs. Nodes with this capability have their fixed reception channels, but can switch their transmission channels to communicate with their neighbors. The single-radio and multi-channel model prevents existing algorithms for single-channel networks achieving good performance. First, the common assumption that one transmission reaches all the neighboring nodes does not hold naturally. Second, the multi-channel dimension provide…
In this paper, the well-known forwarder's dilemma is generalized by accounting for the presence of link quality fluctuations; the forwarder's dilemma is a four-node interaction model with two source nodes and two destination nodes. It is known to be very useful to study ad hoc networks. To characterize the long-term utility region when the source nodes have to control their power with partial channel state information (CSI), we resort to a recent result in Shannon theory. It is shown how to exploit this theoretical result to find the long-term utility region and determine good power control po…
