Search

Smart services such as smart home, smart grid, smart transportation, and so on, are enabled with advanced communications networks, data analysis and control. However, challenges exist in designing a supporting network with optimal resource management while achieving quality- of-experience for a smart service. In this article, we propose a unified SA-WMN architecture that can be applied to different smart services. The core of the SA-WMN architecture is a smart service-aware network controller. The mega network controller has a service adaptation module, network cognition module and resource provisioning module that can achieve cost-effective wireless-mixed area network deployment, and efficient network resource management of SA-WMN. The proposed SA-WMN architecture is expected to close the gap on wireless network design, improve energy efficiency and enhance spectrum efficiency and access, in a smart service- aware paradigm. It will pave the way for realizing next-generation wireless network based smart services. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the request routing delay of opportunistic routing for cache-enabled wireless networks considering uncorrelated and temporally correlated wireless channels. We model wireless channel variation at different time scales via two approaches: an abstract modeling approach where we model the variation considering Rayleigh fading and shadowing channel models and an empirical approach where the variation is modeled directly using signal strength measurements. We develop Markovian models to analyze the performance of opportunistic forwarding, leverage the wireless channel models to determine the packet transmission success probabilities and then utilize them to obtain the request routing delay. We first perform numerical experiments and simulations considering Rayleigh fading and shadowing channel models and then conduct a trace-based evaluation using signal strength measurements collected over a wireless sensor network testbed. Our experiments demonstrate the validity and effectiveness of our Markovian model in determining the request routing delay in real-world settings. Our work takes a step forward in providing network operators a tool for analyzing network performance before deploying their networks. [ABSTRACT FROM AUTHOR]

The design of an efficient medium access control (MAC) protocol for multichannel ad hoc cognitive radio networks is an important problem and has been the topic of extensive recent research. In this paper, we present the design and performance evaluation of a protocol, group MAC (GMAC), which is customized for a situation that commonly arises in ad hoc networks: The network consists of multiple groups of nodes such that a large fraction of the traffic of each node needs to be sent to other nodes of its own group. Some examples are 1) units (e.g., platoons) in a military ad hoc network; 2) divisions in an emergency or disaster relief network; and 3) departments in a corporate or university network. Our protocol requires each secondary node to have only one narrowband transceiver, does not rely on a control channel, and incorporates a novel technique for dynamically balancing the traffic load of secondary nodes across the set of free channels. We formulate the problem of partitioning the network nodes into groups based on the volumes of data traffic to be sent between different pairs of nodes, which we call the group formation problem (GFP). We show that the GFP is NP-complete and propose a greedy algorithm to solve it. We analyze the stability region of the GMAC protocol using a queuing theoretic framework. Our extensive simulations show that a large fraction of the bandwidth unoccupied by primary users is utilized by the GMAC protocol for data transmissions. [ABSTRACT FROM AUTHOR]

We consider the problem of distributed channel allocation in large networks under the frequency-selective interference channel. Performance is measured by the weighted sum of achievable rates. Our proposed algorithm is a modified Fictitious Play algorithm that can be implemented distributedly, and its stable points are the pure Nash equilibria of a given game. Our goal is to design a utility function for a non-cooperative game, such that all of its pure Nash equilibria have close to optimal global performance. This will make the algorithm close to optimal while requiring no communication between users. We propose a novel technique to analyze the Nash equilibria of a random interference game, determined by the random channel gains. Our analysis is asymptotic in the number of users. First, we present a natural non-cooperative game where the utility of each user is his achievable rate. It is shown that, asymptotically in the number of users and for strong enough interference, this game exhibits many bad equilibria. Then, we propose a novel non-cooperative M frequency-selective interference channel game as a slight modification of the former, where the utility of each user is artificially limited. We prove that even its worst equilibrium has asymptotically optimal weighted sum rate for any interference regime and even for correlated channels. This is based on an order statistics analysis of the fading channels that is valid for a broad class of fading distributions (including Rayleigh, Rician, m-Nakagami, and more). We carry out simulations that show fast convergence of our algorithm to the proven asymptotically optimal pure Nash equilibria. [ABSTRACT FROM AUTHOR]

