loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l
On Relay Node Placement and Locally Optimal Traffic Allocation in Heterogeneous Wireless Sensor Networks
Sydney, Australia
November 15-November 17
ISBN: 0-7695-2421-4
Quanhong Wang, Dept. of Elec & Comp. Eng., Queenés University, Kingston, Ontario, Canada
Glen Takahara, Dept. of Math & Stat, Queenés University, Kingston, Ontario, Canada
Hossam Hassanein, School of Computing, Queen?s University, Kingston, Ontario, Canada
Kenan Xu, Dept. of Elec & Comp. Eng., Queenés University, Kingston, Ontario, Canada

In this paper, we explore the relay node (RN) placement problem in a heterogeneous Wireless Sensor Network (WSN). The objective of the RN placement is to use a minimum number of additional RNs to enable the relaying of given traffic on existing nodes to the base station (BS) under the energy constraints. We assume RNs can adjust their transmission power according to the distance to the intended destination. To make best use of power adaptivity of RN, we propose two heuristic solutions, namely, Independent Placement with Direct Allocation (IPDA) and Collaborative Placement with Locally Optimal Allocation Decision (CPLOAD). Furthermore, a lower bound on the minimum number of additional RNs is provided. The effectiveness of our proposals is investigated through simulation using numerical examples.

Index Terms:
Wireless Sensor Networks, Device Placement,Cost, Lifetime, Variable Transmission Range.
Citation:
Quanhong Wang, Glen Takahara, Hossam Hassanein, Kenan Xu, "On Relay Node Placement and Locally Optimal Traffic Allocation in Heterogeneous Wireless Sensor Networks," lcn, pp.656-664, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l, 2005
Usage of this product signifies your acceptance of the Terms of Use.