Showing papers on "Ad hoc wireless distribution service published in 2017"

A Comparative Survey of VANET Clustering Techniques

Abstract: A vehicular ad hoc network (VANET) is a mobile ad hoc network in which network nodes are vehicles—most commonly road vehicles. VANETs present a unique range of challenges and opportunities for routing protocols due to the semi-organized nature of vehicular movements subject to the constraints of road geometry and rules, and the obstacles which limit physical connectivity in urban environments. In particular, the problems of routing protocol reliability and scalability across large urban VANETs are currently the subject of intense research. Clustering can be used to improve routing scalability and reliability in VANETs, as it results in the distributed formation of hierarchical network structures by grouping vehicles together based on correlated spatial distribution and relative velocity. In addition to the benefits to routing, these groups can serve as the foundation for accident or congestion detection, information dissemination and entertainment applications. This paper explores the design choices made in the development of clustering algorithms targeted at VANETs. It presents a taxonomy of the techniques applied to solve the problems of cluster head election, cluster affiliation, and cluster management, and identifies new directions and recent trends in the design of these algorithms. Additionally, methodologies for validating clustering performance are reviewed, and a key shortcoming—the lack of realistic vehicular channel modeling—is identified. The importance of a rigorous and standardized performance evaluation regime utilizing realistic vehicular channel models is demonstrated.

MoZo: A Moving Zone Based Routing Protocol Using Pure V2V Communication in VANETs

Abstract: Vehicular Ad-hoc Networks (VANETs) are an emerging field, whereby vehicle-to-vehicle communications can enable many new applications such as safety and entertainment services. Most VANET applications are enabled by different routing protocols. The design of such routing protocols, however, is quite challenging due to the dynamic nature of nodes (vehicles) in VANETs. To exploit the unique characteristics of VANET nodes, we design a moving-zone based architecture in which vehicles collaborate with one another to form dynamic moving zones so as to facilitate information dissemination. We propose a novel approach that introduces moving object modeling and indexing techniques from the theory of large moving object databases into the design of VANET routing protocols. The results of extensive simulation studies carried out on real road maps demonstrate the superiority of our approach compared with both clustering and non-clustering based routing protocols.

Heterogeneous ad hoc networks

Abstract: The Heterogeneous Ad Hoc Networks (HANETs) are important components of the Internet of things, which become an inevitable trend in the future researches and applications. In recent years, the ad hoc networks have been widely employed in many fields, especially in environment monitoring, weapon control, intelligent transportation, smart city and other domains. HANETs consist of wireless sensor networks, smart ad hoc networks, wireless fidelity networks, telecommunication networks, vehicular ad hoc networks, etc. The digital information and physical objects are integrated through appropriate communication methods, thus new applications and services are created. Different applications use the independent network structures, which form a heterogeneous network platform and increase operational complexity of communication between each other. This paper presents a typical architecture of the large-scale HANETs, and investigates research advances of the current key technologies. To address existing issues, we suggest some potential solutions to deal with the current challenges, such as self-organization, big data transmission, privacy protection, data fusion and processing for large-scale HANETs.

Adaptive Quality-of-Service-Based Routing for Vehicular Ad Hoc Networks With Ant Colony Optimization

Abstract: Developing highly efficient routing protocols for vehicular ad hoc networks (VANETs) is a challenging task, mainly due to the special characters of such networks: large-scale sizes, frequent link disconnections, and rapid topology changes. In this paper, we propose an adaptive quality-of-service (QoS)-based routing for VANETs called AQRV. This new routing protocol adaptively chooses the intersections through which data packets pass to reach the destination, and the selected route should satisfy the QoS constraints and fulfil the best QoS in terms of three metrics, namely connectivity probability, packet delivery ratio (PDR), and delay. To achieve the given objectives, we mathematically formulate the routing selection issue as a constrained optimization problem and propose an ant colony optimization (ACO)-based algorithm to solve this problem. In addition, a terminal intersection (TI) concept is presented to decrease routing exploration time and alleviate network congestion. Moreover, to decrease network overhead, we propose local QoS models (LQMs) to estimate real time and complete QoS of urban road segments. Simulation results validate our derived LQM models and show the effectiveness of AQRV.

Energy Efficient Multipath Routing Protocol for Mobile Ad-Hoc Network Using the Fitness Function

