Collision-free path coloring with application to minimum-delay gathering in sensor networks

Authors:
Luisa Gargano;Adele A. Rescigno
Affiliations:
Dipartimento di Informatica ed Applicazioni, Universita di Salerno, 84081 Baronissi (Sa), Italy;Dipartimento di Informatica ed Applicazioni, Universita di Salerno, 84081 Baronissi (Sa), Italy
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 22
Cited 3

Introduction to algorithms

Introduction to algorithms
Broadcasting in radio networks

Handbook of wireless networks and mobile computing
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Data Gathering Algorithms in Sensor Networks Using Energy Metrics

IEEE Transactions on Parallel and Distributed Systems
Directed diffusion for wireless sensor networking

IEEE/ACM Transactions on Networking (TON)
The Impact of Data Aggregation in Wireless Sensor Networks

ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Topology-Aware Placement and Role Assignment for Energy-Efficient Information Gathering in Sensor Networks

ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Efficient gathering of correlated data in sensor networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Exact and approximate balanced data gathering in energy-constrained sensor networks

Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Networking Wireless Sensors

Networking Wireless Sensors
Power-efficient sensor placement and transmission structure for data gathering under distortion constraints

ACM Transactions on Sensor Networks (TOSN)
Multicommodity Flow Based Maximum Lifetime Routing in Wireless Sensor Network

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Interest dissemination with directional antennas for wireless sensor networks with mobile sinks

Proceedings of the 4th international conference on Embedded networked sensor systems
Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree and Grid Topologies

ICNS '07 Proceedings of the Third International Conference on Networking and Services
Improved Lower Bounds for Data-Gathering Time in Sensor Networks

ICNS '07 Proceedings of the Third International Conference on Networking and Services
Energy-Efficient Multihop Polling in Clusters of Two-Layered Heterogeneous Sensor Networks

IEEE Transactions on Computers
An approximation algorithm for the wireless gathering problem

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
A directional-antenna based MAC protocol for wireless sensor networks

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Delay efficient data gathering in sensor networks

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Gathering algorithms on paths under interference constraints

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Directional versus omnidirectional antennas for energy consumption and k-connectivity of networks of sensors

OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Lower bounds on data collection time in sensory networks

IEEE Journal on Selected Areas in Communications

Minimum Delay Data Gathering in Radio Networks

ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Optimal time data gathering in wireless networks with omni-directional antennas

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
On Sample-Path Optimal Dynamic Scheduling for Sum-Queue Minimization in Forests

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.04

Visualization

Abstract

Efficient data gathering is an important challenge in sensor networks. In this paper we address the problem of gathering sensed data to the sink of a sensor network minimizing the time to complete the process. We present optimal time data gathering algorithms for any sensor network topology, in the half-duplex with directional antennas model, when each sensor has one data packet to be gathered and merging of packets is not allowed at intermediate nodes. Our results improve on existing approximation algorithms. We approach the gathering problem by obtaining optimal solutions to a path coloring problem in graphs.