293 research outputs found
A Dynamic Service Lookup and Discovery Scheme using a Self-Organizing Overlay Network for Indoor Location-Based Service
REACTION 2012. 1st International workshop on Real-time and distributed computing in emerging applications. December 4th, 2012, San Juan, Puerto Rico.Indoor location-based service (LBS) has various
challenges, including that of numerous service lookups being
requested concurrently and frequently from several locations,
and that the network infrastructure needs to support high
scalability, such as inserting or deleting network nodes anytime
and anywhere. In general, indoor LBS resources are generally
located in close proximity to the requested point. However, a
traditional centralized LBS system needs to maintain a
geographical map of the entire building or complex in its
central server, which can cause low scalability and traffic
congestion. This paper presents a self-organizing and fully
distributed indoor LBS platform through regional cooperation
among devices, and a service lookup algorithm that searches
for the shortest physical path to the service resource. An
evaluation of the performance of the proposed platform has
been compared to the traditional centralized method regarding
the service turnaround time according to the number of
concurrent lookup increases.This work was supported by the IT R&D program of MKE/KEIT. [10041145, Self-Organized Softwareplatform(SOS) for welfare devices
A Location-Aware Middleware Framework for Collaborative Visual Information Discovery and Retrieval
This work addresses the problem of scalable location-aware distributed indexing to enable the leveraging of collaborative effort for the construction and maintenance of world-scale visual maps and models which could support numerous activities including navigation, visual localization, persistent surveillance, structure from motion, and hazard or disaster detection. Current distributed approaches to mapping and modeling fail to incorporate global geospatial addressing and are limited in their functionality to customize search. Our solution is a peer-to-peer middleware framework based on XOR distance routing which employs a Hilbert Space curve addressing scheme in a novel distributed geographic index. This allows for a universal addressing scheme supporting publish and search in dynamic environments while ensuring global availability of the model and scalability with respect to geographic size and number of users. The framework is evaluated using large-scale network simulations and a search application that supports visual navigation in real-world experiments
A HOLISTIC REDUNDANCY- AND INCENTIVE-BASED FRAMEWORK TO IMPROVE CONTENT AVAILABILITY IN PEER-TO-PEER NETWORKS
Peer-to-Peer (P2P) technology has emerged as an important alternative to the traditional client-server communication paradigm to build large-scale distributed systems. P2P enables the creation, dissemination and access to information at low cost and without the need of dedicated coordinating entities. However, existing P2P systems fail to provide high-levels of content availability, which limit their applicability and adoption. This dissertation takes a holistic approach to device mechanisms to improve content availability in large-scale P2P systems.
Content availability in P2P can be impacted by hardware failures and churn. Hardware failures, in the form of disk or node failures, render information inaccessible. Churn, an inherent property of P2P, is the collective effect of the users’ uncoordinated behavior, which occurs when a large percentage of nodes join and leave frequently. Such a behavior reduces content availability significantly. Mitigating the combined effect of hardware failures and churn on content availability in P2P requires new and innovative solutions that go beyond those applied in existing distributed systems. To addresses this challenge, the thesis proposes two complementary, low cost mechanisms, whereby nodes self-organize to overcome failures and improve content availability. The first mechanism is a low complexity and highly flexible hybrid redundancy scheme, referred to as Proactive Repair (PR). The second mechanism is an incentive-based scheme that promotes cooperation and enforces fair exchange of resources among peers. These mechanisms provide the basis for the development of distributed self-organizing algorithms to automate PR and, through incentives, maximize their effectiveness in realistic P2P environments.
Our proposed solution is evaluated using a combination of analytical and experimental methods. The analytical models are developed to determine the availability and repair cost properties of PR. The results indicate that PR’s repair cost outperforms other redundancy schemes. The experimental analysis was carried out using simulation and the development of a testbed. The simulation results confirm that PR improves content availability in P2P. The proposed mechanisms are implemented and tested using a DHT-based P2P application environment. The experimental results indicate that the incentive-based mechanism can promote fair exchange of resources and limits the impact of uncooperative behaviors such as “free-riding”
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
An ontology-based P2P infrastructure to support context discovery in pervasive computing
Master'sMASTER OF ENGINEERIN
Location-aware mechanism for efficient video delivery over wireless mesh networks
Due to their flexibility, ease of use, low-cost and fast deployment, wireless Mesh Networks have been widely accepted as an alternative to wired network for last-mile connectivity. When used in conjunction with Peer-to-Peer data transfer solutions, many innovative applications and services such as distributed storage, resource sharing, live TV broadcasting or Video on Demand can be supported without any centralized administration. However, in order to achieve a good quality of service in such variable, error-prone and resource-constrained wireless multi-hop environments, it is important that the associated Peer-to-Peer overlay is not only aware of the availability, but also of the location and available path link quality of its peers and services.
This thesis proposes a wireless location-aware Chord-based overlay mechanism for Wireless Mesh Networks (WILCO) based on a novel geographical multi-level ID mapping and an improved finger table. The proposed scheme exploits the location information of mesh routers to decrease the number of hops the overlay messages traverse in the physical topology. Analytical and simulation results demonstrate that in comparison to the original Chord, WILCO has significant benefits: it reduces the number of lookup messages, has symmetric lookup on keys in both the forward and backward direction of the Chord ring and achieves a stretch factor of O(1).
On top of this location-aware overlay, a WILCO-based novel video segment seeking algorithm is proposed to make use of the multi-level WILCO ID location-awareness to locate and retrieve requested video segments from the nearest peer in order to improve video quality. An enhanced version of WILCO segment seeking algorithm (WILCO+) is proposed to mitigate the sometimes suboptimal selection of the WILCO video segment seeking algorithm by extracting coordinates from WILCO ID to enable location-awareness. Analytical and simulation results illustrate that the proposed scheme outperforms the existing state-of-the-art solutions in terms of PSNR and packet loss with different background traffic loads.
While hop count is frequently strongly correlated to Quality of Service, the link quality of the underlying network will also have a strong influence on content retrieval quality. As a result, a Cross-layer Wireless Link Quality-aware Overlay peer selection mechanism (WLO) is proposed. The proposed cross-layer mechanism uses a Multiplication Selector Metric (MSM) to select the best overlay peer. The proposed MSM overcomes the two issues facing the traditional summation-based metric, namely, the difficulty of bottleneck link identification and the influence of hop count on behavior. Simulation results show that WLO outperforms the existing state-of-the-art solutions in terms of video quality at different background loads and levels of topology incompleteness. Real life emulation-based tests and subjective video quality assessments are also performed to show that the simulation results are closely matched by the real-life emulation-based results and to illustrate the significant impact of overlay peer selection on the user perceived video quality
A Secure Peer-to-Peer Application Framework
The nature of the Internet has changed dramatically. From a modest research network, it has evolved into one of the most important fabrics of our modern society, affecting the lives of billions each day. We rely on it for everything from performing our daily chores to accessing rich media and keeping in touch with our friends.
Despite this change, service provisioning has largely remained intact. Services are provided in a centralized manner, resulting in bottlenecks and vulnerable collections of, often unwittingly, submitted sensitive information. Peer-to-peer (P2P) technologies have the potential to provide a better alternative for future networking. P2P services distribute the load from a single node to a network of peers, relying on the resources of the end-users themselves. Not only does it remove the bottlenecks, it has the potential to provide a more personal and safe networking environment.
In this dissertation, we inspect the feasibility and implications of a generic, cross-application, P2P framework. We present the design and implementation of a framework that uses existing infrastructure and advanced networking protocols to create a secure environment. Using this framework, applications are able to benefit from P2P networking without having to deploy new infrastructure or implement complex connection- and identity management. Users benefit from using a single, strong, cross-application identity management and having better control over their data. This improves the trust within the system and enables new ways of dealing with security threats.
We demonstrate the feasibility of the framework by evaluating the performance and usability of the prototype implementation. This provides a model for future networking applications and insight into the security and usability issues these will face
- …