How to achieve reliable routing has always been a major issue in the design of communication networks, among which mobile ad hoc networks (MANETs) possess the most adversarial networking environment due to the absence of fixed infrastructure, the nature of open transmission media and the dynamic network topology. These characteristics also make the design of routing protocols in MANETs become even more challenging. In this paper, we propose an evolutionary self-cooperative trust (ESCT) scheme that imitates human cognitive process and relies on trust-level information to prevent various routing disruption attacks. In this scheme, mobile nodes will exchange trust information and analyze received trust information based on their own cognitive judgment. Eventually, each node dynamically evolves its cognition to exclude malicious entities. The most attractive feature of ESCT is that they cannot compromise the system even if the internal attackers know how the security mechanism works. In this paper, we evaluate the performance of ESCT scheme under various routing disruption attack situations. Simulation results affirm that ESCT scheme promotes network scalability and ensures the routing effectiveness in the presence of routing disruption attackers in MANETs. [ABSTRACT FROM AUTHOR]

Abstract: The methods of protection against attacks on the ad hoc networks in the self-organizing cyber-physical systems are analyzed in the article, and their issues are identified. The authors propose an adaptive management method for the ad hoc network topology, where the blockchain-like directed acyclic graph is applied to solve the identified issues. [ABSTRACT FROM AUTHOR]

As a vital component of disaster response and relief, a wireless network needs to be rapidly deployed after a disaster strikes. Due to the advantages of large area coverage, low capital cost, and fast deployment, an unmanned aerial vehicle (UAV) is believed to be a potentially promising choice to recover wireless communication in post-disaster environments. In this paper, the performance gains of utilizing two cooperative UAVs for downlink transmission over a large number of emergency response rescue vehicles on the ground in post-disaster areas are explored. Toward this end, the concept of average channel access delay for a generic vehicle to establish a full transmission to an UAV is introduced, i.e., data packets are said to be successfully transmitted from a UAV to a vehicle only if the time duration for the vehicle covered by the UAV is greater than the specified average channel access delay. Based on the proposed concept, a stochastic geometry based mathematical framework to analyze the coverage probability and average achievable rate for a multi-UAV-assisted downlink network, where vehicles connect to the Internet via satellites in a two-hop manner, is presented. According to the derived closed-form solutions for the network performance metrics, extensive numerical results are provided to illustrate the network performance gains brought by UAVs. Additionally, optimal settings are also presented for network designers to efficiently determine the optimal network parameters so as to achieve the optimum network performances in post-disaster areas. [ABSTRACT FROM AUTHOR]

Abstract This paper investigates the performance of MIMO ad hoc networks that employ transmit diversity, as delivered by the Alamouti scheme, and/or spatial multiplexing, according to the Vertical Bell Labs Layered Space-Time system (V-BLAST). Both techniques are implemented in the ns-3 network simulator by focusing on their overall effect on the resulting signal-to-interference-plus-noise ratio (SINR) at the intended receiver. Unlike previous works that have studied fully-connected scenarios or have assumed simple abstractions to represent MIMO behavior, this paper evaluates MIMO ad hoc networks that are not fully connected by taking into account the impact of multiple antennas on the carrier sense activity in CSMA-like medium access control (MAC) protocols. In addition to presenting a performance evaluation of ad hoc networks operating according to each individual MIMO scheme, this paper proposes simple modifications to the IEEE 802.11 DCF MAC to allow the joint operation of both MIMO techniques. Hence, each pair of nodes is allowed to select the best MIMO configuration for the impending data transfer. The joint operation is based on three operation modes that are selected based on the estimated SINR at the intended receiver and its comparison with a set of threshold values. The performance of ad hoc networks operating with the joint MIMO scheme is compared with the performance when using each individual MIMO scheme and the standard single-input single output (SISO) IEEE 802.11. Performance results are presented based on MAC-level throughput per node, delay, and throughput fairness under saturated traffic conditions. [ABSTRACT FROM AUTHOR]

Augmented information (AgI) services allow users to consume information that results from the execution of a chain of service functions that process source information to create real-time augmented value. Applications include real-time analysis of remote sensing data, real-time computer vision, personalized video streaming, and augmented reality, among others. We consider the problem of optimal distribution of AgI services over a wireless computing network, in which nodes are equipped with both communication and computing resources. We characterize the wireless computing network capacity region and design a joint flow scheduling and resource allocation algorithm that stabilizes the underlying queuing system while achieving a network cost arbitrarily close to the minimum, with a tradeoff in network delay. Our solution captures the unique chaining and flow scaling aspects of AgI services while exploiting the use of the broadcast approach coding scheme over the wireless channel. [ABSTRACT FROM AUTHOR]

