By Topic

Relational Approach Towards Feasibility Performance for Routing Algorithms in Wireless Sensor Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Nikodem, J. ; Inst. of Comput. Eng., Control & Robot., Wroclaw Univ. of Technol., Wroclaw, Poland

This paper presents an investigation into feasibility performance gains for routing protocols. Routing protocols are crucial for WSN activity because sensors are not capable to realise individually overall system tasks. Because of that, sensors need to have more or less tightly integrated cooperation, based on information exchange, between them. We propose relational approach, based on set theory, which considers three relations: subordination, tolerance and collision. Using these relations we perform initial organization, but there is no necessity to perform any reorganization during a network lifetime. The obtained results show that providing relatively high collision intensity quotient, nodes can avoid selectively malfunctioned nodes. On the other side, decreasing subordination intensity quotient inhibits error dissemination process.

Published in:

Dependability of Computer Systems, 2009. DepCos-RELCOMEX '09. Fourth International Conference on

Date of Conference:

June 30 2009-July 2 2009