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!

Be the first to leave a comment!