Densifying networks and deploying more antennas at each access point are two principal ways to boost the capacity of wireless networks. However, the complicated distributions of the signal power and the accumulated interference power, largely induced by various space–time processing techniques, make it highly challenging to quantitatively characterize the performance of multi-antenna networks. In this paper, using tools from stochastic geometry, a unified framework is developed for the analysis of such networks. The major results are two innovative representations of the coverage probability, which make the analysis of multi-antenna networks almost as tractable as the single-antenna case. One is expressed as an $\ell _{1}$ -induced norm of a Toeplitz matrix, and the other is given in a finite sum form. With a compact representation, the former incorporates many existing analytical results on single- and multi-antenna networks as special cases and leads to tractable expressions for evaluating the coverage probability in both ad hoc and cellular networks. While the latter is more complicated for numerical evaluation, it helps analytically gain key design insights. In particular, it helps prove that the coverage probability of ad hoc networks is a monotonically decreasing convex function of the transmitter density and that there exists a peak value of the coverage improvement when increasing the number of transmit antennas. On the other hand, in multi-antenna cellular networks, it is shown that the coverage probability is independent of the transmitter density and that the outage probability decreases exponentially as the number of transmit antennas increases. [ABSTRACT FROM AUTHOR]

Rapid developments in the communication arena has tremendously improved the transmission procedures today. The amount of information transmission in the commercial and military applications has grown tremendously therefore the need for security concerns have also grown simultaneously since these applications involve in the transmission of confidential contents. Information transmissions in wireless networks appear to be confidential, hence it becomes mandatory to safeguard these contents from the various available offenses by means of devising suitable security mechanisms. Various types of attacks have been observed in the ad hoc networks, namely, the active and passive types, internal and external types. Integrity, identity and privacy are the three major parameters to be ensured in the design of a secure network. This survey paper discusses about the various attacks on a network together with the essential security procedures to be incorporated for securing the network. [ABSTRACT FROM AUTHOR]

Communication technologies supply the blood for smart city applications. In view of the ever-increasing wireless traffic generated in smart cities and our already congested radio access networks (RANs), we have recently designed a data transportation network, the vehicular cognitive capability harvesting network (V-CCHN), which exploits the harvested spectrum opportunity and the mobility opportunity offered by the massive number of vehicles traveling in the city to not only offload delay-tolerant data from congested RANs but also support delay-tolerant data transportation for various smart-city applications. To make data transportation efficient, in this paper, we develop a spectrum-aware (SA) data transportation scheme based on Markov decision processes. Through extensive simulations, we demonstrate that, with the developed data transportation scheme, the V-CCHN is effective in offering data transportation services despite its dependence on dynamic resources, such as vehicles and harvested spectrum resources. The simulation results also demonstrate the superiority of the SA scheme over existing schemes. We expect the V-CCHN to well complement existing telecommunication networks in handling the exponentially increasing wireless data traffic. [ABSTRACT FROM AUTHOR]

In this paper, we consider a network reconstruction problem using unmanned aerial vehicles (UAVs) where stationary ad hoc networks are severely damaged in a post-disaster scenario. The main objective of this paper is to repair the network by supplementing aerial wireless links into the isolated ground network using UAVs. Our scheme performs network probing from the air and finds out crucial spots where both local and global routing performance can significantly be recovered if deployed. First, we propose a novel distributed coverage path planning algorithms with independent and computationally lightweight navigation based on adaptivezigzagpatterns. Second, we present route topology discovery schemes that capture both local andnon-local network connectivity by extracting inherent route skeletons via stitching partial local paths obtained from the simple packet probing by UAVs. Finally, we find the optimal UAV relay deployment positions that can improve network-wide data delivery most effectively based on three novel approaches of an optimization technique, an iterative heuristic algorithm, and a topology partitioning ofstrongly connected component. Simulation results demonstrate that our distributed traversing algorithms reduce the complete coverage time, the travel distance, and the duplicate coverage compared to other counterpart algorithms. Our deployment algorithms recover severely impaired routes, incurring reasonable computational overhead. [ABSTRACT FROM AUTHOR]

