No abstract

New advancements in the technology of wireless sensors have contributed to the development of special protocols which are unique to sensor networks where minimal energy consumption is vital and very important. As a result, the focus and effort of researchers is on designing better routing algorithms for a given application and network architecture of interest. Flat-based routing protocols have been found to be less advantageous to clustering routing protocols when their performance are compared in a large-scale wireless sensor network scenario. This is due to the fact that clustering operation reduces the amount of redundant messages that are transmitted all over the network when an event is detected. This paper is an investigation of cluster-based routing protocols for wireless sensor networks.

No abstract

No abstract

This paper presents the impact of utilizing a biased energy distribution (BED) scheme for clustering sensor networks. In clustering sensor networks, some of the nodes are elected as aggregators and they compress the data from their cluster members before sending the aggregated data to the sink. Existing clustering routing protocols assume that all the nodes are provided with equal amount of energy but this shortens the network lifetime and makes the network unstable. This paper proposes a solution prioritizing the network into higher and lower energy nodes. The aim of this approach is to ensure well balanced energy consumption in order to maximize network lifetime. It is shown by simulation that the proposed technique exhibits better performance when compared to existing clustering routing techniques in terms of throughput, network lifetime and energy consumption.