for Journals by Title or ISSN
for Articles by Keywords
help

Publisher: Elsevier   (Total: 3163 journals)

 A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

        1 2 3 4 5 6 7 8 | Last   [Sort by number of followers]   [Restore default list]

Showing 1 - 200 of 3163 Journals sorted alphabetically
A Practical Logic of Cognitive Systems     Full-text available via subscription   (Followers: 9)
AASRI Procedia     Open Access   (Followers: 14)
Academic Pediatrics     Hybrid Journal   (Followers: 30, SJR: 1.655, CiteScore: 2)
Academic Radiology     Hybrid Journal   (Followers: 22, SJR: 1.015, CiteScore: 2)
Accident Analysis & Prevention     Partially Free   (Followers: 88, SJR: 1.462, CiteScore: 3)
Accounting Forum     Hybrid Journal   (Followers: 25, SJR: 0.932, CiteScore: 2)
Accounting, Organizations and Society     Hybrid Journal   (Followers: 35, SJR: 1.771, CiteScore: 3)
Achievements in the Life Sciences     Open Access   (Followers: 5)
Acta Anaesthesiologica Taiwanica     Open Access   (Followers: 7)
Acta Astronautica     Hybrid Journal   (Followers: 398, SJR: 0.758, CiteScore: 2)
Acta Automatica Sinica     Full-text available via subscription   (Followers: 2)
Acta Biomaterialia     Hybrid Journal   (Followers: 27, SJR: 1.967, CiteScore: 7)
Acta Colombiana de Cuidado Intensivo     Full-text available via subscription   (Followers: 2)
Acta de Investigación Psicológica     Open Access   (Followers: 3)
Acta Ecologica Sinica     Open Access   (Followers: 8, SJR: 0.18, CiteScore: 1)
Acta Haematologica Polonica     Free   (Followers: 1, SJR: 0.128, CiteScore: 0)
Acta Histochemica     Hybrid Journal   (Followers: 3, SJR: 0.661, CiteScore: 2)
Acta Materialia     Hybrid Journal   (Followers: 244, SJR: 3.263, CiteScore: 6)
Acta Mathematica Scientia     Full-text available via subscription   (Followers: 5, SJR: 0.504, CiteScore: 1)
Acta Mechanica Solida Sinica     Full-text available via subscription   (Followers: 9, SJR: 0.542, CiteScore: 1)
Acta Oecologica     Hybrid Journal   (Followers: 10, SJR: 0.834, CiteScore: 2)
Acta Otorrinolaringologica (English Edition)     Full-text available via subscription  
Acta Otorrinolaringológica Española     Full-text available via subscription   (Followers: 2, SJR: 0.307, CiteScore: 0)
Acta Pharmaceutica Sinica B     Open Access   (Followers: 1, SJR: 1.793, CiteScore: 6)
Acta Poética     Open Access   (Followers: 4, SJR: 0.101, CiteScore: 0)
Acta Psychologica     Hybrid Journal   (Followers: 27, SJR: 1.331, CiteScore: 2)
Acta Sociológica     Open Access  
Acta Tropica     Hybrid Journal   (Followers: 6, SJR: 1.052, CiteScore: 2)
Acta Urológica Portuguesa     Open Access  
Actas Dermo-Sifiliograficas     Full-text available via subscription   (Followers: 3, SJR: 0.374, CiteScore: 1)
Actas Dermo-Sifiliográficas (English Edition)     Full-text available via subscription   (Followers: 2)
Actas Urológicas Españolas     Full-text available via subscription   (Followers: 3, SJR: 0.344, CiteScore: 1)
Actas Urológicas Españolas (English Edition)     Full-text available via subscription   (Followers: 1)
Actualites Pharmaceutiques     Full-text available via subscription   (Followers: 6, SJR: 0.19, CiteScore: 0)
Actualites Pharmaceutiques Hospitalieres     Full-text available via subscription   (Followers: 3)
Acupuncture and Related Therapies     Hybrid Journal   (Followers: 6)
Acute Pain     Full-text available via subscription   (Followers: 15, SJR: 2.671, CiteScore: 5)
Ad Hoc Networks     Hybrid Journal   (Followers: 11, SJR: 0.53, CiteScore: 4)
Addictive Behaviors     Hybrid Journal   (Followers: 16, SJR: 1.29, CiteScore: 3)
Addictive Behaviors Reports     Open Access   (Followers: 8, SJR: 0.755, CiteScore: 2)
Additive Manufacturing     Hybrid Journal   (Followers: 9, SJR: 2.611, CiteScore: 8)
Additives for Polymers     Full-text available via subscription   (Followers: 22)
Advanced Cement Based Materials     Full-text available via subscription   (Followers: 3, SJR: 0.732, CiteScore: 3)
Advanced Drug Delivery Reviews     Hybrid Journal   (Followers: 136, SJR: 4.09, CiteScore: 13)
Advanced Engineering Informatics     Hybrid Journal   (Followers: 11, SJR: 1.167, CiteScore: 4)
Advanced Powder Technology     Hybrid Journal   (Followers: 16, SJR: 0.694, CiteScore: 3)
Advances in Accounting     Hybrid Journal   (Followers: 8, SJR: 0.277, CiteScore: 1)
Advances in Agronomy     Full-text available via subscription   (Followers: 12, SJR: 2.384, CiteScore: 5)
Advances in Anesthesia     Full-text available via subscription   (Followers: 28, SJR: 0.126, CiteScore: 0)
Advances in Antiviral Drug Design     Full-text available via subscription   (Followers: 2)
Advances in Applied Mathematics     Full-text available via subscription   (Followers: 10, SJR: 0.992, CiteScore: 1)
Advances in Applied Mechanics     Full-text available via subscription   (Followers: 10, SJR: 1.551, CiteScore: 4)
Advances in Applied Microbiology     Full-text available via subscription   (Followers: 22, SJR: 2.089, CiteScore: 5)
Advances In Atomic, Molecular, and Optical Physics     Full-text available via subscription   (Followers: 14, SJR: 0.572, CiteScore: 2)
Advances in Biological Regulation     Hybrid Journal   (Followers: 4, SJR: 2.61, CiteScore: 7)
Advances in Botanical Research     Full-text available via subscription   (Followers: 2, SJR: 0.686, CiteScore: 2)
Advances in Cancer Research     Full-text available via subscription   (Followers: 29, SJR: 3.043, CiteScore: 6)
Advances in Carbohydrate Chemistry and Biochemistry     Full-text available via subscription   (Followers: 7, SJR: 1.453, CiteScore: 2)
Advances in Catalysis     Full-text available via subscription   (Followers: 5, SJR: 1.992, CiteScore: 5)
Advances in Cell Aging and Gerontology     Full-text available via subscription   (Followers: 3)
Advances in Cellular and Molecular Biology of Membranes and Organelles     Full-text available via subscription   (Followers: 12)
Advances in Chemical Engineering     Full-text available via subscription   (Followers: 27, SJR: 0.156, CiteScore: 1)
Advances in Child Development and Behavior     Full-text available via subscription   (Followers: 10, SJR: 0.713, CiteScore: 1)
Advances in Chronic Kidney Disease     Full-text available via subscription   (Followers: 10, SJR: 1.316, CiteScore: 2)
Advances in Clinical Chemistry     Full-text available via subscription   (Followers: 28, SJR: 1.562, CiteScore: 3)
Advances in Colloid and Interface Science     Full-text available via subscription   (Followers: 19, SJR: 1.977, CiteScore: 8)
Advances in Computers     Full-text available via subscription   (Followers: 14, SJR: 0.205, CiteScore: 1)
Advances in Dermatology     Full-text available via subscription   (Followers: 15)
Advances in Developmental Biology     Full-text available via subscription   (Followers: 11)
Advances in Digestive Medicine     Open Access   (Followers: 8)
Advances in DNA Sequence-Specific Agents     Full-text available via subscription   (Followers: 5)
Advances in Drug Research     Full-text available via subscription   (Followers: 23)
Advances in Ecological Research     Full-text available via subscription   (Followers: 42, SJR: 2.524, CiteScore: 4)
Advances in Engineering Software     Hybrid Journal   (Followers: 27, SJR: 1.159, CiteScore: 4)
Advances in Experimental Biology     Full-text available via subscription   (Followers: 7)
Advances in Experimental Social Psychology     Full-text available via subscription   (Followers: 43, SJR: 5.39, CiteScore: 8)
Advances in Exploration Geophysics     Full-text available via subscription   (Followers: 1)
Advances in Fluorine Science     Full-text available via subscription   (Followers: 9)
Advances in Food and Nutrition Research     Full-text available via subscription   (Followers: 53, SJR: 0.591, CiteScore: 2)
Advances in Fuel Cells     Full-text available via subscription   (Followers: 17)
Advances in Genetics     Full-text available via subscription   (Followers: 15, SJR: 1.354, CiteScore: 4)
Advances in Genome Biology     Full-text available via subscription   (Followers: 8, SJR: 12.74, CiteScore: 13)
Advances in Geophysics     Full-text available via subscription   (Followers: 6, SJR: 1.193, CiteScore: 3)
Advances in Heat Transfer     Full-text available via subscription   (Followers: 21, SJR: 0.368, CiteScore: 1)
Advances in Heterocyclic Chemistry     Full-text available via subscription   (Followers: 11, SJR: 0.749, CiteScore: 3)
Advances in Human Factors/Ergonomics     Full-text available via subscription   (Followers: 22)
Advances in Imaging and Electron Physics     Full-text available via subscription   (Followers: 2, SJR: 0.193, CiteScore: 0)
Advances in Immunology     Full-text available via subscription   (Followers: 37, SJR: 4.433, CiteScore: 6)
Advances in Inorganic Chemistry     Full-text available via subscription   (Followers: 8, SJR: 1.163, CiteScore: 2)
Advances in Insect Physiology     Full-text available via subscription   (Followers: 2, SJR: 1.938, CiteScore: 3)
Advances in Integrative Medicine     Hybrid Journal   (Followers: 6, SJR: 0.176, CiteScore: 0)
Advances in Intl. Accounting     Full-text available via subscription   (Followers: 3)
Advances in Life Course Research     Hybrid Journal   (Followers: 8, SJR: 0.682, CiteScore: 2)
Advances in Lipobiology     Full-text available via subscription   (Followers: 1)
Advances in Magnetic and Optical Resonance     Full-text available via subscription   (Followers: 9)
Advances in Marine Biology     Full-text available via subscription   (Followers: 14, SJR: 0.88, CiteScore: 2)
Advances in Mathematics     Full-text available via subscription   (Followers: 11, SJR: 3.027, CiteScore: 2)
Advances in Medical Sciences     Hybrid Journal   (Followers: 6, SJR: 0.694, CiteScore: 2)
Advances in Medicinal Chemistry     Full-text available via subscription   (Followers: 5)
Advances in Microbial Physiology     Full-text available via subscription   (Followers: 4, SJR: 1.158, CiteScore: 3)
Advances in Molecular and Cell Biology     Full-text available via subscription   (Followers: 21)
Advances in Molecular and Cellular Endocrinology     Full-text available via subscription   (Followers: 8)
Advances in Molecular Toxicology     Full-text available via subscription   (Followers: 7, SJR: 0.182, CiteScore: 0)
Advances in Nanoporous Materials     Full-text available via subscription   (Followers: 3)
Advances in Oncobiology     Full-text available via subscription   (Followers: 1)
Advances in Organ Biology     Full-text available via subscription   (Followers: 1)
Advances in Organometallic Chemistry     Full-text available via subscription   (Followers: 16, SJR: 1.875, CiteScore: 4)
Advances in Parallel Computing     Full-text available via subscription   (Followers: 6, SJR: 0.174, CiteScore: 0)
Advances in Parasitology     Full-text available via subscription   (Followers: 5, SJR: 1.579, CiteScore: 4)
Advances in Pediatrics     Full-text available via subscription   (Followers: 24, SJR: 0.461, CiteScore: 1)
Advances in Pharmaceutical Sciences     Full-text available via subscription   (Followers: 10)
Advances in Pharmacology     Full-text available via subscription   (Followers: 16, SJR: 1.536, CiteScore: 3)
Advances in Physical Organic Chemistry     Full-text available via subscription   (Followers: 8, SJR: 0.574, CiteScore: 1)
Advances in Phytomedicine     Full-text available via subscription  
Advances in Planar Lipid Bilayers and Liposomes     Full-text available via subscription   (Followers: 3, SJR: 0.109, CiteScore: 1)
Advances in Plant Biochemistry and Molecular Biology     Full-text available via subscription   (Followers: 8)
Advances in Plant Pathology     Full-text available via subscription   (Followers: 5)
Advances in Porous Media     Full-text available via subscription   (Followers: 5)
Advances in Protein Chemistry     Full-text available via subscription   (Followers: 18)
Advances in Protein Chemistry and Structural Biology     Full-text available via subscription   (Followers: 19, SJR: 0.791, CiteScore: 2)
Advances in Psychology     Full-text available via subscription   (Followers: 59)
Advances in Quantum Chemistry     Full-text available via subscription   (Followers: 6, SJR: 0.371, CiteScore: 1)
Advances in Radiation Oncology     Open Access   (SJR: 0.263, CiteScore: 1)
Advances in Small Animal Medicine and Surgery     Hybrid Journal   (Followers: 3, SJR: 0.101, CiteScore: 0)
Advances in Space Biology and Medicine     Full-text available via subscription   (Followers: 5)
Advances in Space Research     Full-text available via subscription   (Followers: 386, SJR: 0.569, CiteScore: 2)
Advances in Structural Biology     Full-text available via subscription   (Followers: 5)
Advances in Surgery     Full-text available via subscription   (Followers: 10, SJR: 0.555, CiteScore: 2)
Advances in the Study of Behavior     Full-text available via subscription   (Followers: 30, SJR: 2.208, CiteScore: 4)
Advances in Veterinary Medicine     Full-text available via subscription   (Followers: 17)
Advances in Veterinary Science and Comparative Medicine     Full-text available via subscription   (Followers: 13)
Advances in Virus Research     Full-text available via subscription   (Followers: 5, SJR: 2.262, CiteScore: 5)
Advances in Water Resources     Hybrid Journal   (Followers: 46, SJR: 1.551, CiteScore: 3)
Aeolian Research     Hybrid Journal   (Followers: 6, SJR: 1.117, CiteScore: 3)
Aerospace Science and Technology     Hybrid Journal   (Followers: 337, SJR: 0.796, CiteScore: 3)
AEU - Intl. J. of Electronics and Communications     Hybrid Journal   (Followers: 8, SJR: 0.42, CiteScore: 2)
African J. of Emergency Medicine     Open Access   (Followers: 6, SJR: 0.296, CiteScore: 0)
Ageing Research Reviews     Hybrid Journal   (Followers: 10, SJR: 3.671, CiteScore: 9)
Aggression and Violent Behavior     Hybrid Journal   (Followers: 437, SJR: 1.238, CiteScore: 3)
Agri Gene     Hybrid Journal   (SJR: 0.13, CiteScore: 0)
Agricultural and Forest Meteorology     Hybrid Journal   (Followers: 15, SJR: 1.818, CiteScore: 5)
Agricultural Systems     Hybrid Journal   (Followers: 31, SJR: 1.156, CiteScore: 4)
Agricultural Water Management     Hybrid Journal   (Followers: 43, SJR: 1.272, CiteScore: 3)
Agriculture and Agricultural Science Procedia     Open Access   (Followers: 1)
Agriculture and Natural Resources     Open Access   (Followers: 2)
Agriculture, Ecosystems & Environment     Hybrid Journal   (Followers: 56, SJR: 1.747, CiteScore: 4)
Ain Shams Engineering J.     Open Access   (Followers: 5, SJR: 0.589, CiteScore: 3)
Air Medical J.     Hybrid Journal   (Followers: 6, SJR: 0.26, CiteScore: 0)
AKCE Intl. J. of Graphs and Combinatorics     Open Access   (SJR: 0.19, CiteScore: 0)
Alcohol     Hybrid Journal   (Followers: 11, SJR: 1.153, CiteScore: 3)
Alcoholism and Drug Addiction     Open Access   (Followers: 9)
Alergologia Polska : Polish J. of Allergology     Full-text available via subscription   (Followers: 1)
Alexandria Engineering J.     Open Access   (Followers: 1, SJR: 0.604, CiteScore: 3)
Alexandria J. of Medicine     Open Access   (Followers: 1, SJR: 0.191, CiteScore: 1)
Algal Research     Partially Free   (Followers: 10, SJR: 1.142, CiteScore: 4)
Alkaloids: Chemical and Biological Perspectives     Full-text available via subscription   (Followers: 2)
Allergologia et Immunopathologia     Full-text available via subscription   (Followers: 1, SJR: 0.504, CiteScore: 1)
Allergology Intl.     Open Access   (Followers: 5, SJR: 1.148, CiteScore: 2)
Alpha Omegan     Full-text available via subscription   (SJR: 3.521, CiteScore: 6)
ALTER - European J. of Disability Research / Revue Européenne de Recherche sur le Handicap     Full-text available via subscription   (Followers: 9, SJR: 0.201, CiteScore: 1)
Alzheimer's & Dementia     Hybrid Journal   (Followers: 50, SJR: 4.66, CiteScore: 10)
Alzheimer's & Dementia: Diagnosis, Assessment & Disease Monitoring     Open Access   (Followers: 4, SJR: 1.796, CiteScore: 4)
Alzheimer's & Dementia: Translational Research & Clinical Interventions     Open Access   (Followers: 4, SJR: 1.108, CiteScore: 3)
Ambulatory Pediatrics     Hybrid Journal   (Followers: 6)
American Heart J.     Hybrid Journal   (Followers: 50, SJR: 3.267, CiteScore: 4)
American J. of Cardiology     Hybrid Journal   (Followers: 51, SJR: 1.93, CiteScore: 3)
American J. of Emergency Medicine     Hybrid Journal   (Followers: 44, SJR: 0.604, CiteScore: 1)
American J. of Geriatric Pharmacotherapy     Full-text available via subscription   (Followers: 10)
American J. of Geriatric Psychiatry     Hybrid Journal   (Followers: 14, SJR: 1.524, CiteScore: 3)
American J. of Human Genetics     Hybrid Journal   (Followers: 32, SJR: 7.45, CiteScore: 8)
American J. of Infection Control     Hybrid Journal   (Followers: 26, SJR: 1.062, CiteScore: 2)
American J. of Kidney Diseases     Hybrid Journal   (Followers: 34, SJR: 2.973, CiteScore: 4)
American J. of Medicine     Hybrid Journal   (Followers: 43)
American J. of Medicine Supplements     Full-text available via subscription   (Followers: 3, SJR: 1.967, CiteScore: 2)
American J. of Obstetrics and Gynecology     Hybrid Journal   (Followers: 201, SJR: 2.7, CiteScore: 4)
American J. of Ophthalmology     Hybrid Journal   (Followers: 61, SJR: 3.184, CiteScore: 4)
American J. of Ophthalmology Case Reports     Open Access   (Followers: 5, SJR: 0.265, CiteScore: 0)
American J. of Orthodontics and Dentofacial Orthopedics     Full-text available via subscription   (Followers: 6, SJR: 1.289, CiteScore: 1)
American J. of Otolaryngology     Hybrid Journal   (Followers: 25, SJR: 0.59, CiteScore: 1)
American J. of Pathology     Hybrid Journal   (Followers: 27, SJR: 2.139, CiteScore: 4)
American J. of Preventive Medicine     Hybrid Journal   (Followers: 27, SJR: 2.164, CiteScore: 4)
American J. of Surgery     Hybrid Journal   (Followers: 37, SJR: 1.141, CiteScore: 2)
American J. of the Medical Sciences     Hybrid Journal   (Followers: 12, SJR: 0.767, CiteScore: 1)
Ampersand : An Intl. J. of General and Applied Linguistics     Open Access   (Followers: 6)
Anaerobe     Hybrid Journal   (Followers: 4, SJR: 1.144, CiteScore: 3)
Anaesthesia & Intensive Care Medicine     Full-text available via subscription   (Followers: 63, SJR: 0.138, CiteScore: 0)
Anaesthesia Critical Care & Pain Medicine     Full-text available via subscription   (Followers: 15, SJR: 0.411, CiteScore: 1)
Anales de Cirugia Vascular     Full-text available via subscription  
Anales de Pediatría     Full-text available via subscription   (Followers: 3, SJR: 0.277, CiteScore: 0)
Anales de Pediatría (English Edition)     Full-text available via subscription  
Anales de Pediatría Continuada     Full-text available via subscription  
Analytic Methods in Accident Research     Hybrid Journal   (Followers: 5, SJR: 4.849, CiteScore: 10)
Analytica Chimica Acta     Hybrid Journal   (Followers: 39, SJR: 1.512, CiteScore: 5)
Analytical Biochemistry     Hybrid Journal   (Followers: 175, SJR: 0.633, CiteScore: 2)
Analytical Chemistry Research     Open Access   (Followers: 10, SJR: 0.411, CiteScore: 2)
Analytical Spectroscopy Library     Full-text available via subscription   (Followers: 11)
Anesthésie & Réanimation     Full-text available via subscription   (Followers: 2)
Anesthesiology Clinics     Full-text available via subscription   (Followers: 23, SJR: 0.683, CiteScore: 2)
Angiología     Full-text available via subscription   (SJR: 0.121, CiteScore: 0)
Angiologia e Cirurgia Vascular     Open Access   (Followers: 1, SJR: 0.111, CiteScore: 0)

        1 2 3 4 5 6 7 8 | Last   [Sort by number of followers]   [Restore default list]

