for Journals by Title or ISSN
for Articles by Keywords
  Subjects -> COMPUTER SCIENCE (Total: 2053 journals)
    - ANIMATION AND SIMULATION (30 journals)
    - AUTOMATION AND ROBOTICS (102 journals)
    - COMPUTER ARCHITECTURE (9 journals)
    - COMPUTER ENGINEERING (10 journals)
    - COMPUTER GAMES (16 journals)
    - COMPUTER PROGRAMMING (27 journals)
    - COMPUTER SCIENCE (1198 journals)
    - COMPUTER SECURITY (44 journals)
    - DATA BASE MANAGEMENT (14 journals)
    - DATA MINING (33 journals)
    - E-BUSINESS (22 journals)
    - E-LEARNING (29 journals)
    - IMAGE AND VIDEO PROCESSING (39 journals)
    - INFORMATION SYSTEMS (108 journals)
    - INTERNET (93 journals)
    - SOCIAL WEB (51 journals)
    - SOFTWARE (34 journals)
    - THEORY OF COMPUTING (8 journals)

COMPUTER SCIENCE (1198 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: 11)
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: 17)
ACM Transactions on Computer-Human Interaction     Hybrid Journal   (Followers: 14)
ACM Transactions on Computing Education (TOCE)     Hybrid Journal   (Followers: 5)
ACM Transactions on Design Automation of Electronic Systems (TODAES)     Hybrid Journal   (Followers: 3)
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: 7)
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: 7)
ACM Transactions on Speech and Language Processing (TSLP)     Hybrid Journal   (Followers: 8)
ACM Transactions on Storage     Hybrid Journal  
ACS Applied Materials & Interfaces     Full-text available via subscription   (Followers: 28)
Acta Automatica Sinica     Full-text available via subscription   (Followers: 2)
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: 2)
Advances in Catalysis     Full-text available via subscription   (Followers: 5)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 19)
Advances in Computer Science : an International Journal     Open Access   (Followers: 15)
Advances in Computing     Open Access   (Followers: 2)
Advances in Data Analysis and Classification     Hybrid Journal   (Followers: 51)
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: 19)
Advances in Materials Sciences     Open Access   (Followers: 14)
Advances in Operations Research     Open Access   (Followers: 12)
Advances in Parallel Computing     Full-text available via subscription   (Followers: 6)
Advances in Porous Media     Full-text available via subscription   (Followers: 5)
Advances in Remote Sensing     Open Access   (Followers: 44)
Advances in Science and Research (ASR)     Open Access   (Followers: 5)
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: 8)
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: 5)
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: 11)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 12)
Annals of Pure and Applied Logic     Open Access   (Followers: 2)
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 Clinical Informatics     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: 33)
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: 4)
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: 142)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 5)
arq: Architectural Research Quarterly     Hybrid Journal   (Followers: 7)
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: 52)
Big Data and Cognitive Computing     Open Access   (Followers: 2)
Biodiversity Information Science and Standards     Open Access  
Bioinformatics     Hybrid Journal   (Followers: 291)
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: 45)
British Journal of Educational Technology     Hybrid Journal   (Followers: 146)
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  
Canadian Journal of Electrical and Computer Engineering     Full-text available via subscription   (Followers: 14)
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: 20)
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 Partial Differential Equations     Hybrid Journal   (Followers: 3)
Communications of the ACM     Full-text available via subscription   (Followers: 52)
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  
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: 11)
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: 15)
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: 94)
Computer Aided Surgery     Hybrid Journal   (Followers: 6)
Computer Applications in Engineering Education     Hybrid Journal   (Followers: 8)
Computer Communications     Hybrid Journal   (Followers: 16)
Computer Engineering and Applications Journal     Open Access   (Followers: 5)
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)
Computer Music Journal     Hybrid Journal   (Followers: 19)

        1 2 3 4 5 6 | Last

