On Approximation Algorithms for Interference-Aware Broadcast Scheduling in 2D and 3D Wireless Sensor Networks

Authors:
Ravi Tiwari;Thang N. Dinh;My T. Thai
Affiliations:
CISE Department, University of Florida, Gainesville 32611;CISE Department, University of Florida, Gainesville 32611;CISE Department, University of Florida, Gainesville 32611
Venue:
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Year:
2009

Citing 5
Cited 0

Flooding for reliable multicast in multi-hop ad hoc networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Minimizing broadcast latency and redundancy in ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Optimal Channel Assignments for Lattices with Conditions at Distance Two

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Broadcast Scheduling in Interference Environment

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Broadcast scheduling is a mechanism for performing interference-aware broadcasting in multi-hop wireless sensor networks (WSNs). Existing studies assume all the WSN nodes lie on a 2D plane. This assumption is not always appropriate, as in practice the sensor nodes may acquire positions in the 3D space. In this paper, we study the broadcast scheduling problem in which we consider two different models of the transmission graph: Disk Graph (DG) in 2D and Ball Graph (BG) in 3D. We consider each node may have different transmission ranges and the interference range is *** time of the transmission range (where *** 1). We devise efficient coloring methods for coloring a hexagonal tiling in 2D and truncated octahedragonal tiling in 3D, which leads to O (1)-approximation ratio for broadcast scheduling problem in 2D and 3D, respectively.