NodeWiz: Fault-tolerant grid information service

Large scale grid computing systems may provide multitudinous services, from different providers, whose quality of service will vary. Moreover, services are deployed and undeployed in the grid with no central coordination. Thus, to find out the most suitable service to fulfill their needs, or to find the most suitable set of resources on which to deploy their services, grid users must resort to a Grid Information Service (GIS). This service allows users to submit rich queries that are normally composed of multiple attributes and range operations. The ability to efficiently execute complex searches in a scalable and reliable way is a key challenge for current GIS designs. Scalability issues are normally dealt with by using peer-to-peer technologies. However, the more reliable peer-to-peer approaches do not cater for rich queries in a natural way. On the other hand, approaches that can easily support these rich queries are less robust in the presence of failures. In this paper we present the design of NodeWiz, a GIS that allows multi-attribute range queries to be performed efficiently in a distributed manner, while maintaining load balance and resilience to failures.     

Prudence in vacillatory language identification

This paper settles a question about prudent vacillatory identification of languages. Consider a scenario in which an algorithmic deviceM is presented with all and only the elements of a languageL, andM conjectures a sequence, possibly infinite, of grammars. Three different criteria for success ofM onL have been extensively investigated in formal language learning theory. IfM converges to a single correct grammar forL, then the criterion of success is Gold's seminal notion ofTxtEx-identification. IfM converges to a finite number of correct grammars forL, then the criterion of success is calledTxtFex-identification. Further, ifM, after a finite number of incorrect guesses, outputs only correct grammars forL (possibly infinitely many distinct grammars), then the criterion of success is known asTxtBc-identification. A learning machine is said to beprudent according to a particular criterion of success just in case the only grammars it ever conjectures are for languages that it can learn according to that criterion. This notion was introduced by Osherson, Stob, and Weinstein with a view to investigating certain proposals for characterizing natural languages in linguistic theory. Fulk showed that prudence does not restrictTxtEx-identification, and later Kurtz and Royer showed that prudence does not restrictTxtBc-identification. This paper shows that prudence does not restrictTxtFex-identification.     

Outage Performance of Uplink (UL) NOMA Network

Wireless Personal Communications - This paper proposes and analyses the power allocation coefficient normalization for successive interference cancellation in power-domain non-orthogonal multiple...     

Intrusion Detection System in Wireless Sensor Network Using Conditional Generative Adversarial Network

Wireless communication networks have much data to sense, process, and transmit. It tends to develop a security mechanism to care for these needs for such modern-day systems. An intrusion detection system (IDS) is a solution that has recently gained the researcher’s attention with the application of deep learning techniques in IDS. In this paper, we propose an IDS model that uses a deep learning algorithm, conditional generative adversarial network (CGAN), enabling unsupervised learning in the model and adding an eXtreme gradient boosting (XGBoost) classifier for faster comparison and visualization of results. The proposed method can reduce the need to deploy extra sensors to generate fake data to fool the intruder 1.2–2.6%, as the proposed system generates this fake data. The parameters were selected to give optimal results to our model without significant alterations and complications. The model learns from its dataset samples with the multiple-layer network for a refined training process. We aimed that the proposed model could improve the accuracy and thus, decrease the false detection rate and obtain good precision in the cases of both the datasets, NSL-KDD and the CICIDS2017, which can be used as a detector for cyber intrusions. The false alarm rate of the proposed model decreases by about 1.827%.

     

Performance Analysis of Path Loss Models at 1.8 GHz in an Indoor/Outdoor Environment to Verify Network Capacity and Coverage

Wireless Personal Communications - Cloud is an environment where the resources are outsourced as service to the cloud consumers based on their demand. The cloud providers follows pay as you go...     

Encrypted Network Traffic Classification and Resource Allocation with Deep Learning in Software Defined Network

Wireless Personal Communications - The climate has changed absolutely in every area in just a few years as digitized, making high-speed internet service a significant need in the future. Future...     

Fuzzy and Deep Belief Network Based Malicious Vehicle Identification and Trust Recommendation Framework in VANETs

Wireless Personal Communications - This work aims to implement a clustering scheme to separate vehicles into a cluster that is based on various parameters, such as the total number of relay nodes,...     

