University of Surrey

Test tubes in the lab Research in the ATI Dance Research

A mediated gossiping mechanism for large-scale sensor networks

Ganz, F, Barnaghi, P, Carrez, F and Moessner, K (2011) A mediated gossiping mechanism for large-scale sensor networks In: GLOBECOM Workshops (GC Wkshps), 2011 IEEE, 2011-12-05 - 2011-12-09, Houston, Texas.

[img]
Preview
PDF
GlobeCom_M2M_Workshop_Frieder.pdf - Accepted Version
Available under License : See the attached licence file.

Download (277kB)
[img]
Preview
PDF (licence)
SRI_deposit_agreement.pdf

Download (33kB)

Abstract

Gateways in sensor networks are used to relay, aggregate and communicate information from capillary networks to more capable (e.g. IP-based) networks. However Gateway-to-Gateway (G2G) communication to exchange and update information among the gateways in large-scale sensor networks for query processing, data fusion and other similar tasks has been less discussed in recent works. The requirements for large-scale sensor networks such as dynamic topology and update strategies to reduce the overall network load makes G2G communications an important aspect in the network design. In this paper, we introduce a mediated gossip-based G2G communication mechanism. The proposed solution leverages the publish/subscribe approach and uses high-level context assigned to publish/subscribe channels to enable the information discovery and G2G communications. Gateways store/aggregate sensor observation and measurement data according to specific context which is defined based on features such as spatial and temporal attributes, observed phenomena (i.e. feature of interest) and sensor device features. The gateways communicate with each other to exchange data and also to forward related queries for data aggregation in cases that the data should be aggregated from two different sources. The proposed solution also facilitates reliable sensor service provisioning by enabling gateways to communicate and/or forward requests to other gateways when a resource fails or a sensor node becomes unavailable. We compare our results to probabilistic gossiping algorithms and run benchmarks on different dynamic network topologies based on indicators such as number of sent messages and dissemination delay.

Item Type: Conference or Workshop Item (Paper)
Additional Information: © 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Divisions: Faculty of Engineering and Physical Sciences > Electronic Engineering > Centre for Communication Systems Research
Depositing User: Symplectic Elements
Date Deposited: 20 Apr 2012 12:03
Last Modified: 09 Jun 2014 13:18
URI: http://epubs.surrey.ac.uk/id/eprint/470671

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800