This paper studies finding the secure path according to the secrecy connectivity probability (SCP) in the multihop ad hoc networks in the presence of inhomogeneous eavesdropper clusters. We consider both random and fixed eavesdropper clusters, where the former case assumes that there is no knowledge of the locations of the clusters and the latter case assumes that the locations of the clusters can be estimated accurately. First, we derive the end-to-end SCP to characterize the secrecy performance of a given path in a general multihop wireless network with half-duplex randomize-and-forward relaying. Then, we consider a full-duplex scheme at the legitimate receiver, which receives the useful information while broadcasting a jamming signal to the potential eavesdroppers to further enhance the secrecy connectivity. Then, a novel secure routing algorithm that can provide the maximum SCP for any legitimate transmitter/receiver pair in a distributed manner is proposed. The theoretical analysis is verified by Monte Carlo simulation results. The results show that our secure routing algorithm provides similar results compared to an exhaustive search. For the random eavesdropper cluster case, the optimal route is independent of the knowledge of the cluster, which is the same as the homogeneous eavesdropper case. However, for the case where eavesdropper clusters are fixed and their locations are knowna priori, the optimal path selection depends on the radii and locations of the eavesdropper clusters and the average number of eavesdroppers in each cluster. [ABSTRACT FROM AUTHOR]

We propose a context-aware trust management model called CATrust for service-oriented ad hoc networks such as peer-to-peer and Internet of Things networks wherein a node can be a service requester or a service provider. The novelty of our design lies in the use of logistic regression to dynamically estimate trustworthiness of a service provider based on its service behavior patterns in response to context environment changes. We develop a recommendation filtering mechanism to effectively screen out dishonest recommendations even in extremely hostile environments in which the majority recommenders are dishonest. We demonstrate desirable convergence, accuracy, and resiliency properties of CATrust. We also demonstrate that CATrust outperforms contemporary peer-to-peer and Internet of Things trust models in terms of service trust prediction accuracy against collusion recommendation attacks. [ABSTRACT FROM AUTHOR]

In this paper, we present a routing and interface assignment algorithm for multi-channel multi-interface (MCMI) wireless ad hoc networks. An MCMI network consists of nodes that have more than one interface, and more than one channel available for transmission. The proposed algorithm takes into account both the number of hops between the source to the destination nodes, and the effects of adjacent hop interference. The algorithm has two decoupled steps: route selection and interface assignment. The step of route selection finds the path that has the minimum lower bound among all possible routes between the source and the destination while the step of interface assignment assigns an interface to a channel on each hop on that path. The interface assignment is based on the use of the Viterbi algorithm. The use of decoupled steps makes the algorithm computationally efficient, while the use of the lower bound metrics in route selection and the Viterbi algorithm in interface assignment helps improving the global optimality of the routing. Computer simulation and examples are used to demonstrate the effectiveness and performance of the proposed technique. Comparisons are made to other existing routing techniques in the area of dynamical spectrum access. [ABSTRACT FROM AUTHOR]

This paper examines a new application of the well-known ARP spoofing (or ARP cache poisoning) attack. Traditionally, ARP spoofing has been applied in local area networks to allow an attacker to achieve a man-in-the-middle position against target hosts, or to implement a denial-of-service by routing messages to non-existent hardware addresses. In this paper, we introduce a variant of ARP spoofing unique to multi-hop ad hoc networks in which routing loops are created among target wireless hosts. The routing loops not only results in a denial-of-service against the targeted hosts, but creates a resource consumption attack, where the targets waste power and occupy the channel, precluding its use by legitimate traffic. The paper identifies the network topology pre-conditions under which routing loops are possible, and discusses how ARP spoof messages can be used to create routing loops of arbitrary size. We show experimental results of an implementation and provide suggestions as to how to prevent, detect, or mitigate the attack. [ABSTRACT FROM AUTHOR]

A Multi-Beam Antenna (MBA) can be defined as a set of directional radio transceivers. These transceivers are facing different directions to prevent signal interference with each other. MBA nodes have two main characteristics: the Multi-Packet Transmission (MPT) capability and the Multi-Packet Reception (MPR) capability whereby a node can transmit/receive multiple packets at the same time. In this paper, we provide an analysis of how this MPT/MPR capability can be used to reduce the end-to-end delay for delivered packets in ad hoc networks. Taking beam considerations (determination of the beam in which neighbors are located) into account, we formulate the delay reduction issue as an optimization problem that we solve. Our results show that to maximally exploit the full potential of MBAs for delay reduction, the scheduling of links has to promote the formation of star nodes and keep the formation of bridges to a minimum; all of which leads to the selection of routes that very often are not the shortest. In fact, using only the shortest routes has a negative impact on the delay. However, the optimal link scheduling comes at the expense of a higher overhead in terms of the total number of packet transmissions. Furthermore, the beamwidth has a direct and significant impact on the end-to-end delay and the computation time. [ABSTRACT FROM AUTHOR]

