Power Efficient Gathering in Sensor Information Systems (PEGASIS) protocol in 2002. It is an improved version of LEACH. Instead of forming clusters, it is based on forming chains of sensor nodes. One node is responsible for routing the aggregated data to the sink. Each node aggregates the collected data with its own data, and then passes the aggregated data to the next ring. The difference from LEACH is to employ multi-hop transmission and selecting only one node to transmit to the sink or base station. Since the overhead caused by dynamic cluster formation is eliminated, multi-hop transmission and data aggregation is employed, PEGASIS outperforms the LEACH. However excessive delay is introduced for distant nodes, especially for large networks and single leader can be a bottleneck.
In 2001, A. Manjeshwar and D. P. Agarwal [7] proposed Threshold sensitive Energy Efficient sensor Network Protocol (TEEN) protocol. Closer nodes form clusters, with a cluster heads to transmit the collected data to one upper layer. Forming the clusters, cluster heads broadcast two threshold values. First one is hard threshold; it is minimum possible value of an attribute to trigger a sensor node. Hard threshold allows nodes transmit the event, if the event occurs in the range of interest. Therefore a significant reduction of the transmission delay occurs. Unless a change of minimum soft threshold occurs, the nodes don’t send a new data packet. Employing soft threshold prevents from the redundant data transmission. Since the protocol is to be responsive to the sudden changes in the sensed attribute, it is suitable for time-critical applications.
A. Manjeshwar and D. P. Agarwal [8] proposed AdaPtive Threshold sensitive Energy Efficient sensor Network Protocol (APTEEN) protocol in 2002. The protocol is an extension of TEEN aiming to capture both time-critical events and periodic data collections. The network architecture is same as TEEN. After forming clusters the cluster heads broadcast attributes, the threshold values, and the transmission schedule to all nodes. Cluster heads are also responsible for data aggregation in order to decrease the size data transmitted so energy consumed. According to energy dissipation and network lifetime, TEEN gives better performance than LEACH and APTEEN because of the decreased number of transmissions. The main drawbacks of TEEN and APTEEN are overhead and complexity of forming clusters in multiple levels, implementing threshold-based functions and dealing with attribute based naming of queries.
In 2004, G. Smaragdakis, I. Matta and A. Bestavros [9] proposed Stable Election Protocol (SEP) protocol. This protocol is an extension to the LEACH protocol. It is a heterogeneous aware protocol, based on weighted election probabilities of each node to become cluster head according to their respective energy. This approach ensures that the cluster head election is randomly selected and distributed based on the fraction of energy of each node assuring a uniform use of the nodes energy. In this protocol, two types of nodes (two tier in-clustering) and two level hierarchies were considered
In 2005, M. Ye, C. Li, G. Chen and J. Wu [10] proposed Energy Efficient Clustering Scheme (EECS) protocol. It is novel clustering scheme for periodical data gathering applications for wireless sensor networks. It elects cluster heads with more residual energy through local radio communication. In the cluster head election phase, a constant number of candidate nodes are elected and compete for cluster heads according to the node residual energy. The competition process is localized and without iteration. The method also produces a near uniform distribution of cluster heads. Further in the cluster formation phase, a novel approach is introduced to balance the load among cluster heads. But on the other hand, it increases the requirement of global knowledge about the distances between the cluster-heads and the base station.
In 2006, Q. Li, Z. Qingxin and W. Mingwen [11] proposed Distributed Energy Efficient Clustering Protocol (DEEC) protocol. This protocol is a cluster based scheme for multi level and two level energy heterogeneous wireless sensor networks. In this scheme, the cluster heads are selected using the probability based on the ratio between residual energy of each node and the average energy of the network. The epochs of being cluster-heads for nodes are different according to their initial and residual energy. The nodes with high initial and residual energy have more chances of the becoming cluster heads compared to nodes with low energy.
O. Younis and S. Fahmy proposed [4] Hybrid Energy Efficient Distributed clustering Protocol (HEED) protocol in 2004. It extends the basic scheme of LEACH by using residual energy as primary parameter and network topology features (e.g. node degree, distances to neighbors) are only used as secondary parameters to break tie between candidate cluster heads, as a metric for cluster selection to achieve power balancing. The clustering process is divided into a number of iterations, and in each iterations, nodes which are not covered by any cluster head double their probability of becoming a cluster head. Since these energy-efficient clustering protocols enable every node to independently and probabilistically decide on its role in the clustered network, they cannot guarantee optimal elected set of cluster heads.
沒有留言:
張貼留言