There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 1248 | - |
dc.citation.number | 7 | - |
dc.citation.startPage | 1237 | - |
dc.citation.title | IEEE TRANSACTIONS ON MOBILE COMPUTING | - |
dc.citation.volume | 11 | - |
dc.contributor.author | Gandhi, Rajiv | - |
dc.contributor.author | Kim, Yoo-Ah | - |
dc.contributor.author | Lee, Seungjoon | - |
dc.contributor.author | Ryu, Jiho | - |
dc.contributor.author | Wan, Peng-Jun | - |
dc.date.accessioned | 2023-12-22T05:06:58Z | - |
dc.date.available | 2023-12-22T05:06:58Z | - |
dc.date.created | 2013-06-10 | - |
dc.date.issued | 2012-07 | - |
dc.description.abstract | Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interference at a node due to simultaneous transmissions from its neighbors makes it nontrivial to design a minimum-latency broadcast algorithm, which is known to be NP-complete. We present a simple 12-approximation algorithm for the one-to-all broadcast problem that improves all previously known guarantees for this problem. We then consider the all-to-all broadcast problem where each node sends its own message to all other nodes. For the all-to-all broadcast problem, we present two algorithms with approximation ratios of 20 and 34, improving the best result available in the literature. Finally, we report experimental evaluation of our algorithms. Our studies indicate that our algorithms perform much better in practice than the worst-case guarantees provided in the theoretical analysis and achieve up to 37 percent performance improvement over existing schemes. | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON MOBILE COMPUTING, v.11, no.7, pp.1237 - 1248 | - |
dc.identifier.doi | 10.1109/TMC.2011.162 | - |
dc.identifier.issn | 1536-1233 | - |
dc.identifier.scopusid | 2-s2.0-84861431225 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/2984 | - |
dc.identifier.url | http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84861431225 | - |
dc.identifier.wosid | 000304148900013 | - |
dc.language | 영어 | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.title | Approximation Algorithms for Data Broadcast in Wireless Networks | - |
dc.type | Article | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems; Telecommunications | - |
dc.relation.journalResearchArea | Computer Science; Telecommunications | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Ad hoc networking | - |
dc.subject.keywordAuthor | approximation algorithms | - |
dc.subject.keywordAuthor | broadcast algorithms | - |
dc.subject.keywordAuthor | wireless scheduling | - |
dc.subject.keywordPlus | AD-HOC NETWORKS | - |
dc.subject.keywordPlus | RADIO NETWORKS | - |
dc.subject.keywordPlus | LATENCY | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.