scispace - formally typeset
Book ChapterDOI: 10.1016/B978-0-12-804409-4.00013-9

A quantum-inspired hybrid intelligent position monitoring system in wireless networks

01 Jan 2017-pp 417-452
Abstract: Position monitoring systems (PMSs) that offer considerable convenience in our daily lives have been thoroughly studied in the past. A PMS has complete control of the position-related information, and it initiates the problem of a roaming user’s position confidentiality. We study the problem of a mobile object’s position confidentiality in wireless networks. Confidentiality-preserved authentication in position-based roaming services is intended for the provision of legal access to wireless network services. Unfortunately, existing PMSs have practical inadequacies such as position cheating, higher communication cost, fake record generation, and forwarding. We propose a novel quantum-inspired hybrid intelligent PMS in wireless networks with the aim of conserving confidentiality of an individual in real-time position-based services. We devise a quantum-inspired PMS algorithm incorporating fuzzy logic and quantum computational theory to achieve computational intelligence in the problem of a mobile object’s position confidentiality. To the best of our knowledge this is the first work in the PMS literature to integrate the concept of quantum-inspired computation, and hence the proposed PMS algorithm is also the first quantum-inspired hybrid intelligent PMS algorithm for solving the position confidentiality problem with the anonymity concept. The simulation results and case studies prove that the proposed quantum-inspired PMS can conserve confidentiality of the roaming user with reduced communication cost.

...read more

Topics: Roaming (56%), Wireless network (55%)
Citations
  More

Journal ArticleDOI: 10.1109/TII.2019.2898174
Abstract: Position-based services (PBSs) that deliver networked amenities based on roaming user's positions have become progressively popular with the propagation of smart mobile devices. Position is one of the important circumstances in PBSs. For effective PBSs, extraction and recognition of meaningful positions and estimating the subsequent position are fundamental procedures. Several researchers and practitioners have tried to recognize and predict positions using various techniques; however, only few deliberate the progress of position-based real-time applications considering significant tasks of PBSs. In this paper, a method for conserving position confidentiality of roaming PBSs users using machine learning techniques is proposed. We recommend a three-phase procedure for roaming PBS users. It identifies user position by merging decision trees and k-nearest neighbor and estimates user destination along with the position track sequence using hidden Markov models. Moreover, a mobile edge computing service policy is followed in the proposed paradigm, which will ensure the timely delivery of PBSs. The benefits of mobile edge service policy offer position confidentiality and low latency by means of networking and computing services at the vicinity of roaming users. Thorough experiments are conducted, and it is confirmed that the proposed method achieved above 90% of the position confidentiality in PBSs.

...read more

Topics: Roaming (55%), Edge computing (54%), Mobile edge computing (54%) ...read more

127 Citations


Journal ArticleDOI: 10.1109/TII.2019.2953289
Abstract: Adversary models have been fundamental to the various cryptographic protocols and methods. However, their use in most of the branches of research in computer science is comparatively restricted, primarily in case of the research in cyberphysical security (e.g., vulnerability studies, position confidentiality). In this article, we propose an energy-aware green adversary model for its use in smart industrial environment through achieving confidentiality. Even though, mutually the hardware and the software parts of cyberphysical systems can be improved to decrease its energy consumption, this article focuses on aspects of conserving position and information confidentiality. On the basis of our findings (assumptions, adversary goals, and capabilities) from the literature, we give some testimonials to help practitioners and researchers working in cyberphysical security. The proposed model that runs on real-time anticipatory position-based query scheduling in order to minimize the communication and computation cost for each query, thus, facilitating energy consumption minimization. Moreover, we calculate the transferring/acceptance slots required for each query to avoid deteriorating slots. The experimental results confirm that the proposed approach can diminish energy consumption up to five times in comparison to existing approaches

...read more

Topics: Adversary model (65%), Adversary (55%), Energy consumption (54%) ...read more

60 Citations


