Yet another distributed depth-first-search algorithm
Information Processing Letters
An optimal distributed depth-first-search algorithm
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A constructive proof of Vizing's Theorem
Information Processing Letters
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
SIAM Journal on Computing
Nearly optimal distributed edge colouring in O(log log n) rounds
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An experimental study of a simple, distributed edge coloring algorithm
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Computer Networks
Advanced Concepts in Operating Systems
Advanced Concepts in Operating Systems
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Energy-aware data-centric routing in microsensor networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Multihop medium access control for WSNs: an energy analysis model
EURASIP Journal on Wireless Communications and Networking
Graphs and Hypergraphs
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 12th annual international conference on Mobile computing and networking
Energy optimal data propagation in wireless sensor networks
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
Link scheduling in polynomial time
IEEE Transactions on Information Theory - Part 1
A study on distributed/centralized scheduling for wireless mesh network
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
FGIT '09 Proceedings of the 1st International Conference on Future Generation Information Technology
A scheduling algorithm for minimizing the packet error probability in clusterized TDMA networks
EURASIP Journal on Wireless Communications and Networking - Special issue on optimization techniques in wireless communications
Utilization-based dynamic scheduling algorithm for wireless mesh networks
EURASIP Journal on Wireless Communications and Networking
A cyclic MAC scheduler for collecting data from heterogeneous sensors
Computer Communications
Energy efficient joint data aggregation and link scheduling in solar sensor networks
Computer Communications
Scheduling links for heavy traffic on interfering routes in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed anomaly detection for industrial wireless sensor networks based on fuzzy data modelling
Journal of Parallel and Distributed Computing
A Graph Coloring Based TDMA Scheduling Algorithm for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Production scheduling of assembly fixtures in the aeronautical industry
Computers and Industrial Engineering
Hi-index | 0.00 |
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 color. Our main result for the first phase is a distributed edge-coloring algorithm that needs at most (@D+1) colors, where @D is the maximum degree of the network. To our knowledge, this is the first distributed algorithm that can edge-color a graph using at most (@D+1) colors. The second phase uses the edge-coloring solution for link scheduling. We map each color to a unique timeslot and attempt to assign a direction of transmission along each edge such that the hidden terminal problem is avoided; an important result we obtain is a characterization of network topologies for which such an assignment exists. Next, we consider topologies for which a feasible transmission assignment does not exist for all edges, and obtain such an assignment using additional timeslots. Finally, we show that reversing the direction of transmission along every edge leads to another feasible direction of transmission. Using both the transmission assignments, we obtain a TDMA MAC schedule which enables two-way communication between every pair of adjacent sensor nodes. For acyclic topologies, we prove that at most 2(@D+1) timeslots are required. Results for general topologies are demonstrated using simulations; for sparse graphs, we show that the number of timeslots required is around 2(@D+1). We show that the message and time complexity of our algorithm is O(n@D^2+n^2m), where n is the number of nodes and m is the number of edges in the network. Through simulations, we demonstrate that the energy consumption of our solution increases linearly with @D. We also propose extensions to account for non-ideal radio characteristics.