This paper develops a stochastic geometry-based approach for the modeling and analysis of single- and multi-cluster wireless networks. We first define finite homogeneous Poisson point processes to model the number and locations of the transmitters in a confined region as a single-cluster wireless network. We study the coverage probability for a reference receiver for two strategies; closest-selection, where the receiver is served by the closest transmitter among all transmitters, and uniform-selection, where the serving transmitter is selected randomly with uniform distribution. Second, using Matern cluster processes, we extend our model and analysis to multi-cluster wireless networks. Here, two types of receivers are modeled, namely, closed- and open-access receivers. Closed-access receivers are distributed around the cluster centers of the transmitters according to a symmetric normal distribution and can be served only by the transmitters of their corresponding clusters. Open-access receivers, on the other hand, are placed independently of the transmitters and can be served by all transmitters. In all cases, the link distance distribution and the Laplace transform (LT) of the interference are derived. We also derive closed-form lower bounds on the LT of the interference for single-cluster wireless networks. The impact of different parameters on the performance is also investigated. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of joint secure routing and transmit power optimization for a multi-hop ad-hoc network under the existence of randomly distributed eavesdroppers following a Poisson point process. Secrecy messages are delivered from a source to a destination through a multi-hop route connected by multiple legitimate relays in the network. Our goal is to minimize the end-to-end connection outage probability under the constraint of a secrecy outage probability threshold, by optimizing the routing path and the transmit power of each hop jointly. We show that the globally optimal solution could be obtained by a two-step procedure where the optimal transmit power has a closed-form and the optimal routing path can be found by Dijkstra’s algorithm. Then a friendly jammer with multiple antennas is applied to enhance the secrecy performance further, and the optimal transmit power of the jammer and each hop of the selected route is investigated. This problem can be solved optimally via an iterative outer polyblock approximation with 1-D search algorithm. Furthermore, suboptimal transmit powers can be derived using the successive convex approximation method with a lower complexity. Simulation results show the performance improvement of the proposed algorithms for both non-jamming and jamming scenarios, and also reveal a non-trivial tradeoff between the numbers of hops and the transmit power of each hop for secure routing. [ABSTRACT FROM AUTHOR]

In the last years, the advancements in signal processing and integrated circuits technology allowed several research groups to develop working prototypes of in–band full–duplex wireless systems. The introduction of such a revolutionary concept is promising in terms of increasing network performance, but at the same time poses several new challenges, especially at the MAC layer. Consequently, innovative channel access strategies are needed to exploit the opportunities provided by full–duplex while dealing with the increased complexity derived from its adoption. In this direction, this paper proposes RTS/CTS in the Frequency Domain (RCFD), a MAC layer scheme for full–duplex ad hoc wireless networks, based on the idea of time–frequency channel contention. According to this approach, different OFDM subcarriers are used to coordinate how nodes access the shared medium. The proposed scheme leads to efficient transmission scheduling with the result of avoiding collisions and exploiting full–duplex opportunities. The considerable performance improvements with respect to standard and state–of–the–art MAC protocols for wireless networks are highlighted through both theoretical analysis and network simulations. [ABSTRACT FROM AUTHOR]

Cache-enabled wireless networks have gained increasing popularity in recent years for facilitating the delivery of content. Most existing works assumed that the network is static without the change of users and content, which is not the case in the real world. In this paper, we study the content delivery in cache-enabled wireless networks, where the network evolves in terms of users and content. We adopt the affiliation network model to reveal the network evolution process, where new users and content are added into the network randomly and connected with existing nodes via the preferential attachment. Users with strong social relations tend to request the same content objects, thus content popularity is sharply concentrated. Therefore, caching technique is more effective. To maximize the content delivery rate, we formulate the optimization problem of caching replication jointly with routing strategy. We show that network evolution can greatly improve the content delivery rate. In particular, when per-user cache capacity is in the order of $\Theta (1)$ , per-user delivery rate can achieve constant, i.e., the network can scale. Finally, theoretical results are validated based on a real-world data set from Facebook. [ABSTRACT FROM AUTHOR]

Estimating communication latency is a challenging task in the applications of industrial Internet of things (IIoT). Mobile convergecast, as a many-to-one communication pattern, has been recently explored in mobile sensor networks for IIoT, where sensor nodes are usually in mobile status, and report the sensed data regularly or randomly to one or more stationary sinks through the multihop routing path. As convergecast becomes increasingly relevant for industrial sensing and monitoring, a critical part of empowering information aggregation is to maintain consistent transmission. Path duration is one important component of end-to-end delay for communications along the path. In this paper, a probabilistic model for mobile convergecast has been proposed and evaluated to capture path duration times, by considering parameters including network models, sensor network scope, and mobility patterns of network elements. Through experiments, it has been verified that the proposed model can provide a feasible analysis of end-to-end delays in industrial networks implementing convergecast. [ABSTRACT FROM AUTHOR]

