By Topic

Relay Node Placement in Heterogeneous Wireless Sensor Networks with Basestations

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
$33 $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)
Shouwei Li ; Hangzhou Dianzi Univ., Hangzhou ; Guangting Chen ; Wei Ding

Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. Heterogeneous wireless sensor networks are composed of a large number of sensors equipped with different transmission and sensing capabilities. The basestations are more powerful than sensors. In this paper, we study a relay node placement problem, which aims to deploy a minimum number of relay nodes to establish directed paths from any sensor node to a basestation, in heterogeneous wireless sensor networks with basestations. For this problem, we present a polynomial time 6-approximation algorithm and give an example which shows that 5 is a lower bound of the approximation ratio of the algorithm.

Published in:

Communications and Mobile Computing, 2009. CMC '09. WRI International Conference on  (Volume:1 )

Date of Conference:

6-8 Jan. 2009