A cache-level quality of experience metric to characterize ICNs for adaptive streaming

Adaptive streaming has motivated information-centric network (ICN) designs to improve end-user quality of experience (QoE). However, their management and evaluation rely either on conventional cache-level metrics that are poor representations of QoE, or consumer-side indicators that are opaque to network services. This letter proposes a measure to bridge the gap between cache performance and consumer QoE. We introduce maximal sustainable bitrate (MSB), defined as the highest bitrate deliverable in time to be in time to meet a given request without buffering. Based on our observations, we posit that QoE is maximal when requested bitrates match a cache’s MSB for that content. We design a cache-level reward function as a benchmark metric that measures the difference between requested bitrates and MSB. We hypothesize that aggregated rewards are an indicator of overall system performance. Performance evaluations show high correlation between the sum of cache rewards and consumer QoE.PostprintPeer reviewe

Pruned Adaptive Routing in the Heterogeneous Internet of Things

Abstract-Recent research endeavours are capitalizing on state of the art technologies to build a scalable Internet of Things (IoT). Envisioned as a technology to integrate the best of Wireless Sensor Networks and RFID systems, there is much promise for a global network of objects that are identifiable, track-able, and harmoniously informing. However, the realization of an IoT framework is hindered by many factors, the most pressing of which is attributed to the integration of these heterogeneous nodes and devices. A considerable subset of these nodes undergoes movement and dynamically enters and leaves the network backbone/topology. Routing packets and inter-nodal communication has received little attention; mainly due to the sheer reliance on the Internet as a backbone. However, spatially correlated entities in the IoT, and those which most often interact, would pose a significant overhead of communication if all intermediate packets need to be routed over distant backhauls. In remedy, we present a Pruned Adaptive IoT Routing (PAIR) protocol that selectively establishes routes of communication between IoT nodes. Since nodes in the IoT belong to different owners, we also introduce a pricing model to cater for the exchange of monetary costs by intermediate nodes to utilize their relaying resources. We also establish a cap on inter-nodal routing to dynamically utilize the Internet backbone if the source to destination distance surpasses a preset (case optimized) threshold. The PAIR routing protocol is elaborated upon, building upon the detailed system model presented in this paper. We finally present a use case to demonstrate the utility and practicality of PAIR in the heterogeneous IoT as it scales

Cloud-centric Sensor Networks -Deflating the hype Are we ready to push service-oriented nodes on the Cloud?

Abstract-Much has been deliberated lately on the adaptability of Wireless Sensor Networks (WSNs) to transition into a Cloudbased paradigm. This divergence has been mainly attributed to enabling a dynamic design, larger spread and a more distributed control scheme for WSNs that are inherently static and datacentric. Thus, transitioning into a service-centric paradigm, with the "Cloud" as an enabler, seems appealing. In this paper we argue against the seemingly straight forward transition, and emphasize the pitfalls in transitioning WSNs to an inherently distributed architecture. We articulate on four grounds, temporal and spatial limitations, resilience measures, energy efficiency and functional decomposition. Sheer connectivity, as an intrinsic property that presents hindrances in all these factors, is addressed in light of each. Finally, we present insights into future progressions of WSNs that boosts their dynamic presence without impacting intrinsic design dimensions. This paper serves both as an analytic overview of current directions and hindrances, and an overview to where we can go next in remedy to current and projected bottlenecks in Cloud-based sensing systems

Dynamic Wireless Sensor Networks

In this title, the authors leap into a novel paradigm of scalability and cost-effectiveness, on the basis of resource reuse. In a world with much abundance of wirelessly accessible devices, WSN deployments should capitalize on the resources already available in the region of deployment, and only augment it with the components required to meet new application requirements. However, if the required resources already exist in that region, WSN deployment converges to an assignment and scheduling scheme to accommodate for the new application given the existing resources. Such resources are polled from many fields, including multiple WSNs already in the field, static networks (WiFi, WiMAX, cellular, etc) in addition to municipal, industrial and mobile resources.The architecture, framework and pricing policy, as well as approaches for backward compatibility with existing deployments, are presented in this book. We elaborate on the formalization of the problem, and contrast with existing work on coverage. This paradigm adopts optimal assignments in WSNs and exploits dynamic re-programming for boosting post-deployment and backward compatible protocols

The 2 nd International Conference on Ambient Systems, Networks and Technologies (ANT-2011) Towards Augmenting Federated Wireless Sensor Networks

Abstract Environmental Monitoring (EM) has witnessed significant improvements in recent years due to the great utility of Wireless Sensor Networks (WSNs). Nevertheless, due to harsh operational conditions in such applications, WSNs often suffer large scale damage in which nodes fail concurrently and the network gets partitioned into disjoint sectors. Thus, reestablishing connectivity between the sectors, via their remaining functional nodes, is of utmost importance in EM; especially in forestry. In this regard, considerable work has been proposed in the literature tackling this problem by deploying Relay Nodes (RNs) aimed at reestablishing connectivity. Although finding the minimum relay count and positions is NP-Hard, efficient heuristic approaches have been anticipated. However, the majority of these approaches ignore the surrounding environment characteristics and the infinite 3-Dimensional (3-D) search space which significantly degrades network performance in practice. Therefore, we propose a 3-D grid-based deployment for relay nodes in which the relays are efficiently placed on grid vertices. We present a novel approach, named FADI, based on a minimum spanning tree construction to re-connect the disjointed WSN sectors. The performance of the proposed approach is validated and assessed through extensive simulations, and comparisons with two main stream approaches are presented. Our protocol outperforms the related work in terms of the average relay node count and distribution, the scalability of the federated WSNs in large scale applications, and the robustness of the topologies formed