scholarly journals Scaling Performance Analysis and Optimization Based on the Node Spatial Distribution in Mobile Content-Centric Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Jiajie Ren ◽  
Demin Li ◽  
Lei Zhang ◽  
Guanglin Zhang

Content-centric networks (CCNs) have become a promising technology for relieving the increasing wireless traffic demands. In this paper, we explore the scaling performance of mobile content-centric networks based on the nonuniform spatial distribution of nodes, where each node moves around its own home point and requests the desired content according to a Zipf distribution. We assume each mobile node is equipped with a finite local cache, which is applied to cache contents following a static cache allocation scheme. According to the nonuniform spatial distribution of cache-enabled nodes, we introduce two kinds of clustered models, i.e., the clustered grid model and the clustered random model. In each clustered model, we analyze throughput and delay performance when the number of nodes goes infinity by means of the proposed cell-partition scheduling scheme and the distributed multihop routing scheme. We show that the node mobility degree and the clustering behavior play the fundamental roles in the aforementioned asymptotic performance. Finally, we study the optimal cache allocation problem in the two kinds of clustered models. Our findings provide a guidance for developing the optimal caching scheme. We further perform the numerical simulations to validate the theoretical scaling laws.

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1705
Author(s):  
Yuanhang Li ◽  
Jinlin Wang ◽  
Rui Han

The Information-Centric Network (ICN) is one of the most influential future network architectures and in-network caching in ICN brings some helpful features, such as low latency and mobility support. How to allocate cache capacity and place content properly will greatly influence the performance of ICN. This paper focuses on the cache allocation problem and content placement problem under the given cache space budget. Firstly, a lightweight allocation method utilizing information of both topology and content popularity is proposed, to allocate cache space and get the expected number of copies of popular content. The expected number of copies represents the number of content copies placed in the topology. Then, an on-path caching scheme based on the expected number of copies is proposed to handle the content placement problem. In the cache allocation scenario, the lightweight allocation method performs better than other baseline methods. In the content placement scenario, Leave Copy Down (LCD) based on the expected number of copies performs the second-best and is very close to Optimal Content Placement (OCP).


2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Qinghua Chen ◽  
Shengbao Zheng ◽  
Zhengqiu Weng

Mobile crowd sensing has been a very important paradigm for collecting sensing data from a large number of mobile nodes dispersed over a wide area. Although it provides a powerful means for sensing data collection, mobile nodes are subject to privacy leakage risks since the sensing data from a mobile node may contain sensitive information about the sensor node such as physical locations. Therefore, it is essential for mobile crowd sensing to have a privacy preserving scheme to protect the privacy of mobile nodes. A number of approaches have been proposed for preserving node privacy in mobile crowd sensing. Many of the existing approaches manipulate the sensing data so that attackers could not obtain the privacy-sensitive data. The main drawback of these approaches is that the manipulated data have a lower utility in real-world applications. In this paper, we propose an approach called P3 to preserve the privacy of the mobile nodes in a mobile crowd sensing system, leveraging node mobility. In essence, a mobile node determines a routing path that consists of a sequence of intermediate mobile nodes and then forwards the sensing data along the routing path. By using asymmetric encryptions, it is ensured that a malicious node is not able to determine the source nodes by tracing back along the path. With our approach, upper-layer applications are able to access the original sensing data from mobile nodes, while the privacy of the mobile node is not compromised. Our theoretical analysis shows that the proposed approach achieves a high level of privacy preserving capability. The simulation results also show that the proposed approach incurs only modest overhead.


2019 ◽  
Author(s):  
Vinícius De Figueiredo Marques ◽  
Janine Kniess

Low Power and Lossy Networks (LLNs) is a common type of wireless network in IoT applications. LLN communication patterns usually requires an efficient routing protocol. The IPv6 Routing Protocol for Low-Power and Lossy Network (RPL) is considered to be a possible standard routing protocol for LLNs. However, RPL was developed for static networks and node mobility decreases RPL overall performance. These are the purposes of the Mobility Aware RPL (MARPL), presented in this paper. MARPL provides a mobility detection mechanism based on neighbor variability. Performance evaluation results on the Cooja Simulator confirm the effectiveness of MARPL regarding link disconnection prevention, packet delivery rate and fast mobile node topology reconnection with low overhead impact when compared to other protocols.


Author(s):  
A. Sangeetha ◽  
T. Rajendran

As the advent of new technologies grows, the deployment of mobile ad hoc networks (MANET) becomes increasingly popular in many application areas. In addition, all the nodes in MANET are battery operated and the node mobility affects the path stability and creates excessive traffic leads to higher utilization of energy, data loss which degrades the performance of routing. So, in this paper we propose Levenberg–Marquardt logistic deep neural learning based energy efficient and load balanced routing (LLDNL-EELBR) which is a machine learning method to deeply analyze the mobile nodes to calculate residual load and energy and it also uses logistic activation function to select the mobile node having higher residual energy and residual load to route the data packet. Experimental evaluations of three methods (LLDNL-EELBR, multipath battery and mobility-aware routing scheme (MBMA-OLSR) and opportunistic routing with gradient forwarding for MANETs (ORGMA)) were done and the result reveals that LLDNL-EELBR method is able to increase the through put and minimizes the delay and energy consumption in MANET when compared to works under consideration.<br /><div> </div>


