ADAPTIVE CLUSTERING IN MOBILE, MULTIMEDIA, MULTIHOP WIRELESS NETWORKS

Abstract

The dissertation work simulates self-organizing wireless Mobile, Multimedia, Multihop(M3) networks. The basis of the network is clustering, i.e. nodes are organized into non-overlapping clusters. The clusters are independently controlled. Since the network supports mobility, these clusters are to be dynamically reconfigured. This adaptive clustering algorithm very well takes care of overheads for configuring and reconfiguring clusters. It is fast deployable, making it useful for emergency networks. The network relies on a code-division multiple access scheme for multimedia support. The main advantages of network architecture are, that it provides spatial reuse of bandwidth, and that bandwidth can be shared or reserved in a controlled fashion in each. cluster. (Simulation results confirm that this architecture provides an efficient and stable infrastructure for the integration of different types of traffic in a dynamic radio network) In our work, we first find the minimum transmission range within which all nodes can access all j other nodes. We then implement the given clustering algorithm. We also suggest a modified i clustering algorithm and show through simulation results, how our algorithm increases the number of real time connections accepted((Further, this algorithm can sustain more mobility, that is, it requires less reconfiguring on node movement)) The implementation is done in C language on the TATA ELAXI RISC system under UNIX environment.