KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1

Browse

Settings

Author: search.filters.author.Eak-Une, PichatornSubject: search.filters.subject.clustering

Search Results

Now showing 1 - 2 of 2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    The fuzzy-based cluster head election algorithm for equal cluster size in wireless sensor networks
    (2016-11-18)
    Eak-Une, Pichatorn
    ;
    Pornavalai, Chotipat
    In Wireless Sensor Network (WSNs), clustering technique is widely used to balance energy usages consumed by the sensors. In each round of operation, a number of sensors are chosen to be candidate cluster head (CCHs) with a fixed and predefined probability value. CCHs then compete among themselves to become Cluster Head (CH) based on some criteria such as its remaining residual energy. CH role is rotated among sensors within the network field to balance their residual energy. However, area near to the corner and edge of the network field usually has less number of sensors to be CHs role than sensors located around center of the field. This will create energy holes problem on the area where sensors that needed to be CHs more often than others. Another problem is almost existing cluster head competition methods cannot precisely control the size of clusters in the networks. Depend on the spatial correlation of sensor nodes, this may impact the quality of data aggregation performed by the CHs. In this paper, we propose fuzzy based cluster head election algorithm (called FuzzCHE) to control and maintain cluster size while balance residual energy of sensors and extend the network lifetime. With FuzzCHE, each sensor can dynamically adjust probability that each sensor becomes CCH in each round by fuzzy logic. Comparing with existing cluster head election algorithm, results from simulations show that FuzzCHE can give more precise control of the average operated cluster size in the network to the deployed size required by the application.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Unequal Initial Energy Assignment in Wireless Sensor Networks
    (2015-08-24)
    Eak-Une, Pichatorn
    ;
    Pornavalai, Chotipat
    In multi-hop clustering Wireless Sensor Networks (WSNs), Cluster Head (CH) role is rotated among sensor nodes in order to balance their residual energy usages. However, to forward data from CHs to sink or Base Station (BS), CH nodes that are placed near to the sink consume more energy than CH nodes that are further away. This is known as 'Energy Hole' problem in WSNs. This paper proposes an algorithm called 'Unequal Initial Energy Assignment' or UIEA to determine initial energy for sensors based on their distances to the sink. This unequal energy assignment is to assign different values of initial energy to sensors that belong to different regions in the network field. Since CHs perform data aggregation, this approach allows sensors to operate using same cluster sizes throughout deployed network field, which is one of the important requirements for some specific applications. Performance from simulation shows that UIEA can get more detail and precise data after aggregation by deploying smaller cluster size than average EC cluster size while the Stable Operation Period (SOP) is approximately the same as EC solution.