Metaheuristics Techniques for Cluster Head Selection in WSN: A Survey

In recent years, Wireless sensor communication is growing expeditiously on the capability to gather information, communicate and transmit data effectively. Clustering is the main objective of improving the network lifespan in Wireless sensor network. It includes selecting the cluster head for each cluster in addition to grouping the nodes into clusters. The cluster head gathers data from the normal nodes in the cluster, and the gathered information is then transmitted to the base station. However, there are many reasons in effect opposing unsteady cluster head selection and dead nodes. The technique for selecting a cluster head takes into factors to consider including residual energy, neighbors’ nodes, and the distance between the base station to the regular nodes. In this study, we thoroughly investigated by number of methods of selecting a cluster head and constructing a cluster. Additionally, a quick performance assessment of the techniques' performance is given together with the methods' criteria, advantages, and future directions

Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

A Survey on Energy Optimization Techniques in UAV-Based Cellular Networks: From Conventional to Machine Learning Approaches

Wireless communication networks have been witnessing an unprecedented demand due to the increasing number of connected devices and emerging bandwidth-hungry applications. Albeit many competent technologies for capacity enhancement purposes, such as millimeter wave communications and network densification, there is still room and need for further capacity enhancement in wireless communication networks, especially for the cases of unusual people gatherings, such as sport competitions, musical concerts, etc. Unmanned aerial vehicles (UAVs) have been identified as one of the promising options to enhance the capacity due to their easy implementation, pop up fashion operation, and cost-effective nature. The main idea is to deploy base stations on UAVs and operate them as flying base stations, thereby bringing additional capacity to where it is needed. However, because the UAVs mostly have limited energy storage, their energy consumption must be optimized to increase flight time. In this survey, we investigate different energy optimization techniques with a top-level classification in terms of the optimization algorithm employed; conventional and machine learning (ML). Such classification helps understand the state of the art and the current trend in terms of methodology. In this regard, various optimization techniques are identified from the related literature, and they are presented under the above mentioned classes of employed optimization methods. In addition, for the purpose of completeness, we include a brief tutorial on the optimization methods and power supply and charging mechanisms of UAVs. Moreover, novel concepts, such as reflective intelligent surfaces and landing spot optimization, are also covered to capture the latest trend in the literature.Comment: 41 pages, 5 Figures, 6 Tables. Submitted to Open Journal of Communications Society (OJ-COMS

Differential Evolution in Wireless Communications: A Review

Differential Evolution (DE) is an evolutionary computational method inspired by the biological processes of evolution and mutation. DE has been applied in numerous scientific fields. The paper presents a literature review of DE and its application in wireless communication. The detailed history, characteristics, strengths, variants and weaknesses of DE were presented. Seven broad areas were identified as different domains of application of DE in wireless communications. It was observed that coverage area maximisation and energy consumption minimisation are the two major areas where DE is applied. Others areas are quality of service, updating mechanism where candidate positions learn from a large diversified search region, security and related field applications. Problems in wireless communications are often modelled as multiobjective optimisation which can easily be tackled by the use of DE or hybrid of DE with other algorithms. Different research areas can be explored and DE will continue to be utilized in this contex

Communication and Control in Collaborative UAVs: Recent Advances and Future Trends

The recent progress in unmanned aerial vehicles (UAV) technology has significantly advanced UAV-based applications for military, civil, and commercial domains. Nevertheless, the challenges of establishing high-speed communication links, flexible control strategies, and developing efficient collaborative decision-making algorithms for a swarm of UAVs limit their autonomy, robustness, and reliability. Thus, a growing focus has been witnessed on collaborative communication to allow a swarm of UAVs to coordinate and communicate autonomously for the cooperative completion of tasks in a short time with improved efficiency and reliability. This work presents a comprehensive review of collaborative communication in a multi-UAV system. We thoroughly discuss the characteristics of intelligent UAVs and their communication and control requirements for autonomous collaboration and coordination. Moreover, we review various UAV collaboration tasks, summarize the applications of UAV swarm networks for dense urban environments and present the use case scenarios to highlight the current developments of UAV-based applications in various domains. Finally, we identify several exciting future research direction that needs attention for advancing the research in collaborative UAVs

An efficient genetic algorithm for large-scale planning of robust industrial wireless networks

An industrial indoor environment is harsh for wireless communications compared to an office environment, because the prevalent metal easily causes shadowing effects and affects the availability of an industrial wireless local area network (IWLAN). On the one hand, it is costly, time-consuming, and ineffective to perform trial-and-error manual deployment of wireless nodes. On the other hand, the existing wireless planning tools only focus on office environments such that it is hard to plan IWLANs due to the larger problem size and the deployed IWLANs are vulnerable to prevalent shadowing effects in harsh industrial indoor environments. To fill this gap, this paper proposes an overdimensioning model and a genetic algorithm based over-dimensioning (GAOD) algorithm for deploying large-scale robust IWLANs. As a progress beyond the state-of-the-art wireless planning, two full coverage layers are created. The second coverage layer serves as redundancy in case of shadowing. Meanwhile, the deployment cost is reduced by minimizing the number of access points (APs); the hard constraint of minimal inter-AP spatial paration avoids multiple APs covering the same area to be simultaneously shadowed by the same obstacle. The computation time and occupied memory are dedicatedly considered in the design of GAOD for large-scale optimization. A greedy heuristic based over-dimensioning (GHOD) algorithm and a random OD algorithm are taken as benchmarks. In two vehicle manufacturers with a small and large indoor environment, GAOD outperformed GHOD with up to 20% less APs, while GHOD outputted up to 25% less APs than a random OD algorithm. Furthermore, the effectiveness of this model and GAOD was experimentally validated with a real deployment system

Power Beacon’s deployment optimization for wirelessly powering massive Internet of Things networks

Abstract. The fifth-generation (5G) and beyond wireless cellular networks promise the native support to, among other use cases, the so-called Internet of Things (IoT). Different from human-based cellular services, IoT networks implement a novel vision where ordinary machines possess the ability to autonomously sense, actuate, compute, and communicate throughout the Internet. However, as the number of connected devices grows larger, an urgent demand for energy-efficient communication technologies arises. A key challenge related to IoT devices is that their very small form factor allows them to carry just a tiny battery that might not be even possible to replace due to installation conditions, or too costly in terms of maintenance because of the massiveness of the network. This issue limits the lifetime of the network and compromises its reliability. Wireless energy transfer (WET) has emerged as a potential candidate to replenish sensors’ batteries or to sustain the operation of battery-free devices, as it provides a controllable source of energy over-the-air. Therefore, WET eliminates the need for regular maintenance, allows sensors’ form factor reduction, and reduces the battery disposal that contributes to the environment pollution. In this thesis, we review some WET-enabled scenarios and state-of-the-art techniques for implementing WET in IoT networks. In particular, we focus our attention on the deployment optimization of the so-called power beacons (PBs), which are the energy transmitters for charging a massive IoT deployment subject to a network-wide probabilistic energy outage constraint. We assume that IoT sensors’ positions are unknown at the PBs, and hence we maximize the average incident power on the worst network location. We propose a linear-time complexity algorithm for optimizing the PBs’ positions that outperforms benchmark methods in terms of minimum average incident power and computation time. Then, we also present some insights on the maximum coverage area under certain propagation conditions