Frontiers of Mathematics in China >

2010 , Vol. 5 >Issue 1: 75 - 87

DOI: https://doi.org/10.1007/s11464-009-0050-4

Research articles

Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks

Expand
  • 1.Department Of Mathematics, Zhengzhou University, Zhengzhou 450052, China; 2.Department of Computer Science, Illinois Institute of Technology, Chicago, IL 60616, USA; 3.Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100190, China;

Published date: 05 Mar 2010

Fold

Abstract

A wireless sensor network usually consists of a large number of sensor nodes deployed in a field. One of the major communication operations is to broadcast a message from one node to the rest of the others. In this paper, we adopt the conflict-free communication model and study how to compute a transmission schedule that determines when and where a node should forward the message so that all nodes could receive the message in minimum time. We give two approximation algorithms for this NP-hard problem that have better theoretically guaranteed performances than the existing algorithms. The proposed approach could be applied to some other similar problems.

Key words： broadcast schedule; approximation algorithm; wireless sensor network; unit disk graph

Cite this article

Weiping SHANG, Pengjun WAN, Xiaodong HU, . Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks[J]. Frontiers of Mathematics in China, 2010 , 5(1) : 75 -87 . DOI: 10.1007/s11464-009-0050-4

Options
Outlines

/

〈 〉