for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> COMPUTER SCIENCE (Total: 2066 journals)
    - ANIMATION AND SIMULATION (31 journals)
    - ARTIFICIAL INTELLIGENCE (102 journals)
    - AUTOMATION AND ROBOTICS (105 journals)
    - CLOUD COMPUTING AND NETWORKS (63 journals)
    - COMPUTER ARCHITECTURE (10 journals)
    - COMPUTER ENGINEERING (11 journals)
    - COMPUTER GAMES (21 journals)
    - COMPUTER PROGRAMMING (26 journals)
    - COMPUTER SCIENCE (1196 journals)
    - COMPUTER SECURITY (46 journals)
    - DATA BASE MANAGEMENT (14 journals)
    - DATA MINING (36 journals)
    - E-BUSINESS (22 journals)
    - E-LEARNING (29 journals)
    - ELECTRONIC DATA PROCESSING (22 journals)
    - IMAGE AND VIDEO PROCESSING (40 journals)
    - INFORMATION SYSTEMS (107 journals)
    - INTERNET (93 journals)
    - SOCIAL WEB (51 journals)
    - SOFTWARE (33 journals)
    - THEORY OF COMPUTING (8 journals)

COMPUTER SCIENCE (1196 journals)                  1 2 3 4 5 6 | Last

Showing 1 - 200 of 872 Journals sorted alphabetically
3D Printing and Additive Manufacturing     Full-text available via subscription   (Followers: 20)
Abakós     Open Access   (Followers: 4)
ACM Computing Surveys     Hybrid Journal   (Followers: 27)
ACM Journal on Computing and Cultural Heritage     Hybrid Journal   (Followers: 8)
ACM Journal on Emerging Technologies in Computing Systems     Hybrid Journal   (Followers: 13)
ACM Transactions on Accessible Computing (TACCESS)     Hybrid Journal   (Followers: 3)
ACM Transactions on Algorithms (TALG)     Hybrid Journal   (Followers: 15)
ACM Transactions on Applied Perception (TAP)     Hybrid Journal   (Followers: 5)
ACM Transactions on Architecture and Code Optimization (TACO)     Hybrid Journal   (Followers: 9)
ACM Transactions on Autonomous and Adaptive Systems (TAAS)     Hybrid Journal   (Followers: 7)
ACM Transactions on Computation Theory (TOCT)     Hybrid Journal   (Followers: 12)
ACM Transactions on Computational Logic (TOCL)     Hybrid Journal   (Followers: 3)
ACM Transactions on Computer Systems (TOCS)     Hybrid Journal   (Followers: 18)
ACM Transactions on Computer-Human Interaction     Hybrid Journal   (Followers: 15)
ACM Transactions on Computing Education (TOCE)     Hybrid Journal   (Followers: 6)
ACM Transactions on Design Automation of Electronic Systems (TODAES)     Hybrid Journal   (Followers: 4)
ACM Transactions on Economics and Computation     Hybrid Journal  
ACM Transactions on Embedded Computing Systems (TECS)     Hybrid Journal   (Followers: 3)
ACM Transactions on Information Systems (TOIS)     Hybrid Journal   (Followers: 19)
ACM Transactions on Intelligent Systems and Technology (TIST)     Hybrid Journal   (Followers: 8)
ACM Transactions on Interactive Intelligent Systems (TiiS)     Hybrid Journal   (Followers: 3)
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)     Hybrid Journal   (Followers: 9)
ACM Transactions on Reconfigurable Technology and Systems (TRETS)     Hybrid Journal   (Followers: 6)
ACM Transactions on Sensor Networks (TOSN)     Hybrid Journal   (Followers: 8)
ACM Transactions on Speech and Language Processing (TSLP)     Hybrid Journal   (Followers: 9)
ACM Transactions on Storage     Hybrid Journal  
ACS Applied Materials & Interfaces     Hybrid Journal   (Followers: 29)
Acta Automatica Sinica     Full-text available via subscription   (Followers: 2)
Acta Informatica Malaysia     Open Access  
Acta Universitatis Cibiniensis. Technical Series     Open Access  
Ad Hoc Networks     Hybrid Journal   (Followers: 11)
Adaptive Behavior     Hybrid Journal   (Followers: 11)
Advanced Engineering Materials     Hybrid Journal   (Followers: 28)
Advanced Science Letters     Full-text available via subscription   (Followers: 10)
Advances in Adaptive Data Analysis     Hybrid Journal   (Followers: 7)
Advances in Artificial Intelligence     Open Access   (Followers: 15)
Advances in Calculus of Variations     Hybrid Journal   (Followers: 3)
Advances in Catalysis     Full-text available via subscription   (Followers: 5)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 19)
Advances in Computer Engineering     Open Access   (Followers: 4)
Advances in Computer Science : an International Journal     Open Access   (Followers: 14)
Advances in Computing     Open Access   (Followers: 2)
Advances in Data Analysis and Classification     Hybrid Journal   (Followers: 52)
Advances in Engineering Software     Hybrid Journal   (Followers: 27)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 13)
Advances in Human Factors/Ergonomics     Full-text available via subscription   (Followers: 22)
Advances in Human-Computer Interaction     Open Access   (Followers: 20)
Advances in Materials Science     Open Access   (Followers: 14)
Advances in Operations Research     Open Access   (Followers: 12)
Advances in Parallel Computing     Full-text available via subscription   (Followers: 7)
Advances in Porous Media     Full-text available via subscription   (Followers: 5)
Advances in Remote Sensing     Open Access   (Followers: 45)
Advances in Science and Research (ASR)     Open Access   (Followers: 6)
Advances in Technology Innovation     Open Access   (Followers: 5)
AEU - International Journal of Electronics and Communications     Hybrid Journal   (Followers: 8)
African Journal of Information and Communication     Open Access   (Followers: 9)
African Journal of Mathematics and Computer Science Research     Open Access   (Followers: 4)
AI EDAM     Hybrid Journal  
Air, Soil & Water Research     Open Access   (Followers: 11)
AIS Transactions on Human-Computer Interaction     Open Access   (Followers: 6)
Algebras and Representation Theory     Hybrid Journal   (Followers: 1)
Algorithms     Open Access   (Followers: 11)
American Journal of Computational and Applied Mathematics     Open Access   (Followers: 5)
American Journal of Computational Mathematics     Open Access   (Followers: 4)
American Journal of Information Systems     Open Access   (Followers: 5)
American Journal of Sensor Technology     Open Access   (Followers: 4)
Anais da Academia Brasileira de Ciências     Open Access   (Followers: 2)
Analog Integrated Circuits and Signal Processing     Hybrid Journal   (Followers: 7)
Analysis in Theory and Applications     Hybrid Journal   (Followers: 1)
Animation Practice, Process & Production     Hybrid Journal   (Followers: 5)
Annals of Combinatorics     Hybrid Journal   (Followers: 4)
Annals of Data Science     Hybrid Journal   (Followers: 12)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 12)
Annals of Pure and Applied Logic     Open Access   (Followers: 3)
Annals of Software Engineering     Hybrid Journal   (Followers: 13)
Annual Reviews in Control     Hybrid Journal   (Followers: 6)
Anuario Americanista Europeo     Open Access  
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 2)
Applied and Computational Harmonic Analysis     Full-text available via subscription   (Followers: 1)
Applied Artificial Intelligence: An International Journal     Hybrid Journal   (Followers: 12)
Applied Categorical Structures     Hybrid Journal   (Followers: 2)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 11)
Applied Computer Systems     Open Access   (Followers: 2)
Applied Informatics     Open Access  
Applied Mathematics and Computation     Hybrid Journal   (Followers: 34)
Applied Medical Informatics     Open Access   (Followers: 10)
Applied Numerical Mathematics     Hybrid Journal   (Followers: 5)
Applied Soft Computing     Hybrid Journal   (Followers: 16)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 5)
Applied System Innovation     Open Access  
Architectural Theory Review     Hybrid Journal   (Followers: 3)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 5)
Archive of Numerical Software     Open Access  
Archives and Museum Informatics     Hybrid Journal   (Followers: 144)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 5)
arq: Architectural Research Quarterly     Hybrid Journal   (Followers: 8)
Artifact     Hybrid Journal   (Followers: 2)
Artificial Life     Hybrid Journal   (Followers: 7)
Asia Pacific Journal on Computational Engineering     Open Access  
Asia-Pacific Journal of Information Technology and Multimedia     Open Access   (Followers: 1)
Asian Journal of Computer Science and Information Technology     Open Access  
Asian Journal of Control     Hybrid Journal  
Assembly Automation     Hybrid Journal   (Followers: 2)
at - Automatisierungstechnik     Hybrid Journal   (Followers: 1)
Australian Educational Computing     Open Access   (Followers: 1)
Automatic Control and Computer Sciences     Hybrid Journal   (Followers: 4)
Automatic Documentation and Mathematical Linguistics     Hybrid Journal   (Followers: 5)
Automatica     Hybrid Journal   (Followers: 11)
Automation in Construction     Hybrid Journal   (Followers: 6)
Autonomous Mental Development, IEEE Transactions on     Hybrid Journal   (Followers: 9)
Basin Research     Hybrid Journal   (Followers: 5)
Behaviour & Information Technology     Hybrid Journal   (Followers: 53)
Big Data and Cognitive Computing     Open Access   (Followers: 2)
Biodiversity Information Science and Standards     Open Access  
Bioinformatics     Hybrid Journal   (Followers: 301)
Biomedical Engineering     Hybrid Journal   (Followers: 15)
Biomedical Engineering and Computational Biology     Open Access   (Followers: 13)
Biomedical Engineering, IEEE Reviews in     Full-text available via subscription   (Followers: 21)
Biomedical Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 37)
Briefings in Bioinformatics     Hybrid Journal   (Followers: 48)
British Journal of Educational Technology     Hybrid Journal   (Followers: 139)
Broadcasting, IEEE Transactions on     Hybrid Journal   (Followers: 12)
c't Magazin fuer Computertechnik     Full-text available via subscription   (Followers: 1)
CALCOLO     Hybrid Journal  
Calphad     Hybrid Journal   (Followers: 2)
Canadian Journal of Electrical and Computer Engineering     Full-text available via subscription   (Followers: 15)
Capturing Intelligence     Full-text available via subscription  
Catalysis in Industry     Hybrid Journal   (Followers: 1)
CEAS Space Journal     Hybrid Journal   (Followers: 2)
Cell Communication and Signaling     Open Access   (Followers: 2)
Central European Journal of Computer Science     Hybrid Journal   (Followers: 5)
CERN IdeaSquare Journal of Experimental Innovation     Open Access   (Followers: 3)
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 3)
Chemometrics and Intelligent Laboratory Systems     Hybrid Journal   (Followers: 14)
ChemSusChem     Hybrid Journal   (Followers: 7)
China Communications     Full-text available via subscription   (Followers: 7)
Chinese Journal of Catalysis     Full-text available via subscription   (Followers: 2)
CIN Computers Informatics Nursing     Full-text available via subscription   (Followers: 11)
Circuits and Systems     Open Access   (Followers: 15)
Clean Air Journal     Full-text available via subscription   (Followers: 1)
CLEI Electronic Journal     Open Access  
Clin-Alert     Hybrid Journal   (Followers: 1)
Cluster Computing     Hybrid Journal   (Followers: 1)
Cognitive Computation     Hybrid Journal   (Followers: 4)
COMBINATORICA     Hybrid Journal  
Combinatorics, Probability and Computing     Hybrid Journal   (Followers: 4)
Combustion Theory and Modelling     Hybrid Journal   (Followers: 14)
Communication Methods and Measures     Hybrid Journal   (Followers: 12)
Communication Theory     Hybrid Journal   (Followers: 21)
Communications Engineer     Hybrid Journal   (Followers: 1)
Communications in Algebra     Hybrid Journal   (Followers: 3)
Communications in Computational Physics     Full-text available via subscription   (Followers: 2)
Communications in Information Science and Management Engineering     Open Access   (Followers: 4)
Communications in Partial Differential Equations     Hybrid Journal   (Followers: 3)
Communications of the ACM     Full-text available via subscription   (Followers: 51)
Communications of the Association for Information Systems     Open Access   (Followers: 16)
COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering     Hybrid Journal   (Followers: 3)
Complex & Intelligent Systems     Open Access   (Followers: 1)
Complex Adaptive Systems Modeling     Open Access  
Complex Analysis and Operator Theory     Hybrid Journal   (Followers: 2)
Complexity     Hybrid Journal   (Followers: 6)
Complexus     Full-text available via subscription  
Composite Materials Series     Full-text available via subscription   (Followers: 8)
Computación y Sistemas     Open Access  
Computation     Open Access   (Followers: 1)
Computational and Applied Mathematics     Hybrid Journal   (Followers: 2)
Computational and Mathematical Methods in Medicine     Open Access   (Followers: 2)
Computational and Mathematical Organization Theory     Hybrid Journal   (Followers: 2)
Computational and Structural Biotechnology Journal     Open Access   (Followers: 2)
Computational and Theoretical Chemistry     Hybrid Journal   (Followers: 9)
Computational Astrophysics and Cosmology     Open Access   (Followers: 1)
Computational Biology and Chemistry     Hybrid Journal   (Followers: 12)
Computational Chemistry     Open Access   (Followers: 2)
Computational Cognitive Science     Open Access   (Followers: 2)
Computational Complexity     Hybrid Journal   (Followers: 4)
Computational Condensed Matter     Open Access  
Computational Ecology and Software     Open Access   (Followers: 9)
Computational Economics     Hybrid Journal   (Followers: 9)
Computational Geosciences     Hybrid Journal   (Followers: 16)
Computational Linguistics     Open Access   (Followers: 23)
Computational Management Science     Hybrid Journal  
Computational Mathematics and Modeling     Hybrid Journal   (Followers: 8)
Computational Mechanics     Hybrid Journal   (Followers: 5)
Computational Methods and Function Theory     Hybrid Journal  
Computational Molecular Bioscience     Open Access   (Followers: 2)
Computational Optimization and Applications     Hybrid Journal   (Followers: 7)
Computational Particle Mechanics     Hybrid Journal   (Followers: 1)
Computational Research     Open Access   (Followers: 1)
Computational Science and Discovery     Full-text available via subscription   (Followers: 2)
Computational Science and Techniques     Open Access  
Computational Statistics     Hybrid Journal   (Followers: 14)
Computational Statistics & Data Analysis     Hybrid Journal   (Followers: 30)
Computer     Full-text available via subscription   (Followers: 97)
Computer Aided Surgery     Open Access   (Followers: 6)
Computer Applications in Engineering Education     Hybrid Journal   (Followers: 8)
Computer Communications     Hybrid Journal   (Followers: 16)
Computer Journal     Hybrid Journal   (Followers: 9)
Computer Methods in Applied Mechanics and Engineering     Hybrid Journal   (Followers: 23)
Computer Methods in Biomechanics and Biomedical Engineering     Hybrid Journal   (Followers: 12)
Computer Methods in the Geosciences     Full-text available via subscription   (Followers: 2)

        1 2 3 4 5 6 | Last

