Establishing complete and reliable coverage for a long time-span is a crucial issue in densely surveillance wireless sensor networks (WSNs). Many scheduling algorithms have been proposed to model the problem as a maximum disjoint set covers (DSC) problem. The goal of DSC based algorithms is to schedule sensors into several disjoint subsets. One subset is assigned to be active, whereas, all remaining subsets are set to sleep. An extension to the maximum disjoint set covers problem has also been addressed in literature to allow for more advance sensors to adjust their sensing range. The problem, then, is extended to finding maximum number of overlapped set covers. Unlike all related works which concern with the disc sensing model, the contribution of this paper is to reformulate the maximum overlapped set covers problem to handle the probabilistic sensing model. The problem is addressed as a multi-objective optimization (MOO) problem and the well-known decomposition based multi-objective evolutionary algorithm (MOEA/D) is adopted to solve the stated problem. A Multi-layer MOEA/D is suggested, wherein each layer yields a distinct set cover. Performance evaluations in terms of total number of set covers, total residual energy, and coverage reliability are reported through extensive simulations. The main aspect of the results reveals that the network's lifetime (i.e. total number of set covers) can be extended by increasing number of sensors. On the other hand, the coverage reliability can be increased by increasing sensing ranges but at the expense of decreasing the network's lifetime.
Mobile Wireless sensor networks have acquired a great interest recently due to their capability to provide good solutions and low-priced in multiple fields. Internet of Things (IoT) connects different technologies such as sensing, communication, networking, and cloud computing. It can be used in monitoring, health care and smart cities. The most suitable infrastructure for IoT application is wireless sensor networks. One of the main defiance of WSNs is the power limitation of the sensor node. Clustering model is an actual way to eliminate the inspired power during the transmission of the sensed data to a central point called a Base Station (BS). In this paper, efficient clustering protocols are offered to prolong network lifetime. A kern
... Show More<p> Traditionally, wireless networks and optical fiber Networks are independent of each other. Wireless networks are designed to meet specific service requirements, while dealing with weak physical transmission, and maximize system resources to ensure cost effectiveness and satisfaction for the end user. In optical fiber networks, on the other hand, search efforts instead concentrated on simple low-cost, future-proofness against inheritance and high services and applications through optical transparency. The ultimate goal of providing access to information when needed, was considered significantly. Whatever form it is required, not only increases the requirement sees technology convergence of wireless and optical networks but
... Show MoreOne of the most interested problems that recently attracts many research investigations in Protein-protein interactions (PPI) networks is complex detection problem. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem wherein, recently, the field of Evolutionary Algorithms (EAs) reveals positive results. The contribution of this work is to introduce a heuristic operator, called protein-complex attraction and repulsion, which is especially tailored for the complex detection problem and to enable the EA to improve its detection ability. The proposed heuristic operator is designed to fine-grain the structure of a complex by dividing it into two more complexes, each being distinguished with a core pr
... Show MoreWith wireless sensor network (WSN) wide applications in popularity, securing its data becomes a requirement. This can be accomplished by encrypting sensor node data. In this paper a new an efficient symmetric cryptographic algorithm is presented. This algorithm is called wireless sensor network wavelet curve ciphering system (WSN-WCCS). The algorithm idea based on discrete wavelet transformation to generate keys for each node in WSN. It implements on hierarchical clustering WSN using LEACH protocol. Python programming language version 2.7 was used to create the simulator of WSN framework and implement a WSN-WCCS algorithm. The simulation result of the proposed WSN-WCCS with other symmetric algorithms has show
... Show MoreThe majority of real-world problems involve not only finding the optimal solution, but also this solution must satisfy one or more constraints. Differential evolution (DE) algorithm with constraints handling has been proposed to solve one of the most fundamental problems in cellular network design. This proposed method has been applied to solve the radio network planning (RNP) in the forthcoming 5G Long Term Evolution (5G LTE) wireless cellular network, that satisfies both deployment cost and energy savings by reducing the number of deployed micro base stations (BSs) in an area of interest. Practically, this has been implemented using constrained strategy that must guarantee good coverage for the users as well. Three differential evolution
... Show More<p><span>Medium access control (MAC) protocol design plays a crucial role to increase the performance of wireless communications and networks. The channel access mechanism is provided by MAC layer to share the medium by multiple stations. Different types of wireless networks have different design requirements such as throughput, delay, power consumption, fairness, reliability, and network density, therefore, MAC protocol for these networks must satisfy their requirements. In this work, we proposed two multiplexing methods for modern wireless networks: Massive multiple-input-multiple-output (MIMO) and power domain non-orthogonal multiple access (PD-NOMA). The first research method namely Massive MIMO uses a massive numbe
... Show MoreWe define and study new ideas of fibrewise topological space on D namely fibrewise multi-topological space on D. We also submit the relevance of fibrewise closed and open topological space on D. Also fibrewise multi-locally sliceable and fibrewise multi-locally section able multi-topological space on D. Furthermore, we propose and prove a number of statements about these ideas.
In the geotechnical and terramechanical engineering applications, precise understandings are yet to be established on the off-road structures interacting with complex soil profiles. Several theoretical and experimental approaches have been used to measure the ultimate bearing capacity of the layered soil, but with a significant level of differences depending on the failure mechanisms assumed. Furthermore, local displacement fields in layered soils are not yet studied well. Here, the bearing capacity of a dense sand layer overlying loose sand beneath a rigid beam is studied under the plain-strain condition. The study employs using digital particle image velocimetry (DPIV) and finite element method (FEM) simulations. In the FEM, an experiment
... Show More