Reconfiguration of an electrical power radial distribution network is aimed at finding a radial operating structure that minimizes the system active power loss, enhancing the system voltage profile via reducing the active power losses whilst satisfying operating constraints is one of the most important measures of improving the operational performance of a distribution system. In this paper, an efficient approach to solving the problem of reconfiguration considering active power loss, total voltage deviation for a typical distribution network. The method developed is based on improved genetic algorithm to determine the optimal location of tie and sectionalizing switches, with a view to yield an optimal performance for the network. The reconfiguration model was implemented using MATLAB R2016a simulation environment. The effectiveness and validity of the proposed model was tested on a 16, 33 and 69 IEEE-Bus standard systems for distribution network. The results show that with a reduction of 8.86%, 31.15% and 53.53% in active power loss as compared to the initial configuration, whilst a total voltage deviation of 0.0284p.u., 0.0622p.u and 0.0517p.u for 16, 33 and 69 IEEE Bus respectively.

Vigenere cipher is one of the earliest known polyalphabetic cipher which was considered secure for a very long time until 1917 when friedman and kasiski were able to break it by determining repeating segments of the ciphertext and using it to determine the length of the key. Once the length of the key is known, the ciphertext could be grouped in columns and treated as a separate caesar cipher which can be solved. Over the years, a lot of modification has been done to inprove the security of the vigenere cipher. This paper presents a review of the vigenere cipher and also discusses various existing modifications. General TermsCryptography is the art and science of protecting information from unauthorized individuals.Encryption is a way of converting information (plaintext) into a form that is unreadable to unauthorized individuals (ciphertext).

No abstract

No abstract

No abstract

In this paper, cluster-based routing (CBR) protocols for addressing issues pertinent to energy consumption, network lifespan, resource allocation and network coverage are reviewed. The paper presents an indepth performance analysis and critical review of selected CBR algorithms. The study is domain-specific and simulation-based with emphasis on the tripartite trade-off between coverage, connectivity and lifespan. The rigorous statistical analysis of selected CBR schemes was also presented. Network simulation was conducted with Java-based Atarraya discrete-event simulation toolkit while statistical analysis was carried out using MATLAB. It was observed that the Periodic, Event-Driven and Query-Based Routing (PEQ) schemes performs better than Low-Energy Adaptive Clustering Hierarchy (LEACH), Threshold-Sensitive Energy-Efficient Sensor Network (TEEN) and Geographic Adaptive Fidelity (GAF) in terms of network lifespan, energy consumption and network throughput.

No abstract