Algorithms on Graphs with Small Dominating Targets

Aggarwal, Divesh; Dubey, Chandan K.; Mehta, Shashank K.

doi:10.1007/11940128_16

Cited by 5 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The total size of the SCDS constructed by Muhammad's algorithm is smaller than 2(|M I S|+OPT−1)+1, and the message and time complexity of this algorithm are O(2 |V |) and O ((|V | − 1) · |E| · log |V |), respectively. Aggarwal et al [9] proposed an algorithm for approximating the MSCDS in a dominating pair graph. The time complexity of the proposed algorithm is O(|V | 8 · |R|), where |V |and |R|denotes the cardinality of the vertex set and terminal-set, respectively.…”

Section: Steiner Connected Dominating Setmentioning

confidence: 99%

“…Indeed, in SCDS problem, a specified subset, R, of the vertices has to be dominated by the a connected dominating set. Finding the SCDS of the network graph is a well-known approach proposed for solving the multicast routing problem in wireless ad-hoc networks [2,3,[6][7][8][9], where subset R comprises the multicast source and the multicast receivers. In this method, the SCDS includes the intermediate nodes by which the massage sent out by the multicast source is relayed.…”

Section: Dominating Setmentioning

confidence: 99%

See 1 more Smart Citation

Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs

Torkestani

Meybodi

2010

Wireless Pers Commun

View full text Add to dashboard Cite

In this paper, we first propose three centralized learning automata-based heuristic algorithms for approximating a near optimal solution to the minimum weight Steiner connected dominating set (WSCDS) problem. Finding the Steiner connected dominating set of the network graph is a promising approach for multicast routing in wireless ad-hoc networks. Therefore, we present a distributed implementation of the last approximation algorithm proposed in this paper (Algorithm III) for multicast routing in wireless mobile ad-hoc networks. The proposed WSCDS algorithms are compared with the well-known existing algorithms and the obtained results show that Algorithm III outperforms the others both in terms of the dominating set size and running time. Our simulation experiments also show the superiority of the proposed multicast routing algorithm over the best previous methods in terms of the packet delivery ratio, multicast route lifetime, and end-to-end delay.

show abstract

Section: Steiner Connected Dominating Setmentioning

confidence: 99%

Section: Dominating Setmentioning

confidence: 99%

Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs

Torkestani

Meybodi

2010

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…In a wired network, the multicast packets are forwarded along the tree edges, and so the multicast routing problem can be defined as a Steiner tree problem where the multicast group members are the terminals (leaf nodes) in the Steiner tree [2]. The problem of finding a Steiner tree is known to be NP-complete [3], even if links have unit cost [4]. It should be noted that in some multicast routing protocols [5,6] the minimum spanning tree problem, which is a well known approach for broadcasting, is also used to model the multicast routing problem.…”

Section: Multicast Routing Problemmentioning

confidence: 99%

Multicast Routing Protocols in MANET

Torkestani

Meybodi

2012

Technological Advancements and Applications in Mobile Ad-Hoc Networks

View full text Add to dashboard Cite

Multicast routing is an effective way to establish the group communication when the same message or the same stream of data needs to be sent to multiple receivers. Multicast routing has attracted a lot of attention in group oriented computing due to supporting data transmission from a single source node to multiple destinations concurrently. The advantage of multicast routing lies in its capability of reducing the communication cost and saving the network resources by sending only one copy of the message over the shared link leading to different destinations. Generally speaking, this survey classifies the multicast routing protocols into four categories based on the underlying routing structure: tree-based, mesh-based, hybrid and stateless multicast routing protocols. This survey summarizes the well-known most recent protocols of each category and compares their objectives, performances, advantages and disadvantages. This survey study helps us to choose the best multicasting protocol for each network application with respect to the requirements of application.

show abstract

“…In a wired network, the multicast packets are forwarded along the tree edges, and so the multicast routing problem can be defined as a Steiner tree problem where the multicast group members are the terminals (leaf nodes) in the Steiner tree (Wu, Xu, Chen, & Wang, 2004). The problem of finding a Steiner tree is known to be NP-complete (Karp, 1972), even if links have unit cost (Aggarwal, Dubey, & Mehta, 2006). It should be noted that in some multicast routing protocols (Chiang, Liu, & Huang, 2007;Rodolakis et al, 2008) the minimum spanning tree problem, which is a well known approach for broadcasting, is also used to model the multicast routing problem.…”

Section: Multicast Routing Problemmentioning

confidence: 99%

“…, respectively. Aggarwal et al (Aggarwal, Dubey, & Mehta, 2006) proposed an algorithm for approximating the MSCDS in a dominating pair graph. The time complexity of the proposed algorithm is…”

Section: Mesh-based Multicast Routing Protocolsmentioning

confidence: 99%

Technological Advancements and Applications in Mobile Ad-Hoc Networks

2012

View full text Add to dashboard Cite

Technological advancements and applications in mobile ad-hoc networks: research trends / Kamaljit I. Lakhtaria, editor. p. cm. Includes bibliographical references and index. Summary: "This book offers a current look into the latest research in the ad-hoc network field, including frameworks for development and future directions of a wide range of applications, theories, and use across industrial, commercial, and domestic settings"-Provided by publisher.

show abstract

Algorithms on Graphs with Small Dominating Targets

Cited by 5 publications

References 13 publications

Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs

Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs

Multicast Routing Protocols in MANET

Technological Advancements and Applications in Mobile Ad-Hoc Networks

Contact Info

Product

Resources

About