Journal ArticleDOI: 10.1109/TSUSC.2017.2690378
01 Apr 2017-
Abstract: Massive data sets of continuous position-based queries (CPQs) in position monitoring applications offer a challenge of time ingestion while forwarding the position-based data within wireless search space area. As a result of recurrent modifications in network topology due to the mobility of users, processing of large CPQ data sets and roaming CPQs is one of the challenges in position monitoring. Therefore, the parallel algorithm is proposed in this paper for clustering and parallel processing of roaming CPQs which will recognize solid clusters in the wireless search space area. We present an algorithm which proposes the use of search space areas for clustering and introduce a parallel framework for parallel processing of CPQ data sets. The wireless search space area from wireless networks are used for scalable and effective calculation of clusters and dimensions in wireless networks. Present continuous query processing techniques cannot competently process roaming CPQs in the wireless search space area. The proposed algorithm is demonstrated to have practically best speedups in processing roaming CPQs. Results indicate that the proposed work determine improved ability of CPQs over existing mechanisms and attain small query latency and high precision in position monitoring applications.

...read more

Topics: Wireless network (59%), Roaming (58%), Cluster analysis (55%) ...read more

35 Citations


Journal ArticleDOI: 10.1016/J.COMPELECENG.2017.01.025
Abstract: Evolutionary multi-objective optimization (EMO) algorithms are actively used for answering optimization problems with multiple contradictory objectives and scheming interpretable and precise real-time applications. A majority of existing EMO algorithms performs better on two or three objectives non-dominated problems; however, they meet complications in managing and maintaining a set of optimal solutions to multi-objective optimization problems. This paper proposes a search space-based multi-objective evolutionary algorithm (SSMOEA) for multi-objective optimization problems. To accomplish the potential of the search space-based method for solving multi-objective optimization problems and to reinforce the selection procedure toward the ideal direction while sustaining an extensive and uniform distribution of solutions is our key objective. To the best of our knowledge, this paper is the first attempt to propose a search space-based multi-objective evolutionary algorithm for multi-objective optimization. The experimental setup used showed that the proposed algorithm is good and competitive in comparison to the existing EMO algorithms from the viewpoint of finding a scattered and estimated solution set in multi-objective optimization problems. SSMOEA can achieve a good trade-off between search space convergence and search space diversity in the appropriate experimental setup.

...read more

Topics: Metaheuristic (69%), Multi-objective optimization (67%), Local search (optimization) (65%) ...read more

31 Citations


Journal ArticleDOI: 10.1109/TETCI.2017.2769110
23 May 2018-
Abstract: E-Governance or electronic governance is a procedure of public sector regulation and is a significant step in the transformation of municipal administration, with the intention of confiding and smoothing collaboration among the population and civic establishments through Information and Communications Technology-based applications. Content Confidentiality has become a serious anxiety for modern Information Societies. The sensitive nature of much of the private personal data that are exchanged or released to untrusted parties necessitates that liable administrations should embark on suitable content confidentiality protection mechanisms. Nowadays, many of these data are texts (e.g., emails, messages posted in social media, healthcare outcomes, etc.) that, because of their unstructured and semantic nature, constitutes a challenge for automatic data protection methods. In this paper, we present a solution for position confidentiality conserving content protection in e-Governance services through computational intelligence. We propose PCCA, a novel position confidentiality conserving algorithm for content protection in e-Governance. The proposed algorithm applies computational intelligence in e-Governance for content protection by means of rule-based approach from computational intelligence and users current position information. A simulation model has been implemented on a desktop PC and evaluation using roaming users real-time position-based information demonstrates that PCCA can efficiently conserve roaming users position confidentiality while accomplishing better performance, guaranteed position confidentiality, and better quality of service in e-Governance.

...read more

Topics: Data Protection Act 1998 (56%), Confidentiality (55%), Population (51%) ...read more

13 Citations

References
  More

Open access
01 Dec 2010-
Abstract: Part I. Fundamental Concepts: 1. Introduction and overview 2. Introduction to quantum mechanics 3. Introduction to computer science Part II. Quantum Computation: 4. Quantum circuits 5. The quantum Fourier transform and its application 6. Quantum search algorithms 7. Quantum computers: physical realization Part III. Quantum Information: 8. Quantum noise and quantum operations 9. Distance measures for quantum information 10. Quantum error-correction 11. Entropy and information 12. Quantum information theory Appendices References Index.

...read more

Topics: Quantum information (84%), Quantum computer (79%), Quantum Fourier transform (75%) ...read more

14,183 Citations


