DocumentCode
2971338
Title
Selecting Member Nodes in a Chain Oriented WSN
Author
Mamun, Quazi ; Ramakrishnan, Sita ; Srinivasan, Bala
Author_Institution
Clayton Sch. of IT, Monash Univ., Clayton, VIC, Australia
fYear
2010
fDate
18-21 April 2010
Firstpage
1
Lastpage
6
Abstract
Energy consumption and lifetime of networks are the two most important constraints for wireless sensor networks (WSNs). Moreover, for perceiving events with respect to time, WSNs need to maintain coverage quality. This paper focuses on coverage problem with a number of sensors selected from deployed sensor nodes, which develop chain oriented communication. To mitigate the constraints of sensor nodes researchers employ a variety of logical topologies, among which chain oriented topology is one of the significant contender. Moreover, choosing only a selected number of sensors, instead of choosing all of them saves more energy and lengthens lifetime of the network. The main criterion to select a sensor node we propose in this paper is the use of shared sensing region of a sensor node with its neighbours. Simulation results show that our protocol saves a large number of sensor nodes while maintaining significant amount of coverage ratio.
Keywords
Energy consumption; Fires; Job shop scheduling; Monitoring; Network topology; Peer to peer computing; Protocols; Redundancy; Sensor systems; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications and Networking Conference (WCNC), 2010 IEEE
Conference_Location
Sydney, Australia
ISSN
1525-3511
Print_ISBN
978-1-4244-6396-1
Type
conf
DOI
10.1109/WCNC.2010.5506377
Filename
5506377
Link To Document