Amis AD, Prakash R, Vuong THP, Huynh DT. Max -- min d-cluster formation in wireless ad hoc networks. In Proceedings IEEE INFOCOM 2000. Conference on Computer Communications, March 2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....5 describes a unified framework for clustering algorithms, while section 6 discusses the generation of random unit graphs with obstacles. A preliminary version of this paper was published in June 1999 as technical report. A variant of k lowestID scheme was proposed independently by Amis et al. [2], who also show that minimum d hop dominating set problem is NP complete. 1. Literature review A hierarchical network structure is an effective way to organize a network comprising a large number of nodes. In a single hierarchy, nodes are divided into clusters, which may or may not have ....

A.D. Amis, R. Prakash, T.H.P. Vuong and D.T. Huynh, Max-min d-cluster formation in wireless ad hoc networks, in: Proc. IEEE INFOCOM, 2000.

....of these heuristics. We note that our basic algorithm is similar to the Lowest ID Cluster Algorithm proposed by Ephremides, Wieselthier and Baker [7] Experiments show that this scheme works well in practice. A similar idea leads to the Max Min D clustering scheme that was proposed by Amis et al. [2]. For the connected dominating set problem, Wu and Li proposed a distributed algorithm that performs badly in the worst case (O(n) approximation) but works well in simulation [26] 3 Basic algorithm Before presenting the algorithms, we first give some formal definitions. A d cube with size r is ....

A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh. Max-Min D-cluster formation in wireless ad hoc networks. In 19th IEEE INFOCOM, March 1999.

....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 elect clusterheads. Many authors [3] [6] 32] 38] 54] chose to use the node identifiers to elect the clusterhead within one or multiple hops. We refer 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 ....

....help reduce the complexity of maintaining topology information, and can simplify such essential functions as routing, bandwidth allocation, channel access, power control or virtual circuit support. Therefore, clusterhead stability is an important factor in keeping the cluster maintenance cost down [3]. However, it may be harmful to the clusterheads, because a clusterhead drains its energy more quickly than a normal node. Therefore, a clusterhead election algorithm must also consider load balancing of the clusterhead role to avoid node or network failure. Except for Lowest ID, the ....

[Article contains additional citation context not shown here]

A. Amis, R. Prakash, T. Vuong, and D.T. Huynh. MaxMin D-Cluster Formation in Wireless Ad Hoc Networks. In Proceedings of IEEE Conference on Computer Communications (INFOCOM), Mar. 1999.

....is either in the dominating set, or is adjacent to a node in the dominating set. The members of the dominating set are often called clusterheads, whereas the other nodes without special functionalities are called hosts. The problem of computing the minimum dominating set is known to be NP hard [1, 12] even when the complete network topology is available. In ad hoc networks, the di#culty of acquiring complete network topology makes it impossible to compute the minimum dominating sets. Instead, a minimal dominating set (MDS) is usually pursued based on various heuristics that can guarantee a ....

....random amounts of time to attempt to attain minimum conflicts between clusterheads in its one hop neighborhood. In contrast, deterministic criteria can determine the clusterheads in a single round. Di#erent heuristics have been used to form clusters and to elect clusterheads. Several approaches [1, 3, 11, 13, 19] utilized the node identifiers to elect the clusterhead within one or multiple hops. For simplicity, we refer to this approach as Lowest ID in our comparative analysis. Banerjee and Khuller [4] assigned a weight value to each node for clusterhead election, which is essentially the same as Lowest ....

[Article contains additional citation context not shown here]

A. Amis, R. Prakash, T. Vuong, and D.T. Huynh. MaxMin D-Cluster Formation in Wireless Ad Hoc Networks. In Proceedings of IEEE Conference on Computer Communications (INFOCOM), Mar. 1999.

....itself. Most previous research on ad hoc network routing [17] focused on the protocol design and performance evaluation in terms of the message overhead and loss rate. To improve the scalability of routing algorithms for large networks, many hierarchical routing methods have been proposed in [11, 5, 12, 2, 7, 15, 13, 10]. This previous work focused on how to find the correct route e#ciently, but did not consider optimizing power while sending messages. Singh et al. 18] proposed power aware routing and discussed di#erent metrics in power aware routing. Minimal energy consumption was used in [16] Chang and ....

