Alan D. Amis and Ravi Prakash, \Load-balancing clusters in wireless ad hoc networks," in Proc. of the 3rd IEEE Symposium on Application-Speci c Systems and Software Engineering Technology, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Neighbor-Aware Control In Ad Hoc Networks - Bao (Correct)
....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 aforementioned election algorithms inherently provide clusterhead load balancing in mobile networks. To improve Lowest ID, Amis et al. [4] provided clusterhead load balancing, referred to as Load Balance, by running virtual identifier (VID) and budget counters at each node. Load Balance uses the VID for elections, and the budget for the clusterhead term, thus posing equal opportunity for each node to become a clusterhead. The ....
....MOBIC [18] In this approach, each node computes a mobility metric based on the received signal strength variations from its one hop neighbors. A node becomes a clusterhead if it has the lowest mobility metric in the one hop neighborhood of itself or one of its one hop neighbors. Load Balance [4]: This approach is similar to Lowest ID except that it is based on a virtual identifier (VID) assigned to each node. The VID of a node increases every time slot if the node is a host, or remains constant if the node is a clusterhead. Each clusterhead runs a budget that decreases every time slot. A ....
[Article contains additional citation context not shown here]
A.D. Amis and R. Prakash. Load-balancing clusters in wireless ad hoc networks. In Proceedings 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology, pages 25--32, Los Alamitos, CA, Mar. 24-25 2000.
Topology Management in Ad Hoc Networks - Bao, Garcia-Luna-Aceves (2003) (5 citations) (Correct)
....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 aforementioned election algorithms inherently provide clusterhead load balancing in mobile networks. To improve Lowest ID, Amis et al. [2] provided clusterhead load balancing, which we call Load Balance, by running a virtual identifier (VID) and a budget counter at each node. Load Balance uses the VID for elections, and the budget for the clusterhead term, thus posing equal opportunity for each node to become a clusterhead. ....
....MOBIC [7] In this approach, each node computes a mobility metric based on the received signal strength variations from its one hop neighbors. A node becomes a clusterhead if it has the lowest mobility metric in the one hop neighborhood of itself or one of its one hop neighbors. Load Balance [2]: This approach is similar to Lowest ID except that it is based on a virtual identifier (VID) assigned to each node. The VID of a node increases every time slot if the node is a host, or remains constant if the node is a clusterhead. Each clusterhead runs a budget that decreases every time slot. A ....
[Article contains additional citation context not shown here]
A.D. Amis and R. Prakash. Load-balancing clusters in wireless ad hoc networks. In Proceedings 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology, pages 25--32, Los Alamitos, CA, Mar. 24-25 2000.
Geometric Spanners for Wireless Ad Hoc Networks - Alzoubi, Li, Wang, Wan, Frieder (2003) (1 citation) (Correct)
....by the clustering algorithm. Initially, all nodes are white. The status of a node after the clustering method finishes could be dominator or dominatee. 3.1. 1 Clustering Many algorithms for clustering have been proposed in the literature [20] 28] 21] 22] 23] 7] 27] 24] 15] 32] [33], 8] All algorithms assume that the nodes have distinctive identities (denoted by ID hereafter) We will typically review the ones by Baker [21] 22] and Alzoubi et al. 28] 6] For the sake of general description of these priori arts, we will summarize them using our own words. The ....
A.D. Amis and R. Prakash, "Load-Balancing Clusters in Wireless Ad Hoc Networks," Proc. Third IEEE Symp. Application-Specific Systems and Software Eng. Technology, 2000.
Survey On Unicast Routing in Mobile Ad Hoc Networks - Kashyap, Nishar, Agarwal (1 citation) (Correct)
....cluster head for a long time its battery slowly depletes and it ceases to exist due to lack of power. Therefore in order to overcome such a hassle for cluster heads we need to load balance the way in which the cluster heads are chosen and sustained during the lifetime of an ad hoc network. [1] proposes a method by which the latter can be done. It aims at minimizing the number and size of the data structures required for the heuristic in choosing the cluster heads. It uses an input parameter that extends the cluster head duration budget and provides an equal opportunity for every node ....
....node being elected as a cluster head or the minimum amount of work performed or the maximum amount of work performed or a combination of any of these. The cluster head is elected either on the basis of the node id or the connectivity with other nodes. In the first case the heuristic places a [1] budget on the contiguous amount of time a node stays clusterhead and in the second case the node remains a clusterhead if its range stays in a specific range with respect to the cluster nodes. 1] combines the non biased selection of Degree or Connectivity based heuristics with the stability ....
[Article contains additional citation context not shown here]
Amis A.D. and Prakash R., Load-Balancing Clusters in Wireless Ad Hoc Networks. Proceedings of ASSET
WCA: A Weighted Clustering Algorithm for Mobile Ad hoc.. - Chatterjee, Das, Turgut (2001) (18 citations) (Correct)
....on the number of nodes supported by it. A clusterhead, apart from supporting its members with the radio resources, has also to route messages for other nodes belonging to di erent clusters. Therefore, it is not desirable to have any clusterhead overly loaded while some others are lightly loaded [2]. At the same time, it is dicult to maintain a perfectly load balanced system at all times due to frequent detachment and attachment of the nodes from and to the clusterheads. To quantitatively measure how well balanced the clusterheads are, we introduce a parameter called load balancing factor ....
A. Amis and R. Prakash, \Load-Balancing Clusters in Wireless Ad Hoc Networks", Proceedings of ASSET
Algorithmic, Geometric and Graphs Issues in Wireless Networks - Li (2002) (1 citation) (Correct)
No context found.
Alan D. Amis and Ravi Prakash, \Load-balancing clusters in wireless ad hoc networks," in Proc. of the 3rd IEEE Symposium on Application-Speci c Systems and Software Engineering Technology, 2000.
K-Clustering in Wireless Ad Hoc Networks - Fernandess, Malkhi (2002) (Correct)
No context found.
A. Amis and R. Prakash. Load-balancing clusters in wireless ad hoc networks. In Proceedings of ASSET 2000.
WCA: A Weighted Clustering Algorithm for Mobile Ad hoc.. - Chatterjee, Das, Turgut (2002) (18 citations) (Correct)
No context found.
A. Amis and R. Prakash, Load-balancing clusters in wireless ad hoc networks, in: Proceedings of ASSET 2000.
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