DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Chae Young | ko |
dc.contributor.author | Sohn, Hee Seok | ko |
dc.date.accessioned | 2016-11-09T04:52:22Z | - |
dc.date.available | 2016-11-09T04:52:22Z | - |
dc.date.created | 2016-10-12 | - |
dc.date.created | 2016-10-12 | - |
dc.date.issued | 2016-05 | - |
dc.identifier.citation | 한국경영과학회지, v.41, no.2, pp.53 - 65 | - |
dc.identifier.issn | 1225-1119 | - |
dc.identifier.uri | http://hdl.handle.net/10203/213657 | - |
dc.description.abstract | Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol:end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results. | - |
dc.language | English | - |
dc.publisher | 한국경영과학회 | - |
dc.title | 다중 홉 무선 네트웤에서 지연을 고려한 멀티케스트 루팅 | - |
dc.title.alternative | Delay Guaranteed Bandwidth-Efficient Multicast Routing in Wireless Multi-hop Networks | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 41 | - |
dc.citation.issue | 2 | - |
dc.citation.beginningpage | 53 | - |
dc.citation.endingpage | 65 | - |
dc.citation.publicationname | 한국경영과학회지 | - |
dc.identifier.doi | 10.7737/JKORMS.2016.41.2.053 | - |
dc.identifier.kciid | ART002111404 | - |
dc.contributor.localauthor | Lee, Chae Young | - |
dc.subject.keywordAuthor | Wireless Multi-Hop Network | - |
dc.subject.keywordAuthor | Multicast Routing | - |
dc.subject.keywordAuthor | Minimum Node Tree | - |
dc.subject.keywordAuthor | Integer Linear Programming | - |
dc.subject.keywordAuthor | Preprocessing | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.