A.D. Amis, R. Prakash, T.H.P. Vuong, and D.T. Huynh. Max-min d-cluster formation in wireless ad hoc networks. In Proceedings IEEE INFOCOM 2000.

....research on ad hoc network routing [19, 15, 24, 25, 27, 31, 20] focused on the protocol design and performance evaluation in terms of the message overhead and loss rate. To improve the scalability of routing algorithms for large networks, many hierarchical routing methods have been proposed in [21, 10, 23, 4, 13, 29, 36]. In [26, 18] zones, which are the route maintenance units, are used to find the routes. This previous work focused on how to find the correct route e#ciently, but did not consider optimizing power while sending messages. Singh et al. 32] proposed power aware routing and discussed di#erent ....

A.D. Amis, R. Prakash, T.H.P. Vuong, and D.T. Huynh. Max-min d-cluster formation in wireless ad hoc networks. In Proceedings IEEE INFOCOM 2000.

....would significantly be reduced. The LCA was basically developed to support a dynamic network with less than 100 nodes. In addition to this it suffers from transmission delay as the network size increases and this might not be supported with the TDMA scheme. 3.1. 3 Max Min D Cluster Formation [2] The schemes already discussed elect clusterheads that are 1 hop away from the non clusterhead nodes. This scheme has been generalized in [2] where the concept of choosing clusterheads is introduced where a clusterhead is at most d hops away from a non clusterhead node. The protocol assumes ....

....suffers from transmission delay as the network size increases and this might not be supported with the TDMA scheme. 3.1.3 Max Min D Cluster Formation [2] The schemes already discussed elect clusterheads that are 1 hop away from the non clusterhead nodes. This scheme has been generalized in [2] where the concept of choosing clusterheads is introduced where a clusterhead is at most d hops away from a non clusterhead node. The protocol assumes the usage of the Multiple Access with Collision Avoidance protocol as a communication medium between nodes. The Max Min algorithms aims at ....

[Article contains additional citation context not shown here]

Amis A.D., Prakash R., Vuong T.H.P. and Huynh D.T. Max-Min D-Cluster Formation in Wireless Ad hoc Networks. Proceedings of IEEE INFOCOM'

....of these heuristics. We note that our basic algorithm is similar to the Lowest ID Cluster Algorithm proposed by Ephremides, Wieselthier and Baker [9] Experiments show that this scheme works well in practice. A similar idea leads to the Max Min D clustering scheme that was proposed by Amis et al. [3]. For the connected dominating set problem, Wu and Li proposed a distributed algorithm that performs badly in the worst case (O(n) approximation) but works well in simulation [24] 4 3 Basic algorithm Before presenting the algorithms, we first give some formal definitions. A d cube with size r ....

A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh. Max-Min D-cluster formation in wireless ad hoc networks. In 19th IEEE INFOCOM, March 1999.

....research on ad hoc network routing [17, 13, 23, 24, 26, 30, 19, 18] focused on the protocol design and performance evaluation in terms of the message overhead and loss rate. To improve the scalability of routing algorithms for large networks, many hierarchical routing methods have been proposed in [20, 8, 22, 2, 11, 28]. In [25, 16] zones, which are the route maintenance units, are used to find the routes. This previous work focused on how to find the correct route e#ciently, but did not consider optimizing power while sending messages. Singh et al. 31] proposed power aware routing and discussed di#erent ....

A.D. Amis, R. Prakash, T.H.P. Vuong, and D.T. Huynh. Max-min d-cluster formation in wireless ad hoc networks. In Proceedings IEEE INFOCOM 2000. Conference on Computer Communications, March 2000.

....decisions are made using local information; there is no need to maintain routing tables or make global broadcasts. This idea of combining greedy and perimeter routing on planar graphs is independently investigated by Bose et al. 4] Clustering is used in many routing protocols in mobile networks [1, 6, 9, 12]. Our basic clustering algorithm is similar to the Lowest ID Cluster Algorithm proposed by Ephremides, Wieselthier, and Baker [9, 12] A similar idea also led to the Max Min D clustering scheme proposed by Amis et al. 1] Chiang et al. 6] proposed a Least Cluster Change clustering (LCC) ....

.... Clustering is used in many routing protocols in mobile networks [1, 6, 9, 12] Our basic clustering algorithm is similar to the Lowest ID Cluster Algorithm proposed by Ephremides, Wieselthier, and Baker [9, 12] A similar idea also led to the Max Min D clustering scheme proposed by Amis et al. [1]. Chiang et al. 6] proposed a Least Cluster Change clustering (LCC) algorithm that tries to minimize clusterhead changes. However, there is no guarantee on the quality of the clustering. They also proposed a Clusterhead Gateway Switch Routing (CGSR) protocol that uses routing tables; yet ....

A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh. Max-Min D-cluster formation in wireless ad hoc networks. In 19th IEEE INFOCOM, March 1999.

....derived for many of these heuristics. We note that our basic algorithm is similar to the Lowest ID Cluster Algorithm proposed by Gerla and Tsai [12] Experiments show that this scheme works well in practice. A similar idea leads to the Max Min D clustering scheme that was proposed by Amis et al. [3]. For the connected dominating set problem, Wu and Li proposed a distributed algorithm that performs badly in the worst case (O(n) approximation) but works well in simulation [23] 3. BASIC ALGORITHM Before presenting the algorithms, we first give some formal definitions. A d cube with size r is ....

A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh. Max-Min D-cluster formation in wireless ad hoc networks. In 19th IEEE INFOCOM, March 1999.

No context found.

A.D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh. Max-Min D-Cluster Formation in Wireless Ad Hoc Networks. In Proceedings of Infocom 2000.

....A hierarchical architecture in which the network is organized in regions is presented in [16] Various aspects of hierarchical architecture, for example, routing exchanges per update, intracluster routing and intercluster routing, are described. The d Cluster formation heuristic is described in [17]. Each node is at most d hops away from the clusterhead. One of the features of the heuristic is that it tends to re elect the existing clusterheads even when the network configuration changes. Also, there is a tendency to evenly distribute the mobile nodes among the clusterheads, and evenly ....

....show that the stability of the system varies inversely with the clusterhead load distribution. Although our experiments have been limited to ad hoc networks where each node is one hop away from the clusterhead, we believe that the unified mechanism can be easily applied to D cluster formation [17]. 7. FUTURE WORK The unified modeling also opens some new areas for research. It needs to be investigated that how can a suitable set of the control parameters be determined for a given set of performance characteristics. This will further lead to dynamic control of the control parameters. The ....

A.D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh. Max-Min D-Cluster Formation in Wireless Ad Hoc Networks. In Proceedings of Infocom

....communication scheme and may be unacceptable. Additionally, it has been shown [11] that as communications increase the amount of skew in a synchronous timer also increases, thereby degrading the performance of the overall system or introducing additional delay and overhead. The Max Min heuristic [12] was developed to extend the notion of 1 hop clusters and generalizes cluster formation to d hop clusters. The rules for Max Min heuristic are similar to those for LCA but converges on a clusterhead solution much faster at the network layer, 2d rounds of messages exchanges. Once again a node x ....

....(ABS(My Degree Elected Degree) MAX DELTA) Clusterhead = FALSE; 7. Simulation Experiments and Results We conducted simulation experiments to evaluate the performance of the proposed heuristic. The load balancing heuristic was implemented into 4 cluster election heuristics: the Max Min heuristic [12], the Linked Cluster Algorithm (LCA) 1] the revised LCA (LCA2) 4] and the Highest Connectivity (Degree) 8, 6] heuristic. These simulation results were then compared against similar results produced by the cluster election heuristics running without load balancing. We assumed a variety of ....

A. Amis, R. Prakash, T. Vuong, and D.T. Huynh. MaxMin D-Cluster Formation in Wireless Ad Hoc Networks. In Proceedings of IEEE INFOCOM, March 1999.

No context found.

