CLUSTER–ID ROUTING SCHEME IN WIRELESS SENSOR NETWORKS
Journal Title: Indian Journal of Computer Science and Engineering - Year 2011, Vol 2, Issue 1
Abstract
One of the major issues in wireless sensor network is developing an energy-efficient routing protocol. Since the sensor nodes have limited available power, energy conservation is a critical issue in wireless sensor network for nodes and network life. There are several existing routing protocols to solve this problem. LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster base stations (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH has a drawback that the cluster is not evenly distributed due to its randomized rotation of local clusterhead. A new routing protocol has been proposed known as CIDRSN (Cluster ID based Routing in Sensor Networks). CIDRSN takes the cluster-ID as next hop address in routing table and eliminate the cluster formation phase and routing phase in each round. Both cluster formation phase and routing phase are only executed during the initialization of network. CIDRSN constructs clusters based on the number of cluster members. The cluster topology in the network is distributed more equally through our cluster constructing. And cluster heads for the next round will be elected based on the remaining battery level of the nodes. All routes are based on cluster-ID rather than cluster head ID. This reduces the energy consumption and increases network life time.
Authors and Affiliations
Y. Srinivas , J. Vijayasekhar , Dr. R. Satya Prasad , N. Vamsi Krishna
Keywords
Related Articles
- EP ID EP119126
- DOI -
- Views 114
- Downloads 0
A NEW MULTI PARTY KEY AGREEMENT PROTOCOL USING SEARCH PROBLEMS IN DISCRETE HEISENBERG GROUP.
In this paper we present a multi-party Key Agreement Protocol (KAP) using some of the search problems such as Factorization Search Problem , Decomposition Search Problem Conjugacy Search Problem and Twisted Conjugacy Pro...
A FREQUENT DOCUMENT MINING ALGORITHM WITH CLUSTERING
Now days, finding the association rule from large number of item-set become very popular issue in the field of data mining. To determine the association rule researchers implemented a lot of algorithms and techniques. FP...
A REVIEW: COMPARISON OF COOPERATIVE SCHEDULING MECHANISMS IN P2P COMPUTING SYSTEM
Grid computing is an upcoming technology which combines the resources from different locations to solve large tasks.Peer to peer (P2P) computing is a kind of computing in which large number of computers are connected thr...
A TRAILBLAZING MODUS OPERANDI TO FACE IDENTIFICATION USING A RECKONING ARCHETYPAL PRINCIPAL COMPONENT ANALYSIS
Face identification is a task of designating human faces with exact names, akin to identifying between similar twins. The work was motivated and is imbibed by physiology and information theory domains. The approach treat...
COMPARATIVE PERFORMANCE ANALYSIS OF MULTI-DYNAMIC TIME QUANTUM ROUND ROBIN (MDTQRR) ALGORITHM WITH ARRIVAL TIME
CPU being considered a primary computer resource, its scheduling is central to operating-system design. A thorough performance evaluation of various scheduling algorithms manifests that Round Robin Algorithm is considere...