Oriented edge colorings and link scheduling in sensor networks

First International Conference on Communication System Software and Middleware, Comsware 2006

Volumn 2006, Issue , 2006, Pages

  Herman, Ted ^a   Pemmaraju, Sriram ^a   Pirwani, Imran ^a  

^a University of Iowa   (United States)

Author keywords

Edge coloring; TDMA; Wireless networks

Indexed keywords

ACYCLIC NETWORKS; EDGE COLORINGS; LINK SCHEDULING; UNICAST COMMUNICATIONS;

EDGE DETECTION; PARALLEL ALGORITHMS; PROBLEM SOLVING; SCHEDULING; TELECOMMUNICATION LINKS; TIME DIVISION MULTIPLE ACCESS;

WIRELESS NETWORKS;

EID: 34247549273     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. C L Baratt, G Istrate, V S Anil Kumar, M V Marathe, S Thite, and S Thulasidasan. Efficient algorithms for channel assignment in wireless radio networks, unpublished manuscript, 2005.
2. D Bertsekas and R Gallager. Data Networks. Prentice-Hall, 1987.
3. C Busch, M Magdon-Ismail, F Sivrikaya, and B Yener. Contention-free MAC protocols for wireless sensor networks. In Proceedings of the 18th Annual Conference on Distributed Computing (DISC), pages 245-259, 2004.
4. K Cameron. Induced matchings. Discrete Applied Mathematics, 24:97-102, 1989.
5. R J Faudree, A Gýarfas, R H Schelp, and Zs Tuza. Induced matchings in bipartite graphs. Discrete Math., 78:83-87, 1989.
6. S Gandham, M Dawande, and R Prakash. Link scheduling in sensor networks: Distributed edge coloring revisited. In INFOCOM, 2005.
7. D A Grable and A Panconesi. Nearly optimal distributed edge coloring in O(loglogn) rounds. In Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, 1997.
8. T Herman and S Tixeuil. A distributed TDMA slot assignment algorithm for wireless sensor networks. In Proceedings of the First Workshop on Algorithmic Aspects of Wireless Sensor Networks (AlgoSensors '2004), pages 45-58. Springer LNCS 3121, 2004.
9. I Holyer. The NP-completeness of edge-coloring. SIAM Journal on Computing, 10(4):718-720, 1981.
10. SS Kulkarni and U Arumugam. Collision-free communication in sensor networks. In Proceedings of Self-Stabilizing Systems, 6th International Symposium, pages 17-31. Springer LNCS 2704, 2003.
11. M Lombardi, A Novick, J Lowe, M Deutch, G Nelson, D Sutton, W Yates, and D Hanson. WWVB radio controlled clocks: Recommended practices for manufacturers and consumers. Technical Report 960-14, United States National Institute of Standards, January 2005.
12. M Mahdian. On the computational complexity of strong edge coloring. Discrete Applied Mathematics, 118:239-248, 2002.
13. J Misra and D Gries. A constructive proof of vizing's theorem. Information Processing Letters, 41:131-133, 1992.
14. J Polastre, R Szewczyk, and D Culler. Telos: enabling ultralow power wireless research. In Proceedings of the Fourth International Conference on Information Processing in Sensor Networks; Special Track on Platform Tools and Design Methods for Network Embedded Sensors (SPOTS), 2005.
15. S Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81-94, 1999.
16. B Sundararaman, U Buy, and AD Kshemkalyani. Clock synchronization for wireless sensor networks: a survey. Ad Hoc Networks, 3:281-323, 2005.
17. A Woo and D Culler. A transmission control scheme for media access in sensor networks. In Proceedings of the 7th annual international conference on Mobile computing and networking, pages 221-235, 2001.