Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Lexicographically Optimal Routing for Wireless Sensor Networks With Multiple Sinks

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)
Shah-Mansouri, V. ; Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC ; Mohsenian-Rad, A.-H. ; Wong, V.W.S.

In wireless sensor networks (WSNs), the field information (e.g., temperature, humidity, airflow) is acquired via several battery-equipped wireless sensors and is relayed toward a sink node. As the size of the WSNs increases, it becomes inefficient (in terms of power consumption) when gathering all information in a single sink. To tackle this problem, one can increase the number of sinks. The set of sensor nodes that are sending data to sink k is called commodity k. In this paper, we formulate the lexicographically optimal commodity lifetime (LOCL) routing problem. A stepwise centralized algorithm called the LOCL algorithm is proposed, which can obtain the optimal routing solution and lead to lexicographical fairness among commodity lifetimes. We then show that, under certain assumptions, the lexicographical optimality among commodity lifetimes can be achieved by providing lexicographical optimality among node lifetimes. This motivates us to propose our second algorithm, which is called the lexicographically optimal node lifetime (LONL) algorithm, which is suitable for practical implementation. Simulation results show that our proposed LOCL and LONL algorithms increase the normalized commodity and node lifetimes compared with the maximum lifetime with multiple sinks (MLMS) and lexicographical max-min fair (LMM) routing algorithms.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:58 ,  Issue: 3 )