Research Papers - Department of Electrical and Electronic Engineering
Permanent URI for this collectionhttps://rda.sliit.lk/handle/123456789/679
Browse
9 results
Search Results
Publication Embargo An analytical framework for cluster distribution of EDCR class of algorithms in Wireless Sensor Networks(IEEE, 2009-12-28) Gamwarige, S; Kulasekere, E. CEnergy Driven Cluster-Head Rotation (EDCR) class of algorithms are energy aware distributed clustering techniques for effective ad hoc deployed Wireless Sensor Network (WSN) organization. The application of this class of algorithms requires the setting of salient parameters at the design stage of the WSN to achieve desired results. Two such parameters which should be known in advance are the cluster density and the distance between neighbouring cluster heads (CHs). In this research we analyze the effect of algorithm design based on these two parameters. Simulation techniques are given to support and verify the analytical results.Publication Open Access Cluster density of dependent thinning distributed clustering class of algorithms in ad hoc deployed wireless networks(Hindawi, 2012-01-01) Gamwarige, S; Kulasekere, E. CDistributed clustering is widely used in ad hoc deployed wireless networks. Distributed clustering algorithms like DMAC, HEED, MEDIC, ANTCLUST-based, and EDCR produce well-distributed Cluster Heads (CHs) using dependent thinning techniques where a node’s decision to be a CH depends on the decision of its neighbors. An analytical technique to determine the cluster density of this class of algorithms is proposed. This information is required to set the algorithm parameters before a wireless network is deployed. Simulation results are presented in order to verify the analytical findings.Publication Embargo Energy expenditure of global reclustering and local delegation in Wireless Sensor Networks(IEEE, 2010-09-06) De Silva, H. J; Gamwarige, S; Kulasekere, E. COne of the most important aspects in a clustering algorithm in a wireless sensor network is the cluster head (CH) rotation mechanism. Global reclustering is the common and established method used for this purpose in many existing algorithms. This research proposes an analytical framework to investigate the average energy expenditure of the global reclustering method and a local delegation strategy in which the CH role is delegated to a member of the cluster without changing the initial cluster boundary. Further we investigate a strategy of partial local delegation within global reclustering rounds to achieve energy efficiency. Simulations are used to visualize the analytically derived results using the simulation environment MATLAB.Publication Embargo Performance analysis of the edcr algorithm in a distributed wireless sensor network(IEEE, 2006-04-11) Gamwarige, S; Kulasekere, E. CThe energy driven cluster-head rotation (EDCR) algorithm proposed in S. Gamwarige and E. Kulasekere (2005) has been shown to out performed existing clustering algorithms such as LEACH (W.B. Heinzelman et al., 2002), HEED (O. Younis and S. Fahmy, 2004), ANTCLUST based (J. Kamimura et al., 2004) and SEP (G. Smaragdakis et al., 2004) in terms of END and PNA (95%) lifetime metrics in a distributed wireless sensor network (WSN). In this paper we present theoretical analysis of the performance parameters such as the optimum transmission range (R opt ) and the clustering trigger threshold value (lambda i ) of EDCR in terms correctness and complexity of the algorithm. Further we explain how to find the optimal values for such parameters in order to maximize the network lifetimePublication Embargo A cluster based energy balancing strategy to improve Wireless Sensor Networks lifetime(IEEE, 2007-08-09) Gamwarige, S; Kulasekere, E. CWireless Sensor Networks (WSNs) have been of interest due to its many areas of application. The lifetime of the sensor bed is of crucial importance for the successful deployment of such networks. Many algorithms have been proposed based on clustering and cluster head (CH) rotation to improve the lifetime of WSNs. EDCR [1] and EDCR-MH [2] are two such algorithms that have shown promising results. The lifetime of the entire sensor bed can be significantly improved if the energy associated with a sensor node is depleted at the same rate irrespective of its location with respect to the Base Station (BS). This research proposes a new algorithm for CH selection and rotation that incorporates the desirable features of both EDCR and EDCRMH together with a modified minimum distance communication between CH and BS. The algorithm is capable of balancing the energy depletion rate of sensor nodes across the entire sensor bed irrespective of their node locations. Unlike previous algorithms, the proposed algorithm can be applied to significantly larger sensor beds while maintaining the lifetime performance. Analytical models are presented to identify salient parameters of the proposed algorithm. Simulation results are provided to illustrate the applicability of the algorithm. The results indicate that the lifetime of the entire sensor bed is improved over existing algorithms.Publication Embargo Application of the edcr algorithm in a cluster based multi-hop wireless sensor network(IEEE, 2006-10-18) Gamwarige, S; Kulasekere, E. CThe energy driven cluster head rotation algorithm proposed in (Gamwarige, S and Kulasekere, E, 2005) and analyzed in (Gamwarige, S and Kulasekere, E, 2006) is based on a single hop communication model where the data messages from each cluster head (CH) node is sent directly to the base station (BS). As a result when the wireless sensor network (WSN) dimensions are large, the nodes located far away from the BS die much faster. In this paper a method of extending the lifetime of the WSN based on a multihop communication model applied to the EDCR algorithm is proposed. The modified EDCR (EDCR-MH) relays all CH to BS messages via other CH nodes by computing a shortest path based on local heuristic information. Further, the EDCR-MH also has provisions to minimize the burden due to excessive data relay on nodes closer to the BS. The results indicate that the proposed algorithm out performs algorithms like under similar conditionsPublication Open Access An energy efficient distributed clustering algorithm for ad hoc deployed wireless sensor networks in building monitoring applications(2009-01-01) Gamwarige, S; Kulasekere, E. CIn recent years Wireless Sensor Networks (WSNs) have been deployed for Building Monitoring (BM) as they provide a low cost and reconfigurable alternative to centralized cable based sensor systems. Using WSNs gives rise to unique issues in its practical usage. Lifetime of a WSN is one such crucial issue to be addressed during deployment. Clustering is an effective way of extending the lifetime of a WSN. In this article we propose a distributed and energy driven clustering algorithm where the selection of the cluster heads (CHs) are based on relative residual energy level of sensors. Furthermore, the CHs are rotated only when their energy drops below a dynamic threshold computed by the algorithm. As a result, the overheads in the inter sensor communications will be reduced and thereby the proposed algorithm will favor more powerful nodes over the weaker ones to prolong the lifetime of the entire WSN. This will effectively prolong the usability of the monitoring system and thus the underlying safety of the building. The results will show that the proposed algorithm performs better when compared to existing clustering algorithms. Further we present theoretical analysis of the performance of the proposed algorithm in terms of correctness and complexity and explain how to identify the optimal values for key parameters such as transmission range and re-clustering trigger threshold function value in order to maximize the network lifetimePublication Embargo Optimization of cluster head rotation in energy constrained wireless sensor networks(IEEE, 2007-07-02) Gamwarige, S; Kulasekere, E. CThe performance of energy driven cluster head (CH) rotation algorithms have been shown to be far more superior to time driven CH rotation algorithms when it comes to maximizing the sensor bed lifetime. The sensor bed life time is improved by selecting the proper points at which a CH role is relinquished to higher energy nodes via a CH rotation phase. However no formal analytical method is available to find the optimal point at which the CH rotation should be carried out. This research proposes an analytical iterative method to obtain the optimal points at which the CH rotation can be carried out. The method proposes an optimal value c opt for the energy threshold at which this rotation could occur. The values obtained via the analytical method is shown to be optimal via simulations using the EDCR and EDCR-MH algorithms. The analytical method proposed can be used in any energy driven algorithm to find the optimal point for CH rotations avoiding any ad hoc simulation based methods to maximize the lifetime of the sensor bed.Publication Open Access An algorithm for energy driven cluster head rotation in a distributed wireless sensor network(Colombo, 2005-12-15) Gamwarige, S; Kulasekere, E. CWireless sensor networks (WSNs) consists of large number of inexpensive, low-power, sensors that can be placed in an ad hoc fashion to form a communication network. Efficient techniques for inter sensor communication and information gathering is critical for prolonging the lifetime of the sensor network. Clustering provides an effective way for extending the lifetime of a sensor network. In this paper we propose a distributed and energy driven clustering algorithm where the cluster heads are selected based on relative residual energy level of sensors. Furthermore the cluster head candidacy selection phase, and the cluster head candidacy rotation among phases is triggered only when any of cluster heads energy drops below a dynamic threshold computed by the algorithm. As a result, the overheads in the inter sensor communications will be reduced and thereby the proposed algorithm will favor more powerful nodes over the weaker ones to prolong the lifetime of the entire sensor network in both homogeneous and heterogeneous sensor networks. The results have shown that the the proposed algorithm performs better when compared to existing algorithms such as LEACH, SEP, HEED and ANTCLUST based on the Percentage Node Alive (PNA) and the First Node Dies (FND) metrics.