透過您的圖書館登入
IP:3.131.95.49
  • 期刊
  • OpenAccess

Invulnerable Cluster Head Election Model to Handle Selfishness in Wireless Sensor Network

並列摘要


Wireless Sensor Networks have found a vital place in current rapid moving world. Clustering is one of the most efficient and traditional methods for routing in such sensor networks. This study aims to propose an efficient cluster head election model to handle selfishness in the wireless sensor network. Clustering plays a very important role to increase the lifetime of the wireless sensor networks. In clustering techniques, every group called a cluster is controlled by the cluster head. Each sensor transmits its collected information to the base station via the cluster head. The load to the cluster head is higher than its members because it requires performing tasks like data aggregation, control and reporting to base station. In this case, the sensor nodes may act selfishly to participate in the cluster head selection process. To avoid selfishness in the cluster head selection process, the proposed scheme uses rate analysis method. In the proposed scheme, the load of the cluster head is shared among its members. The rate analysis value is updated for each and every round. So, all the sensors can honestly participate in the election without selfishness. The proposed scheme is gauged by using the QoS metrics through simulation results obtained by Network Simulator.

延伸閱讀