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 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([email protected]^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.

[1]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[2]  Kaoru Watanabe,et al.  On a new edge coloring related to multihop wireless networks , 2002, Asia-Pacific Conference on Circuits and Systems.

[3]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[4]  Subramanian Ramanathan,et al.  Scheduling algorithms for multi-hop radio networks , 1992, SIGCOMM 1992.

[5]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[6]  Aravind Srinivasan,et al.  Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..

[7]  Aravind Srinivasan,et al.  Improved distributed algorithms for coloring and network decomposition problems , 1992, STOC '92.

[8]  Roger Wattenhofer,et al.  Topology control meets SINR: the scheduling complexity of arbitrary topologies , 2006, MobiHoc '06.

[9]  Azzedine Boukerche,et al.  Energy-aware data-centric routing in microsensor networks , 2003, MSWIM '03.

[10]  Milind Dawande,et al.  Energy efficient schemes for wireless sensor networks with multiple mobile base stations , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[11]  Israel Cidon.  Yet Another Distributed Depth-First-Search Algorithm , 1988, Inf. Process. Lett..

[12]  Jon W. Mark,et al.  Wireless Communications and Networking , 2002 .

[13]  Jayadev Misra,et al.  A Constructive Proof of Vizing's Theorem , 1992, Inf. Process. Lett..

[14]  S. Ramanathan,et al.  A unified framework and algorithm for channel assignment in wireless networks , 1999, Wirel. Networks.

[15]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.

[16]  Gang Zhou,et al.  RID: radio interference detection in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  Alessandro Panconesi,et al.  Nearly optimal distributed edge colouring in O(log log n) rounds , 1997, SODA '97.

[18]  Madhav V. Marathe,et al.  Approximation Algorithms for Channel Assignment in Radio Networks , 1998 .

[19]  José D. P. Rolim,et al.  Energy optimal data propagation in wireless sensor networks , 2005, J. Parallel Distributed Comput..

[20]  Paolo Santi,et al.  Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks , 2006, MobiCom '06.

[21]  Vaduvur Bharghavan,et al.  MACAW: a media access protocol for wireless LAN's , 1994, SIGCOMM 1994.

[22]  Ravi Prakash.  A Routing Algorithm for Wireless Ad Hoc Networks with Unidirectional Links , 2001, Wirel. Networks.

[23]  Xin Chen,et al.  Design and Analysis of Sensing Scheduling Algorithms under Partial Coverage for Object Detection in Sensor Networks , 2007, IEEE Transactions on Parallel and Distributed Systems.

[24]  M. B. Sharma,et al.  An optimal distributed depth-first-search algorithm , 1989, CSC '89.

[25]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

[26]  Mukesh Singhal,et al.  Advanced Concepts In Operating Systems , 1994 .

[27]  Petri Mähönen,et al.  Multihop Medium Access Control for WSNs: An Energy Analysis Model , 2005, EURASIP J. Wirel. Commun. Netw..

[28]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[29]  Madhav V. Marathe,et al.  An experimental study of a simple, distributed edge coloring algorithm , 2000, SPAA '00.