Abstract: Mobile ad hoc network (MANET) is a collection of wireless mobile nodes that dynamically form a temporary network without the reliance of any infrastructure or central administration Energy consumption is considered as one of the major limitations in MANET, as the mobile nodes do not possess permanent power supply and have to rely on batteries, thus reducing network lifetime as batteries get exhausted very quickly as nodes move and change their positions rapidly across MANET This paper highlights the energy consumption in MANET by applying the fitness function technique to optimize the energy consumption in ad hoc on demand multipath distance vector (AOMDV) routing protocol The proposed protocol is called AOMDV with the fitness function (FF-AOMDV) The fitness function is used to find the optimal path from source node to destination node to reduce the energy consumption in multipath routing The performance of the proposed FF-AOMDV protocol has been evaluated by using network simulator version 2, where the performance was compared with AOMDV and ad hoc on demand multipath routing with life maximization (AOMR-LM) protocols, the two most popular protocols proposed in this area The comparison was evaluated based on energy consumption, throughput, packet delivery ratio, end-to-end delay, network lifetime and routing overhead ratio performance metrics, varying the node speed, packet size, and simulation time The results clearly demonstrate that the proposed FF-AOMDV outperformed AOMDV and AOMR-LM under majority of the network performance metrics and parameters

Information-centric mobile ad hoc networks and content routing

Abstract: As the future Internet architecture, information centric networking(ICN) can also offer superior architectural support for mobile ad hoc networking. Therefore, information-centric mobile ad hoc networks (ICMANET), a new cross-cutting research area, is gradually forming. In the paper, we firstly introduce the current advances in ICN and analyze its development trends, and then interpret the formation of ICMANET and sketch an overview of it. Subsequently, we define a concept model for content routing and categorize the content routing into proactive, reactive and opportunistic types, and then detail the representative schemes. Finally, the existing issues are summarized. The goal of the work is to provide the references and guidelines for readers approaching study on the new area.

Privacy-Preserving Schemes for Ad Hoc Social Networks: A Survey

Abstract: We review the state of the art of privacy-preserving schemes for ad hoc social networks including mobile social networks (MSNs) and vehicular social networks (VSNs). Specifically, we select and examine in-detail 33 privacy-preserving schemes developed for or applied in the context of ad hoc social networks. Based on novel schemes published between 2008 and 2016, we survey privacy preservation models including location privacy, identity privacy, anonymity, traceability, interest privacy, backward privacy, and content oriented privacy. Recent significant attacks of leaking privacy, countermeasures, and game theoretic approaches in VSNs and MSNs are summarized in the form of tables. In addition, an overview of recommendations for further research is provided. With this survey, readers can acquire a thorough understanding of research trends in privacy-preserving schemes for ad hoc social networks.

Robust and Reliable Predictive Routing Strategy for Flying Ad-Hoc Networks

Abstract: Ever-increasing demands for portable and flexible communications have led to rapid growth in networking between unmanned aerial vehicles often referred to as flying ad-hoc networks (FANETs). Existing mobile ad hoc routing protocols are not suitable for FANETs due to high-speed mobility, environmental conditions, and terrain structures. In order to overcome such obstacles, we propose a combined omnidirectional and directional transmission scheme, together with dynamic angle adjustment. Our proposed scheme features hybrid use of unicasting and geocasting routing using location and trajectory information. The prediction of intermediate node location using 3-D estimation and directional transmission toward the predicted location, enabling a longer transmission range, allows keeping track of a changing topology, which ensures the robustness of our protocol. In addition, the reduction in path re-establishment and service disruption time to increase the path lifetime and successful packet transmissions ensures the reliability of our proposed strategy. Simulation results verify that our proposed scheme could significantly increase the performance of flying ad hoc networks.

A secure and trust based on-demand multipath routing scheme for self-organized mobile ad-hoc networks

Abstract: A mobile ad hoc network (MANET) is a self-configurable network connected by wireless links. This type of network is only suitable for provisional communication links as it is infrastructure-less and there is no centralized control. Providing QoS and security aware routing is a challenging task in this type of network due to dynamic topology and limited resources. The main purpose of secure and trust based on-demand multipath routing is to find trust based secure route from source to destination which will satisfy two or more end to end QoS constraints. In this paper, the standard ad hoc on-demand multi-path distance vector protocol is extended as the base routing protocol to evaluate this model. The proposed mesh based multipath routing scheme to discover all possible secure paths using secure adjacent position trust verification protocol and better link optimal path find by the Dolphin Echolocation Algorithm for efficient communication in MANET. The performance analysis and numerical results show that our proposed routing protocol produces better packet delivery ratio, reduced packet delay, reduced overheads and provide security against vulnerabilities and attacks.