Network location is one of the critical issues and a challenge in wireless sensor and ad hoc networks, in particular when networks are sparse. However, even in highly sparse networks, there exist well-connected subgraphs while the distribution of the networks is random. This paper introduces weighted component stitching (WCS) to find redundantly rigid components with high redundant ratios, which can be used to generate reliable local realization. Finding and ranking the redundantly rigid components is an NP-hard problem (a reduction from maximum quasi-clique). Here, we introduce a series of theorems and algorithms to carry out WCS efficiently. More precisely, we prove that each graph has a determinant number of redundantly rigid components, each redundantly rigid component is covered by a set of basic redundant components (BRCs), and each BRC contains one redundant edge. We apply constraints to merge the BRCs to form components with higher redundancy ratio and develop a greedy algorithm to merge BRCs to form locally mostly redundant components (LMRCs). Finally, we give the approximation ratio. The local coordinates of nodes are calculated by optimization in each LMRC and are synchronized with weights to produce the global coordinates of nodes in the network to overcome the sparseness of subgraphs. Extensive experiments demonstrate significant improvements in accuracy (45%–64%) using our WCS method over the state-of-the-art algorithms under various settings of network sparseness and ranging noises. [ABSTRACT FROM AUTHOR]

Summary: Visible light communication (VLC) is the branch of optical wireless communications that uses light‐emitting diodes for the dual purpose of illumination and very‐high‐speed data communication. The main motivation behind the current work is finding alternatives to the saturated radio frequency spectrum, radio frequency security issue, and vulnerability to interferences. The current work is aimed at developing a module for the physical layer of a VLC‐based ad hoc network in network simulation 3. The VLC physical layer module is developed by using the optical signal modules available in the network simulator. The work also includes modelling of VLC‐based transmitter, wireless optical channel, and the optical receiver. Furthermore, the implementation and evaluation of the VLC‐based physical layer is carried out over a typical ad hoc network under different performance metrics. The designed ad hoc network is also tested under Wi‐Fi module followed by its comparison with corresponding ad hoc network under VLC module. The comparison is based on bit error rate curves, system throughput, and gain in received signal‐to‐noise ratio mainly. Finally, the suitability of different modulation schemes is also investigated in the current work for both Wi‐Fi– and VLC‐based ad hoc networks. [ABSTRACT FROM AUTHOR]

Recently, an ad-hoc mobile cloud has emerged as a promising architecture, which allows a mobile user to offload its computation tasks to nearby mobile devices, namely mobile cloudlets, with a short offloading latency and low bandwidth consumption of wireless local area network connections. However, due to the uncertainty in the user and cloudlet movements and the availability of cloudlets’ computation resources, it is a challenge to design an effective offloading scheme that can best provide the required quality of service (QoS) for the user. In this paper, we develop a constrained Markov decision process (CMDP) formulation for the mobile user to make an optimal offloading decision while considering its QoS requirements. The objective of the proposed CMDP formulation is to maximize the user's utility obtained by the task execution, while meeting the constraints on the required payment, energy consumption, processing delay and task loss probability. Two different schemes, which are linear programming (LP)-based and Q-Learning (QL)-based CMDP, are proposed to find the optimal solution for the formulated CMDP offloading problem. The LP-based scheme can be used for the user to acquire a QoS-aware optimal offloading policy with prior knowledge of the system state transition probabilities, while the QL-based scheme enables the user to learn an effective offloading decision in an unknown ad-hoc mobile cloud system. Extensive simulations were performed to evaluate the performance of the proposed schemes. The simulation results show the effectiveness of the offloading policies obtained by the proposed schemes, which outperform baseline schemes. [ABSTRACT FROM AUTHOR]

