Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/1396
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mahapatro, A | - |
dc.contributor.author | Khilar, Pabitra Mohan | - |
dc.date.accessioned | 2011-02-25T09:32:46Z | - |
dc.date.available | 2011-02-25T09:32:46Z | - |
dc.date.issued | 2011-01 | - |
dc.identifier.citation | International Conference on Advances in Computing, Communication and Control, 2011 (ICAC3'11), P 400-405 | en |
dc.identifier.isbn | 978-3-642-18439-0 | - |
dc.identifier.uri | http://dx.doi.org/10.1007/978-3-642-18440-6_51 | - |
dc.identifier.uri | http://hdl.handle.net/2080/1396 | - |
dc.description | Copyright belongs to the publisher- Springer Verlag | en |
dc.description.abstract | This paper investigates the distributed self diagnosis problem for wireless sensor networks (WSN). One of the fundamental algorithm design issue for WSN is conservation of energy at each sensor node. A heartbeat comparison based diagnosis model is proposed, which is shown to be energy efficient. Analytical studies and simulation results show that the performance of proposed algorithm is comparable to that of the existing known algorithms in both delay and message count prospective. At the same time, the per-node message overhead is substantially reduced and becomes scalable. | en |
dc.format.extent | 139258 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Springer Verlag | en |
dc.relation.ispartofseries | CCIS;Vol 125 | - |
dc.subject | Distributed diagnosis | en |
dc.subject | Comparison based model | en |
dc.subject | WSN | en |
dc.subject | scalable diagnosis | en |
dc.title | Scalable Distributed Diagnosis Algorithm for Wireless Sensor Networks | en |
dc.type | Article | en |
Appears in Collections: | Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
icac3-2011-ampmk.pdf | 135.99 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.