for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> COMPUTER SCIENCE (Total: 1985 journals)
    - ANIMATION AND SIMULATION (29 journals)
    - ARTIFICIAL INTELLIGENCE (98 journals)
    - AUTOMATION AND ROBOTICS (98 journals)
    - CLOUD COMPUTING AND NETWORKS (63 journals)
    - COMPUTER ARCHITECTURE (9 journals)
    - COMPUTER ENGINEERING (9 journals)
    - COMPUTER GAMES (16 journals)
    - COMPUTER PROGRAMMING (23 journals)
    - COMPUTER SCIENCE (1153 journals)
    - COMPUTER SECURITY (45 journals)
    - DATA BASE MANAGEMENT (13 journals)
    - DATA MINING (32 journals)
    - E-BUSINESS (22 journals)
    - E-LEARNING (27 journals)
    - ELECTRONIC DATA PROCESSING (21 journals)
    - IMAGE AND VIDEO PROCESSING (40 journals)
    - INFORMATION SYSTEMS (104 journals)
    - INTERNET (92 journals)
    - SOCIAL WEB (50 journals)
    - SOFTWARE (33 journals)
    - THEORY OF COMPUTING (8 journals)

COMPUTER SCIENCE (1153 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: 12)
Abakós     Open Access   (Followers: 3)
Academy of Information and Management Sciences Journal     Full-text available via subscription   (Followers: 67)
ACM Computing Surveys     Hybrid Journal   (Followers: 23)
ACM Journal on Computing and Cultural Heritage     Hybrid Journal   (Followers: 8)
ACM Journal on Emerging Technologies in Computing Systems     Hybrid Journal   (Followers: 13)
ACM Transactions on Accessible Computing (TACCESS)     Hybrid Journal   (Followers: 4)
ACM Transactions on Algorithms (TALG)     Hybrid Journal   (Followers: 16)
ACM Transactions on Applied Perception (TAP)     Hybrid Journal   (Followers: 6)
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: 11)
ACM Transactions on Computational Logic (TOCL)     Hybrid Journal   (Followers: 4)
ACM Transactions on Computer Systems (TOCS)     Hybrid Journal   (Followers: 18)
ACM Transactions on Computer-Human Interaction     Hybrid Journal   (Followers: 12)
ACM Transactions on Computing Education (TOCE)     Hybrid Journal   (Followers: 3)
ACM Transactions on Design Automation of Electronic Systems (TODAES)     Hybrid Journal   (Followers: 1)
ACM Transactions on Economics and Computation     Hybrid Journal  
ACM Transactions on Embedded Computing Systems (TECS)     Hybrid Journal   (Followers: 4)
ACM Transactions on Information Systems (TOIS)     Hybrid Journal   (Followers: 20)
ACM Transactions on Intelligent Systems and Technology (TIST)     Hybrid Journal   (Followers: 9)
ACM Transactions on Interactive Intelligent Systems (TiiS)     Hybrid Journal   (Followers: 4)
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)     Hybrid Journal   (Followers: 10)
ACM Transactions on Reconfigurable Technology and Systems (TRETS)     Hybrid Journal   (Followers: 7)
ACM Transactions on Sensor Networks (TOSN)     Hybrid Journal   (Followers: 8)
ACM Transactions on Speech and Language Processing (TSLP)     Hybrid Journal   (Followers: 11)
ACM Transactions on Storage     Hybrid Journal  
ACS Applied Materials & Interfaces     Full-text available via subscription   (Followers: 21)
Acta Automatica Sinica     Full-text available via subscription   (Followers: 3)
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: 26)
Advanced Science Letters     Full-text available via subscription   (Followers: 7)
Advances in Adaptive Data Analysis     Hybrid Journal   (Followers: 8)
Advances in Artificial Intelligence     Open Access   (Followers: 15)
Advances in Artificial Neural Systems     Open Access   (Followers: 4)
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: 15)
Advances in Computer Science : an International Journal     Open Access   (Followers: 13)
Advances in Computing     Open Access   (Followers: 3)
Advances in Data Analysis and Classification     Hybrid Journal   (Followers: 53)
Advances in Engineering Software     Hybrid Journal   (Followers: 25)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 10)
Advances in Human Factors/Ergonomics     Full-text available via subscription   (Followers: 25)
Advances in Human-Computer Interaction     Open Access   (Followers: 19)
Advances in Materials Sciences     Open Access   (Followers: 16)
Advances in Operations Research     Open Access   (Followers: 11)
Advances in Parallel Computing     Full-text available via subscription   (Followers: 7)
Advances in Porous Media     Full-text available via subscription   (Followers: 4)
Advances in Remote Sensing     Open Access   (Followers: 37)
Advances in Science and Research (ASR)     Open Access   (Followers: 6)
Advances in Technology Innovation     Open Access  
AEU - International Journal of Electronics and Communications     Hybrid Journal   (Followers: 8)
African Journal of Information and Communication     Open Access   (Followers: 6)
African Journal of Mathematics and Computer Science Research     Open Access   (Followers: 4)
Air, Soil & Water Research     Open Access   (Followers: 7)
AIS Transactions on Human-Computer Interaction     Open Access   (Followers: 6)
Algebras and Representation Theory     Hybrid Journal   (Followers: 1)
Algorithms     Open Access   (Followers: 10)
American Journal of Computational and Applied Mathematics     Open Access   (Followers: 3)
American Journal of Computational Mathematics     Open Access   (Followers: 4)
American Journal of Information Systems     Open Access   (Followers: 6)
American Journal of Sensor Technology     Open Access   (Followers: 2)
Anais da Academia Brasileira de Ciências     Open Access   (Followers: 2)
Analog Integrated Circuits and Signal Processing     Hybrid Journal   (Followers: 5)
Analysis in Theory and Applications     Hybrid Journal  
Animation Practice, Process & Production     Hybrid Journal   (Followers: 5)
Annals of Combinatorics     Hybrid Journal   (Followers: 3)
Annals of Data Science     Hybrid Journal   (Followers: 8)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 6)
Annals of Pure and Applied Logic     Open Access   (Followers: 2)
Annals of Software Engineering     Hybrid Journal   (Followers: 12)
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: 2)
Applied Artificial Intelligence: An International Journal     Hybrid Journal   (Followers: 14)
Applied Categorical Structures     Hybrid Journal   (Followers: 2)
Applied Clinical Informatics     Hybrid Journal   (Followers: 1)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 12)
Applied Computer Systems     Open Access   (Followers: 1)
Applied Informatics     Open Access  
Applied Mathematics and Computation     Hybrid Journal   (Followers: 32)
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)
Architectural Theory Review     Hybrid Journal   (Followers: 3)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 4)
Archive of Numerical Software     Open Access  
Archives and Museum Informatics     Hybrid Journal   (Followers: 122)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 4)
Artifact     Hybrid Journal   (Followers: 2)
Artificial Life     Hybrid Journal   (Followers: 5)
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  
Automatic Control and Computer Sciences     Hybrid Journal   (Followers: 3)
Automatic Documentation and Mathematical Linguistics     Hybrid Journal   (Followers: 5)
Automatica     Hybrid Journal   (Followers: 9)
Automation in Construction     Hybrid Journal   (Followers: 6)
Autonomous Mental Development, IEEE Transactions on     Hybrid Journal   (Followers: 8)
Basin Research     Hybrid Journal   (Followers: 4)
Behaviour & Information Technology     Hybrid Journal   (Followers: 52)
Bioinformatics     Hybrid Journal   (Followers: 293)
Biomedical Engineering     Hybrid Journal   (Followers: 16)
Biomedical Engineering and Computational Biology     Open Access   (Followers: 13)
Biomedical Engineering, IEEE Reviews in     Full-text available via subscription   (Followers: 17)
Biomedical Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 32)
Briefings in Bioinformatics     Hybrid Journal   (Followers: 45)
British Journal of Educational Technology     Hybrid Journal   (Followers: 119)
Broadcasting, IEEE Transactions on     Hybrid Journal   (Followers: 10)
c't Magazin fuer Computertechnik     Full-text available via subscription   (Followers: 2)
CALCOLO     Hybrid Journal  
Calphad     Hybrid Journal  
Canadian Journal of Electrical and Computer Engineering     Full-text available via subscription   (Followers: 13)
Catalysis in Industry     Hybrid Journal   (Followers: 1)
CEAS Space Journal     Hybrid Journal  
Cell Communication and Signaling     Open Access   (Followers: 1)
Central European Journal of Computer Science     Hybrid Journal   (Followers: 5)
CERN IdeaSquare Journal of Experimental Innovation     Open Access  
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 3)
Chemometrics and Intelligent Laboratory Systems     Hybrid Journal   (Followers: 15)
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: 12)
Circuits and Systems     Open Access   (Followers: 16)
Clean Air Journal     Full-text available via subscription   (Followers: 2)
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  
Combustion Theory and Modelling     Hybrid Journal   (Followers: 13)
Communication Methods and Measures     Hybrid Journal   (Followers: 11)
Communication Theory     Hybrid Journal   (Followers: 19)
Communications Engineer     Hybrid Journal   (Followers: 1)
Communications in Algebra     Hybrid Journal   (Followers: 3)
Communications in Partial Differential Equations     Hybrid Journal   (Followers: 3)
Communications of the ACM     Full-text available via subscription   (Followers: 53)
Communications of the Association for Information Systems     Open Access   (Followers: 18)
COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering     Hybrid Journal   (Followers: 3)
Complex & Intelligent Systems     Open Access  
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: 9)
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: 12)
Computational Chemistry     Open Access   (Followers: 2)
Computational Cognitive Science     Open Access   (Followers: 1)
Computational Complexity     Hybrid Journal   (Followers: 4)
Computational Condensed Matter     Open Access  
Computational Ecology and Software     Open Access   (Followers: 8)
Computational Economics     Hybrid Journal   (Followers: 9)
Computational Geosciences     Hybrid Journal   (Followers: 13)
Computational Linguistics     Open Access   (Followers: 23)
Computational Management Science     Hybrid Journal  
Computational Mathematics and Modeling     Hybrid Journal   (Followers: 8)
Computational Mechanics     Hybrid Journal   (Followers: 4)
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: 13)
Computational Statistics & Data Analysis     Hybrid Journal   (Followers: 28)
Computer     Full-text available via subscription   (Followers: 83)
Computer Aided Surgery     Hybrid Journal   (Followers: 3)
Computer Applications in Engineering Education     Hybrid Journal   (Followers: 6)
Computer Communications     Hybrid Journal   (Followers: 10)
Computer Engineering and Applications Journal     Open Access   (Followers: 5)
Computer Journal     Hybrid Journal   (Followers: 7)
Computer Methods in Applied Mechanics and Engineering     Hybrid Journal   (Followers: 22)
Computer Methods in Biomechanics and Biomedical Engineering     Hybrid Journal   (Followers: 10)
Computer Methods in the Geosciences     Full-text available via subscription   (Followers: 1)
Computer Music Journal     Hybrid Journal   (Followers: 14)
Computer Physics Communications     Hybrid Journal   (Followers: 6)
Computer Science - Research and Development     Hybrid Journal   (Followers: 7)
Computer Science and Engineering     Open Access   (Followers: 17)
Computer Science and Information Technology     Open Access   (Followers: 11)
Computer Science Education     Hybrid Journal   (Followers: 12)
Computer Science Journal     Open Access   (Followers: 20)

        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  [3042 journals]
  • An adaptive stabilizing imposter detection scheme for distributed mobile
           wireless sensor networks
    • Authors: Ebrahim A. Alrashed; Mehmet H. Karaata; Ali Hamdan; Badour Albahar
      Pages: 1 - 12
      Abstract: Publication date: October 2017
      Source:Ad Hoc Networks, Volume 65
      Author(s): Ebrahim A. Alrashed, Mehmet H. Karaata, Ali Hamdan, Badour Albahar
      Mobile wireless sensor networks (MWSNs) are wireless networks of small sensors moving around a certain coverage area relaying information among themselves and conveying their readings and data to base stations. Imposters are malicious nodes actively engaging other legitimate nodes in the network to read or inject wrong data. MWSN are susceptible to imposter attack and therefore, the protection of MWSN from imposter nodes placed by an adversary to contaminate the sensed data is essential for the reliability of its operation. Imposters detection algorithms need to be distributed in nature and therefore they are susceptible to variety of faults that can perturb the variables for algorithm and cause a major malfunction in the operation of the algorithm and subsequently the entire network if proper recovery mechanisms are not employed. The distributed nature of imposter detection schemes for WSN and the physical environment where the sensors are deployed require some approaches such as stabilization to deal with faults. A stabilizing distributed algorithm can withstand transient faults and start in an arbitrary initial configuration by eventually entering a legitimate system configuration regardless of the current system configuration. We view a fault as a transient fault if it affects the states of the system processes but not their program. In this paper, we propose an imposter detection scheme that can effectively deal with transient faults and arbitrary initialization. In addition, the proposed algorithm effectively adapts to the introduction and the removal of sensor nodes to/from the WSN which makes the proposed algorithm appropriate for practical sensor network applications. Other faults that can occur in the network and in the nodes are beyond the scope of this work.

      PubDate: 2017-07-24T04:41:55Z
      DOI: 10.1016/j.adhoc.2017.07.003
      Issue No: Vol. 65 (2017)
       
  • Recent advances in RF-based passive device-free localisation for indoor
           applications
    • Authors: Sameera Palipana; Bastien Pietropaoli; Dirk Pesch
      Pages: 80 - 98
      Abstract: Publication date: September 2017
      Source:Ad Hoc Networks, Volume 64
      Author(s): Sameera Palipana, Bastien Pietropaoli, Dirk Pesch
      Radio frequency (RF) based indoor localisation techniques have gained much attention over the past nearly three decades. Such techniques can be classified as active and passive while passive systems can have either device-assisted or device-free characteristics. Device-free localisation can be a prominent research field as it transcends other device-based approaches in certain application scenarios. Accordingly, we have witnessed an influx of IDFL research focusing on multiple disciplines including occupancy, positioning, activity and identity. However, despite the recent emergence of several exciting technologies and corresponding techniques, IDFL faces some important challenges and because of this, we haven’t come across many mainstream commercial products using RF-based IDFL techniques. In this article, we survey the recent progress of IDFL prioritising on indoor positioning. We decompose the localisation dimensions into occupants, space and time, provide a detailed taxonomy and a comprehensive review of these techniques. We divide the state of the art mainly into Wireless Network-based and Radar-based, evaluate the respective technologies and the techniques qualitatively, discuss trends, limitations and also indicate future research directions relevant to this field.

      PubDate: 2017-07-03T01:44:23Z
      DOI: 10.1016/j.adhoc.2017.06.007
      Issue No: Vol. 64 (2017)
       
  • Estimating the Medium Access Probability in Large Cognitive Radio Networks
    • Authors: Claudina Rattaro; Federico Larroca; Paola Bermolen; Pablo Belzarena
      Pages: 1 - 13
      Abstract: Publication date: Available online 20 May 2017
      Source:Ad Hoc Networks
      Author(s): Claudina Rattaro, Federico Larroca, Paola Bermolen, Pablo Belzarena
      During the last decade we have seen an explosive development of wireless technologies. Consequently the demand for electromagnetic spectrum has been growing dramatically resulting in the spectrum scarcity problem. In spite of this, spectrum utilization measurements have shown that licensed bands are vastly underutilized while unlicensed bands are too crowded. In this context, Cognitive Radio Network emerges as an auspicious paradigm in order to solve those problems. The main question that motivates this work is: what are the possibilities offered by cognitive radio to improve the effectiveness of spectrum utilization? With this in mind, we propose a methodology, based on configuration models for random graphs, to estimate the medium access probability of secondary users. We perform simulations to illustrate the accuracy of our results and we also make a performance comparison between our estimation and one obtained by a stochastic geometry approach.

      PubDate: 2017-05-22T12:52:34Z
      DOI: 10.1016/j.adhoc.2017.05.003
      Issue No: Vol. 63 (2017)
       
  • Analysis of Link Asymmetry in Virtual Multiple-Input-Single-Output (VMISO)
           Systems
    • Authors: Haejoon Jung; Mary Ann Weitnauer
      Pages: 20 - 29
      Abstract: Publication date: Available online 29 May 2017
      Source:Ad Hoc Networks
      Author(s): Haejoon Jung, Mary Ann Weitnauer
      Cooperative transmission (CT) is an effective technique to mitigate multi-path fading through spatial diversity. In CT, spatially separated wireless nodes collaborate to form a virtual multiple-input-single-output (VMISO) link, which provides signal-to-noise ratio advantage over the conventional single-input-single-output (SISO) communications. In this paper, we consider link asymmetry of the VMISO links between two neighboring CT clusters in wireless multi-hop networks. Link asymmetry is important because it impacts the performance of link and routing layer protocols. While most of the existing studies on CT simplify analysis on CT-based networks with co-located approximation that ignores disparate path losses in VMISO links by assuming co-located transmitting nodes, this paper presents the impact of disparate path losses on link asymmetry by allowing the relay locations to be random. Assuming exclusive signal detection by cluster heads, we identify two main causes of the VMISO link asymmetry, which do not appear in the conventional SISO-based networks: independent fading and path disparity. We evaluate the degree of link asymmetry in terms of three metrics: the power correlation, the power ratio, and the probability that the power gap is 3dB or higher. Also, the simulation results reveal how system parameters and channel conditions impact the VMISO link asymmetry.

      PubDate: 2017-06-01T17:35:40Z
      DOI: 10.1016/j.adhoc.2017.05.005
      Issue No: Vol. 63 (2017)
       
  • Location Based Transmission Using a Neighbour Aware with Optimized EIFS
           MAC for Ad Hoc Networks
    • Authors: Jims Marchang; Bogdan Ghita; David Lancaster
      Pages: 62 - 78
      Abstract: Publication date: Available online 3 June 2017
      Source:Ad Hoc Networks
      Author(s): Jims Marchang, Bogdan Ghita, David Lancaster
      In a typical Ad Hoc network, participating nodes have scarce shared bandwidth and limited battery life resources, so resource optimization and enhancing the overall network performance are the primary aims to maintain functionality. This paper proposes a new cross layer Medium Access Control (MAC) algorithm called Location Based Transmission using a Neighbour Aware with optimized Extended Inter-Frame Spacing (EIFS) for Ad Hoc Networks MAC (LBT-NA with optimized-EIFS MAC) that aims to reduce the transmission power when communicating with the next hop receiver based on node's location which is made available during node deployment. However, node mobility is not taken into account in the study of this paper. According to the algorithm the node dynamically adjusts its transmission power, if there is an active neighbour located beyond the communicating source and destination pair to avoid hidden nodes. The new protocol also defines an optimized EIFS when frame collision, frame error or frame capture takes place, in-order to maintain a fair channel access among the contending nodes. The proposed MAC also uses a modified range of random backoff values, based on the degree of contention unlike IEEE 802.11 series which uses a fixed random backoff value for fresh frames irrespective of the degree of contention. Simulation results indicate that in a random topology with a random source and destination, when the two sources are separated by a minimum distance of 200m, the performance gain of power controlled MAC over IEEE 802.11b ranges from 30% to 70% depending on the type of traffics in the network and the degree of fairness ranges from 62% to 99.99% for a location based MAC with minimum power transmission, whereas LBT-NA with optimized-EIFS MAC secures fairness index ranging from 75% to 99.99%. Communication with a node that is 20m away can save 40% of the battery life in comparison to the traditional transmission power MAC from 802.11b. The validation tests demonstrate that the proposed algorithm increases battery life and reduces the interference impact on shorter distance communication and increases the probability of parallel transmission. The proposed protocol also provides a scope for active nodes to transmit with a higher degree of probability, providing higher degree of overall network throughput in the environment and alleviate the starvation of hidden node by using Dynamic EIFS scheme.

      PubDate: 2017-06-06T18:59:33Z
      DOI: 10.1016/j.adhoc.2017.06.001
      Issue No: Vol. 63 (2017)
       
  • Improving charging capacity for wireless sensor networks by deploying one
           mobile vehicle with multiple removable chargers
    • Authors: Tao Zou; Wenzheng Xu; Weifa Liang; Jian Peng; Yiqiao Cai; Tian Wang
      Pages: 79 - 90
      Abstract: Publication date: August 2017
      Source:Ad Hoc Networks, Volume 63
      Author(s): Tao Zou, Wenzheng Xu, Weifa Liang, Jian Peng, Yiqiao Cai, Tian Wang
      Wireless energy transfer is a promising technology to prolong the lifetime of wireless sensor networks (WSNs), by employing charging vehicles to replenish energy to lifetime-critical sensors. Existing studies on sensor charging assumed that one or multiple charging vehicles being deployed. Such an assumption may have its limitation for a real sensor network. On one hand, it usually is insufficient to employ just one vehicle to charge many sensors in a large-scale sensor network due to the limited charging capacity of the vehicle or energy expirations of some sensors prior to the arrival of the charging vehicle. On the other hand, although the employment of multiple vehicles can significantly improve the charging capability, it is too costly in terms of the initial investment and maintenance costs on these vehicles. In this paper, we propose a novel charging model that a charging vehicle can carry multiple low-cost removable chargers and each charger is powered by a portable high-volume battery. When there are energy-critical sensors to be charged, the vehicle can carry the chargers to charge multiple sensors simultaneously, by placing one portable charger in the vicinity of one sensor. Under this novel charging model, we study the scheduling problem of the charging vehicle so that both the dead duration of sensors and the total travel distance of the mobile vehicle per tour are minimized. Since this problem is NP-hard, we instead propose a ( 3 + ϵ ) -approximation algorithm if the residual lifetime of each sensor can be ignored; otherwise, we devise a novel heuristic algorithm, where ϵ is a given constant with 0 < ϵ ≤ 1. Finally, we evaluate the performance of the proposed algorithms through experimental simulations. Experimental results show that the performance of the proposed algorithms are very promising.

      PubDate: 2017-06-11T19:30:02Z
      DOI: 10.1016/j.adhoc.2017.05.006
      Issue No: Vol. 63 (2017)
       
  • Predicting encounter and colocation events
    • Authors: Karim Karamat Jahromi; Matteo Zignani; Sabrina Gaito; Gian Paolo Rossi
      Pages: 11 - 21
      Abstract: Publication date: Available online 14 April 2017
      Source:Ad Hoc Networks
      Author(s): Karim Karamat Jahromi, Matteo Zignani, Sabrina Gaito, Gian Paolo Rossi
      Although an extensive literature has been devoted to mine and model mobility features, forecasting where, when and whom people will encounter/colocate still deserve further research efforts. Forecasting people’s encounter and colocation features is the key point for the success of many applications ranging from epidemiology to the design of new networking paradigms and services such as delay tolerant and opportunistic networks. While many algorithms which rely on both mobility and social information have been proposed, we propose a novel encounter and colocation predictive model which predicts user’s encounter and colocation events and their features by exploiting the spatio-temporal regularity in the history of these events. We adopt a weighted features Bayesian predictor and evaluate its accuracy on two large scales WiFi and cellular datasets. Results show that our approach could improve prediction accuracy w.r.t standard naïve Bayesian and some of the state of the art predictors.

      PubDate: 2017-04-18T20:27:05Z
      DOI: 10.1016/j.adhoc.2017.04.004
      Issue No: Vol. 62 (2017)
       
  • Cognitive Channel Selection and Scheduling for Multi-Channel Dynamic
           Spectrum Access Networks Considering QoS Levels
    • Authors: Gulnur Selda Uyanik; Sema Oktug
      Pages: 22 - 34
      Abstract: Publication date: Available online 12 April 2017
      Source:Ad Hoc Networks
      Author(s): Gulnur Selda Uyanik, Sema Oktug
      Dynamic spectrum access (DSA) networks are composed of unprivileged users, called secondary users (SUs), that utilize the spectrum opportunities produced by the absence of co-located privileged primary users (PUs) via their cognitive capabilities. Providing a certain level of quality of service (QoS) to these users is a very challenging problem whilst providing protection to licensed PUs and contenting with nearby SUs. Even though centralized solutions may lead to better solutions in terms of network efficiency, the dynamic nature of DSA networks make the distributed solution approaches more attractive. In this paper, we present a fast, distributed, PU temporal-activity-estimation-aided spectrum assignment scheme for a multi-channel DSA system, including several multi-interface capable SUs with traffic demands at differentiated QoS levels. We first developed the proposed cognitive channel selection method, considering a simplified network having single channel and investigated its performance. Second, considering multi-channel environment, along with contending multi-SUs each of which can utilize multiple channels using their multi-interface property, we adopted the designed algorithm and coupled the proposed spectrum selection scheme with a distributed spectrum sharing mechanism that we devised to increase the overall network utility further. We modeled our scheme along with the network model using MATLAB® and evaluated its performance via several simulations. The extensive simulations validate the effectiveness of the proposed channel assignment scheme in terms of the Figure of Merit we defined, composed of the weighted sum of the throughput ratio values for packets of different QoS levels that successfully reached at the destination. The results also show the superior performance of the proposed scheme with respect to a native scheme that utilizes every spectrum opportunity in favor of the most demanding traffic flow.

      PubDate: 2017-04-18T20:27:05Z
      DOI: 10.1016/j.adhoc.2017.04.003
      Issue No: Vol. 62 (2017)
       
  • Capacity and contention-based joint routing and gateway selection for
           machine-type communications
    • Authors: Muhammad Omer Farooq; Cormac J. Sreenan; Kenneth N. Brown
      Pages: 35 - 49
      Abstract: Publication date: July 2017
      Source:Ad Hoc Networks, Volume 62
      Author(s): Muhammad Omer Farooq, Cormac J. Sreenan, Kenneth N. Brown
      Typically, in machine-type communications (MTC) devices communicate with servers over the Internet. In a large-scale machine-to-machine area (M2M) network, the devices may not connect directly to the Internet due to radio transmission and energy limitations. Therefore, the devices collaborate wirelessly to relay their data to a gateway. A large-scale M2M area network may have multiple gateways, selecting a proper gateway for the devices can have immense impact on the network’s performance. We present the channel capacity and contention-based joint routing and gateway selection methods for MTC. Based on channel capacity and contention, our methods select the best gateway on per-packet, per-flow, and per-node basis. We compare the methods’ performance with existing methods using simulation and test-bed experiments. We analyse the impact of the number of gateways, physical distribution of transmitters, control overhead, and duty-cycling on the performance of the gateway selection methods. Our results demonstrate that, in duty-cycled operations, the methods’ performance depends on control overhead and making a good trade-off between load imbalance to different gateways and a forwarding path’s length. Otherwise only the latter impacts the methods’ performance. In general, our node-based best gateway selection method makes a better trade-off and exhibits lower control overhead, hence it demonstrates better performance. Moreover, our methods demonstrate better performance as compared to an existing state-of-the-art joint routing and gateway selection method.

      PubDate: 2017-04-25T20:56:08Z
      DOI: 10.1016/j.adhoc.2017.04.006
      Issue No: Vol. 62 (2017)
       
  • On the design of an embedded wireless sensor network for aircraft
           vibration monitoring using efficient game theoretic based MAC protocol
    • Authors: Dhouha Krichen; Walid Abdallah; Noureddine Boudriga
      Pages: 1 - 15
      Abstract: Publication date: June 2017
      Source:Ad Hoc Networks, Volume 61
      Author(s): Dhouha Krichen, Walid Abdallah, Noureddine Boudriga
      This paper presents the design of a wireless sensor network architecture suitable for monitoring vibration on an aircraft. The main objective is to improve the flight safety by detecting vibration intensity among all the components of the airplane structure and communicating this information to the cockpit computer to react before any component can reach resonance. Therefore, the study of sensor nodes deployment for specific types of airplanes and the definition of appropriate network topology are conducted. Furthermore, to enhance the responsiveness of the structural health monitoring system, a medium access protocol based on game theory was developed. The main idea is to adjust the wake time period of a sensor node according to the sensed vibration level. This parameter will be used to configure the game-based medium access protocol. The performance evaluation work shows that the proposed vibration and game-based communication scheme enhances the transmission efficiency as it reduces the packet loss and the average transmission delay.

      PubDate: 2017-03-22T10:55:15Z
      DOI: 10.1016/j.adhoc.2017.03.004
      Issue No: Vol. 61 (2017)
       
  • Bypassing holes in sensor networks: Load-balance vs. latency
    • Authors: Fan Zhou; Goce Trajcevski; Roberto Tamassia; Besim Avci; Ashfaq Khokhar; Peter Scheuermann
      Pages: 16 - 32
      Abstract: Publication date: June 2017
      Source:Ad Hoc Networks, Volume 61
      Author(s): Fan Zhou, Goce Trajcevski, Roberto Tamassia, Besim Avci, Ashfaq Khokhar, Peter Scheuermann
      This work addresses problems that arise when geographic routing is used in the presence of holes in wireless sensor networks. We postulate that relying on the existing algorithms for bypassing a coverage hole may cause more severe depletion of the energy reserves among the nodes at (or near) that hole’s boundary. This, in turn, will render some of those nodes useless for any routing (and/or sensing) purposes, thereby effectively enlarging the size of existing hole and inducing longer communication delays for certain (source, sink) pairs. We propose heuristics that address these complementary problems: (1) relieving some of the routing-load for the nodes around the boundary of a given hole, for the purpose of extending their lifetime; and (2) reducing the latency of the packets-delivery by using routes that are within certain bounds from the route based on the shortest-path. Our approaches are based on the idea that some of the packets that would (otherwise) need to be routed along the boundary of a given hole, should instead start to deviate from their original path further away from that hole. To investigate the potential benefits, we introduce approximations of the hole’s boundary with a rectangle, a circle and an ellipse, respectively. We derive the bounds on reducing the routing latency for these three approximations. Our experiments demonstrate that the proposed approaches not only increase the lifetime of the nodes along the boundary of a given hole and yield a more uniform depletion of the energy reserves in its vicinity, but also reduce the communication latency, compared to the traditional face routing.

      PubDate: 2017-03-22T10:55:15Z
      DOI: 10.1016/j.adhoc.2017.03.002
      Issue No: Vol. 61 (2017)
       
  • A survey of attacks and detection mechanisms on intelligent transportation
           systems: VANETs and IoV
    • Authors: Fatih Sakiz; Sevil Sen
      Pages: 33 - 50
      Abstract: Publication date: June 2017
      Source:Ad Hoc Networks, Volume 61
      Author(s): Fatih Sakiz, Sevil Sen
      Vehicular ad hoc networks (VANETs) have become one of the most promising and fastest growing subsets of mobile ad hoc networks (MANETs). They are comprised of smart vehicles and roadside units (RSU) which communicate through unreliable wireless media. By their very nature, they are very susceptible to attacks which may result in life-endangering situations. Due to the potential for serious consequences, it is vital to develop security mechanisms in order to detect such attacks against VANETs. This paper aims to survey such possible attacks and the corresponding detection mechanisms that are proposed in the literature. The attacks are classified and explained along with their effects, and the solutions are presented together with their advantages and disadvantages. An evaluation and summary table which provides a holistic view of the solutions surveyed is also presented.

      PubDate: 2017-03-28T11:44:45Z
      DOI: 10.1016/j.adhoc.2017.03.006
      Issue No: Vol. 61 (2017)
       
  • C-Sync: Counter-based synchronization for duty-cycled wireless sensor
           networks
    • Authors: Kok-Poh Ng; Charalampos Tsimenidis; Wai Lok Woo
      Pages: 51 - 64
      Abstract: Publication date: June 2017
      Source:Ad Hoc Networks, Volume 61
      Author(s): Kok-Poh Ng, Charalampos Tsimenidis, Wai Lok Woo
      Different variants of synchronous duty-cycle MAC protocols have been designed for wireless sensor networks to reduce energy consumption. However, the synchronization process of these protocols remains a significant contributor to the energy consumption. In this paper, a new energy-efficient synchronization algorithm referred to as C-Sync is proposed. C-Sync reduces energy consumption by adaptively regulating the synchronization traffic and synchronization wakeup period based on the changing network neighborhood conditions through counter-based and exponential-smoothing algorithms. Extensive simulations of multi-hop multi-neighborhood network scenarios are performed using ns-2. We compare C-Sync with the fixed periodic synchronization (F-Sync) algorithm and the 1-Sync algorithm and show that C-Sync outperforms F-Sync and 1-Sync in energy-efficiency over a wide range of node densities, drift rates and duty cycles.

      PubDate: 2017-03-28T11:44:45Z
      DOI: 10.1016/j.adhoc.2017.03.007
      Issue No: Vol. 61 (2017)
       
  • Optimized cost effective and energy efficient routing protocol for
           wireless body area networks
    • Authors: Navneet Kaur; Sukhwinder Singh
      Pages: 65 - 84
      Abstract: Publication date: June 2017
      Source:Ad Hoc Networks, Volume 61
      Author(s): Navneet Kaur, Sukhwinder Singh
      The increase in average lifespan and huge costs for health treatments have resulted in cost effective solutions for healthcare management. Wireless Body Area Network (WBAN) is a promising technology for delivering quality healthcare to its users. Low power devices attached to the body have limited battery life. It is desirable to have energy efficient routing protocols that maintain the required reliability value for sending the data from a given node to the sink. The current work proposes two protocols: Optimized Cost Effective and Energy Efficient Routing protocol (OCER) and Extended-OCER (E-OCER). In OCER, optimization using Genetic Algorithm (GA) is applied to the multi-objective cost function with residual energy, link reliability and path loss as its parameters for selecting the most optimal route from a given body coordinator to the sink. Distance between any two sensor nodes is reduced by applying multi-hop approach. E-OCER extends the work of OCER by considering inter-BAN communication. Performance of OCER is compared with other existing energy aware routing protocols by considering different parameters. A comparison of the performance of E-OCER with OCER is made to study the effect of on-body sensors communication on the energy consumption and throughput of the network. This paper also provides a comprehensive energy model to calculate the total energy consumption of the network. In addition to the radio transmission and receiving energy, other basic energy consumption sources viz. processing energy, sensor sensing, transient energy and transmission/reception on/off energy have also been taken into account. The results show an improved performance of the proposed protocols in terms of energy efficiency.

      PubDate: 2017-04-05T00:54:59Z
      DOI: 10.1016/j.adhoc.2017.03.008
      Issue No: Vol. 61 (2017)
       
  • Securing multi-channel selection using distributed trust in cognitive
           radio ad hoc networks
    • Authors: Jingyu Feng; Xu Du; Guanghua Zhang; Wei Shi
      Pages: 85 - 94
      Abstract: Publication date: June 2017
      Source:Ad Hoc Networks, Volume 61
      Author(s): Jingyu Feng, Xu Du, Guanghua Zhang, Wei Shi
      Cognitive radio ad hoc networks (CRAHNs) which are independent with infrastructure and fixed spectrum allocation policy, have been developed rapidly in the environment of scarce spectrum resources. However, the nature of multi-channel makes CRAHNs offers opportunities for malicious SUs. Cooperative spectrum sensing (CSS) is the key function of CRAHNs to identify the idle spectrum as the available channel by aggregating sensing data. Malicious SUs can launch spectrum sensing data falsification (SSDF) attack against CSS, and thus causing the disturbance of finding multi-channel. Recently, a lot of efforts with trust schemes have been paid to combating SSDF attack in central cognitive radio environments, but little attention to the distributed environments. In this paper, we propose a distributed trust evaluation (DTE) scheme from the perspective of direct experience and neighbor help to counter SSDF attack, which can be implemented at each SU in CRAHNs rather than a central authority. To secure multi-channel selection fully, it is very important to avoid the conflict among SUs for competing idle channels. We also design a distributed trust implementation protocol to manage CSS with the DTE scheme in a distributed manner. Simulation results show that our scheme can successfully suppress SSDF attack at a low cost, and thus ensure the security of multi-channel selection in CRAHNs.

      PubDate: 2017-04-05T00:54:59Z
      DOI: 10.1016/j.adhoc.2017.03.009
      Issue No: Vol. 61 (2017)
       
  • Comparison between TCP scheduling strategies in IEEE 802.11ac based
           wireless networks
    • Authors: Oran Sharon; Yaron Alpert
      Pages: 95 - 113
      Abstract: Publication date: June 2017
      Source:Ad Hoc Networks, Volume 61
      Author(s): Oran Sharon, Yaron Alpert
      In this paper we investigate two models for traffic transmission of two Transmission Control Protocol (TCP) connections with one connection in Uplink direction and the other in Downlink direction, between an Access Point and a station over an IEEE 802.11ac channel. In one model the traffic of the two connections is mapped to a single Traffic Stream, and in the second model the traffic of the two TCP connections is split into two different Traffic Streams. We assume Error-Free and Error-Prone channels, the Two-Level aggregation method and the Reverse Direction capability of IEEE 802.11ac. The Goodput of the two models is about the same, however, in the first model shorter dedicated transmission periods, denoted Transmission Opportunities (TXOP), are sufficient to achieve the optimal Goodput because TCP Acks are interleaved. Also, using Reverse Direction prevents collisions and improves the Goodput by 10 − 15 % over contension based access.

      PubDate: 2017-04-05T00:54:59Z
      DOI: 10.1016/j.adhoc.2017.02.009
      Issue No: Vol. 61 (2017)
       
  • Distributed resource allocation in D2D communication networks with energy
           harvesting relays using stable matching
    • Authors: S. Kishk; N.H. Almofari; F.W. Zaki
      Pages: 114 - 123
      Abstract: Publication date: June 2017
      Source:Ad Hoc Networks, Volume 61
      Author(s): S. Kishk, N.H. Almofari, F.W. Zaki
      Fifth Generation (5G) cellular networks are expected to provide high data rates by using emerging technologies such as multi-tier heterogeneous networks, Device to Device (D2D) communication and densification of small base stations. D2D uses direct transmission between two cellular devices to increase the system throughput. Relays are used to reduce the loss in user data rate when the D2D users are far from each other and the relay nodes are used to serve the cellular users when the channel is not good enough. To get good performance from D2D relay assisted network, suitable, robust and low complexity resource allocation algorithm must be used. In this paper, an algorithm for user association, resource blocks allocation and power control when considering the energy harvesting relays in heterogeneous multi-tier network is presented. This paper introduces a centralized solution using time sharing strategy and a distributed low complexity solution using stable matching theory.

      PubDate: 2017-04-05T00:54:59Z
      DOI: 10.1016/j.adhoc.2017.03.010
      Issue No: Vol. 61 (2017)
       
  • Multi-hop consensus time synchronization algorithm for sparse wireless
           sensor network: A distributed constraint-based dynamic programming
           approach
    • Authors: Niranjan Panigrahi; Pabitra Mohan Khilar
      Pages: 124 - 138
      Abstract: Publication date: June 2017
      Source:Ad Hoc Networks, Volume 61
      Author(s): Niranjan Panigrahi, Pabitra Mohan Khilar
      The recent consensus time synchronization algorithms designed for Wireless Sensor Networks (WSNs) are mostly one-hop in nature, i.e., every node communicates with its one-hop neighbors and performs clock parameters averaging to reach to the consensus or synchronized state. As per consensus theory, apart from the averaging scheme employed by the consensus algorithm, another factor that affects the consensus-based algorithms’ performance is the topological connectivity of the networks. In topologies of lower degree of connectivity like sparse network, these one-hop consensus synchronization algorithms have exhibited poor performance in terms of convergence speed and synchronization accuracy. This motivates the design of multi-hop consensus time synchronization algorithm for sparse WSNs. In this paper, we have proposed a multi-hop consensus time synchronization algorithm, multi-hop Selective Average Time Synchronization (SATS), for sparse and multi-hop WSNs. A distributed, constraint-based dynamic programming approach is suggested for multi-hop clock parameters estimation. Simulation results show that the proposed algorithm outperforms some recent, state-of-the-art one-hop consensus time synchronization algorithms within a restricted hop count.

      PubDate: 2017-04-12T01:46:59Z
      DOI: 10.1016/j.adhoc.2017.04.002
      Issue No: Vol. 61 (2017)
       
  • Wireless charging for weighted energy balance in populations of mobile
           peers
    • Authors: Sotiris Nikoletseas; Theofanis P. Raptis; Christoforos Raptopoulos
      Pages: 1 - 10
      Abstract: Publication date: 15 May 2017
      Source:Ad Hoc Networks, Volume 60
      Author(s): Sotiris Nikoletseas, Theofanis P. Raptis, Christoforos Raptopoulos
      Wireless energy transfer is an emerging technology that is used in networks of battery-powered devices in order to deliver energy and keep the network functional. Existing state-of-the-art studies have mainly focused on applying this technology on networks of relatively strong computational and communicational capabilities (wireless sensor networks, ad-hoc networks); also they assume energy transfer from special chargers to regular network nodes. Different from these works, we study how to efficiently transfer energy wirelessly in populations of battery-limited devices, towards prolonging their lifetime. In contrast to the state-of-the-art, we assume a much weaker population of distributed devices which are exchanging energy in a “peer to peer” manner with each other, without any special charger nodes. We address a quite general case of diverse energy levels and priorities in the network and study the problem of how the system can efficiently reach a weighted energy balance state distributively, under both loss-less and lossy power transfer assumptions. Three protocols are designed, analyzed and evaluated, achieving different performance trade-offs between energy balance quality, convergence time and energy efficiency.

      PubDate: 2017-03-10T09:51:34Z
      DOI: 10.1016/j.adhoc.2017.03.005
      Issue No: Vol. 60 (2017)
       
  • Probability-based prediction query algorithm
    • Authors: Yushuang Yan; Qingqi Pei; Xiang Wang; Yong Wang
      Pages: 52 - 65
      Abstract: Publication date: 15 May 2017
      Source:Ad Hoc Networks, Volume 60
      Author(s): Yushuang Yan, Qingqi Pei, Xiang Wang, Yong Wang
      Advances in wireless communication and ubiquitous mobile networks have resulted in location-based services (LBSs) contributing significantly to entertainment services for mobile users by utilizing their location data. However, for the request of a mobile user with a limited time frame, such as “where is the gas station nearest to me? The anonymous server should return the optimal result to me within a few minutes,” the anonymous server immediately generates the cloaking region based on the user’s current location information and the k-anonymity requirement privacy level to ensure location privacy protection when receiving the LBS request in most existing approaches. Unfortunately, mobility by the mobile user could cause the smaller cloaking region generated by the server. The existing algorithm would return the sub-optimal cloaking region. This problem prompted us to develop a novel probability-based prediction query (PBPQ) algorithm. On the server side, our method firstly predicts the probability of the mobile user being on each road, followed the final probability of the user entering the cloaking region. Our proposed algorithm can generate the optimal cloaking region generated within the limited time required by users. The experimental results show that our PBPQ algorithm can predict the optimal cloaking region effectively at the highly successful rate of more than 90%. Thus, the PBPQ algorithm can decrease the size of the cloaking region considerably while maintaining good QoS.

      PubDate: 2017-03-17T10:45:31Z
      DOI: 10.1016/j.adhoc.2017.02.008
      Issue No: Vol. 60 (2017)
       
  • A convex optimization model for topology control in
           network-coding-based-wireless-sensor networks
    • Authors: M. Khalily-Dermany; M. Shamsi; M.J. Nadjafi-Arani
      Pages: 1 - 11
      Abstract: Publication date: 1 May 2017
      Source:Ad Hoc Networks, Volume 59
      Author(s): M. Khalily-Dermany, M. Shamsi, M.J. Nadjafi-Arani
      The energy consumption is one of the most common issues in the Wireless Sensor Networks (WSNs). Since the communication usually accounts as a major power consumption, there is some techniques, such as topology control and network coding, to decrease the activity of sensors’ transceivers. If we utilize the techniques synchronously, then may overall performance do not increase as expected. This paper provides an optimization problem for energy consumption in WSNs, where the network employs both topology control and network-coding-based multi-cast simultaneously. This approach improves overall performance in comparison with employing them distinctly. The proposed optimization problem is transformed into a convex problem which leads to a numerous theoretical and conceptual advantages. Then the Karush-Kuhn-Tucker (KKT) optimality conditions are presented to derive analytical expressions of the globally optimal solution. Simulation results show that the proposed approach decrease end-to-end delay and has a significantly lower energy consumption than conventional ones.

      PubDate: 2017-03-17T10:45:31Z
      DOI: 10.1016/j.adhoc.2016.12.010
      Issue No: Vol. 59 (2017)
       
  • Cooperative Resynchronization to Improve the Reliability of Colocated
           IEEE 802.15.4 -TSCH Networks in Dense Deployments
    • Authors: Sahar Ben Yaala; Fabrice Théoleyre; Ridha Bouallegue
      Abstract: Publication date: Available online 11 July 2017
      Source:Ad Hoc Networks
      Author(s): Sahar Ben Yaala, Fabrice Théoleyre, Ridha Bouallegue
      With the large adoption of small and smart objects, the interest of researchers to define new protocols to meet Internet of Things (IoT) requirements is growing. In particular, the Industrial Internet of Things (IIoT) aims to provide high reliability and upper bounded end-to-end latency while interconnecting a large collection of sensors and actuators. The TimeSlotted Channel Hopping (TSCH) mode of IEEE 802.15.4 exploits a slow channel hopping approach to combat efficiently external interference (e.g. Wi-Fi, Bluetooth). We envision in the future very dense deployments and we investigate here the mutual influence among different colocated TSCH networks. We first study analytically with a simple model the performance of several TSCH networks, able or not to be synchronized with each other. We emphasize the multiplication of collisions, exacerbated by clock drifts when no cooperation is achieved. We also highlight experimentally that a mutual synchronization improves very significantly the reliability. We propose here a mechanism to re-synchronize distributively the border routers of different TSCH networks. Our thorough experimental evaluation illustrates the relevance of our approach, able to guarantee high-reliability, even in very dense topologies.

      PubDate: 2017-07-12T02:45:45Z
      DOI: 10.1016/j.adhoc.2017.07.002
       
  • On the performance of adaptive coding schemes for energy efficient and
           reliable clustered wireless sensor networks
    • Authors: Imad Ez-zazi; Mounir Arioua; Ahmed El Oualkadi; Pascal Lorenz
      Abstract: Publication date: Available online 8 July 2017
      Source:Ad Hoc Networks
      Author(s): Imad Ez-zazi, Mounir Arioua, Ahmed El Oualkadi, Pascal Lorenz
      Clustering is the key for energy constrained wireless sensor networks (WSNs). Energy optimization and communication reliability are the most important consideration in designing efficient clustered WSN. In lossy environment, channel coding is mandatory to ensure reliable and efficient communication. This reliability is compromised by additional energy of coding and decoding in cluster heads. In this paper, we investigated the trade-off between reliability and energy efficiency and proposed adaptive FEC/FWD and FEC/ARQ coding frameworks for clustered WSNs. The proposed schemes consider channel condition and inter-node distance to decide the adequate channel coding usage. Simulation results show that both the proposed frameworks are energy efficient compared to ARQ schemes and FEC schemes, and suitable to prolong the clustered network lifespan as well as improve the reliability.

      PubDate: 2017-07-12T02:45:45Z
      DOI: 10.1016/j.adhoc.2017.07.001
       
  • PACK: Path Coloring based k-Connectivity Detection Algorithm for Wireless
           Sensor Networks
    • Authors: Orhan Dagdeviren; Vahid Khalilpour Akram
      Abstract: Publication date: Available online 21 June 2017
      Source:Ad Hoc Networks
      Author(s): Orhan Dagdeviren, Vahid Khalilpour Akram
      A k-connected wireless sensor network (WSN) can tolerate failures on k-1 arbitrary nodes without loosing the connectivity between the remaining active nodes. Hence, the k value is one of the useful benchmarks that can help to measure the network reliability. Given that the nodes in a k-connected network has at least k disjoint paths to each other, we propose the path coloring based k -connectivity detection algorithm (PACK) that finds the k by counting the disjoint paths between the sink and all other nodes. The proposed algorithm has two Detection and Notification phases. In the Detection phase, all nodes find their disjoint paths to the sink and in the Notification phase the minimum detected path count, which determines the global k, is sent to the sink node. We theoretically prove that the detection range of our proposed algorithm is better than the existing distributed algorithms and uses fixed length messages with O(nΔlog 2 n) bit complexity and O(n) time complexity where n is the number of nodes and Δ is the maximum node degree. According to the comprehensive simulation results, the average correct detection ratio of proposed algorithm is more than 91% which is at least 2.3 times higher than the existing algorithms.

      PubDate: 2017-06-21T21:25:23Z
      DOI: 10.1016/j.adhoc.2017.06.005
       
  • A Distributed Multi-path Routing Algorithm to Balance Energy Consumption
           in Wireless Sensor Networks
    • Authors: A. Laouid; A. Dahmani; A. Bounceur; R. Euler; F. Lalem; A. Tari
      Abstract: Publication date: Available online 21 June 2017
      Source:Ad Hoc Networks
      Author(s): A. Laouid, A. Dahmani, A. Bounceur, R. Euler, F. Lalem, A. Tari
      A large use of applications of Wireless Sensor Networks (WSNs) pushes researchers to design and improve protocols and algorithms against the encountered challenges. One of the main goals is data gathering and routing to the base station (through the sink nodes) with lack of acknowledgement and where each node has no information about the network. Unbalanced energy consumption during the data routing process is an inherent problem in WSNs due to the limited energy capacity of the sensor nodes. In fact, WSNs require load balancing algorithms that make judicious use of the limited energy resource to route the gathered data to the sink node. In this paper, we propose a balanced multi-path routing algorithm by focusing on the residual energy and the hop count of each node to discover the best routes and to insert them into the routing table. The main idea of this algorithm comes from Ant Colony Optimization (ACO) and automata network modelization. Hence, the potential performance of the proposed algorithm relies on the best route to be selected which should have the minimum number of hops, the maximum energy and weighted energy between participating nodes to extend the lifetime of the network.

      PubDate: 2017-06-21T21:25:23Z
      DOI: 10.1016/j.adhoc.2017.06.006
       
  • Cost-Effective Barrier Coverage Formation in Heterogeneous Wireless Sensor
           Networks
    • Authors: Zhibo Wang; Qing Cao; Hairong Qi; Honglong Chen; Qian Wang
      Abstract: Publication date: Available online 20 June 2017
      Source:Ad Hoc Networks
      Author(s): Zhibo Wang, Qing Cao, Hairong Qi, Honglong Chen, Qian Wang
      Barrier coverage is a critical issue in wireless sensor networks (WSNs) for security applications, which however cannot be guaranteed to be formed after initial random deployment of sensors. Existing work on barrier coverage mainly focus on homogeneous WSNs, while little effort has been made on exploiting barrier coverage formation in heterogeneous WSNs where different types of sensors are deployed with different sensing models and costs. In this paper, we study how to efficiently form barrier coverage by leveraging multiple types of mobile sensors to fill in gaps between pre-deployed stationary sensors in heterogeneous WSNs. The stationary sensors are grouped into clusters and a cluster-based directional barrier graph is proposed to model the barrier coverage formation problem. We prove that the minimum cost of mobile sensors required to form a barrier with stationary sensors is the length of the shortest path on the graph. Moreover, we propose a greedy movement algorithm for heterogeneous WSNs to efficiently schedule different types of mobile sensors to different gaps while minimizing the total moving cost. In particular, we formulate the movement problem for homogeneous WSNs as a minimum cost bipartite assignment problem, and solve it in polynomial time using the Hungarian algorithm. Extensively experimental results on homogeneous and heterogeneous WSNs demonstrate the effectiveness of the proposed algorithms.

      PubDate: 2017-06-21T21:25:23Z
      DOI: 10.1016/j.adhoc.2017.06.004
       
  • Lightweight and Efficient Privacy-Preserving Data Aggregation Approach for
           the Smart Grid
    • Authors: Mohamad Badra; Sherali Zeadally
      Abstract: Publication date: Available online 16 June 2017
      Source:Ad Hoc Networks
      Author(s): Mohamad Badra, Sherali Zeadally
      – Over the last few years, we have seen the emergence of a wide range of Smart Grid architectures, technologies, and applications made possible by the significant improvements in hardware, software, and networking technologies. One of the challenges that has emerged in the Smart Grid environment is the privacy of Smart Grid users. Although several privacy-preserving techniques have been proposed recently for the Smart Grid environment, many of them suffer from high computation and communication costs, different types of attacks, and the use of complex key management schemes. To address these drawbacks, we propose an efficient, lightweight privacy-preserving data aggregation approach that makes use of symmetric homomorphic encryption and Diffie-Hellman (DH) or Elliptic Curve Diffie-Hellman (ECDH) key exchange methods. In contrast to previously proposed privacy-preserving schemes for the Smart Grid, we demonstrate the superiority of our proposed approach in terms of its low transmission and message overheads, and resiliency against a wide range of session key attacks, and ability to maintain data integrity against unauthorized modification or data forgery and to ensure authenticity of smart meters’ data.

      PubDate: 2017-06-16T20:23:58Z
       
  • Location-aware Interest-related Micro-cloud Topology Construction and
           Bacteria Foraging-based Offloading Strategy
    • Authors: Li Chunlin; Zhu Liye; Luo Youlong
      Abstract: Publication date: Available online 15 June 2017
      Source:Ad Hoc Networks
      Author(s): Li Chunlin, Zhu Liye, Luo Youlong
      Micro-cloud, as one kind of mobile cloud computing modes, can reduce network delay and alleviate resource constraint of mobile devices. In this mode, mobile devices use their idle resources to provide services for others. Due to the mobility, irregularity of mobile devices, the stability problem of micro-cloud environment still remains challenging. In order to increase the stability of micro-cloud and decrease network delay, the interest-related and location-aware micro-cloud topology is proposed in this paper. The interest-related mobile device nodes are classified into the same micro-cloud which can raise the probability of resource reuse. For reducing failed requests and enhancing the scalability of micro-cloud topology, both node location and node service capacity are considered. Moreover, the bacteria foraging-based offloading algorithm for interest-related micro-cloud topology is proposed, which is an energy-efficient and response time constraint offloading approach. The experiments are conducted and the experiment results show that the location-aware interest-related micro-cloud topology has better stability and scalability, while the bacteria foraging-based offloading algorithm performs better in terms of reducing response time and energy.

      PubDate: 2017-06-16T20:23:58Z
      DOI: 10.1016/j.adhoc.2017.06.002
       
  • On the using of discrete wavelet transform for physical layer key
           generation
    • Authors: Furui Zhan; Nianmin Yao
      Abstract: Publication date: Available online 15 June 2017
      Source:Ad Hoc Networks
      Author(s): Furui Zhan, Nianmin Yao
      For key generation between wireless transceivers, key generation leveraging channel reciprocity is a promising alternative to public key cryptography. Several existing schemes have validated its feasibility in real environments. However, in some scenarios, channel measurements collected by the involved transceivers are highly correlated but not identical, i.e., measurement sequences of these transceivers have too many discrepancies, which makes it difficult to extract the shared key from these measurements. In this paper, we propose a scheme to achieve secret key generation from wireless channels. During the proposed scheme, to reduce the amount of the referred discrepancies and further achieve efficient key generation, the involved transceivers separately apply a compressor based on the discrete wavelet transform (DWT) to pre-process their measurements. Then, multi-level quantization is implemented to quantify the output of DWT-based compressor. An encoding scheme based on gray code is employed to establish bit sequence and ensure that the resulting bit mismatch rate can be further reduced so that efficient information reconciliation can be implemented. Accordingly, the shared key between these transceivers can be derived after information reconciliation. Finally, 2-universal hash functions are used to guarantee the randomness of the shared secret key. Several experiments in real environments are conducted to validate the proposed scheme. The results demonstrate that the proposed scheme is available to generate secret keys between transceivers even though their measurement sequences have too many discrepancies.

      PubDate: 2017-06-16T20:23:58Z
      DOI: 10.1016/j.adhoc.2017.06.003
       
  • Multi-constraints Link Stable Multicast Routing Protocol in MANETs
    • Authors: Gaurav Singal; Vijay Laxmi; M.S. Gaur; Swati Todi; Vijay Rao; Meenakshi Tripathi; Riti Kushwaha
      Abstract: Publication date: Available online 8 June 2017
      Source:Ad Hoc Networks
      Author(s): Gaurav Singal, Vijay Laxmi, M.S. Gaur, Swati Todi, Vijay Rao, Meenakshi Tripathi, Riti Kushwaha
      In MANETs, real-time multimedia applications make Quality of Service (QoS) support, a crucial issue regarding terms of increased throughput, reduced jitter, and available bandwidth. Most of the existing routing protocols focus on straight forward hop-count metric and are less adaptable to densely distributed and highly mobile networks. Therefore, Multicast communication with QoS in densely populated highly dynamic network an exciting research challenges. The objective of the present paper is to introduce a QoS aware routing metric that determines a reliable forwarding node based on Link Stability cost Function (LSF). A mesh of Multicast routes between Multicast source and destinations has been established using nodes with a maximum LSF. The principle theme underlying our protocol is optimum contention count that can be estimated with the help of received signal strength. The proposed protocol comprises the following stages:(1) Calculation of Link Stability Factor (2) Determination of maximum LSF value (3) Pruning adjacent nodes (4) Creation of a mesh consisting of more stable forwarding nodes (5) Creation of a mobile network in which no node remains isolated, as well as nodes, face lesser contention. Our proposed protocol has been demonstrated on an existing mesh-based Multicast routing protocols, ODMRP. Simulations are carried out on Exata/Cyber simulator, and obtained results are compared with that of ODMRP. The comparative analysis reveals that our protocol is more efficient in contrast to ODMRP, LSMRP, and MMRNS, regarding performance parameters like Packet Delivery Ratio (PDR), Average End-to-End Latency and Average Route Lifetime. Also, we have analyzed the impact of minimum and maximum contention count on PDR and delay.

      PubDate: 2017-06-11T19:30:02Z
      DOI: 10.1016/j.adhoc.2017.05.007
       
  • Lightweight Power Control for Energy–Utility Optimization in
           Wireless Networks
    • Authors: Konstantinos P. Tsoukatos; Anastasios Giannoulis
      Abstract: Publication date: Available online 7 June 2017
      Source:Ad Hoc Networks
      Author(s): Konstantinos P. Tsoukatos, Anastasios Giannoulis
      We consider an interference-limited, ad-hoc wireless network in the high SINR regime and address the optimization of network utility and energy efficiency by cross–layer network control. Unlike the typical complex approach that requires solving a scheduling, routing and power control problem at each time slot, we propose running a single iteration of a gradient power control algorithm towards the optimal power allocation, together with backpressure multipath routing and flow control. Despite the fact that the respective optimizations at each time slot are never fully solved, we prove, under a high SINR assumption, that the proposed updates suffice to optimize network utility and energy efficiency. Main components of the joint algorithm are flow control at each node (based on local queues), backpressure routing/scheduling, and power control driven by backlog, interference, and power cost related information. We provide simulation results that illustrate the convergence to the optimal flow rates and link powers, compare against related algorithms from the literature, and examine the validity of the high SINR approximation. Our approach may allow in-practice performance gains and inspire more research on low-complexity, practical network control.

      PubDate: 2017-06-11T19:30:02Z
      DOI: 10.1016/j.adhoc.2017.05.010
       
  • Channel Quality Aware Cross-Layer Design based Rate Adaptive MAC for
           Improving the Throughput Capacity of Multi-hop Ad hoc Networks
    • Authors: Prasanna J. Shete; R.N. Awale; Satish Y. Ket
      Abstract: Publication date: Available online 30 May 2017
      Source:Ad Hoc Networks
      Author(s): Prasanna J. Shete, R.N. Awale, Satish Y. Ket
      In this paper we address the goal of achieving higher throughput capacity in multi-hop wireless ad hoc networks than estimated by capacity scaling laws of [Gupta and Kumar, 2000]. By exploiting the implications pointed in earlier research, a cross-layer design based channel quality aware rate adaptive MAC algorithm CQRA-MAC is proposed to achieve this goal. CQRA-MAC dynamically switches the MAC transmission rate on the basis of channel quality experienced at the physical layer. The proposed algorithm is implemented by modifying the IEEE 802.11 model of Qualnet 4.5 simulator and its performance is evaluated in static and mobile network scenarios following the random access transport capacity approach. Experimental results show that CQRA-MAC achieves higher throughput than DCF and ARF. The achieved throughput capacity is quantified in terms of measurable network parameters and thus validates equations of random access transport capacity framework [Andrews, Weber, Kountouris and Haenggi, 2010].

      PubDate: 2017-06-01T17:35:40Z
      DOI: 10.1016/j.adhoc.2017.05.009
       
  • An Efficient Protocol for Load-Balanced Multipath Routing in Mobile Ad Hoc
           Networks
    • Authors: Ansuman Bhattacharya; Koushik Sinha
      Abstract: Publication date: Available online 30 May 2017
      Source:Ad Hoc Networks
      Author(s): Ansuman Bhattacharya, Koushik Sinha
      In this paper, we propose a new routing protocol called the Least Common Multiple based Routing (LCMR) for load-balanced multipath routing in Mobile Ad hoc NETworks (MANETs). First, we find multiple paths between a source to a destination, when those exist, along with the estimates of the time to route a packet along each of these paths. The data packets originating from the source to the destination are then distributed along these multiple paths in such a way that the number of data packets sent along any such path is inversely proportional to the routing time through this path. This distribution strategy keeps the load balanced along all the paths so that the overall routing time for sending the data packets is minimized. Routes between a given source-destination pair are discovered in a way similar to that in the Ad hoc On-demand Distance Vector (AODV) routing protocol with the difference that instead of the number of hops, the routing time for reaching the destination along every route is measured, and multiple routes, if those exist, will also be determined by the route discovery process. Our proposed technique for distribution of packets along different routes is very elegant with a better performance than the existing load-balanced routing protocols like Fibonacci Multipath Load Balancing (FMLB) and Multiple AODV (MAODV), as established from a theoretical analysis as well as through simulation results.

      PubDate: 2017-06-01T17:35:40Z
      DOI: 10.1016/j.adhoc.2017.05.008
       
  • A New Maximum Fault-tolerance Barrier-coverage Problem in Hybrid Sensor
           Network and Its Polynomial Time Exact Algorithm
    • Authors: Donghyun Kim; Yeojin Kim; Deying Li; Jungtaek Seo
      Abstract: Publication date: Available online 22 May 2017
      Source:Ad Hoc Networks
      Author(s): Donghyun Kim, Yeojin Kim, Deying Li, Jungtaek Seo
      This paper introduces a new maximum fault-tolerance barrier-coverage problem in hybrid sensor network, which consists of a number of both static ground sensors and fully-controllable mobile sensors. The problem aims to relocate the mobile sensor nodes so that the fault-tolerance of the barrier-coverage of the hybrid sensor network is maximized. The main contribution of this paper is the polynomial time exact algorithm for this new problem.

      PubDate: 2017-05-22T12:52:34Z
      DOI: 10.1016/j.adhoc.2017.05.004
       
  • Reliable Data Dissemination Protocol for VANET Traffic Safety Applications
    • Authors: Renê Oliveira; Carlos Montez; Azzedine Boukerche; Michelle S. Wangham
      Abstract: Publication date: Available online 19 May 2017
      Source:Ad Hoc Networks
      Author(s): Renê Oliveira, Carlos Montez, Azzedine Boukerche, Michelle S. Wangham
      In vehicular ad hoc networks (VANETs), cooperation between nodes is needed for proper performance of safety and traffic efficiency applications. A non-trivial scientific challenge in VANETs is the design of an adaptive broadcast protocol, which can provide efficient and end-to-end reliable warning messages dissemination. Usually, broadcast protocols for VANETs use beacon messages, disseminated among the vehicles, in order to get neighborhood information. When the vehicles are next to each other trying to broadcast at the same time, this may lead to frequent contention, and broadcast storms. On the other hand, in sparse density scenarios, vehicles have to face with failures in the message delivery. In this paper, we propose a novel protocol, Adaptive Data Dissemination Protocol (AddP), which aims at providing reliability to message dissemination in an efficient way. The protocol uses different mechanisms to dynamically adjust the beacon periodicity and to reduce the number of messages and beacons in the network. The effectiveness of our proposed protocol and the impacts of the use of the protocol by a VANET safety application were evaluated through experiments with network and traffic simulators.

      PubDate: 2017-05-22T12:52:34Z
      DOI: 10.1016/j.adhoc.2017.05.002
       
  • Energy efficient context aware traffic scheduling for IoT applications
    • Authors: Bilal Afzal; Sheeraz A. Alvi; Ghalib A. Shah; Waqar Mahmood
      Abstract: Publication date: Available online 5 May 2017
      Source:Ad Hoc Networks
      Author(s): Bilal Afzal, Sheeraz A. Alvi, Ghalib A. Shah, Waqar Mahmood
      The evolution of Internet of Things (IoT) has increased the appetite for the energy efficient wireless infrastructures. Most of the IoT devices are inherently resource constrained and heterogeneous in respect of their traffic demand. Moreover, these devices need to be made adaptable to the varying environmental conditions. However, existing traffic scheduling and duty cycling algorithms lack the capability to meet the dynamic service quality requirements of IoT applications with variable context information. Specifically, they are infeasible for IoT use-cases where multi-hop communication is required. This paper strives to realize efficient resource allocation to the Wi-Fi based IoT devices in multi-hop IoT infrastructures. Firstly, IoT applications are characterized as per their heterogeneous traffic demand and mapped to the distinct weighted quality classes. Then, context awareness is introduced for IoT devices and an optimization model constrained by their service quality requirements and context priorities is presented. Further, an energy efficient context aware traffic scheduling (EE-CATS) algorithm is proposed wherein the convergence of model is specified by a sub-gradient projection method. The EE-CATS algorithm efficiently allocates resources to multi-hop IoT devices and reduce their total awake time by employing adaptive duty cycling. The performance evaluation is done for various IoT use-cases through simulations in Network Simulator (ns-2) and testbed implementation in Contiki operating system. The results suggest substantial improvements in the energy efficiency of IoT devices while ensuring their dynamic service requirements. In addition, the proposed algorithm minimizes the end-to-end delays in overall IoT networks.

      PubDate: 2017-05-08T10:04:30Z
      DOI: 10.1016/j.adhoc.2017.05.001
       
  • Reliable delay-sensitive spectrum handoff management for re-entrant
           secondary users
    • Authors: Uthpala Subodhani Premarathne; Ibrahim Khalil; Mohammed Atiquzzaman
      Abstract: Publication date: Available online 4 May 2017
      Source:Ad Hoc Networks
      Author(s): Uthpala Subodhani Premarathne, Ibrahim Khalil, Mohammed Atiquzzaman
      Opportunistic data transmissions in cognitive radio networks is an effective data transmission mechanism which reduces the limitations of fixed spectrum allocations. In cognitive radio networks secondary users (SUs) can transmit over the available spectrum when the primary users (PUs) are inactive. However, a SU may get interrupted over multiple times when the PU re-appear on that channel for data transmission. For an interrupted SU, efficient spectrum hand-off management is vital to complete the data transmission. Efficient spectrum hand-off necessitates greatly for delay sensitive data transmissions (e.g. time critical remote monitoring applications). For such data transmissions, delay sensitive spectrum hand-off mechanisms are necessary. However, the existing sensed spectrum hand-off management methods do not consider delay bounded repeated attempts for spectrum reallocation when there are multiple interruptions. In this paper a delay sensitive spectrum hand-off management for the re-entrant SUs due to multiple interruptions is proposed. Compared to the existing solutions, the proposed spectrum allocation strategy offers more reliable delay-tolerant opportunities for accessing the spectrum for the re-entrant SUs.

      PubDate: 2017-05-08T10:04:30Z
      DOI: 10.1016/j.adhoc.2017.04.008
       
  • Temperature Compensated Kalman Distributed Clock Synchronization
    • Authors: Fengyuan Gong; Mihail L. Sichitiu
      Abstract: Publication date: Available online 27 April 2017
      Source:Ad Hoc Networks
      Author(s): Fengyuan Gong, Mihail L. Sichitiu
      Time synchronization is a fundamental problem in any distributed system. In particular, wireless sensor networks (WSNs) require scalable time synchronization for implementing distributed tasks on multiple sensor nodes. We propose a temperature-compensated Kalman based distributed synchronization protocol (TKDS) using a two-way sender-receiver synchronization scheme, to achieve high synchronization accuracy while modelling the clock skew change based on its physical characteristics. By asynchronously combining estimates from neighbours, TKDS achieves better performance than the spanning tree based protocols in a fully-distributed fashion. The synchronization performance is evaluated numerically and compared with that of other well-known synchronization protocols.

      PubDate: 2017-05-02T21:14:46Z
      DOI: 10.1016/j.adhoc.2017.04.009
       
  • Link Selection Strategies based on Network Analysis to Determine Stable
           and Energy-Efficient Data Gathering Trees for Mobile Sensor Networks
    • Authors: Natarajan Meghanathan
      Abstract: Publication date: Available online 25 April 2017
      Source:Ad Hoc Networks
      Author(s): Natarajan Meghanathan
      We propose three different strategies for selecting links that could be part of stable data gathering (DG) trees for mobile sensor networks (MSNs). The proposed strategies are based on metrics (such as: Neighborhood Overlap, Bipartivity Index and Algebraic Connectivity) used in complex network analysis applied on the egocentric network of an edge: a graph comprising of the end nodes of the edge and their neighbors (as vertices) and links incident on the end nodes of the edge (as edges). We hypothesize that an edge whose egocentric network has a larger neighborhood overlap or a smaller bipartivity index or a larger value for algebraic connectivity should have its end nodes share a significant fraction of their neighbors and be a short distance link that is relatively more stable. Through extensive simulations, we show that each of the above three metrics of complex network analysis could be used to determine DG trees that are significantly more stable and energy-efficient compared to the currently best known strategy of using the predicted link expiration time (LET) to determine stable DG trees for MSNs. Also, unlike the LET approach, the proposed strategies could be applied without knowledge about the location and mobility of the nodes.

      PubDate: 2017-04-25T20:56:08Z
      DOI: 10.1016/j.adhoc.2017.04.007
       
  • On the Rate of Successful Transmissions in Finite Slotted Aloha MANETs
    • Authors: Yin Chen; Jinxiao Zhu; Yulong Shen; Xiaohong Jiang; Hideyuki Tokuda
      Abstract: Publication date: Available online 17 April 2017
      Source:Ad Hoc Networks
      Author(s): Yin Chen, Jinxiao Zhu, Yulong Shen, Xiaohong Jiang, Hideyuki Tokuda
      Mobile ad hoc networks (MANETs) with Aloha MAC protocol (A-MANETs) represent a class of important and attractive networks. This paper studies the Rate of Successful Transmissions (RST), a performance index that measures the average amount of successful transmissions, in a practical A-MANET with finite number of nodes and a class of “uniform-type” mobility models. We first develop a new theoretical framework for the temporal modeling of the concerned finite A-MANET, and prove that as time evolves the network converges in distribution to a Binomial point process. With the help of the convergence property of the network and stochastic geometry theory, we then provide our analysis on the RST. In particular, we show that although it is highly cumbersome (if not impossible) to derive the exact expression for the RST of the concerned network, it is possible to have very efficient approximations to the RST under the typical nearest neighbor/receiver transmission policy, which are accurate up to an additive asymptotic error vanishing exponentially with the number of network nodes. Finally, we provide extensive simulation/numerical results to illustrate the efficiency of our RST modeling and our theoretical findings.

      PubDate: 2017-04-18T20:27:05Z
      DOI: 10.1016/j.adhoc.2017.04.005
       
  • Maximizing the Wireless Sensor Networks Lifetime through Energy Efficient
           Connected Coverage
    • Authors: J. Roselin; P. Latha; S. Benitta
      Abstract: Publication date: Available online 5 April 2017
      Source:Ad Hoc Networks
      Author(s): J. Roselin, P. Latha, S. Benitta
      Wireless Sensor Network (WSN) is an emerging technology that is gaining much importance owing to its immense contribution in various day-to-day applications. A sensor is battery-operated, unattended low-cost device with limited computing, communication and storage capabilities. Thus the network lifetime has become the key characteristic for evaluating sensor networks in an application-specific way. There are certain approaches in literature which consider the lifetime maximization problem. However, they suffer from impulsive energy hole, coverage hole and communication hole. In this paper we propose a novel Energy Efficient Connected Coverage (EECC) scheduling to maximize the lifetime of the WSN. The EECC adheres to Quality of Service (QoS) metrics such as remaining energy, coverage and connectivity. In EECC the sensor which doesn't contribute to coverage will act as a relay node to reduce the burden of the sensing node. The sensing node senses the target whereas the relaying node communicates the sensory information to the sink. The EECC forms non-disjoint cover sets using remaining energy, coverage and connectivity of every sensor. The proposed EECC outperforms similar scheduling algorithms found in the literature in an energy efficient way with the short execution time. Through simulations the constancy of EECC in extending the lifetime of WSN is confirmed.

      PubDate: 2017-04-12T01:46:59Z
      DOI: 10.1016/j.adhoc.2017.04.001
       
  • Performance Evaluation of Unmanned Aerial Vehicles in Automatic Power
           Meter Readings
    • Authors: Jose R.T. Neto; Azzedine Boukerche; Roberto S. Yokoyama; Daniel L. Guidoni; Rodolfo I. Meneguette; Jo Ueyama; Leandro A. Villas
      Abstract: Publication date: Available online 6 March 2017
      Source:Ad Hoc Networks
      Author(s): Jose R.T. Neto, Azzedine Boukerche, Roberto S. Yokoyama, Daniel L. Guidoni, Rodolfo I. Meneguette, Jo Ueyama, Leandro A. Villas
      Typically, the electric power companies employ a group of power meter readers to collect data on the customers energy consumption. This task is usually carried out manually, which can lead to high cost and errors, causing financial losses. Some approaches have tried to minimize these problems, using strategies such as discovering the minimal route or relying on vehicles to perform the readings. However, errors in the manual readings can occur and vehicles suffer from congestion and high fuel and maintenance costs. In this work, we go further and propose an architecture to the Automatic Meter Reading (AMR) system using Unmanned Aerial Vehicles (UAV). The main challenge of the solution is to design a robust and lightweight protocol that is capable of dealing with wireless communication collisions. Therefore, the main contribution of this work is the design of a new protocol to ensure wireless communication from UAV to the power meters. We validated and evaluated the architecture in an urban scenario, with results showing a decrease of time and distance when compared to other approaches. We also evaluated the system proposed with Linear Flight Plan, the Ant Colony Optimization and Guided Local Search metaheuristic. Our mechanism attains an improvement of 98% in reducing the message collisions and reducing the energy consumption of the power meters.

      PubDate: 2017-03-10T09:51:34Z
      DOI: 10.1016/j.adhoc.2017.03.003
       
  • End to End Delay Modeling of Heterogeneous Traffic flows in Software
           Defined 5G Networks
    • Authors: Müge Erel Özçevi̇k; Berk Canberk; Trung Q. Duong
      Abstract: Publication date: Available online 3 March 2017
      Source:Ad Hoc Networks
      Author(s): Müge Erel Özçevi̇k, Berk Canberk, Trung Q. Duong
      In ultra-dense 5th Generation (5G) wireless networks, we believe that foreground User Datagram Protocol (UDP) traffic flow is ′squeezed′ by Transmission Control Protocol (TCP) background because of increasing queue waiting time and extra transmission delay for each timeout in TCP congestion control mechanism. Therefore, traffic Heterogeneity which is defined by the rate between number of UDP over TCP traffic flows for each forwarding device, has become more significant. According to the 3rd Generation Partnership Project (3GPP) Release 13, conventional Long Term Evolution - Self Organize Networks (LTE-SON) does not consider Heterogeneity rate of traffic flows while balancing load between neighbor eNodeBs (eNBs). In order to reduce end to end delay (e2eDelay) of foreground TCP traffic flow, an optimal path should be selected by considering both load Intensity and traffic H e t e r o g e n e i t y level of eNBs. To do this, we propose a Software-Defined Networks (SDN)-based softwarization approach brought by 5G networks with three fold contributions: virtualization of topology graph (G), e2eDelay optimization which is run in terms of both load Intensity (ρj (t)) and Heterogeneity rate(Hj (t)), and novel Queuing Theory based OpenFlow (OF) switch model. Moreover, due to being bottleneck, centralized SDN-Controller is proposed to accelerated with novel three heuristics including shortest path and e2eDelay optimization algorithms running in parallel manner. More specifically, this process is combined into a novel closed-form expression of e2eDelay(Ti (t)) in two main parts: Data plane effect and Control plane effect. As a result, proposed SDN-based e2eDelay model serves foreground TCP traffic flow upto 74% and 98% less e2eDelay than LTE-SON and conventional LTE.

      PubDate: 2017-03-10T09:51:34Z
      DOI: 10.1016/j.adhoc.2017.02.006
       
  • TCP Performance Evaluation over Backpressure-based Routing Strategies for
           Wireless Mesh Backhaul in LTE Networks
    • Authors: Natale Patriciello; José Núñez-Martínez; Jorge Baranda; Maurizio Casoni; Josep Mangues-Bafalluy
      Abstract: Publication date: Available online 2 March 2017
      Source:Ad Hoc Networks
      Author(s): Natale Patriciello, José Núñez-Martínez, Jorge Baranda, Maurizio Casoni, Josep Mangues-Bafalluy
      Wireless redundant networks are expected to play a fundamental role to backhaul dense LTE networks. In these scenarios, backpressure-based routing strategies such as BP-MR can exploit the network redundancy. In this paper, we perform an exhaustive performance evaluation of different TCP variants over an LTE access network, backhauled by various routing protocols (including per-packet and per-flow BP-MR variants and a static alternative, OLSR) over two different wireless topologies: a regular mesh and an irregular ring-tree topology. We compare the performance of different TCP congestion control algorithms based on loss (NewReno, Cubic, Highspeed, Westwood, Hybla, and Scalable) and delay (Vegas) under different workloads. Our extensive analysis with ns-3 on throughput, fairness, scalability and latency reveals that the underlying backhaul routing scheme seems irrelevant for delay-based TCPs, whereas per-flow variant offers the best performance irrespective of any loss-based TCP congestion control, the most used in the current Internet. We show that BP-MR per-flow highly reduces the download finish time, if compared with OLSR and BP-MR per-packet, despite showing higher round-trip-time.

      PubDate: 2017-03-10T09:51:34Z
      DOI: 10.1016/j.adhoc.2017.03.001
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs
Your IP address: 54.92.128.223
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016