Please use this identifier to cite or link to this item:
Scopus Web of ScienceĀ® Altmetric
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTian, H.en
dc.contributor.authorShen, H.en
dc.contributor.authorMatsuzawa, T.en
dc.identifier.citationNetwork and Parallel Computing - Vol 3779, 2005 / Jin, H., Reed, D., Jiang, W. (ed./s), pp.461-469en
dc.descriptionThe original publication can be found at www.springerlink.comen
dc.description.abstractThe performance of wireless sensor networks (WSNs) is greatly influenced by their topology. WSNs with patterned topologies can efficiently save energy and achieve long networking lifetime. In this paper, we discuss different patterned topologies for constructing WSNs which can provide the required coverage area and the connectivity of all sensor nodes. We compare different performance measures among all patterned topologies, and find that WSNs in strip-based topology can provide the greatest coverage area with the same number of sensor nodes as used for WSNs in other patterned topologies. Strip-based topology also consumes least energy in the routing protocol of flooding. We show that triangle-based topology can provide the highest reliability among all patterned topologies. We also propose several routing protocols for WSNs in patterned topologies, which are based on different parameters when selecting next-hop neighbor. Our protocols require only local information and work in a simple and effective way to achieve energy efficiency.en
dc.description.statementofresponsibilityHui Tian, Hong Shen and Teruo Matsuzawaen
dc.relation.ispartofseriesLecture Notes in Computer Science ; 3779/2005en
dc.subjectWireless sensor networks; topology; routing; energy efficienten
dc.titleDeveloping energy-efficient topologies and routing for wireless sensor networksen
dc.typeBook chapteren
dc.identifier.orcidShen, H. [0000-0002-3663-6591]en
Appears in Collections:Mathematical Sciences publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.