JOURNAL ARTICLE

On relay node placement and locally optimal traffic allocation in heterogeneous wireless sensor networks

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.

Keywords:
Relay Computer science Node (physics) Computer network Wireless sensor network Heuristic Base station Transmission (telecommunications) Wireless Wireless network Distributed computing Power (physics) Mathematical optimization Engineering Telecommunications Mathematics

Metrics

31
Cited By
2.12
FWCI (Field Weighted Citation Impact)
11
Refs
0.89
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Energy Efficient Wireless Sensor Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Mobile Ad Hoc Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Energy Harvesting in Wireless Networks
Physical Sciences →  Engineering →  Electrical and Electronic Engineering

Related Documents

© 2026 ScienceGate Book Chapters — All rights reserved.