Multicommodity Lifetime Routing for Wireless Sensor Networks with Multiple Sinks

TitleMulticommodity Lifetime Routing for Wireless Sensor Networks with Multiple Sinks
Publication TypeConference Paper
Year of Publication2008
AuthorsShah-Mansouri, V., A. Hamed Mohsenian Rad, and V. W. S. Wong
Conference NameCommunications, 2008. ICC '08. IEEE International Conference on
Pagination3225 -3229
Date Publishedmay.
Keywordsbattery-equipped wireless devices, data information flow, lexicographical fairness, lexicographically optimal commodity lifetime routing problem, LMM, MLMS, multicommodity lifetime routing, normalized commodity lifetime, stepwise algorithm, telecommunication network routing, wireless sensor networks
Abstract

Wireless sensor networks (WSNs) have recently received increasing attention from research and development communities. In a WSN, the field information (e.g., temperature, humidity, airflow) is acquired via several battery-equipped wireless devices and is relayed towards a sink node. As the size of the WSNs increases, it becomes inefficient to gather all information in one sink. To tackle this problem, the number of sinks can be increased. The data information flow towards each of the sinks is called a commodity. In this paper, we formulate a lexicographically optimal commodity lifetime (LOCL) routing problem. A stepwise algorithm is proposed to obtain the optimal routing solution which can lead to lexicographical fairness among commodity lifetimes. Simulation results show that our proposed algorithm increases the normalized commodity lifetime compared to MLMS [1] and LMM [2] routing algorithms.

URLhttp://dx.doi.org/10.1109/ICC.2008.607
DOI10.1109/ICC.2008.607

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia