Link Scheduling in STDMA Wireless Networks: A Line Graph Approach

Simple item page
dc.creatorKumar, N. Praneeth
dc.creatorGore, Ashutosh Deepak
dc.creatorKarandikar, Abhay
dc.date2007-12-11
dc.date.accessioned2026-07-07T08:48:33Z
dc.date.available2026-07-07T08:48:33Z
dc.descriptionWe consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link scheduling algorithm based on a line graph representation of the network, by embedding the interferences between pairs of nodes into the edge weights of the line graph. Our algorithm achieves lower schedule length and lower run time complexity than existing algorithms.
dc.description4 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/0712.1662
dc.identifierhttp://arxiv.org/abs/0712.1662
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143985
dc.subjectNetworking and Internet Architecture
dc.titleLink Scheduling in STDMA Wireless Networks: A Line Graph Approach
dc.typetext

Files

Collections

arXiv