다중 홉 무선 네트웤에서 지연을 고려한 멀티케스트 루팅 Delay Guaranteed Bandwidth-Efficient Multicast Routing in Wireless Multi-hop Networks

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 778
  • Download : 0
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.
Publisher
한국경영과학회
Issue Date
2016-05
Language
English
Citation

한국경영과학회지, v.41, no.2, pp.53 - 65

ISSN
1225-1119
DOI
10.7737/JKORMS.2016.41.2.053
URI
http://hdl.handle.net/10203/213657
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0