By Topic

Minimum latency and energy efficiency routing with lossy link awareness in wireless sensor networks

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

2 Author(s)

This paper proposes two joint routing and scheduling algorithms which minimize the data delivery latency while enhancing the energy efficiency in wireless sensor networks (WSNs). In our algorithms, we first model the network as a directed graph Ginit orientating to the sink node on the basis of the location and lossy behavior of the wireless links. Next, we introduce two directed graphs Gres and Ghip taking into consideration the energy efficiency and latency, respectively. The scheduling algorithm is developed on the two graphs by solving an integer linear program (ILP) that minimizes energy consumption and mean latency in the network. Owing to the blacklist of links in the two graphs Gres, Ghop with respect to Ginit, the computation complexity of ILP is decreased considerably. Simulation results show that our proposed algorithms are highly effective in improving network performance.

Published in:

Factory Communication Systems (WFCS), 2012 9th IEEE International Workshop on

Date of Conference:

21-24 May 2012