for Journals by Title or ISSN
for Articles by Keywords
  Subjects -> COMPUTER SCIENCE (Total: 1969 journals)
    - ANIMATION AND SIMULATION (29 journals)
    - AUTOMATION AND ROBOTICS (96 journals)
    - COMPUTER ARCHITECTURE (9 journals)
    - COMPUTER ENGINEERING (10 journals)
    - COMPUTER GAMES (15 journals)
    - COMPUTER PROGRAMMING (23 journals)
    - COMPUTER SCIENCE (1147 journals)
    - COMPUTER SECURITY (45 journals)
    - DATA BASE MANAGEMENT (12 journals)
    - DATA MINING (32 journals)
    - E-BUSINESS (22 journals)
    - E-LEARNING (28 journals)
    - IMAGE AND VIDEO PROCESSING (40 journals)
    - INFORMATION SYSTEMS (101 journals)
    - INTERNET (91 journals)
    - SOCIAL WEB (49 journals)
    - SOFTWARE (32 journals)
    - THEORY OF COMPUTING (8 journals)

COMPUTER SCIENCE (1147 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: 11)
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: 19)
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: 10)
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: 10)
Advanced Engineering Materials     Hybrid Journal   (Followers: 25)
Advanced Science Letters     Full-text available via subscription   (Followers: 5)
Advances in Adaptive Data Analysis     Hybrid Journal   (Followers: 8)
Advances in Artificial Intelligence     Open Access   (Followers: 14)
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: 52)
Advances in Engineering Software     Hybrid Journal   (Followers: 25)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 9)
Advances in Human Factors/Ergonomics     Full-text available via subscription   (Followers: 23)
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: 35)
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: 9)
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: 13)
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: 31)
Applied Medical Informatics     Open Access   (Followers: 9)
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 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: 8)
Automation in Construction     Hybrid Journal   (Followers: 6)
Autonomous Mental Development, IEEE Transactions on     Hybrid Journal   (Followers: 7)
Basin Research     Hybrid Journal   (Followers: 3)
Behaviour & Information Technology     Hybrid Journal   (Followers: 52)
Bioinformatics     Hybrid Journal   (Followers: 230)
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: 16)
Biomedical Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 31)
Briefings in Bioinformatics     Hybrid Journal   (Followers: 45)
British Journal of Educational Technology     Hybrid Journal   (Followers: 117)
Broadcasting, IEEE Transactions on     Hybrid Journal   (Followers: 10)
c't Magazin fuer Computertechnik     Full-text available via subscription   (Followers: 1)
CALCOLO     Hybrid Journal  
Calphad     Hybrid Journal  
Canadian Journal of Electrical and Computer Engineering     Full-text available via subscription   (Followers: 12)
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)
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: 13)
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: 18)
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: 47)
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  
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: 12)
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: 27)
Computer     Full-text available via subscription   (Followers: 78)
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: 8)
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: 13)
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: 10)
Computer Science Education     Hybrid Journal   (Followers: 12)
Computer Science Journal     Open Access   (Followers: 20)
Computer Science Master Research     Open Access   (Followers: 9)
Computer Science Review     Hybrid Journal   (Followers: 10)

        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  [3031 journals]
  • 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
    • 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
    • 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
    • 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)
  • Probabilistic modeling to achieve load balancing in Expert Clouds
    • Authors: Shiva Razzaghzadeh; Ahmad Habibizad Navin; Amir Masoud Rahmani; Mehdi Hosseinzadeh
      Pages: 12 - 23
      Abstract: Publication date: 1 May 2017
      Source:Ad Hoc Networks, Volume 59
      Author(s): Shiva Razzaghzadeh, Ahmad Habibizad Navin, Amir Masoud Rahmani, Mehdi Hosseinzadeh
      Expert Cloud as a new class of Cloud computing systems enables its users to request the skill, knowledge and expertise of people without any information of their location by employing Internet infrastructures and Cloud computing concepts. Effective load balancing in a heterogeneous distributed environment such as Cloud is important. Since the differences in the human resource (HRs) capabilities and the variety of users' requests causes that some HRs are overloaded and some others are idle. The task allocation to the HR based on the announced requirements by the user may cause the imbalanced load distribution among HRs as well. Hence resource management and scheduling are among the important cases to achieve load balancing. Using static and dynamic algorithms, the ant colony, and the method based on searching tree all are among the methods to achieve load balancing. This paper presents a new method in order to distribute the dynamic load based on distributed queues aware of service quality in the Cloud environment. In this method, we utilize the colorful ants as a ranking for making distinction among the HRs capabilities. In this paper, we perform the mapping among the tasks and HRs using allocating a label to each HR. We model the load balancing and mapping process based on Poisson and exponential distribution. This model allows us to allocate each task to the HR which is able to execute it with maximum power using the distributed queues aware of the service quality. Simulation results show that the expert Cloud can reduce the execution and tardiness time and improve HR utilization. The cost of using resources as an effective factor in load balancing is also observed.

      PubDate: 2017-03-17T10:45:31Z
      DOI: 10.1016/j.adhoc.2017.01.001
      Issue No: Vol. 59 (2017)
  • An adaptive sinkhole aware algorithm in wireless sensor networks
    • Authors: Ghazaleh Jahandoust; Fatemeh Ghassemi
      Pages: 24 - 34
      Abstract: Publication date: 1 May 2017
      Source:Ad Hoc Networks, Volume 59
      Author(s): Ghazaleh Jahandoust, Fatemeh Ghassemi
      In Wireless Sensor Networks (WSNs), nodes collectively collaborate to sense the environment and inform the base station. Sinkhole attack aims at attracting the traffic of nodes in its vicinity by advertising itself as the shortest path to the base station, and hence disturbs the functionality of such networks. We propose a distributed adaptive framework based on the subjective logic and probabilistic extension of timed automata to reason about the probability of each node being affected by sinkhole attacks. The outcome is announced to the nodes to adjust the probabilities of their next hops in the probabilistic extension of AODVv2-12 routing protocol to route packets over the most reliable nodes. The subjective logic models at the base station compute the probabilities iteratively based on positive and negative observations about the behaviors of nodes collected by the distributed monitor nodes or received data packets. To adaptively tune the parameters of positive and negative observations, an abstract probabilistic model based on timed automaton that captures the behavior of the whole network is generated at the runtime in the base station. The combination of the formal models results in an effective adaptive algorithm, robust to the dynamism of network, with low packet loss rate as the routes are selected over the reliable nodes. Furthermore, the false positive and false negative results reduce as the network converges.

      PubDate: 2017-03-17T10:45:31Z
      DOI: 10.1016/j.adhoc.2017.01.002
      Issue No: Vol. 59 (2017)
  • Enhancing privacy for ad hoc systems with predeployment key distribution
    • Authors: Marek Klonowski; Piotr Syga
      Pages: 35 - 47
      Abstract: Publication date: 1 May 2017
      Source:Ad Hoc Networks, Volume 59
      Author(s): Marek Klonowski, Piotr Syga
      Achieving security in distributed systems of constrained devices (like Wireless Sensor Networks) requires methods that can be performed while very limited computational, memory and communication resources are available. Moreover, while designing security protocols one needs take into account the adversary that can eavesdrop communication or compromise some of the devices. To achieve some level of security, two communicating devices need to establish a communication key. In the setting of severely constrained devices traditional methods are infeasible due to resource limitations, and one has to incorporate other security providing methods. One of the first such protocols has been introduced in  Eschenauer and Gligor [23]. The paper followed by dozens of others relies on probabilistic key sharing among the nodes before deployment (key predistribution) in the Ad Hoc environment. In our paper, we show that regular protocols of key predistribution designed primarily for providing confidentiality of communication do not provide privacy in many natural scenarios. More precisely, even a weak adversary may “link” transmissions of the same nodes. In particular even a passive adversary that is eavesdropping the communication can easily recognize whether the same devices start communication several times. Such information not only breaches nodes’ privacy but also can be a starting point for an more advanced attacks and can give significant information about network’s activity. We define several models of adversary and introduce some general methods that can be used for addressing this issue. For the model with weaker adversary we show how to fully secure the privacy in an efficient manner. For the case of stronger adversary, we propose a method based on local key exchange allowing mitigation of the privacy threat.

      PubDate: 2017-03-17T10:45:31Z
      DOI: 10.1016/j.adhoc.2017.01.003
      Issue No: Vol. 59 (2017)
  • Topology design and cross-layer optimization for wireless body sensor
    • Authors: Yang Zhou; Zhengguo Sheng; Chinmaya Mahapatra; Victor C.M. Leung; Peyman Servati
      Pages: 48 - 62
      Abstract: Publication date: 1 May 2017
      Source:Ad Hoc Networks, Volume 59
      Author(s): Yang Zhou, Zhengguo Sheng, Chinmaya Mahapatra, Victor C.M. Leung, Peyman Servati
      Wireless Body Sensor Networks play a crucial role in digital health care nowadays. Due to the size limitation on the sensor nodes and the life critical characteristics of the signals, there are stringent requirements on network’s reliability and energy efficiency. In this article, we propose a mathematical optimization problem that jointly considers network topology design and cross-layer optimization in WBSNs. We introduce multilevel primal and dual decomposition methods and manage to solve the proposed non-convex mixed-integer optimization problem. A solution with fast convergence rate based on binary search is provided. Simulation results have been supplemented to show that our proposed method yields much better performance than existing solutions.

      PubDate: 2017-03-17T10:45:31Z
      DOI: 10.1016/j.adhoc.2017.01.005
      Issue No: Vol. 59 (2017)
  • A maximum flow algorithm based on storage time aggregated graph for
           delay-tolerant networks
    • Authors: Hongyan Li; Tao Zhang; Yangkun Zhang; Kan Wang; Jiandong Li
      Pages: 63 - 70
      Abstract: Publication date: 1 May 2017
      Source:Ad Hoc Networks, Volume 59
      Author(s): Hongyan Li, Tao Zhang, Yangkun Zhang, Kan Wang, Jiandong Li
      Delay-tolerant networks (DTNs) (e.g., Internet, satellite networks, sensor networks, ad hoc networks) have attracted considerable attentions in both academia and industry. As a fundamental problem, the maximum flow is of vital importance for routing and service scheduling in networks. For solving the maximum flow problem of the DTN, an appropriate model should be built first. Compared to the conventional snapshot approach to model the DTN topology, the time aggregated graph (TAG) is capable of accurately characterizing the intermittent connectivity and time-varying capacity for each edge, and thus has been acted as a suitable model for modeling DTNs. However, existing TAG-related works only focus on solving the shortest path problem, and neither the correlation between time intervals nor nodes storage of a DTN are described in TAG, resulting in a non-trivial maximum flow problem in TAG. In this paper, we study the maximum flow problem through our proposed storage time aggregated graph (STAG) for DTNs. First, an intermediate quantity named bidirectional storage transfer series is introduced to each node in STAG, and the corresponding transfer rule is also designed for this series to model the correlation between time intervals. Next, on the basis of the storage transfer series, a STAG-based algorithm is proposed and described in detail to maximize the network flow. In addition, we analyze the effectiveness of the proposed algorithm by giving an illustrative example.

      PubDate: 2017-03-17T10:45:31Z
      DOI: 10.1016/j.adhoc.2017.01.006
      Issue No: Vol. 59 (2017)
  • Optimizing privacy-preserving DSA for mobile clients
    • Authors: Erald Troja; Spiridon Bakiras
      Pages: 71 - 85
      Abstract: Publication date: 1 May 2017
      Source:Ad Hoc Networks, Volume 59
      Author(s): Erald Troja, Spiridon Bakiras
      The exponential growth of connected wireless devices has led to a depletion of the available wireless spectrum. To this end, dynamic spectrum access (DSA) has been proposed as a viable framework for maximizing the usability of the wireless spectrum by allowing some portions of it to be accessed and used in a dynamic manner. Contrary to the legacy fixed spectrum access policy, DSA enables license-exempt users to access licensed bands during their respective owner’s idle times. Specifically, in the database-driven DSA model, mobile users issue location-based queries to a white-space database and request idle channels in their area. To preserve location privacy, existing solutions suggest the use of private information retrieval (PIR) protocols when querying the database. Nevertheless, these methods are not communication efficient and fail to take into account user mobility. In this paper, we address these shortcomings and propose an efficient privacy-preserving protocol based on the Hilbert space filling curve. We provide optimizations for mobile users that require privacy on-the-fly and users that have full a priori knowledge of their trajectory. Results from our experimentation on two real life datasets show that, compared to the current state-of-the-art protocol, our methods reduce the query processing cost at the mobile clients by a factor of 2 to 8.

      PubDate: 2017-03-17T10:45:31Z
      DOI: 10.1016/j.adhoc.2017.02.001
      Issue No: Vol. 59 (2017)
  • Benchmarking of Localization Solutions: Guidelines for the Selection of
           Evaluation Points
    • Authors: Eli De Poorter; Tom Van Haute; Eric Laermans; Ingrid Moerman
      Pages: 86 - 96
      Abstract: Publication date: 1 May 2017
      Source:Ad Hoc Networks, Volume 59
      Author(s): Eli De Poorter, Tom Van Haute, Eric Laermans, Ingrid Moerman
      Indoor localization solutions are key enablers for next-generation indoor navigation and track and tracing solutions. As a result, an increasing number of different localization algorithms have been proposed and evaluated in scientific literature. However, many of these publications do not accurately substantiate the used evaluation methods. In particular, many authors utilize a different number of evaluation points, but they do not (i) analyze if the number of used evaluation points is sufficient to accurately evaluate the performance of their solutions and (ii) report on the uncertainty of the published results. To remedy this, this paper evaluates the influence of the selection of evaluation points. Based on statistical parameters such as the standard error of the mean value, an estimator is defined that can be used to quantitatively analyze the impact of the number of used evaluation points on the confidence interval of the mean value of the obtained results. This estimator is used to estimate the uncertainty of the presented accuracy results, and can be used to identify if more evaluations are required. To validate the proposed estimator, two different localization algorithms are evaluated in different testbeds and using different types of technology, showing that the number of required evaluation points does indeed vary significantly depending on the evaluated solution.

      PubDate: 2017-03-17T10:45:31Z
      DOI: 10.1016/j.adhoc.2017.02.002
      Issue No: Vol. 59 (2017)
  • T-ROME: A simple and energy efficient tree routing protocol for low-power
           wake-up receivers
    • Authors: T. Kumberg; M. Schink; L.M. Reindl; C. Schindelhauer
      Pages: 97 - 115
      Abstract: Publication date: 1 May 2017
      Source:Ad Hoc Networks, Volume 59
      Author(s): T. Kumberg, M. Schink, L.M. Reindl, C. Schindelhauer
      Wireless sensor networks are deployed in many monitoring applications but still suffer from short lifetimes originating from limited energy sources and storages. Due to their low-power consumption and their on-demand communication ability, wake-up receivers represent an energy efficient and simple enhancement to wireless sensor nodes and wireless sensor network protocols. In this context, wake-up receivers have the ability to increase the network lifetime. In this article, we present T-ROME, a simple and energy efficient cross-layer routing protocol for wireless sensor nodes containing wake-up receivers. The protocol makes use of the different transmission ranges of wake-up and main radios in order to save energy by skipping nodes during data transfer. With respect to energy consumption and latency, T-ROME outperforms existing protocols in many scenarios. Here, we describe and analyze the cross layer multi-hop protocol by means of a Markov chain model that we verify using a laboratory test setup.

      PubDate: 2017-03-17T10:45:31Z
      DOI: 10.1016/j.adhoc.2017.02.003
      Issue No: Vol. 59 (2017)
  • Real-time link quality estimation for industrial wireless sensor networks
           using dedicated nodes
    • Authors: Ruan D. Gomes; Diego V. Queiroz; Abel C. Lima Filho; Iguatemi E. Fonseca; Marcelo S. Alencar
      Pages: 116 - 133
      Abstract: Publication date: 1 May 2017
      Source:Ad Hoc Networks, Volume 59
      Author(s): Ruan D. Gomes, Diego V. Queiroz, Abel C. Lima Filho, Iguatemi E. Fonseca, Marcelo S. Alencar
      Adaptive mechanisms, such as dynamic channel allocation or adaptive routing, are used to deal with the variations in the link quality of Wireless Sensor Networks (WSN). In both cases, the first step is to estimate the link quality, so that the network nodes can decide if a channel or route change is needed. This paper proposes a Link Quality Estimator (LQE) for Industrial WSN, and a new type of node, the LQE node, that estimates the link quality in real-time, using the Received Signal Strength Indication (RSSI), and information obtained from received data packets. The proposed LQE is capable of capturing the effects of multipath, interference, and link asymmetry. Experiments were performed in a real industrial environment using IEEE 802.15.4 radios, and models were developed to allow the use of RSSI samples to proper estimate the link quality. A comparison was performed with a state-of-the-art LQE, the Opt-FLQE, and the results showed that the proposed estimator is more accurate and reactive for the type of environment in study. Different from other LQEs in literature, in the proposed LQE the sensor nodes do not need to send broadcast probe packets. Besides, using the LQE node, the other nodes of the WSN do not need to stop their operation to monitor the link quality.

      PubDate: 2017-03-17T10:45:31Z
      DOI: 10.1016/j.adhoc.2017.02.007
      Issue No: Vol. 59 (2017)
  • Hybrid Wireless Ad Hoc Networks
    • Authors: Qilian Liang; Tariq S. Durrani; Yiming Pi; Xin Wang
      Pages: 1 - 5
      Abstract: Publication date: April 2017
      Source:Ad Hoc Networks, Volume 58
      Author(s): Qilian Liang, Tariq S. Durrani, Yiming Pi, Xin Wang

      PubDate: 2017-03-10T09:51:34Z
      DOI: 10.1016/j.adhoc.2017.02.005
      Issue No: Vol. 58 (2017)
  • 3D nested distributed massive MIMO: Modeling and performance analysis
    • Authors: Shitong Yuan; Qilian Liang
      Pages: 6 - 12
      Abstract: Publication date: April 2017
      Source:Ad Hoc Networks, Volume 58
      Author(s): Shitong Yuan, Qilian Liang
      The Large Scale Multiple-input-multiple-output (MIMO) system, also called Massive MIMO in past researches, are considering the azimuth angle only. However, in a 3D distributed antenna system, the elevation angle cannot be ignored. Nested array as a two dimensional arrays was firstly proposed to perform array processing with increased degree of freedom, using less number of sensors at the same time. This paper introduces a novel 3D MIMO antenna deployment based on nested co-array. As the difference co-arrays are invariance, in the 3D nested distributed MIMO system, we are able to calculate the covariance matrix of channels. Based on this inference, we model a 3D nested distributed MIMO system and analyze its performance with achievable sum rate. By applying the nested deployment, our proposed method could achieve a Massive MIMO with less number of physical antennas. Numerical results also provided to support our model.

      PubDate: 2017-03-10T09:51:34Z
      DOI: 10.1016/j.adhoc.2016.12.007
      Issue No: Vol. 58 (2017)
  • Vehicle-to-vehicle connectivity analysis for vehicular ad-hoc networks
    • Authors: Gongjun Yan; Danda B. Rawat
      Pages: 25 - 35
      Abstract: Publication date: April 2017
      Source:Ad Hoc Networks, Volume 58
      Author(s): Gongjun Yan, Danda B. Rawat
      Vehicle-to-vehicle (V2V) communication in Vehicular Ad hoc Networks (VANETs) is of importance in the Intelligent Transportation System (ITS) in which vehicles enlisted with wireless devices can communicate with each other. Many applications can save people’s life or time on traffic such as accident alerts or congestion prediction, etc. However, network communication over VANETs is inheritedly unstable because of the high mobility of vehicles. In this paper, we analyze vehicle to vehicle wireless connectivity by using mathematic models. We consider the effect of headway distance, acceleration, association time (i.e. connection setup time), relative speed of vehicles, transmission range and message/data size in short range based V2V communications in the models. The numerical results in simulations validate the analysis.

      PubDate: 2017-03-10T09:51:34Z
      DOI: 10.1016/j.adhoc.2016.11.017
      Issue No: Vol. 58 (2017)
  • Implementation and analysis of Wireless Flexible Time-Triggered protocol
    • Authors: Paulo Bartolomeu; Muhammad Alam; Joaquim Ferreira; José Fonseca
      Pages: 36 - 53
      Abstract: Publication date: April 2017
      Source:Ad Hoc Networks, Volume 58
      Author(s): Paulo Bartolomeu, Muhammad Alam, Joaquim Ferreira, José Fonseca
      During the last few years, wireless low-power communications experienced an increasing coexistence and traction as a result of the higher demand posed by power constrained applications. On the other hand, this increasing wireless coexistence is a growing concern and Low-power wireless communication protocols have been shown to experience a significant timeliness and reliability degradation under certain interference profiles. Therefore, the support of real-time communications over license-free bands in open environments, encompassing multiple real-time stations with an unknown number of unconstrained stations, is a challenging task. Provided that this impairment has hindered their wide adoption in demanding real-time scenarios, the Wireless Flexible Time Triggered (WFTT) protocol has been recently proposed targeting applications with stringent timeliness requirements. This protocol works on the medium access determinism granted by the bandjacking technique in open environments, where different technologies may contend for the medium. Besides providing a deeper definition of the WFTT architecture and protocol operation, this paper presents a thorough analysis addressing its specifications, implementation feasibility and testbed based results. These provide strong evidence that the WFTT protocol is able to support real-time communications, even in environments affected by high levels of interference from neighboring contention-based communication technologies such as Wi-Fi.

      PubDate: 2017-03-10T09:51:34Z
      DOI: 10.1016/j.adhoc.2016.11.016
      Issue No: Vol. 58 (2017)
  • Hybrid half-duplex/full-duplex multi-hop relaying schemes: Outage
           performance and power optimization
    • Authors: Liang Han; Jiasong Mu
      Pages: 54 - 61
      Abstract: Publication date: April 2017
      Source:Ad Hoc Networks, Volume 58
      Author(s): Liang Han, Jiasong Mu
      Full-duplex (FD) relays can transmit and receive simultaneously over the same frequency band, hence enable a significant improvement of spectral efficiency compared to half-duplex (HD) relays and have attracted much research interests. However, there exists severe interference for FD multi-hop relay networks in which all the relays operate in FD mode. To overcome this problem, we propose hybrid HD/FD multi-hop decode-and-forward (DF) relaying schemes, where in each time block two nodes communicate directly with each other in HD mode or communicate with the help of an FD relay. Assuming that all the channels including the residual self-interference (RSI) channel are subject to Rayleigh fading, we derive the outage probabilities of FD multi-hop relay networks and hybrid HD/FD multi-hop relaying schemes, respectively. Then we optimize the power allocation of the hybrid HD/FD relaying scheme under individual power constraint with the aim of minimizing the outage probability. Finally, we compare the performance of different transmission schemes and validate our analysis by simulation results.

      PubDate: 2017-03-10T09:51:34Z
      DOI: 10.1016/j.adhoc.2016.11.012
      Issue No: Vol. 58 (2017)
  • On the uplink outage throughput capacity of hybrid wireless networks with
           Massive MIMO
    • Authors: Ganlin Zhao; Qilian Liang
      Pages: 62 - 69
      Abstract: Publication date: April 2017
      Source:Ad Hoc Networks, Volume 58
      Author(s): Ganlin Zhao, Qilian Liang
      In this paper, we investigate theoretical transmission capacity limit of the uplink hybrid wireless network under infrastructure mode. Massive MIMO technology is assumed to be equipped on the base station to further increase the whole network throughput. Multi-user MIMO is preferred over Point-to-Point MIMO to achieve improved scalability and simplify UE design. Another perspective of this paper is to include the fading effect on capacity. Under favorable propagation condition, Massive MIMO greatly mitigates small scale fading effect between each user and base station antenna. Then closed-form outage capacity over large scale fading channel is derived in both low SNR and high SNR scenarios.

      PubDate: 2017-03-10T09:51:34Z
      DOI: 10.1016/j.adhoc.2016.11.011
      Issue No: Vol. 58 (2017)
  • Classification of node degree based on deep learning and routing method
           applied for virtual route assignment
    • Authors: YangMin Lee
      Pages: 70 - 85
      Abstract: Publication date: April 2017
      Source:Ad Hoc Networks, Volume 58
      Author(s): YangMin Lee
      In recent years, the importance of various wireless network technologies has increased. Specifically, in communication environments noted for severe conditions, such as disasters, war, and terrorism, collaboration between fixed communication infrastructure and wireless ad-hoc networks is indispensable. In this paper, the node degree of wireless communication is classified for disaster situations, and virtual routes are set according to the predetermined node degree. Then, the proposed routing method is employed with base stations as the infrastructure, such that a route may be assigned, maintained, and recovered. Our classification of wireless degree nodes uses deep learning, and virtual routes are created by employing the Viterbi algorithm. The proposed routing method is compared with existing methods (AODV, OLSR, and ZRP) from the viewpoint of route discovery times and reachability via simulations.

      PubDate: 2017-03-10T09:51:34Z
      DOI: 10.1016/j.adhoc.2016.11.007
      Issue No: Vol. 58 (2017)
  • PMC2O: Mobile cloudlet networking and performance analysis based on
           computation offloading
    • Authors: Hao Jin; Shidong Yan; Chenglin Zhao; Dong Liang
      Pages: 86 - 98
      Abstract: Publication date: April 2017
      Source:Ad Hoc Networks, Volume 58
      Author(s): Hao Jin, Shidong Yan, Chenglin Zhao, Dong Liang
      The increase of smart mobile device (SMD) results in explosive growth in mobile traffic and provokes mobile users to leverage more and more compute-intensive applications through SMD. Framework of seamless mobile application execution and networking based on edge computing resources is proved to be one of the promising trends in future mobile Internet. Focusing on networking of Ad hoc cloudlet, this paper proposed a dynamic cloudlet self-networking framework based on component offloading (PMC2O). Taking node mobility into account, dynamic cloudlet behaviour is investigated, and an optimized allocation algorithm called SA-UM is presented to reduce the complexity of resolution space on component allocation algorithm. Proactive Remove decision algorithm based on Node Resource Cooperative Sharing Degree (PRDA-NRCSD) is put forward to improve user experience and optimize the load balancing of a mobile cloudlet.

      PubDate: 2017-03-10T09:51:34Z
      DOI: 10.1016/j.adhoc.2016.11.006
      Issue No: Vol. 58 (2017)
  • A New Maximum Fault-tolerance Barrier-coverage Problem in Hybrid Sensor
           Network and Its Polynomial Time Exact Algorithm
    • 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
  • Estimating the Medium Access Probability in Large Cognitive Radio Networks
    • 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
  • Reliable Data Dissemination Protocol for VANET Traffic Safety Applications
    • 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
  • 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
  • An improved AODV routing for the zigbee heterogeneous networks in 5G
    • Authors: Jiasong
      Abstract: Publication date: April 2017
      Source:Ad Hoc Networks, Volume 58
      Author(s): Jiasong Mu
      A modified AODV Junior routing protocol is adopted as part of the combined routing strategy in the ZigBee networks. However, its routing overhead caused by the routing discovery and the routing table maintenance needs to be further reduced. Considering the deploying environment, the emerging 5G technology tends to be ubiquitous in the near future. Due to its native support to the smart devices and the M2M communication, the 5G terminals may be used as gateways for the ZigBee networks to improve the existing routing method. The ZigBee coordinator and the 5G terminals, which both have the accessibility to the internet, are defined as associated gateways (AG). Aiming to the higher efficiency and the shorter path, an improved ZigBee AODV (Z-AODV) routing protocol using associated gateways for the heterogeneous networks in the 5G environment is proposed in this paper. Besides the regular ZigBee function, by sharing the neighbour and routing information via IP network, the AGs are also responsible for collaboratively finding the optimum path and transmitting the packets to reduce the consumption for ZigBee devices. Moreover, an additional routing information collecting method is developed to further improve the routing performance. The proposed algorithm is evaluated based on simulation results. It is shown that our routing method outperforms the existing ones by higher picketer deliver ratio, shorter path length, lower latency, fewer packets sent per ZigBee node and lower routing overhead.

      PubDate: 2017-03-10T09:51:34Z
  • On the successful transmission probability of cooperative cognitive radio
           ad hoc networks
    • Authors: Jing Gao
      Abstract: Publication date: April 2017
      Source:Ad Hoc Networks, Volume 58
      Author(s): Jing Gao
      We study the successful transmission probability of cognitive radio ad hoc networks in which secondary users assist primary users on transmitting packets. We propose a half-slotted ALOHA multiple access control protocol. Primary transmitters sacrifice second half slot for the reliability improved by the cooperative transmission of secondary users. We derive the closed-form expression of successful transmission probability for both primary and secondary network in the first-half slot. In the second half, we obtain the bounds of successful transmission probability for primary network and the closed-form expression of successful transmission probability for secondary network. Numerical results show that the successful transmission probability of both networks could achieve a maximum by optimizing the intensity of secondary users in the whole time slot.

      PubDate: 2017-03-10T09:51:34Z
  • 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
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
Home (Search)
Subjects A-Z
Publishers A-Z
Your IP address:
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016