By Topic

On base station selection for anycast flow routing in energy-constrained 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

3 Author(s)
Hou, Y.T. ; Dept. of Electr. & Comput. Eng., Virginia Tech, Blacksburg, VA ; Yi Shi ; Sherali, H.D.

Energy constraints have had a significant impact on the design and operation of wireless sensor networks. In this paper, we investigate base station selection (or anycast) problem in wireless sensor networks. We consider a wireless sensor network having multiple base stations (data sink nodes), where each source node must send all its locally generated data to only one base station. To maximize the network lifetime, it is essential to optimally match each source node to a particular base station in addition to finding an optimal routing solution. We propose a polynomial time heuristic for optimal base station selection for anycast via a sequential fixing procedure, under the assumption that the bit rate from each source node is constant. Through extensive simulation results, we show that this heuristic has excellent performance behavior and is a tight low bound that is very close to optimal solution for the original optimization problem

Published in:

Quality of Service in Heterogeneous Wired/Wireless Networks, 2005. Second International Conference on

Date of Conference:

24-24 Aug. 2005