scholarly journals A Dual-Connectivity Mobility Link Service for Producer Mobility in the Named Data Networking

Sensors ◽  
2020 ◽  
Vol 20 (17) ◽  
pp. 4859
Author(s):  
Ju-Ho Choi ◽  
Jung-Hwan Cha ◽  
Youn-Hee Han ◽  
Sung-Gi Min
Keyword(s):  
Routing Protocol ◽  
Named Data Networking ◽  
Data Link ◽  
Ip Address ◽  
Link State ◽  
Dual Connectivity ◽  
Soft Handover ◽  
Link Service ◽  
Access Router ◽  
Data Networking

With the exponential growth of Cyber-Physical Systems (CPSs) technologies, the Internet of Things (IoT) infrastructure has evolved from built-in static infrastructure to a flexible structure applicable to various mobile environments. In this Internet of Mobile Things (IoMT) environment, each IoT device could operate simultaneously as a provider and consumer of information, and could provide new services through the exchange of such information. Named Data Networking (NDN), which could request data by content name rather than location (IP address), is suitable for such mobile IoT environments. However, in the current Named Data Networking (NDN) specification, producer mobility is one of the major problems in need of remedy. Previously proposed schemes for producer mobility use an anchor to hide the producer’s movement from consumers. As a result, they require a special anchor node and a signaling procedure to track the current locations of contents. A few anchorless schemes have also been proposed, but they still require mobility signaling and all NDN routers on the signaling path must understand the meaning of the signaling. We therefore propose an anchorless producer mobility scheme for the NDN. This scheme uses a dual-connectivity strategy that can be expressed as a soft handover. Whenever a producer changes its NDN Access Router (NAR), the new mobility link service located on the mobile producer’s old NDN face repairs the old link so that the connectivity with the pNAR can be maintained for a while. The old NDN face is removed after the new location information on the contents of the producer is disseminated over the NDN network by the Named-data Link State Routing Protocol (NLSR) routing protocol at the nNAR. The new mobility link service decouples connection and transaction to hide the collapse of the link. Therefore, the NDN’s mobility procedure could be simplified as the handover is defined as transaction completion as opposed to a breakdown of links. The proposed scheme prevents the routing information from being abruptly outdated due to producer mobility. Our simulation results show seamless handover when the producer changes its default access router.

TSRN: A Tabu Search-Based Routing Protocol for Named Data Networking

2018 ◽  
Vol 101 (3) ◽  
pp. 1411-1428
Author(s):  
Zeinab Shariat ◽  
Ali Movaghar ◽  
Mehdi Hosseinzadeh
Keyword(s):  
Tabu Search ◽  
Routing Protocol ◽  
Named Data Networking ◽  
Data Networking

scholarly journals Cluster-Based Device Mobility Management in Named Data Networking for Vehicular Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Moneeb Gohar ◽  
Naveed Khan ◽  
Awais Ahmad ◽  
Muhammad Najam-Ul-Islam ◽  
Shahzad Sarwar ◽  
...  
Keyword(s):  
Mobility Management ◽  
Vehicular Networks ◽  
Cluster Head ◽  
Emerging Technology ◽  
Named Data Networking ◽  
Internet Architecture ◽  
Management Scheme ◽  
Hourglass Model ◽  
Access Router ◽  
Data Networking

Named data networking (NDN) is an emerging technology. It was designed to eliminate the dependency of IP addresses in the hourglass model. Mobility is a key concern of the modern Internet architecture, even though the NDN architecture has solved the consumer mobility. That is, the consumer can rerequest the desired data contents, while the producer mobility remains as an issue in the NDN architecture. This paper focuses on the issue of producer mobility and proposes the cluster-based device mobility management scheme, which uses the cluster heads to solve the producer mobility issue in NDN. In the proposed scheme, a cluster head has all information of its attached devices. A cluster head updates the routes, when a device moves to the new access router by sending all the attachment information. The proposed scheme is evaluated and compared with the existing scheme by using the ndnSIM simulation. From the results, we see that the proposed scheme can decrease the numbers of interest packets in the network, compared with the existing scheme.

scholarly journals Interest Forwarding in Named Data Networking Using Reinforcement Learning

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3354 ◽  
Author(s):  
Olumide Akinwande
Keyword(s):  
Neural Network ◽  
Reinforcement Learning ◽  
Routing Protocol ◽  
Named Data Networking ◽  
Delivery Performance ◽  
Efficient Performance ◽  
Random Neural Network ◽  
Key Features ◽  
With Memory ◽  
Data Networking

