Link scheduling in wireless sensor networks: Distributed edge-coloring revisited

We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our algorithm consists of two phases. The first phase involves edge-coloring: an assignment of a color to each edge in the network such that no two edges incident on the same node are assigned the same colo...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of parallel and distributed computing Vol. 68; no. 8; pp. 1122 - 1134
Main Authors:	Gandham, Shashidhar, Dawande, Milind, Prakash, Ravi
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier Inc 01.08.2008 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Distributed edge-coloring Exact sciences and technology Link scheduling Software Theoretical computing Wireless sensor networks Link scheduling Wireless sensor networks Distributed edge-coloring Energy consumption Edge(graph) Sparse graph Measurement sensor Transmission protocol Scheduling Distributed system Terminal Time division multiple access Network topology Distributed algorithm Algorithm complexity Graph colouring Wireless network Access protocol Sensor array Wireless sensor networks,Distributed edge-coloring,Link scheduling Time complexity
ISSN:	0743-7315, 1096-0848
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!