Maximum scan statistics and channel assignment problems in homogeneous wireless networks

DOI10.1016/J.TCS.2009.02.027MaRDI QIDQ1019740zbMATH OpenOpenAlexFDO

Authors Chih-Wei Yi

Publication date 28 May 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.02.027

zbMATH Keywords

chromatic numbersclique numberschannel assignmentwireless ad hoc networksinductivitiesmaximum scan statistics

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Random channel assignment in the plane
• Soft Edge Coloring
• Spectrum graph coloring and applications to Wi-Fi channel assignment
• scientific article; zbMATH DE number 1769307
• scientific article; zbMATH DE number 17557

Cites work

• scientific article; zbMATH DE number 1340281 (Why is no real title available?)
• Coverage by randomly deployed wireless sensor networks
• Focusing of the scan statistic and geometric clique number
• On coloring unit disk graphs
• Random channel assignment in the plane
• Scan statistics
• Simple heuristics for unit disk graphs
• Smallest-last ordering and clustering and graph coloring algorithms
• Unit disk graphs

Cited in

(1)

• Incidence coloring of mycielskians with fast algorithm

This page was built for publication: Maximum scan statistics and channel assignment problems in homogeneous wireless networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019740)