S. Guha, S. Khuller, Approximation algorithms for connected dominating sets, in: European Symposium on Algorithms, 1996, pp. 179--193.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....The global broadcast protocol, centralized or distributed, is based on global state information. A survey of centralized broadcasting algorithms (using global information) is given in [Pe] and they will not be covered in this chapter. The classical approximation algorithm by Guha and Khuller [GK] for connected dominating set is based on global information. In quasi global broadcasting, a broadcast protocol is based on partial global state information. For example, the approximation algorithm in [AWF] is based on building a global spanning tree (a form of partial global state information) ....

S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica, Vol. 20, No. 4, April 1998, 374 - 387.

....In addition, internal nodes concept has reduced the maintenance communication cost compared to clustered structure. The efficiency of broadcasting appears to be directly related to the construction of a connected dominating set of minimal size. Unfortunately, the problem is NP complete [13] [10], 34] even for a centralized algorithm, consequently in distributed setting, and more so if a localized algorithm is designed, as in this paper. There are no known bounds on the ratio of dominating set size used in this paper [WS] to the size of minimal connected dominating set. Several ....

....algorithm, consequently in distributed setting, and more so if a localized algorithm is designed, as in this paper. There are no known bounds on the ratio of dominating set size used in this paper [WS] to the size of minimal connected dominating set. Several centralized heuristics are proposed in [10] but even their performance is far from what is desirable in our case. Thus, constructing smaller dominating sets in localized manner is an open problem. We believe that further savings and perhaps guaranteed delivery may be achieved by improving proposed algorithms in various ways. The main ....

S. Guha and S. Khuller, "Approximation Algorithms for Connected Dominating Sets," Algorithmica, vol. 20, pp. 347-387, 1998.

....become adjacent, one of them has to abdicate. All these local cluster maintenance may cause other changes to propagate through the network. This is commonly referred to as the chain e#ect [13] Connected dominating sets are often used to determine clusterheads in MANETs. Guha and Khuller [16] proposed centralized approximation algorithms for finding small connected dominating sets in arbitrary connected graphs, which have asymptotically optimal approximation ratios of O(lg #) where # is the maximum vertex degree of the input graph. Das and Bharghavan [9] provided distributed ....

.... dominating set was first proposed for clustering ad hoc networks by Chen and Liestman [8] The non localized approximation algorithms in [8] were shown to find weakly connected dominating sets consistently smaller than the connected dominating sets found by the algorithms of Guha and Khuller [16]. In this paper, we present a zonal distributed algorithm to find a small weaklyconnected dominating set of the input graph G = V, E) The graph is first partitioned into non overlapping regions. Then a greedy approximation algorithm is executed to find a small weakly connected dominating set of ....

[Article contains additional citation context not shown here]

S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374--387, 1998.

.... In this paper we use a clustering technique in order to drop the#e366 del assumption from [19] Clustering for the means of ad hoc routing has been proposed by various researchers [5, 18] A closely related approach is the construction of connected dominating sets as routing backbones [11, 26]. 3 Model and Preliminaries In this paper we assume that network nodes are placed in the Euclidean plane R . In order to represent adhoc networks we adopt the widely used model, where every node has the same transmission range, without loss of generality normalized to 1. The resulting graph, ....

S. Guha and S. Khuller. Approximation Algorithms for Connected Dominating Sets. In J. Daz and M. Serna, editors, Algorithms---ESA '96, Fourth Annual European Symposium, volume 1136 of Lecture Notes in Computer Science, pages 179--193. Springer, 1996.

....require multiple non deterministic and incremental steps, and may incur an election jitter during the process, due to the lack of consensus about the nodes that should be the clusterheads. Examples of this approach are the core extraction algorithm [72] and the spanning tree algorithm [39]. SPAN [20] allows a node to delay clusterhead announcement for di#erent amounts of time to inspect the clusterheads in its one hop neighborhood. On the other hand, deterministic criteria can resolve the clusterheads in a single round. Di#erent heuristics have been used to form clusters and to ....

....to this approach as Lowest ID. Banerjee and Khuller [7] assigned a weight value to each node for clusterhead election, which is essentially the same as Lowest ID. The node degree is another commonly used metric in which nodes with more one hop neighbors are more likely to become clusterheads [39] [41] 72] We refer to this approach as Max Degree. Chiang et al. 21] have shown that the Lowest ID algorithm performs better than the clusterhead election algorithms based on node degrees in terms of clusterhead stability in mobile multihop networks. Basu et al. 18] suggested to use the mean ....

[Article contains additional citation context not shown here]

S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20, (no.4):374--87, Apr. 1998. Springer-Verlag.