Vehicular Ad Hoc Network (VANET): A Survey, Challenges, and Applications

Abstract: An ad hoc network consisting of vehicles has emerged as an interesting but challenging domain where a lot of new application may find their place. Though research in this field is on since last two decades, large-scale practical implementation still require some time. In this paper, a survey of current challenges and potential applications, incorporating medium access control schemes, routing approaches, hardware and spectrum issues, and security and privacy issues for VANETs, is presented.

Path Observation Based Physical Routing Protocol for Wireless Ad Hoc Networks

Abstract: Wireless ad hoc networks are going to be an emerged multi-hop communication exploit among mobiles to deliver data packets The special characteristics of Wireless network make the communication link between mobiles to be unreliable To handle high mobility and environmental obstacles, most of physical routing protocols do not consider stable links during packet transmission which lead to higher delay and packet dropping in network In this paper, we propose path observation based physical routing protocol named POPR for WANET The proposed routing protocol incorporates relative distance, direction and mid-range forwarder node with traffic density to forward the data toward destination in order to improve physical forwarding between and at the intersection Simulation results show that the proposed routing protocol performs better as compared to existing solutions

Geographical awareness hybrid routing protocol in Mobile Ad Hoc Networks

Abstract: This paper proposes a geographical awareness routing protocol based on a hybrid routing protocol, the Zone Routing Protocol (ZRP), in Mobile Ad Hoc Networks (MANETs). ZRP is created from combining proactive routing protocol and on-demand routing protocol; therefore, it inherits the advantages of both these routing protocols. The long delay time of the on-demand routing protocol and the huge routing overhead of the proactive routing approach are reduced in ZRP. However, ZRP still produces a large amount of redundant routing overhead in the route discovery process, which not only wastes energy but also increases the workload of the network, while limited bandwidth is a challenge for MANETs. To mitigate routing overhead, a geographical awareness approach that is applied to limit the discovered route area in ZRP is proposed and is called the Geographical awareness ZRP (GeoZRP). Simulation results confirm that the proposed algorithm alleviates routing overhead and end-to-end delay with only a slightly decrease in the packet delivery ratio.

Delay Analysis and Routing for Two-Dimensional VANETs Using Carry-and-Forward Mechanism

Abstract: For disconnected Vehicular Ad hoc NETworks (VANETs), the carry-and-forward mechanism is promising to ensure the delivery success ratio at the cost of a longer delay, as the vehicle travel speed is much lower than the wireless signal propagation speed. Estimating delay is critical to select the paths with low delay, and is also challenging given the random topology and high mobility, and the difficulty to let the message propagate along the selected path. In this paper, we first propose a simple yet effective propagation strategy considering bidirectional vehicle traffic for two-dimensional VANETs, so the opposite-direction vehicles can be used to accelerate the message propagation and the message can largely follow the selected path. Focusing on the propagation delay, an analytical framework is developed to quantify the expected path delay. Using the analytical model, a source node can apply the shortest-path algorithm to select the path with the lowest expected delay. Performance evaluation by simulation show that, when the vehicle density is uneven but known, the proposed Minimum Delay Routing Algorithm can achieve a substantial reduction in delay compared with the geocast-routing approach, and its performance is close to the flooding-based Epidemic algorithm, while our solution maintains only a single copy of the message.

A Survey of Ant Colony Optimization Based Routing Protocols for Mobile Ad Hoc Networks