Journal Cover
Ad Hoc Networks
Journal Prestige (SJR): 0.53
Citation Impact (citeScore): 4
Number of Followers: 11  
 
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 1570-8705
Published by Elsevier Homepage  [3163 journals]
  • Drone Cellular Networks: Enhancing the Quality Of Experience of video
           streaming applications
    • Authors: Ludovico Ferranti; Francesca Cuomo; Stefania Colonnese; Tommaso Melodia
      Abstract: Publication date: September 2018
      Source:Ad Hoc Networks, Volume 78
      Author(s): Ludovico Ferranti, Francesca Cuomo, Stefania Colonnese, Tommaso Melodia
      This article addresses the problem of delay mitigation for video streaming applications in congested cellular macro-cells by using a mobile micro-cell mounted on an Unmanned Aerial Vehicle (UAV). Small-scale UAVs are at a mature stage of development and can carry lightweight commercial micro-cells with small form factor. The mobile micro-cell is used to offload users from a congested macro-cell to optimize the bandwidth usage of video streaming applications. The paper proposes algorithms and comprehensive design criteria for user offload selection (selecting what users need to be offloaded to the micro-cell) and drone positioning (selecting the position of the UAV that minimizes the network delay). The effectiveness of the proposed criteria is evaluated through extensive performance analysis. We show that the performance increases consistently in terms of bandwidth requests mitigation and average delay reduction under different system configurations.

      PubDate: 2018-05-28T10:02:36Z
      DOI: 10.1016/j.adhoc.2018.05.003
      Issue No: Vol. 78 (2018)
       
  • Topology control game algorithm based on Markov lifetime prediction model
           for wireless sensor network
    • Authors: Xiaochen Hao; Liyuan Wang; Ning Yao; Dehua Geng; Bai Chen
      Abstract: Publication date: September 2018
      Source:Ad Hoc Networks, Volume 78
      Author(s): Xiaochen Hao, Liyuan Wang, Ning Yao, Dehua Geng, Bai Chen
      Since the wireless sensor network (WSN) consists of large number of sensors with limited energy resource, how to prolong the network lifetime is an inherent problem in wireless sensor network topology control. Motivated with this problem, we present a novel Markov lifetime prediction model (MLPM) for each single node to forecast their lifetime from a mode transition perspective. MLPM realizes the real-time prediction of node lifetime until the node died. Besides, on the basis of this model, this paper proposes TCAMLPM, a distributed topology control game algorithm for WSN which ensures the algorithm to converge to Nash Equilibrium by making use of the best response strategy. With TCAMLPM, energy conservation is accomplished by adjusting transmitting power of the nodes. The comparison results of our algorithm with the other algorithm that also aims at maximizing the network lifetime show that TCAMLPM not only extends the network lifetime, but also performs better in guaranteeing the network connectivity and robustness.

      PubDate: 2018-05-28T10:02:36Z
      DOI: 10.1016/j.adhoc.2018.05.006
      Issue No: Vol. 78 (2018)
       
  • QoS-based distributed flow management in software defined ultra-dense
           networks
    • Authors: Tuğçe Bilen; Kübra Ayvaz; Berk Canberk
      Pages: 24 - 31
      Abstract: Publication date: September 2018
      Source:Ad Hoc Networks, Volume 78
      Author(s): Tuğçe Bilen, Kübra Ayvaz, Berk Canberk
      Ultra-dense small cell deployment is a promising solution to meet the 1000 ×  throughput improvement desired in next-generation wireless networks. This deployment results in a correspondingly high number of small cells, also increasing the complexity of the architecture. The Software-Defined Networking (SDN) can be used as a solution to ease the management of Ultra-Dense data plane with distributed controllers. However, in a distributed architecture, the load must be balanced among the controllers and an outage in any controller should not damage the management of the network. In order to recover from an outage by considering load distributions, we propose a distributed flow management model in Software-Defined Ultra-Dense Networks based on the queuing theory. In this approach, we model the distributed controllers with different Markovian queuing systems by considering the flow characteristics and outage. Thus, the proposed flow separation module divides the incoming flows of controllers according to the characteristics of mice and elephant during modeling. Correspondingly, incoming mice and elephant flows are modeled by using M/M/1 and MX /M/1 systems with additional M/M/c queue until the detection of the outage. The M/M/c queues are used for outage detection thanks to Erlang-C parameter. On the other hand, the M/M/1 and MX /M/1 systems are used to load estimations of mice and elephant flows. Therefore, the mice and elephant flows of the outage controllers are transferred to the compensatory controllers by considering the estimated load distributions. Thence, the M/M/c queues of the compensatory controllers are converted to the M/MY /1 system to satisfy the massive flow traffic with bulk service. With this method, we are able to decrease the waiting times of mice and elephant flows during the outage by 15% and 11% respectively compared to the conventional distributed controller implementation. Moreover, the packet losses of the controllers during the outage are decreased by 32% compared to the conventional implementation.

      PubDate: 2018-05-31T10:21:10Z
      DOI: 10.1016/j.adhoc.2018.05.002
      Issue No: Vol. 78 (2018)
       
  • Node localization with AoA assistance in multi-hop underwater sensor
           networks
    • Authors: Huai Huang; Yahong Rosa Zheng
      Pages: 32 - 41
      Abstract: Publication date: September 2018
      Source:Ad Hoc Networks, Volume 78
      Author(s): Huai Huang, Yahong Rosa Zheng
      This paper proposes a novel node localization method in sparse underwater wireless sensor networks (UWSNs) where the locations of only a small number of anchor nodes are available. The proposed method estimates the Euclidean distances from anchor nodes to multi-hop sensor nodes with the help of angle of arrival (AoA) measurements in the local coordinate systems of the routing nodes. A new distance estimation method is proposed for sensor nodes with greater-than-two-hops to an anchor node by accurately estimating the rotation matrix between the routing nodes. By forwarding distances hop-by-hop through the network, the sensor nodes are able to obtain distance estimates to more than four or five anchor nodes. Then the location of the sensor node is solved by a weighted Least Squares method. This paper develops a practical table of weights for different number of hops and AoA estimation errors. Simulation results show that the proposed localization method outperforms the existing multi-hop localization algorithms, such as DV-hop, DV-distance, Euclidean, and Cosine-law methods, in terms of distance estimation and location estimation, even if the AoA measurement error is large. Meanwhile, the proposed method maintains almost the same high localization coverage as the existing methods.

      PubDate: 2018-06-03T10:32:12Z
      DOI: 10.1016/j.adhoc.2018.05.005
      Issue No: Vol. 78 (2018)
       
  • Path planning for mobile-anchor based wireless sensor network
           localization: Static and dynamic schemes
    • Authors: Ecenaz Erdemir; T. Engin Tuncer
      Pages: 1 - 10
      Abstract: Publication date: August 2018
      Source:Ad Hoc Networks, Volume 77
      Author(s): Ecenaz Erdemir, T. Engin Tuncer
      In wireless sensor networks, node locations are required for many applications. Usually, anchors with known positions are employed for localization. Sensor positions can be estimated more efficiently by using mobile anchors (MAs). Finding the best MA trajectory is an important problem in this context. Various path planning algorithms are proposed to localize as many sensors as possible by following the shortest path with minimum number of anchors. In this paper, path planning algorithms for MA assisted localization are proposed for both static and dynamic schemes. These approaches use MAs by stopping at minimum number of nodes to cover the monitoring area with shortest path length. A novel node localization algorithm based on alternating minimization is proposed. The performances of the proposed path planning algorithms are compared with previous approaches through simulations. The results show that more sensors are localized with less anchors in a shorter path and time for both schemes.

      PubDate: 2018-05-28T10:02:36Z
      DOI: 10.1016/j.adhoc.2018.04.005
      Issue No: Vol. 77 (2018)
       
  • Round-table negotiation for fast restoration of connectivity in
           partitioned wireless sensor networks
    • Authors: Sachin Shriwastav; Debasish Ghose
      Pages: 11 - 27
      Abstract: Publication date: August 2018
      Source:Ad Hoc Networks, Volume 77
      Author(s): Sachin Shriwastav, Debasish Ghose
      This paper addresses the problem of restoration of connectivity in wireless sensor networks after multiple simultaneous node failures. Such failures of multiple nodes may split the network into several clusters. These clusters are unaware of their own size, surviving nodes and links as well as size and location of other survivor clusters. A distributed and autonomous approach of reconnecting disjoint clusters in a short time is proposed, in which each survivor cluster undergoes a self-discovery process where it compiles information of connected survivors and then sends a negotiator to participate in a round table negotiation and decision-making process. All such negotiators exchange information and decide upon reconnection paths between clusters through known dead node locations and then assign nodes to be deployed on those paths, using available nodes. The negotiators then return to their respective clusters, convey the decision and the reconnection process is carried out. Analytical results of the self-discovery process have been obtained and simulation results on a large network are presented to illustrate the process. It is shown through a detailed comparison with existing methods that the proposed approach achieves reconnection in significantly lower time and compares favorably with respect to other performance metrics as well.

      PubDate: 2018-05-28T10:02:36Z
      DOI: 10.1016/j.adhoc.2018.04.008
      Issue No: Vol. 77 (2018)
       
  • BAN-GZKP: Optimal Zero Knowledge Proof based Scheme for Wireless Body Area
           Networks
    • Authors: Gewu Bu; Maria Potop-Butucaru
      Pages: 28 - 41
      Abstract: Publication date: August 2018
      Source:Ad Hoc Networks, Volume 77
      Author(s): Gewu Bu, Maria Potop-Butucaru
      We propose BAN-GZKP, a new BANZKP Zero Knowledge Proof (ZKP) based secure lightweight and energy efficient authentication scheme designed for Wireless Area Network (WBAN). BAN-GZKP improves the BANZKP scheme known as the best to date. BANZKP is vulnerable to several security attacks such as the replay attack, Distributed Denial-of-Service (DDoS) attacks at sink and redundancy information crack. However, BANZKP needs an end-to-end authentication which is not compliant with the human body postural mobility. Our scheme BAN-GZKP improves both the security and postural mobility resilience of BANZKP. Moreover, BAN-GZKP uses only a three-phase authentication which is optimal in the class of ZKP protocols. To fix the security vulnerabilities of BANZKP, BAN-GZKP uses a novel random key allocation and a Hop-by-Hop authentication definition. We further prove the reliability of our scheme to various attacks including those to which BANZKP is vulnerable. Furthermore, via extensive simulations we prove that our scheme, BAN-GZKP, outperforms BANZKP in terms of reliability to human body postural mobility for various network parameters (end-to-end delay, number of packets exchanged in the network, number of transmissions). We compared both schemes using representative convergecast strategies with various transmission rates and human postural mobility. Finally, it is important to mention that BAN-GZKP has no additional cost compared to BANZKP in terms memory, providing better computational complexity and less energy consumption.

      PubDate: 2018-05-28T10:02:36Z
      DOI: 10.1016/j.adhoc.2018.04.006
      Issue No: Vol. 77 (2018)
       
  • A proactive scalable approach for reliable cluster formation in wireless
           networks with D2D offloading
    • Authors: Sanaa Sharafeddine; Omar Farhat
      Pages: 42 - 53
      Abstract: Publication date: August 2018
      Source:Ad Hoc Networks, Volume 77
      Author(s): Sanaa Sharafeddine, Omar Farhat
      With the current exponential growth in traffic and service demands, device-to-device (D2D) cooperation is identified as a major mechanism to enable 5G networks to effectively and efficiently augment network resources. The effectiveness of D2D cooperation depends on a wide range of decision making processes that include cluster formation, resource allocation, in addition to connection and mobility management. Irrespective of the D2D cooperation scenario whether in sensor, ad hoc, or cellular networks, the literature normally assumes that devices selected as relays or data sources are reliable; this means that they will maintain the connection till the communication session ends. Yet, this assumption is challenged in practice since devices’ batteries can be depleted (e.g., sensors in an IoT network) and devices can move leading to connection termination (e.g., mobile users in a WiFi network or cars in a vehicular ad hoc network). To this end, we address the problem of reliable D2D cooperation in wireless networks by proposing a novel approach that is proactive by utilizing reliability metrics in the decision making process, and scalable by having low implementation complexity suitable for dense networks. These differentiating factors are shown to enhance the overall network reliability compared to standard techniques and to facilitate dynamic operation which is essential for practical implementation. Performance is evaluated using extensive simulations in addition to test bed experimental demonstration in order to quantify gains and extract insights on a range of existing design tradeoffs.

      PubDate: 2018-05-28T10:02:36Z
      DOI: 10.1016/j.adhoc.2018.04.010
      Issue No: Vol. 77 (2018)
       
  • On heterogeneous duty cycles for neighbor discovery in wireless sensor
           networks
    • Authors: Lin Chen; Ruolin Fan; Yangbin Zhang; Shuyu Shi; Kaigui Bian; Lin Chen; Pan Zhou; Mario Gerla; Tao Wang; Xiaoming Li
      Pages: 54 - 68
      Abstract: Publication date: August 2018
      Source:Ad Hoc Networks, Volume 77
      Author(s): Lin Chen, Ruolin Fan, Yangbin Zhang, Shuyu Shi, Kaigui Bian, Lin Chen, Pan Zhou, Mario Gerla, Tao Wang, Xiaoming Li
      Neighbor discovery plays a crucial role in the formation of wireless sensor networks and mobile networks where the power of sensors (or mobile devices) is constrained. Due to the difficulty of clock synchronization, many asynchronous protocols based on wake-up scheduling have been developed over the years in order to enable timely neighbor discovery between neighboring sensors while saving energy. However, existing protocols are not fine-grained enough to support all heterogeneous battery duty cycles, which can lead to a more rapid deterioration of long-term battery health for those without support. Existing research can be broadly divided into two categories according to their neighbor-discovery techniques—the quorum-based protocols and the co-primality based protocols. In this paper, we propose two neighbor discovery protocols, called Hedis and Todis, that control the duty cycle granularity of quorum and co-primality based protocols respectively, by enabling the finest-grained control of heterogeneous duty cycles. We compare the two optimal protocols via analytical and simulation results, which show that the optimal co-primality based protocol (Todis) is not only simpler in its design, but also has a better performance.

      PubDate: 2018-05-28T10:02:36Z
      DOI: 10.1016/j.adhoc.2018.04.007
      Issue No: Vol. 77 (2018)
       
  • Where have all the MPRs gone' On the optimal selection of Multi-Point
           Relays
    • Authors: Leonardo Maccari; Mirko Maischberger; Renato Lo Cigno
      Pages: 69 - 83
      Abstract: Publication date: August 2018
      Source:Ad Hoc Networks, Volume 77
      Author(s): Leonardo Maccari, Mirko Maischberger, Renato Lo Cigno
      Optimized Link State Routing (OLSR) is a widespread routing protocol in wireless mesh networks: static, mobile, ad-hoc, and even sensor networks. The selection of Multi-Point Relays (MPR) that form a signaling backbone is at the heart of the protocol and it is a crucial process to reduce the signaling overhead. Since the protocol proposal and specification, the original heuristic for MPRs selection has been largely studied showing it has good local properties; however, this does not give insight about the properties of the global set of MPRs. Here lays the contribution of this paper: First we define the problem of the minimization of the global MPR set (the union of all the MPR sets) as a centralized integer linear programming problem, which is NP-hard. We are able to solve it for networks of practical size, up to 150 nodes. Second, we define a bound that we call the “distributed optimum,” which we show to be a lower bound for distributed MPR selection algorithms, still requiring considerable power to be computed. Finally, we set-up an experimental performance evaluation methodology and we show that a heuristic that we recently proposed performs very close to the distributed optimum, and always outperforms the original heuristic.

      PubDate: 2018-05-28T10:02:36Z
      DOI: 10.1016/j.adhoc.2018.04.012
      Issue No: Vol. 77 (2018)
       
  • KM-based efficient algorithms for optimal packet scheduling problem in
           celluar/infostation integrated networks
    • Authors: Zhenguo Gao; Danjie Chen; Peng Sun; Shaobin Cai
      Pages: 84 - 94
      Abstract: Publication date: August 2018
      Source:Ad Hoc Networks, Volume 77
      Author(s): Zhenguo Gao, Danjie Chen, Peng Sun, Shaobin Cai
      Request models in previous works on the Packet Scheduling (PS) problem in cellular/infostation integrated networks usually have some restrictions which make them less practical in some situations. In this paper, we investigate the packet scheduling problem with our new request model, which is general enough to include previous request models as special cases. We first propose a Greedy algorithm for the PS problem and analyze its approximation ratio. We then transform our PS problem to the mini-slot mini-request version PS problem (MSMR-PS problem) by using the concept of mini-slot and mini-request. Next, by embedding problem information into bipartite graphs, we investigate the relationships between the MSMR-PS problem and the corresponding maximum matching (MM) problem on these graphs. Based on these relations, we propose efficient algorithms to obtain quasi-optimal solutions to the original PS problem by using the Kuhn–Munkres (KM) algorithm to solve the MM problems on the bipartite graphs. These algorithms include two offline algorithms (named as KMUpper and KMLower) and one online algorithm named KMOnline. KMUpper and KMLower return upper and lower bounds for optimal profit of the PS problem, respectively. Simulation results show that our algorithms are more preferable than the other existing algorithms like FIFO, exponential capacity algorithm.

      PubDate: 2018-05-28T10:02:36Z
      DOI: 10.1016/j.adhoc.2018.05.001
      Issue No: Vol. 77 (2018)
       
  • A selective multipath routing protocol for ubiquitous networks
    • Authors: Alexandros Ladas; Deepak G. C.; Nikolaos Pavlatos; Christos Politis
      Pages: 95 - 107
      Abstract: Publication date: August 2018
      Source:Ad Hoc Networks, Volume 77
      Author(s): Alexandros Ladas, Deepak G. C., Nikolaos Pavlatos, Christos Politis
      During the past years, ubiquitous networks have become an interesting topic for research due to their flexible and independent nature in terms of network infrastructure. A lot of effort has been made around the design of efficient routing protocols, mainly because of their unique characteristics, such as, dynamic topology, high mobility and limited bandwidth. In this paper, we propose a new routing protocol which is based on our Multipath-ChaMeLeon (M-CML) routing protocol. We perform a network optimization analysis of M-CML under a series of simulations taking into account three Quality of Service (QoS) metrics and we provide the results with statistical confidence interval by applying the Wilcoxon signed-rank test model. On top of the outcome of the analysis, we also apply an intelligent algorithm to enhance our protocol’s effectiveness by reducing the improvident emission of data packets. The new protocol, named M-CMLv2, is compared to OLSR, AOMDV and M-CML using the NS-3 simulator. The acquired results indicate that M-CMLv2 reduces the redundant information, maintains good performance at successfully delivering packets with acceptable end-to-end delay, while at the same time, it reduces the network’s routing load and the energy consumption of the nodes.

      PubDate: 2018-05-28T10:02:36Z
      DOI: 10.1016/j.adhoc.2018.04.013
      Issue No: Vol. 77 (2018)
       
  • Low complexity resource allocation in the relay channels with energy
           harvesting transmitters
    • Authors: Mahmood Mohassel Feghhi; Aliazam Abbasfar; Mahtab Mirmohseni
      Pages: 108 - 118
      Abstract: Publication date: August 2018
      Source:Ad Hoc Networks, Volume 77
      Author(s): Mahmood Mohassel Feghhi, Aliazam Abbasfar, Mahtab Mirmohseni
      Energy Harvesting (EH) is a novel technique to prolong the lifetime of the wireless Ad-hoc and sensor networks with replenishable nodes. In this sense, it has emerged as a promising technique for Green Communications. On the other hand, cooperative communication with the help of relay nodes improves the performance of wireless communication networks. In this paper, we investigate the cooperation in EH nodes. We consider the optimal power and rate allocation in the full-duplex Gaussian relay channel in which source and relay can harvest energy from their environments. In our model, the energy arrivals at the source and the relay are general stochastic processes with known EH times and amounts before the start of transmission. This problem has a constrained min-max optimization form that is not easy to solve. We propose a method based on a mathematical theorem to decompose it into two problems: the first problem has a tractable convex optimization form and can be solved efficiently. We show that the second problem is an unconstrained discrete convex optimization problem, which has the complexity of O(K 2), instead of O(2 K ), where K is the dimension of variables. Also, we provide some numerical examples that confirm our results.

      PubDate: 2018-05-28T10:02:36Z
      DOI: 10.1016/j.adhoc.2018.05.004
      Issue No: Vol. 77 (2018)
       
  • A robust mutual authentication protocol for WSN with multiple
           base-stations
    • Authors: Ruhul Amin; SK Hafizul Islam; G.P. Biswas; Mohammad S. Obaidat
      Pages: 1 - 18
      Abstract: Publication date: June–July 2018
      Source:Ad Hoc Networks, Volumes 75–76
      Author(s): Ruhul Amin, SK Hafizul Islam, G.P. Biswas, Mohammad S. Obaidat
      Security and Privacy are very crucial for data communication in Wireless Sensor Networks (WSNs). In order to provide ample security, recently many user authentication and key agreement (UAKA) protocols with single base-station have been put forward for WSNs. The base-station experienced huge load for such type of protocol, and thus, the quality of the service is dramatically reduced with the increasing number of users. This problem can be eliminated if the load is distributed to multiple base-stations. However, multiple base-stations based UAKA (MBS-UAKA) protocol with for WSN has not yet been proposed. This paper focuses to design a robust and effective MBS-UAKA protocol for WSN, which makes the secure communication as well as authentication. We evaluated all the known security properties of our MBS-UAKA protocol through formal and informal security analysis. Besides, the BAN logic analysis ensures that our MBS-UAKA protocol satisfies the mutual authentication property. Our comparative analysis ensures better performance compared to existing research works.
      Graphical abstract image

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

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

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

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

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

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

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

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

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

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

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

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

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

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.03.012
      Issue No: Vol. 74 (2018)
       
  • Privacy Enabled Disjoint and Dynamic Address Auto-Configuration Protocol
           for 6LoWPAN
    • Abstract: Publication date: Available online 21 June 2018
      Source:Ad Hoc Networks
      Author(s): Monali Mavani, Krishna Asawa
      In unsecured 6LoWPANs, the nodes can be easily identified by their IPv6 as well as MAC addresses. An adversary can snoop (and later, spoof) these addresses, thereby posing a major threat against the node’s identity and communication integrity. Such threats necessitate enabling privacy by obscuring the node’s addresses. This study proposes a protocol for dynamic, auto-configuring and conflict-free IPv6 addressing scheme that attempts to ensure privacy of nodes. In the proposed protocol, each node obtains a three-level hierarchical IPv6 address space which is dynamically generated on basis of congruence classes. Use of congruence classes, along with hierarchical addressing, facilitates generation of inter-leaved (and hence, disjoint) and non-fragmented address space for each node, resulting in conflict free address auto-generation. Nodes auto-configure their address sets independently with congruence seeds shared by routers, potentially reducing router complexity. To ensure the MAC address privacy, MAC address also change when IPv6 address change and it is derived from the interface identification (IID) part of the IPv6 address. The proposed protocol runs on Contiki operating system, simulated in Cooja. Simulated results highlight lower latency and optimal communication costs when compared with existing protocols.

      PubDate: 2018-06-24T13:12:38Z
       
  • Enabling Individually Entrusted Routing Security for Open and
           Decentralized Community Networks
    • Abstract: Publication date: Available online 19 June 2018
      Source:Ad Hoc Networks
      Author(s): Axel Neumann, Leandro Navarro, Llorenç Cerdá-Alabern
      Routing in open and decentralized networks relies on cooperation. However, the participation of unknown nodes and node administrators pursuing heterogeneous trust and security goals is a challenge. Community-mesh networks are good examples of such environments due to their open structure, decentralized management, and ownership. As a result, existing community networks are vulnerable to various attacks and are seriously challenged by the obligation to find consensus on the trustability of participants within an increasing user size and diversity. We propose a practical and novel solution enabling a secured but decentralized trust management. This work presents the design and analysis of securely-entrusted multi-topology routing (SEMTOR), a set of routing-protocol mechanisms that enable the cryptographically secured negotiation and establishment of concurrent and individually trusted routing topologies for infrastructure-less networks without relying on any central management. The proposed mechanisms have been implemented, tested, and evaluated for their correctness and performance to exclude non-trusted nodes from the network. Respective safety and liveness properties that are guaranteed by our protocol have been identified and proven with formal reasoning. Benchmarking results, based on our implementation as part of the BMX7 routing protocol and tested on real and minimal (OpenWRT, 10 Euro) routers, qualify the behaviour, performance, and scalability of our approach, supporting networks with hundreds of nodes despite the use of strong asymmetric cryptography.

      PubDate: 2018-06-21T12:56:29Z
       
  • QoS-based Distributed Flow Management in Software Defined Ultra-Dense
           Networks
    • Abstract: Publication date: Available online 15 June 2018
      Source:Ad Hoc Networks
      Author(s): Tugce BILEN, Kübra AYVAZ, Berk CANBERK
      Ultra-dense small cell deployment is a promising solution to meet the 1000x throughput improvement desired in next-generation wireless networks. This deployment results in a correspondingly high number of small cells, also increasing the complexity of the architecture. The Software-Defined Networking (SDN) can be used as a solution to ease the management of Ultra-Dense data plane with distributed controllers. However, in a distributed architecture, the load must be balanced among the controllers and an outage in any controller should not damage the management of the network. In order to recover from an outage by considering load distributions, we propose a distributed flow management model in Software-Defined Ultra-Dense Networks based on the queuing theory. In this approach, we model the distributed controllers with different Markovian queuing systems by considering the flow characteristics and outage. Thus, the proposed flow separation module divides the incoming flows of controllers according to the characteristics of mice and elephant during modeling. Correspondingly, incoming mice and elephant flows are modeled by using M/M/1 and MX /M/1 systems with additional M/M/c queue until the detection of the outage. The M/M/c queues are used for outage detection thanks to Erlang-C parameter. On the other hand, the M/M/1 and MX /M/1 systems are used to load estimations of mice and elephant flows. Therefore, the mice and elephant flows of the outage controllers are transferred to the compensatory controllers by considering the estimated load distributions. Thence, the M/M/c queues of the compensatory controllers are converted to the M/MY /1 system to satisfy the massive flow traffic with bulk service. With this method, we are able to decrease the waiting times of mice and elephant flows during the outage by 15% and 11% respectively compared to the conventional distributed controller implementation. Moreover, the packet losses of the controllers during the outage are decreased by 32% compared to the conventional implementation.

      PubDate: 2018-06-18T12:24:53Z
       
  • Drone Cellular Networks: Enhancing the Quality of Experience of Video
           Streaming Applications
    • Abstract: Publication date: Available online 15 June 2018
      Source:Ad Hoc Networks
      Author(s): Ludovico Ferranti, Francesca Cuomo, Stefania Colonnese, Tommaso Melodia
      This article addresses the problem of delay mitigation for video streaming applications in congested cellular macro-cells by using a mobile micro-cell mounted on an Unmanned Aerial Vehicle (UAV). Small-scale UAVs are at a mature stage of development and can carry lightweight commercial micro-cells with small form factor. The mobile micro-cell is used to offload users from a congested macro-cell to optimize the bandwidth usage of video streaming applications. The paper proposes algorithms and comprehensive design criteria for user offload selection (selecting what users need to be offloaded to the micro-cell) and drone positioning (selecting the position of the UAV that minimizes the network delay). The effectiveness of the proposed criteria is evaluated through extensive performance analysis. We show that the performance increases consistently in terms of bandwidth requests mitigation and average delay reduction under different system configurations.

      PubDate: 2018-06-18T12:24:53Z
       
  • Security Architectures in Constrained Environments: a Survey
    • Abstract: Publication date: Available online 15 June 2018
      Source:Ad Hoc Networks
      Author(s): Philippe Pittoli, Pierre David, Thomas Noël
      This paper is a survey of the current work to understand the available security measures in the literature for constrained environments. First of all, this paper introduces the specific problem of security in constrained environments and the need for a consistent solution. The necessary set of security measures that must be present in an architecture is reviewed. Second, an overview of such consistent solutions in the literature is provided. Finally, a comparison of these solutions is performed based on the security and constraint aspects.

      PubDate: 2018-06-18T12:24:53Z
       
  • On Short-Length Error-Correcting codes for 5G-NR
    • Abstract: Publication date: Available online 15 June 2018
      Source:Ad Hoc Networks
      Author(s): Johannes Van Wonterghem, Amira Alloum, Joseph Jean Boutros, Marc Moeneclaey
      We compare the performance of a selection of short-length and very short-length linear binary error-correcting codes on the binary-input Gaussian noise channel, and on the fast and quasi-static flat Rayleigh fading channel. We use the probabilistic Ordered Statistics Decoder, that is universal to any code construction. As such we compare codes and not decoders. The word error rate versus the signal-to-noise ratio is found for LDPC, Reed-Muller, Polar, Turbo, Golay, random, and BCH codes at length 20, 32 and 256 bits. BCH and random codes outperform other codes in absence of a cyclic redundancy check concatenation. Under joint decoding, the concatenation of a cyclic redundancy check makes all codes perform very close to optimal lower bounds. Optimizations of the Ordered Statistics Decoder are discussed and revealed to bring near-ML performance with a notable complexity reduction, making the decoding complexity at very short length affordable.

      PubDate: 2018-06-18T12:24:53Z
       
  • A Disjoint Frame Topology-Independent TDMA MAC Policy for Safety
           Applications in Vehicular Networks
    • Abstract: Publication date: Available online 15 June 2018
      Source:Ad Hoc Networks
      Author(s): Vasileios Dragonas, Konstantinos Oikonomou, Konstantinos Giannakis, Ioannis Stavrakakis
      Medium access control (MAC) is a challenging problem in vehicular environments due to a constantly changing topology due to vehicle’s mobility and stringent delay requirements, especially for safety-related applications (e.g., for vehicular-to-vehicular communication). Consequently, topology-independent TDMA MAC policies that guarantee a number of successful transmissions per frame independently of the underlying topology, can be regarded as a suitable choice for the particular vehicular environment. One such policy (TiMAC) is revisited and considered in this paper for a vehicular environment and is also extended to one that considers disjoint frames depending on the vehicle’s direction of movement (d-TiMAC). Both TiMAC and d-TiMAC are evaluated against VeMAC – a well-established TDMA MAC protocol in the area of vehicular networks – based on simulations. It is observed that throughput under the considered TiMAC policy is close to that induced by VeMAC, whereas the number of retransmissions is reduced leading to a smaller time delay. Furthermore, the proposed d-TiMAC appears to achieve a higher throughput than VeMAC, and an even lower number of retransmissions (when compared to TiMAC), suggesting that d-TiMAC yields an even smaller time delay. Eventually, this observation is also supported when d-TiMAC is compared against TiMAC showing a further reduced number of retransmissions.

      PubDate: 2018-06-18T12:24:53Z
       
  • Energy-efficient Modulation and Physical Layer Design for Low Terahertz
           Band Communication Channel in 5G Femtocell Internet of Things
    • Abstract: Publication date: Available online 14 June 2018
      Source:Ad Hoc Networks
      Author(s): Nabil Khalid, Turker Yilmaz, Ozgur B. Akan
      High throughput capability of the terahertz band (0.3-10 THz) wireless communications is expected to be utilized by the fifth generation of mobile telecommunication systems and enable a plethora of new applications. Supporting devices will transfer large amounts of data in both directions, causing high energy consumption by the electronic circuitries of the equipment in use. Therefore, physical layer for these systems must be designed carefully in order to reduce energy consumption per bit. In this paper, the best performing modulation scheme and hardware parameters that minimize the energy consumption without affecting the system throughput are determined. THz band device technologies are outlined and a complete survey of the state-of-the-art low-THz band circuit blocks which are suitable for mass market production is given. It is shown that for short-range communications, M-ary quadrature amplitude modulation is the most energy-efficient technique that can lead up to 90% reduction in consumed energy. Moreover, optimal transceiver parameters which can be used to further minimize the energy consumption of the THz band system are examined.

      PubDate: 2018-06-18T12:24:53Z
       
  • IoT based Information and Communication System for Enhancing Underground
           Mines Safety and Productivity: Genesis, Taxonomy and Open Issues
    • Abstract: Publication date: Available online 11 June 2018
      Source:Ad Hoc Networks
      Author(s): Ankit Singh, Dheeraj Kumar, Jürgen Hötzel
      Underground mining operations require robust and efficient communication like other industrial enterprises. Communication in the mining industry is the most critical factor to ensure the safety and security of the underground working environment. A robust IT communication infrastructure in underground mining will enhance safety and provide information in real-time which can result in a quick response to some fatal situation. Communication technologies that are capable of bearing the rough terrain and extreme environment inside a mine and between the surface and underground workstations is a critical factor for the monitoring of various underground mining operations remotely. Internet of Things (IoT) can play a massive role in the mining operations to improve the safety of the workers with enhanced productivity. Wireless communication, which is a part of IoT setup, is already playing a vital role in underground mine communication (UMC). Recently, IoT with its building blocks has been introduced to deploy and automate the operation of ‘Self-Advancing Goaf Edge Support (SAGES)’ systems in an attempt to explore the possibility of the technology for real-time performance monitoring of support system including the behaviour of overlying roof strata in underground coal mines. The machine helps in supporting the roof of the mines during mining the coal. This paper presents a conceptual framework for implementation of IoT to make this underground support system smarter i.e. Smart-SAGES. The taxonomy of security challenges in UMC IoT combination has been described in detail in order to identify clear security goals. The blockchain based system seems to be a promising technology for the mining industry as it may help in curbing the penetration and disruption of cyber-attacks due to heterogeneous devices and distributed network. Various open issues in UMC have also been outlined. Vulnerabilities like information disclosure and Denial-of-Service attack (DoS attack) were discovered during the threat and risk analysis on the SAGES data logger. The SAGES falls into information generation block of IoT ecosystem. Therefore, it is advisable to incorporate the security by design approach from the initial phase of the development. Thus, the data transmission and storage can be made secure.

      PubDate: 2018-06-12T11:52:37Z
       
  • N-TWR: An Accurate Time-of-flight-based N-ary Ranging Protocol for
           Ultra-Wide Band
    • Authors: François Despaux; Adrien van den Bossche; Katia Jaffrès-Runser; Thierry Val
      Abstract: Publication date: Available online 7 June 2018
      Source:Ad Hoc Networks
      Author(s): François Despaux, Adrien van den Bossche, Katia Jaffrès-Runser, Thierry Val
      In the last decade, wireless positioning systems have drawn a strong interest from a research point of view, especially for indoor environments where Global Positioning Systems (GPS) is not available. As an alternative, emerging applications relying on Ultra-Wide Band (UWB) communication technology have been proposed to offer a ranging accuracy in the order of some dozens of centimeters. Indeed, UWB radios’ increased accuracy originates in the high time resolution of UWB signals that can be leveraged to measure precisely travel times of signals (e.g. Time of Flight, ToF). ToF can be easily translated to inter-node distance. In this work we propose N-TWR, a ToF-based N-ary ranging protocol created for localization using UWB. The proposed N-TWR protocol is based on the estimation of the ToF between a target node to be localized (which may be mobile or static) and a set of N anchors. It has been designed to minimize the number of messages exchanged between all nodes compared to a naive solution that exploits the state-of-the-art UWB ranging method. Validation has been made using experiments carried out in our Open Source Framework, DecaDuino, which enables fast prototyping of protocols sitting on top of UWB Physical layer. The N-ary ranging provided by N-TWR achieves the same level of accuracy as the naive protocol exploiting SDS-TWR but using four times less messages. We exhibit as well that N-TWR can be efficiently leveraged to design a simple and elegant trilateration localization algorithm.

      PubDate: 2018-06-09T11:31:42Z
      DOI: 10.1016/j.adhoc.2018.05.016
       
  • K Privacy: Towards Improving Privacy Strength While Preserving Utility
    • Authors: Josh Joy; Dylan Gray Ciaran McGoldrick Mario Gerla
      Abstract: Publication date: Available online 31 May 2018
      Source:Ad Hoc Networks
      Author(s): Josh Joy, Dylan Gray, Ciaran McGoldrick, Mario Gerla
      Future autonomous vehicles will generate, collect, aggregate and consume significant volumes of data as key gateway devices in emerging Internet of Things scenarios. While vehicles are widely accepted as one of the most challenging mobility contexts in which to achieve effective data communications, less attention has been paid to the privacy of data emerging from these vehicles. The quality and usability of such privatized data will lie at the heart of future safe and efficient transportation solutions. In this paper, we present the K Privacy mechanism. K Privacy is to our knowledge the first such mechanism that enables data creators to submit multiple contradictory responses to a query, whilst preserving utility measured as the absolute error from the actual original data. The functionalities are achieved in both a scalable and secure fashion. For instance, individual location data can be obfuscated while preserving utility, thereby enabling the scheme to transparently integrate with existing systems (e.g. Waze). A new cryptographic primitive Function Secret Sharing is used to achieve non-attributable writes and we show an order of magnitude improvement from the default implementation.

      PubDate: 2018-05-31T10:21:10Z
       
  • The Charger Positioning Problem in Clustered RF-power Harvesting Wireless
           Sensor Networks
    • Authors: Dimitrios Zorbas; Patrice Raveneau; Yacine Ghamri-Doudane; Christos Douligeris
      Abstract: Publication date: Available online 28 May 2018
      Source:Ad Hoc Networks
      Author(s): Dimitrios Zorbas, Patrice Raveneau, Yacine Ghamri-Doudane, Christos Douligeris
      Wireless charging brings forward several new challenges in designing energy efficient wireless sensor networks. In a wireless charging scenario, a number of chargers with high energy resources are placed in the network to recharge power constrained nodes. Nevertheless, due to the fading effect of the signals, a few only nodes can remarkably benefit from the charger power emission. For this reason we examine whether the organization of the nodes in clusters may extend the network lifetime. In this paper, we compute the maximum size of the cluster and we propose an efficient localized algorithm as well as a centralized one to compute the charger position so as to maximize the cluster lifetime. We compare to other solutions in the literature and we present both theoretical and simulation results to show the effectiveness of our approach. The results show an up to 360% increase in lifetime in comparison with the traditional 1-hop communication method between the nodes and the sink.

      PubDate: 2018-05-31T10:21:10Z
      DOI: 10.1016/j.adhoc.2018.05.013
       
  • Stop and Forward: Opportunistic Local Information Sharing Under Walking
           Mobility
    • Authors: Gianluca A. Rizzo; Vincenzo Mancuso; Shahzad Ali; Marco Ajmone Marsan
      Abstract: Publication date: Available online 28 May 2018
      Source:Ad Hoc Networks
      Author(s): Gianluca A. Rizzo, Vincenzo Mancuso, Shahzad Ali, Marco Ajmone Marsan
      In this paper we study an opportunistic geographically constrained information sharing paradigm known under the name Floating Content (FC), considering two different mobility models that describe the behavior of pedestrians. We assume that users carrying their smartphones walk from one location to another and then stop for a while. Information transfers take place in the periods when users pause between movements. We develop analytical models to compute the performance metrics that characterize FC in this case and we validate analytical results with data collected during an experiment performed in a university campus. The comparison proves the accuracy of our analytical models. Moreover, results unveil the key relevance for FC performance of group dynamics in user movements.

      PubDate: 2018-05-31T10:21:10Z
      DOI: 10.1016/j.adhoc.2018.05.011
       
  • Vehicular Micro Cloud in Action: On Gateway Selection and Gateway
           Handovers
    • Authors: Florian Hagenauer; Christoph Sommer; Takamasa Higuchi; Onur Altintas; Falko Dressler
      Abstract: Publication date: Available online 28 May 2018
      Source:Ad Hoc Networks
      Author(s): Florian Hagenauer, Christoph Sommer, Takamasa Higuchi, Onur Altintas, Falko Dressler
      Recently, the concept of the vehicular micro cloud has been established. The core idea is to use cars as a main ICT resource in modern smart cities being able to store, to forward, and to process data. Relying on the communication capabilities of cars, particularly their ability to use short range communication technologies such as IEEE 802.11p, Wi-Fi, or LTE-D2D, virtual micro clouds can be established similar to the concept of the mobile edge in 5G networks, yet, without any infrastructure support. However, there is a key disadvantage: the network will very likely become fragmented due to the mobility of the cars within the city. Furthermore, low penetration rates in early deployments may amplify this fragmentation. In recent work, we proposed the use of clusters of parked cars to overcome such limitations, i.e., to provide a virtual infrastructure in form of a virtual Roadside Unit (RSU) being able to fulfill all the mentioned actions. In this paper, we investigate two core problems of this system, namely the selection of appropriate gateway nodes in the virtual cluster as well as seamless handovers among such gateways required due to very limited contact times of moving cars to a single gateway. Our simulation results confirm the strength of the proposed gateway selection and handover mechanisms.

      PubDate: 2018-05-31T10:21:10Z
      DOI: 10.1016/j.adhoc.2018.05.014
       
  • Optimal User Association, Backhaul Routing and Switching off in 5G
           Heterogeneous Networks with Mesh Millimeter Wave Backhaul Links
    • Authors: Mesodiakaki Zola; Santos Kassler
      Abstract: Publication date: Available online 26 May 2018
      Source:Ad Hoc Networks
      Author(s): A. Mesodiakaki, E. Zola, R. Santos, A. Kassler
      Next generation, i.e., fifth generation (5G), cellular networks will provide a significant higher capacity per area to support the ever-increasing traffic demands. In order to achieve that, many small cells need to be deployed that are connected using a combination of optical fiber links and millimeter-wave (mmWave) backhaul architecture to forward heterogeneous traffic over mesh topologies. In this paper, we present a general optimization framework for the design of policies that optimally solve the problem of where to associate a user, over which links to route its traffic towards which mesh gateway, and which base stations and backhaul links to switch off in order to minimize the energy cost for the network operator and still satisfy the user demands. We develop an optimal policy based on mixed integer linear programming (MILP) which considers different user distribution and traffic demands over multiple time periods. We develop also a fast iterative two-phase solution heuristic, which associates users and calculates backhaul routes to maximize energy savings. Our strategies optimize the backhaul network configuration at each timeslot based on the current demands and user locations. We discuss the application of our policies to backhaul management of mmWave cellular networks in light of current trend of network softwarization (Software-Defined Networking, SDN). Finally, we present extensive numerical simulations of our proposed policies, which show how the algorithms can efficiently trade-off energy consumption with required capacity, while satisfying flow demand requirements.

      PubDate: 2018-05-28T10:02:36Z
       
  • Mobile Matrix: Routing under Mobility in IoT, IoMT, and Social IoT
    • Authors: Bruno Santos; Olga Goussevskaia Luiz F.M. Vieira Marcos A.M. Vieira
      Abstract: Publication date: Available online 22 May 2018
      Source:Ad Hoc Networks
      Author(s): Bruno P. Santos, Olga Goussevskaia, Luiz F.M. Vieira, Marcos A.M. Vieira, Antonio A.F. Loureiro
      The explosive growth of “things” connected to the Internet (Internet of Things, IoT) raises the question of whether existing ready-to-go networking protocols are enough to cover social and mobile IoT’s demands. IoT aims to interconnect static devices attached to some physical infrastructure. However, mobility is a major factor present in everyday life, and naturally the “things” can move around (Internet of Mobile Things, IoMT) and create social ties (Social IoT, SIoT) in the cyber-physical space. In that context, we present Mobile Matrix (μMatrix), a routing protocol that uses hierarchical IPv6 address allocation to perform any-to-any routing and mobility management without changing a node’s address. In this way, device mobility is transparent to the application level favoring IoMT and SIoT implementation and broader adoption. The protocol has low memory footprint, adjustable control message overhead, and it achieves optimal routing path distortion. Moreover, it does not rely on any particular hardware for mobility detection (a key open issue), such as an accelerometer. Instead, it uses a passive mechanism to detect that a device has moved. We present analytic proofs for the computational complexity and efficiency of μMatrix, as well as an evaluation of the protocol through simulations. We evaluate the protocol performance under human and non-human mobility models. For human mobility, we generated mobility traces using Group Regularity Mobility (GRM) Model, setting its parameters based on real human mobility traces. For the non-human mobility, we propose a new mobility model, to which we refer as Cyclical Random Waypoint (CRWP), where nodes move using a simple Random Waypoint and, eventually, return to their initial position. We compared μMatrix with three baseline protocols: Routing Protocol for low-power and lossy networks (RPL), Mobility Management RPL (MMRPL), and Ad hoc On-Demand Distance Vector (AODV). The results show that μMatrix and RPL offer  ≈ 99.9% of bottom-up delivery rate, but only μMatrix offer  ≥ 95% of top-down traffic in highly dynamic and mobile scenarios, while other protocols  ≤ 75%. Moreover, μMatrix uses up to 65% of the routing table while RPL and AODV fulfill theirs in all scenarios, which leads to poor top-down and any-to-any reliability.

      PubDate: 2018-05-28T10:02:36Z
       
  • Group Centric Networking: A New Approach for Wireless Multi-Hop Networking
    • Authors: Greg Kuperman; Jun Sun; Bow-Nan Cheng; Patricia Deutsch; Aradhana Narula-Tam
      Abstract: Publication date: Available online 19 May 2018
      Source:Ad Hoc Networks
      Author(s): Greg Kuperman, Jun Sun, Bow-Nan Cheng, Patricia Deutsch, Aradhana Narula-Tam
      In this paper, we introduce a new networking architecture called Group Centric Networking (GCN), which is designed to support the large number of devices expected with the emergence of the Internet of Things. GCN is designed to enable these devices to operate collaboratively in a highly efficient and resilient fashion, while not sacrificing their ability to communicate with one another. We do a full protocol implementation of GCN in NS3, and compare GCN against different MANET routing approaches in both simulation and on a 90 node Android mobile phone testbed. We show that GCN utilizes up to an order of magnitude fewer network resources than traditional wireless networking schemes, while providing superior connectivity and reliability. The GCN source code is open-source and publicly available.

      PubDate: 2018-05-28T10:02:36Z
      DOI: 10.1016/j.adhoc.2018.05.007
       
  • Maximization of multicast periodic traffic throughput in multi-hop
           wireless networks with broadcast transmissions
    • Authors: Michał Pióro; Artur Tomaszewski; Antonio Capone
      Abstract: Publication date: Available online 24 April 2018
      Source:Ad Hoc Networks
      Author(s): Michał Pióro, Artur Tomaszewski, Antonio Capone
      Although a number of different medium access control (MAC) schemes are adopted for wireless multi-hop networks, time division multiple access (TDMA) approaches based on a periodic frame of time slots are the most common when very high efficiency is needed in terms of use of radio and energy resources. Efficient resource usage is typically based on parallel compatible transmissions from multiple nodes that guarantee interference control at the receivers. Optimization of transmission scheduling in multi-hop packet delivery from sources to destinations for a set of traffic relations can be achieved by minimizing the frame length where all necessary transmissions are organized in compatible sets and assigned to the time slots of the frame. When properly designed, the resulting TDMA scheme guarantees the delivery of packets for each traffic relation at a rate of up to one packet per frame duration regardless of the number of the packet transmissions (hops) necessary from source to destination, and thus it is particularly suitable for periodic traffic. While similar traffic maximization problems have been studied quite extensively for the case of unicast traffic, its multicast generalization (where each packet should be delivered from the source node to possibly multiple destination nodes) has not been elaborated so far. In this paper we present such a (non-trivial) generalization, namely a mathematical programming model based on the extension of the compatible set concept where the signal-to-noise and interference (SINR) ratio is guaranteed above a threshold at multiple receivers. We first propose an algorithm for solving the problem that generates compatible sets and schedules the frame by splitting the (predefined) multicast routing trees into one-hop transmissions. The high computational efficiency of the algorithm is proven through numerical results on large networks. Next, we enrich the model by adding multicast tree optimization, illustrating its efficiency numerically as well. Finally, we present possible extensions that consider packets of different lengths (requiring multiple slots for transmission), multiple modulation and coding schemes (MCS) requiring different SINR thresholds at the receivers, and packet delay minimization.

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

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

      PubDate: 2018-04-15T20:27:20Z
      DOI: 10.1016/j.adhoc.2018.03.011
       
 
 
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.167.230.68
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-