We propose a Context-aware Smallworld routing protocol for wireless ad-hoc networks which finds efficient routes to the destination nodes often through a very short chain of intermediate nodes, without using any routing table. This protocol exploits the “small-world” phenomenon of social networks where source-destination pairs typically get connected through few intermediate friends and the individuals can collectively discover such short paths. The key idea behind our routing protocol is that for forwarding an incoming packet to the destination, a node picks the next hop from among the one-hop neighbor from its one-hop neighborhood that is closest to the destination, and multiple randomly selected long-distance neighbor(s), i.e., from outside of its one-hop neighborhood, based on which of these neighbors is closest to the destination. The long-distance neighbors are selected by using their contextual information through a probabilistic mapping. We provide the theoretical foundations behind our protocol. This simple but effective algorithm can meet performance objectives for most scenarios by reducing loss and latency. Simulation results, using synthetic network topologies, have demonstrated that the routing performance of context-aware Smallworld is better than geographical (distance-based) Smallworld and other standard proactive routing protocols (e.g., OLSRv2) when metrics, such as packet losses, end-to-end delays, hop-counts, connectivity drops, and control traffic generated, are used as the key performance indicators. We also show that the proposed protocol is resilient to dynamic topology changes. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) networks have not yet received considerable research attention. Specifically, security issues are a major concern because such networks, which carry vital information, are prone to various attacks. In this paper, we design and implement a novel intrusion detection and response scheme, which operates at the UAV and ground station levels, to detect malicious anomalies that threaten the network. In this scheme, a set of detection and response techniques are proposed to monitor the UAV behaviors and categorize them into the appropriate list (normal, abnormal, suspect, and malicious) according to the detected cyber-attack. We focus on the most lethal cyber-attacks that can target an UAV network, namely, false information dissemination, GPS spoofing, jamming, and black hole and gray hole attacks. Extensive simulations confirm that the proposed scheme performs well in terms of attack detection even with a large number of UAVs and attackers since it exhibits a high detection rate, a low number of false positives, and prompt detection with a low communication overhead. [ABSTRACT FROM AUTHOR]

Neighbor discovery is a significant communication primitive for adjacent unmanned aerial vehicles (UAVs) to construct a flying ad hoc network (FANET). The multi-channel nature of FANETs makes channel hopping (CH) a feasible rendezvous method for UAVs to hop to the same available channel simultaneously and initiate a connection. However, due to the intrinsic uncoordinated constraints of dispersed UAVs (e.g., lack of clock synchronization, heterogeneous local channels, symmetric roles, and oblivious identifiers), it is challenging to design a performant CH algorithm that can achieve fast neighbor discovery in dynamic FANETs. In this paper, we present a fully uncoordinated matrix-based CH algorithm termed ABIO, which consists of one fixed Anchor column and several variable Binary (i.e., I/O-bit) extended columns in each CH period. The deterministic overlaps as well as the co-primality property of channel numbers among different kinds of columns provide the rendezvous guarantee. Furthermore, for the case with frequently varying channel status, we present a probability-based dynamic discovery (PDD) algorithm. By virtue of the cumulative probability estimation and selection of the qualified channels, the PDD algorithm can achieve timely rendezvous in the unstable environment with high probability. We rigorously analyze the theoretical neighbor discovery latency. We also validate the feasibility and efficiency of the proposed algorithms through extensive simulations. Evaluation results demonstrate the superiority of our algorithms in both stable and unstable communication environments. [ABSTRACT FROM AUTHOR]

Routing is one of the major challenges in cognitive radio ad hoc networks. In finding new routes, not only the less impacted paths due the primary user activity, but also bottleneck formations over time in the secondary network and multiple connections initiated by the secondary users are important issues to be investigated. Besides, route search confined to a small fraction of all possible paths can lead to miss the appropriate one. This paper introduces a hybrid method employing three atomic metrics related to route stability, congestion awareness and path diversity based on active connections. Also, the number of alternative paths is kept on a limited scale which avoids the emergence of excessive traffic load in the network. The simulation results demonstrate the effectiveness of the proposed approach in terms of packet delivery ratio, end-to-end delay and throughput. It is also shown that the performance of our routing mechanism outperforms the existing baseline schemes. [ABSTRACT FROM AUTHOR]

The proposed benefits of enabling automated and autonomous vehicles to cooperate are manifold - however, these functions introduce a new level of uncertainty and unreliability inherent of wireless communication into a realm of safety-critical decisions. Since vehicle-to-vehicle communication in either ad hoc or managed environments can be inherently unreliable, it is of highest importance to critically evaluate the level and design of integration of cooperative information into the decision making process of automated functions. Thus, a robust integration of communication as a sensor has to take into account key issues such as penetration rate, reliability of communication and trust and develop appropriate methods of handling these issues to provide fail-safety. In this paper we present an approach to cooperative maneuvers in automated vehicles with emphasis on handling potential hazards introduced by communication. In this regard we propose the complimentary Collaborative Maneuver Protocol (CMP), combining novel approaches to enable robust, functionally safe collaboration between vehicles in vehicle-tovehicle communication. [ABSTRACT FROM AUTHOR]

