Bhattacharya, A and Kumar, A (2010) Delay constrained optimal relay placement for planned wireless sensor networks. In: 2010 18th International Workshop on Quality of Service (IWQoS), 16-18 June 2010, Beijing .
Delay.pdf - Published Version
Restricted to Registered users only
Download (350Kb) | Request a copy
In this paper, we study the problem of wireless sensor network design by deploying a minimum number of additional relay nodes (to minimize network design cost) at a subset of given potential relay locationsin order to convey the data from already existing sensor nodes (hereafter called source nodes) to a Base Station within a certain specified mean delay bound. We formulate this problem in two different ways, and show that the problem is NP-Hard. For a problem in which the number of existing sensor nodes and potential relay locations is n, we propose an O(n) approximation algorithm of polynomial time complexity. Results show that the algorithm performs efficiently (in over 90% of the tested scenarios, it gave solutions that were either optimal or exceeding optimal just by one relay) in various randomly generated network scenarios.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2010 IEEE. Personal use of this material is permitted.However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||20 Dec 2011 06:56|
|Last Modified:||20 Dec 2011 06:56|
Actions (login required)