On Relay Node Placement and Locally Optimal Traffic Allocation in Heterogeneous Wireless Sensor Networks

  • Authors:
  • Quanhong Wang;Glen Takahara;Hossam Hassanein;Kenan Xu

  • Affiliations:
  • Dept. of Elec & Comp. Eng., Queen's University, Kingston, Ontario, Canada;Dept. of Math & Stat, Queen's University, Kingston, Ontario, Canada;School of Computing, Queen's University, Kingston, Ontario, Canada;Dept. of Elec & Comp. Eng., Queen's University, Kingston, Ontario, Canada

  • Venue:
  • LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.