Journal Cover Ad Hoc Networks
  [SJR: 0.967]   [H-I: 57]   [11 followers]  Follow
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1570-8705
   Published by Elsevier Homepage  [3177 journals]
  • A robust mutual authentication protocol for WSN with multiple
    • Authors: Ruhul Amin; SK Hafizul Islam; G.P. Biswas; Mohammad S. Obaidat
      Pages: 1 - 18
      Abstract: Publication date: June–July 2018
      Source:Ad Hoc Networks, Volumes 75–76
      Author(s): Ruhul Amin, SK Hafizul Islam, G.P. Biswas, Mohammad S. Obaidat
      Security and Privacy are very crucial for data communication in Wireless Sensor Networks (WSNs). In order to provide ample security, recently many user authentication and key agreement (UAKA) protocols with single base-station have been put forward for WSNs. The base-station experienced huge load for such type of protocol, and thus, the quality of the service is dramatically reduced with the increasing number of users. This problem can be eliminated if the load is distributed to multiple base-stations. However, multiple base-stations based UAKA (MBS-UAKA) protocol with for WSN has not yet been proposed. This paper focuses to design a robust and effective MBS-UAKA protocol for WSN, which makes the secure communication as well as authentication. We evaluated all the known security properties of our MBS-UAKA protocol through formal and informal security analysis. Besides, the BAN logic analysis ensures that our MBS-UAKA protocol satisfies the mutual authentication property. Our comparative analysis ensures better performance compared to existing research works.
      Graphical abstract image

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.03.007
      Issue No: Vol. 75-76 (2018)
  • Efficient data association to targets for tracking in passive wireless
           sensor networks
    • Authors: Changhyuk An; Youngwon Kim An; Seong-Moo Yoo; B. Earl Wells
      Pages: 19 - 32
      Abstract: Publication date: June–July 2018
      Source:Ad Hoc Networks, Volumes 75–76
      Author(s): Changhyuk An, Youngwon Kim An, Seong-Moo Yoo, B. Earl Wells
      We have developed an algorithm for efficient data association to targets, the two-way cluster association (TWCA) algorithm, for tracking multiple targets in passive wireless sensor networks (PWSNs). PWSN applications require that the sensors have low computational and communication loads as the sensors are battery powered. We choose PWSNs as each sensor node triggers target detection and tracking only in the presence of the signals. However, the PWSNs make the association difficult because the detected signal by a passive sensor may come from targets nearby and/or far from the sensor depending on the target signal powers. The difficulty for the data association is further amplified when multiple targets undergo complex maneuvers including merging and split. The TWCA algorithm solves the association problem with very simple operations by using the clusters of the detecting sensors aggregated around the targets. The TWCA is a significant improvement over the previous studies including our previous rule based cluster association (RBCA) which works only for targets in linear motions and the number of targets being constant during tracking. TWCA can track unknown number of targets in a wide range of non-linear maneuvers with very low computation load and high track accuracy as demonstrated by our simulation.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.03.009
      Issue No: Vol. 75-76 (2018)
  • Traffic differentiation in dense collision-free WLANs using CSMA/ECA
    • Authors: Luis Sanabria-Russo; Boris Bellalta
      Pages: 33 - 51
      Abstract: Publication date: June–July 2018
      Source:Ad Hoc Networks, Volumes 75–76
      Author(s): Luis Sanabria-Russo, Boris Bellalta
      The ability to perform traffic differentiation is a promising feature of the current Medium Access Control (MAC) in Wireless Local Area Networks (WLANs). The Enhanced Distributed Channel Access (EDCA) protocol for WLANs proposes up to four Access Categories (AC) that can be mapped to different traffic priorities. High priority ACs are allowed to transmit more often than low priority ACs, providing a way of prioritising delay sensitive traffic like voice calls or video streaming. Further, EDCA also considers the intricacies related to the management of multiple queues, virtual collisions and traffic differentiation. Nevertheless, EDCA falls short in efficiency when performing in dense WLAN scenarios. Its collision-prone contention mechanism degrades the overall throughput to the point of starving low priority ACs, and produce priority inversions at high number of contenders. Carrier Sense Multiple Access with Enhanced Collision Avoidance (CSMA/ECA) is a compatible MAC protocol for WLANs which is also capable of providing traffic differentiation. Contrary to EDCA, CSMA/ECA uses a contention mechanism with a deterministic backoff technique which is capable of constructing collision-free schedules for many nodes with multiple active ACs, extending the network capacity without starving low priority ACs, as experienced in EDCA. This work analyses traffic differentiation with CSMA/ECA by describing the mechanisms used to construct collision-free schedules with multiple queues. Additionally, evaluates the performance under different traffic conditions and a growing number of contenders. Furthermore, it introduces a way to eliminate Virtual Collisions (VC), which also contributes to the throughput degradation in EDCA WLANs. Simulation tests are performed using voice and video packet sources that emulate commonly used codecs. Results show CSMA/ECA outperforming EDCA in different commonly-found scenarios with high number of users, including when both MAC protocols coexist in the same WLAN.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.03.006
      Issue No: Vol. 75-76 (2018)
  • Heterogeneous vehicular communications: A comprehensive study
    • Authors: Abdennour Zekri; Weijia Jia
      Pages: 52 - 79
      Abstract: Publication date: June–July 2018
      Source:Ad Hoc Networks, Volumes 75–76
      Author(s): Abdennour Zekri, Weijia Jia
      Vehicular communications have developed rapidly contributing to the success of intelligent transportation systems. In VANET, continuous connectivity is a huge challenge caused by the extremely dynamic network topology and the highly variable number of mobile nodes. Moreover, message dissemination efficiency is a serious issue in traffic effectiveness and road safety. The heterogeneous vehicular network, which integrates cellular networks with DSRC, has been suggested and attracted significant attention recently. VANET-cellular integration offers many potential benefits, for instance, high data rates, low latency, and extended communication range. Due to the heterogeneous wireless access, a seamless handover decision is required to guarantee QoS of communications and to maintain continuous connectivity between the vehicles. On the other hand, VANET heterogeneous wireless networks integration will significantly help autonomous cars to be functional in reality. This paper surveys and reviews some related studies in the literature that deals with VANET heterogeneous wireless networks communications in term of vertical handover, data dissemination and collection, gateway selection and other issues. The comparison between different works is based on parameters like bandwidth, delay, throughput, and packet loss. Finally, we outline open issues that help to identify the future research directions of VANET in the heterogeneous environment.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.03.010
      Issue No: Vol. 75-76 (2018)
  • A recharging distance analysis for wireless sensor networks
    • Authors: Georgios Tsoumanis; Konstantinos Oikonomou; Sonia Aïssa; Ioannis Stavrakakis
      Pages: 80 - 86
      Abstract: Publication date: June–July 2018
      Source:Ad Hoc Networks, Volumes 75–76
      Author(s): Georgios Tsoumanis, Konstantinos Oikonomou, Sonia Aïssa, Ioannis Stavrakakis
      Efficient energy consumption is a challenging problem in wireless sensor networks especially close to the sink node, known as the energy hole problem. Various policies for recharging battery exhausted nodes have been proposed using special recharging vehicles. The focus in this paper is on a simple recharging policy that permits a recharging vehicle, stationed at the sink node, to move around and replenish any node’s exhausted battery when a certain recharging threshold is violated. The minimization of the recharging distance covered by the recharging vehicle is shown to be a facility location problem, and particularly a 1-median one. Simulation results investigate various aspects of the recharging policy – including an enahnced version – related to the recharging threshold and the level of the energy left in the network nodes’ batteries. In addition, it is shown that when the sink’s positioning is set to the solution of the particular facility location problem, then the recharging distance is minimized irrespectively of the recharging threshold.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.03.003
      Issue No: Vol. 75-76 (2018)
  • On the lifetime analysis of energy harvesting sensor nodes in smart grid
    • Authors: H.E. Erdem; V.C. Gungor
      Pages: 98 - 105
      Abstract: Publication date: June–July 2018
      Source:Ad Hoc Networks, Volumes 75–76
      Author(s): H.E. Erdem, V.C. Gungor
      Smart grids represent the future of power generation, distribution and transmission systems. Integration of renewable energy sources with fluctuating power output into the grid requires constant monitoring of grid assets. Wireless Sensor Networks (WSNs) provide an efficient monitoring infrastructure for data collection from multiple locations for extended periods. The aim of this study is to investigate the lifetime of the energy harvesting WSN nodes inside a substation, where the sensor nodes exploit the abundant electromagnetic field in the substation environment. Performance results show that the impact of harvesters on node lifetime is crucial compared to available power management systems, when realistic substation channel conditions are considered.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.03.002
      Issue No: Vol. 75-76 (2018)
  • ICN-based cache-aware routing scheme in MSN
    • Authors: Junling Shi; Xingwei Wang; Min Huang
      Pages: 106 - 118
      Abstract: Publication date: Available online 6 April 2018
      Source:Ad Hoc Networks
      Author(s): Junling Shi, Xingwei Wang, Min Huang
      With the growing requirements of digital media by Mobile Social Network (MSN) users, an effective routing scheme plays an important role to transmit the interest requests and the requested contents of users. Due to the native support of Information-Centric Networking (ICN) for mobility, we propose a cache-aware routing scheme in MSN based on ICN paradigm. In the proposed scheme, Interest Routing scheme (IR) is devised based on the social regularity with respect to the proposed interest metrics among nodes, which are obtained by exploiting the content names. To transfer data packets back to the interest requesters, Data Routing scheme (DR) is devised based on the proposed closeness metrics among nodes. An In-network Caching scheme (IC) is devised based on the proposed friendship metrics among nodes to respond to the forthcoming requests, and it can get the shorter response latency than the traditional MSN routing schemes. Simulation results show that the proposed scheme has higher message delivery ratio and lower network overhead than other existing ones.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.04.004
      Issue No: Vol. 75-76 (2018)
  • Dynamic Neighbour Aware Power-controlled MAC for Multi-hop Ad Hoc Networks
    • Authors: Jims Marchang; Roderick Douglas; Bogdan Ghita; David Lancaster; Benjamin Sanders
      Pages: 119 - 134
      Abstract: Publication date: Available online 3 April 2018
      Source:Ad Hoc Networks
      Author(s): Jims Marchang, Roderick Douglas, Bogdan Ghita, David Lancaster, Benjamin Sanders
      In Ad Hoc networks, resources in terms of bandwidth and battery life are limited; so using a fixed high transmission power limits the durability of a battery life and causes unnecessary high interference while communicating with closer nodes leading to lower overall network throughput. Thus, this paper proposes a new cross layer MAC called Dynamic Neighbour Aware – Power-controlled MAC (Dynamic NA -PMAC) for multi-hop Ad Hoc networks that adjust the transmission power by estimating the communication distance based on the overheard signal strength. By dynamically controlling the transmission power based on the receivable signal strength, the probability of concurrent transmission, durability of battery life and bandwidth utilization increases. Moreover, in presence of multiple overlapping signals with different strengths, an optimal transmission power is estimated dynamically to maintain fairness and avoid hidden node issues at the same time. In a given area, since power is controlled, the chances of overlapping the sensing ranges of sources and next hop relay nodes or destination node decreases, so it enhances the probability of concurrent transmission and hence an increased overall throughput. In addition, this paper uses a variable backoff algorithm based on the number of active neighbours, which saves energy and increases throughput when the density of active neighbours is less. The designed mechanism is tested with various random network scenarios using different traffic including CBR, Exponential and TCP in both scenarios (stationary and mobile with high speed) for single as well as multi-hop. Moreover, the proposed model is benchmarked against two variants of power-controlled mechanisms namely Min NA-PMAC and MaxRC-MinDA NA-PMAC in order to prove that using a fixed minimum transmission power may lead to unfair channel access and using different transmission power for RTS/CTS and Data/ACK leads to lower probability of concurrent transmission respectively.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.04.003
      Issue No: Vol. 75-76 (2018)
  • Continuous quorum-based multicast power-saving protocols in the
           asynchronous ad hoc network for burst traffics
    • Authors: Yu-Chen Kuo; Xiang-Wei Zhou
      Pages: 1 - 16
      Abstract: Publication date: 15 May 2018
      Source:Ad Hoc Networks, Volume 74
      Author(s): Yu-Chen Kuo, Xiang-Wei Zhou
      Quorum-based asynchronous PS (Power-Saving) protocols utilized the quorum system to guarantee that PS hosts have the intersection even their clocks were asynchronous. However, most quorum systems proposed had limited and non-continuous intersections. When PS hosts adopting those non-continuous quorum systems transmit burst traffics, they may suffer from insufficient transmission bandwidth and long transmission delay. They might not satisfy the quality of service (QoS) for transmitting burst traffics. In this paper, we propose a continuous unicast quorum system named C-coterie such that PS hosts have continuous intersections to transmit burst traffics. In order to transmit burst unicast traffics, we design a unicast PS protocol adopting C-coteries. We define the rotation continuous closure property for certifying the continuous intersection between two quorums even asynchronous clocks. We propose two C-coteries, C-Grid and C-Torus, which satisfy the rotation continuous closure property. In order to transmit burst multicast traffics, we propose a continuous multicast quorum system named C(m)-arbiter and define the rotation continuous m-closure property for certifying the continuous intersection among m quorums even asynchronous clocks. We design a multicast PS protocol adopting C(m)-arbiters for m hosts to transmit burst multicast traffics. We propose two C(m)-arbiters, Uniform C(m)-arbiter and CRT C(m)-arbiter, that satisfy the rotation continuous m-closure property. Finally, we use NS2 to simulate QoS for transmitting burst traffics such as the MTIM frame quantity, packet arrival ratio, transmission delay and throughput. As shown in the simulation results, continuous quorum systems we proposed outperform non-continuous quorum systems, especially in the heavy load. It is because the continuous quorum systems have more opportunity to have continuous intersections such that the sender could continuously transmit burst traffics during continuous intersections.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.02.009
      Issue No: Vol. 74 (2018)
  • 3GPP C-V2X and IEEE 802.11p for Vehicle-to-Vehicle communications in
           highway platooning scenarios
    • Authors: Vladimir Vukadinovic; Krzysztof Bakowski; Patrick Marsch; Ian Dexter Garcia; Hua Xu; Michal Sybis; Pawel Sroka; Krzysztof Wesolowski; David Lister; Ilaria Thibault
      Pages: 17 - 29
      Abstract: Publication date: 15 May 2018
      Source:Ad Hoc Networks, Volume 74
      Author(s): Vladimir Vukadinovic, Krzysztof Bakowski, Patrick Marsch, Ian Dexter Garcia, Hua Xu, Michal Sybis, Pawel Sroka, Krzysztof Wesolowski, David Lister, Ilaria Thibault
      The focus of this study is the performance of high-density truck platooning achieved with different wireless technologies for vehicle-to-vehicle (V2V) communications. Platooning brings advantages such as lower fuel consumption and better traffic efficiency, which are maximized when the inter-vehicle spacing can be steadily maintained at a feasible minimum. This can be achieved with Cooperative Adaptive Cruise Control, an automated cruise controller that relies on the complex interplay among V2V communications, on-board sensing, and actuation. This work provides a clear mapping between the performance of the V2V communications, which is measured in terms of latency and reliability, and of the platoon, which is measured in terms of achievable inter-truck spacing. Two families of radio technologies are compared: IEEE 802.11p and 3GPP Cellular-V2X (C-V2X). The C-V2X technology considered in this work is based on the Release 14 of the LTE standard, which includes two modes for V2V communications: Mode 3 (base-station-scheduled) and Mode 4 (autonomously-scheduled). Results show that C-V2X in both modes allows for shorter inter-truck distances than IEEE 802.11p due to more reliable communications performance under increasing congestion on the wireless channel caused by surrounding vehicles.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.03.004
      Issue No: Vol. 74 (2018)
  • Study of absorption-defined transmission windows in the terahertz band
    • Authors: Mustafa Alper Akkaş
      Pages: 30 - 33
      Abstract: Publication date: 15 May 2018
      Source:Ad Hoc Networks, Volume 74
      Author(s): Mustafa Alper Akkaş
      Communications over the terahertz (THz) frequency band will feature a number of attractive properties, including miniature transceivers, terabit-per-second link capacities and high energy efficiency. Meanwhile, a number of specific research challenges have to be addressed to convert the theoretical estimations into commercially attractive and practical solutions. This paper presents the theoretical estimations of absorption properties of the THz frequency band from 0.3 THz to 3 THz which is chartered to explore by IEEE 802.15 THz Interest Group. The frequency band is called "no man's land" because the range is too high for RF (radio frequency) but it is also too low being considered of light.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.03.001
      Issue No: Vol. 74 (2018)
  • A stochastic geometrical approach for full-duplex MIMO relaying model of
           high-density network
    • Authors: MHD Nour Hindia; Faizan Qamar; Tharek Abd Rahman; Iraj S Amiri
      Pages: 34 - 46
      Abstract: Publication date: 15 May 2018
      Source:Ad Hoc Networks, Volume 74
      Author(s): MHD Nour Hindia, Faizan Qamar, Tharek Abd Rahman, Iraj S Amiri
      In a high-density wireless communication network, users suffer from low-performance gains due to multiple path loss and scattering issues. Relay nodes, a significant multi-hop communication approach, provide a decent cost-effective solution, which not only provides better spectral efficiency but also enhances the cell coverage area. In this approach, full-duplex topology is the most efficient way in order to provide maximum throughput at the destination, however, it also leads to undesired relay self-interference. In this paper, we formulated a new Poisson point process approach including a wide variety of interferences by considering a multi-hop high-density cooperative network (source-to-relay and relay-to-destination). Performance evaluation is carried out by using stochastic geometric approach for full-duplex MIMO relaying network to model signal-to-interference-plus-noise ratio (SINR) and success probability followed by average capacity and outage probability of the system. The obtained expressions are amenable and provide better performance as compared to conventional multiple antenna ultra-density network approach.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.03.005
      Issue No: Vol. 74 (2018)
  • Secure localization using hypothesis testing in wireless networks
    • Authors: Suood Abdulaziz AlRoomi; Imtiaz Ahmad; Tassos Dimitriou
      Pages: 47 - 56
      Abstract: Publication date: 15 May 2018
      Source:Ad Hoc Networks, Volume 74
      Author(s): Suood Abdulaziz AlRoomi, Imtiaz Ahmad, Tassos Dimitriou
      Localization is the method of estimating the location of a wireless node using measured inputs such as distances from nodes with known locations. When the measured distances from anchor nodes are used for localization, compromised nodes that are involved in the process can give false information that produces inaccurate location estimates. This paper proposes a Generalized Likelihood Ratio (GLRT) based approach to find the compromised nodes that deliberately give false information. After detecting such malicious nodes, the measurements given by them are eliminated from the localization computation to improve the location estimate. The proposed method works for Gaussian range measurement errors, which is considered more realistic, as compared to a method available in literature that works only for uniformly distributed range errors. Extensive simulations were carried out to assess the performance of the algorithm under various conditions. The proposed method was found to give better localization accuracy as compared to previous methods available in the literature which address the same problem. Simulations also showed that the algorithm performs well even when some of the assumptions used in the algorithm do not hold true.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.03.008
      Issue No: Vol. 74 (2018)
  • Toward efficient adaptive ad-hoc multi-robot network topologies
    • Authors: Cinara Ghedini; Carlos H.C. Ribeiro; Lorenzo Sabattini
      Pages: 57 - 70
      Abstract: Publication date: 15 May 2018
      Source:Ad Hoc Networks, Volume 74
      Author(s): Cinara Ghedini, Carlos H.C. Ribeiro, Lorenzo Sabattini
      The availability of robust and power-efficient robotic devices boosts their use in a wide range of applications, most of them unfeasible in the recent past due to environmental restrictions or because they are hazardous to humans. Nowadays, robots can support or perform missions of search and rescue, exploration, surveillance, and reconnaissance, or provide a communication infrastructure to clients when there is no network infrastructure available. In general, these applications require efficient and multi-objective teamwork. Hence, successful control and coordination of a group of wireless-networked robots relies on effective inter-robot communication. In this sense, this work proposes a model that aims at providing more efficient network topologies addressing the issues of connectivity maintenance, collision avoidance, robustness to failure and area coverage improvement. The model performance was experimentally validated considering fault-free and fault-prone scenarios. Results demonstrated the feasibility of having simultaneous controls acting to achieve more resilient networks able to enhancing their sensing area while avoiding collision and maintaining the network connectivity with regard to fault-free scenarios.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.03.012
      Issue No: Vol. 74 (2018)
  • A novel self-adaptive content delivery protocol for vehicular networks
    • Authors: Rodolfo I. Meneguette; Azzedine Boukerche; Fabrício A. Silva; Leandro Villas; Linnyer B. Ruiz; Antonio A. F. Loureiro
      Pages: 1 - 13
      Abstract: Publication date: 1 May 2018
      Source:Ad Hoc Networks, Volume 73
      Author(s): Rodolfo I. Meneguette, Azzedine Boukerche, Fabrício A. Silva, Leandro Villas, Linnyer B. Ruiz, Antonio A. F. Loureiro
      Content Delivery Network (CDN) has been successfully adapted to deliver content on the traditional Internet. CDNs help reduce the load on the origin server by transferring part of the responsibility to surrogate servers. Content delivery is even more challenging in vehicular networks given their particular characteristics, such as dynamic topology and large-scale scenarios. In order to overcome these challenges, we propose an effective mobile content delivery solution for vehicular networks. The main contribution to adaptation is the use of the dissemination protocol along with the concepts of CDN, in order to increase content availability without compromising network overhead, regardless of traffic conditions and road networks. Some simulations were performed through the NS3 simulator in which the proposed solution presented an excellent performance compared with other six baseline solutions, in both urban and highway road networks, in terms of content availability and network resource consumption through a high coverage about 80% in highways and 98% in urban environments with a low amount of packet loss (approximately 5% in highway scenarios and 15% in urban scenarios).

      PubDate: 2018-02-25T17:23:52Z
      DOI: 10.1016/j.adhoc.2018.02.005
      Issue No: Vol. 73 (2018)
  • Privacy-preserving mobile crowd sensing in ad hoc networks
    • Authors: Zhijie Wang; Dijiang Huang
      Pages: 14 - 26
      Abstract: Publication date: 1 May 2018
      Source:Ad Hoc Networks, Volume 73
      Author(s): Zhijie Wang, Dijiang Huang
      The presence of a rich set of embedded sensors on mobile devices has been propelling various sensing applications regarding individual activities and their surrounding environment, and these persuasive sensing-capable mobile devices are pushing the new paradigm of Mobile Crowd Sensing (MCS) from sketch to reality. MCS aims to outsource sensing data collection to Mobile Device Owner (MDO) and it could revolutionize the conventional ways of sensing data collection and processing. Nonetheless, the widespread deployment of MCS gives rise to the privacy concerns from both the MDOs and the Sensing Service Consumers (SSC), especially in the case where MCS relies on untrustworthy third-party infrastructures. This paper proposes three protocols to address the privacy issues of MCS in ad hoc network without depending on any third-parties. It first presents Privacy-Preserving Summation (PPS) protocol to protect the privacy of the SSCs. Next, it puts forward Privacy-Preserving Difference Rank Computation (PPDRC) protocol to ensure the privacy of the MDOs. Finally, it proposes Approximate K-Nearest Neighbor with Privacy Preservation(AKN2P2) to approximately identify the k-nearest neighbors without privacy leaks of both the MDOs and the SSCs. The performance evaluations demonstrate the computation overhead in different settings.

      PubDate: 2018-02-25T17:23:52Z
      DOI: 10.1016/j.adhoc.2018.02.003
      Issue No: Vol. 73 (2018)
  • Improving network lifetime and reliability for machine type communications
           based on LOADng routing protocol
    • Authors: Deepthi Sasidharan; Lillykutty Jacob
      Pages: 27 - 39
      Abstract: Publication date: 1 May 2018
      Source:Ad Hoc Networks, Volume 73
      Author(s): Deepthi Sasidharan, Lillykutty Jacob
      With the advent of machine type communication (MTC) as part of the Internet of Things (IoT), there is an increasing need to address the challenges for the machine to machine (M2M) communications. Among the two routing protocols specifically designed for low-power lossy networks, RPL has limited support for M2M communications; whereas, LOADng can address the resource constraints of the nodes and demands for M2M communication. This paper proposes a new composite routing metric, LRRE, for LOADng to address the node congestion due to heavy traffic through the node and early node death. The LOADng with LRRE is implemented in ns-3 simulator. The simulation results show improved performance of LOADng with LRRE compared to that with the traditional hop count and residual energy metrics. We also propose a new multipath data forwarding scheme, namely, weighted forwarding (WF) to distribute the load evenly across the network. We extend the ns-3 simulation module for LOADng to multipath routing and integrate it with the newly proposed routing metric and multipath data forwarding technique. The simulation results show a significant improvement in network lifetime, packet delivery ratio, and energy utilization with the proposed LRRE metric and WF multipath data forwarding scheme. Analytical results are also obtained for simplified cases.

      PubDate: 2018-02-25T17:23:52Z
      DOI: 10.1016/j.adhoc.2018.02.007
      Issue No: Vol. 73 (2018)
  • Key predistribution schemes for wireless sensor networks based on
           combinations of orthogonal arrays
    • Authors: Qiang Gao; Wenping Ma; Wei Luo
      Pages: 40 - 50
      Abstract: Publication date: 1 May 2018
      Source:Ad Hoc Networks, Volume 73
      Author(s): Qiang Gao, Wenping Ma, Wei Luo
      In general, combinatorial key predistribution schemes (KPSs) have higher local connectivity but lower resilience against a node capture attack than random KPSs for a given key storage. We seek to find an approach to improving the weakness of combinatorial KPSs while maintaining the strength as much as possible. In this paper, by combining a class of saturated symmetric orthogonal arrays (OAs), a family of KPSs are proposed and the explicit formulas for local connectivity and resilience of the resulting KPSs are also derived. KPSs are typically designed to provide a trade-off between the key storage, the local connectivity and the resilience. It is found that in the resulting schemes, any two nodes can communicate directly with each other and for a given key storage, the resilience against node capture increases as the number of OAs increases so that the resilience can be enhanced without degrading the other two metrics.

      PubDate: 2018-02-25T17:23:52Z
      DOI: 10.1016/j.adhoc.2018.02.006
      Issue No: Vol. 73 (2018)
  • Use ’em or lose ’em: On unidirectional links in reactive
           routing protocols
    • Authors: Thomas Clausen; Juan-Antonio Cordero; Jiazi Yi; Yuichi Igarashi
      Pages: 51 - 64
      Abstract: Publication date: 1 May 2018
      Source:Ad Hoc Networks, Volume 73
      Author(s): Thomas Clausen, Juan-Antonio Cordero, Jiazi Yi, Yuichi Igarashi
      In reactive unicast routing protocols, Route Discovery aims to include only bidirectional links in discovered routing paths. This is typically accomplished by having routers maintain a “blacklist” of links recently confirmed (through Route Reply processing) to be unidirectional – which is then used for excluding subsequent Route Discovery control messages received over these links from being processed and forwarded. This paper first presents an analytical model, which allows to study the impact of unidirectional links being present in a network, on the performance of reactive routing protocols. Next, this paper identifies that despite the use of a “blacklist”, the Route Discovery process may result in discovery of false forward routes, i.e.,routes containing unidirectional links – and proposes a counter-measure denoted Forward Bidirectionality Check. This paper further proposes a Loop Exploration mechanism, allowing to properly include unidirectional links in a discovered routing topology – with the goal of providing bidirectional connectivity even in absence of bidirectional paths in the network. Finally, each of these proposed mechanisms are subjected to extensive network simulations in static scenarios. When the fraction of unidirectional links is moderate (15–50%), simulations find Forward Bidirectionality Check to significantly increase the probability that bidirectional routing paths can be discovered by a reactive routing protocol, while incurring only an insignificant additional overhead. Further, in networks with a significant fraction of unidirectional links ( ≥ 50%), simulations reveal that Loop Exploration preserves the ability of a reactive routing protocol to establish bidirectional communication (possibly through non-bidirectional paths), but at the expense of a substantial additional overhead.

      PubDate: 2018-02-25T17:23:52Z
      DOI: 10.1016/j.adhoc.2018.02.004
      Issue No: Vol. 73 (2018)
  • Flexible real-time transmission scheduling for wireless networks with
           non-deterministic workloads
    • Authors: Arda Gumusalan; Robert Simon; Hakan Aydin
      Pages: 65 - 79
      Abstract: Publication date: 1 May 2018
      Source:Ad Hoc Networks, Volume 73
      Author(s): Arda Gumusalan, Robert Simon, Hakan Aydin
      Wireless Sensor Networks (WSNs) are increasingly used in industrial applications such as the Internet-of-Things, Smart City technologies and critical infrastructure monitoring. Industrial WSNs often operate in a cluster or star configuration. To ensure real-time and predictable performance, link access is typically managed using time-slotted superframe methods. These methods generally use static and potentially inefficient slot assignments. In this paper, we propose to dynamically readjust time slot lengths as a technique to minimize overall energy consumption. Our approach combines real-time performance guarantees with energy conservation methods through a set of dynamic modulation based adaptive packet transmission scheduling algorithms that are designed to reclaim unused slot times. To support our reclaiming method in a wireless environment we introduce a novel low-power listening technique called reverse-low-power listening (RLPL) as part of an overall Hybrid Low-Power Listening (HLPL) protocol. We evaluate our algorithms using Castalia simulator against an oracle-based approach, and show that our dynamic slot reclaiming approach, coupled with HLPL, can introduce substantial power savings without sacrificing real-time support which may be a new approach towards improving industrial wireless standards.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.02.002
      Issue No: Vol. 73 (2018)
  • Performance evaluation of IEEE 802.15.4 with real time queueing analysis
    • Authors: Zhuoling Xiao; Jie Zhou; Junjie Yan; Chen He; Lingge Jiang; Niki Trigoni
      Pages: 80 - 94
      Abstract: Publication date: 1 May 2018
      Source:Ad Hoc Networks, Volume 73
      Author(s): Zhuoling Xiao, Jie Zhou, Junjie Yan, Chen He, Lingge Jiang, Niki Trigoni
      To provide a tool for performance evaluation of IEEE 802.15.4 with sleep mode enabled, a novel model based on real time queueing analysis is proposed in this paper. A low-rate wireless personal area network (LR-WPAN), composed of multiple nodes which send packets to the coordinator, is considered. The queueing behaviour of IEEE 802.15.4 node with sleep mode enabled differs from others because the packet arrivals in sleep period accumulate at the beginning of the active period, which makes a heavier load in the beginning than at any other time. This model analyses this behaviour by dividing the active portion of the superframe into backoff slots and then using an embedded discrete-time Markov chain model. The concept of virtual service time is introduced into this model which makes the proposed queueing model novel and different from typical ones. The accuracy of the proposed model is validated by Monte Carlo simulations in existing typical application scenarios, which indicates that the proposed queueing model can accurately evaluate the performance of IEEE 802.15.4 in the context of the application scenarios described in the simulations.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.01.006
      Issue No: Vol. 73 (2018)
  • Quality-aware UAV coverage and path planning in geometrically complex
    • Authors: Rui Dai; Sneha Fotedar; Mohammadreza Radmanesh; Manish Kumar
      Pages: 95 - 105
      Abstract: Publication date: 1 May 2018
      Source:Ad Hoc Networks, Volume 73
      Author(s): Rui Dai, Sneha Fotedar, Mohammadreza Radmanesh, Manish Kumar
      Networks of unmanned aerial vehicles (UAVs), capable of providing flexible aerial views over large areas, are playing important roles in today’s distributed sensing systems. Since camera sensors are sensitive to occlusions, it is more challenging for UAVs to provide satisfactory sensing quality in geometrically complex environments, such as dense urban areas and mountainous terrains. This paper proposes a new quality-aware and energy-efficient UAV coverage and path planning scheme with the objective of sensing a geometrically complex target area with satisfactory spatial and temporal resolutions. An occlusion-aware waypoint generation algorithm is first designed to find the best set of waypoints for taking pictures in a target area to satisfy the spatial resolution requirement. The selected waypoints are then assigned to multiple UAVs by solving a vehicle routing problem (VRP) such that all the waypoints are visited within a global deadline to satisfy the temporal resolution requirement. The vehicle routing problem is formulated to minimize the maximum energy for the UAVs to travel through the waypoints within the deadline. A Min-Max energy path planning algorithm is designed to solve this problem in two steps: first, a mixed integer linear programming problem (MILP) is solved to calculate the minimum energy for a UAV to go from one waypoint to other; then, a genetic algorithm is devised to plan the paths for all the UAVs. Evaluation results show that the proposed coverage and path planning scheme results in better coverage and energy consumption than traditional coverage and path planning techniques for UAVs.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.02.008
      Issue No: Vol. 73 (2018)
  • Dynamic multiple node failure recovery in distributed storage systems
    • Authors: May Itani; Sanaa Sharafeddine; Islam ElKabani
      Pages: 1 - 13
      Abstract: Publication date: April 2018
      Source:Ad Hoc Networks, Volume 72
      Author(s): May Itani, Sanaa Sharafeddine, Islam ElKabani
      Our daily lives are getting more and more dependent on data centers and distributed storage systems in general, whether at the business or at the personal level. With the advent of fog computing, personal mobile devices in a given geographical area may also comprise a very dynamic distributed storage system. These paradigm changes call for the urgent need of devising efficient and reliable failure recovery mechanisms in dynamic scenarios where failures become more likely and nodes join and leave the network more frequently. Redundancy schemes in distributed storage systems have become essential for providing reliability given the fact of frequent node failures. In this work, we address the problem of multiple failure recovery with dynamic scenarios using the fractional repetition code as a redundancy scheme. The fractional repetition (FR) code is a class of regenerating codes that concatenates a maximum distance separable code (MDS) with an inner fractional repetition code where data is split into several blocks then replicated and multiple replicas of each block are stored on various system nodes. We formulate the problem as an integer linear programming problem and extend it to account for three dynamic scenarios of newly arriving blocks, nodes, and variable priority blocks allocation. The contribution of this paper is four-fold: i. we generate an optimized block distribution scheme that minimizes the total system repair cost of all dependent and independent multiple node failure scenarios; ii. we address the practical scenario of having newly arriving blocks and allocate those blocks to existing nodes without any modification to the original on-node block distribution; iii. we consider new-comer nodes and generate an updated optimized block distribution; iv. we consider optimized storage and recovery of blocks with varying priority using variable fractional repetition codes. The four problems are modeled using incidence matrices and solved heuristically. We present a range of results for our proposed algorithms in several scenarios to assess the effectiveness of the solution approaches that are shown to generate results close to optimal.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2017.12.007
      Issue No: Vol. 72 (2018)
  • An energy consumption model for IEEE 802.11ah WLANs
    • Authors: Albert Bel; Toni Adame; Boris Bellalta
      Pages: 14 - 26
      Abstract: Publication date: April 2018
      Source:Ad Hoc Networks, Volume 72
      Author(s): Albert Bel, Toni Adame, Boris Bellalta
      One of the main challenges when designing a new self-powered Low Power Wide Area Network (LPWAN) technology is the vast operational dependence on its scarce energy resources. Therefore, a thorough identification and characterisation of the main energy consumption processes may lay the foundation for developing novel mechanisms aimed to make a more efficient use of devices’ batteries, as well as for planning future network deployments. This paper provides an analytical energy consumption model for IEEE 802.11ah WLANs, which are expected to become one of the technology drivers in the future development of the Internet of Things (IoT). Given the network characteristics, the presented analytical model is able to provide an estimation of the average energy consumed by a station in the network, predicting its battery lifetime, based on a set of closed-form equations. In addition, this model can be used as a tool to understand the effects of the main network parameters on the network energy consumption, and to find the most suitable network configuration for a given application scenario.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2018.01.005
      Issue No: Vol. 72 (2018)
  • Intelligent slots allocation for dynamic differentiation in IEEE 802.15.6
    • Authors: Hend Fourati; Hanen Idoudi; Leila Azouz Saidane
      Pages: 27 - 43
      Abstract: Publication date: April 2018
      Source:Ad Hoc Networks, Volume 72
      Author(s): Hend Fourati, Hanen Idoudi, Leila Azouz Saidane
      eHealth applications have become essential in everyday life healthcare especially for elderly and sick individuals. To provide efficiency to such applications, many standards emerged for WBANs. However, WBANs standards showed their limits in terms of QoS and priorities differentiation depending on applications need. In this paper, we investigate IEEE 802.15.6 MAC performance efficiency and we define TA-802.15.6, an enhanced IEEE 802.15.6 CSMA/CA channel access mechanism. We aim to differentiate all IEEE 802.15.6 priorities traffics and to improve IEEE 802.15.6 based networks performances. Our main contribution is the enhancement of IEEE 802.15.6 CSMA/CA retransmission and packet drop processes. We also defined a new algorithm for dynamic backoff bounds assignment according to IEEE 802.15.6 priorities and to the network traffic state. We make an analytical evaluation through a new 4D Markov chain and by simulation based on Castalia. Results validate that the enhanced IEEE 802.15.6 CSMA/CA version provides a better service differentiation through accentuating priority differentiation and a better QoS in terms of reliability, throughput and energy consumption.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2018.01.007
      Issue No: Vol. 72 (2018)
  • Quality-aware incentive mechanism based on payoff maximization for mobile
    • Authors: Yufeng Zhan; Yuanqing Xia; Jinhui Zhang
      Pages: 44 - 55
      Abstract: Publication date: April 2018
      Source:Ad Hoc Networks, Volume 72
      Author(s): Yufeng Zhan, Yuanqing Xia, Jinhui Zhang
      Recent years, we have witnessed the explosion of smart devices. These smart devices are more and more powerful with a set of built in sensor devices, such as GPS, accelerometer, gyroscope, camera, etc. The large scale and powerful smart devices make the mobile crowdsensing applications which leverage public crowd equipped with various mobile devices for large scale sensing tasks be possible. In this paper, we study a critical problem of payoff maximization in mobile crowdsensing system with incentive mechanism. Due to the influence of various factors (e.g. sensor quality, noise, etc.), the quality of the sensed data contributed by individual users varies significantly. Obtaining the high quality sensed data with less expense is the ideal of sensing platforms. Therefore, we take the quality of individuals which is determined by the sensing platforms into incentive mechanism design. We propose to maximize the social welfare of the whole system, due to that the private parameters of the mobile users are unknown to the sensing platforms. It is impossible to solve the problem in a central manner. Then a dual decomposition method is employed to divide the social welfare maximization problem into sensing platforms’ local optimization problems and mobile users’ local optimization problems. Finally, distributed algorithms based on an iterative gradient descent method are designed to achieve the close-to-optimal solution. Extensive simulations demonstrate the effectiveness of the proposed incentive mechanism.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2018.01.009
      Issue No: Vol. 72 (2018)
  • Active data dissemination for mobile sink groups in wireless sensor
    • Authors: Jeongcheol Lee; Seungmin Oh; Soochang Park; Yongbin Yim; Sang-Ha Kim; Euisin Lee
      Pages: 56 - 67
      Abstract: Publication date: April 2018
      Source:Ad Hoc Networks, Volume 72
      Author(s): Jeongcheol Lee, Seungmin Oh, Soochang Park, Yongbin Yim, Sang-Ha Kim, Euisin Lee
      In wireless sensor networks, a mobile sink group brings out many challenging issues with regard to data dissemination due to its twofold mobility: group mobility and individual one. All member sinks of a group should move together toward the same destination in relation to the group mobility, but each member sink can also move randomly within a certain group area in relation to the individual mobility. For supporting such groups, geocasting may decrease data delivery ratio due to continuous group area shifting by the group mobility, and multicasting may increase energy consumption due to frequent multicast tree reconstructions by the individual sink mobility. Recently, mobile geocasting protocols have been proposed, which enable a mobile sink group to periodically register its current group area information to a source and member sinks in the group to passively receive data from the source by flooding within the registered group area. However, due to the passive data dissemination, they suffer from excessive energy consumption of sensor nodes due to flooding data within the large group area and result in high data delivery failures of member sinks on edge of the group due to asynchrony between the registered group area and the actual group area. Therefore, we propose an active data dissemination protocol that exploits a local data area constructed by considering the moving direction and pattern of a mobile sink group. In the proposed protocol, a source sends data to nodes in the local data area in advance, and member sinks in the group actively receive the data from the local data area when they potentially pass it. To efficiently construct a local data area, we investigate the pattern of group mobility and classify into three major categories according to the prediction level: a regular movement, a directional movement, and a random movement. We then present three different data dissemination schemes with an efficient local data area to effectively operate for each mobility pattern. Experimental results conducted in various environments show that the proposed protocol has better performance than previous protocols in terms of the data delivery ratio and the energy consumption.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2018.01.008
      Issue No: Vol. 72 (2018)
  • A heterogeneous network selection algorithm based on network attribute and
           user preference
    • Authors: He-Wei Yu; Biao Zhang
      Pages: 68 - 80
      Abstract: Publication date: April 2018
      Source:Ad Hoc Networks, Volume 72
      Author(s): He-Wei Yu, Biao Zhang
      Mobile terminals are often in the dynamic environment of heterogeneous networks. For some reasons, they need to switch between different networks, namely vertical handover. At this moment, it is a very crucial issue for the mobile terminal to select the best suitable one rapidly from all detected alternative networks on condition that the selection result can avoid the ping-pong effect as much as possible. This paper proposes a heterogeneous network selection algorithm based on the combination of network attribute and user preference. Taking full account of user preferences for each candidate network and the actual situation of heterogeneous networks, the algorithm combines three typical MADM methods, namely FAHP, Entropy and TOPSIS. We first use FAHP to calculate the subjective weights of network attributes and the subjective utility values of all alternatives for four typical traffic classes, and then use Entropy and TOPSIS to respectively get the objective weights of network attributes and the objective utility values of all alternatives. Finally, according to the comprehensive utility value of every candidate network and a threshold, the most appropriate network, whose comprehensive utility value is maximum and greater than the corresponding value of the current network of the mobile terminal, is selected to access. The proposed algorithm not only avoids the one-sided nature of a single algorithm, but also dynamically adjusts the proportion of each algorithm in the final result according to the actual requirements. Simulation results indicate that the proposed algorithm can accurately select the optimal access network, significantly reduce the number of vertical handovers and provide the required QoS and QoE in terms of the quantified benefit from vertical handoff, compared with three existing hybrid algorithms.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2018.01.011
      Issue No: Vol. 72 (2018)
  • Key establishment scheme for wireless sensor networks based on polynomial
           and random key predistribution scheme
    • Authors: Jianmin Zhang; Hua Li; Jian Li
      Pages: 68 - 77
      Abstract: Publication date: 15 March 2018
      Source:Ad Hoc Networks, Volume 71
      Author(s): Jianmin Zhang, Hua Li, Jian Li
      Establishing communication keys for pairs of neighbouring sensor nodes is the foundation of the security in wireless sensor networks (WSNs). However, due to the resource constraints on nodes, this task is challenging for the constrained memory, energy, and computational capabilities of sensor nodes. This paper proposes a novel key predistribution scheme based on the polynomial pool-based key predistribution scheme and random key predistribution. In the proposed scheme, parts of the preloaded information in each sensor node are the polynomial shares and the rest of the preloaded information are the keys generated by the polynomial shares preloaded in the sensor nodes. Performance analyses and comparisons with other schemes are performed in this paper. The comparison of security results confirm that the proposed scheme has better resilience against node compromising attacks when compared to previous schemes.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2017.12.006
      Issue No: Vol. 71 (2018)
  • An efficient provably-secure certificateless signature scheme for
           Internet-of-Things deployment
    • Authors: Xiaoying Jia; Debiao He; Qin Liu; Kim-Kwang Raymond Choo
      Pages: 78 - 87
      Abstract: Publication date: 15 March 2018
      Source:Ad Hoc Networks, Volume 71
      Author(s): Xiaoying Jia, Debiao He, Qin Liu, Kim-Kwang Raymond Choo
      With the growing popularity of Internet of Things (IoT) in a wide range of applications, ensuring the communication security of IoT devices is important. Certificateless signature schemes are one of several viable approaches to providing data integrity and user identification security in resource-limited IoT devices. However, designing provably-secure and efficient certificateless signature schemes remains a challenging task. In this paper, we point out two shortcomings in Yeh et al.’s certificateless signature scheme, by explaining how an adversary can easily impersonate the key generation center to issue the partial private key for any user without being detected. Moreover, the scheme cannot resist public key replacement attacks. Then, we present an improved scheme and prove its unforgeability against super adversaries in the random oracle model. Furthermore, we demonstrate the efficiency of our scheme is comparable to that of Yeh’s scheme in terms of computational and communication costs.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2018.01.001
      Issue No: Vol. 71 (2018)
  • LEEF: Latency and energy efficient federation of disjoint wireless sensor
    • Authors: Sookyoung Lee; Mohamed Younis; Ben Anglin; Meejeong Lee
      Pages: 88 - 103
      Abstract: Publication date: 15 March 2018
      Source:Ad Hoc Networks, Volume 71
      Author(s): Sookyoung Lee, Mohamed Younis, Ben Anglin, Meejeong Lee
      In hostile environments where explosives and natural calamities probably occur, wireless sensor networks (WSNs) are susceptible to multiple collocated failures and could be partitioned into disjoint segments. Federating the segments would be essential for restoring connectivity and enabling data sharing in the network. The federation may be achieved by populating relay nodes and providing perpetual inter-segment paths. In this paper, we tackle the federation problem while considering constrained relay availability, i.e., a limited number (k) of mobile relays to provide intermittent inter-segment connectivity that makes the problem more challenging. We propose LEEF, a novel algorithm for achieving energy-efficient federation with low inter-segment data delivery latency. LEEF strives to group the segments into k clusters in a star topology where a cluster at the center of the area serves as a hub between each pair of segment-clusters. Each cluster is served by a distinct mobile relay. In addition, LEEF opts to equalize the energy consumed by the k mobile relays due to travel and wireless communication. We analyze the properties of LEEF mathematically and validate its performance through extensive simulation experiments.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2017.12.008
      Issue No: Vol. 71 (2018)
  • Connectivity analysis of underground sensors in wireless underground
           sensor networks
    • Authors: Hoang Thi Huyen Trang; Le The Dung; Seong Oun Hwang
      Pages: 104 - 116
      Abstract: Publication date: 15 March 2018
      Source:Ad Hoc Networks, Volume 71
      Author(s): Hoang Thi Huyen Trang, Le The Dung, Seong Oun Hwang
      Wireless underground sensor networks consist of sensors that are buried under the ground and communicate through soil medium. Due to channel characteristics, the connectivity analysis of wireless underground sensor networks is more complicated than that in the traditional over-the-air wireless sensor networks. This paper focuses on analyzing the connectivity of underground sensors in wireless underground sensor networks in terms of the probability of node isolation and path probability which captures the effects of the environment parameters such as soil moisture and soil composition, and system parameters such as sensor node density and propagation techniques. Throughout this paper, both qualitative and quantitative comparisons between electromagnetic wave system and ordinary magnetic induction system for underground communications are provided. More specifically, we derive the exact closed-form mathematical expressions for the probability of node isolation of these two communication systems and validate the correctness of analytical models through simulations. We also provide the simulation-based path connectivity of these two communication systems. The results obtained in this paper provide useful guidelines on the design of reliable wireless underground sensor networks.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2018.01.002
      Issue No: Vol. 71 (2018)
  • A comprehensive review on energy harvesting MAC protocols in WSNs:
           Challenges and tradeoffs
    • Authors: Hafiz Husnain Raza Sherazi; Luigi Alfredo Grieco; Gennaro Boggia
      Pages: 117 - 134
      Abstract: Publication date: 15 March 2018
      Source:Ad Hoc Networks, Volume 71
      Author(s): Hafiz Husnain Raza Sherazi, Luigi Alfredo Grieco, Gennaro Boggia
      Nowadays, wireless sensor networks (WSNs) are broadly used to set up distributed monitoring infrastructures in self-healing, self-configuring, and self-managing systems. They are composed by many elementary devices (or motes) equipped with basic sensing, computing, and communications capabilities, which interact on a collaborative basis to sense a target environment and report collected data to one or more sinks. WSNs are expected to be operational for very long periods of time, even if each mote cannot bring large energy storage units. Accordingly, Energy Harvesting mechanisms can greatly magnify the expected lifetime of WSNs. Over the years, Energy Harvesting-Wireless Sensor Networks (EH-WSN) have been thoroughly studied by the scientific and industrial communities to bridge the gap from the vision to the reality. A critical facet of EH-WSN lies in the interplay between EH techniques and MAC protocols. In fact, while EH technologies feed motes with energy, the MAC layer is responsible for a significant quota of spent energy because of message transmission/reception and channel sensing operations. In addition, the energy brought by EH technologies is not easily predictable in advance because of time-varying nature: this makes the design of the MAC protocol even more challenging. To draw a comprehensive review of the state of the art on this subject, the present manuscript first provides a detailed analysis on existing energy harvesting systems for WSNs; then it extensively illustrates pros and cons of key MAC protocols for EH-WSNs with a special focus on: fundamental techniques, evaluation approaches, and key performance indicators. Finally, it summarizes lessons learned, provides design guidelines for MAC protocols in EH-WSNs, and outlooks the impact on Internet of Things.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2018.01.004
      Issue No: Vol. 71 (2018)
  • Cross-Layer Greedy position-based routing for multihop wireless sensor
           networks in a real environment
    • Authors: Ali Benzerbadj; Bouabdellah Kechar; Ahcène Bounceur; Bernard Pottier
      Pages: 135 - 146
      Abstract: Publication date: 15 March 2018
      Source:Ad Hoc Networks, Volume 71
      Author(s): Ali Benzerbadj, Bouabdellah Kechar, Ahcène Bounceur, Bernard Pottier
      It has been shown that the maximum distance routing strategy which works well on a Unit Disk Graph (UDG), performs poorly when it is executed on a Non Unit Disk Graph (N-UDG) which reflects the radio irregularity phenomenon. This latter arises from multiple factors, such as antenna and medium type, and is accentuated by environmental factors such as obstacles (e.g., buildings, hills, mountains) and weather conditions. In this paper, we propose a Cross-Layer Greedy Routing algorithm (CL-GR) which enables a correct position-based routing on a N-UDG. It provides two novel greedy routing strategies, termed respectively, Progress towards the sink node through Symmetrical links that experience the lowest Path Loss (PSPL) and progress through symmetrical links, combining the Maximum Distance forwarding strategy and the PSPL (MDPSPL). We compare our CL-GR to an Enhanced version of the Greedy algorithm of the Greedy Perimeter Stateless Routing protocol (GPSR), that we call E-GR and which can be executed on a N-UDG, and to COP _ GARE algorithm. The simulation results show that both PSPL and MDPSPL enable higher Packet Delivery Ratio (PDR) and energy efficiency. In terms of end-to-end delay, while the PSPL strategy significantly increases this metric, the MDPSPL strategy enables a satisfactory end-to-end delay, comparatively to E-GR and COP _ GARE.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2018.01.003
      Issue No: Vol. 71 (2018)
    • Authors: Ian F. Akyildiz
      Abstract: Publication date: 1 March 2018
      Source:Ad Hoc Networks, Volume 70
      Author(s): Ian F. Akyildiz

      PubDate: 2018-02-25T17:23:52Z
      DOI: 10.1016/s1570-8705(18)30010-6
      Issue No: Vol. 70 (2018)
  • Efficient Medium Access Arbitration Among Interfering WBANs Using Latin
    • Authors: Mohamad Jaafar Ali; Hassine Moungla; Mohamed Younis; Ahmed Mehaoua
      Abstract: Publication date: Available online 13 April 2018
      Source:Ad Hoc Networks
      Author(s): Mohamad Jaafar Ali, Hassine Moungla, Mohamed Younis, Ahmed Mehaoua
      The overlap of transmission ranges among multiple Wireless Body Area Networks (WBANs) is referred to as coexistence. The interference is most likely to affect the communication links and degrade the performance when sensors of different WBANs simultaneously transmit using the same channel. In this paper, we propose a distributed approach that adapts to the size of the network, i.e., the number of coexisting WBANs, and to the density of sensors forming each individual WBAN in order to minimize the impact of co-channel interference through dynamic channel hopping based on Latin rectangles. Furthermore, the proposed approach opts to reduce the overhead resulting from channel hopping, and lowers the transmission delay, and saves the power resource at both sensor- and WBAN-levels. Specifically, we propose two schemes for channel allocation and medium access scheduling to diminish the probability of inter-WBAN interference. The first scheme, namely, Distributed Interference Avoidance using Latin rectangles (DAIL), assigns channel and time-slot combination that reduces the probability of medium access collision. DAIL suits crowded areas, e.g., high density of coexisting WBANs, and involves overhead due to frequent channel hopping at the WBAN coordinator and sensors. The second scheme, namely, CHIM, takes advantage of the relatively lower density of collocated WBANs to save power by hopping among channels only when interference is detected at the level of the individual nodes. We present an analytical model that derives the collision probability and network throughput. The performance of DAIL and CHIM is further validated through simulations.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.04.001
  • Sampling-based Selection-Decimation Deployment Approach for Large-scale
           Wireless Sensor Networks
    • Authors: M.R. Senouci; H.E. Lehtihet
      Abstract: Publication date: Available online 3 April 2018
      Source:Ad Hoc Networks
      Author(s): M.R. Senouci, H.E. Lehtihet
      Large-scale is one of the main tendencies for future wireless sensor networks. This paper considers the problem of deploying (very) large-scale wireless sensor networks in a way that guarantees preferential coverage of a region of interest. As this deployment problem is NP-complete, a weighted sampling scheme matching the requested detection probabilities is adopted in order to reduce the computation workload. The problem is then solved using a practical deployment approach based on a fast selection-decimation process that is easy to implement. The performance of the proposed approach is evaluated through extensive simulations and compared to several other deployment strategies. Results show that the proposed approach fully satisfies the user requirements, outperforms existing algorithms in terms of deployment cost while reducing dramatically the computation time. This reduction, which is scenario-dependent, is at least one order of magnitude but may exceed four orders of magnitude in large-scale scenarios.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.04.002
  • Localising crowds through Wi-Fi probes
    • Authors: Francesco Potortì; Antonino Crivello; Michele Girolami; Paolo Barsocchi; Emilia Traficante
      Abstract: Publication date: Available online 28 March 2018
      Source:Ad Hoc Networks
      Author(s): Francesco Potortì, Antonino Crivello, Michele Girolami, Paolo Barsocchi, Emilia Traficante
      Most of us carry mobile devices that routinely disseminate radio messages, as is the case with Wi-Fi scanning and Bluetooth beaconing. We investigate whether it is possible to examine these digital crumbs and have them reveal useful insight on the presence of people in indoor locations, as the literature lacks any answers on this topic. Wi-Fi probes are generated sparsely and often anonymised, which hinders the possibility of using them for targeted localisation or tracking. However, by experimenting in three different indoor environments, we demonstrate for the first time that it is possible to extract from them some positioning information. Possible applications include identifying frequented regions where many people are gathered together. In the described experimentation with sniffing devices we adopted fingerprinting interpolation, which requires no survey phase and automatically adapts to changes in the environment. The same process can be carried out using the Wi-Fi access points already installed in the environment, thus allowing for operation free of installation, surveying and maintenance.

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.03.011
  • Clustering Routing Based on Mixed Integer Programming for Heterogeneous
           Wireless Sensor Networks
    • Authors: Chunlin Li; Jingpan Bai; Jinguang Gu; Xin Yan; Youlong Luo
      Abstract: Publication date: Available online 5 February 2018
      Source:Ad Hoc Networks
      Author(s): Chunlin Li, Jingpan Bai, Jinguang Gu, Xin Yan, Youlong Luo
      Heterogeneous wireless sensor network has the advantages of completing complex communication tasks and is widely applied to military, medical, environmental, industrial and commercial, family life and so on. But heterogeneous nodes are expensive, it is necessary to consider how to balance the energy consumption and prolong network lifetime by deploying minimum number of heterogeneous nodes. In this paper, a clustering routing algorithm for heterogeneous wireless sensor network (CHRA) is presented to balance energy and prolong the network lifetime. The proposed routing algorithm computes the optimal number of heterogeneous nodes and selects the cluster heads per round. In CHRA, all common nodes are divided into two kinds. The first kind includes the nodes which transmit data to Sink by heterogeneous node and the others belong to the second kind. Furthermore, the common nodes are clustered per round by LEACH-C. The performance analysis and numerical results show that the proposed routing algorithm can availably prolong network lifetime and stable period. And it also can balance the energy consumption significantly.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2018.02.001
  • Exact Secrecy Throughput Capacity Study in Mobile Ad Hoc Networks
    • Authors: Xiaochen Li; Shuangrui Zhao; Yuanyu Zhang; Yulong Shen; Xiaohong Jiang
      Abstract: Publication date: Available online 1 February 2018
      Source:Ad Hoc Networks
      Author(s): Xiaochen Li, Shuangrui Zhao, Yuanyu Zhang, Yulong Shen, Xiaohong Jiang
      The secrecy throughput capacity (STC) performance study of mobile ad hoc networks (MANETs) is critical for supporting their applications in security-sensitive scenarios. Despite much work on the scaling law results of MANET STC, the exact STC study of such networks remains an open problem. This paper, for the first time, investigates the exact STC of a cell-partitioned MANET with group-based scheduling scheme from the physical layer (PHY) security perspective. We first propose two secure transmission schemes based on the PHY security technology, i.e., secrecy guard zone based and cooperative jamming based schemes. The secrecy guard zone based scheme allows transmissions to be conducted only if no eavesdroppers exist in the secrecy guard zone around transmitters. The cooperative jamming based scheme utilizes non-transmitting nodes to generate artificial noise to suppress eavesdroppers in the same cell, such that transmissions can be conducted only if all eavesdroppers in the transmission range are suppressed. We then derive exact analytical expressions for the STC performance of the concerned network under both secure transmission schemes based on the analysis of two basic secure transmission probabilities. Finally, extensive simulation and numerical results are provided to corroborate our theoretical analysis and also to illustrate the STC performance of the concerned MANET.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2018.01.012
  • Joint Virtual Edge-Clustering and Spectrum Allocation Scheme for Uplink
           Interference Mitigation in C-RAN
    • Authors: Abolfazl Hajisami; Dario Pompili
      Abstract: Publication date: Available online 31 January 2018
      Source:Ad Hoc Networks
      Author(s): Abolfazl Hajisami, Dario Pompili
      Fractional Frequency Reuse (FFR) and Coordinated MultiPoint (CoMP) processing are two of the conventional methods to mitigate the Inter-Cell Interference (ICI) and to improve the average Signal-to-Interference-plus-Noise Ratio (SINR). However, FFR is associated with low system spectral efficiency and CoMP does not take any action to mitigate the inter-cluster interference. In this article, we study the challenges and problems of the current interference management techniques and explain why the clustering and spectrum allocation must be studied jointly. Then, in the context of Cloud Radio Access Network (C-RAN), we propose a joint virtual clustering and spectrum allocation scheme, called Cloud-CFFR, to address such problems. With respect to both FFR and CoMP, Cloud-CFFR decreases the complexity, delay, and ICI while increasing the system spectral efficiency. Since the system performance in cell-edge regions relies on the cooperation of different Virtual Base Stations (VBSs), there is no service interruption in handling handovers; moreover, in order to address the unanticipated change in capacity demand, a flexible spectrum management technique is proposed which dynamically changes the subband boundaries based on the number of active users in the clusters. Simulation results confirm the validity of our analysis and show the benefits of this novel uplink solution compared to the traditional schemes.

      PubDate: 2018-02-05T13:56:10Z
      DOI: 10.1016/j.adhoc.2018.01.010
  • An enhanced authentication scheme in mobile RFID system
    • Authors: Shin-Yan Chiou; Shan-Yen Chang
      Pages: 1 - 13
      Abstract: Publication date: 15 March 2018
      Source:Ad Hoc Networks, Volume 71
      Author(s): Shin-Yan Chiou, Shan-Yen Chang
      The popularization of wireless networks and mobile applications has increased the importance of RFID technologies. However, since wireless networks does not guarantee transmission channel security, putting private user information at risk for unintentional disclosure. Previous research has introduced a security mechanism to provide privacy and authentication. This mechanism is based on quadratic residue, does not require a secure channel and fits EPC Class-1 Gen-2 specifications. However, this mechanism cannot resist replay attacks, and lacks an efficient means of its server is not able to find determining validating values, making it difficult to implement. This paper proposes an improvement scheme that uses virtual IDs and time parameters. It does not need a secure channel, fits EPC Class-1 Gen-2 specifications, is resistant to replay attacks, and can efficiently find validation information. The proposed scheme is applied to mobile devices as a proof of concept for use in wireless/mobile RFID systems.

      PubDate: 2017-12-27T02:05:31Z
      DOI: 10.1016/j.adhoc.2017.12.004
      Issue No: Vol. 71 (2017)
  • A scalable data dissemination protocol based on vehicles trajectories
    • Authors: Sabri Allani; Taoufik Yeferny; Richard Chbeir
      Pages: 31 - 44
      Abstract: Publication date: 15 March 2018
      Source:Ad Hoc Networks, Volume 71
      Author(s): Sabri Allani, Taoufik Yeferny, Richard Chbeir
      Since the last decade, the emergence of affordable wireless devices in vehicle ad-hoc networks has been a key step towards improving road safety as well as transport efficiency. Informing vehicles about interesting safety and non-safety events is of key interest. Thus, the design of an efficient data dissemination protocol has been of paramount importance. A careful scrutiny of the pioneering vehicle-to-vehicle data dissemination approaches highlights that geocasting is the most feasible approach for VANET applications, more especially in safety applications, since safety events are of interest mainly to vehicles located within a specific area, commonly called ZOR or Zone Of Relevance, close to the event. Indeed, the most challenging issue in geocast protocols is the definition of the ZOR for a given event dissemination. In this paper, we introduce a new geocast approach, called Data Dissemination Protocol based on Map Splitting (DPMS). The main thrust of DPMS consists of building the zones of relevance through the mining of correlations between vehicles’ trajectories and crossed regions. To do so, we rely on the Formal Concept Analysis (FCA), which is a method of extracting interesting clusters from relational data. The performed experiments show that DPMS outperforms its competitors in terms of effectiveness and efficiency.

      PubDate: 2017-12-27T02:05:31Z
      DOI: 10.1016/j.adhoc.2017.12.003
      Issue No: Vol. 71 (2017)
  • TROPHY: Trustworthy VANET routing with group authentication keys
    • Authors: Pedro Cirne; Susana Sargento
      Abstract: Publication date: Available online 20 December 2017
      Source:Ad Hoc Networks
      Author(s): Pedro Cirne, André Zúquete, Susana Sargento
      Vehicular Ad Hoc Networks (VANETs) are a specific case of ad hoc networks where most of the nodes are vehicles. VANETs have emerged in the last few years and are likely to play a major role in the future for a wide number of applications. Routing is essential for any ad hoc network, thus security strategies for protecting VANETs’ routing are critical. In this paper we present TROPHY (Trustworthy VANET ROuting with grouP autHentication keYs), a set of protocols to manage the authentication of routing messages in a VANET, under highly demanding time conditions, capable of protecting the distribution of routing information, considering the WAVE architecture and the patented routing approach, the Service-Based Layer-2 Routing Protocol. Authorised nodes recursively receive TROPHY messages that allow them to refresh their cryptographic material and keep authentication keys updated across the network. Those messages are epidemically distributed across the network and built such that any node pinpointed as lost or physically compromised will not be able to perform the refreshment using them (and so, are excluded from the routing process). Due to the use of a Key Distribution Centre (KDC), a central entity, where all the cryptographic material is stored, we included a mechanism to recover from any unauthorised physical access and disclosure of all such material at once, without requiring the need of human intervention on devices’ re-setup.

      PubDate: 2017-12-27T02:05:31Z
  • A Very Fast Tags Polling Protocol for Single and Multiple Readers RFID
           Systems, and its Applications
    • Authors: Maurizio A. Bonuccelli; Francesca Martelli
      Abstract: Publication date: Available online 12 December 2017
      Source:Ad Hoc Networks
      Author(s): Maurizio A. Bonuccelli, Francesca Martelli
      In this paper, we present a very fast and simple protocol for polling tags in an RFID system formed by one or more readers, and a multitude of tags. Actually, the protocol is time-optimal for single reader systems, while being very fast for multiple readers systems. The main idea of the protocol described in this paper, is to associate a short and unique number (called “nickname” in the following) to each tag in the reader’s range, and by using such nicknames as the polling order. We first describe the single reader version of the protocol. For this version, the used nicknames are the integers 1, 2, ..., n if the set of tags to be polled is formed by n tags. They can be seen as the time slot in which a tag has to communicate with the reader. We also provide a procedure to assign a nickname for a new tag, as well as a way to delete a tag from the polling order, while keeping the above consecutivity property about nicknames. When polled, the tags transmit a proper (usually short) message. Polling protocols, sometime with little changes, sometime with no change, can be efficiently used for solving several practical problems related to the use of RFID systems. Some of the most prominent ones, and those considered in this paper, are the problems of exactly determine missing tags, the collection of information associated to the tags, the probabilistic determination of missing tags (useful for raising a warning), and the determination of the presence of cloned tags, again for raising a proper warning. We formally show that the protocol is time-optimal. Besides, the protocol is privacy preserving since tags ID’s are never transmitted during the polling procedure. In the protocol version for large, multireader RFID systems, we take an approach completely different from that used so far for any multireader protocol. Up to now, in the proposed protocols for this and related problems, first readers are scheduled so that those with overlapping ranges never operate at the same time. Then, single reader protocol for each so scheduled reader are applied. Here, we schedule the tags instead of the readers so that tags whose transmission can be received by a common reader, never operate at the same time. Then, we show that our polling protocol for single reader systems can be effectively used along with such a tags scheduling strategy, in multireader systems. The time performance improvement of our protocol over the known ones for multireader systems is very large, going from two to seven times, as shown by a simulation experiment we set up, and whose results are also presented.

      PubDate: 2017-12-12T18:28:18Z
      DOI: 10.1016/j.adhoc.2017.12.002
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
Home (Search)
Subjects A-Z
Publishers A-Z
Your IP address:
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-