earticle

논문검색

Efficient Hierarchical Clustering Routing in Wireless Sensor Networks

초록

영어

The routing protocol allows routing data from source to destination through intermediate nodes up to the sink. In the hierarchical routing based on the clustering, every cluster head node forms its cluster with their neighbor nodes. The cluster heads are responsible of their clusters. In fact, they coordinate between nodes in the cluster for intra-cluster communication and route data to the other clusters for inter-cluster communication. In this article we propose a centralized and periodic protocol named Efficient Clustering Routing Protocol (ECRP). Our protocol is based on a modified version of CLARANS algorithm; it takes into account the location and the remaining energy of the sensor nodes to divide the sensed area to disjoint and balanced clusters. The simulation results show that the proposed protocol is more efficient than the existing hierarchical protocols in terms of packet delivery ratio, and energy consumption.

목차

Abstract
 1. Introduction
 2. Hierarchical Clustering Routing in WSN
 3. Radio Model of Communication
 4. Description of ECRP Protocol
  4.1. Set up Phase
  4.2. Steady State phase
 5. Results and Simulation
 6. Conclusion
 References

저자정보

  • Rais Amine Laboratory RITM, ENSEM, Hassan II University of Casablanca, Casablanca, Morocco
  • Bouragba Khalid Laboratory RITM, ENSEM, Hassan II University of Casablanca, Casablanca, Morocco
  • Ouzzif Mohammed Laboratory RITM, ENSEM, Hassan II University of Casablanca, Casablanca, Morocco

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.