The narrow-beam operation in millimeter wave (mmWave) networks minimizes the network interference leading to noise-limited networks in contrast with interference-limited ones. The medium access control (MAC) layer throughput and interference management strategies heavily depend on the noise-limited or interference-limited regime. Yet, these regimes are not considered in recent mmWave MAC layer designs, which can potentially have disastrous consequences on the communication performance. In this paper, we investigate the performance of cache-enabled MAC-based mmWave ad hoc networks, where randomly distributed nodes are supported by a cache. The ad hoc nodes are modeled as homogenous Poisson point processes. Specifically, we study the optimal content placement (or caching placement) at desirable mmWave nodes using a network model that accounts for uncertainties both in node locations and blockages. We propose a contention-based multimedia delivery protocol to avoid collisions among the concurrent transmissions. Subsequently, only the node with smallest back-off timer among its contenders is allowed to transmit. We then characterize the average success probability of content delivery. We also characterize the cache hit ratio probability, and transmission probability of this system under essential factors, such as blockages, node density, path loss, and caching parameters. [ABSTRACT FROM AUTHOR]

A large-scale content-centric mobile ad hoc network employing subpacketization is studied in which each mobile node having finite-size cache moves according to the reshuffling mobility model and requests a content object from the library independently at random according to the Zipf popularity distribution. Instead of assuming that one content object is transferred in a single time slot, we consider a more challenging scenario where the size of each content object is considerably large and thus only a subpacket of a file can be delivered during one time slot, which is motivated by a fast mobility scenario. Under our mobility model, we consider a single-hop-based content delivery and characterize the fundamental tradeoffs between throughput and delay. The order-optimal throughput–delay tradeoff is analyzed by presenting the following two content reception strategies: the sequential reception for uncoded caching and the random reception for maximum distance separable (MDS)-coded caching. We also perform numerical evaluation to validate our analytical results. In particular, we conduct performance comparisons between the uncoded caching and the MDS-coded caching strategies by identifying the regimes in which the performance difference between the two caching strategies becomes prominent with respect to system parameters such as the Zipf exponent and the number of subpackets. In addition, we extend our study to the random walk mobility scenario and show that our main results are essentially the same as those in the reshuffling mobility model. [ABSTRACT FROM AUTHOR]

Network coding is a promising technology proven to improve the performance of wireless networks. To successfully design a quality-of-service (QoS)-satisfied routing protocol with network coding, the bandwidth consumption of a coding host should be determined. Furthermore, coding opportunities should be increased to improve network capacity. Nevertheless, it is challenging to determine whether a host can be a coding host and to determine the bandwidth consumption of a coding host in a mobile ad hoc network (MANET). In this paper, we first present and define the coding conditions to identify a coding host. The bandwidth consumption of a coding host is then estimated under the contention-based wireless networks with a random access mechanism. Finally, we propose a bandwidth-satisfied and coding-aware multicast routing protocol (BCMRP). By taking into account the residual bandwidth of the carrier-sense neighbors of the forwarders, the proposed protocol can satisfy the bandwidth requirements of the requested flow and other ongoing flows. As a consequence of considering coding opportunities in multicast tree construction, the proposed multicast protocol can reduce the total bandwidth consumption. The simulation results show that BCMRP outperforms the prior multicast routing protocols in receiving ratio, admission ratio, and total bandwidth consumption. [ABSTRACT FROM AUTHOR]

In the vehicular ad hoc networks (VANETs), due to the high mobility of vehicles, the network parameters change frequently and the information that the sender maintains may outdate when it wants to transmit data packet to the receiver, so for improving the routing efficiency and reliability, we propose the probability prediction-based reliable and efficient opportunistic routing (PRO) algorithm for VANETs. The PRO routing algorithm can predict the variation of signal-to-interference-plus-noise ratio (SINR) and packet queue length (PQL) of the receiver. The prediction results are used to determine the utility of each relaying vehicle in the candidate set. The calculation of the vehicle’s utility is the weight-based algorithm, and the weights are the variances of SINR and PQL. The relaying priority of each relaying vehicle is determined by the value of its utility. By these innovations, the PRO can achieve better routing performance (such as the packet delivery ratio, the end-to-end delay, and the network throughput) than the SRPE, ExOR (street-centric), and greedy perimeter stateless routing algorithms. [ABSTRACT FROM AUTHOR]