Approximating Optimal Multicast Trees in Wireless Multihop Networks

Ruíz, Pedro Ortega; Gómez‐Skarmeta, Antonio F.

doi:10.1109/iscc.2005.34

Cited by 98 publications

(84 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…According to [18] this problem is also NP-complete, even when every edge has the same cost, by reduction from the exact cover by 3-set. Although it is widely assumed that a Steiner tree is the minimal cost multicast tree, it is not generally true in multihop wireless networks [19]. The problem of minimizing the cost of a multicast tree in an ad hoc network needs to be re-formulated in terms of minimizing the number of the data transmissions.…”

Section: The Tree-based Multicast Algorithmmentioning

confidence: 99%

Token-based Autonomous Task Allocation in Flocking Systems

Kokuti¹,

Simon²,

Wiandt³

2016

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

Abstract-There are serious contributions to the theoretical foundations of flocking systems, but there are only few systems which have the capability of autonomous task allocation, however, many use cases demand this functionality. The implementation of a task allocation algorithm could be a serious challenge even in a simulated environment due to the numerous problems arising from the nature of these systems.This paper proposes a novel algorithm to find the optimal allocation of heterogeneous agents to heterogeneous tasks by utilizing distributed auctions based on local peer-to-peer wireless communication and exploiting graph theory with a tree-based multicast protocol. The solution was tested over a number of different scenarios and compared to existing algorithms in order to measure and prove its capability in handling autonomous task allocation in different systems as well.

show abstract

Section: The Tree-based Multicast Algorithmmentioning

confidence: 99%

Token-based Autonomous Task Allocation in Flocking Systems

Kokuti¹,

Simon²,

Wiandt³

2016

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

show abstract

“…In [12], the authors proved NP-Completeness of MNT and proposed a node minimized algorithm. They showed that, similar to minimum Steiner tree problems, MNT is also a NP-Complete problem, because this problem can be represented by the well-known vertex cover problem [5].…”

Section: Related Workmentioning

confidence: 99%

“…Recently, [3,9,12,13] suggested that reduction of bandwidth consumption in wireless networks is another key factor to affect the performance of multicast routing trees. Bandwidth consumption can be measured by counting the number of transmissions in a network and each transmission has its own bandwidth requirement.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Delay Guaranteed Bandwidth-Efficient Multicast Routing in Wireless Multi-hop Networks

Sohn¹,

Lee²

2016

Journal of the Korean Operations Research and Management Scienc

View full text Add to dashboard Cite

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.

show abstract

“…On the other hand MCT tree is based on minimum Steiner tree (MST) which is NP-Hard problem [3]. For wireless networks, the MCT cost is redefined in [4]. Because in wireless network the transmission of multicast packet to any number of neighbor can be done by single transmission, minimum cost tree is one which connect the source and receivers with minimum number of transmission.…”

Section: Introductionmentioning

confidence: 99%

ASSM: Agent Based Source Specific Multicast Routing Protocol for Wireless Mesh Networks

Khayat¹

2012

IJIEE

View full text Add to dashboard Cite

Abstract-Wireless mesh networks (WMNs) are new emerging networks which are anticipated to resolve many limitation of ad-hoc networks, sensor networks and wireless local area networks and improve their performance. But still there are many unresolved research challenge in this area. In this paper we have proposed source-specific multicast protocol for wireless mesh network, which has many application in, multimedia, radio and TV multicasting and distance learning. We have used core-based approach to construct minimum cost tree (MCT) among member nodes and optimized this tree for multiple metrics by applying ant colony optimization metaphor.

show abstract

Approximating Optimal Multicast Trees in Wireless Multihop Networks

Cited by 98 publications

References 7 publications

Token-based Autonomous Task Allocation in Flocking Systems

Token-based Autonomous Task Allocation in Flocking Systems

Delay Guaranteed Bandwidth-Efficient Multicast Routing in Wireless Multi-hop Networks

ASSM: Agent Based Source Specific Multicast Routing Protocol for Wireless Mesh Networks

Contact Info

Product

Resources

About