Amis AD, Prakash R, Vuong THP, Huynh DT. Max -- min d-cluster formation in wireless ad hoc networks. In Proceedings IEEE INFOCOM 2000. Conference on Computer Communications, March 2000.

No context found.

A. D. Amis, R. Prakash, T. Vuong, D. Huynh, Max-min d-cluster formation in wireless ad hoc networks, in: IEEE INFOCOM, 2000.

No context found.

A. D. Amis, R. Prakash, T. H. P. Vuong, and D.T. Huynh. Max-min d-cluster formation in wireless ad hoc networks. In IEEE INFOCOM, pages 32--41, March 2000.

No context found.

A. Amis, R. Prakash, T. Vuong, and D. Huynh, Max-min d-cluster formation in wireless ad hoc networks, in Proceedings of IEEE INFOCOM, Tel Aviv, March 2000.

No context found.

A. D. Amis, R. Prakash, D. Huynh, and T. Vuong. Max-Min D-cluster formation in wireless ad hoc networks. In IEEE INFOCOM, 2000.

No context found.

A.D. Amis, R. Prakash, T.H.P. Vuong, and D.T. Huynh. Max-min d-cluster formation in wireless ad hoc networks. In Proceedings of IEEE INFOCOM 2000.

No context found.

A.D. Amis, R. Prakash, T.H.P. Vuong, and D.T. Huynh. Max-min d-cluster formation in wireless ad hoc networks. In Proceedings of IEEE INFOCOM 2000.

No context found.

Amis AD, Prakash R, Vuong THP, Huynh DT. Max -- min d-cluster formation in wireless ad hoc networks. In Proceedings IEEE INFOCOM 2000. Conference on Computer Communications, March 2000.

No context found.

Alan Amis, Ravi Prakash, Thai Vuong, and Dung Huynh. Max-min d-cluster formation in wireless ad hoc networks. In Proceedings of IEEE INFOCOM, pages 32--41, Tel-Aviv, Israel, March 1999. IEEE.

No context found.

A. Amis, R. Prakash, T. Vuong, and D. Huynh, Max-min d-cluster formation in wireless ad hoc networks, in Proceedings of IEEE INFOCOM, Tel Aviv, March 2000.

No context found.

Alan D. Amis, Ravi Prakash, Thai H.P. Vuong, and Dung T. Huynh. Max-Min D-Cluster Formation in Wireless Ad Hoc Networks. In Proceedings of IEEE INFOCOM 2000, pages 32--41, 2000.

No context found.

Alan D. Amis, Ravi Prakash, Thai H.P. Vuong, and Dung T. Huynh. Max-Min D-Cluster Formation in Wireless Ad Hoc Networks. In Proceedings of IEEE INFOCOM 2000, pages 32--41, 2000.

No context found.

A.D.Amis,R.Prakash,T.H.P.Vuong,andD.T.Huynh. Max-Min D-Cluster Formation in Wireless Ad Hoc Networks. In Proceedings of IEEE INFOCOM'2000.

No context found.

A. Amis, R. Prakash, T. Vuong, and D.T. Huynh. MaxMin D-Cluster Formation in Wireless Ad Hoc Networks. In Proceedings of IEEE Conference on Computer Communications (INFOCOM), March 1999.

No context found.

A. D. Amis et al., Max-min D-Cluster Formation in Wireless Ad Hoc networks, IEEE INFOCOM, March 2000

No context found.

Alan Amis, Ravi Prakash, Thai Vuong, and Dung Huynh. Max-min d-cluster formation in wireless ad hoc networks. In Proceedings of IEEE INFOCOM, pages 32--41, Tel-Aviv, Israel, March 1999. IEEE.

No context found.

Alan D. Amis, Ravi Prakash, Dung Huynh, and Thai Vuong, \Max-min d-cluster formation in wireless ad hoc networks," in Proc. of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM, 2000, vol. 1, pp. 32-41.

No context found.

A. Amis, R. Prakash, T. Vuong, and D. Huynh. Max-min d-cluster formation in wireless ad hoc networks. In Proceedings of IEEE INFOCOM, pages 32--41, March 1999.

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