228 research outputs found
Geodupa - a geography-driven partial membership algorithm
Trabalho apresentado no ùmbito do Mestrado em Engenharia Informåtica, como requisito parcial para obtenção do grau de Mestre em Engenharia InformåticaThe popularity boost of mobile devices, as well as their technological advances, are fostering the development of new application paradigms. One of which, designated as Participatory Sensing, is embedded with a strong community philosophy, in the sense that it relies in users
sharing and contributing with data. By gathering, processing and sharing contextual data, new and interesting applications are possible, such as the monitoring of vehicle traffic or road conservation.
To enable these applications, it is important to have an underlying communication
infrastructure that allows users to exchange information efficiently.
Users of Participatory Sensing applications deal, most frequently, with information related to their close physical surroundings. Based on this premise, this dissertation presents a decentralized
membership substrate that restrains node visibility to geographical neighborhoods as a
way to improve communication performance. To that end, the proposed algorithm divides the
user network into two hierarchical levels. The higher-level is managed by an existing one-hop DHT and its participants are organized to exploit the partitioning of the physical space. The lower-level is composed by the groups of nodes associated to each region. An experimental evaluation has revealed that it is capable of achieving lower communication costs when compared to a full-membership solution
Analysis and Ad-hoc Networking Solutions for Cooperative Relaying Systems
Users of mobile networks are increasingly demanding higher data rates from
their service providers. To cater to this demand, various signal processing
and networking algorithms have been proposed. Amongst them the multiple
input multiple output (MIMO) scheme of wireless communications is one of
the most promising options. However, due to certain physical restrictions,
e.g., size, it is not possible for many devices to have multiple antennas
on them. Also, most of the devices currently in use are single-antenna
devices. Such devices can make use of the MIMO scheme by employing
cooperative MIMO methods. This involves nearby nodes utilizing the antennas
of each other to form virtual antenna arrays (VAAs). Nodes with limited
communication ranges can further employ multi-hopping to be able to
communicate with far away nodes. However, an ad-hoc communications scheme
with cooperative MIMO multi-hopping can be challenging to implement because
of its de-centralized nature and lack of a centralized controling entity
such as a base-station. This thesis looks at methods to alleviate the
problems faced by such networks.In the first part of this thesis, we look,
analytically, at the relaying scheme under consideration and derive closed
form expressions for certain performance measures (signal to noise ratio
(SNR), symbol error rate (SER), bit error rate (BER), and capacity) for the
co-located and cooperative multiple antenna schemes in different relaying
configurations (amplify-and-forward and decode-and-forward) and different
antenna configurations (single input single output (SISO), single input
multiple output (SIMO) and MIMO). These expressions show the importance of
reducing the number of hops in multi-hop communications to achieve a better
performance. We can also see the impact of different antenna configurations
and different transmit powers on the number of hops through these
simplified expressions.We also look at the impact of synchronization errors
on the cooperative MIMO communications scheme and derive a lower bound of
the SINR and an expression for the BER in the high SNR regime. These
expressions can help the network designers to ensure that the quality of
service (QoS) is satisfied even in the worst-case scenarios. In the second
part of the thesis we present some algorithms developed by us to help the
set-up and functioning of cluster-based ad-hoc networks that employ
cooperative relaying. We present a clustering algorithm that takes into
account the battery status of nodes in order to ensure a longer network
life-time. We also present a routing mechanism that is tailored for use in
cooperative MIMO multi-hop relaying. The benefits of both schemes are shown
through simulations.A method to handle data in ad-hoc networks using
distributed hash tables (DHTs) is also presented. Moreover, we also present
a physical layer security mechanism for multi-hop relaying. We also analyze
the physical layer security mechanism for the cooperative MIMO scheme. This
analysis shows that the cooperative MIMO scheme is more beneficial than
co-located MIMO in terms of the information theoretic limits of the
physical layer security.ï»żNutzer mobiler Netzwerke fordern zunehmend höhere Datenraten von ihren
Dienstleistern. Um diesem Bedarf gerecht zu werden, wurden verschiedene
Signalverarbeitungsalgorithmen entwickelt. Dabei ist das "Multiple input
multiple output" (MIMO)-Verfahren fĂŒr die drahtlose Kommunikation eine der
vielversprechendsten Techniken. Jedoch ist aufgrund bestimmter
physikalischer BeschrĂ€nkungen, wie zum Beispiel die BaugröĂe, die
Verwendung von mehreren Antennen fĂŒr viele EndgerĂ€te nicht möglich. Dennoch
können solche Ein-Antennen-GerÀte durch den Einsatz kooperativer
MIMO-Verfahren von den Vorteilen des MIMO-Prinzips profitieren.
Dabei schlieĂen sich naheliegende Knoten zusammen um ein sogenanntes
virtuelles Antennen-Array zu bilden. Weiterhin können Knoten mit
beschrÀnktem Kommunikationsbereich durch mehrere Hops mit weiter
entfernten Knoten kommunizieren. Allerdings stellt der Aufbau eines solchen
Ad-hoc-Netzwerks mit kooperativen MIMO-FÀhigkeiten aufgrund der dezentralen
Natur und das Fehlen einer zentral-steuernden Einheit, wie einer
Basisstation, eine groĂe Herausforderung dar. Diese Arbeit befasst sich mit
den Problemstellungen dieser Netzwerke und bietet verschiedene
LösungsansÀtze.Im ersten Teil dieser Arbeit werden analytisch in
sich geschlossene AusdrĂŒcke fĂŒr ein kooperatives
Relaying-System bezĂŒglicher verschiedener Metriken, wie das
Signal-Rausch-VerhÀltnis, die Symbolfehlerrate, die Bitfehlerrate und die
KapazitÀt, hergeleitet. Dabei werden die "Amplify-and forward" und
"Decode-and-forward" Relaying-Protokolle, sowie unterschiedliche
Mehrantennen-Konfigurationen, wie "Single input single output" (SISO),
"Single input multiple output" (SIMO) und MIMO betrachtet. Diese AusdrĂŒcke
zeigen die Bedeutung der Reduzierung der Hop-Anzahl in Mehr-Hop-Systemen,
um eine höhere Leistung zu erzielen. Zudem werden die Auswirkungen
verschiedener Antennen-Konfigurationen und Sendeleistungen auf die Anzahl
der Hops analysiert.  Weiterhin wird der Einfluss von
Synchronisationsfehlern auf das kooperative MIMO-Verfahren herausgestellt
und daraus eine untere Grenze fĂŒr das
Signal-zu-Interferenz-und-Rausch-VerhĂ€ltnis, sowie ein Ausdruck fĂŒr die
Bitfehlerrate bei hohem Signal-Rausch-VerhÀltnis entwickelt.
Diese ZusammenhÀnge sollen Netzwerk-Designern helfen die QualitÀt des
Services auch in den Worst-Case-Szenarien sicherzustellen.
Im zweiten Teil der Arbeit werden einige innovative
Algorithmen vorgestellt, die die Einrichtung und die Funktionsweise von
Cluster-basierten Ad-hoc-Netzwerken, die kooperative Relays verwenden,
erleichtern und verbessern. Darunter befinden sich ein
Clustering-Algorithmus, der den Batteriestatus der Knoten berĂŒcksichtigt,
um eine lÀngere Lebensdauer des Netzwerks zu gewÀhrleisten und ein
Routing-Mechanismus, der auf den Einsatz in kooperativen MIMO
Mehr-Hop-Systemen zugeschnitten ist. Die Vorteile beider Algorithmen werden
durch Simulationen veranschaulicht.
Eine Methode, die Daten in Ad-hoc-Netzwerken mit verteilten Hash-Tabellen
behandelt wird ebenfalls vorgestellt. DarĂŒber hinaus wird auch
ein Sicherheitsmechanismus fĂŒr die physikalische Schicht in
Multi-Hop-Systemen und kooperativen MIMO-Systemen prÀsentiert. Eine Analyse
zeigt, dass das kooperative MIMO-Verfahren deutliche Vorteile gegenĂŒber dem
konventionellen MIMO-Verfahren hinsichtlich der informationstheoretischen
Grenzen der Sicherheit auf der physikalischen Schicht aufweist
Structured Peer-to-Peer Overlay Deployment on MANET: A Survey
There are many common characteristics between Peer-to-Peer (P2P) overlay networks and Mobile Ad-hoc Networks (MANET). Self-organization, decentralization, dynamicity and changing topology are the most shared features. Furthermore, when used together, the two approaches complement each other. P2P overlays provide data storage/retrieval functionality, and their routing information can complement that of MANET. MANET provides wireless connectivity between clients without depending on any pre-existing infrastructure. The aim of this paper is to survey current P2P over MANET systems. Specifically, this paper focuses on and investigates structured P2P over MANET. Overall, more than thirty distinct approaches have been classified into groups and introduced in tables providing a structured overview of the area. The survey addresses the identified approaches in terms of P2P systems, MANET underlay systems and the performance of the reviewed systems
NEURON: Enabling Autonomicity in Wireless Sensor Networks
Future Wireless Sensor Networks (WSNs) will be ubiquitous, large-scale networks interconnected with the existing IP infrastructure. Autonomic functionalities have to be designed in order to reduce the complexity of their operation and management, and support the dissemination of knowledge within a WSN. In this paper a novel protocol for energy efficient deployment, clustering and routing in WSNs is proposed that focuses on the incorporation of autonomic functionalities in the existing approaches. The design of the protocol facilitates the design of innovative applications and services that are based on overlay topologies created through cooperation among the sensor nodes
Peer-to-Peer Networks and Computation: Current Trends and Future Perspectives
This research papers examines the state-of-the-art in the area of P2P networks/computation. It attempts to identify the challenges that confront the community of P2P researchers and developers, which need to be addressed before the potential of P2P-based systems, can be effectively realized beyond content distribution and file-sharing applications to build real-world, intelligent and commercial software systems. Future perspectives and some thoughts on the evolution of P2P-based systems are also provided
Design and implementation of the node identity internetworking architecture
The Internet Protocol (IP) has been proven very flexible, being able to accommodate all kinds of link technologies and supporting a broad range of applications. The basic principles of the original Internet architecture include end-to-end addressing, global routeability and a single namespace of IP addresses that unintentionally serves both as locators and host identifiers. The commercial success and widespread use of the Internet have lead to new requirements, which include internetworking over business boundaries, mobility and multi-homing in an untrusted environment. Our approach to satisfy these new requirements is to introduce a new internetworking layer, the node identity layer. Such a layer runs on top of the different versions of IP, but could also run directly on top of other kinds of network technologies, such as MPLS and 2G/3G PDP contexts. This approach enables connectivity across different communication technologies, supports mobility, multi-homing, and security from ground up. This paper describes the Node Identity Architecture in detail and discusses the experiences from implementing and running a prototype
Dragon: Multidimensional Range Queries on Distributed Aggregation Trees,
Distributed query processing is of paramount importance in next-generation distribution services, such as Internet of
Things (IoT) and cyber-physical systems. Even if several multi-attribute range queries supports have been proposed for
peer-to-peer systems, these solutions must be rethought to fully meet the requirements of new computational paradigms
for IoT, like fog computing. This paper proposes dragon, an ecient support for distributed multi-dimensional range
query processing targeting ecient query resolution on highly dynamic data. In dragon nodes at the edges of the
network collect and publish multi-dimensional data. The nodes collectively manage an aggregation tree storing data
digests which are then exploited, when resolving queries, to prune the sub-trees containing few or no relevant matches.
Multi-attribute queries are managed by linearising the attribute space through space lling curves. We extensively
analysed dierent aggregation and query resolution strategies in a wide spectrum of experimental set-ups. We show that
dragon manages eciently fast changing data values. Further, we show that dragon resolves queries by contacting a
lower number of nodes when compared to a similar approach in the state of the art
- âŠ