期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：3
DOI：10.15680/ijircce.2015.0303111
出版社：S&S Publications
摘要：Data collection and Aggregation is most important task in the wireless sensor network energy saving canbe achieved in wireless sensor networks by using mobile Sink (MS) capable of carrying data in unconstrained path. Inlarge –density applications, the sensor node should be transmit the collected data to mobile sink within time constraint.In the existing system, to form a hybrid moving pattern in which a mobile-sink node only visits rendezvous points(RPs), as opposed to all nodes for data collection. Due to Processing overhead of Rendezvous point is not appropriatefor large and delay sensitive applications. To overcome this problem, the proposed method is a Clustering BasedWeighted Rendezvous Planning (CBWRP) algorithm for sensor networks. The sensor nodes are ordered into clusters.Inside a cluster, nodes transfer data to cluster head (CH) through routing protocol. Cluster Head is elected for eachcluster based on the High energy first (HEF) clustering algorithm. This algorithm is used for selecting cluster head withhigh ranking of residual energy of each sensor node. This algorithm is used for minimizes the energy depletionthroughout sensor network. CH has a responsibility for collecting data from each sensor node and transmits data tonearest Rendezvous point. The travelling path of Mobile Sink (MS) to visit all Rendezvous point which can beconsidered as a NP Hard problem. This problem taken as delay-aware energy efficient path (DEETP) and solved asWeighted Rendezvous Planning (WRP) algorithm.WRP preferentially designates sensor nodes with the highest weightas a RP with distance of RP should be less than of maximum allowed tour length. WRP algorithm calculating weightfor each sensor node which can be computed by hop distance and number of packets forwarded.
关键词：High energy first algorithm; Wireless Sensor Networks; total transmission energy; maximum number;of hops; network lifetime
