Multicommodity lifetime routing for wireless sensor networks with multiple sinks

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.