Report
Link Scheduling in STDMA Wireless Networks: A Line Graph Approach
العنوان: | Link Scheduling in STDMA Wireless Networks: A Line Graph Approach |
---|---|
المؤلفون: | Kumar, N. Praneeth, Gore, Ashutosh Deepak, Karandikar, Abhay |
سنة النشر: | 2007 |
المجموعة: | Computer Science |
مصطلحات موضوعية: | Computer Science - Networking and Internet Architecture |
الوصف: | We 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. Comment: 4 pages, 1 figure |
نوع الوثيقة: | Working Paper |
URL الوصول: | http://arxiv.org/abs/0712.1662 |
رقم الانضمام: | edsarx.0712.1662 |
قاعدة البيانات: | arXiv |
ResultId |
1 |
---|---|
Header |
edsarx arXiv edsarx.0712.1662 927 3 Report report 927.48193359375 |
PLink |
https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.0712.1662&custid=s6537998&authtype=sso |
FullText |
Array
(
[Availability] => 0
)
Array ( [0] => Array ( [Url] => http://arxiv.org/abs/0712.1662 [Name] => EDS - Arxiv [Category] => fullText [Text] => View record in Arxiv [MouseOverText] => View record in Arxiv ) ) |
Items |
Array
(
[Name] => Title
[Label] => Title
[Group] => Ti
[Data] => Link Scheduling in STDMA Wireless Networks: A Line Graph Approach
)
Array ( [Name] => Author [Label] => Authors [Group] => Au [Data] => <searchLink fieldCode="AR" term="%22Kumar%2C+N%2E+Praneeth%22">Kumar, N. Praneeth</searchLink><br /><searchLink fieldCode="AR" term="%22Gore%2C+Ashutosh+Deepak%22">Gore, Ashutosh Deepak</searchLink><br /><searchLink fieldCode="AR" term="%22Karandikar%2C+Abhay%22">Karandikar, Abhay</searchLink> ) Array ( [Name] => DatePubCY [Label] => Publication Year [Group] => Date [Data] => 2007 ) Array ( [Name] => Subset [Label] => Collection [Group] => HoldingsInfo [Data] => Computer Science ) Array ( [Name] => Subject [Label] => Subject Terms [Group] => Su [Data] => <searchLink fieldCode="DE" term="%22Computer+Science+-+Networking+and+Internet+Architecture%22">Computer Science - Networking and Internet Architecture</searchLink> ) Array ( [Name] => Abstract [Label] => Description [Group] => Ab [Data] => We 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.<br />Comment: 4 pages, 1 figure ) Array ( [Name] => TypeDocument [Label] => Document Type [Group] => TypDoc [Data] => Working Paper ) Array ( [Name] => URL [Label] => Access URL [Group] => URL [Data] => <link linkTarget="URL" linkTerm="http://arxiv.org/abs/0712.1662" linkWindow="_blank">http://arxiv.org/abs/0712.1662</link> ) Array ( [Name] => AN [Label] => Accession Number [Group] => ID [Data] => edsarx.0712.1662 ) |
RecordInfo |
Array
(
[BibEntity] => Array
(
[Subjects] => Array
(
[0] => Array
(
[SubjectFull] => Computer Science - Networking and Internet Architecture
[Type] => general
)
)
[Titles] => Array
(
[0] => Array
(
[TitleFull] => Link Scheduling in STDMA Wireless Networks: A Line Graph Approach
[Type] => main
)
)
)
[BibRelationships] => Array
(
[HasContributorRelationships] => Array
(
[0] => Array
(
[PersonEntity] => Array
(
[Name] => Array
(
[NameFull] => Kumar, N. Praneeth
)
)
)
[1] => Array
(
[PersonEntity] => Array
(
[Name] => Array
(
[NameFull] => Gore, Ashutosh Deepak
)
)
)
[2] => Array
(
[PersonEntity] => Array
(
[Name] => Array
(
[NameFull] => Karandikar, Abhay
)
)
)
)
[IsPartOfRelationships] => Array
(
[0] => Array
(
[BibEntity] => Array
(
[Dates] => Array
(
[0] => Array
(
[D] => 11
[M] => 12
[Type] => published
[Y] => 2007
)
)
)
)
)
)
)
|
IllustrationInfo |