Trading Sensing Coverage For An Extended Network Lifetime

Files in This Item:
File Description SizeFormat 
Trading_Sensing_Coverage_For_An_Extended_Network_Lifetime.pdf352.85 kBAdobe PDFDownload
Title: Trading Sensing Coverage For An Extended Network Lifetime
Authors: Lim, Jong Chern
Bleakley, Chris J.
Permanent link: http://hdl.handle.net/10197/7074
Date: 15-Oct-2010
Abstract: One of the main benefits of using Wireless Sensor Networks (WSNs) is that they can be deployed in remote locations without any prior infrastructure. Because of this nodes are normally battery powered. This limits the performance of the network. In this paper, we propose a novel method of scheduling nodes based on a user's sensing coverage requirement. Through the use of our proposed scheduling algorithm (Ncut-GA), it is shown that the duration in which the user's coverage requirement is met can be extended. When compared with a previously published algorithm (Greedy-MSC), the proposed algorithm is able to increase the coverage duration by up to 33%. Furthermore it is also shown that the duration of which the WSN can operate till the first node dies can be improved by up to 125% through the used of Ncut-GA.
Type of material: Conference Publication
Publisher: IEEE
Keywords: Disjoint subsets;Tradeoff;Performance metrics
DOI: 10.1109/WMNC.2010.5678753
Language: en
Status of Item: Peer reviewed
Conference Details: 3rd Joint IFIP Wireless and Mobile Networking Conference (WMNC), Budapest, Hungary, 13 - 15 October 2010
Appears in Collections:Computer Science Research Collection
CASL Research Collection

Show full item record

Download(s) 50

34
checked on May 25, 2018

Google ScholarTM

Check

Altmetric


This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.