By Topic

Improving routing performance when several routing protocols are used sequentially in a WSN

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

3 Author(s)
El Rachkidy, N. ; LIMOS, Univ. Blaise Pascal, Clermont-Ferrand, France ; Guitton, A. ; Misson, M.

Wireless sensor networks can accommodate multiple applications by using a multi-stack architecture in order to deliver a large number of QoS. Multi-stack architectures can be optimized by allowing packet exchanges between stacks. However, routing loops may appear because of these exchanges. In this paper, we highlight the problem of routing loops generated when the same packet is routed according to two routing protocols. We define the delayable property of routing protocols by considering that some nodes might hold packets in order to avoid loops in the network. We show that minimizing the number of such nodes is an NP-complete problem. Then, we propose two heuristics to address this issue: a centralized deterministic heuristic requiring a global knowledge of the network, and a distributed stochastic heuristic reducing the number of hops from source to destination. Our two heuristics show important benefits: we reach a gain of up to 67% for the first heuristic and of up to 53% for the second heuristic, in terms of number of hops.

Published in:

Communications (ICC), 2013 IEEE International Conference on

Date of Conference:

9-13 June 2013