Minimizing communication costs in hierarchically clustered networks of wireless sensors

Author

Bandyopadhyay, Seema ; Coyle, Edward J.

Author_Institution

Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA

Volume

2

fYear

2003

fDate

20-20 March 2003

Firstpage

1274

Abstract

This paper develops a technique for quantifying and minimizing the energy required to gather data from all sensors in a multi-hop wireless sensor network The technique combines analytical results from stochastic geometry with a distributed, randomized algorithm for generating clusters. The minimum communication energy achieved by this approach is significantly lower than the energy costs incurred in non-clustered networks and in clustered networks produced by such algorithms as the max-min d-cluster algorithm.

Keywords

minimax techniques; randomised algorithms; stochastic processes; wireless sensor networks; clustering algorithms; communication cost minimization; data gathering; distributed algorithm; energy minimization; energy quantification; hierarchically clustered wireless sensor networks; max-min d-cluster algorithm; multihop wireless sensor network; nonclustered networks; randomized algorithm; stochastic geometry; Algorithm design and analysis; Clustering algorithms; Computer networks; Costs; Data engineering; Intelligent networks; Power engineering and energy; Spread spectrum communication; Stochastic processes; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE

Conference_Location

New Orleans, LA, USA

ISSN

1525-3511

Print_ISBN

0-7803-7700-1

Type

conf

DOI

10.1109/WCNC.2003.1200556

Filename

1200556