Open accessBook
01 Jan 1992-
Abstract: 1 GAs: What Are They?.- 2 GAs: How Do They Work?.- 3 GAs: Why Do They Work?.- 4 GAs: Selected Topics.- 5 Binary or Float?.- 6 Fine Local Tuning.- 7 Handling Constraints.- 8 Evolution Strategies and Other Methods.- 9 The Transportation Problem.- 10 The Traveling Salesman Problem.- 11 Evolution Programs for Various Discrete Problems.- 12 Machine Learning.- 13 Evolutionary Programming and Genetic Programming.- 14 A Hierarchy of Evolution Programs.- 15 Evolution Programs and Heuristics.- 16 Conclusions.- Appendix A.- Appendix B.- Appendix C.- Appendix D.- References.

...read more

Topics: Genetic programming (54%), Evolutionary programming (53%), Learnable Evolution Model (52%) ...read more

12,058 Citations


Open accessJournal ArticleDOI: 10.1016/0898-1221(83)90013-5
Lotfi A. Zadeh1Institutions (1)
Abstract: The generic term fuzzy quantifier is employed in this paper to denote the collection of quantifiers in natural languages whose representative elements are: several, most, much, not many, very many, not very many, few, quite a few, large number, small number, close to five, approximately ten, frequently, etc. In our approach, such quantifiers are treated as fuzzy numbers which may be manipulated through the use of fuzzy arithmetic and, more generally, fuzzy logic. A concept which plays an essential role in the treatment of fuzzy quantifiers is that of the cardinality of a fuzzy set. Through the use of this concept, the meaning of a proposition containing one or more fuzzy quantifiers may be represented as a system of elastic constraints whose domain is a collection of fuzzy relations in a relational database. This representation, then, provides a basis for inference from premises which contain fuzzy quantifiers. For example, from the propositions “Most U's are A's” and “Most A's are B's,” it follows that “Most2 U's are B's,” where most2 is the fuzzy product of the fuzzy proportion most with itself. The computational approach to fuzzy quantifiers which is described in this paper may be viewed as a derivative of fuzzy logic and test-score semantics. In this semantics, the meaning of a semantic entity is represented as a procedure which tests, scores and aggregates the elastic constraints which are induced by the entity in question.

...read more

Topics: Fuzzy set operations (72%), Fuzzy number (72%), Type-2 fuzzy sets and systems (68%) ...read more

1,687 Citations


Open accessProceedings ArticleDOI: 10.5555/1182635.1164193
01 Sep 2006-
Abstract: This paper tackles a major privacy concern in current location-based services where users have to continuously report their locations to the database server in order to obtain the service. For example, a user asking about the nearest gas station has to report her exact location. With untrusted servers, reporting the location information may lead to several privacy threats. In this paper, we present Casper1; a new framework in which mobile and stationary users can entertain location-based services without revealing their location information. Casper consists of two main components, the location anonymizer and the privacy-aware query processor. The location anonymizer blurs the users' exact location information into cloaked spatial regions based on user-specified privacy requirements. The privacy-aware query processor is embedded inside the location-based database server in order to deal with the cloaked spatial areas rather than the exact location information. Experimental results show that Casper achieves high quality location-based services while providing anonymity for both data and queries.

...read more

Topics: Location-based service (59%), Database server (53%), Server (52%)

1,210 Citations


Open accessBook
01 Jan 2001-
Abstract: 1 The Weber Problem.- 2 Continuous Covering Location Problems.- 3 Discrete Network Location Models.- 4 Location Problems in the Public Sector.- 5 Consumers in Competitive Location Models.- 6 An Efficient Genetic Algorithm for the p-Median Problem.- 7 Demand Point Aggregation for Location Models.- 8 Location Software and Interface with GIS and Supply Chain Management.- 9 Telecommunication and Location.- 10 Reserve Design and Facility Siting.- 11 Facility Location Problems with Stochastic Demands and Congestion.- 12 Hub Location Problems.- 13 Location and Robotics.- 14 The Quadratic Assignment Problem.

...read more

Topics: Facility location problem (65%), 1-center problem (62%), Quadratic assignment problem (56%) ...read more

1,104 Citations


Performance
Metrics
No. of citations received by the Paper in previous years
YearCitations
20201
20191
20181
20172