Efficient aggregation scheduling in multihop wireless sensor networks with SINR constraints

Xiaohua Xu, Xiang Yang Li, Min Song

Research output: Contribution to journalArticlepeer-review

36 Scopus citations

Abstract

We study delay-efficient data aggregation scheduling in wireless sensor networks subject to signal to interference-plus-noise ratio (SINR) constraints. We construct a routing tree and propose two scheduling algorithms that can generate collision-free link schedules for data aggregation. We prove that the delay of each algorithm is (O(R+\Delta)) time slots, where (R) and (Δ) are respectively the graph radius and the maximum node degree in a reduced communication graph of the original network; the proposed algorithms are asymptotically optimum on delay in random wireless sensor networks. We evaluate the performances of the proposed algorithms and the simulation results corroborate our theoretical analysis.

Original languageEnglish
Article number6365636
Pages (from-to)2518-2528
Number of pages11
JournalIEEE Transactions on Mobile Computing
Volume12
Issue number12
DOIs
StatePublished - 2013

Keywords

  • SINR
  • Wireless sensor networks
  • aggregation scheduling
  • delay

Fingerprint

Dive into the research topics of 'Efficient aggregation scheduling in multihop wireless sensor networks with SINR constraints'. Together they form a unique fingerprint.

Cite this