Link scheduling in sensor networks: distributed edge coloring revisited

@article{Gandham2005LinkSI,
  title={Link scheduling in sensor networks: distributed edge coloring revisited},
  author={S. Gandham and Milind Dawande and R. Prakash},
  journal={Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.},
  year={2005},
  volume={4},
  pages={2492-2501 vol. 4}
}
We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign a color to each edge in the network such that no two edges incident on the same node are assigned the same color. We propose a distributed edge coloring algorithm that needs at most (/spl delta/+1) colors, where /spl delta/ is the maximum degree of the graph. To the best of our knowledge, this is the first distributed… Expand
Distributed Algorithms for TDMA Link Scheduling in Sensor Networks
TLDR
It is proved that there exists a Δ-approximation algorithm for FDLSP (Δ being the maximum node degree in the network), and two distributed algorithms are presented, including a synchronous algorithm based on finding maximal independent sets and an asynchronous DFS algorithm. Expand
Node coloring for dense wireless sensor networks
TLDR
This research report defines the h-hop node coloring problem, and proves that the associated decision problem is NP-complete, and presents a 3-hop distributed coloring algorithm that is optimized for dense networks. Expand
Node coloring in wireless networks: Complexity results and grid coloring
TLDR
This paper defines the h-hop node coloring problem, with h any positive integer, adapted to two types of applications in wireless networks, and specifies coloring in both general mode for general applications and strategic mode for data gathering applications. Expand
A Distributed Collision-Free Low-Latency Link Scheduling Scheme in Wireless Sensor Networks
TLDR
DCLS is introduced, a distributed collision-free low-latency link scheduling scheme that considers the network snapshot at each time slot, and determines a set of collision- free transmission pairs on each snapshot. Expand
Distributed Algorithms for TDMA Link Scheduling in Sensor Networks
TLDR
The full duplex link scheduling problem (FDLSP) is formulated as distance-2 edge coloring in bi-directed graphs and tighter lower and upper bounds for the FDLSP problem are proved. Expand
Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs
TLDR
This paper proposes and evaluates two new probabilistic and distributed distance-2 edge coloring algorithms that require no global node identifiers and indicates a tradeoff between convergence time and message overhead versus number of colors used. Expand
Node Coloring and Color Conflict Detection in Wireless Sensor Networks
TLDR
It is proved that the three-hop node coloring problem is NP-complete, and the overhead induced by SERENA during network coloring is reduced, making possible the use of these protocols even in dense networks with limited bandwidth. Expand
Scheduling links for heavy traffic on interfering routes in wireless mesh networks
TLDR
One of the two heuristics is based on relaxing the notion of a node multicoloring by dynamically exploiting the availability of communication opportunities that would otherwise be wasted and it is found that its performance is significantly superior to the other's. Expand
TDMA scheduling algorithms for wireless sensor networks
TLDR
A distributed algorithm based on the distributed coloring of the nodes, that increases the delay by a factor of 10–70 over centralized algorithms for 1000 nodes, and obtain upper bound for these schedules as a function of the total number of packets generated in the network. Expand
Distributed time-optimal scheduling for convergecast in wireless sensor networks
TLDR
Simulation results for a real application scenario show that the convergecast scheduling algorithm performs significantly better than existing convergecast algorithms, and it is proved that the nodes to buffer no more than two packets at any instance. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 43 REFERENCES
Distributed scheduling of broadcasts in a radio network
  • R. Ramaswami, K. Parhi
  • Computer Science
  • IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies
  • 1989
TLDR
A distributed algorithm is presented for obtaining an efficient and conflict-free broadcasting schedule in a multi-hop packet radio network and a distributed implementation of this algorithm is proposed, which is based on circulating a token through the nodes in the network. Expand
Improved distributed algorithms for coloring and network decomposition problems
TLDR
It is shown that A-coloring G is reducible in 0(log3 n/log A) time to (A+ I)-vertex coloring G in a distributed model, which leads to fast distributed algorithms, and a linear–processor NC algorithm, for Acoloring. Expand
Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds
TLDR
Fast and simple randomized algorithms for edge coloring a graph in the synchronous distributed point-to-point model of computation and new techniques for proving upper bounds on the tail probabilities of certain random variables which are not stochastically independent are introduced. Expand
Scheduling algorithms for multihop radio networks
TLDR
Results show that the new algorithms for transmission scheduling in multihop broadcast radio networks perform consistently better than earlier methods, both theoretically and experimentally. Expand
Link scheduling in polynomial time
TLDR
Two polynomial-time algorithms are given for scheduling conversations in a spread spectrum radio network that jointly meet a prespecified end-to-end demand and has the smallest possible length. Expand
Scheduling algorithms for multi-hop radio networks
TLDR
New algorithms for transmission scheduling in multihop broadcast radio networks are presented, showing that, for both types of scheduling, the new algorithms (experimentally) perform consistently better than earlier methods. Expand
A unified framework and algorithm for channel assignment in wireless networks
TLDR
This work presents a unified algorithm for efficient (T/F/C)DMA channel assignments to network nodes or to inter-nodal links in a (multihop) wireless network and provides comprehensive theoretical analysis characterizing the worst-case performance of the algorithm for several classes of problems. Expand
Design and analysis of an MST-based topology control algorithm
TLDR
This paper analytically prove several important properties of LMST: 1) the topology derived under LMST preserves the network connectivity; 2) the node degree of any node in the resulting topology is bounded by 6; and 3) the bottomology can be transformed into one with bidirectional links after removal of all unidirectional Links. Expand
Design and analysis of an MST-based topology control algorithm
TLDR
This paper analytically prove several important properties of LMST: 1) the topology derived under LMST preserves the network connectivity; 2) the node degree of any node in the resulting topology is bounded by 6; and 3) the bottomology can be transformed into one with bidirectional links after removal of all unidirectional Links. Expand
Models and Approximation Algorithms for Channel Assignment in Radio Networks
TLDR
Efficient approximation algorithms for the distance-2 coloring problem for various geometric graphs including those that naturally model a large class of packet radio networks, including (r,s)-civilized graphs, planar graphs, graphs with bounded genus, etc. Expand
...
1
2
3
4
5
...