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!

Abstract	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 ( Δ + 1 ) colors, where Δ 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 ( Δ + 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 ( Δ + 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 ( Δ + 1 ) . We show that the message and time complexity of our algorithm is O ( n Δ 2 + n 2 m ) , 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 Δ . We also propose extensions to account for non-ideal radio characteristics.
AbstractList	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 ( Δ + 1 ) colors, where Δ 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 ( Δ + 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 ( Δ + 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 ( Δ + 1 ) . We show that the message and time complexity of our algorithm is O ( n Δ 2 + n 2 m ) , 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 Δ . We also propose extensions to account for non-ideal radio characteristics. 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 (+1) colors, where 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 (+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(+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(+1). We show that the message and time complexity of our algorithm is O(n(2)+n(2)m), 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 . We also propose extensions to account for non-ideal radio characteristics.
Author	Gandham, Shashidhar Dawande, Milind Prakash, Ravi
Author_xml	– sequence: 1 givenname: Shashidhar surname: Gandham fullname: Gandham, Shashidhar email: shashig@xgtechnology.com organization: xG Technology, Inc., United States – sequence: 2 givenname: Milind surname: Dawande fullname: Dawande, Milind email: milind@utdallas.edu organization: School of Management, The University of Texas at Dallas, TX, United States – sequence: 3 givenname: Ravi surname: Prakash fullname: Prakash, Ravi email: ravip@utdallas.edu organization: Department of Computer Science, University of Texas at Dallas, Richardson, TX, United States
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20538169$$DView record in Pascal Francis
BookMark	eNp9kL1uFDEQgC0UJC6BF6DaBrpdxvvj9SIaFH6lkyIkqC2fPRvmsrEPjy8Rb5NnyZPh04UmRYrRFPN9U3yn4iTEgEK8ltBIkOrdttnuvGtagLGRbQOgnomVhEnVoHt9IlYw9l09dnJ4IU6ZtwBSDqNeiR9rClcVu9_o9wuFy4pCdUsJF2SuGAPHVAXMtzFd8fvqE3FOtNln9BX6S6xdXGIq2v1dwhtiKoeX4vlsF8ZXD_tM_Pry-ef5t3p98fX7-cd17Tolc-0d6m7Wm34qA7N0OCNsWjcp72YlZ6XAYqt9r3uvBlQKNQ52dHYaYRrU2J2Jt8e_uxT_7JGzuSZ2uCw2YNyz6XoFSk1QwDcPoGVnlznZ4IjNLtG1TX9NC0OnpZoKp4-cS5E54WwcZZsphpwsLUaCObQ2W3NobQ6tjWxNaV3U9pH6__uT0oejhKXSDWEy7AiDQ1_6u2x8pKf0f_tUnKs
CitedBy_id	crossref_primary_10_1155_2018_4283087 crossref_primary_10_1007_s00446_009_0082_8 crossref_primary_10_1109_TWC_2017_2762680 crossref_primary_10_1109_ACCESS_2021_3053494 crossref_primary_10_1109_MWC_001_1900551 crossref_primary_10_1016_j_adhoc_2025_104024 crossref_primary_10_1016_j_jnca_2015_01_006 crossref_primary_10_1007_s11277_013_1052_9 crossref_primary_10_1155_2010_312828 crossref_primary_10_3390_fi2030308 crossref_primary_10_1109_ACCESS_2020_2976654 crossref_primary_10_1109_SURV_2011_060710_00062 crossref_primary_10_1002_rsa_20927 crossref_primary_10_1109_TVT_2014_2313272 crossref_primary_10_1016_j_comnet_2012_01_011 crossref_primary_10_3390_a7010145 crossref_primary_10_1016_j_peva_2015_02_001 crossref_primary_10_1109_JIOT_2023_3300774 crossref_primary_10_1109_JSEN_2014_2329391 crossref_primary_10_1016_j_jpdc_2015_05_004 crossref_primary_10_1155_2009_804621 crossref_primary_10_55525_tjst_1633962 crossref_primary_10_4304_jnw_9_9_2319_2327 crossref_primary_10_1007_s42979_022_01459_5 crossref_primary_10_1109_TAC_2017_2688278 crossref_primary_10_1007_s11067_024_09661_z crossref_primary_10_3390_fi2040469 crossref_primary_10_1109_TVT_2023_3234550 crossref_primary_10_1145_3362987 crossref_primary_10_1002_dac_5525 crossref_primary_10_1002_net_21491 crossref_primary_10_1109_TMBMC_2015_2465519 crossref_primary_10_1109_TII_2018_2873974 crossref_primary_10_1186_1687_1499_2012_44 crossref_primary_10_1016_j_jpdc_2016_02_001 crossref_primary_10_1109_COMST_2017_2739418 crossref_primary_10_1587_transcom_2017ITP0011 crossref_primary_10_1109_TII_2018_2853986 crossref_primary_10_1016_j_jpdc_2013_02_004 crossref_primary_10_1016_j_adhoc_2014_09_011 crossref_primary_10_1186_1687_1499_2013_223 crossref_primary_10_1016_j_adhoc_2010_11_004 crossref_primary_10_1016_j_asoc_2020_106470 crossref_primary_10_1016_j_comcom_2011_06_011 crossref_primary_10_1109_TPDS_2012_133 crossref_primary_10_1016_j_cie_2013_11_009 crossref_primary_10_1016_j_comcom_2011_02_012 crossref_primary_10_1007_s42452_020_03923_4
Cites_doi	10.1002/(SICI)1098-2418(199705)10:3<385::AID-RSA6>3.3.CO;2-3 10.1145/190314.190334 10.1023/A:1019126406181 10.1145/129712.129769 10.1145/75427.75463 10.1109/TPDS.2007.41 10.1023/A:1012371402221 10.1016/0020-0190(92)90041-S 10.1016/0020-0190(88)90187-1 10.1109/90.222924 10.1137/S0097539793250767 10.1145/341800.341820 10.1016/j.jpdc.2006.10.007 10.1109/18.21215 10.1023/A:1012311216333 10.1109/98.878532
ContentType	Journal Article
Copyright	2008 Elsevier Ltd 2009 INIST-CNRS
Copyright_xml	– notice: 2008 Elsevier Ltd – notice: 2009 INIST-CNRS
DBID	AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/j.jpdc.2007.12.006
DatabaseName	CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences
EISSN	1096-0848
EndPage	1134
ExternalDocumentID	20538169 10_1016_j_jpdc_2007_12_006 S0743731508000142
GroupedDBID	--K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c361t-dce83f8b498b40f1cefe0b2c96dcf61f660ae28d484d65e66e8e5a7ca97095673
ISICitedReferencesCount	62
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000257899000008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0743-7315
IngestDate	Thu Oct 02 10:42:47 EDT 2025 Mon Jul 21 09:17:47 EDT 2025 Tue Nov 18 22:30:52 EST 2025 Sat Nov 29 07:14:46 EST 2025 Fri Feb 23 02:27:55 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	8
Keywords	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
Language	English
License	CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c361t-dce83f8b498b40f1cefe0b2c96dcf61f660ae28d484d65e66e8e5a7ca97095673
Notes	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
PQID	34606690
PQPubID	23500
PageCount	13
ParticipantIDs	proquest_miscellaneous_34606690 pascalfrancis_primary_20538169 crossref_citationtrail_10_1016_j_jpdc_2007_12_006 crossref_primary_10_1016_j_jpdc_2007_12_006 elsevier_sciencedirect_doi_10_1016_j_jpdc_2007_12_006
PublicationCentury	2000
PublicationDate	2008-08-01
PublicationDateYYYYMMDD	2008-08-01
PublicationDate_xml	– month: 08 year: 2008 text: 2008-08-01 day: 01
PublicationDecade	2000
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationTitle	Journal of parallel and distributed computing
PublicationYear	2008
Publisher	Elsevier Inc Elsevier
Publisher_xml	– name: Elsevier Inc – name: Elsevier
References	S. Gandham, M. Dawande, R. Prakash, S. Venkatesan, Energy efficient schemes for wireless sensor networks with multiple mobile base stations, in: IEEE GLOBECOM, December, 2003 M. Thomas, W. Roger, Z. Aaron, Topology control meets SINR: The scheduling complexity of arbitrary topologies, in: Proceedings of the Seventh ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2006 W.R. Heinzelman, A. Chandrakasan, H. Balakrishnan, Energy-efficient communication protocol for wireless micro sensor networks, in: Proceedings of the 33rd Annual HICSS, 2000 Hajek, Sasaki (b8) 1988; 34 Haapola, Shelby, Pomalaza-Raez, Mahonen (b9) 2005; 4 Shansi, Qun, Haining, Xin, Xiaodong (b24) 2007; 18 D.A. Grable, A. Panconesi, Nearly optimal distributed edge colouring in H. Tamura, K. Watanabe, M. Sengoku, S. Shinoda, On a new edge coloring related to multi-hop wireless networks, in: APCCAS ’02. 2002 Asia-Pacific Conference on Circuits and Systems, Oct. 2002 Singhal, Shivaratri (b23) 1994 Prakash (b19) 2001; 7 N. Li, J.C. Hou, L. Sha, Design and analysis of an MST-based topology control algorithm, in: Proceedings of IEEE INFOCOM, 2003 Ramanathan, Lloyd (b21) 1993; 1 LAN MAN standards committee of the IEEE computer society, in: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specification. IEEE, New York, NY, USA, IEEE Std. 802.11, 1997 M.V. Marathe, A. Panconesi, L.D. Risinger, An Experimental Study of a Simple, Distributed Edge Coloring Algorithm, in: Proc. of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures, 2000 A. Panconesi, A. Srinivasan, Improved distributed algorithms for coloring and network decomposition problems, in: Proc. of the ACM Symposium on Theory of Computing, 1992 Krumke, Marathe, Ravi (b11) 2001; 7 Sohrabi, Gao, Ailawadhi, Pottie (b26) 2000; 7 Mark, Zhuang (b15) 2003 Cidon (b4) 1998; 26 Eric W. Weisstein, Graph thickness. From MathWorld–A Wolfram Web Resource. Berge (b1) 1973 V. Bharghavan, A. Demers, S. Shenker, L. Zhang, MACAW: A media access protocol for wireless LAN’s, in: ACM SIGCOMM, 1994 Olivier, Pierre, Jose (b25) 2007; 67 M.B. Sharma, N.K. Mandyam, S.S. Iyangar, An optimal distributed depth-first-search algorithm, in: Proceedings of the Seventeenth Annual ACM Conference on Computer Science: Computing Trends in the 1990’s, 1989 B. Gurashish, B. Douglas, S. Paolo, Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks, in: Proceedings of Mobicom, 2006 Ramanathan (b20) 1999; 5 Tanenbaum (b29) 1996 Boukerche, Cheng, Linus (b2) 2003 rounds, in: Proc. of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997 Panconesi, Srinivasan (b18) 1997; 26 G. Zhou, T. He, J.A. Stankovic, T.F. Abdelzaher, RID: Radio interference detection in wireless sensor networks, in: Proceedings of IEEE INFOCOM, March 2005 Misra, Gries (b16) 1992; 41 Prakash (10.1016/j.jpdc.2007.12.006_b19) 2001; 7 Krumke (10.1016/j.jpdc.2007.12.006_b11) 2001; 7 10.1016/j.jpdc.2007.12.006_b17 Panconesi (10.1016/j.jpdc.2007.12.006_b18) 1997; 26 Ramanathan (10.1016/j.jpdc.2007.12.006_b21) 1993; 1 Tanenbaum (10.1016/j.jpdc.2007.12.006_b29) 1996 Mark (10.1016/j.jpdc.2007.12.006_b15) 2003 Cidon (10.1016/j.jpdc.2007.12.006_b4) 1998; 26 Ramanathan (10.1016/j.jpdc.2007.12.006_b20) 1999; 5 Singhal (10.1016/j.jpdc.2007.12.006_b23) 1994 Boukerche (10.1016/j.jpdc.2007.12.006_b2) 2003 10.1016/j.jpdc.2007.12.006_b12 Shansi (10.1016/j.jpdc.2007.12.006_b24) 2007; 18 10.1016/j.jpdc.2007.12.006_b13 10.1016/j.jpdc.2007.12.006_b14 Olivier (10.1016/j.jpdc.2007.12.006_b25) 2007; 67 10.1016/j.jpdc.2007.12.006_b30 10.1016/j.jpdc.2007.12.006_b31 Berge (10.1016/j.jpdc.2007.12.006_b1) 1973 10.1016/j.jpdc.2007.12.006_b10 Hajek (10.1016/j.jpdc.2007.12.006_b8) 1988; 34 Sohrabi (10.1016/j.jpdc.2007.12.006_b26) 2000; 7 10.1016/j.jpdc.2007.12.006_b27 10.1016/j.jpdc.2007.12.006_b28 10.1016/j.jpdc.2007.12.006_b6 10.1016/j.jpdc.2007.12.006_b7 10.1016/j.jpdc.2007.12.006_b5 Haapola (10.1016/j.jpdc.2007.12.006_b9) 2005; 4 10.1016/j.jpdc.2007.12.006_b22 10.1016/j.jpdc.2007.12.006_b3 Misra (10.1016/j.jpdc.2007.12.006_b16) 1992; 41
References_xml	– reference: M.V. Marathe, A. Panconesi, L.D. Risinger, An Experimental Study of a Simple, Distributed Edge Coloring Algorithm, in: Proc. of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures, 2000 – volume: 18 start-page: 334 year: 2007 end-page: 350 ident: b24 article-title: Design and analysis of sensing scheduling algorithms under partial coverage for object detection in sensor networks publication-title: IEEE Transactions on Parallel and Distributed Systems – reference: N. Li, J.C. Hou, L. Sha, Design and analysis of an MST-based topology control algorithm, in: Proceedings of IEEE INFOCOM, 2003 – volume: 7 start-page: 16 year: 2000 end-page: 27 ident: b26 article-title: Protocols for self-organization of a wireless sensor network publication-title: IEEE Personal Communications – year: 1973 ident: b1 article-title: Graphs and Hypergraphs – year: 2003 ident: b15 article-title: Wireless Communications and Networking – reference: V. Bharghavan, A. Demers, S. Shenker, L. Zhang, MACAW: A media access protocol for wireless LAN’s, in: ACM SIGCOMM, 1994 – volume: 67 start-page: 302 year: 2007 end-page: 317 ident: b25 article-title: Energy optimal data propagation in wireless sensor networks publication-title: Journal of Parallel and Distributed Computing – reference: W.R. Heinzelman, A. Chandrakasan, H. Balakrishnan, Energy-efficient communication protocol for wireless micro sensor networks, in: Proceedings of the 33rd Annual HICSS, 2000 – volume: 1 start-page: 166 year: 1993 end-page: 177 ident: b21 article-title: Scheduling algorithms for multi-hop radio networks publication-title: IEEE/ACM Transactions on Networking – reference: LAN MAN standards committee of the IEEE computer society, in: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specification. IEEE, New York, NY, USA, IEEE Std. 802.11, 1997 – reference: rounds, in: Proc. of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997 – reference: A. Panconesi, A. Srinivasan, Improved distributed algorithms for coloring and network decomposition problems, in: Proc. of the ACM Symposium on Theory of Computing, 1992 – reference: S. Gandham, M. Dawande, R. Prakash, S. Venkatesan, Energy efficient schemes for wireless sensor networks with multiple mobile base stations, in: IEEE GLOBECOM, December, 2003 – reference: B. Gurashish, B. Douglas, S. Paolo, Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks, in: Proceedings of Mobicom, 2006 – volume: 41 start-page: 131 year: 1992 end-page: 133 ident: b16 article-title: A constructive proof of Vizing’s theorem publication-title: Information Processing Letters – year: 1994 ident: b23 article-title: Advanced Concepts in Operating Systems – volume: 7 start-page: 617 year: 2001 end-page: 626 ident: b19 article-title: A routing algorithm for wireless ad hoc networks with unidirectional links publication-title: ACM/Baltzer Wireless Networks Journal – volume: 5 start-page: 81 year: 1999 end-page: 94 ident: b20 article-title: A unified framework and algorithm for channel assignment in wireless networks publication-title: Wireless Networks – volume: 26 start-page: 301 year: 1998 end-page: 305 ident: b4 article-title: Yet another distributed depth-first-search algorithm publication-title: Information Processing Letters – volume: 26 start-page: 350 year: 1997 end-page: 368 ident: b18 article-title: Randomized distributed edge coloring publication-title: SIAM Journal on Computing – volume: 7 start-page: 575 year: 2001 end-page: 584 ident: b11 article-title: Models and approximation algorithms for channel assignment in radio networks publication-title: Wireless Networks – volume: 4 start-page: 523 year: 2005 end-page: 540 ident: b9 article-title: Multihop medium access control for WSNs: An energy analysis model publication-title: Journal on Wireless Communications and Networking – reference: M.B. Sharma, N.K. Mandyam, S.S. Iyangar, An optimal distributed depth-first-search algorithm, in: Proceedings of the Seventeenth Annual ACM Conference on Computer Science: Computing Trends in the 1990’s, 1989 – volume: 34 start-page: 910 year: 1988 end-page: 917 ident: b8 article-title: Link scheduling in polynomial time publication-title: IEEE Transactions on Information Theory – reference: Eric W. Weisstein, Graph thickness. From MathWorld–A Wolfram Web Resource. – reference: M. Thomas, W. Roger, Z. Aaron, Topology control meets SINR: The scheduling complexity of arbitrary topologies, in: Proceedings of the Seventh ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2006 – reference: D.A. Grable, A. Panconesi, Nearly optimal distributed edge colouring in – reference: G. Zhou, T. He, J.A. Stankovic, T.F. Abdelzaher, RID: Radio interference detection in wireless sensor networks, in: Proceedings of IEEE INFOCOM, March 2005 – reference: H. Tamura, K. Watanabe, M. Sengoku, S. Shinoda, On a new edge coloring related to multi-hop wireless networks, in: APCCAS ’02. 2002 Asia-Pacific Conference on Circuits and Systems, Oct. 2002 – start-page: 42 year: 2003 end-page: 49 ident: b2 article-title: Energy-aware data-centric routing in microsensor networks publication-title: ACM MSWiM – year: 1996 ident: b29 article-title: Computer Networks – ident: 10.1016/j.jpdc.2007.12.006_b7 doi: 10.1002/(SICI)1098-2418(199705)10:3<385::AID-RSA6>3.3.CO;2-3 – ident: 10.1016/j.jpdc.2007.12.006_b3 doi: 10.1145/190314.190334 – volume: 5 start-page: 81 year: 1999 ident: 10.1016/j.jpdc.2007.12.006_b20 article-title: A unified framework and algorithm for channel assignment in wireless networks publication-title: Wireless Networks doi: 10.1023/A:1019126406181 – ident: 10.1016/j.jpdc.2007.12.006_b17 doi: 10.1145/129712.129769 – ident: 10.1016/j.jpdc.2007.12.006_b22 doi: 10.1145/75427.75463 – year: 1994 ident: 10.1016/j.jpdc.2007.12.006_b23 – volume: 18 start-page: 334 issue: 3 year: 2007 ident: 10.1016/j.jpdc.2007.12.006_b24 article-title: Design and analysis of sensing scheduling algorithms under partial coverage for object detection in sensor networks publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/TPDS.2007.41 – volume: 7 start-page: 617 issue: 6 year: 2001 ident: 10.1016/j.jpdc.2007.12.006_b19 article-title: A routing algorithm for wireless ad hoc networks with unidirectional links publication-title: ACM/Baltzer Wireless Networks Journal doi: 10.1023/A:1012371402221 – start-page: 42 year: 2003 ident: 10.1016/j.jpdc.2007.12.006_b2 article-title: Energy-aware data-centric routing in microsensor networks publication-title: ACM MSWiM – year: 2003 ident: 10.1016/j.jpdc.2007.12.006_b15 – ident: 10.1016/j.jpdc.2007.12.006_b30 – volume: 41 start-page: 131 year: 1992 ident: 10.1016/j.jpdc.2007.12.006_b16 article-title: A constructive proof of Vizing’s theorem publication-title: Information Processing Letters doi: 10.1016/0020-0190(92)90041-S – volume: 26 start-page: 301 issue: 6 year: 1998 ident: 10.1016/j.jpdc.2007.12.006_b4 article-title: Yet another distributed depth-first-search algorithm publication-title: Information Processing Letters doi: 10.1016/0020-0190(88)90187-1 – ident: 10.1016/j.jpdc.2007.12.006_b27 – ident: 10.1016/j.jpdc.2007.12.006_b6 – volume: 1 start-page: 166 year: 1993 ident: 10.1016/j.jpdc.2007.12.006_b21 article-title: Scheduling algorithms for multi-hop radio networks publication-title: IEEE/ACM Transactions on Networking doi: 10.1109/90.222924 – year: 1996 ident: 10.1016/j.jpdc.2007.12.006_b29 – volume: 26 start-page: 350 issue: 2 year: 1997 ident: 10.1016/j.jpdc.2007.12.006_b18 article-title: Randomized distributed edge coloring publication-title: SIAM Journal on Computing doi: 10.1137/S0097539793250767 – ident: 10.1016/j.jpdc.2007.12.006_b14 doi: 10.1145/341800.341820 – volume: 67 start-page: 302 issue: 3 year: 2007 ident: 10.1016/j.jpdc.2007.12.006_b25 article-title: Energy optimal data propagation in wireless sensor networks publication-title: Journal of Parallel and Distributed Computing doi: 10.1016/j.jpdc.2006.10.007 – ident: 10.1016/j.jpdc.2007.12.006_b13 – volume: 34 start-page: 910 year: 1988 ident: 10.1016/j.jpdc.2007.12.006_b8 article-title: Link scheduling in polynomial time publication-title: IEEE Transactions on Information Theory doi: 10.1109/18.21215 – volume: 4 start-page: 523 year: 2005 ident: 10.1016/j.jpdc.2007.12.006_b9 article-title: Multihop medium access control for WSNs: An energy analysis model publication-title: Journal on Wireless Communications and Networking – ident: 10.1016/j.jpdc.2007.12.006_b31 – ident: 10.1016/j.jpdc.2007.12.006_b12 – ident: 10.1016/j.jpdc.2007.12.006_b10 – ident: 10.1016/j.jpdc.2007.12.006_b5 – year: 1973 ident: 10.1016/j.jpdc.2007.12.006_b1 – volume: 7 start-page: 575 year: 2001 ident: 10.1016/j.jpdc.2007.12.006_b11 article-title: Models and approximation algorithms for channel assignment in radio networks publication-title: Wireless Networks doi: 10.1023/A:1012311216333 – ident: 10.1016/j.jpdc.2007.12.006_b28 – volume: 7 start-page: 16 issue: 5 year: 2000 ident: 10.1016/j.jpdc.2007.12.006_b26 article-title: Protocols for self-organization of a wireless sensor network publication-title: IEEE Personal Communications doi: 10.1109/98.878532
SSID	ssj0011578
Score	2.167503
Snippet	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...
SourceID	proquest pascalfrancis crossref elsevier
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	1122
SubjectTerms	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
Title	Link scheduling in wireless sensor networks: Distributed edge-coloring revisited
URI	https://dx.doi.org/10.1016/j.jpdc.2007.12.006 https://www.proquest.com/docview/34606690
Volume	68
WOSCitedRecordID	wos000257899000008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lj9MwELbKLgckxHtFeSw-cKuC8rQdbhEtKiAqHovoLUptR9sqSqu2W-2P4EczE9vZdBcWOHBoVDmNE3W-zIzHM98Q8lKyWRJHsvDSWJVeXPiRJxLpw1IlVkj_JOBc02yCTyZiOk0_9Xo_XC3MruJ1Lc7P09V_FTWMgbCxdPYfxN1OCgPwHYQORxA7HP9K8Li6HMCaFWxIZQtWkI-4QpW2gUXrcj2oTe73pokHDJE6F7tegeuJwTUPeaybrLx1U3m-3e_l2fFgkTa8qrQhG1CdaWTTKsIZRczuySbDcfaxCbWeYvsmdVq0WcHD7DucHpkkfnhk1arrL9mH7Ou4QUGxm-8FKESbHmejZtbEdxQb0qLyyJRxOi3MRAdtoqNSwSEMO-Y5CEzw84rqN1GIxavFSllqSgzz-r_g2b5k_9qsxBAUkghYeoMchjxJQUceZu9G0_ftrlSQGMvunt8WYZl8wcv3_Z2jc3tVbOD1K03flCsuQOPXnNwjd6w4aWaAdJ_0dP2A3LWLE2pV_waGXP8PN_aQfEao0Quo0XlNHdSogRp1UKOvaQdodA9otAXaI_Lt7ejkzdizLTo8GbFg6ympRVSKWZzCxy8DqUvtz0KZMiVLFpSM-YUOhYpFrFiiGdNCJwWXRcqRAZNHR-SgXtb6MaGFEpyXpeQSPMYI9_eTWEVI9lQEPFCsTwL3f-bS8tdjG5Uqd4mKixxlgI1VeR6EOcigTwbtNSvD3nLtrxMnptz6n8avzAFj1153vCfT9lYOUH3ywgk5B-2NW3JFrZdnmzyKMYCQ-k_-NMVTcuvi3XpGDrbrM_2c3JS77XyzPrZA_Qll2buL
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Link+scheduling+in+wireless+sensor+networks+%3A+Distributed+edge-coloring+revisited&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=GANDHAM%2C+Shashidhar&rft.au=DAWANDE%2C+Milind&rft.au=PRAKASH%2C+Ravi&rft.date=2008-08-01&rft.pub=Elsevier&rft.issn=0743-7315&rft.volume=68&rft.issue=8&rft.spage=1122&rft.epage=1134&rft_id=info:doi/10.1016%2Fj.jpdc.2007.12.006&rft.externalDBID=n%2Fa&rft.externalDocID=20538169
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon