Repository logo
 

Faculty of Accounting and Informatics

Permanent URI for this communityhttp://ir-dev.dut.ac.za/handle/10321/1

Browse

Author: search.filters.author.Adeliyi, TimothyHas files: Yes

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    A hyper-heuristic heterogeneous multisensor node scheme for energy efficiency in larger wireless sensor networks using DEEC-Gaussian algorithm
    (Hindawi Limited, 2021-02-15) Aroba, Oluwasegun Julius; Naicker, Nalindren; Adeliyi, Timothy
    A wireless sensor network (WSN) is an intellect-sustainable network that comprises multiple spatially distributed sensor nodes and several sink nodes that collect data from sensors. WSNs remain an active research area in the literature due to challenging factors such as the selection of sensor location according to a given premise, finding optimal routing algorithm, and ensuring energy efficiency and consumption. Minimizing energy and prolonging the network lifetime in the WSNs are the focus of this research work. In the literature, a clustering approach is used in grouping sensor nodes into clusters and is seen as an effective technique used in optimizing energy consumption in WSNs. Hence, in this paper, we put forward a novel clustering-based approach by amalgamating the Gaussian elimination method with the Distributed Energy-Efficient Clustering to produce DEEC_Gaussian (DEEC_Gaus) to stabilize energy efficiency optimization in WSNs. We took the advantages of DEEC and Gaussian elimination algorithms to resolve energy efficiency problems in WSNs. DEEC presents attributes such as increased heterogeneity performance level, clustering stability in operation, and energy efficiency which helps to prolong network lifetime while the Gaussian elimination algorithm added an additional advantage to improve and optimize energy efficiency, to aggregate packets of operations performed in the network lifestyle of energy efficiency in WSNs. The simulations were carried out using MATLAB software with 1000 to 1500 nodes. The performance of the proposed work was compared with state-of-the-art algorithms such as DEEC, DDEEC, and EDEEC_E. The simulated results presented show that the proposed DEEC-Gauss outperformed the three other conventional algorithms in terms of network lifetime, first node dead, tenth node dead, alive nodes, and the overall timing of the packets received at the base station. The results showed that the proposed hyper-heuristic heterogeneous multisensor DEEC-Gauss algorithm presented an average percentage of 3.0% improvement for the tenth node dead (TND) and further improvement of 4.8% for the first node dead (FND). When the performance was compared to the state-of-the-art algorithms in larger networks, the overall delivery was greatly improved and optimized.
  • Thumbnail Image
    Item
    An innovative hyperheuristic, gaussian clustering scheme for energy-efficient optimization in wireless sensor networks
    (Hindawi Limited, 2021-02-11) Aroba, Oluwasegun Julius; Naicker, Nalindren; Adeliyi, Timothy
    Energy stability on sensor nodes in wireless sensor networks (WSNs) is always an important challenge, especially during data capturing and transmission of packets. The recent advancement in distributed clustering algorithms in the extant literature proposed for energy efficiency showed refinements in deployment of sensor nodes, network duration stability, and throughput of information data that are channelled to the base station. However, much scope still exists for energy improvements in a heterogeneous WSN environment. This research study uses the Gaussian elimination method merged with distributed energy efficient clustering (referred to as DEEC-Gauss) to ensure energy efficient optimization in the wireless environment. The rationale behind the use of the novel DEEC-Gauss clustering algorithm is that it fills the gap in the literature as researchers have not been able to use this scheme before to carry out energy-efficient optimization in WSNs with 100 nodes, between 1,000 and 5000 rounds and still achieve a fast time output. In this study, using simulation, the performance of highly developed clustering algorithms, namely, DEEC, EDEEC_E, and DDEEC, was compared to the proposed Gaussian Elimination Clustering Algorithm (DEEC-Gauss). The results show that the proposed DEEC-Gauss Algorithm gives an average percentage of 4.2% improvement for the first node dead (FND), a further 2.8% improvement for the tenth node dead (TND), and the overall time of delivery was increased and optimized when compared with other contemporary algorithms.