Abstract: Developing highly efficient routing protocols for Mobile Ad hoc NETworks (MANETs) is a challenging task. In order to fulfill multiple routing requirements, such as low packet delay, high packet delivery rate, and effective adaptation to network topology changes with low control overhead, and so on, new ways to approximate solutions to the known NP-hard optimization problem of routing in MANETs have to be investigated. Swarm intelligence (SI)-inspired algorithms have attracted a lot of attention, because they can offer possible optimized solutions ensuring high robustness, flexibility, and low cost. Moreover, they can solve large-scale sophisticated problems without a centralized control entity. A successful example in the SI field is the ant colony optimization (ACO) meta-heuristic. It presents a common framework for approximating solutions to NP-hard optimization problems. ACO has been successfully applied to balance the various routing related requirements in dynamic MANETs. This paper presents a comprehensive survey and comparison of various ACO-based routing protocols in MANETs. The main contributions of this survey include: 1) introducing the ACO principles as applied in routing protocols for MANETs; 2) classifying ACO-based routing approaches reviewed in this paper into five main categories; 3) surveying and comparing the selected routing protocols from the perspective of design and simulation parameters; and 4) discussing open issues and future possible design directions of ACO-based routing protocols.

Wireless SDN mobile ad hoc network: From theory to practice

Abstract: A promising approach for dealing with the increasing demand of data traffic is the use of device-to-device (D2D) technologies, in particular when the destination can be reached directly, or though few retransmissions by peer devices. Thus, the cellular network can offload local traffic that is transmitted by an ad hoc network, e.g., a mobile ad hoc network (MANET), or a vehicular ad hoc network (VANET). The cellular base station can help coordinate all the devices in the ad hoc network by reusing the software tools developed for software-defined networks (SDNs), which divide the control and the data messages, transmitted in two separate interfaces. In this paper, we present a practical implementation of an SDN MANET, describe in detail the software components that we adopted, and provide a repository for all the new components that we developed. This work can be a starting point for the wireless networking community to design new testbeds with SDN capabilities that can have the advantages of D2D data transmissions and the flexibility of a centralized network management. In order to prove the feasibility of such a network, we also showcase the performance of the proposed network implemented in real devices, as compared to a distributed ad hoc network.

$i$CAR-II: Infrastructure-Based Connectivity Aware Routing in Vehicular Networks

Abstract: With the high demand of mobile Internet services, vehicular ad hoc networks (VANETs) have become a promising technology to enable vehicular Internet access. However, the development of a reliable routing protocol to route data packets between vehicles and infrastructure gateways is still a challenging task due to the high mobility and frequent changes of the network topology. The conventional position-based routing (PBR) in VANETs can neither guarantee the existence of a routing path between the source and the destination prior to the transmission nor provide connection duration information, which makes it unsuitable to route Internet packets. In this paper, we propose a novel infrastructure-based connectivity aware routing protocol called $i$ CAR-II that enables multihop vehicular applications, as well as mobile data offloading and Internet-based services. $i$ CAR-II consists of a number of algorithms triggered and run by vehicles to predict local network connectivity and update location servers with real-time network information, in order to construct a global network topology. By providing real-time connectivity awareness, $i$ CAR-II improves the routing performance in VANETs by dynamically selecting routing paths with guaranteed connectivity and reduced delivery delay. Detailed analysis and simulation-based evaluations of $i$ CAR-II demonstrate the validity of using VANETs for mobile data offloading and the significant improvement of VANETs performance in terms of packet delivery ratio and end to end delay.

Research and Simulation of Queue Management Algorithms in Ad Hoc Networks Under DDoS Attack

Abstract: Concentrating on the influence of DDoS applied to ad hoc networks, we introduced three classic queue management algorithms: Drop-Tail, random early detection (RED), and random exponential marking (REM). We analyzed and compared the defensive abilities of these algorithms applied to ad hoc networks with NS2 under DDoS attack. The results showed that active queue management algorithms, such as REM and RED, exhibited stronger defensive abilities than the passive queue management algorithm Drop-Tail under medium- and small-scale DDoS attacks; however, under large-scale DDoS attack, all three algorithms exhibited insufficient defensive capabilities. This means that other defense schemes, such as network detection, must be integrated into security schemes to defeat DDoS attacks.

A Reinforcement Learning-Based Data Storage Scheme for Vehicular Ad Hoc Networks

Abstract: Vehicular ad hoc networks (VANETs) have been attracting interest for their potential roles in intelligent transport systems (ITS). In order to enable distributed ITS, there is a need to maintain some information in the vehicular networks without the support of any infrastructure such as road side units. In this paper, we propose a protocol that can store the data in VANETs by transferring data to a new carrier (vehicle) before the current data carrier is moving out of a specified region. For the next data carrier node selection, the protocol employs fuzzy logic to evaluate instant reward by taking into account multiple metrics, specifically throughput, vehicle velocity, and bandwidth efficiency. In addition, a reinforcement learning-based algorithm is used to consider the future reward of a decision. For the data collection, the protocol uses a cluster-based forwarding approach to improve the efficiency of wireless resource utilization. We use theoretical analysis and computer simulations to evaluate the proposed protocol.

