27,019 research outputs found
A secure and lightweight ad-hoc routing algorithm for personal networks
Over the past few years, there has been increasing interest in utilizing Personal Area Networks (PANs) to offer users innovative and personalized services. This interest is a consequence of the widespread use of mobile devices such as laptops, mobile phones, PDAs, digital cameras, wireless headsets, etc. to carry out a variety of user-centric tasks. The PAN itself is built upon an ad-hoc network where devices trust their neighbors to route their packets. The cooperative nature of ad-hoc networks allows malicious nodes to easily cripple the network by inserting false route information, replaying old messages, modifying messages of other nodes, etc. An applicable area still under research, and the focus of this paper, is secure routing protocols for ad-hoc networks. To achieve availability in the PAN, the routing protocol used must be robust against both dynamically changing topology and malicious attacks. However, the heterogeneous nature of Personal Network (PN) devices means that traditional security mechanisms are too resource intensive to be sufficient by themselves. This paper describes a new ad-hoc secure routing protocol for Personal Networks (PNs), suitable in a limited multi-hop scenario. This protocol is based on ADOV and relies on efficient cryptographic primitives to safeguard the security and privacy of PN users. Following that, a number of attacks in the area of ad-hoc networks are discussed, and it is shown that the new algorithm protects against multiple un-coordinated active attackers, in spite of compromised nodes in the network
Named data for mobile AdHoc networks
For the needs of future Internet, many researchers are proposing a paradigm shift towards a new information-centric approach. The Named-Data Networking (NDN) is one these proposals. Instead of addresses, packets should use only names, either expressing interest on specific information or naming the data content carried in. Applying the NDN model in a mobile ad-hoc network can greatly simplify the routing, since there is no need for global addresses and all nodes in the network can cache data packets.In this paper we propose a new strategy, called MultiPoint Relay (MPR) Strategy, targeted to minimize redundancy in Interest and Data packet forwarding in Ad-Hoc NDN networks. Interest packets sent by each node are only retransmitted by a subset of selected relay neighbors, as in OLSR. A time delay is also used to detect and prevent duplicated transmissions. Data packets can either be forwarded using the reverse path or by using similar delay technique in case of topology changes. The proposed strategy was implemented in ndnSIM simulator and compared with related works. Obtained results show that the strategy is effective in improving interest satisfaction ratio with reduced network overhead.This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT â Fundação para a CiĂȘncia e Tecnologia within the Project Scope: UID/CEC/00319/201
Survey on Data-Centric based Routing Protocols for Wireless Sensor Networks
The great concern for energy that grew with the technological advances in the
field of networks and especially in sensor network has triggered various
approaches and protocols that relate to sensor networks. In this context, the
routing protocols were of great interest. The aim of the present paper is to
discuss routing protocols for sensor networks. This paper will focus mainly on
the discussion of the data-centric approach (COUGAR, rumor, SPIN, flooding and
Gossiping), while shedding light on the other approaches occasionally. The
functions of the nodes will be discussed as well. The methodology selected for
this paper is based on a close description and discussion of the protocol. As a
conclusion, open research questions and limitations are proposed to the reader
at the end of this paper
Swarm-based Intelligent Routing (SIR) - a new approach for efficient routing in content centric delay tolerant networks
This paper introduces Swarm-based Intelligent Routing (SIR), a swarm intelligence based approach used for routing content in content centric Pocket Switched Networks. We first formalize the notion of optimal path in DTN, then introduce a swarm intelligence based routing protocol adapted to content centric DTN that use a publish/subscribe communication paradigm. The protocol works in a fully decentralized way in which nodes do not have any knowledge about the global topology. Nodes, via opportunistic contacts, update utility functions which synthesizes their spatio-temporal proximity from the content subscribers. This individual behavior applied by each node leads to the collective formation of gradient fields between content subscribers and content providers. Therefore, content routing simply sums up to follow the steepest slope along these gradient fields to reach subscribers who are located at the minima of the field. Via real traces analysis and simulation, we demonstrate the existence and relevance of such gradient field and show routing performance improvements when compared to classical routing protocols previously defined for information routing in DTN
Offloading Content with Self-organizing Mobile Fogs
Mobile users in an urban environment access content on the internet from
different locations. It is challenging for the current service providers to
cope with the increasing content demand from a large number of collocated
mobile users. In-network caching to offload content at nodes closer to users
alleviate the issue, though efficient cache management is required to find out
who should cache what, when and where in an urban environment, given nodes
limited computing, communication and caching resources. To address this, we
first define a novel relation between content popularity and availability in
the network and investigate a node's eligibility to cache content based on its
urban reachability. We then allow nodes to self-organize into mobile fogs to
increase the distributed cache and maximize content availability in a
cost-effective manner. However, to cater rational nodes, we propose a coalition
game for the nodes to offer a maximum "virtual cache" assuming a monetary
reward is paid to them by the service/content provider. Nodes are allowed to
merge into different spatio-temporal coalitions in order to increase the
distributed cache size at the network edge. Results obtained through
simulations using realistic urban mobility trace validate the performance of
our caching system showing a ratio of 60-85% of cache hits compared to the
30-40% obtained by the existing schemes and 10% in case of no coalition
Social-aware Forwarding in Opportunistic Wireless Networks: Content Awareness or Obliviousness?
With the current host-based Internet architecture, networking faces
limitations in dynamic scenarios, due mostly to host mobility. The ICN paradigm
mitigates such problems by releasing the need to have an end-to-end transport
session established during the life time of the data transfer. Moreover, the
ICN concept solves the mismatch between the Internet architecture and the way
users would like to use it: currently a user needs to know the topological
location of the hosts involved in the communication when he/she just wants to
get the data, independently of its location. Most of the research efforts aim
to come up with a stable ICN architecture in fixed networks, with few examples
in ad-hoc and vehicular networks. However, the Internet is becoming more
pervasive with powerful personal mobile devices that allow users to form
dynamic networks in which content may be exchanged at all times and with low
cost. Such pervasive wireless networks suffer with different levels of
disruption given user mobility, physical obstacles, lack of cooperation,
intermittent connectivity, among others. This paper discusses the combination
of content knowledge (e.g., type and interested parties) and social awareness
within opportunistic networking as to drive the deployment of ICN solutions in
disruptive networking scenarios. With this goal in mind, we go over few
examples of social-aware content-based opportunistic networking proposals that
consider social awareness to allow content dissemination independently of the
level of network disruption. To show how much content knowledge can improve
social-based solutions, we illustrate by means of simulation some
content-oblivious/oriented proposals in scenarios based on synthetic mobility
patterns and real human traces.Comment: 7 pages, 6 figure
Content Delivery Latency of Caching Strategies for Information-Centric IoT
In-network caching is a central aspect of Information-Centric Networking
(ICN). It enables the rapid distribution of content across the network,
alleviating strain on content producers and reducing content delivery
latencies. ICN has emerged as a promising candidate for use in the Internet of
Things (IoT). However, IoT devices operate under severe constraints, most
notably limited memory. This means that nodes cannot indiscriminately cache all
content; instead, there is a need for a caching strategy that decides what
content to cache. Furthermore, many applications in the IoT space are
timesensitive; therefore, finding a caching strategy that minimises the latency
between content request and delivery is desirable. In this paper, we evaluate a
number of ICN caching strategies in regards to latency and hop count reduction
using IoT devices in a physical testbed. We find that the topology of the
network, and thus the routing algorithm used to generate forwarding
information, has a significant impact on the performance of a given caching
strategy. To the best of our knowledge, this is the first study that focuses on
latency effects in ICN-IoT caching while using real IoT hardware, and the first
to explicitly discuss the link between routing algorithm, network topology, and
caching effects.Comment: 10 pages, 9 figures, journal pape
- âŠ