Approximation algorithms for broadcasting in duty cycled wireless sensor networks

Broadcast is a fundamental operation in wireless sensor networks (WSNs). Given a source node with a packet to broadcast, the aim is to propagate the packet to all nodes in a collision free manner whilst incurring minimum latency. This problem, called minimum latency broadcast scheduling (MLBS), has...

Full description

Saved in:
Bibliographic Details
Published in:Wireless networks Vol. 20; no. 8; pp. 2219 - 2236
Main Authors: Zhao, Dianbo, Chin, Kwan-Wu, Raad, Raad
Format: Journal Article
Language:English
Published: Boston Springer US 01.11.2014
Springer
Springer Nature B.V
Subjects:
Algorithmics. Computability. Computer arithmetics
Algorithms
Analysis
Applied sciences
Approximation
Broadcasting
Communications Engineering
Computer Communication Networks
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Electrical Engineering
Energy consumption
Engineering
Equipments and installations
Exact sciences and technology
Information retrieval. Graph
IT in Business
Mathematical analysis
Mobile radiocommunication systems
Networks
Radiocommunications
Remote sensors
Research methodology
Scheduling
Scheduling algorithms
Sensors
Software
Studies
Telecommunications
Telecommunications and information theory
Theoretical computing
Wireless networks
Wireless sensor networks
Scheduling
Broadcast
Minimum latency
Lower bound
Shortest path
Approximation algorithm
Data broadcast
Transmission time
Delay
Latency
Time window
Duty cycle
NP hard problem
Wireless network
Ad hoc network
Sensor array
Collision avoidance
ISSN:1022-0038, 1572-8196
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Broadcast is a fundamental operation in wireless sensor networks (WSNs). Given a source node with a packet to broadcast, the aim is to propagate the packet to all nodes in a collision free manner whilst incurring minimum latency. This problem, called minimum latency broadcast scheduling (MLBS), has been studied extensively in wireless ad-hoc networks whereby nodes remain on all the time, and has been shown to be NP-hard. However, only a few studies have addressed this problem in the context of duty-cycled WSNs. In these WSNs, nodes do not wake-up simultaneously, and hence, not all neighbors of a transmitting node will receive a broadcast packet at the same time. Unfortunately, the problem remains NP-hard and multiple transmissions may be necessary due to different wake-up times. Henceforth, this paper considers MLBS in duty cycled WSNs and presents two approximation algorithms, BS-1 and BS-2, that produce a maximum latency of at most ( Δ - 1 ) T H and 13 T H respectively. Here, Δ is the maximum degree of nodes, T denotes the number of time slots in a scheduling period, and H is the broadcast latency lower bound obtained from the shortest path algorithm. We evaluated our algorithms under different network configurations and confirmed that the latencies achieved by our algorithms are much lower than existing schemes. In particular, compared to OTAB, the best broadcast scheduling algorithm to date, the broadcast latency and transmission times achieved by BS-1 is at least 1 17 and 2 5 that of OTAB respectively.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1022-0038
1572-8196
DOI:10.1007/s11276-014-0732-z