A Novel Approach for Efficient Usage of Intrusion Detection System in Mobile Ad Hoc Networks

Abstract: Mobile ad hoc networks (MANETs) are self-configuring infrastructureless dynamic wireless networks in which the nodes are resource constrained. Intrusion detection systems (IDSs) are used in MANETs to monitor activities to detect any intrusion in the otherwise vulnerable network. In this paper, we present efficient schemes for analyzing and optimizing the time duration for which the IDSs need to remain active in a MANET. A probabilistic model is proposed, which makes use of cooperation between IDSs among neighborhood nodes to reduce their individual active time. Typically, an IDS has to run all the time on every node to oversee network behavior. This can turn out to be a costly overhead for a battery-powered mobile device in terms of power and computational resources. Hence, in this work, our aim is to reduce the duration of active time of the IDSs without compromising their effectiveness. To validate our proposed approach, we model the interactions between IDSs as a multiplayer cooperative game in which the players have partially cooperative and partially conflicting goals. We theoretically analyze this game and support it with simulation results.

GDVAN: A New Greedy Behavior Attack Detection Algorithm for VANETs

Abstract: Vehicular Ad hoc Networks (VANETs), whose main objective is to provide road safety and enhance the driving conditions, are exposed to several kinds of attacks such as Denial of Service (DoS) attacks which affect the availability of the underlying services for legitimate users. We focus especially on the greedy behavior which has been extensively addressed in the literature for Wireless LAN (WLAN) and for Mobile Ad hoc Networks (MANETs). However, this attack has been much less studied in the context of VANETs. This is mainly because the detection of a greedy behavior is much more difficult for high mobility networks such as VANETs. In this paper, we propose a new detection approach called GDVAN (Greedy Detection for VANETs) for greedy behavior attacks in VANETs. The process to conduct the proposed method mainly consists of two phases, which are namely the suspicion phase and the decision phase. The suspicion phase is based on the linear regression mathematical concept while decision phase is based on a fuzzy logic decision scheme. The proposed algorithm not only detects the existence of a greedy behavior but also establishes a list of the potentially compromised nodes using three newly defined metrics. In addition to being passive, one of the major advantages of our technique is that it can be executed by any node of the network and does not require any modification of the IEEE 802.11p standard. Moreover, the practical effectiveness and efficiency of the proposed approach are corroborated through simulations and experiments.

AMCloud: Toward a Secure Autonomic Mobile Ad Hoc Cloud Computing System

Abstract: Cloud computing is a revolutionary paradigm to deliver computing resources, ranging from data storage/processing to software, as a service over the network, with the benefits of efficient resource utilization and improved manageability. The current popular cloud computing models encompass a cluster of expensive and dedicated machines to provide cloud computing services, incurring significant investment in capital outlay and ongoing costs. A more cost effective solution would be to exploit the capabilities of an ad hoc cloud which consists of a cloud of distributed and dynamically untapped local resources. The ad hoc cloud can be further classified into static and mobile clouds: an ad hoc static cloud harnesses the underutilized computing resources of general purpose machines, whereas an ad hoc mobile cloud harnesses the idle computing resources of mobile devices. However, the dynamic and distributed characteristics of ad hoc cloud introduce challenges in system management. In this article, we propose a generic em autonomic mobile cloud (AMCloud) management framework for automatic and efficient service/resource management of ad hoc cloud in both static and mobile modes. We then discuss in detail the possible security and privacy issues in ad hoc cloud computing. A general security architecture is developed to facilitate the study of prevention and defense approaches toward a secure autonomic cloud system. This article is expected to be useful for exploring future research activities to achieve an autonomic and secure ad hoc cloud computing system.

A micro-artificial bee colony based multicast routing in vehicular ad hoc networks

