Trading Sensing Coverage for an Extended Network Lifetime
Files in This Item:
|Trading_Sensing_Coverage_For_An_Extended_Network_Lifetime.pdf||451.88 kB||Adobe PDF||Download|
|Title:||Trading Sensing Coverage for an Extended Network Lifetime||Authors:||Lim, Jong Chern
Bleakley, Chris J.
|Permanent link:||http://hdl.handle.net/10197/7129||Date:||Apr-2013||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 lifetime 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 for 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 coverage duration by up to 80%. Furthermore it is also shown that the time until the first node dies can be improved by up to 200% through the use of Ncut-GA.||Type of material:||Journal Article||Publisher:||Springer||Copyright (published version):||2011 Springer Science+Business Media, LLC||Keywords:||Sensing coverage;Scheduling;Genetic algorithm||DOI:||10.1007/s11235-011-9595-0||Language:||en||Status of Item:||Peer reviewed|
|Appears in Collections:||Computer Science Research Collection|
CASL Research Collection
Show full item record
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.