In-network caching is one of the key features of information-centric networks (ICN), where forwarding entities in a network are equipped with memory with which they can temporarily store contents and satisfy en route requests. Exploiting in-network caching, therefore, presents the challenge of efficiently coordinating the forwarding of requests with the volatile cache states at the routers. In this paper, we address information-centric networks and consider in-network caching specifically for Named Data Networking (NDN) architectures. Our proposal departs from the forwarding algorithms which primarily use links that have been selected by the routing protocol for probing and forwarding. We propose a novel adaptive forwarding strategy using reinforcement learning with the random neural network (NDNFS-RLRNN), which leverages the routing information and actively seeks new delivery paths in a controlled way. Our simulations show that NDNFS-RLRNN achieves better delivery performance than a strategy that uses fixed paths from the routing layer and a more efficient performance than a strategy that retrieves contents from the nearest caches by flooding requests.

scholarly journals Mobility Support in Vehicular Named-Data Networking

2019 ◽  
Author(s):  
João do Monte Duarte ◽  
Torsten Braun ◽  
Leandro Villas
Keyword(s):  
Routing Protocol ◽  
Communication Model ◽  
Network Partitioning ◽  
Named Data Networking ◽  
Application Performance ◽  
Mobility Support ◽  
Hoc Networks ◽  
Reverse Path ◽  
Data Networking

In this thesis, Vehicular Named-Data Networking (VNDN) refers tothe use of the Named-Data Networking communication model over VehicularAd-hoc Networks. With the aim of addressing the problems caused by mobility to efficiently support VNDN communications in highly mobile traffic scenarios, various contributions were proposed in the scope of this thesis. These contributions include a routing protocol, able to address VNDN problems such as broadcast storms and message redundancy, as well as solutions to enable content advertisements and for addressing the problems caused by reverse path partitioning, network partitioning, and source mobility. Finally, all the proposed solutions are integrated into a single framework called MobiVNDN. The evaluation results show that the proposed solutions are efficient and scalable, providing high VNDN application performance even in complex traffic scenarios.

A learning automata and clustering-based routing protocol for named data networking

2016 ◽  
Vol 65 (1) ◽  
pp. 9-29 ◽  
Author(s):  
Zeinab Shariat ◽  
Ali Movaghar ◽  
Mehdi Hoseinzadeh
Keyword(s):  
Routing Protocol ◽  
Learning Automata ◽  
Named Data Networking ◽  
Data Networking

scholarly journals On Sharing an FIB Table in Named Data Networking

2019 ◽  
Vol 9 (15) ◽  
pp. 3178
Author(s):  
Ju Hyoung Mun ◽  
Hyesook Lim
Keyword(s):  
Network Connectivity ◽  
Bloom Filter ◽  
Bloom Filters ◽  
Memory Requirement ◽  
Named Data Networking ◽  
Link State ◽  
Network Topologies ◽  
Forwarding Information Base ◽  
Forwarding Engine ◽  
Data Networking

As a new networking paradigm, Named Data Networking (NDN) technology focuses on contents, and content names are used as identifiers for forwarding and routing, as opposed to IP addresses in the current Internet. NDN routers forward packets by looking up a Forwarding Information Base (FIB), each entry of which has a name prefix and output faces. An FIB should have the information to forward Interest packets for any contents. Hence, the size of an FIB would be excessively large in NDN routers, and the traffic for building an FIB would be significant. In order to reduce the traffic associated with building an FIB table and memory requirement for storing an FIB table, this paper proposes a new efficient method which combines the routing of network connectivity and the building of a forwarding engine using Bloom filters. We propose to share the summary of an FIB using a Bloom filter rather than to advertise each name prefix. The forwarding engine of the proposed scheme is a combination of Bloom filters, and hence the memory requirement of the forwarding can be much smaller than the regular FIB. Simulation results using ndnSIM under real network topologies show that the proposed method can achieve nearly the same performance as the conventional link state algorithm with 6–8% of the traffic for distributing the connectivity information and 5–9% of the memory consumption.

Multipoint Relay Selections with QoS Support in Link State Routing Protocol for Multi-Hop Wireless Networks

2009 ◽  
Vol E92-A (9) ◽  
pp. 2218-2226
Author(s):  
Takeaki KOGA ◽  
Shigeaki TAGASHIRA ◽  
Teruaki KITASUKA ◽  
Tsuneo NAKANISHI ◽  
Akira FUKUDA
Keyword(s):  
Wireless Networks ◽  
Routing Protocol ◽  
Link State
Sign in / Sign up

Export Citation Format

Share Document