Author(s):  
Pak Satanasaowapak ◽  
Chatchai Khunboa

The Internet of Thing has gained interested to use for daily devices to industrial applications. Mission-critical applications such as connected car and healthcare services require real-time communications and mobility support. The 6LoWPAN protocol and IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) have become the standard for the IoT. However, the RPL protocol is unable to support the application requirement causing from the high network overhead, long message latency and high packet loss rate due to mobility. Thus, in this paper, we propose a new cost metric combining the number of hops, RSSI values, and the summation of delay to enhance RPL mobility. In addition, we define the movement notification for the mobile node to activate mobile detection and parent selection processes. Finally, we presented a comparative study of the improved RPL protocols in terms of packet delivery ratio, end-to-end delay and the number of control messages. The result shows that improved RPL protocol with the new cost metrics provides a high packet delivery ratio and offers a low message latency.


2015 ◽  
Vol 2015 ◽  
pp. 1-14
Author(s):  
Ananthi Jebaseeli Samuelraj ◽  
Sundararajan Jayapal

Proxy Mobile IPV6 (PMIPV6) is a network based mobility management protocol which supports node’s mobility without the contribution from the respective mobile node. PMIPV6 is initially designed to support individual node mobility and it should be enhanced to support mobile network movement. NEMO-BSP is an existing protocol to support network mobility (NEMO) in PMIPV6 network. Due to the underlying differences in basic protocols, NEMO-BSP cannot be directly applied to PMIPV6 network. Mobility management signaling and data structures used for individual node’s mobility should be modified to support group nodes’ mobility management efficiently. Though a lot of research work is in progress to implement mobile network movement in PMIPV6, it is not yet standardized and each suffers with different shortcomings. This research work proposes modifications in NEMO-BSP and PMIPV6 to achieve NEMO support in PMIPV6. It mainly concentrates on optimizing the number and size of mobility signaling exchanged while mobile network or mobile network node changes its access point.


2014 ◽  
Vol 556-562 ◽  
pp. 5926-5930 ◽  
Author(s):  
X.M. Gao ◽  
J.H. Xia

In mobile ad hoc networks, node mobility causes frequent link failures, thus invalidating the routes containing those links. Once a link is detected broken, an alternate route has to be discovered. That will impose significant affect on the route stability and the overall performance of the network. We suggest discovering contained stable links routes based on fuzzy control. When mobile node S wishes to send a packet to a destination mobile node D, node S transmits a ROUTE REQUEST (RREQ) message which contains its velocity and direction as a single local broadcast packet. When one mobile node i (it is not D) receiving RREQ, it first gets the velocity and direction of previous node, then estimates the link stability between two nodes based on fuzzy logic. When the link stability come up to a certain standard, node i adds its address to RREQ and forward it, otherwise, discard it. Simulations show that the proposed PLSR (Mobility Prediction-based Link Stability Routing Protocol) outperforms DVMP (Distance Vector protocol with Mobility Prediction that uses GPS) [8].


2011 ◽  
Vol 216 ◽  
pp. 621-624
Author(s):  
Xin Lian Zhou ◽  
Jian Bo Xu

This paper first proposed an energy-efficient distributed clustering technology for mobile sensor nodes and sink node mobility, select the higher residual energy and the nearest node from fixed nodes as cluster heads responsible for collecting sensed data, and all the fixed nodes form routing backbone to forward data, both can save energy and avoid cluster head away. Then, proposed a cross-layer scheduling mechanism to avoid the impact of mobile node and meet expectations cluster coverage. With energy-efficient clustering technology, efficient network topology control technology and mobile sink node, the data collection algorithm MSDBG, not only has considered mobility of nodes and energy saving, but also has achieved prolonging network lifetime.


Sensors ◽  
2020 ◽  
Vol 20 (19) ◽  
pp. 5694
Author(s):  
Rogério Casagrande ◽  
Ricardo Moraes ◽  
Carlos Montez ◽  
Francisco Vasques ◽  
Erico Leão

Node mobility in multi-hop communication environments is an important feature of Wireless Sensor Network (WSN)-based monitoring systems. It allows nodes to have freedom of movement, without being restricted to a single-hop communication range. In IEEE 802.15.4 WSNs, nodes are only able to transfer data messages after completing a connection with a coordinator through an association mechanism. Within this context, a handover procedure needs to be executed by a mobile node whenever there is a disconnection from a coordinator and the establishment of a connection to another one. Many applications, such as those found in health monitoring systems, strongly need support for node mobility without loss of data during the handover. However, it has been observed that the time required to execute the handover procedure is one of the main reasons why IEEE 802.15.4 cannot fully support mobility. This paper proposes an improvement to this procedure using a set of combined strategies, such as anticipation of both the handover mechanism and the scan phase enhancement. Simulations show that it is possible to reduce latency during the association and re-association processes, making it feasible to develop WSN-based distributed monitoring systems with mobile nodes and stringent time constraints.


Sign in / Sign up

Export Citation Format

Share Document