A shortest path tree based algorithm for relay placement in a wireless sensor network and its performance analysis

Bhattacharya, Abhijit and Kumar, Anurag (2014) A shortest path tree based algorithm for relay placement in a wireless sensor network and its performance analysis. In: COMPUTER NETWORKS, 71 . pp. 48-62.

PDF com_net_71-48_2014.pdf - Published Version Restricted to Registered users only Download (659kB) | Request a copy

Abstract

In this paper, we study a problem of designing a multi-hop wireless network for interconnecting sensors (hereafter called source nodes) to a Base Station (BS), by deploying a minimum number of relay nodes at a subset of given potential locations, while meeting a quality of service (QoS) objective specified as a hop count bound for paths from the sources to the BS. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard. For this problem, we propose a polynomial time approximation algorithm based on iteratively constructing shortest path trees and heuristically pruning away the relay nodes used until the hop count bound is violated. Results show that the algorithm performs efficiently in various randomly generated network scenarios; in over 90% of the tested scenarios, it gave solutions that were either optimal or were worse than optimal by just one relay. We then use random graph techniques to obtain, under a certain stochastic setting, an upper bound on the average case approximation ratio of a class of algorithms (including the proposed algorithm) for this problem as a function of the number of source nodes, and the hop count bound. To the best of our knowledge, the average case analysis is the first of its kind in the relay placement literature. Since the design is based on a light traffic model, we also provide simulation results (using models for the IEEE 802.15.4 physical layer and medium access control) to assess the traffic levels up to which the QoS objectives continue to be met. (C) 2014 Elsevier B.V. All rights reserved.

Item Type:	Journal Article
Publication:	COMPUTER NETWORKS
Additional Information:	Copy right for this article belongs to the ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	26 Sep 2014 10:31
Last Modified:	26 Sep 2014 10:31
URI:	http://eprints.iisc.ac.in/id/eprint/49957

Actions (login required)

View Item