Frequency regularization of a linked wind–diesel system using dual structure fuzzy with ultra-capacitor

Microgrids (μ-grids) are gaining increased interest around the world for supplying cheap and clean energy. In this paper, a μ-grid comprising a wind turbine generator (WTG) and diesel generator (DG) is considered. It is one of most practical and demanding systems suitable for the present energy crisis in isolated or rural areas. However, wind energy is intermittent in nature while load demand changes frequently. Therefore, a µ-grid can experience large frequency and power fluctuations. The speed governor of the DG tries to minimize the frequency and power deviations in µ-grid though its operation is slow and cannot adequately minimize system deviations. The paper proposes a novel arrangement based on a dual structured fuzzy (DSF) whose structure changes according to the switching limit with a reduced rule base. It has the capability to switch between proportional and integral actions and hence improves the frequency regularization of the μ-grid. The proposed strategy is tested in a μ-grid and the results considering step load alteration, load alteration at different instants of time, nonstop changing load request are compared with some of the well published methods to validate the effectiveness and simplicity of the present design. In addition, it shows that ultra-capacitor establishment in a μ-grid has a positive impact in minimizing system deviations with DSF for the studied cases.     

A novel social deep autoencoder NMF incentive scheme to detect a selfish node in delay tolerant network

Detection of the selfish node in a delay tolerant network (DTN) can sharply reduce the loss incurred in a network. The algorithm's current pedigree mainly focuses on the rely on nodes, records, and delivery performance. The community structure and social aspects have been overlooked. Analysis of individual and social tie preferences results in an extensive detection time and increases communication overhead. In this article, a heterogeneous DTN topology with high-power stationary nodes and mobile nodes on Manhattan's accurate map is designed. With the increasing complexity of social ties and the diversified nature of topology structure, there need for a method that can effectively capture the essence within the speculated time. In this article, a novel deep autoencoder-based nonnegative matrix factorization (DANMF) is proposed for DTN topology. The topology of social ties projected onto low-dimensional space leads to effective cluster formation. DANMF automatically learns an appropriate nonlinear mapping function by utilizing the features of data. Also, the inherent structure of the deep autoencoder is nonlinear and has strong generalization. The membership matrices extracted from the DANMF are used to design the weighted cumulative social tie that eventually, along with the residual energy, is used to detect the network's selfish node. The testing of the designed model is carried out on the real dataset of MIT reality. The proficiency of the developed algorithm has been well tested and proved at every step. The methods employed for social tie extraction are NMF and DANMF. The methodology is rigorously experimented on various scenarios and has improved around 80% in the worst-case scenario of 40% nodes turning selfish. A comprehensive comparison is made with the other existing state-of-the-art methods which are also incentive-based approaches. The developed method has outperformed and has shown the supremacy of the current methods to capture the latent, hidden structure of the social tie.

     

A quantum mutation-based backtracking search algorithm

The exposition of any nature-inspired optimization technique relies firmly upon its executed organized framework. Since the regularly utilized backtracking search algorithm (BSA) is a fixed framework, it is not always appropriate for all difficulty levels of problems and, in this manner, probably does not search the entire search space proficiently. To address this limitation, we propose a modified BSA framework, called gQR-BSA, based on the quasi reflection-based initialization, quantum Gaussian mutations, adaptive parameter execution, and quasi-reflection-based jumping to change the coordinate structure of the BSA. In gQR-BSA, a quantum Gaussian mechanism was developed based on the best population information mechanism to boost the population distribution information. As population distribution data can represent characteristics of a function landscape, gQR-BSA has the ability to distinguish the methodology of the landscape in the quasi-reflection-based jumping. The updated automatically managed parameter control framework is also connected to the proposed algorithm. In every iteration, the quasi-reflection-based jumps aim to jump from local optima and are adaptively modified based on knowledge obtained from offspring to global optimum. Herein, the proposed gQR-BSA was utilized to solve three sets of well-known standards of functions, including unimodal, multimodal, and multimodal fixed dimensions, and to solve three well-known engineering optimization problems. The numerical and experimental results reveal that the algorithm can obtain highly efficient solutions to both benchmark and real-life optimization problems.