ABSTRACT
This chapter presents a cluster based routing algorithm called Cost Based Clustering and Routing Algorithm (CBCRA). It also discusses the distributed algorithm for clustering sensor nodes called Distributed Energy Efficient Clustering&Routing (DEECR). In the data routing phase, Cluster heads (CHs) send the processed data through other CHs in which intermediate CHs act as relay nodes. The CH selects the relay node in such a way that it pursues energy balance for the sensor network. The routing algorithm should take care the energy consumption of the nodes to prolong the network lifetime. The cost function is the composite measure of residual energy of the CH, its distance to base station and also the distance from the sensor node to the CH. In order to be energy efficient, the algorithm is supposed to route the sensed data via other sensor nodes which are closer to the base station or on some energy efficient path.