Journal Cover
Ad Hoc Networks
Journal Prestige (SJR): 0.53
Citation Impact (citeScore): 4
Number of Followers: 11  
 
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 1570-8705
Published by Elsevier Homepage  [3159 journals]
  • Data Transmission Plan Adaptation Complementing Strategic Time-Network
           Selection for Connected Vehicles
    • Abstract: Publication date: Available online 12 August 2018Source: Ad Hoc NetworksAuthor(s): Tobias Rueckelt, Ioannis Stavrakakis, Tobias Meuser, Imane Horiya Brahmi, Doreen Böhnstedt, Ralf SteinmetzAbstractConnected vehicles can nowadays be equipped with multiple network interfaces to access the Internet via a number of networks. To achieve an efficient transmission within this environment, a strategic time-network selection for connected vehicles has been developed, which plans ahead delay-tolerant transmissions. Under perfect prediction (knowledge) of the environment, the proposed strategic time-network selection approach is shown to outperform significantly leading state-of-the-art approaches which are based either on time selection or network selection only. Under realistic environments, however, the efficiency of planning-based approaches may be severely compromised since network presence and available capacities change rapidly and in an unforeseen manner (because of changing conditions due to the uncertainty in car movement, data transmission needs and network characteristics). To address this problem, a mechanism is proposed in this paper that determines the deviation from the anticipated conditions and modifies the transmission plan accordingly. Simulation results show that the proposed adaptation mechanisms help maintain the benefits of a strategic time-network selection planning under changing conditions.
       
  • Routing Protocols and Architecture for Disaster Area Network: A Survey
    • Abstract: Publication date: Available online 10 August 2018Source: Ad Hoc NetworksAuthor(s): Yasmin Jahir, Mohammed Atiquzzaman, Hazem Refai, Anirudh Paranjothi, Peter G. LoPrestiAbstractDisaster Area Network (DAN) is very crucial in case of natural or man-made disasters. During state of emergency, a rapidly deployable network is the highest priority to conduct search and rescue operations. This survey aims at investigating network architecture and routing models for disaster area networks. The main objective and goal of DAN is to ensure reliable, energy efficient communication which is susceptible to mobility and topology changes in the disaster area. The purpose is to improve delay, reduce overhead, minimize energy used, sustain movement and increase bandwidth for multimedia applications. Mobile Ad hoc network (MANET) addresses issues related to rapid and temporary setup and terminal probability and mobility in a disaster area until conventional infrastructure communication is established. We study the different routing protocols using MANETS or a combination of MANETS and other networks that are available in the literature to build up an efficient DAN.
       
  • Vehicular Software-Defined Networking and Fog Computing: Integration and
           Design Principles
    • Abstract: Publication date: Available online 9 August 2018Source: Ad Hoc NetworksAuthor(s): Jéferson Nobre, Allan M. de Souza, Denis Rosário, Cristiano Both, Leandro A. Villas, Eduardo Cerqueira, Torsten Braun, Mario GerlaAbstractVehicular Networks (VN) enable the collaboration among vehicles and infrastructure to deliver network services, where usually value-added services are provided by cloud computing. In this context, fog computing can be deployed closer to the users to meet their needs with minimum help from the Internet infrastructure. Software Defined Networking (SDN) might support the use of large-scale fog-enabled VN services. However, the current management of each wireless network that composes the VN has restricted the exploration of fog-enabled VN services. Therefore, the design principles for a VN architecture is still an open issue, mainly because it is necessary to address the diversity of VN fog applications. In this article, we investigate the design principles for fog-enabled Vehicular Software Defined Networking (VSDN) focusing on the perspectives of the systems, networking, and services. We evaluated these design principles in a use case of a traffic management system for a fast traffic accident rescue, using real traffic accident data. Finally, potential research challenges and opportunities for integrated use fog-enabled VSDN are discussed.
       
  • Context-Aware Energy-Efficient Applications for Cyber-Physical Systems
    • Abstract: Publication date: Available online 9 August 2018Source: Ad Hoc NetworksAuthor(s): Jose-Miguel Horcas, Mónica Pinto, Lidia FuentesAbstractSoftware systems have a strong impact on the energy consumption of the hardware they use. This is especially important for cyber-physical systems where power consumption strongly influences the battery life. For this reason, software developers should be more aware of the energy consumed by their systems. Moreover, software systems should be developed to adapt their behavior to minimize the energy consumed during their execution. This can be done by monitoring the usage context of the system and having runtime support to react to those changes that impact the energy footprint negatively. Although both the hardware and the software parts of cyber-physical systems can be adapted to reduce its energy consumption, this paper focuses on software adaptation. Concretely, the paper illustrates how to address the problem of developing context-aware energy-efficient applications using a Green Eco-Assistant that makes use of advanced software engineering methods, such as Dynamic Software Product Lines and Separation of Concerns. The main steps of our approach are illustrated by applying them to a cyber-physical system case study.
       
  • Power Allocation and Routing for Full-duplex Multi Hop Wireless Networks
           under Full Interference
    • Abstract: Publication date: Available online 7 August 2018Source: Ad Hoc NetworksAuthor(s): Kudret Akçapınar, Özgür Gürbüz, Tonguç ÜnlüyurtAbstractWhen traditional half-duplex (HD) radios are employed in indoor wireless mesh networks, such as home networks, interference among mesh nodes is a major impairment, as the end-to-end throughput is to be shared between all transmitting nodes. Full-duplex (FD) relaying can improve the end-to-end throughput, as simultaneous transmissions and receptions, hence simultaneous links are enabled, but FD nodes are subject to self-interference(SI) in addition to inter-node interference, resulting in a more complicated, full interference scenario. In this work, a power allocation solution is proposed along with routing for enabling FD in such multi hop wireless networks subject to full interference. First, an optimization problem is formulated for maximizing the end-to-end throughput of FD relaying on a given, known path, considering the full interference model. A linear programming based solution is devised to obtain the optimal transmit power levels for FD relaying nodes on the path. Then, for joint power allocation and routing in an FD mesh network, Dijkstra’s algorithm is modified by applying the proposed power allocation in the calculation of the path metrics. Via detailed numerical experiments considering different system parameters, such as network size, SI cancellation capability, maximum power level per node, it is shown that the proposed FD relaying with power control based on full interference model outperforms not only HD relaying, but also an existing FD relaying solution based on a single hop interference model. The amount of improvement by FD relaying depends on the system settings. For instance, for low power budget systems, HD throughput can be tripled, while for systems with high power budget, FD relaying achieves 80 percent higher throughput over HD relaying. When power control is combined with routing, the end-to-end throughput performance of the proposed FD routing solution again outperforms the existing solutions. Depending on the power budget, up to two times higher throughput is achieved over FD routing based on single hop interference, and HD routing can be improved by up to five times even for moderate SI cancellation levels. Our results suggest that employing proposed joint power allocation and routing scheme, migration to FD can be beneficial for home wireless mesh networks under full interference, especially for bandwidth-hungry applications, such as video streaming, gaming.
       
  • MARLIN-Q: Multi-Modal Communications for Reliable and Low-latency
           Underwater Data Delivery
    • Abstract: Publication date: Available online 7 August 2018Source: Ad Hoc NetworksAuthor(s): Stefano Basagni, Valerio Di Valerio, Petrika Gjanci, Chiara PetrioliAbstractThis paper explores the smart exploitation of multi-modal communication capabilities of underwater nodes to enable reliable and swift underwater networking. Following a model-based reinforcement learning approach, we define a framework allowing senders to select the best forwarding relay for its data jointly with the best communication device to reach that relay. The choice is also driven by the quality of the communication to neighboring nodes over time, thus allowing nodes to adapt to the highly adverse and swiftly varying conditions of the underwater channel. The resulting forwarding method allows applications to choose among different classes of soft Quality of Service (QoS), favoring, for instance, reliable routes to the destination, or seeking faster packet delivery. We name our forwarding method MARLIN-Q, for Multi-modAl Reinforcement Learning-based RoutINg with soft QoS. We evaluate the performance of MARLIN-Q in varying networking scenarios where nodes communicate through two acoustic modems with widely different characteristics. MARLIN-Q is compared to state-of-the-art forwarding protocols, including a channel-aware solution, and a machine learning-based solution. Our results show that a smartly learned selection of relay and modem is key to obtain a packet delivery ratio that is twice as much that of other protocols, while maintaining low latency and energy consumption.
       
  • Optimizing Floor Reservation and Contention Resolution in Wireless Random
           Access
    • Abstract: Publication date: Available online 3 August 2018Source: Ad Hoc NetworksAuthor(s): Mohammad Hossein Bateni, S. Jamaloddin Golestani, Ali Mohamad Doost HoseiniAbstractIn this paper, we propose a novel wireless random access scheme, combining the CSMA/CA mechanism with two control signals for initiating new transmissions and announcing receiver busy status, respectively. We also develop a time-space framework of performance analysis, enabling separate study of the temporal and spatial efficiency of the random access, i.e. the scheme’s ability for contention resolution and efficient performance in time, and its ability to provide for concurrent transmissions in space. Based on this framework and using both analysis and simulation, we show that the proposed scheme outperforms the IEEE 802.11 DCF, in terms of the overall afforded throughput, and also in terms of the temporal or spatial aspects of performance, when considered alone. The proposed scheme introduces a new approach to wireless random access problem, which can help fulfill the targeted requirements of future networks.
       
  • On the impact of the physical layer model on the performance of
           D2D-offloading in vehicular environments
    • Abstract: Publication date: Available online 31 July 2018Source: Ad Hoc NetworksAuthor(s): Loreto Pescosolido, Marco Conti, Andrea PassarellaAbstractOffloading data traffic from Infrastructure-to-Device (I2D) to Device-to-Device (D2D) communications is a powerful tool for reducing congestion, energy consumption, and spectrum usage of mobile cellular networks. Prior network-level studies on D2D data offloading focus on high level performance metrics as the offloading efficiency, and take into account the radio propagation aspects by using simplistic wireless channel models. In this work, we consider a D2D data offloading protocol tailored to highly dynamic scenarios as vehicular environments, and evaluate its performance focusing on physical layer aspects, like energy consumption and spectral efficiency. In doing this, we take into account more realistic models of the wireless channel, with respect to the simplistic ones generally used in the previous studies. Our objective is twofold: first, to quantify the performance gain of the considered D2D offloading protocol with respect to a classic cellular network, based on I2D communications, in terms of energy consumption and spectral efficiency. Second, to show that using simplistic channel models may prevent to accurately evaluate the performance gain. Additionally, the use of more elaborated models allows to obtain insightful information on relevant system-level parameters settings, which would not be possible to obtain by using simple models. The considered channel models range from widely used models based on deterministic path loss formulas, to more accurate ones, which include effects like multipath fading and the associated frequency selectivity of wideband channels. These models have been proposed and validated, in the recent years, through large-scale measurements campaigns.Our results show that the considered protocol is able to achieve a reduction in the energy consumption of up to 35%, and an increase in the system spectral efficiency of 50%, with respect to the benchmark cellular system. The use of different channel models in evaluating these metrics may result, in the worst case, in a sixfold underestimation of the achieved improvement.
       
  • Efficient and Privacy Preserving Supplier Matching for Electric Vehicle
           Charging
    • Abstract: Publication date: Available online 29 July 2018Source: Ad Hoc NetworksAuthor(s): Fatih Yucel, Kemal Akkaya, Eyuphan BulutAbstractElectric Vehicle (EV) charging takes longer time and happens more frequently compared to refueling of fossil-based vehicles. This requires in-advance scheduling on charging stations depending on the route of the demander EVs for efficient resource allocation. However, such scheduling and frequent charging may leak sensitive information about the users which may expose their driving patterns, whereabouts, schedules, etc. The situation is compounded with the proliferation of EV chargers such as V2V charging where any two EVs can charge each other through a charging cable. In such cases, the matching of these EVs is typically done in a centralized manner which exposes private information to third parties which do the matching. To address this issue, in this paper, we propose an efficient and privacy-preserving distributed matching of demander EVs with charge suppliers (i.e., public/private stations, V2V chargers) using bichromatic mutual nearest neighbor (BMNN) assignments. To this end, we use partially homomorphic encryption-based BMNN computation through local communication (e.g., DSRC or LTE-direct) between users while hiding their locations. The proposed matching algorithm provides not only a satisfactory assignment for all parties but also achieves an efficient matching in dynamic environments where new demanders and suppliers show up and some leave. The simulation results indicate that the proposed matching of suppliers and demanders can be achieved in a distributed fashion within reasonable computation and convergence times while preserving privacy of users. Moreover, due to the nature of its design, it provides a more efficient matching process for dynamic environments compared to standard stable matching algorithm, reducing the average waiting time for users until matching.
       
  • Lifetime-Aware Information Aggregation under Uncertainty for Advanced
           Driver Assistance Systems
    • Abstract: Publication date: Available online 29 July 2018Source: Ad Hoc NetworksAuthor(s): Tobias Meuser, Patrick Lieser, The An Binh Nguyen, Doreen Böhnstedt, Ralf SteinmetzAbstractAdvanced Driver Assistance Systems require a huge amount of sensor information. Information sensed by the vehicle’s on-board sensors is often not sufficient due to physical limitations, thus vehicles exchange information with each other to enhance their knowledge. However, both local and remote measurements are only a noisy view on the environment. If a vehicle receives faulty information about its environment, its decision-making may perform wrong actions. In this paper, we focus on the accuracy of information w. r. t. the correctness of the provided information. To increase the accuracy, we use a data representation that depicts every measurement as a probability vector.This representation contains all available information and tracks accuracy while aggregating and fusing information.To incorporate measurements sensed at different times and locations, we model the environmental changes. As information expires after a certain time, we combine a Markov model with an aging model to keep the aggregated information stable even after message expiration. We achieve this by reducing the impact of information with increasing age. Our extensive evaluation shows that our novel approach outperforms state-of-the-art approaches significantly.
       
  • ACPC: Efficient revocation of pseudonym certificates using activation
           codes
    • Abstract: Publication date: Available online 27 July 2018Source: Ad Hoc NetworksAuthor(s): Marcos Vinicius M. Silva, Marcos A. Simplicio, Jefferson E. Ricardini, Eduardo Lopes Cominetti, Harsh Kupwade PatilAbstractVehicular communication (V2X) technologies allow vehicles to exchange information about the road conditions and their own status, and thereby enhance transportation safety and efficiency. For broader deployment, however, such technologies are expected to address security and privacy concerns, preventing abuse by users and by the system’s entities. In particular, the system is expected to enable the revocation of malicious vehicles, e.g., in case they send invalid information to their peers or to the roadside infrastructure; it should also prevent the system from being misused for tracking honest vehicles. Both features are enabled by Vehicular Public Key Infrastructure (VPKI) solutions such as Security Credential Management Systems (SCMS), one of the leading candidates for protecting V2X communication in the United States. Unfortunately, though, SCMS’s original revocation mechanism can lead to large Certification Revocation Lists (CRLs), which in turn impacts the bandwidth usage and processing overhead of the system. In this article, we propose a novel design called Activation Codes for Pseudonym Certificates (ACPC), which can be integrated into SCMS to address this issue. Our proposal is based on activation codes, short bit-strings without which certificates previously issued to a vehicle cannot be used by the latter, which are periodically distributed to non-revoked vehicles using an efficient broadcast mechanism. As a result, the identifiers of the corresponding certificates do no need to remain on the CRL for a long time, reducing the CRLs’ size and streamlining their distribution and verification of any vehicle’s revocation status. Besides describing ACPC in detail, we also compare it to similar-purpose solutions such as Issue First Activate Later (IFAL) and Binary Hash Tree based Certificate Access Management (BCAM). This analysis shows that our proposal not only improves privacy (e.g., in terms of resilience against colluding system authorities), but also leads to processing and bandwidth overheads that are orders of magnitude smaller than those observed in the state of the art.
       
  • Toward Trust Based Protocols in a Pervasive and Mobile Computing: A Survey
    • Abstract: Publication date: Available online 27 July 2018Source: Ad Hoc NetworksAuthor(s): Aminu Bello Usman, Jairo GutierrezAbstractIn the blooming era of Pervasive and Mobile Computing, trust has been accepted as a vital factor for provisioning secure, reliable and seamless communications between pervasive computing elements. However, advancing research in the area of trust-based protocol for distributed Pervasive and Mobile Computing might be challenging due to the ambiguity of the concept of trust as well as the variety of divergent trust models, protocols and algorithms in different contexts. In this research, we augment the trust concept and definition from various field of studies and proposed models in the literature and provide general conceptual phases and methods of trust management toward-trust-based protocols, in the context of Pervasive and Mobile Computing. The paper addresses a broad range of techniques, methods, models, applications and desired futures of trust-based protocols. A number of the currently used trust-based protocols are critically reviewed, and this further leads our discussion to the security attacks and mitigation strategies used with trust-based protocols for pervasive and mobile computing. Finally, the paper discusses open research issues.
       
  • FALCON: A New Approach for the Evaluation of Opportunistic Networks
    • Abstract: Publication date: Available online 27 July 2018Source: Ad Hoc NetworksAuthor(s): Enrique Hernández-Orallo, Juan Carlos Cano, Carlos T. Calafate, Pietro ManzoniAbstractEvaluating the performance of opportunistic networks with a high number of nodes is a challenging problem. Analytical models cannot provide a realistic evaluation of these networks, and simulations can be very time-consuming, sometimes requiring even weeks only to provide the results of a single scenario.In this paper, we present a fast evaluation model called FALCON (Fast Analysis, using a Lattice Cell model, of Opportunistic Networks) that is computationally very efficient and precise. The model is based on discretising space and time in order to reduce the computation complexity, and we formalised it as a discrete dynamic system that can be quickly solved.We describe some validation experiments showing that the precision of the obtained results is equivalent to the ones obtained with standard simulation approaches. The experiments also show that computation time is reduced by two orders of magnitude (from hours to seconds), allowing for a faster evaluation of opportunistic networks. Finally, we show that the FALCON model is easy to adapt and expand to consider different scenarios and protocols.
       
  • A Collaborative Task-oriented Scheduling Driven Routing Approach for
           Industrial IoT based on Mobile Devices
    • Abstract: Publication date: Available online 27 July 2018Source: Ad Hoc NetworksAuthor(s): Ying Duan, Yun Luo, Wenfeng Li, Pasquale Pace, Gianluca Aloi, Giancarlo FortinoAbstractWireless sensor networks have been widely used in industrial IoT contexts due to their useful support during the production monitoring and risk pre-warning. However, complicated and extremely variable industrial environments call for higher communication stability and reliability to guarantee timely transmission of monitored data. Considering mobile intelligences such as Automated Guided Vehicles (AGVs), within industrial scenarios, we propose a solution based on hybrid (fixed and mobile) industrial wireless sensor networks featured with a task-oriented model. The proposal includes a heuristic modeling method adopted to assign tasks from definite orders which will be sent to the controller, and a collaborative routing algorithm exploiting the AGVs mobility on specific trajectories. Experiments have shown that, using mobility features of the AGVs, the integrated solution can promptly repair the network when a node and the relative link fail or the detected quality is low, significantly reducing the energy consumption of wireless nodes and data communication delay, thus improving the overall throughput and reliability of industrial IoT systems.
       
  • Security Analysis for Interference Management in Heterogeneous Networks
    • Abstract: Publication date: Available online 27 July 2018Source: Ad Hoc NetworksAuthor(s): Dongfeng Fang, Yi Qian, Rose Qingyang HuAbstractHeterogeneous network (HetNet) is recognized as a promising technique to provide blanket wireless coverage and high throughput in 5G wireless networks. With the heterogeneous characteristics, HetNet achieves higher capacity, wider coverage and better performance in energy efficiency and spectrum efficiency. However, HetNet also brings complex interference management in the network. In this paper, we present a security analysis for a proposed interference management mechanism in a two-tier heterogeneous network (HetNet) system. The proposed interference management mechanism aims to maximize the secrecy rate of a cellular user under eavesdropping attack. The HetNet system model includes a macro base station, several small base stations, several users, and one eavesdropper. To further improve the performance of the network, massive multiple-input multiple-output technology is applied to base stations. A single antenna is applied to users and the eavesdropper. Device-to-device (D2D) communications are considered in the HetNet system model for introducing interference in the macro cell to the eavesdropper. The proposed interference management mechanism takes consideration of three factors as transmit beamforming, spectrum reuse and D2D communications. Not only the secrecy rate of the user under eavesdropping attack but also the communication quality of services of SBSs users are considered in the security analysis. An optimization problem is formulated for the secrecy rate maximization of the user under eavesdropping attack with the constraints of quality of services of users associated with base stations and power limitation of base stations. The security analysis and numerical results show that our proposed interference management mechanism for physical layer security can utilize the interference in the network to improve the secrecy rate of the cellular user under eavesdropping attack.
       
  • Internet of Underground Things in Precision Agriculture: Architecture and
           Technology Aspects
    • Abstract: Publication date: Available online 27 July 2018Source: Ad Hoc NetworksAuthor(s): Mehmet C. Vuran, Abdul Salam, Rigoberto Wong, Suat IrmakAbstractThe projected increases in World population and need for food have recently motivated adoption of information technology solutions in crop fields within precision agriculture approaches. Internet Of Underground Things (IOUT), which consists of sensors and communication devices, partly or completely buried underground for real-time soil sensing and monitoring, emerge from this need. This new paradigm facilitates seamless integration of underground sensors, machinery, and irrigation systems with the complex social network of growers, agronomists, crop consultants, and advisors. In this paper, state-of-the-art communication architectures are reviewed, and underlying sensing technology and communication mechanisms for IOUT are presented. Moreover, recent advances in the theory and applications of wireless underground communication are also reported. Finally, major challenges in IOUT design and implementation are identified.
       
  • Performance Evaluation and Comparative Study of Main VDTN Routing
           Protocols under Small- and Large-Scale Scenarios
    • Abstract: Publication date: Available online 27 July 2018Source: Ad Hoc NetworksAuthor(s): Arslane HAMZA-CHERIF, Khaled BOUSSETTA, Gladys DIAZ, Fedoua LAHFAThis paper presents a performance evaluation through simulations and a comparative study of main routing protocols dedicated to Vehicular Delay-Tolerant Networks. The assessment is conducted under small- and large-scale scenarios with realistic vehicle mobility patterns as defined in the TAPAS Cologne simulation scenario. Through the literature, several evaluations have been conducted on routing for Vehicular Networks, but with an abstraction or a simplification regarding the delay tolerant aspect. Furthermore, considered scenarios were relatively small and too idealistic compared to the real-world environment and its multiples challenges. Moreover, to the best of our knowledge, this is the first extensive study that compares, in the same realistic simulation environment, the main flag-carriers of various categories of VDTN routing protocols, namely Epidemic, Direct Delivery, Prophet and GeoSpray protocols. Simulation results reveal better performance for the geographical approach advocated by GeoSpray compared to the predictive one of Prophet, under all considered scenarios. Moreover, they highlight the possibility for a minimalist and naive protocol such as Direct Delivery to perform well, under specific network conditions, as when considering an anycast communication scheme. Finally, deeper analysis was undertaken on both GeoSpray and Prophet. The studies reveal the potentialities to increase the performances of GeoSpray to some extent and highlight the difficulties of adapting Prophet settings for optimal performance in realistic scenarios.
       
  • Bandwidth Efficient Designated Verifier Proxy Signature Scheme for
           Healthcare Wireless Sensor Networks
    • Abstract: Publication date: Available online 26 July 2018Source: Ad Hoc NetworksAuthor(s): Girraj Kumar Verma, B.B. Singh, Harendra SinghAbstractRecently, big data collection of e-healthcare monitoring using wireless sensor networks (WSN) have become common in practice. These WSN collect the data such as blood pressure, pH-value, pulse rate, etc. from a remote location based patient and then send to hospital/medical server. Since, the e-healthcare data is associated to a patient and thus, the confidentiality and authentication of data are critical issues. This article introduces a provably secure message recovery designated verifier proxy signature (MRDVPS) scheme to eliminate the issues. The proposed MRDVPS scheme is proven existential unforgeable (EUF) in the random oracle model (ROM), under the intractability of computational Diffie-Hellman (CDH) problem. Efficiency comparison shows that the scheme is the most appealing towards healthcare wireless sensor networks (HWSN).
       
  • Joint Uplink/Downlink Fair Power Allocation for Wireless Backhaul of
           Vehicular Small Cells
    • Abstract: Publication date: Available online 25 July 2018Source: Ad Hoc NetworksAuthor(s): Sajjad Alizadeh, Reza SaadatAbstractThis paper proposes a two-part joint uplink/downlink power allocation for the backhaul of the vehicular small cell, one part for the uplink and another part for the downlink. In the first part of the proposed algorithm, after macro base station assignment for each small base station, we allocate the transmission power using the pilot assisted approach in the uplink direction. Simultaneously, using a normalizing factor obtained from the first part of the algorithm, which is representing the SINR balancing level of the small cell layer in the uplink direction, the second part is implemented using the Foschini concept to achieve the SINR balancing in the downlink direction just equal to that in the uplink direction. Therefore, the same levels for the SINR balancing are fairly obtained jointly for the macrocell and small cell layers in the downlink and uplink directions, respectively. Then, we provide some analysis on the convergence of the proposed algorithm in both parts of the uplink and downlink. In contrast to previous works, it is not required to be solved a non-convex optimization problem for the implementation of our proposed algorithm. Simulation results illustrate that the proposed scheme converges to the SINR balancing level after a few iterations in both uplink and downlink directions of the backhaul link.
       
  • Fast Multi-hop Broadcast of Alert Messages in VANETs: An Analytical Model
    • Abstract: Publication date: Available online 24 July 2018Source: Ad Hoc NetworksAuthor(s): Armir Bujari, Mauro Conti, Carla De Francesco, Claudio E. PalazziAbstractRecent market trends in self-driving technology have revived the attention on vehicular networks, posing a demand for intelligent solutions supporting the proliferation of many useful applications. Inter-vehicular communication presents an opportunity, capable of providing the basis for localized, timely, collective intelligence. In this context, critical safety applications are particularly challenging, urging for quick multi-hop message propagation schemes within an area of interest. The anycast communication model embodied by safety applications and the shared broadcast medium demand for intelligent message propagation schemes minimizing latency. To this end, the state of the art approach is based on having different contention windows among vehicles so as to probabilistically select specific ones as forwarders in order to reduce the number of hops and transmissions needed to propagate the message. However, this solution has been mainly studied empirically. In this article, we present and discuss an analytical model, shedding light on the expected behavior and performance of such approach, along with a validation analysis conducted through the well known simulator NS-2.
       
  • Joint Spatial Multiplexing and Transmit Diversity in MIMO Ad Hoc Networks
    • Abstract: Publication date: Available online 23 July 2018Source: Ad Hoc NetworksAuthor(s): Marcelo M. Carvalho, Fadhil Firyaguna, Ana C.O. Christófaro, Éverton A.L. Andrade, Tiago S. BonfimThis paper investigates the performance of MIMO ad hoc networks that employ transmit diversity, as delivered by the Alamouti scheme, and/or spatial multiplexing, according to the Vertical Bell Labs Layered Space-Time system (V-BLAST). Both techniques are implemented in the ns-3 network simulator by focusing on their overall effect on the resulting signal-to-interference-plus-noise ratio (SINR) at the intended receiver. Unlike previous works that have studied fully-connected scenarios or have assumed simple abstractions to represent MIMO behavior, this paper evaluates MIMO ad hoc networks that are not fully connected by taking into account the impact of multiple antennas on the carrier sense activity in CSMA-like medium access control (MAC) protocols. In addition to presenting a performance evaluation of ad hoc networks operating according to each individual MIMO scheme, this paper proposes simple modifications to the IEEE 802.11 DCF MAC to allow the joint operation of both MIMO techniques. Hence, each pair of nodes is allowed to select the best MIMO configuration for the impending data transfer. The joint operation is based on three operation modes that are selected based on the estimated SINR at the intended receiver and its comparision with a set of threshold values. The performance of ad hoc networks operating with the joint MIMO scheme is compared with the performance when using each individual MIMO scheme and the standard single-input single output (SISO) IEEE 802.11. Performance results are presented based on MAC-level throughput per node, delay, and throughput fairness under saturated traffic conditions.
       
  • Discovering Communities of Malapps on Android-based Mobile Cyber-Physical
           Systems
    • Abstract: Publication date: Available online 20 July 2018Source: Ad Hoc NetworksAuthor(s): Dan Su, Jiqiang Liu, Wei Wang, Xiaoyang Wang, Xiaojiang Du, Mohsen GuizaniAbstractAndroid-based devices like smartphones have become ideal mobile cyber-physical systems (MCPS) due to their powerful processors and variety of sensors. In recent years, an explosively and continuously growing number of malicious applications (malapps) have posed a great threat to Android-based MCPS as well as users’ privacy. The effective detection of malapps is an emerging yet crucial task. How to establish relationships among malapps, discover their potential communities, and explore their evolution process has become a challenging issue in effective detection of malapps. To deal with this issue, in this work, we are motivated to propose an automated community detection method for Android malapps by building a relation graph based on their static features. First, we construct a large feature set to profile the behaviors of malapps. Second, we propose an E-N algorithm for graph construction by combining epsilon graph and k-nearest neighbor (k-NN) graph. It solves the problem of an incomplete graph led by epsilon method and the problem of noise generated by k-NN graph. Finally, a community detection method, Infomap, is employed to explore the underlying structures of the relation graph, and obtain the communities of malapps. We evaluate our community detection method with 3996 malapp samples. Extensive experimental results show that our method outperforms the traditional clustering methods and achieves the best performance with rand statistic of 94.93% and accuracy of 79.53%.
       
  • Secure Beamforming for Cognitive Cyber-Physical Systems based on Cognitive
           Radio with Wireless Energy Harvesting
    • Abstract: Publication date: Available online 19 July 2018Source: Ad Hoc NetworksAuthor(s): Kun Tang, Ronghua Shi, Heyuan Shi, Md Zakirul Alam Bhuiyan, Entao LuoAbstractCognitive cyber-physical systems (CPS) have been extensively applied in many fields from intellectual traffic control system to autonomous robot for face-detection and face-recognition. In wireless-powered cognitive radio networks (WP-CRN), it is necessary to provide secure and effective real-time feedback for CPS users. In this paper, we consider secure transmission issues in WP-CRN for CPS users, where a primary system works in conjunction with a wireless-powered secondary system in the presence of multiple potential eavesdroppers. Furthermore, a novel spectrum sharing scheme is proposed, which multiplexes the secondary transmissions during both the primary and cognitive transmissions. We aim to maximize the secondary data rate while guaranteeing the secure rate requirement of the primary system by jointly optimizing the energy harvesting duration and the beamforming vectors of the primary and secondary systems. In order to solve the non-convex optimization problem, the semi-definite relaxation (SDR) with Charnes-Cooper transformation is adopted to transfer the non-convex problem into convex optimization problem, which can be easily solved by CVX tools. Moreover, we can prove that the SDR is tight since there always exists a rank-one optimal solution. Simulation results illustrate that the proposed scheme can significantly improve the secondary transmission rate while can achieve higher security rates of the primary system compared with zero-forcing (ZF) beamforming scheme.
       
  • On Outage Minimization in Relay Assisted Cognitive Radio Networks with
           Energy Harvesting
    • Abstract: Publication date: Available online 19 July 2018Source: Ad Hoc NetworksAuthor(s): Avik Banerjee, Santi P. MaityAbstractThis paper considers a fully energy harvested two hop relay assisted cognitive radio (CR) system operated in an underlay mode. The frame structure of the CR network consists of three non-overlapping time slots. The first time slot is meant for energy harvesting (EH) at the relay node (from both the primary interference signal and the secondary transmitter signal), while during the second slot, the secondary user transmits its data to the relay (information transmission). During the third time slot, forwarding of data by the relay and EH at secondary transmitter (from the primary interference signal) are done simultaneously. An optimization problem is formulated that minimizes the outage probability under the constraints of maintaining the energy causality and interference threshold to the primary receiver due to both the secondary transmitter and the relay node. Closed form expressions for the optimal transmit power of the source and the relay node as well as the time slot for EH are derived. The convexity of the constrained objective function is proved mathematically and the analytical solutions are verified through a large set of simulation results. Simulation results also show that a gain  ∼  11.71% and  ∼  12.7% in outage probability minimization is achieved for the proposed scheme over the existing works.
       
  • Energy Efficient Tracking in Uncertain Sensor Networks
    • Abstract: Publication date: Available online 18 July 2018Source: Ad Hoc NetworksAuthor(s): Qianqian Ren, Jinbao Li, Hongyang LiuAbstractUncertainty existed in sensor networks presents new challenges for target tracking. Besides energy conservation of the network, target tracking has to deal with different kinds of uncertainty, such as the impreciseness of positioning systems, environment noise and limited sensitivity of sensors. In this paper, we solve the problem of energy efficient tracking in uncertain sensor networks. We first investigate the uncertainty existed in sensor networks and propose a series of uncertain models. Then, we construct a grid based network model and incorporate it into tracking procedure, which makes nodes near the vertexes of involved grid units work and others sleep to save energy with tracking quality guarantee. To optimize the tracking algorithm with uncertainty consideration, we further introduce the problem of probabilistic k-nearest neighbors (PkNN) and provide an efficient tracking algorithm based on PkNN retrieval. Finally, a comprehensive set of simulations is presented. From the experimental results, we conclude that the proposed target tracking algorithm can yield excellent performance in terms of tracking accuracy and energy saving in wireless sensor networks.
       
  • DDA: A Deep Neural Network-based Cognitive System for IoT-aided Dermatosis
           Discrimination
    • Abstract: Publication date: Available online 18 July 2018Source: Ad Hoc NetworksAuthor(s): Kehua Guo, Ting Li, Runhe Huang, Jian Kang, Tao ChiAbstractThe rapid development of the Internet of Things (IoT) and cognitive cyber-physical systems (CPS) has made people's daily lives more intelligent. Additionally, emerging technologies, such as wearable devices and machine learning, have demonstrated the potential for acquiring and processing large amounts of data from the physical world. In the medical field, effectively utilizing the collected medical data and providing more intelligent systems for doctors and patients to assist in diagnoses have also become important research topics. This paper presents a deep neural network-based cognitive system named DDA (dermatosis discrimination assistant) for classifying the dermatosis images generated by confocal laser scanning microscopes. Considering the lack of labels, we increase the labeled data automatically using an incremental model based on a small amount of labeled data and propose a disease discrimination model to distinguish and diagnose the categories of the disease images. In this system, the diagnoses of seborrheic keratosis (SK) and flat wart (FW) are used as examples, and experiments are conducted using the proposed models. Experimental results show that this system performs almost as well as individual dermatologists and can identify and diagnose other common dermatoses.
       
  • Optimization of Decode-and-Forward Multihop Full Duplex Relay Networks
           under Residual-Self-Interference
    • Abstract: Publication date: Available online 18 July 2018Source: Ad Hoc NetworksAuthor(s): Rambabu Katla, A.V. BabuAbstractThis paper investigates various optimization schemes for improving the performance of multi-hop full duplex (FD) decode and forward (DF) based relay networks with recursive backward interference cancellation (RBIC). We provide analytical expression for the outage probability of multi-hop FDR network by taking into account the residual self interference (RSI) at the full duplex relay (FDR) nodes, in independent non-identical Rayleigh fading channels. We then investigate optimal power allocation (OPA), optimal relay location (ORL) and the joint optimization of transmit power and relay location that minimizes the outage probability. We prove the convexity of all the above problems and determine the OPA vector by using the geometric programming while the ORL vector is obtained by applying Karush-Kuhn-Tucker (KKT) conditions. To solve the joint optimization problem, we devise an iterative, fast converging algorithm based on sequential geometric programming. Extensive numerical and simulation results demonstrate that both OPA and ORL can improve the outage probability of FDR system; however joint optimization leads to superior performance as compared to OPA, ORL and un-optimized cases. Secondly we consider the end-to-end rate maximization problem with maximum power constraint at the nodes. Since the optimization problem is nonconvex, we devise an iterative algorithm based on sequential convex programming to find the OPA vector. Results establish that OPA can lead to very large increase in the end-to-end rate as compared to uniform power allocation.
       
  • Information Sharing and Bullwhip Effect in Smart Destination Network
           System
    • Abstract: Publication date: Available online 17 July 2018Source: Ad Hoc NetworksAuthor(s): Qijie Jiang, Ge KeAbstractInformation communication technologies (ICTs) have been extensively applied in smart destinations in recent years so as to improve the information transfer and information sharing amongst individual actors involving in the destination network ecosystem. This paper attempts to explore the influence of information sharing on the bullwhip effect throughout the tourism supply chain (SC) network, which has been considered as a major problem faces the destination management and all individual actors. Specifically, two mathematic models have been built to analyse the following different situations respectively; first, ICTs have not been well applied in destinations and there is no information sharing amongst individual actors, second, ICTs have been well applied in destinations and there exists information sharing amongst individual actors. Further, this paper makes a comparison of the bullwhip effects under these two situations. What's more, the data collected from JIUZHAI valley has been used to verify the correction of the mathematic analysis. Overall, this paper proves that the application of ICTs will contribute to the reduction of bullwhip effect throughout the tourism SC network by promoting the information sharing amongst individual actors, and some parameters (e.g., autocorrelation coefficient, the number of demand forecasting, and the lead time) will play a crucial role on the acting process. The results have both theoretical significance to the development of tourism SC management theory and managerial implication to tourism practices of individual actors and management departments.
       
  • GLaM:+A+Cooperative+Distributed+QoE-based+Approach+for+SVC+Video+Streaming+over+Wireless+Mesh+Networks&rft.title=Ad+Hoc+Networks&rft.issn=1570-8705&rft.date=&rft.volume=">AD3-GLaM: A Cooperative Distributed QoE-based Approach for SVC Video
           Streaming over Wireless Mesh Networks
    • Abstract: Publication date: Available online 10 July 2018Source: Ad Hoc NetworksAuthor(s): Pham Tran Anh Quang, Kamal Deep Singh, Juan Antonio Rodríguez-Aguilar, Gauthier Picard, Kandaraj Piamrat, Jesús Cerquides, César VihoAbstractWe study the routing problem of scalable video coding video streaming over wireless mesh networks. In contrast to most of the conventional routing algorithms, our proposal focuses on optimizing users’ satisfaction. The mean opinion score –an indicator of quality of experience (QoE) in video streaming– is utilized to assess the quality of routes in wireless mesh networks. The objective is to optimize the overall user experience in the network. Conventional routing approaches do not consider QoE and are not optimal with respect to user experience. Moreover, some centralised approaches are not scalable and require significant computational resources. The latter disadvantage can be overcome using distributed approaches. This paper presents a QoE-based cooperative distributed routing approach. Among distributed cooperative optimization schemes, AD3 is highlighted as one of the most efficient because of its fast convergence. The contributions of this paper are as follows: we encode the original problem into a factor graph and optimize the number of exchanged messages; we propose a partially distributed routing scheme based on OLSR and AD3; and we propose a distributed decoding algorithm in order to find a feasible solution. Our thorough simulation results confirm the advantages of the proposed scheme.
       
  • Energy-Aware Backbone Formation in Military Multilayer Ad Hoc Networks
    • Abstract: Publication date: Available online 9 July 2018Source: Ad Hoc NetworksAuthor(s): D. Papakostas, S. Eshghi, D. Katsaros, L. TassiulasAbstractAd hoc networks designed for deployment in modern battlefields need to take care of traditional requirements related to their backbone’s size, their energy efficiency, their scalability in terms of network size, but also of their nature which allows for combining networks of different units that act altogether towards a common operational goal. This article develops a distributed algorithm for developing an energy-aware backbone for military ad hoc network composed of multiple layers, namely E2CLB. The algorithm is based on the concepts of connected dominating sets and also on node centrality concepts, and results as a heuristic solution to the problem of calculating a maximum energy, minimum connected dominating set for a multilayer network by including into the dominating set those nodes which are highly connected to their and other layers (i.e., they have large centrality value) and moreover they are energy-rich. The computation and communication complexities of the algorithm are analyzed, and a thorough simulation-based evaluation of it against six competitors is presented. The results show that E2CLB is either the best performing algorithm across the examined performance measures or it is able to trade a very small increase in the size of the backbone’s network in order to reap improved performance in the energy realm.
       
  • Structure Health Monitoring Using Wireless Sensor Networks on Structural
           Elements
    • Abstract: Publication date: Available online 8 July 2018Source: Ad Hoc NetworksAuthor(s): Cem Ayyildiz, H. Emre Erdem, Tamer Dirikgil, Oguz Dugenci, Taskin Kocak, Fatih Altun, V. Cagri GungorAbstractThis paper presents a system that monitors the health of structural elements in Reinforced Concrete (RC), concrete elements and/or masonry buildings and warn the authorities in case of physical damage formation. Such rapid and reliable detection of impairments enables the development of better risk management strategies to prevent casualties in case of earthquake and floods. Piezoelectric (PZT) sensors with lead zirconate titanate material are the preferred sensor type for fracture detection. The developed sensor mote hardware triggers the PZT sensors and collects the responses they gather from the structural elements. It also sends the collected data to a data center for further processing and analysis in an energy-efficient manner utilizing low-power wireless communication technologies. The access and the analysis of the collected data can be remotely performed via a web interface. Performance results show that the fractures serious enough to cause structural problems can be successfully detected with the developed system.
       
  • QoS Guaranteed Surveillance Algorithms for Directional Wireless Sensor
           Networks
    • Abstract: Publication date: Available online 6 July 2018Source: Ad Hoc NetworksAuthor(s): Chih-Yung Chang, Chih-Yao Hsiao, Chao-Tsun ChangAbstractA directional wireless sensor network (DWSN) consists of a number of directional sensors. Many types of directional sensors have been widely used in constructing a wireless sensor network for IoT applications. These types of sensors include infrared sensors, microwave sensors, ultrasonic sensors, cameras, and radar. Compared with an omni-directional sensor, a directional sensor can achieve better performance because it can additionally report the direction of an intruder. Unfortunately, most existing barrier-coverage mechanisms adopt omni-directional sensor networks. They cannot be efficiently applied to DWSNs because the sensing area of each directional sensor is fan-shaped. This paper investigates the surveillance service problem which supports the surveillance quality of k-barrier coverage in DWSNs. Three algorithms, called BA, BTA and BRA, are proposed which aim at finding a maximal number of different defense barriers, each of which supports k-coverage. Using these algorithms, at least k directional sensors can detect intruders intending to cross the monitoring area. Performance analyses of the proposed algorithms are conducted in Section 5 to verify the performance improvement from a theoretical point of view. In the performance study, the proposed algorithms are compared with other existing algorithms. The experimental study shows that the proposed k-barrier coverage algorithm achieves similar performance with the optimal solution but has fewer control packets. Furthermore, the proposed BRA achieves better performance in terms of the numbers of control packets and constructed defense barriers, as compared with existing algorithms.
       
  • Internet Congestion Control Using the Power Metric:Keep the Pipe Just
           Full, But No Fuller
    • Abstract: Publication date: Available online 5 July 2018Source: Ad Hoc NetworksAuthor(s): Leonard KleinrockAbstractRecently there has been considerable interest in a key paper [1] describing a new approach to congestion control in Internet traffic which has resulted in significant network performance improvement. The approach is based on a 1978 paper [2] and a companion 1979 paper [3] which identified a system operating point that was optimal in that it maximized delivered throughput while minimizing delay and loss. This operating point is simply characterized by the insight that one should ”Keep the pipe just full, but no fuller” and we show this is equivalent to loading the system so that in many cases (including those relevant to TCP connections) the optimized average number in the pipe is exactly equal to the Bandwidth-Delay Product. It is important to understand the reasoning and intuition behind this early insight and why it provides such improved behavior of systems and networks. In this paper, we first develop this insight using purely deterministic reasoning. We then extend this reasoning by examining far more complex stochastic queueing systems and networks using a function called Power to mathematically and graphically extract exact and surprising results that support the insight and allow us to identify the optimum operating point for a broad class of systems. These observations allow us to study the impact of Power on networks leading eventually to supporting the statements about steady state congestion and flow control as presented in [1] for today’s Internet. We point out that the discussions about the latest congestion control algorithms [1, 4, 5, 6, 7, 8, 9, 10, 11] address the dynamics of tracking flow, dealing with multiple intersecting flows, fairness, and more, and which focus on the dynamic behavior of data networks whereas our work here focuses only on the steady state behavior.
       
  • Connectivity and Coverage based Protocols for Wireless Sensor Networks
    • Abstract: Publication date: Available online 5 July 2018Source: Ad Hoc NetworksAuthor(s): Azzedine Boukerche, Peng SunAbstractA wireless sensor network (WSN) consists of a group of energy-constrained sensor nodes with the ability of both sensing and communication, which can be deployed in a field of interest (FoI) for detecting or monitoring some special events, and then forwarding the aggregated data to the designated data center through sink nodes or gateways. In this case, whether the WSN can keep the FoI under strict surveillance and whether the WSN can gather and forward the desired information are two of the most fundamental problems in wireless sensor networks that need to be solved. Therefore, preserving network connectivity while maximizing coverage by using the limited number of energy constrained nodes is the most critical problem for the deployment of WSNs. In this survey article, we classify and summarize the state-of-the-art algorithms and techniques that address the connectivity-coverage issues in the wireless sensor networks.
       
  • MUPF: Multiple Unicast Path Forwarding in Content-Centric VANETs
    • Abstract: Publication date: Available online 4 July 2018Source: Ad Hoc NetworksAuthor(s): Lanlan Rui, Hui Guo, Haoqiu Huang, RuiChang Shi, Xuesong QiuAbstractVehicular ad-hoc networks (VANETs) with traditional TCP/ IP architecture cannot manage mobile nodes effectively. Inspired by information-centric networking (ICN), content-centric VANETs have emerged as a promising architecture to address the challenges of traditional IP-based communications in VANETs. However, several issues need to be solved with regard to this architecture. Among them, inflexible routing schemata based on IP addresses, inefficient traffic caused by network broadcast, and volatility in the network environment cause low network performance in VANETs. By focusing on the content routing of the VANETs, we propose a multiple unicast path-forwarding scheme, MUPF, in which we aim to build multiple stable unicast forwarding paths in content-centric VANETs. The main design concepts of MUPF are as follows: 1) By introducing the idea of ICN, we avoid using the fixed-communication “host-to-host” method employed in IP; MUPF applies a content-centric routing process to request for and reply to packets. 2) We have evaluated the often-occurring broadcast in VANETs, which is thought to have a bad impact on network performance; hence, MUPF uses multiple unicast forwarding paths to deliver the packets instead of a simple broadcast. 3) Considering the highly volatile feature of VANETs, wherein the links are easily broken when the nodes leave, combined with the nodes’ motion parameters and link quality metrics, MUPF can choose some more reliable nodes as next hops to improve the time tolerance of each routing path. In terms of average response time, the performance improvement achieved by MUPF is ∼10%, 15%-20%, and 60% compared to CCVN, V-NDN, and TCP/IP, respectively. In terms of the cache-hit ratio, MUPF achieves an improvement of ∼8% and 13.8% over CCVN and V-NDN, respectively; it also decreases network traffic significantly.
       
  • pCoCoA: A precise congestion control algorithm for CoAP
    • Abstract: Publication date: Available online 4 July 2018Source: Ad Hoc NetworksAuthor(s): Simone Bolettieri, Giacomo Tanganelli, Carlo Vallati, Enzo MingozziAbstractThe Constrained Application Protocol (CoAP) is an IETF standard application protocol for the future Internet of Things (IoT). Since IoT devices are often interconnected by networks characterized by high packet error rates and low throughput, congestion control will be crucial to ensure proper and timed communication in these networks. Therefore, CoCoA+, an advanced congestion control algorithm for CoAP, is currently being specified by the IETF. In this work, we present a critical analysis of CoCoA+ performance and highlight some of its shortcomings and pitfalls. Two different scenarios are considered: one with an increasing traffic load due to an increasing number of CoAP requests, and another with an interfering traffic concurrently transmitted in the network characterized by a bursty pattern. In the former scenario, we show how CoCoA+ may be characterized by many spurious retransmissions at some offered loads close to congestion. In the latter, we show instead how the weak estimator is not particularly effective in adapting to changing traffic loads. In order to overcome such limitations, a number of modifications to CoCoA+ are proposed. The resulting solution, named precise Congestion Control (pCoCoA), is shown to reduce the number of retransmissions, while guaranteeing throughputs and delays comparable to those of CoAP and CoCoA+.
       
  • On Route Table Computation Strategies in Delay-Tolerant Satellite Networks
    • Abstract: Publication date: Available online 3 July 2018Source: Ad Hoc NetworksAuthor(s): Juan A. Fraire, Pablo G. Madoery, Amir Charif, Jorge M. FinochiettoAbstractDelay-Tolerant Networking (DTN) has been proposed for satellite networks with no expectation of continuous or instantaneous end-to-end connectivity, which are known as Delay-Tolerant Satellite Networks (DTSNs). Path computation over large and highly-dynamic yet predictable topologies of such networks requires complex algorithms such as Contact Graph Routing (CGR) to calculate route tables, which can become extremely large and limit forwarding performance if all possible routes are considered. In this work, we discuss these issues in the context of CGR and propose alternatives to the existing route computation scheme: first-ending, first-depleted, one-route, and per-neighbor strategies. Simulation results over realistic DTSN constellation scenarios show that network flow metrics and overall calculation effort can be significantly improved by adopting these novel route table computation strategies.
       
  • Α Policy-aware Service Oriented Architecture for Secure
           Machine-to-Machine Communications
    • Abstract: Publication date: Available online 3 July 2018Source: Ad Hoc NetworksAuthor(s): Georgios Katsikogiannis, Dimitrios Kallergis, Zacharenia Garofalaki, Sarandis Mitropoulos, Christos DouligerisAbstractBreakthrough recent advancements in the field of machine-to-machine (M2M) communications impose the necessity to improve the service delivery by enforcing appropriate security rules. Due to the large number of the connected devices, the criticality of the M2M applications (e.g. patient monitoring and operation of critical infrastructures), and the network stability weaknesses, we need to consider and analyse the security aspects and establish a flexible policy-aware Service Oriented Architecture (SOA) competent to deal with these emerging challenges. This paper presents the existing reference models and proposes a novel Secure M2M Architecture (SeMMA) based on ETSI's M2M communication functional architecture enhanced with policy-based management capabilities and SOA capabilities. We explore the policy-based management aspects to improve the security of the M2M components and services and to mitigate the security concerns that arise by evaluating different scenarios. It is shown that incorporating an adaptive policy enforcement of the suitable security controls enables enhanced security capabilities, increased agility, and better service levels in the field of M2M communications.
       
  • Continuous Leakage-Resilient Access Control for Wireless Sensor Networks
    • Abstract: Publication date: Available online 2 July 2018Source: Ad Hoc NetworksAuthor(s): Yanwei Zhou, Bo Yang, Yi Mu, Zhe XiaAbstractAn important objective of cryptographic schemes is to withstand various attacks, including leakage attacks. Otherwise, leakage of the secret key may cause serious threats to the security of computer systems. However, leakage attacks have not received adequate attention in the literature. For example, most of the existing security protocols in the wireless sensor networks (WSNs) lack the consideration of leakage attacks. Instead, they are only designed in the traditional security model, in which an adversary is assumed not to obtain any information of the internal secret states. Obviously, this is not ideal because partial information of the secret key may be leaked in practice due to side channel attacks or fault injection attack. In this paper, we propose a new construction of secure continuous leakage-resilient certificate-based signcryption (CBS) scheme with access control without using bilinear pairings, and its security can be proved based on the assumptions that solving the classical decisional Diffie-Hellman problem and discrete logarithm problem is infeasible. We then propose a novel certificate-based access control scheme for the WSNs. The analysis shows that our construction not only achieves high computational efficiency in the continuous leakage setting, but also has superior performance regarding communication efficiency and storage requirement.
       
  • A Prediction-Based Approach for Features Aggregation in Visual Sensor
           Networks
    • Abstract: Publication date: Available online 30 June 2018Source: Ad Hoc NetworksAuthor(s): Alessandro Enrico Redondi, Matteo Cesana, Luigi Fratta, Antonio Capone, Flaminio BorgonovoAbstractVisual Sensor Networks (VSNs) constitute a key technology for the implementation of several visual analysis tasks. Recent studies have demonstrated that such tasks can be efficiently performed following an operative paradigm where cameras transmit to a central controller local image features, rather than pixel-domain images. Furthermore, features from multiple camera views may be efficiently aggregated exploiting the spatial redundancy between overlapping views. In this paper we propose a routing protocol designed for supporting aggregation of image features in a VSN. First, we identify a predictor able to estimate the efficiency of local features aggregation between different cameras in a VSN. The proposed predictor is chosen so as to minimize the prediction error while keeping the network overhead cost low. Then, we harmonically integrate the proposed predictor in the Routing Protocol for Low-Power and Lossy Networks (RPL) in order to support the task of in-network feature aggregation. We propose a RPL objective function that takes into account the predicted aggregation efficiency and build the routes from the camera nodes to a central controller so that either energy consumption or used network bandwidth is minimized. Extensive experimental results confirm that the proposed approach can be used to increase the efficiency of VSNs.
       
  • Drone Cellular Networks: Enhancing the Quality of Experience of Video
           Streaming Applications
    • Abstract: Publication date: Available online 15 June 2018Source: Ad Hoc NetworksAuthor(s): Ludovico Ferranti, Francesca Cuomo, Stefania Colonnese, Tommaso MelodiaAbstractThis article addresses the problem of delay mitigation for video streaming applications in congested cellular macro-cells by using a mobile micro-cell mounted on an Unmanned Aerial Vehicle (UAV). Small-scale UAVs are at a mature stage of development and can carry lightweight commercial micro-cells with small form factor. The mobile micro-cell is used to offload users from a congested macro-cell to optimize the bandwidth usage of video streaming applications. The paper proposes algorithms and comprehensive design criteria for user offload selection (selecting what users need to be offloaded to the micro-cell) and drone positioning (selecting the position of the UAV that minimizes the network delay). The effectiveness of the proposed criteria is evaluated through extensive performance analysis. We show that the performance increases consistently in terms of bandwidth requests mitigation and average delay reduction under different system configurations.
       
  • K Privacy: Towards Improving Privacy Strength While Preserving Utility
    • Abstract: Publication date: Available online 31 May 2018Source: Ad Hoc NetworksAuthor(s): Josh Joy, Dylan Gray, Ciaran McGoldrick, Mario GerlaAbstractFuture autonomous vehicles will generate, collect, aggregate and consume significant volumes of data as key gateway devices in emerging Internet of Things scenarios. While vehicles are widely accepted as one of the most challenging mobility contexts in which to achieve effective data communications, less attention has been paid to the privacy of data emerging from these vehicles. The quality and usability of such privatized data will lie at the heart of future safe and efficient transportation solutions.In this paper, we present the K Privacy mechanism. K Privacy is to our knowledge the first such mechanism that enables data creators to submit multiple contradictory responses to a query, whilst preserving utility measured as the absolute error from the actual original data. The functionalities are achieved in both a scalable and secure fashion. For instance, individual location data can be obfuscated while preserving utility, thereby enabling the scheme to transparently integrate with existing systems (e.g. Waze). A new cryptographic primitive Function Secret Sharing is used to achieve non-attributable writes and we show an order of magnitude improvement from the default implementation.
       
  • LANET: Visible-Light Ad Hoc Networks
    • Abstract: Publication date: Available online 19 April 2018Source: Ad Hoc NetworksAuthor(s): Nan Cen, Jithin Jagannath, Simone Moretti, Zhangyu Guan, Tommaso MelodiaAbstractVisible light communication (VLC) is a wireless technology complementary to well-understood radio frequency (RF) communication that is promising to help alleviate the spectrum crunch problem in overcrowded RF spectrum bands. While there has been significant advancement in recent years in understanding physical layer techniques for visible light point-to-point links, the core problem of developing efficient networking technology specialized for visible-light networks is substantially unaddressed.This article discusses the current existing techniques as well as the main challenges for the design of visible-light ad hoc networks - referred to as LANETs. The paper discusses typical architectures and application scenarios for LANETs and highlights the major differences between LANETs and traditional mobile ad hoc networks (MANETs). Enabling technologies and design principles of LANETs are analyzed and existing work is surveyed following a layered approach. Open research issues in LANET design are also discussed, including long-range visible light communication, full-duplex LANET MAC, blockage-resistant routing, VLC-friendly TCP and software-defined prototyping, among others.
       
  • 6LowPSec: An End-to-End Security Protocol for 6LoWPAN
    • Abstract: Publication date: Available online 2 February 2018Source: Ad Hoc NetworksAuthor(s): Ghada Glissa, Aref MeddebAbstract6LoWPAN has radically changed the IoT (Internet of Things) landscape by seeking to extend the use of IPv6 to smart and tiny objects. Enabling efficient IPv6 communication over IEEE 802.15.4 LoWPAN radio links requires high end-to-end security rules. The IEEE 802.15.4 MAC layer implements several security features offering hardware hop-by-hop protection for exchanged frames. In order to provide end-to-end security, researchers focus on lightweighting variants of existing security solutions such as IPSec that operates on the network layer. In this paper, we introduce a new security protocol referred to as ”6LowPSec”, providing a propitious end-to-end security solution but functioning at the adaptation layer. 6LowPSec employs existing hardware security features specified by the MAC security sublayer. A detailed campaign is presented that evaluates the performances of 6LowPSec compared with the lightweight IPSec. Results prove the feasibility of an end-to-end hardware security solution for IoT, that operates at the adaptation layer, without incurring much overhead.
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-