198 results found
Wu D, Liu Q, Zhang Y, et al., 2014, CrowdWiFi: efficient crowdsensing of roadside WiFi networks, Proceedings of the 15th ACM/IFIP/USENIX Middleware Conference, Pages: 229-240
In this paper, we present CrowdWiFi, a novel vehicular middleware to identify and localize roadside WiFi APs that are located outside or inside buildings. Our work is motivated by the recent surge in availability of open WiFi access points (APs) that are enabling opportunistic data services to moving vehicles. Two key elements of CrowdWiFi that provide vehicles with opportunistic WiFi access include (a) an online compressive sensing component and (b) an offline crowdsourcing module. Online compressive sensing (CS) techniques are primarily used to for the coarse-grained estimation of nearby APs along the driving route; here, the received signal strength (RSS) values are recorded at runtime, and the number and locations of APs are recovered immediately based on limited RSS readings. The offline crowdsourcing mechanism assigns the online CS tasks to crowd-vehicles and aggregates answers using a bipartite graphical model. This offline crowdsourcing executes at a crowd-server that iteratively infers the reliability of each crowd-vehicle from the aggregated sensing results and refines the estimation of APs using weighted centroid processing. Extensive simulation results and real testbed experiments confirm that CrowdWiFi can successfully reduce the number of measurements needed for AP recovery, while maintaining satisfactory counting and localization accuracy. In addition, the impact of CrowdWiFi middleware on WiFi handoff and data transmission applications is examined.
Yang S, McCann JA, 2014, Distributed Optimal Lexicographic Max-Min Rate Allocation in Solar-Powered Wireless Sensor Networks, ACM TRANSACTIONS ON SENSOR NETWORKS, Vol: 11, ISSN: 1550-4859
Kolcun R, McCann JA, 2014, Dragon: Data Discovery and Collection Architecture for Distributed IoT, Internet of Things 2014 - The 4th International Conference on the Internet of Things (IoT 2014), Pages: 91-96
Wireless Low-powered Sensing Systems (WLSS) are becoming more prevalent, taking the form of Wireless Sensor/Actuator Networks, Internet of Things, Phones etc. As node and network capabilities of such systems improve, there is more motivation to push computation into the network as it saves energy, prolongs system lifetime, and enables timely responses to events or control activities. Another advantage of such edge-processing is that these networks can become autonomous in the sense that users can directly query the network via any node in the network and are not required to connect to gateways or retrieve data via long range communications. Dragon is a scheme that efficiently identifies nodes that can reply to user requests based on static criteria that either describes that node or its data and provides the ability to near-optimally route queries or actuation control messages to those nodes. Dragon is scalable and agile as it does not require any central point orchestrating the search. In this paper we demonstrate significant performance improvements compared with state-of-the-art approaches in terms of numbers of messages required (up to 93% less) and its ability to scale to 100s of nodes.
Yang S, Sheng Z, McCann JA, et al., 2014, Distributed Stochastic Cross-layer Optimization for Multi-hop Wireless Networks with Cooperative Communications, IEEE TRANSACTIONS ON MOBILE COMPUTING, Vol: 13, Pages: 2269-2282, ISSN: 1536-1233
Kartakis S, McCann J, 2014, Real-time Edge Analytics for Cyber Physical Systems using Compression Rates, 11th International Conference on Autonomic Computing (ICAC'14) - USENIX 2014
There is a movement in many practical applications of Cyber-Physical Systems to push processing to the edge. This is particularly important were the CPS is carrying out monitoring and control, where the latency between the decision making and control message reception should be minimal. However, CPS are limited by the capabilities of the typically battery powered low resourced devices. In this paper we present a self-adaptive scheme that both reduces the amount of resources required to store high sample rate data at the edge and at the same time carries out initial data analytics. Using out Smart Water datasets, plus a selection from other real world CPS applications, we show that our algorithm reduces computation by 98%; data volumes by 55%; while requiring only 11KB of memory at runtime (including the compression algorithm). In addition we show that our system supports self-tuning and automatic reconfiguration which means that manual tuning is alleviated and the scheme can be both applied to any kind of raw data automatically and is able self-optimize as the nature of the incoming data changes over time.
Adeel U, Yang S, McCann J, 2014, Self-Optimizing Citizen-Centric Mobile Urban Sensing Systems, 11th International Conference on Autonomic Computing, Pages: 161-167
In this paper, we develop a novel networking scheme that supports both real-time and delay-tolerant urban sensing applications. This maintains optimality through self-adapting its communications strategy using either inexpensive short-range opportunistic transmissions or reliable long-range cellular radios. Core to this scheme is the trading of mobile sensor data in a virtual market where we demonstrate that our scheme can incentivize phone users to participate. We show that the scheme can optimise network throughput while minimising total phone costs, in terms of 3G and battery costs.
Yu W, McCann J, 2014, Sig-SR: SimRank Search over Singular Graphs, The 37th Annual ACM SIGIR Conference, Publisher: Association for Computing Machinery, Pages: 859-862
SimRank is an attractive structural-context measure of similaritybetween two objects in a graph. It recursively followsthe intuition that “two objects are similar if they are referencedby similar objects”. The best known matrix-basedmethod  for calculating SimRank, however, implies anassumption that the graph is non-singular, i.e., its adjacencymatrix is invertible. In reality, non-singular graphs are veryrare; such an assumption in  is too restrictive in practice.In this paper, we provide a treatment of , by supportingsimilarity assessment on non-invertible adjacency matrices.Assume that a singular graph G has n nodes, with r (< n)being the rank of its adjacency matrix. (1) We show thatSimRank matrix S on G has an elegant structure: S can berepresented as a rank r matrix plus a scaled identity matrix.(2) By virtue of this, an efficient algorithm over singulargraphs, Sig-SR, is proposed for calculating all-pairs SimRankin O(r(n2 + Kr2)) time for K iterations. In contrast, theonly known matrix-based algorithm that supports singulargraphs  needs O(r4n2) time. The experimental results onreal and synthetic datasets demonstrate the superiority ofSig-SR on singular graphs against its baselines.
McCann JA, Kartakis S, 2014, Real-time Edge Analytics for Cyber Physical Systems using Compression Rates, 11th International Conference on Autonomic Computing (ICAC 14)
McCann JA, Adeel U, Yang S, 2014, Self-Optimizing Citizen-Centric Mobile Urban Sensing Systems, 11th International Conference on Autonomic Computing (ICAC 14)
Lv B, Yu W, Wang L, et al., 2014, Efficient Processing Node Proximity via Random Walk with Restart, The16th Asia-Pacific Web Conference, Publisher: Springer, Pages: 542-549, ISSN: 0302-9743
Gallacher S, Jetter C, Kalnikate V, et al., 2014, Investigating the Challenges of Crowd Sensing: Lessons from Zurich, Structures of Knowledge Co-creation Between Organisations and the Public in 17th ACM Conference on Computer Supported Cooperative Work and Social Computing (CSCW 2014), Publisher: ACM
Crowd sensing has the potential to empower urban citizens in the current trend of “Smart City” research and development. In compliment to top-down initiatives tackling infrastructure and resource issues, crowd sensing can support a bottom-up movement where urban citizens have the potential to impact and drive change. However, there are many social and practical issues that must be addressed to expand the current crowd sensing communities beyond sensor and technology experts and into the wider general public. The SenCity workshop  explored the use cases and opportunities for crowd sensing in urban environments. It also investigated the various challenges in a hands-on and practical way, moving out of the classroom and into the city to get first-hand experience. In this paper we present the workshop itself and the key observations and outcomes that could influence further work in this area.
Lalanda P, McCann JA, Diaconescu A, 2014, Self-Managing Pervasive Computing, 2014 IEEE Eighth International Conference on Self Adaptive and Self Organizing Systems Workshops (SASOW 2014), Publisher: IEEE, Pages: 5-5, ISSN: 1949-3673
Asmare E, McCann J, 2014, Lightweight Sensing Uncertainty Metric – Incorporating Accuracy and Trust, Sensors Journal, IEEE, Vol: PP, Pages: 1-1, ISSN: 1530-437X
Sheng Z, Yang S, Yu Y, et al., 2013, A SURVEY ON THE IETF PROTOCOL SUITE FOR THE INTERNET OF THINGS: STANDARDS, CHALLENGES, AND OPPORTUNITIES, IEEE WIRELESS COMMUNICATIONS, Vol: 20, Pages: 91-98, ISSN: 1536-1284
Yang S, Yang X, McCann JA, et al., 2013, Distributed Networking in Autonomic Solar Powered Wireless Sensor Networks, IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, Vol: 31, Pages: 750-761, ISSN: 0733-8716
The SenCity workshop explores the use of sensing technologies for visually resurfacing some of the hidden dynamics of the city by providing a collaborative and facilitated environment for applied research and creative exploration. Participants will collaboratively apply practical research and creative flair at the SenCity workshop to sense, visualise and share the hidden pulse of Zürich.
Yang S, Adeel U, McCann JA, 2013, Selfish Mules: Social Profit Maximization in Sparse Sensornets using Rationally-Selfish Human Relays, IEEE Journal on Selected Areas in Communications
Future smart cities will require sensing on a scale hitherto unseen. Fixed infrastructures have limitations regarding sensor maintenance, placement and connectivity. Employing the ubiquity of mobile phones is one approach to overcoming some of these problems. Here, mobility and social patterns of phone owners can be exploited to optimize data forwarding efficiency. The question remains, how can we stimulate phone owners to serve as data relays? In this paper, we combine network science principles and Lyapunov optimization techniques, to maximize global social profit across this hybrid sensor and mobile phone network. Sensor data packets are produced and traded (transmitted) over a virtual economic network using a lightweight social-economic-aware backpressure algorithm, combining rate control, routing, and resource pricing. Phone owners can get benefits through relaying sensor data. Our algorithm is fully distributed and makes no probabilistic/stochastic assumptions regarding mobility, topology, and channel conditions, nor does it require prediction. The global social profit achieved by our algorithm can perform close to (or better than) an ideal algorithm with perfect prediction-- proven by rigorous theoretical analysis. Simulation results further demonstrate that the proposed algorithm outperforms pure backpressure and social-aware schemes; highlighting the advantage of building systems combining communication with other types of networks.
Yang S, Yang X, McCann J, et al., 2013, Autonomic Solar Powered WSN for Network-wide Protocols, IEEE Journal on Selected Areas in Communications
Recent advances in solar harvesting technologies pave the way for sustainable environmental-monitoring applications in the emerging solar powered wireless sensor networks (SP-WSNs). The complexities associated with the low-resourced, high-dynamic, and vulnerable sensor nodes operating in potentially unattended or hostile environments require a high degree of self-management and automation. Guided by autonomic communication principles, this paper presents AutoSP-WSN, a novel distributed framework to achieve sustainable data collection while also optimizing end-to-end network performance for SP-WSNs. Initially, we present the energy-aware support component that provides reliable energy monitoring and prediction. This drives the power management component, which is adaptive to time-varying solar power, avoiding battery exhaustion as well as maximizing the per-node utility. Finally, to demonstrate the key design issues of the network protocol component, we propose two self-adaptive network protocols, a routing protocol SP-BCP and a rate control scheme PEA-DLEX. We show that the individual components seamlessly integrated as a whole, and the AutoSP-WSN framework exhibits the properties of context-awareness, distributed operation, self-configuration, self-optimization, self-protection and self-healing.Through extensive experiments on a real SP-WSN platform, and hardware-driven simulations, we show that the proposed schemes achieve substantial improvements over previous work, in terms of reliability, sustainable operation, and network utility.
Breza M, Yang S, McCann J, 2013, Multi-protocol scheduling for service provision in WSN, Pages: 14-22
Currently, Wireless Sensor Network (WSN) systems are made of aggregates of different, non-related protocols which often fail to function simultaneously. We present a self-organising solution that focuses on queue length scheduling. To start, we define a network model and use it to prove that our solution is throughput optimal. Then we evaluate it on two different WSN test-beds. Our results show that within the theoretical communication capacity region of our WSN we outperform the current solutions by as much as 35%.
Liu Z, Yang X, Yang S, et al., 2013, Efficiency-Aware: Maximizing Energy Utilization for Sensor Nodes Using Photovoltaic-Supercapacitor Energy Systems, INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, ISSN: 1550-1477
McCann JA, Lalanda P, Diaconescu A, 2013, Autonomic Computing: Principles, Design and Implementation, ISBN: 978-1447150060
This textbook provides a practical perspective on autonomic computing. Through the combined use of examples and hands-on projects, the book enables the reader to rapidly gain an understanding of the theories, models, design principles and challenges of this subject while building upon their current knowledge. Features: provides a structured and comprehensive introduction to autonomic computing with a software engineering perspective; supported by a downloadable learning environment and source code that allows students to develop, execute, and test autonomic applications at an associated website; presents the latest information on techniques implementing self-monitoring, self-knowledge, decision-making and self-adaptation; discusses the challenges to evaluating an autonomic system, aiding the reader in designing tests and metrics that can be used to compare systems; reviews the most relevant sources of inspiration for autonomic computing, with pointers towards more extensive specialty literature.
McCann JA, Schöning J, Rogers Y, et al., 2012, Intel Collaborative Research Institute - Sustainable Connected Cities, Third International Joint European Conference on Ambient Intelligence, Publisher: Springer, Pages: 364-372
Papadopoulos A, Navarra A, McCann JA, et al., 2012, VIBE: An energy efficient routing protocol for dense and mobile sensor networks, JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, Vol: 35, Pages: 1177-1190, ISSN: 1084-8045
Verhoef AV, Choudhary BDC, Morris PJM, et al., A high-density wireless underground sensor network (WUSN) to quantify hydro-ecological interactions for a UK floodplain; project background and initial results, EGU General Assembly 2012, held 22-27 April, 2012 in Vienna, Austria., p.6346
Martins P, McCann J, Eisenbach S, 2012, The Environment as an Argument, Practical Aspects of Declarative Languages, Publisher: Springer Berlin Heidelberg, Pages: 48-62
Beal J, McCann J, Zweig K, 2011, Message from the program committee chairs
Yadav P, McCann J, 2011, YA-MAC: Handling Uniﬁed Unicast and Broadcast Trafﬁc in Multi-hop Wireless Sensor Networks, 7th IEEE International conference on Distributed Computing in Sensor Systems and Workshops (DCOSS'11), Pages: 1-9
—This paper introduces YA-MAC, an agile MediumAccess Control (MAC) protocol to provide high throughputfor both unicast and broadcast trafﬁc in Duty-Cycled Multihop Wireless Sensor Networks (DCM-WSN). YA-MAC is implemented under the UPMA framework in TinyOS and isevaluated on TelosB and MicaZ testbeds. We observe that YAMAC signiﬁcantly outperforms the state-of-the-art SCP-MACprotocol in terms of throughput by 60%, while tolerating a moredynamic network, at a small cost to duty-cycle performance.Further, we show that YA-MAC’s idle listening radio powerconsumption is 35% less than RI-MAC’s, while achieving similar throughput and latency.
Bourcier J, Diaconescu A, Lalanda P, et al., 2011, AutoHome: An Autonomic Management Framework for Pervasive Home Applications, ACM TRANSACTIONS ON AUTONOMOUS AND ADAPTIVE SYSTEMS, Vol: 6, ISSN: 1556-4665
Yadav P, McCann J, 2011, EBS: Decentralised Slot Synchronisation for Broadcast messaging for Low-power Wireless Embedded Systems, COMSWARE '11 Proceedings of the 5th International Conference on Communication System Software and Middleware, Publisher: ACM
In this paper, we present a decentralised scheme that facilitates reliable network wide broadcast messaging without the requirement of strict time synchronisation, for duty-cycled low-power wireless embedded systems. In this emergent broadcast slot (EBS) scheme, devices coordinate their wakeup periods with their neighbours to exchange schedule information locally. This leads to the emergence of local slot synchronisation without the need for either network-wide synchronisation or a centralised time synchronisation element.We theoretically show that this scheme converges faster than similar emergent and gradient-based approaches, which we conﬁrm by evaluation on real test-beds. We also show that our scheme exhibits lower overheads while being more tolerant to disturbances caused by faulty nodes, wireless link failures, contention and interference in presence of deterministic propagation delays.
Bourcier J, McCann J, 2010, Autonomic flap damping mechanisms for utility based service selection, Pages: 12-19
The service oriented computing paradigm can be described as consisting of the following major components: service providers, service consumers and one or more service trader. One of the most challenging problems in this field has surrounded the choice of service provider in the presence of several, that best matches the consumer requirements. There has been a body of work exploring quality measures as a means of discerning between services. However, in much of the previous work the service selection remains relatively static during the life-time of the session, yet finer-granularity is required by Pervasive applications to drive their self-configuration, repair and management. Therefore how subtle changes in service quality affect the service choice, and ultimately the system's optimal performance in terms of its goals, is less well understood. In this paper, we propose a utility-function driven framework that dynamically chooses the most suitable providers for each consumer; driving self-optimization. We evaluate the performance and accuracy of our solution by implementing a pervasive home video application. Our results show our framework imposes minimal overheads while offering good response time and an accurate choices to the provider. Further, we observe that under less stable conditions, the framework state-flaps quite severely, producing oscillations between consumer-service bindings; increasing overheads. To this end, we have established several mechanisms that minimize the number of oscillations under unstable conditions and have evaluated each in terms of their ability to maintain stability under differing degrees of volatility. © 2010 IEEE.
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.