On Optimal Clustering in Mobile Wireless Sensor Networks Under Uncertainty

• Published in: Military operations research (Alexandria, Va.) Vol. 20; no. 2; pp. 19 - 33
• Main Authors: Degirmenci, Guvenc, Kharoufeh, Jeffrey P., Prokopyev, Oleg A.
• Format: Journal Article
• Language: English
• Published: Military Operations Research Society 01.01.2015
• Subjects: Algorithms; Connectivity; Cost functions; Heuristics; Military operations; Objective functions; Operations research; Sensors; Unit costs; Variable costs
• DOI: 10.5711/1082598320219
• ISSN: 1082-5983

Wireless sensor networks are comprised of geographically distributed sensors that collect and convey time-critical information without human intervention, making them particularly useful for military applications; however, network performance may be limited by the typically small energy supplies of the sensors. One strategy for dealing with limited energy storage in such networks is to allow sensor nodes to aggregate sensed data at particular nodes known as cluster heads. We examine the problem of optimally locating and relocating cluster heads over a finite time horizon. The objective is to simultaneously maximize the demand coverage and minimize the costs of relocating cluster heads. Our main contribution is to consider explicitly the random evolution of mobile sensor nodes, which requires periodic updating of their precise locations. Computational experiments illustrate the usefulness of such dynamic information updates to help mitigate the uncertainty in sensor node locations and ensure reliable demand coverage by cluster heads.