Abstract: Vehicular ad hoc networks (VANETs) have drawn great attention in wireless communications. Prompt and reliable vehicular communication is a must to provide a good service. Routing is the key problem in information transmission of VANETs. This paper studies quality of service (QoS) constrained multicast routing problem. This problem has been proved to be NP-complete problem, and swarm intelligence algorithms are more suitable than classical algorithms. A micro artificial bee colony (MABC) algorithm is proposed to deal with the problem. The QoS constraints include maximize network lifetime and minimizing delay cost. Multicast routing is abstracted to a continuous optimization problem. Then, it is linked with MABC. Numerical simulation is implemented on a traffic scenario with three instances. Results show that the MABC algorithm successfully attains the optimal routes. Moreover, the routing framework can be applied in real time given the network structure does not change too frequently.

Survey on UAANET Routing Protocols and Network Security Challenges

Abstract: UAV Ad hoc Networks (UAANETs) is a subset of the well-known mobile ad hoc network (MANET) paradigm. It refers to the deployment of a swarm of small Unmanned Aerial Vehicles (UAVs) and Ground Control Stations (GCS). These UAVs collaborate in order to relay data (command and control traffic and remotely sensed data) between each other and to the Ground Control Station (GCS). Compared to other types of ad hoc networks, UAANETs have some unique features and bring several major challenges to the research community. One of these is the design of UAANET routing protocol. It must establish an efficient route between UAVs and adjust in real time to the rapidly changing topology. It must also be secured to protect the integrity of the network against malicious attackers. Security of routing protocols has been widely investigated in wired networks and MANETs, but as far as we are aware, there is no previous research paper dealing with the security features of UAANET routing protocols. This paper focuses on characteristics of UAANETs and provides a review of the literature on associated routing protocols. We also highlight the analysis of the security features of these protocols. Security requirements, potential threats and countermeasures are all described.

Topology Configuration and Multihop Routing Protocol for Bluetooth Low Energy Networks

Abstract: This paper proposes a new cluster-based on-demand routing protocol to support multihop communication in Bluetooth low energy ad hoc networks The proposed scheme includes the topology configuration procedure, topology recovery scheme, and on-demand routing protocol The topology configuration procedure consists of node discovery, piconet configuration, and scatternet formation in a randomly distributed environment The proposed on-demand routing protocol is designed to minimize the number of route request messages by forwarding them to a master and relay nodes in each cluster during the route request procedure The performance evaluation shows that our proposed scheme substantially reduces energy consumption, which is the most critical issue on energy constrained networks

Multiple QoS Parameters-Based Routing for Civil Aeronautical Ad Hoc Networks

Abstract: Aeronautical ad hoc network (AANET) can be applied as in-flight communication systems to allow aircraft to communicate with the ground, in complement to other existing communication systems to support Internet of Things. However, the unique features of civil AANETs present a great challenge to provide efficient and reliable data delivery in such environments. In this paper, we propose a multiple quality of service parameters-based routing protocol (MQSPR), to improve the overall network performance for communication between aircraft and the ground. The proposed MQSPR integrates path availability period, residual path load capacity and path latency in route selection and presents a broadcast optimization scheme to minimize flooding. The primary aim of MQSPR is to maintain long link durations, achieve path load balancing and reduce end-to-end delay to satisfy the requirements of civil aviation communication services. The simulation scenario and real-world scenario are set up, respectively, and the experimental results show that the proposed MQSPR can achieve high ground connectivity while effectively increase the path durations, improve the packet delivery ratio and perform the path load balancing. In addition, the flexibility of MQSPR is demonstrated by considering weighting factors of path selection parameters.

Efficient location-based conditional privacy-preserving authentication scheme for vehicle ad hoc networks:

Abstract: Due to the real-time requirement of message in vehicle ad hoc networks, it is a challenge to design an authentication for vehicle ad hoc networks to achieve security, efficiency, and conditional pr...

Popularity-aware caching increases the capacity of wireless networks

Abstract: In wireless ad hoc networks, due to the interference between concurrent transmissions, the per node capacity generally decreases with the increasing number of nodes in the network. Caching can help improve the network capacity, as it shortens the content transmission distance and reduces the communication interference. However, current researches on the capacity of wireless ad hoc networks with caching generally assume that content popularity follows uniform distribution. They ignore the fact that contents in reality have skewed popularity, which may lead to totally different capacity results. In this paper, we evaluate how the distribution of the content popularity affects the network capacity, and derive different capacity scaling laws based on the skewness of the content popularity. Our results suggest that for wireless networks with caching, when contents have skewed popularity, increasing the number of nodes monotonically increases the per node capacity.