• Login
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage StatisticsView Google Analytics Statistics

    Distributed clustering for heterogeneous wireless sensor network in data gathering applications

    Thumbnail
    View/Open
    200311030.pdf (464.2Kb)
    Date
    2005
    Author
    Saxena, Nischal
    Metadata
    Show full item record
    Abstract
    Wireless Sensor networks have revolutionized the paradigm of gathering and processing data in diverse environment such as, wildlife area, kindergarten or agriculture farm. The nodes in these networks usually have a very low and fixed amount of energy, which cannot easily be replenished, and hence there is a need for energy efficient techniques to improve the lifetime of such networks. Data Aggregation is one prominent method that is employed to reduce the amount of energy used in data transmission among the nodes in a network. This method requires hierarchical organization of the nodes. Clustering is one phenomenon that introduces the required hierarchy in a network. It also helps in increasing the lifetime of the network and its scalability as well. On the other hand the cost paid off for clustering is unbalanced energy consumption, which arises due to variations in the roles assigned to the nodes. This imbalance can lead to early partitioning of the network. Due to different amount of residual energy nodes cannot be considered same any more and a distinction has to be made on the basis of the residual energy and the assumption that nodes are identical has to be dropped. This work tries to address the self-organization of a wireless sensor network in presence of heterogeneity (presence of more than one type of nodes based on the energy), which may be due to initial deployment or by the network operations. The approach suggested in this work for clustering is basically meant for the data gathering applications. It is based on the local interaction of the nodes, which accounts for scalability. The nodes that are rich in residual energy are usually elected as cluster head. The load is balanced among the nodes by periodically exchanging the roles of the nodes and attaching a node to a cluster based on a cost function, which is dependent on the distance to the cluster head, degree of the cluster head and residual energy. Work also describes the simulation done to evaluate the performance of clustering and energy efficiency of the approach.
    URI
    http://drsr.daiict.ac.in/handle/123456789/100
    Collections
    • M Tech Dissertations [923]

    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     


    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV