S-Web: An efficient and self-organizing wireless sensor network model

Le, H; Hoang, D; Poliah, R

S-Web: An efficient and self-organizing wireless sensor network model

Le, H Hoang, D

Poliah, R

Permalink

Publication Type:: Chapter
Citation:: 2008, 5186 LNCS pp. 179 - 188
Issue Date:: 2008-09-25

Closed Access

	Filename	Description	Size
	2008000992OK.pdf		1.13 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Le, H	en_US
dc.contributor.author	Hoang, D https://orcid.org/0000-0003-1798-4926	en_US
dc.contributor.author	Poliah, R	en_US
dc.date.issued	2008-09-25	en_US
dc.identifier.citation	2008, 5186 LNCS pp. 179 - 188	en_US
dc.identifier.isbn	3540856927	en_US
dc.identifier.isbn	9783540856924	en_US
dc.identifier.uri	http://hdl.handle.net/10453/7895
dc.description.abstract	One of the major weaknesses of existing centralized algorithms in Wireless Sensor Network (WSN) routing is that sensor nodes are required to report their status (e.g. remaining energy level) to the central node (i.e. the Base Station -BS) and receive configuration information from the BS (e.g. next hop routing). As a result, the WSNs suffer from high communication and/or computation overheads at sensor nodes to accommodate topology changes in the WSN. This paper proposes a novel scheme, called a Sensor Web (or S-Web), that organizes sensors into clusters based on their geographical location without requiring the sensors to have a Global Positioning System or actively locate themselves. The S-Web enables nodes to route data packets while consuming low energy in a decentralized manner. The model is self-organizing and distributed without the need of global network knowledge. © Springer-Verlag Berlin Heidelberg 2008.	en_US
dc.relation.isbasedon	10.1007/978-3-540-85693-1_20	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	S-Web: An efficient and self-organizing wireless sensor network model	en_US
dc.type	Chapter
utslib.citation.volume	5186 LNCS	en_US
utslib.for	0806 Information Systems	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	5186 LNCS	en_US

Abstract:

One of the major weaknesses of existing centralized algorithms in Wireless Sensor Network (WSN) routing is that sensor nodes are required to report their status (e.g. remaining energy level) to the central node (i.e. the Base Station -BS) and receive configuration information from the BS (e.g. next hop routing). As a result, the WSNs suffer from high communication and/or computation overheads at sensor nodes to accommodate topology changes in the WSN. This paper proposes a novel scheme, called a Sensor Web (or S-Web), that organizes sensors into clusters based on their geographical location without requiring the sensors to have a Global Positioning System or actively locate themselves. The S-Web enables nodes to route data packets while consuming low energy in a decentralized manner. The model is self-organizing and distributed without the need of global network knowledge. © Springer-Verlag Berlin Heidelberg 2008.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/7895