Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

On consistent neighborhood views in wireless sensor networks

Tools
- Tools
+ Tools

Jhumka, Arshad and Mottola, Luca (2009) On consistent neighborhood views in wireless sensor networks. In: 28th IEEE International Symposium on Reliable Distributed Systems, Niagara Falls, NY, September 27-30, 2009. Published in: 2009 28th IEEE International Symposium on Reliable Distributed Systems, Proceedings pp. 199-208.

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1109/SRDS.2009.19

Abstract

Wireless sensor networks (WSNs) are characterized by localized interactions. Indeed, several WSN algorithms and protocols work in a decentralized fashion by coordinating nodes within the wireless communication range, e.g., localization algorithms and MAC protocols. Nevertheless, most often these mechanisms do not address faults that may affect the way wireless neighborhoods are recognized by nodes, e.g., as in the case of data corruption. As the operation of these mechanisms is rooted in the use of topology information, these faults may be a significant detriment to correct and efficient system operation. In this paper, we argue that the above issues are particular instances of a general problem of consistent neighborhood riew. We present three increasingly weaker specifications of the problem. Next, we prove the impossibility of solving the two stronger specifications, and provide an algorithm to solve the weakest specification. In addition, we implement our algorithm in a commonly used WSN network stack, and assess its performance both in simulation and in a real-world testbed. The results show that, when possible, our mechanisms efficiently solve the problem of consistent neighborhood view, providing higher-level mechanisms with a re-usable building block to leverage off.

Item Type: Conference Item (Paper)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science > Computer Science
Series Name: SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS
Journal or Publication Title: 2009 28th IEEE International Symposium on Reliable Distributed Systems, Proceedings
Publisher: IEEE Computer Society
ISBN: 978-0-7695-3826-6
ISSN: 1060-9857
Date: 2009
Number of Pages: 10
Page Range: pp. 199-208
Identification Number: 10.1109/SRDS.2009.19
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Funder: Cooperating Objects Network of Excellence (CONET), Swedish Agency for Innovation Systems, Swedish Foundation for Strategic Research
Grant number: FP7-2007-2-224053
Conference Paper Type: Paper
Title of Event: 28th IEEE International Symposium on Reliable Distributed Systems
Type of Event: Conference
Location of Event: Niagara Falls, NY
Date(s) of Event: September 27-30, 2009
URI: http://wrap.warwick.ac.uk/id/eprint/6248

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us