6,798 research outputs found

    Energy-aware peering routing protocol for indoor hospital body area network communication

    Get PDF
    The recent research in Body Area Networks (BAN) is focused on making its communication more reliable, energy efficient, secure, and to better utilize system resources. In this paper we propose a novel BAN network architecture for indoor hospital environments, and a new mechanism of peer discovery with routing table construction that helps to reduce network traffic load, energy consumption, and improves BAN reliability. We have performed extensive simulations in the Castalia simulation environment to show that our proposed protocol has better performance in terms of reduced BAN traffic load, increased number of successful packets received by nodes, reduced number of packets forwarded by intermediate nodes, and overall lower energy consumption compared to other protocols

    HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths

    Full text link
    In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates.Comment: This is a long version of a paper published by IEEE in the Proceedings of the 14-th IEEE International Conference on Peer-to-Peer Computin

    Smart PIN: performance and cost-oriented context-aware personal information network

    Get PDF
    The next generation of networks will involve interconnection of heterogeneous individual networks such as WPAN, WLAN, WMAN and Cellular network, adopting the IP as common infrastructural protocol and providing virtually always-connected network. Furthermore, there are many devices which enable easy acquisition and storage of information as pictures, movies, emails, etc. Therefore, the information overload and divergent content’s characteristics make it difficult for users to handle their data in manual way. Consequently, there is a need for personalised automatic services which would enable data exchange across heterogeneous network and devices. To support these personalised services, user centric approaches for data delivery across the heterogeneous network are also required. In this context, this thesis proposes Smart PIN - a novel performance and cost-oriented context-aware Personal Information Network. Smart PIN's architecture is detailed including its network, service and management components. Within the service component, two novel schemes for efficient delivery of context and content data are proposed: Multimedia Data Replication Scheme (MDRS) and Quality-oriented Algorithm for Multiple-source Multimedia Delivery (QAMMD). MDRS supports efficient data accessibility among distributed devices using data replication which is based on a utility function and a minimum data set. QAMMD employs a buffer underflow avoidance scheme for streaming, which achieves high multimedia quality without content adaptation to network conditions. Simulation models for MDRS and QAMMD were built which are based on various heterogeneous network scenarios. Additionally a multiple-source streaming based on QAMMS was implemented as a prototype and tested in an emulated network environment. Comparative tests show that MDRS and QAMMD perform significantly better than other approaches

    Poor Man's Content Centric Networking (with TCP)

    Get PDF
    A number of different architectures have been proposed in support of data-oriented or information-centric networking. Besides a similar visions, they share the need for designing a new networking architecture. We present an incrementally deployable approach to content-centric networking based upon TCP. Content-aware senders cooperate with probabilistically operating routers for scalable content delivery (to unmodified clients), effectively supporting opportunistic caching for time-shifted access as well as de-facto synchronous multicast delivery. Our approach is application protocol-independent and provides support beyond HTTP caching or managed CDNs. We present our protocol design along with a Linux-based implementation and some initial feasibility checks

    Adaptive real-time predictive collaborative content discovery and retrieval in mobile disconnection prone networks

    Get PDF
    Emerging mobile environments motivate the need for the development of new distributed technologies which are able to support dynamic peer to peer content sharing, decrease high operating costs, and handle intermittent disconnections. In this paper, we investigate complex challenges related to the mobile disconnection tolerant discovery of content that may be stored in mobile devices and its delivery to the requesting nodes in mobile resource-constrained heterogeneous environments. We propose a new adaptive real-time predictive multi-layer caching and forwarding approach, CafRepCache, which is collaborative, resource, latency, and content aware. CafRepCache comprises multiple multi-layer complementary real-time distributed predictive heuristics which allow it to respond and adapt to time-varying network topology, dynamically changing resources, and workloads while managing complex dynamic tradeoffs between them in real time. We extensively evaluate our work against three competitive protocols across a range of metrics over three heterogeneous real-world mobility traces in the face of vastly different workloads and content popularity patterns. We show that CafRepCache consistently maintains higher cache availability, efficiency and success ratios while keeping lower delays, packet loss rates, and caching footprint compared to the three competing protocols across three traces when dynamically varying content popularity and dynamic mobility of content publishers and subscribers. We also show that the computational cost and network overheads of CafRepCache are only marginally increased compared with the other competing protocols
    • …
    corecore