....wired networks for two reasons: node mobility and scarce system resources. Because of the diversity in node movement patterns, there is no single optimal scheme for all situations in ad hoc networks. In a low mobility environment, tree based schemes such as minimal connected dominating set (MCDS) [2] are better in reducing resource consumption. In a high mobility environment, simple flooding is the only way to achieve the full coverage; that is, the broadcast packet is guaranteed to be received by every node in the network, providing there is no packet loss caused by collision in the MAC ....

....history, and node degrees as priority values. The enhanced neighbordesignating algorithm (END) as described in [6] is the most efficient neighbor designating algorithm. The third algorithm is based on Guha and Khuller s approximation algorithm to form a minimum connected dominating set (MCDS) [2]. This algorithm is not localized, as it requires global information to compute the forward node set. However, it can produce a near optimal forward node set. Here we use it as a substitution of a perfect algorithm that produces the optimal result. The simple flooding method does not appear in ....

S. Guha and S. Khuller, "Approximation algorithms for connected dominating sets," Algorithmica, vol. 20, no. 4, pp. 374--387, Apr. 1998.

....the highest degree in the graph. Unless the problems of NP can be solved by deterministic n algorithms, this is the best possible up to lower order terms [6] For the related problem of finding small connected dominating sets, a similar approach is shown to be a (ln # O(1) approximation in [9]. For the distributed construction of dominating sets, several algorithms have been developed. In [13] an algorithm which calculates a dominating set of size at most n 2 in O(log # n) rounds has been proposed. 19] presents a (connected) dominating set al..gorithm which runs in a constant number of ....

....case that all nodes know the highest degree # in the network. In a second step, we will then generalize this algorithm such that the knowledge of # is not necessary any more. During the algorithms, the nodes increase their x values over time. In accordance with other dominating set papers (e.g. [9, 10]) we say that a node v i is colored gray as soon as the sum of the weights x j for v j N i exceeds 1, i.e. as soon as the node is covered. Initially all nodes are colored white. The number of white nodes v j N i at a given time is called the dynamic degree of v i and denoted by #(v i ) ....

S. Guha and S. Khuller. Approximation Algorithms for Connected Dominating Sets. In Proc. of the 4th Annual European Symposium on Algorithms (ESA), volume 1136 of Lecture Notes in Computer Science, pages 179--193, 1996.

No context found.

S. Guha, S. Khuller, Approximation algorithms for connected dominating sets, in: European Symposium on Algorithms, 1996, pp. 179--193.

No context found.

Sudipto Guha and Samir Khuller. Approximation algorithms for connected dominating sets. In European symposium on algorithms, pages 179--193, 1996. 147

No context found.

S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Tech. Report 3660, University of Maryland, College Park, June 1996.

No context found.

S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374--387, 1998.

No context found.

S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20:374--387, 1998.

No context found.

S. Guha and S. Khuller. Approximation Algorithms for Connected Dominating Sets. In J. Daz and M. Serna, editors, Algorithms---ESA '96, Fourth Annual European Symposium, volume 1136 of Lecture Notes in Computer Science, pages 179--193. Springer, 1996.

No context found.

S. Guha and S. Khuller. Approximation Algorithms for Connected Dominating Sets. In Proc. of the 4th Annual European Symposium on Algorithms (ESA), volume 1136 of Lecture Notes in Computer Science, pages 179--193, 1996.

No context found.

S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374--387, 1998.

No context found.

Sudipto Guha and Samir Khuller. Approximation algorithms for connected dominating sets. In European Symposium on Algorithms, pages 179--193, 1996.

No context found.

Sudipto Guha and Samir Khuller. Approximation algorithms for connected dominating sets. Algorithmica, pages 374--387, 1998.

No context found.

Sudipto Guha and Samir Khuller. Approximation algorithms for connected dominating sets. In European Symposium on Algorithms, pages 179--193, Barcelona, Spain, Septembre 1996.

No context found.

S. Guha and S. Khuller, Approximation Algorithms for Connected Dominating Sets, Proc. of the 4th European Symposium on Algorithms, 1996.

No context found.

S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Tech. Report 3660, University of Maryland, College Park, June 1996.

No context found.

Sudipto Guha and Samir Khuller. Approximation algorithms for connected dominating sets. In European Symposium on Algorithms, pages 179--193, 1996.

No context found.

S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Proc. of Annual European Symposium on Algorithms (ESA), pages 179--193, 1996.

No context found.

Sudipto Guha and Samir Khuller. Approximation algorithms for connected dominating sets. In European Symposium on Algorithms, pages 179--193, Barcelona, Spain, Septembre 1996.

No context found.

Sudipto Guha and Samir Khuller, \Approximation algorithms for connected dominating sets," in European Symposium on Algorithms, 1996, pp. 179-193.

No context found.

S. Guha and S. Khuller, \Approximation algorithms for connected dominating sets," Tech. Rep. 3660, Inst. for Adv. Computer Studies, Dept. of Computer Sci., Univ. of Maryland, College Park, June 1996. 152

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC