DocumentCode :
3307759
Title :
Experimental evaluation of timing bounds for clustering protocols in wireless sensor networks
Author :
Kenney, Jason ; Aslam, Nauman ; Phillips, William ; Robertson, William
Author_Institution :
Dept. of Eng. Math. & Internetworking, Dalhousie Univ., Halifax, NS, Canada
fYear :
2011
fDate :
28-31 March 2011
Firstpage :
665
Lastpage :
670
Abstract :
In recent years a flurry of research activity has produced many suggested schemes for clustering wireless sensor networks, but no hard numbers for real-world implementations. This lack of guidance for developers makes it very difficult to effectively and confidently build working networks. This paper partially addresses these concerns by deriving minimal timing bounds on the clustering process in a typical and recently suggested clustering schemes. This is achieved through low-level network simulation in NS -2. We present detailed results that provide insight to timings involved in different phases of cluster set up. Results show ideal clusters can be constructed within 0.5 s for expected node densities (≤ 0.04 nodes/m2).
Keywords :
pattern clustering; protocols; wireless sensor networks; NS -2; clustering protocol; network simulation; timing bound; wireless sensor network; Clustering algorithms; Equations; Propagation losses; Protocols; Time division multiple access; Timing; Wireless sensor networks; clustering protocols; ireless sensor network; timing boundsireless sensor network; timing boundsw;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless Communications and Networking Conference (WCNC), 2011 IEEE
Conference_Location :
Cancun, Quintana Roo
ISSN :
1525-3511
Print_ISBN :
978-1-61284-255-4
Type :
conf
DOI :
10.1109/WCNC.2011.5779212
Filename :
5779212
Link To Document :
بازگشت