Academic
Publications
Adaptive Clustering for Mobile Wireless Networks

Adaptive Clustering for Mobile Wireless Networks,10.1109/49.622910,IEEE Journal on Selected Areas in Communications,Chunhung Richard Lin,Mario Gerla

Adaptive Clustering for Mobile Wireless Networks   (Citations: 818)
BibTex | RIS | RefWorks Download
This paper describes a self-organizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically reconfigured as nodes move. This network architecture has three main advantages. First, it provides spatial reuse of the bandwidth due to node clustering. Secondly, bandwidth can be shared or reserved in a controlled fashion in each cluster. Finally, the cluster algorithm is robust in the face of topological changes caused by node motion, node failure and node inser- tion/removal. Simulation shows that this architecture provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network.
Journal: IEEE Journal on Selected Areas in Communications - JSAC , vol. 15, no. 7, pp. 1265-1275, 1997
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Frequently, the CDS is seen as a structure of interconnected clusters [14] where the dominating nodes are called cluster-heads in recognition of the fact that they “represent” collectively, neighboring (dominated) nodes...

    Baljeet Malhotraet al. Exact Top-K Queries in Wireless Sensor Networks

    • ...A large number of them are self-stabilizing [2], [7], [10], [6], [9], [15], [19]...

    Colette Johnenet al. Self-Stabilizing Computation and Preservation of Knowledge of Neighbor...

    • ...In many clustering algorithms, the CHs are selected based on node’s ID [16,4,11,2], processing ability [1,14], node degree [9,6 ]a nd etc.Also,someofthesealgorithmsareintendtodissipatetheenergyofallsensorsinnetwork at the same pace...

    Sungryoul Leeet al. LUCA: An Energy-efficient Unequal Clustering Algorithm Using Location ...

    • ...Some clustering algorithms [11], [12] use different metrics (e.g., id, mobility) for the cluster formation process in order to form stable clusters...
    • ...The authors of [15] modify the Lowest Id Algorithm [11] and different degree based algorithms to create k-hop clusters named K-ConID, i.e., the maximal number of hops between each cluster member to its ClusterHead is k. Nodes flood their identifiers, which consist of number of k-degree neighbors and id, to k hops away and select the larger identifier as their ClusterHead, with ties broken according to the lowest id. During the last couple ...

    Efi Droret al. Fast randomized algorithm for hierarchical clustering in Vehicular Ad-...

    • ...Clustering, as a means of topology control [1] in wireless ad hoc networks, has shown to be a promising technique to ensure the scalability and efficiency of various (e.g., routing) protocols [2], [3]...
    • ...In a typical clustering scheme [3], [4], [7], [9], the nodes in a wireless ad hoc network are divided into clusters ,a s shown in Figure 1. Under the cluster structure, each node can be in one of the four states (or functions): the clusterhead, gateway, member ,o rrelay...
    • ...First, the geographically separated regions in different clusters facilitate spatial reuse of resource, such as bandwidth and codes, and increase system capacity [3], [4]...

    Shan-Hung Wuet al. Collaborative Wakeup in Clustered Ad Hoc Networks

Sort by: