Designing a Simulation Based Application for Lowest ID Clustering Algorithm in Moble Ad Hoc Networks

Abstract

A wireless ad-hoc network is a self-configuring network that does not depend on any infrastructure for communication. Every node is free to move anywhere in the network and data is exchanged independently across the network. Destruction of one node does not affect the communication of other nodes in the network. Every node in the network can act as both host as well as destination. A wireless ad-hoc network does not rely on fixed infrastructure or predetermined connectivity. It is a self organizing multi-hop wireless network in which all of the nodes can be mobile. Data is exchanged between nodes via wireless communication. Aside from the ability to be rapidly deployed, wireless ad-hoc networks have the ability to exist in highly volatile environments. Unlike traditional networks, if one node is destroyed it will not impact the data exchange between the remaining nodes within the network. The selection of the correct network topology given the network characteristics is extremely important to ensure reliable and efficient communication between nodes. The topology of a network can be either hierarchical or flat. In a hierarchical topology nodes are divided into clusters. Within each cluster, a cluster head is selected via a mathematical formulation or heuristic method. Cluster heads are responsible for keeping track of which nodes are maintained in their respective cluster. Furthermore, they are responsible for transmitting data between clusters. Each of the cluster heads maintains a continuously updated routing table. This table contains specific information detailing which cluster each node belongs to. If a node desires to transfer information to another node, the information is sent to the sender node’s cluster head. This cluster head scans its routing table to determine which cluster the recipient is in. If the recipient is in the same cluster, the data is immediately forwarded to the receiving node. If not, the cluster head scans its routing table to determine which cluster the recipient is in and forwards the data to the appropriate cluster head where it is again forwarded to the recipient. The Lowest-ID is considered as a simplest clustering scheme algorithm. In this scheme unique identifier (ID) is assigned to each node. All nodes recognize its neighbors ID and CH is chosen according to minimum ID. Thus, the node IDs of the neighbors of the CH will be higher than that CH. The main drawback with this scheme is there is no limitation to the number of nodes attached to the same CH. Also, CHs are prone to power drainage due to serving as cluster heads.