Fast sink placement for Gossip-based wireless sensor networks.

M. Blagojevic, M.C.W. Geilen, T. Basten, T. Hendriks

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)


In this paper we address the problem of sink placement for Gossip-based Wireless Sensor Networks (GWSN). Sink placement plays an important role in planning and deployment of sensor networks. It is an efficient means to improve performance and achieve design objectives. Sink deployment requires an optimization strategy to search a space of possible placement options, and a performance evaluation method to assess the quality of different sink placements. The stochastic nature of the gossip protocol makes this task challenging for GWSN. Simulation is the most common way to accurately evaluate gossiping performance; however, the time required to obtain statistically significant results is considerable and limits the scalability of the sink deployment process. We use a fast and accurate performance evaluation technique, which exploits specifics of the sink placement problem and significantly reduces evaluation time. In order to further improve the speed of the sink placement procedure we propose a greedy simulated annealing search heuristic that converges fast to a near-optimal placement. We have performed an extensive set of experiments to evaluate the performance of the proposed sink placement framework.
Original languageEnglish
Title of host publicationProceedings of the 31st IEEE International Performance Computing and Communications Conference (IPCCC 2012), 29 November- 1 December 2012, Austin, Texas
Place of PublicationLos Alamitos
PublisherIEEE Computer Society
ISBN (Print)978-1-4673-4881-2
Publication statusPublished - 2012
Eventconference; IPCCC 2012; 2012-11-29; 2012-12-01 -
Duration: 29 Nov 20121 Dec 2012


Conferenceconference; IPCCC 2012; 2012-11-29; 2012-12-01
OtherIPCCC 2012


Dive into the research topics of 'Fast sink placement for Gossip-based wireless sensor networks.'. Together they form a unique fingerprint.

Cite this