Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Energy-Aware Fair Routing in Wireless Sensor Networks with Maximum Data Collection

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

4 Author(s)
Ka-Lok Hung ; Department of Computer Science, The Hong Kong University of Science and Technology. ether@cs.ust.hk ; Bensaou, B. ; Junhua Zhu ; Naït-Abdesselam, F.

This paper considers the problem of routing in sensor networks from the point of view od data collection. That is, given the initial amount of battery energy in each node, the aim is to determine how much data can each source transmit until the network is partitioned (i. e., until the nodes cannot find end-to-end routes to their respective sinks). In addition, to respond to some specific applications' requirements, when determining such nodal data volume distribution, fairness among nodes is taken into account. The problem is formulated as a concave utility maximization and a sub-gradient algorithm is proposed to solve it distributively. Some numerical results are given and the convergence of the algorithm is discussed.

Published in:

Communications, 2006. ICC '06. IEEE International Conference on  (Volume:8 )

Date of Conference:

June 2006