Please use this identifier to cite or link to this item:
http://dspace.dtu.ac.in:8080/jspui/handle/repository/16154
Title: | ENHANCED CLUSTER HEAD SELECTION STRATEGY FOR EFFICIENT ROUTING IN ADHOC NETWORK |
Authors: | MEHROTRA, SAURABH |
Keywords: | ADHOC NETWORK CLUSTER HEAD SELECTION MANETs |
Issue Date: | Jul-2013 |
Series/Report no.: | TD-1203; |
Abstract: | present that users wanting to communicate with each other form a temporary network, without any form of centralized administration. Each node participating in the network acts both as host and a router therefore, it is capable of forwarding packets for other nodes. For this purpose a routing protocol is needed i.e. it should try to minimize control traffic, such as periodic update messages. Clustering in Mobile Ad Hoc Networks (MANETs) has many advantages compared to the traditional networks. But the highly dynamic and unstable nature of MANETs makes it difficult for the cluster based routing protocols to divide a mobile network into clusters and determination of cluster heads for each cluster. As we know cluster head play an important role in MANETs because selection of stable cluster head makes routing algorithms more efficient. Although, there are lots of cluster head selection algorithms available, here we introduce a new strategy. The proposed scheme for improved cluster head selection utilizes mobility, signal to noise ratio (SNR) and battery power of a node. A weighted function based on all three characteristics is used to calculate the stable cluster head. A comparative analysis of the proposed strategy is compared with a novel solution given by Chopra et al. The result clearly show that we proposed scheme provide improved performance and more stable cluster head. |
URI: | http://dspace.dtu.ac.in:8080/jspui/handle/repository/16154 |
Appears in Collections: | M.E./M.Tech. Computer Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Sourabh Mehrotra.pdf | 1.46 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.