Experimental evaluation of timing bounds for clustering protocols in wireless sensor networks

Jason Kenney, Nauman Aslam, William Phillips, William Robertson

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

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).
Original languageEnglish
Title of host publicationProceedings of the 2011 IEEE Wireless Communications and Networking Conference
Place of PublicationPiscataway, NJ
PublisherIEEE
Pages665-670
ISBN (Print)978-161284-255-4
DOIs
Publication statusPublished - 2011
EventIEEE Wireless Communication and Networking Conference (WCNC) - Cancun, Mexico
Duration: 1 Jan 2011 → …
http://www.ieee-wcnc.org/2011/

Conference

ConferenceIEEE Wireless Communication and Networking Conference (WCNC)
Period1/01/11 → …
Internet address

Fingerprint Dive into the research topics of 'Experimental evaluation of timing bounds for clustering protocols in wireless sensor networks'. Together they form a unique fingerprint.

Cite this