for Journals by Title or ISSN
for Articles by Keywords
help

Publisher: Elsevier   (Total: 3048 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 3048 Journals sorted alphabetically
A Practical Logic of Cognitive Systems     Full-text available via subscription   (Followers: 7)
AASRI Procedia     Open Access   (Followers: 15)
Academic Pediatrics     Hybrid Journal   (Followers: 25, SJR: 1.402, h-index: 51)
Academic Radiology     Hybrid Journal   (Followers: 22, SJR: 1.008, h-index: 75)
Accident Analysis & Prevention     Partially Free   (Followers: 86, SJR: 1.109, h-index: 94)
Accounting Forum     Hybrid Journal   (Followers: 25, SJR: 0.612, h-index: 27)
Accounting, Organizations and Society     Hybrid Journal   (Followers: 30, SJR: 2.515, h-index: 90)
Achievements in the Life Sciences     Open Access   (Followers: 4)
Acta Anaesthesiologica Taiwanica     Open Access   (Followers: 5, SJR: 0.338, h-index: 19)
Acta Astronautica     Hybrid Journal   (Followers: 362, SJR: 0.726, h-index: 43)
Acta Automatica Sinica     Full-text available via subscription   (Followers: 3)
Acta Biomaterialia     Hybrid Journal   (Followers: 25, SJR: 2.02, h-index: 104)
Acta Colombiana de Cuidado Intensivo     Full-text available via subscription   (Followers: 1)
Acta de Investigación Psicológica     Open Access   (Followers: 2)
Acta Ecologica Sinica     Open Access   (Followers: 8, SJR: 0.172, h-index: 29)
Acta Haematologica Polonica     Free   (SJR: 0.123, h-index: 8)
Acta Histochemica     Hybrid Journal   (Followers: 3, SJR: 0.604, h-index: 38)
Acta Materialia     Hybrid Journal   (Followers: 227, SJR: 3.683, h-index: 202)
Acta Mathematica Scientia     Full-text available via subscription   (Followers: 5, SJR: 0.615, h-index: 21)
Acta Mechanica Solida Sinica     Full-text available via subscription   (Followers: 9, SJR: 0.442, h-index: 21)
Acta Oecologica     Hybrid Journal   (Followers: 10, SJR: 0.915, h-index: 53)
Acta Otorrinolaringologica (English Edition)     Full-text available via subscription   (Followers: 1)
Acta Otorrinolaringológica Española     Full-text available via subscription   (Followers: 3, SJR: 0.311, h-index: 16)
Acta Pharmaceutica Sinica B     Open Access   (Followers: 1)
Acta Poética     Open Access   (Followers: 4)
Acta Psychologica     Hybrid Journal   (Followers: 24, SJR: 1.365, h-index: 73)
Acta Sociológica     Open Access  
Acta Tropica     Hybrid Journal   (Followers: 6, SJR: 1.059, h-index: 77)
Acta Urológica Portuguesa     Open Access  
Actas Dermo-Sifiliograficas     Full-text available via subscription   (Followers: 4)
Actas Dermo-Sifiliográficas (English Edition)     Full-text available via subscription   (Followers: 3)
Actas Urológicas Españolas     Full-text available via subscription   (Followers: 4, SJR: 0.383, h-index: 19)
Actas Urológicas Españolas (English Edition)     Full-text available via subscription   (Followers: 2)
Actualites Pharmaceutiques     Full-text available via subscription   (Followers: 5, SJR: 0.141, h-index: 3)
Actualites Pharmaceutiques Hospitalieres     Full-text available via subscription   (Followers: 4, SJR: 0.112, h-index: 2)
Acupuncture and Related Therapies     Hybrid Journal   (Followers: 4)
Acute Pain     Full-text available via subscription   (Followers: 13)
Ad Hoc Networks     Hybrid Journal   (Followers: 11, SJR: 0.967, h-index: 57)
Addictive Behaviors     Hybrid Journal   (Followers: 15, SJR: 1.514, h-index: 92)
Addictive Behaviors Reports     Open Access   (Followers: 6)
Additive Manufacturing     Hybrid Journal   (Followers: 7, SJR: 1.039, h-index: 5)
Additives for Polymers     Full-text available via subscription   (Followers: 21)
Advanced Drug Delivery Reviews     Hybrid Journal   (Followers: 134, SJR: 5.2, h-index: 222)
Advanced Engineering Informatics     Hybrid Journal   (Followers: 11, SJR: 1.265, h-index: 53)
Advanced Powder Technology     Hybrid Journal   (Followers: 17, SJR: 0.739, h-index: 33)
Advances in Accounting     Hybrid Journal   (Followers: 9, SJR: 0.299, h-index: 15)
Advances in Agronomy     Full-text available via subscription   (Followers: 15, SJR: 2.071, h-index: 82)
Advances in Anesthesia     Full-text available via subscription   (Followers: 26, SJR: 0.169, h-index: 4)
Advances in Antiviral Drug Design     Full-text available via subscription   (Followers: 3)
Advances in Applied Mathematics     Full-text available via subscription   (Followers: 6, SJR: 1.054, h-index: 35)
Advances in Applied Mechanics     Full-text available via subscription   (Followers: 11, SJR: 0.801, h-index: 26)
Advances in Applied Microbiology     Full-text available via subscription   (Followers: 22, SJR: 1.286, h-index: 49)
Advances In Atomic, Molecular, and Optical Physics     Full-text available via subscription   (Followers: 16, SJR: 3.31, h-index: 42)
Advances in Biological Regulation     Hybrid Journal   (Followers: 4, SJR: 2.277, h-index: 43)
Advances in Botanical Research     Full-text available via subscription   (Followers: 3, SJR: 0.619, h-index: 48)
Advances in Cancer Research     Full-text available via subscription   (Followers: 25, SJR: 2.215, h-index: 78)
Advances in Carbohydrate Chemistry and Biochemistry     Full-text available via subscription   (Followers: 9, SJR: 0.9, h-index: 30)
Advances in Catalysis     Full-text available via subscription   (Followers: 5, SJR: 2.139, h-index: 42)
Advances in Cell Aging and Gerontology     Full-text available via subscription   (Followers: 4)
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.183, h-index: 23)
Advances in Child Development and Behavior     Full-text available via subscription   (Followers: 10, SJR: 0.665, h-index: 29)
Advances in Chronic Kidney Disease     Full-text available via subscription   (Followers: 9, SJR: 1.268, h-index: 45)
Advances in Clinical Chemistry     Full-text available via subscription   (Followers: 29, SJR: 0.938, h-index: 33)
Advances in Colloid and Interface Science     Full-text available via subscription   (Followers: 18, SJR: 2.314, h-index: 130)
Advances in Computers     Full-text available via subscription   (Followers: 16, SJR: 0.223, h-index: 22)
Advances in Dermatology     Full-text available via subscription   (Followers: 12)
Advances in Developmental Biology     Full-text available via subscription   (Followers: 11)
Advances in Digestive Medicine     Open Access   (Followers: 6)
Advances in DNA Sequence-Specific Agents     Full-text available via subscription   (Followers: 5)
Advances in Drug Research     Full-text available via subscription   (Followers: 22)
Advances in Ecological Research     Full-text available via subscription   (Followers: 44, SJR: 3.25, h-index: 43)
Advances in Engineering Software     Hybrid Journal   (Followers: 26, SJR: 0.486, h-index: 10)
Advances in Experimental Biology     Full-text available via subscription   (Followers: 7)
Advances in Experimental Social Psychology     Full-text available via subscription   (Followers: 42, SJR: 5.465, h-index: 64)
Advances in Exploration Geophysics     Full-text available via subscription   (Followers: 3)
Advances in Fluorine Science     Full-text available via subscription   (Followers: 8)
Advances in Food and Nutrition Research     Full-text available via subscription   (Followers: 50, SJR: 0.674, h-index: 38)
Advances in Fuel Cells     Full-text available via subscription   (Followers: 16)
Advances in Genetics     Full-text available via subscription   (Followers: 15, SJR: 2.558, h-index: 54)
Advances in Genome Biology     Full-text available via subscription   (Followers: 12)
Advances in Geophysics     Full-text available via subscription   (Followers: 6, SJR: 2.325, h-index: 20)
Advances in Heat Transfer     Full-text available via subscription   (Followers: 22, SJR: 0.906, h-index: 24)
Advances in Heterocyclic Chemistry     Full-text available via subscription   (Followers: 9, SJR: 0.497, h-index: 31)
Advances in Human Factors/Ergonomics     Full-text available via subscription   (Followers: 26)
Advances in Imaging and Electron Physics     Full-text available via subscription   (Followers: 2, SJR: 0.396, h-index: 27)
Advances in Immunology     Full-text available via subscription   (Followers: 36, SJR: 4.152, h-index: 85)
Advances in Inorganic Chemistry     Full-text available via subscription   (Followers: 9, SJR: 1.132, h-index: 42)
Advances in Insect Physiology     Full-text available via subscription   (Followers: 3, SJR: 1.274, h-index: 27)
Advances in Integrative Medicine     Hybrid Journal   (Followers: 6)
Advances in Intl. Accounting     Full-text available via subscription   (Followers: 4)
Advances in Life Course Research     Hybrid Journal   (Followers: 8, SJR: 0.764, h-index: 15)
Advances in Lipobiology     Full-text available via subscription   (Followers: 2)
Advances in Magnetic and Optical Resonance     Full-text available via subscription   (Followers: 9)
Advances in Marine Biology     Full-text available via subscription   (Followers: 16, SJR: 1.645, h-index: 45)
Advances in Mathematics     Full-text available via subscription   (Followers: 10, SJR: 3.261, h-index: 65)
Advances in Medical Sciences     Hybrid Journal   (Followers: 6, SJR: 0.489, h-index: 25)
Advances in Medicinal Chemistry     Full-text available via subscription   (Followers: 5)
Advances in Microbial Physiology     Full-text available via subscription   (Followers: 4, SJR: 1.44, h-index: 51)
Advances in Molecular and Cell Biology     Full-text available via subscription   (Followers: 22)
Advances in Molecular and Cellular Endocrinology     Full-text available via subscription   (Followers: 10)
Advances in Molecular Toxicology     Full-text available via subscription   (Followers: 8, SJR: 0.324, h-index: 8)
Advances in Nanoporous Materials     Full-text available via subscription   (Followers: 4)
Advances in Oncobiology     Full-text available via subscription   (Followers: 3)
Advances in Organ Biology     Full-text available via subscription   (Followers: 2)
Advances in Organometallic Chemistry     Full-text available via subscription   (Followers: 15, SJR: 2.885, h-index: 45)
Advances in Parallel Computing     Full-text available via subscription   (Followers: 7, SJR: 0.148, h-index: 11)
Advances in Parasitology     Full-text available via subscription   (Followers: 7, SJR: 2.37, h-index: 73)
Advances in Pediatrics     Full-text available via subscription   (Followers: 24, SJR: 0.4, h-index: 28)
Advances in Pharmaceutical Sciences     Full-text available via subscription   (Followers: 13)
Advances in Pharmacology     Full-text available via subscription   (Followers: 15, SJR: 1.718, h-index: 58)
Advances in Physical Organic Chemistry     Full-text available via subscription   (Followers: 8, SJR: 0.384, h-index: 26)
Advances in Phytomedicine     Full-text available via subscription  
Advances in Planar Lipid Bilayers and Liposomes     Full-text available via subscription   (Followers: 3, SJR: 0.248, h-index: 11)
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: 4)
Advances in Protein Chemistry     Full-text available via subscription   (Followers: 17)
Advances in Protein Chemistry and Structural Biology     Full-text available via subscription   (Followers: 20, SJR: 1.5, h-index: 62)
Advances in Psychology     Full-text available via subscription   (Followers: 62)
Advances in Quantum Chemistry     Full-text available via subscription   (Followers: 5, SJR: 0.478, h-index: 32)
Advances in Radiation Oncology     Open Access  
Advances in Small Animal Medicine and Surgery     Hybrid Journal   (Followers: 2, SJR: 0.1, h-index: 2)
Advances in Space Biology and Medicine     Full-text available via subscription   (Followers: 5)
Advances in Space Research     Full-text available via subscription   (Followers: 361, SJR: 0.606, h-index: 65)
Advances in Structural Biology     Full-text available via subscription   (Followers: 8)
Advances in Surgery     Full-text available via subscription   (Followers: 7, SJR: 0.823, h-index: 27)
Advances in the Study of Behavior     Full-text available via subscription   (Followers: 30, SJR: 1.321, h-index: 56)
Advances in Veterinary Medicine     Full-text available via subscription   (Followers: 16)
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: 1.878, h-index: 68)
Advances in Water Resources     Hybrid Journal   (Followers: 44, SJR: 2.408, h-index: 94)
Aeolian Research     Hybrid Journal   (Followers: 5, SJR: 0.973, h-index: 22)
Aerospace Science and Technology     Hybrid Journal   (Followers: 329, SJR: 0.816, h-index: 49)
AEU - Intl. J. of Electronics and Communications     Hybrid Journal   (Followers: 8, SJR: 0.318, h-index: 36)
African J. of Emergency Medicine     Open Access   (Followers: 5, SJR: 0.344, h-index: 6)
Ageing Research Reviews     Hybrid Journal   (Followers: 8, SJR: 3.289, h-index: 78)
Aggression and Violent Behavior     Hybrid Journal   (Followers: 413, SJR: 1.385, h-index: 72)
Agri Gene     Hybrid Journal  
Agricultural and Forest Meteorology     Hybrid Journal   (Followers: 16, SJR: 2.18, h-index: 116)
Agricultural Systems     Hybrid Journal   (Followers: 30, SJR: 1.275, h-index: 74)
Agricultural Water Management     Hybrid Journal   (Followers: 40, SJR: 1.546, h-index: 79)
Agriculture and Agricultural Science Procedia     Open Access  
Agriculture and Natural Resources     Open Access   (Followers: 1)
Agriculture, Ecosystems & Environment     Hybrid Journal   (Followers: 55, SJR: 1.879, h-index: 120)
Ain Shams Engineering J.     Open Access   (Followers: 5, SJR: 0.434, h-index: 14)
Air Medical J.     Hybrid Journal   (Followers: 5, SJR: 0.234, h-index: 18)
AKCE Intl. J. of Graphs and Combinatorics     Open Access   (SJR: 0.285, h-index: 3)
Alcohol     Hybrid Journal   (Followers: 11, SJR: 0.922, h-index: 66)
Alcoholism and Drug Addiction     Open Access   (Followers: 8)
Alergologia Polska : Polish J. of Allergology     Full-text available via subscription   (Followers: 1)
Alexandria Engineering J.     Open Access   (Followers: 1, SJR: 0.436, h-index: 12)
Alexandria J. of Medicine     Open Access   (Followers: 1)
Algal Research     Partially Free   (Followers: 8, SJR: 2.05, h-index: 20)
Alkaloids: Chemical and Biological Perspectives     Full-text available via subscription   (Followers: 3)
Allergologia et Immunopathologia     Full-text available via subscription   (Followers: 1, SJR: 0.46, h-index: 29)
Allergology Intl.     Open Access   (Followers: 4, SJR: 0.776, h-index: 35)
Alpha Omegan     Full-text available via subscription   (SJR: 0.121, h-index: 9)
ALTER - European J. of Disability Research / Revue Européenne de Recherche sur le Handicap     Full-text available via subscription   (Followers: 9, SJR: 0.158, h-index: 9)
Alzheimer's & Dementia     Hybrid Journal   (Followers: 46, SJR: 4.289, h-index: 64)
Alzheimer's & Dementia: Diagnosis, Assessment & Disease Monitoring     Open Access   (Followers: 4)
Alzheimer's & Dementia: Translational Research & Clinical Interventions     Open Access   (Followers: 4)
Ambulatory Pediatrics     Hybrid Journal   (Followers: 5)
American Heart J.     Hybrid Journal   (Followers: 48, SJR: 3.157, h-index: 153)
American J. of Cardiology     Hybrid Journal   (Followers: 47, SJR: 2.063, h-index: 186)
American J. of Emergency Medicine     Hybrid Journal   (Followers: 40, SJR: 0.574, h-index: 65)
American J. of Geriatric Pharmacotherapy     Full-text available via subscription   (Followers: 9, SJR: 1.091, h-index: 45)
American J. of Geriatric Psychiatry     Hybrid Journal   (Followers: 14, SJR: 1.653, h-index: 93)
American J. of Human Genetics     Hybrid Journal   (Followers: 32, SJR: 8.769, h-index: 256)
American J. of Infection Control     Hybrid Journal   (Followers: 26, SJR: 1.259, h-index: 81)
American J. of Kidney Diseases     Hybrid Journal   (Followers: 32, SJR: 2.313, h-index: 172)
American J. of Medicine     Hybrid Journal   (Followers: 46, SJR: 2.023, h-index: 189)
American J. of Medicine Supplements     Full-text available via subscription   (Followers: 3)
American J. of Obstetrics and Gynecology     Hybrid Journal   (Followers: 200, SJR: 2.255, h-index: 171)
American J. of Ophthalmology     Hybrid Journal   (Followers: 59, SJR: 2.803, h-index: 148)
American J. of Ophthalmology Case Reports     Open Access   (Followers: 6)
American J. of Orthodontics and Dentofacial Orthopedics     Full-text available via subscription   (Followers: 6, SJR: 1.249, h-index: 88)
American J. of Otolaryngology     Hybrid Journal   (Followers: 25, SJR: 0.59, h-index: 45)
American J. of Pathology     Hybrid Journal   (Followers: 26, SJR: 2.653, h-index: 228)
American J. of Preventive Medicine     Hybrid Journal   (Followers: 24, SJR: 2.764, h-index: 154)
American J. of Surgery     Hybrid Journal   (Followers: 35, SJR: 1.286, h-index: 125)
American J. of the Medical Sciences     Hybrid Journal   (Followers: 12, SJR: 0.653, h-index: 70)
Ampersand : An Intl. J. of General and Applied Linguistics     Open Access   (Followers: 5)
Anaerobe     Hybrid Journal   (Followers: 4, SJR: 1.066, h-index: 51)
Anaesthesia & Intensive Care Medicine     Full-text available via subscription   (Followers: 58, SJR: 0.124, h-index: 9)
Anaesthesia Critical Care & Pain Medicine     Full-text available via subscription   (Followers: 12)
Anales de Cirugia Vascular     Full-text available via subscription  
Anales de Pediatría     Full-text available via subscription   (Followers: 2, SJR: 0.209, h-index: 27)
Anales de Pediatría (English Edition)     Full-text available via subscription  
Anales de Pediatría Continuada     Full-text available via subscription   (SJR: 0.104, h-index: 3)
Analytic Methods in Accident Research     Hybrid Journal   (Followers: 4, SJR: 2.577, h-index: 7)
Analytica Chimica Acta     Hybrid Journal   (Followers: 37, SJR: 1.548, h-index: 152)
Analytical Biochemistry     Hybrid Journal   (Followers: 166, SJR: 0.725, h-index: 154)
Analytical Chemistry Research     Open Access   (Followers: 8, SJR: 0.18, h-index: 2)
Analytical Spectroscopy Library     Full-text available via subscription   (Followers: 12)
Anesthésie & Réanimation     Full-text available via subscription   (Followers: 1)
Anesthesiology Clinics     Full-text available via subscription   (Followers: 23, SJR: 0.421, h-index: 40)
Angiología     Full-text available via subscription   (SJR: 0.124, h-index: 9)
Angiologia e Cirurgia Vascular     Open Access  
Animal Behaviour     Hybrid Journal   (Followers: 171, SJR: 1.907, h-index: 126)

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

Journal Cover Ad Hoc Networks
  [SJR: 0.967]   [H-I: 57]   [11 followers]  Follow
    
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1570-8705
   Published by Elsevier Homepage  [3048 journals]
  • Time-optimized management of IoT nodes
    • Authors: Kostas Kolomvatsos
      Pages: 1 - 14
      Abstract: Publication date: February 2018
      Source:Ad Hoc Networks, Volume 69
      Author(s): Kostas Kolomvatsos
      The vision of Internet of Things (IoT) aims to offer a vast infrastructure of numerous interconnected devices usually called IoT nodes. The infrastructure consists of the basis of pervasive computing applications. Applications can be built with the participation of the IoT nodes that interact in very dynamic environments. In this setting, one can identify the need for applying updates in the software/firmware of the autonomous nodes. Updates may include software extensions and patches significant for the efficient functioning of the IoT nodes. Legacy methodologies involve centralized models where complex algorithms and protocols are adopted for the distribution of the updates to the nodes. This paper proposes a distributed approach where each node is responsible to initiate and conclude the update process. We envision that each node monitors specific performance metrics (related to the node itself and/or the network) and based on a time-optimized scheme identifies the appropriate time to perform the update process.We propose the adoption of a finite horizon optimal stopping scheme. Our stopping model originates in the Optimal Stopping Theory (OST) and takes into account multiple performance metrics. The aim is to have the nodes capable of identifying when their performance and the performance of the network are of high quality. In that time, nodes could be able to efficiently conclude the update process. We provide a set of formulations and the analysis of our problem. Extensive experiments and a comparison assessment reveal the advantages of the proposed solution.

      PubDate: 2017-11-05T13:01:05Z
      DOI: 10.1016/j.adhoc.2017.10.011
      Issue No: Vol. 69 (2017)
       
  • Heterogeneous fault diagnosis for wireless sensor networks
    • Authors: Rakesh Ranjan Swain; Pabitra Mohan Khilar; Sourav Kumar Bhoi
      Pages: 15 - 37
      Abstract: Publication date: February 2018
      Source:Ad Hoc Networks, Volume 69
      Author(s): Rakesh Ranjan Swain, Pabitra Mohan Khilar, Sourav Kumar Bhoi
      Fault diagnosis has been considered as a very challenging problem in wireless sensor network (WSN) research. Faulty nodes having different behavior such as hard, soft, intermittent, and transient fault are called as heterogeneous faults in wireless sensor networks. This paper presents a heterogeneous fault diagnosis protocol for wireless sensor networks. The proposed protocol consists of three phases, such as clustering phase, fault detection phase, and fault classification phase to diagnose the heterogeneous faulty nodes in the wireless sensor networks. The protocol strategy is based on time out mechanism to detect the hard faulty nodes, and analysis of variance method (ANOVA test) to detect the soft, intermittent, and transient faulty nodes in the network. The feed forward probabilistic neural network (PNN) technique is used to classify the different types of faulty nodes in the network. The performance of the proposed heterogeneous fault diagnosis protocol is evaluated using network simulator NS-2.35. The evaluation of the proposed model is also carried out by the testbed experiment in an indoor laboratory environment and outdoor environment.

      PubDate: 2017-11-05T13:01:05Z
      DOI: 10.1016/j.adhoc.2017.10.012
      Issue No: Vol. 69 (2017)
       
  • Directional MAC protocol for IEEE 802.11ad based wireless local area
           networks
    • Authors: Anique Akhtar; Sinem Coleri Ergen
      Pages: 49 - 64
      Abstract: Publication date: February 2018
      Source:Ad Hoc Networks, Volume 69
      Author(s): Anique Akhtar, Sinem Coleri Ergen
      IEEE 802.11ad defines a new physical and medium access control layer for IEEE 802.11 networks to operate in the unlicensed 60 GHz millimeter wave spectrum for multi-gigabit wireless communications. Higher frequency waves have higher propagation loss but smaller antenna size. Hence, for millimeter wave networks, higher number of antennas can be packed together, enabling beamforming with very large gains. In this paper, we propose a novel Directional MAC protocol for Basic Stations (DMBS) with the goal of fully leveraging spatial reusability, and limiting deafness and hidden terminal problems with minimal overhead, and without using any complicated hardware for localization. The distinguishing features of DMBS are threefold. First, DMBS extends the association beamforming training time (A-BFT) of IEEE 802.11ad, during which the stations perform initial beamforming training with the access point (AP), by an intelligent listening mechanism. This mechanism allows the stations to passively learn about the best direction of the neighboring stations, decreasing the associated beamforming training overhead. Second, DMBS determines the best transmission direction by using multi-directional sequential (circular) RTS/CTS (Request To Send/ Clear To Send) (CRTS/CCTS) packets, and tracks the best direction by updating its beamforming table upon reception of every RTS/CTS packet, without requiring any additional hardware for localization. If the location information of the destination is up-to-date, the source station only transmits directional RTS/CTS (DRTS/DCTS) in the known direction. Third, DMBS uses two network allocation vectors (NAVs). The first NAV, denoted by NAV1, is used to reduce deafness by determining the busy nodes upon the reception of every RTS/CTS packet. The second NAV, called NAV2, is used to limit hidden terminal problem while maximizing spatial reusability by determining whether a transmission can interfere with active communication links. If NAV2 is set, then the node defers its multi-directional communication but still communicates directionally. We provide a novel Markov chain based analytical model to calculate the aggregate network throughput of DMBS. We demonstrate via extensive simulations that DMBS performs better than existing directional communication protocols in terms of throughput for different network sizes, mobilities and number of receivers.

      PubDate: 2017-11-05T13:01:05Z
      DOI: 10.1016/j.adhoc.2017.10.009
      Issue No: Vol. 69 (2017)
       
  • Fast network joining algorithms in industrial IEEE 802.15.4 deployments
    • Authors: Elvis Vogli; Giuseppe Ribezzo; L. Alfredo Grieco; Gennaro Boggia
      Pages: 65 - 75
      Abstract: Publication date: February 2018
      Source:Ad Hoc Networks, Volume 69
      Author(s): Elvis Vogli, Giuseppe Ribezzo, L. Alfredo Grieco, Gennaro Boggia
      Time Slotted Channel Hopping (TSCH) Medium Access Control (MAC) is a key feature of the IEEE 802.15.4 standard, aimed at accommodating the requirements of industrial Internet of Things systems. Time Division Multiple Access (TDMA) is a main pillar of TSCH, on top of which frequency hopping is added to increase the resilience of short range radio links. A tight synchronization among the network nodes is required in TSCH. Luckily, once a node joins the network, several lean techniques can be used to keep alive its synchronization. On contrary, the subtleties of the joining phase in TSCH still deserve investigations since they could hinder an effective usage of the TSCH MAC. To this end, the problem of acquiring the first synchronization in a TSCH network is investigated hereby, from several perspectives: (i) four novel mechanisms are proposed and implemented in real motes to speed up joining operations; (ii) their average joining time is analytically modeled with closed form expressions as a function of node density, communication reliability, and beacon transmission frequency; (iii) their effectiveness and the agreement between experimental and theoretical outcomes are evaluated in several scenarios.

      PubDate: 2017-11-05T13:01:05Z
      DOI: 10.1016/j.adhoc.2017.10.013
      Issue No: Vol. 69 (2017)
       
  • Device-to-Device assisted wireless video delivery with network coding
    • Authors: Cheng Zhan; Zhe Wen; Xiumin Wang; Liyue Zhu
      Pages: 76 - 85
      Abstract: Publication date: February 2018
      Source:Ad Hoc Networks, Volume 69
      Author(s): Cheng Zhan, Zhe Wen, Xiumin Wang, Liyue Zhu
      Broadcasting popular data content such as videos to multiple users is widely used in mobile wireless networks. We consider a group of mobile users, within proximity of each other, who are interested in the same video or cloud services. In this scenario, users are able to use device-to-device (D2D) connections, e.g., WiFi or Bluetooth, to get the video in a cooperative way. In this paper we consider the D2D-assisted wireless network coded video broadcast problem for users with multiple interfaces to minimize the number of transmission slots. In order to obtain all needed videos, user can receive encoded packet according to cellular link and local cooperative D2D links simultaneously. We analyze the lower bound and upper bound of number of transmission slots under two different receiver models. In the first model, receiver just drop the encoded packet which cannot be decoded immediately, and we propose a joint broadcast and D2D encoding solution based on the clique partition in the graph. In the second model that receiver can buffer all received encoded packets and decode when enough packets are received, we propose an optimal solution using an integer linear programming (ILP) formulation, and we also propose an effective heuristic encoding solution based on random linear coding. Simulation results show that the proposed transmission strategy can significantly reduce the number of transmission slots in most cases, which is an important performance metric in wireless video delivery.

      PubDate: 2017-11-11T12:35:06Z
      DOI: 10.1016/j.adhoc.2017.11.001
      Issue No: Vol. 69 (2017)
       
  • Advances in Wireless Communication and Networking for Cooperating
           Autonomous Systems
    • Authors: Enrico Natalizio; Dave Cavalcanti; Kaushik Chowdhury; Mostafa El Said
      Abstract: Publication date: January 2018
      Source:Ad Hoc Networks, Volume 68
      Author(s): Enrico Natalizio, Dave Cavalcanti, Kaushik Chowdhury, Mostafa El Said


      PubDate: 2017-11-11T12:35:06Z
      DOI: 10.1016/s1570-8705(17)30196-8
      Issue No: Vol. 68 (2017)
       
  • Federated IoT services leveraging 5G technologies at the edge
    • Authors: I. Farris; A. Orsino; L. Militano; A. Iera; G. Araniti
      Pages: 58 - 69
      Abstract: Publication date: January 2018
      Source:Ad Hoc Networks, Volume 68
      Author(s): I. Farris, A. Orsino, L. Militano, A. Iera, G. Araniti
      The Internet of Things (IoT) ecosystem is evolving towards the deployment of integrated environments, wherein heterogeneous devices pool their capacities together to match wide-ranging user and service requirements. As a consequence, solutions for efficient and synergistic cooperation among objects acquire great relevance. Along this line, this paper focuses on the adoption of the promising MIFaaS (Mobile-IoT-Federation-as-a-Service) paradigm to support delay-sensitive applications for high-end IoT devices in next-to-come fifth generation (5G) environments. MIFaaS fosters the provisioning of IoT services and applications with low-latency requirements by leveraging cooperation among private/public clouds of IoT objects at the edge of the network. A performance assessment of the MIFaaS paradigm in a cellular 5G environment based on both Long Term Evolution (LTE) and the recent Narrowband IoT (NB-IoT) is presented. Obtained results demonstrate that the proposed solution outperforms classic approaches, highlighting significant benefits derived from the joint use of LTE and NB-IoT bandwidths in terms of increased number of successfully delivered IoT services.

      PubDate: 2017-11-11T12:35:06Z
      DOI: 10.1016/j.adhoc.2017.09.002
      Issue No: Vol. 68 (2017)
       
  • A distributed routing scheme for energy management in solar powered sensor
           networks
    • Authors: Ahmad H. Dehwah; Jeff S. Shamma; Christian G. Claudel
      Pages: 11 - 23
      Abstract: Publication date: December 2017
      Source:Ad Hoc Networks, Volume 67
      Author(s): Ahmad H. Dehwah, Jeff S. Shamma, Christian G. Claudel
      Energy management is critical for solar-powered sensor networks. In this article, we consider data routing policies to optimize the energy in solar powered networks. Motivated by multipurpose sensor networks, the objective is to find the best network policy that maximizes the minimal energy among nodes in a sensor network, over a finite time horizon, given uncertain energy input forecasts. First, we derive the optimal policy in certain special cases using forward dynamic programming. We then introduce a greedy policy that is distributed and exhibits significantly lower complexity. When computationally feasible, we compare the performance of the optimal policy with the greedy policy. We also demonstrate the performance and computational complexity of the greedy policy over randomly simulated networks, and show that it yields results that are almost identical to the optimal policy, for greatly reduced worst-case computational costs and memory requirements. Finally, we demonstrate the implementation of the greedy policy on an experimental sensor network.

      PubDate: 2017-10-14T12:25:04Z
      DOI: 10.1016/j.adhoc.2017.10.002
      Issue No: Vol. 67 (2017)
       
  • WA-MAC: A weather adaptive MAC protocol in survivability-heterogeneous
           wireless sensor networks
    • Authors: Jie Tian; Yi Wang; Xiaoyuan Liang; Guiling Wang; Yujun Zhang
      Pages: 40 - 52
      Abstract: Publication date: December 2017
      Source:Ad Hoc Networks, Volume 67
      Author(s): Jie Tian, Yi Wang, Xiaoyuan Liang, Guiling Wang, Yujun Zhang
      Nowadays, sensor nodes are deployed to different environments to perform applications. Harsh environments such as rain or snow could damage the sensor nodes permanently. In this paper, a novel survivability-heterogeneous wireless sensor network composed of sensor nodes that is resistant to environmental detriments is designed. We for the first time study the medium access control protocol in such heterogeneous wireless sensor networks for data transmission under different weather conditions. We present a new Weather Adaptive receiver-initiated MAC protocol, called WA-MAC. WA-MAC can largely reduce idle listening time to save energy consumption for sensors during data transmission and provide a relative delay bound data delivery service by establishing appropriate rendezvous time between senders and receivers. Besides, by adopting weather forecast information, WA-MAC adjusts the data transmission process between different types of sensors to avoid packets being lost or delayed. Simulation results in ns-2 simulator show that WA-MAC can achieve the required relative delay bound, a low duty cycle and a high packet delivery ratio in the network, which outperforms other existing MAC protocols.

      PubDate: 2017-10-14T12:25:04Z
      DOI: 10.1016/j.adhoc.2017.10.005
      Issue No: Vol. 67 (2017)
       
  • Node localization over small world WSNs using constrained average path
           length reduction
    • Authors: Om Jee Pandey; Rajesh M. Hegde
      Pages: 87 - 102
      Abstract: Publication date: December 2017
      Source:Ad Hoc Networks, Volume 67
      Author(s): Om Jee Pandey, Rajesh M. Hegde
      Small world characteristics have been observed and studied in social networks in the context of information dissemination in important applications like disease spread among communities. However, the significance of small world characteristics in wireless sensor network (WSN) applications has hitherto not been investigated. This work investigates the significance of introducing small world characteristics in a conventional WSN for improving the node localization accuracy. In this context, a novel constrained iterative average path length reduction algorithm is proposed to introduce small world characteristics into a conventional WSN. This method utilizes a novel frequency selective approach for the introduction of small world phenomena. The frequency selective approach utilizes two frequency bands for link addition and pruning to create an optimized small world WSN. Subsequently, a constrained least squares node localization method over the small world WSN is developed using both model-based and model-free signal propagation approaches. The proposed constrained iterative average path length reduction method provides reduced average path length and a high average clustering coefficient when compared to conventional WSN. Constrained least squares node localization over the small world WSN yields improved localization performance when compared to node localization over conventional WSN. Performance analysis in terms of localization error, power consumption, bandwidth and anchors required for node localization is also discussed. Cramer-Rao lower bound analysis for node location parameters is also used to provide insights into the error bounds obtained using the proposed method. The experimental results obtained are motivating enough for the introduction of small world phenomena in conventional WSN for applications like node localization and related applications.

      PubDate: 2017-11-05T13:01:05Z
      DOI: 10.1016/j.adhoc.2017.10.010
      Issue No: Vol. 67 (2017)
       
  • Interference aware bandwidth estimation for load balancing in EMHR-energy
           based with mobility concerns hybrid routing protocol for VANET-WSN
           communication
    • Authors: Linda F. Mohaisen; Laurie L. Joiner
      Pages: 1 - 15
      Abstract: Publication date: November 2017
      Source:Ad Hoc Networks, Volume 66
      Author(s): Linda F. Mohaisen, Laurie L. Joiner
      The main goal of Vehicular Ad Hoc Networks (VANETs) is to improve driving safety. However, VANETs may not guarantee timely detection of dangerous road conditions or maintain communication connectivity when the network density is low, which may pose a risk to driving safety. Towards addressing this problem, the VANET is integrated with the inexpensive Wireless Sensor Network (WSN). Sensor nodes are deployed along the roadside to sense road conditions, and to buffer and deliver information about dangerous conditions to vehicles regardless of the density or connectivity of the VANET. The most challenging features in VANETs are their dynamic topology and mobility, where vehicles are moving at variable and high speeds and in different trajectories. In contrast, the challenge in the WSN is in managing the limited energy resources of the nodes, since the performance of WSNs strongly depends on their lifetime. Thus, the fundamental design challenge in designing routing protocols for a hybrid network of VANET-WSN is to maximize network lifetime and connectivity, and to minimize delay and energy consumption. To overcome these challenges, this research investigates the effects of different Quality of Service (QoS) parameters on forwarding decisions in an efficient distributed position based routing protocol, and focuses on bandwidth estimation. Bandwidth estimation is of great importance to network Quality of Service assurance, network load balancing, and routing. In this research, a bandwidth estimation strategy based on normalized throughput of a link, taking into account the interference and packet loss ratio in discrete time for every successfully delivered packet is proposed for a hybrid network of VANET-WSN. The simulation results show that the strategy is effective, and can accurately estimate the bandwidth of VANET-WSN. A comprehensive performance analysis in representative urban scenarios is performed that takes into account realistic propagation models and real city scenario traffic.

      PubDate: 2017-08-27T15:13:13Z
      DOI: 10.1016/j.adhoc.2017.08.004
      Issue No: Vol. 66 (2017)
       
  • A location aided controlled spraying routing algorithm for Delay Tolerant
           Networks
    • Authors: Hang Guo; Xingwei Wang; Hui Cheng; Min Huang
      Pages: 16 - 25
      Abstract: Publication date: November 2017
      Source:Ad Hoc Networks, Volume 66
      Author(s): Hang Guo, Xingwei Wang, Hui Cheng, Min Huang
      Delay Tolerant Networks (DTNs) often suffer from intermittent disruption and variable long delay due to factors such as mobility and energy. In this paper, a Location Aided Controlled Spraying (LACS) routing algorithm is proposed to deal with the challenging issues in DTN routing. Only the routing information carried by the contacted nodes is needed in this algorithm, and there is no need for global networks knowledge and hardware support. The routing process is divided into two stages, i.e., controlled spraying routing stage and single-copy routing stage. The maximum transfer throughput of the contact is checked before each message is forwarded. During the controlled spraying stage, the current node adjusts spraying strategy according to the encounter angle of the contact nodes. During the single-copy stage, a location prediction model based on the semi-Markov process (SMP) is introduced, and the node's behaviors can be captured both in the temporal and spatial domains with this model. The current node predicts the destination node's location, and then decides whether to forward the message to target node based on the time used for meeting the destination node. Simulation results show that the proposed algorithm can achieve better performance than the traditional routing schemes of DTNs in terms of delivery ratio, network overhead and transmission delay under both random node movement model and realistic trace scenario.

      PubDate: 2017-08-27T15:13:13Z
      DOI: 10.1016/j.adhoc.2017.08.005
      Issue No: Vol. 66 (2017)
       
  • IoT_ProSe: Exploiting 3GPP services for task allocation in the Internet of
           Things
    • Authors: Virginia Pilloni; Emad Abd-Elrahman; Makhlouf Hadji; Luigi Atzori; Hossam Afifi
      Pages: 26 - 39
      Abstract: Publication date: November 2017
      Source:Ad Hoc Networks, Volume 66
      Author(s): Virginia Pilloni, Emad Abd-Elrahman, Makhlouf Hadji, Luigi Atzori, Hossam Afifi
      This work focuses on the problem of task allocation among mobile objects that aim to collaborate in the execution of IoT (Internet of Things) applications. We consider 3GPP Proximity Services (ProSe) that enable Device to Device (D2D) communications for direct interaction among IoT objects. We first define the framework where devices willing to cooperate: (i) discover and join a cluster of objects to take part to the IoT_ProSe service; (ii) compete with the other objects in the cluster when a request for a service is sent to the cluster from the IoT application server. We then focus on two important problems. The first problem is the decision about which node should win the competition, for which we propose a game-theory based approach to find a solution maximizing objects’ utility functions. The second problem is the computation of the optimal size of devices’ clusters within a cell by maximizing the signal quality across the cell. Experimental results provide insights on the strategy performance. By appropriately setting working parameters, it is possible to improve system reliability up to 21%, and system lifetime up to 68%.

      PubDate: 2017-08-27T15:13:13Z
      DOI: 10.1016/j.adhoc.2017.08.006
      Issue No: Vol. 66 (2017)
       
  • Flexible resource allocation adaptive to communication strategy selection
           for cellular clients using Stackelberg game
    • Authors: Jinsong Gui; Yijia Lu; Xiaoheng Deng; Anfeng Liu
      Pages: 64 - 84
      Abstract: Publication date: November 2017
      Source:Ad Hoc Networks, Volume 66
      Author(s): Jinsong Gui, Yijia Lu, Xiaoheng Deng, Anfeng Liu
      In cooperative communication Networks (or cooperative cognitive radio networks), a source node usually recruits non-altruistic relays to execute cooperative communication with a target node, through compensating these potential relays with a fraction of its licensed frequency band. When a source node is far apart from a target node, it is difficult to achieve the desired transmission performance by cooperative communication. In this paper, a source node's communication strategy can dynamically be adjusted with help of a base station according to variation of wireless communication environments. Also, an appropriate relaying path can be constructed to replace a long-distance wireless link without demand of channel state information. Furthermore, following the proposed Stackelberg game-theoretic method based on three-party-cooperation, a base station can determine the preliminary division of a source node's licensed frequency band and the initial power allocation for all the relays in the same relaying path, while the source node and the related relays can dynamically adjust them respectively during data transmission according to information feedback.

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

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

      PubDate: 2017-07-24T04:41:55Z
      DOI: 10.1016/j.adhoc.2017.07.003
      Issue No: Vol. 65 (2017)
       
  • A review of broadcasting safety data in V2V: Weaknesses and requirements
    • Authors: Hanaa S. Basheer; Carole Bassil
      Pages: 13 - 25
      Abstract: Publication date: October 2017
      Source:Ad Hoc Networks, Volume 65
      Author(s): Hanaa S. Basheer, Carole Bassil
      One of the main goals in using vehicular ad hoc networks (VANETs) system is to provide the driver of a vehicle with services that helps him/her in avoiding chain accidents and traffic jam. Vehicles can get different services from global servers when connecting to the internet or can cooperate with each other, where each vehicle behaves as a collector for traffic information and a disseminator of necessary data to the neighbouring vehicles during their journey. However, disseminating safety data between connecting vehicles is a challenging task due to the quick change in the wireless network topology, and the broadcast protocol's reliance on many physical parameters (e.g. vehicle's speed, location, roads structures etc.). Thus, getting a reliable VANET system and ensuring the integrity of messages are the main objectives when introducing any dissemination method. This paper reviews several existing VANET safety applications, and revises the disseminating methods for safety messages between vehicles without infrastructure to cover a wide area in a quick reliable way. Wherefore we include relevant works that present different methods to broadcast the warning message between vehicles, particularly when no infrastructure is available. Towards the conclusion, we show a classification tabular for these works, and a comprehensive feedback to reach the optimal perception of the broadcast scheme during safety data dissemination that depends on three objects; the environment, the vehicle as a sender, and the vehicle as a receiver.

      PubDate: 2017-08-03T11:34:09Z
      DOI: 10.1016/j.adhoc.2017.07.004
      Issue No: Vol. 65 (2017)
       
  • Quantized feedback scheduling for MIMO-OFDM broadcast networks with
           subcarrier clustering
    • Authors: Prabina Pattanayak; Preetam Kumar
      Pages: 26 - 37
      Abstract: Publication date: October 2017
      Source:Ad Hoc Networks, Volume 65
      Author(s): Prabina Pattanayak, Preetam Kumar
      Feedback of user channel quality information (CQI) to base station (BS) is essential for efficient scheduling of multi-user (MU) multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) broadcast networks. This feedback overload increases linearly with the cardinality of users, transmit antennas and subcarriers present in MIMO-OFDM systems. Hence, clustering of adjacent subcarriers has been considered in literature for reduction in feedback load. Here users communicate the CQI of the center subcarrier of the clusters assuming that subcarriers of a cluster experience similar channel conditions. However, this method leads to inefficient resource scheduling for higher cluster sizes as it does not take advantage of CQI of other subcarriers that experience non-uniform channel conditions. This reason motivated us to develop a new limited feedback scheduling scheme where quantization of CQI with multiple bits is implemented along with clustering of adjacent subcarriers. In this scheme, the multi-bit quantized CQI of all the subcarriers of a cluster are examined for the efficient scheduling along with further reduction in the feedback overhead. Moreover, we proposed a less time consuming method to find the optimum quantization thresholds that play significant role in multi-bit quantization process by using genetic algorithm (GA). This GA methodology is computationally more efficient than exhaustive search process.

      PubDate: 2017-08-03T11:34:09Z
      DOI: 10.1016/j.adhoc.2017.07.007
      Issue No: Vol. 65 (2017)
       
  • Spectrum access in cognitive smart-grid communication system with
           prioritized traffic
    • Authors: Ram Narayan Yadav; Rajiv Misra; Sourabh Bhagat
      Pages: 38 - 54
      Abstract: Publication date: October 2017
      Source:Ad Hoc Networks, Volume 65
      Author(s): Ram Narayan Yadav, Rajiv Misra, Sourabh Bhagat
      Smart grid (SG) comprises heterogeneous characteristics of traffic such as control commands (safety, sensing, smart-meter readings) among power generation, transmission and end users. An effective and reliable two-way communication infrastructure between users and utility providers is important for improving the performance of smart grid. To support such traffic types in the smart grid, we have studied cognitive radio communication infrastructure-based smart grid. In this paper, we proposed a prioritized spectrum access scheme for cognitive smart grid communication systems to address the quality of service (QoS) requirements of heterogeneous traffic. SG traffic is categorized into two priority classes (high and low based on service requirements). We model the proposed spectrum access scheme (by considering the spectrum sensing error) using a multidimensional Markov chain. We have measured the performance based on the blocking probability, the dropping probability, the interference probability and the call completion rate for both the traffic types (high and the low class smart grid traffic). By Considering an environment where the traffic is heavy tailed, we have modeled the arrivals to follow a Pareto distribution, as the Poisson process model may under estimate the traffic especially when traffic is heavy tailed. The results illustrate that the proposed priority based scheme is able to significantly improve the QoS of high-priority traffic. It is also observed that the prioritized system is preferable over the non-prioritized system where all traffic types are treated the same in terms of SG data delivery.

      PubDate: 2017-08-03T11:34:09Z
      DOI: 10.1016/j.adhoc.2017.07.005
      Issue No: Vol. 65 (2017)
       
  • Performance of RF self-interference cancellation disturbed by fast-moving
           object in full-duplex wireless
    • Authors: Fei Wu; Chuan Huang; Youxi Tang
      Pages: 55 - 64
      Abstract: Publication date: October 2017
      Source:Ad Hoc Networks, Volume 65
      Author(s): Fei Wu, Chuan Huang, Youxi Tang
      In this paper, the performance of radio frequency (RF) self-interference (SI) cancellation in presence of flying/moving object is analyzed to achieve an uninterrupted FD transmission and reception. The SI leaked typically consists of two parts: slow time-varying SI and burst SI part. For simplification, slow time-varying SI part can be effectively suppressed. In addition, burst SI part can be modeled as a single path SI signal. To detect and estimate the burst SI part, superimposing training sequence is introduced in the transmit signals. Correspondingly, one special RF tap is adopted to suppress the burst SI part. Based on this scheme, the expression of instantaneous and average outage probability is derived and this can be solved by numerical method. It is found that the FD outage probability is significantly influenced by the flying/moving object velocity, by Doppler frequency, by the distance between the flying/moving object and the transceiver antenna, and the transmitter signal-to-training ratio.

      PubDate: 2017-08-03T11:34:09Z
      DOI: 10.1016/j.adhoc.2017.07.009
      Issue No: Vol. 65 (2017)
       
  • Design and analysis of RPL objective functions for multi-gateway ad-hoc
           low-power and lossy networks
    • Authors: Muhammad Omer Farooq; Cormac J. Sreenan; Kenneth N. Brown; Thomas Kunz
      Pages: 78 - 90
      Abstract: Publication date: October 2017
      Source:Ad Hoc Networks, Volume 65
      Author(s): Muhammad Omer Farooq, Cormac J. Sreenan, Kenneth N. Brown, Thomas Kunz
      RPL is a standard routing framework for low-power and lossy networks (LLNs). LLNs usually operate in challenged conditions, therefore RPL can be adapted to satisfy requirements of a particular LLN. RPL facilitates this through objective functions (OFs). An OF is used to discover and maintain data forwarding paths based on the requirements of LLNs. In RPL, different OFs can use different routing metrics in different ways. In this paper, we design different OFs and analyse their impact on RPL performance in multi-gateway ad-hoc LLNs. In conjunction with the shortest hop-count, our designed OFs also use the following tie-breaking metrics: available bandwidth, delay, buffer occupancy, and ETX. Our OFs use the tie-breaking metrics on a greedy or an end-to-end basis. In our experimental analysis, we consider the impact of duty-cycling, number of gateways, and data traffic load on the OFs’ performance. Our results demonstrate that, generally speaking, the performance improves with an increase in the number of gateways. In the absence of duty-cycling, the greedy approach is better compared to the end-to-end approach, and using delay, buffer occupancy, and ETX metrics as the tie-breaking metrics in conjunction with the shortest hop-count metric yield the best performance. In a relatively high data traffic load, all OFs perform similarly. In duty-cycling mode, frequent changes in the parent node incur extra synchronization time between a sender and receiver. OFs that use the tie-breaking metrics on an end-to-end basis do not frequently change parent nodes, hence they demonstrate better performance. Furthermore, in duty-cycling mode, the shortest hop-count metric demonstrates the best performance compared to the other metrics.

      PubDate: 2017-08-27T15:13:13Z
      DOI: 10.1016/j.adhoc.2017.08.002
      Issue No: Vol. 65 (2017)
       
  • ReSF: Recurrent Low-Latency Scheduling in IEEE 802.15.4e TSCH Networks
    • Authors: Glenn Daneels; Bart Spinnewyn; Steven Latré; Jeroen Famaey
      Abstract: Publication date: Available online 9 November 2017
      Source:Ad Hoc Networks
      Author(s): Glenn Daneels, Bart Spinnewyn, Steven Latré, Jeroen Famaey
      The recent increase of connected devices has triggered countless Internet-of-Things applications to emerge. By using the Time-Slotted Channel Hopping (TSCH) mode of the IEEE 802.15.4e MAC layer, wireless multi-hop networks enable highly reliable and low-power communication, supporting mission-critical and industrial applications. TSCH uses channel hopping to avoid both external interference and multi-path fading, and a synchronization-based schedule which allows precise bandwidth allocation. Efficient schedule management is crucial when minimizing the delay of a packet to reach its destination. In networks with recurrent sensor data transmissions that repeat after a certain period, current scheduling functions are prone to high latencies by ignoring this recurrent behavior. In this article, we propose a TSCH scheduling function that tackles this minimal-latency recurrent traffic problem. Concretely, this work presents two novel contributions. First, the recurrent traffic problem is defined formally as an Integer Linear Program. Second, we propose the Recurrent Low-Latency Scheduling Function (ReSF) that reserves minimal-latency paths from source to sink and only activates these paths when recurrent traffic is expected. Extensive experimental results show that using ReSF leads to a latency improvement up to 80% compared to state-of-the-art low-latency scheduling functions, with a negligible impact on power consumption of at most 6%.

      PubDate: 2017-11-11T12:35:06Z
      DOI: 10.1016/j.adhoc.2017.11.002
       
  • Multi-Functional Secure Data Aggregation Schemes for WSNs
    • Authors: Ping Zhang; Jianxin Wang; Kehua Guo; Fan Wu; Geyong Min
      Abstract: Publication date: Available online 8 November 2017
      Source:Ad Hoc Networks
      Author(s): Ping Zhang, Jianxin Wang, Kehua Guo, Fan Wu, Geyong Min
      Secure data aggregation schemes are widely adopted in wireless sensor networks, not only to minimize the energy and bandwidth consumption, but also to enhance the security. Statistics obtained from data aggregation schemes often fall into three categories, i.e., distributive, algebraic, and holistic. In practice, a wide range of reasonable aggregation queries are combinations of several different statistics. Providing multi-functional aggregation support is also a primary demand for data preprocessing in data mining. However, most existing secure aggregation schemes only focus on a single type of statistics. Some statistics, especially holistic ones (e.g., median), are often difficult to compute efficiently in a distributed mode even without considering the security issue. In this paper, we first propose a new Multi-functiOnal secure Data Aggregation scheme (MODA), which encodes raw data into well-defined vectors to provide value-preservation, order-preservation and context-preservation, and thus offering the building blocks for multi-functional aggregation. A homomorphic encryption scheme is adopted to enable in-ciphertext aggregation and end-to-end security. Then, two enhanced and complementary schemes are proposed based on MODA, namely, RandOm selected encryption based Data Aggregation (RODA) and COmpression based Data Aggregation (CODA). RODA can significantly reduce the communication cost at the expense of slightly lower but acceptable security on a leaf node, while CODA can dramatically reduce communication cost with the lower aggregation accuracy. The performance results obtained from theoretic analysis and experimental evaluation of three real datasets under different scenarios, demonstrate that our schemes can achieve the performance superior to the most closely related work.

      PubDate: 2017-11-11T12:35:06Z
      DOI: 10.1016/j.adhoc.2017.11.004
       
  • Security Threats and Countermeasures of MAC Layer in Cognitive Radio
           Networks
    • Authors: Mohsen Riahi Manesh; Naima Kaabouch
      Abstract: Publication date: Available online 8 November 2017
      Source:Ad Hoc Networks
      Author(s): Mohsen Riahi Manesh, Naima Kaabouch
      Cognitive radio is a promising technology proposed to solve the scarcity of the radio spectrum by opportunistically allocating the idle portion of the licensed users to unlicensed ones. The effectiveness of the cognitive radio is highly dependent on the fair and efficient management of the access to the unused portion of the frequency channels, which is performed by media access control (MAC) layer. Therefore, any malicious activities disrupting the operation of the MAC layer result in significant performance degradation of the cognitive radio networks. It is necessary to understand the different functionalities of the cognitive radio MAC (CR MAC) layer and to explore the possible attacks cognitive radio networks might encounter. The aim of this work is to investigate different attacks applicable to the MAC layer of cognitive radio and provide an overview of them based on CR MAC functionalities. In addition, the paper describes and compares recent defense strategies related to each attack.

      PubDate: 2017-11-11T12:35:06Z
      DOI: 10.1016/j.adhoc.2017.11.003
       
  • Multi-subpopulation evolutionary algorithms for coverage deployment of
           UAV-networks
    • Authors: D.G. Reina; H. Tawfik; S.L. Toral
      Abstract: Publication date: Available online 5 October 2017
      Source:Ad Hoc Networks
      Author(s): D.G. Reina, H. Tawfik, S.L. Toral
      The deployment of an unmanned aerial network (UAV-network) for the optimal coverage of ground nodes is an NP-hard problem. This work focuses on the application of a multi-layout multi-subpopulation genetic algorithm (MLMPGA) to solve multi-objective coverage problems of UAV-networks. The multi-objective deployment is based on a weighted fitness function that takes into account coverage, fault-tolerance, and redundancy as relevant factors to optimally place the UAVs. The proposed approach takes advantage of different subpopulations evolving with different layouts. This feature is aimed at reflecting the evolutionary concept of different species adapting to the search space conditions of the multi-objective coverage problem better than single-population genetic algorithms. The proposed multi-subpopulation genetic algorithm is evaluated and compared against single-population genetic algorithm configurations and other well-known meta-heuristic optimization algorithms, such as particle swarm optimization and hill climbing algorithm, under different numbers of ground nodes. The proposed MLMPGA achieves significantly better performance results than the other meta-heuristic algorithms, such as classical genetic algorithms, hill climbing algorithm, and particle swarm optimization, in the vast majority of our simulation scenarios.

      PubDate: 2017-11-05T13:01:05Z
      DOI: 10.1016/j.adhoc.2017.09.005
       
  • Recovery from Simultaneous Failures in a Large Scale Wireless Sensor
           Network
    • Authors: Samira Chouikhi; Inès El Korbi; Yacine Ghamri-Doudane; Leila Azouz Saidane
      Abstract: Publication date: Available online 14 October 2017
      Source:Ad Hoc Networks
      Author(s): Samira Chouikhi, Inès El Korbi, Yacine Ghamri-Doudane, Leila Azouz Saidane
      The Wireless sensor networks (WSNs) become more and more recognized these recent years and their applications spread in several domains. In general, these applications require that the network presents a minimum degree of reliability, effectiveness and robustness. However, the specificity of the nodes used in this type of networks makes them prone to failures. Indeed, the multichannel communications are generally privileged in the interference context which is very frequent in several WSNs’ applications due to the density of sensors and the harsh environment in which they are deployed. Moreover, in real applications, the occurrence of some faults (for example fire) may alter an entire zone of the network especially in the case of large scale deployment. Therefore, in this paper, we propose a network fault recovery approach from simultaneous failures in a large scale multichannel WSN. To make our solution as realistic as possible, we consider the case of the precision agriculture application and propose a detailed deployment of the WSN for that application. The choice of precision agriculture application is motivated by the fact that this application require large scale WSN (thousands and thousands of sensors) to supervise such a large area. Based on such precision agriculture scenario, we propose our fault recovery approach, called Simultaneous Failure Recovery based on Relay Node Relocation (SFR-RNR), that aims to restore the connectivity and partially the coverage in the network. The performance of the proposed approach is evaluated by simulation.

      PubDate: 2017-10-14T12:25:04Z
      DOI: 10.1016/j.adhoc.2017.10.008
       
  • Distributed Sensor Deployment Using Potential Fields
    • Authors: Y. Sinan Hanay; Veysel Gazi
      Abstract: Publication date: Available online 13 October 2017
      Source:Ad Hoc Networks
      Author(s): Y. Sinan Hanay, Veysel Gazi
      Maximization of sensing coverage has been an important problem in mobile sensor networks. In this work, we present two novel algorithms for maximizing sensing coverage in 2D and 3D spaces. We evaluate our methods by comparing with two previously proposed methods. All the four methods are based on potential fields. The previous work used the same potential function, however the algorithms we propose use two different potential functions in this work. Potential fields require low complexity, which is crucial for resource lacking mobile sensor nodes. Though potential fields are widely used for path planning in robotics, only a few works use potential fields for coverage maximization in mobile sensor networks. Through simulations, we compare our proposal with the previous algorithms, and show that the algorithm we propose here outperforms previous algorithms.

      PubDate: 2017-10-14T12:25:04Z
      DOI: 10.1016/j.adhoc.2017.09.006
       
  • On the Packet Delivery Delay Study for Three-Dimensional Mobile Ad Hoc
           Networks
    • Authors: Wu Wang; Bin Yang; Osamu Takahashi; Xiaohong Jiang; Shikai Shen
      Abstract: Publication date: Available online 12 October 2017
      Source:Ad Hoc Networks
      Author(s): Wu Wang, Bin Yang, Osamu Takahashi, Xiaohong Jiang, Shikai Shen
      This paper studies the packet delivery delay performance in three-dimensional mobile ad hoc networks (3D MANETs). Available work mainly focuses on the performance study in two-dimensional MANETs (2D MANETs), which cannot support delay-intensive applications in 3D MANETs. To explore the packet delivery delay performance in 3D MANETs, this paper adopts two-hop relay algorithm with packet replication for packet routing. With such an algorithm, source node can transmit a packet to at most f distinct relay nodes, which then help to forward the packet to its destination node. The algorithm is flexible such that the packet delivery process can be controlled through a proper setting of f. Specially, a general Markov chain theoretical framework is developed to model the packet delivery process under the algorithm in 3D MANETs. Based on the theoretical framework, the closed-form expressions are further derived for mean and relative standard deviation of packet delivery delay. Finally, extensive simulation and numerical results are provided to validate our theoretical models and illustrate the impact of network parameters on packet delivery delay performance in 3D MANETs.

      PubDate: 2017-10-14T12:25:04Z
      DOI: 10.1016/j.adhoc.2017.10.004
       
  • Chain-Branch-Leaf: a Clustering Scheme for Vehicular Networks Using Only
           V2V Communications
    • Authors: Lucas Rivoirard; Martine Wahl; Patrick Sondi; Marion Berbineau; Dominique Gruyer
      Abstract: Publication date: Available online 10 October 2017
      Source:Ad Hoc Networks
      Author(s): Lucas Rivoirard, Martine Wahl, Patrick Sondi, Marion Berbineau, Dominique Gruyer
      The development of vehicular networks leads to a plethora of new applications that are already becoming essential to the drivers and to cooperative vehicles. One important condition to the continuity of these new services is the existence of an ubiquitous network access, which cannot be completely guaranteed. In this context, developing reliable ad hoc vehicle-to-vehicle communications is a good alternative that also becomes mandatory. This work proposes a clustering scheme that combines the information on road configuration, vehicle mobility and link quality in order to build a structure similar to a vehicular network infrastructure, while relying only on the vehicles. This clustering scheme can be integrated into any reactive, proactive, or geographic ad hoc routing protocol in order to optimize the flooding of messages and simplify routing operations. The evaluations realized through simulation show that the proposed clustering scheme allows creating and maintaining a stable backbone during a significant time. Moreover, the simulation results show that the proposed clustering scheme reduces significantly the impact of broadcast traffic flooding in comparison with well-established techniques such as multipoint relaying, to mention few.

      PubDate: 2017-10-14T12:25:04Z
      DOI: 10.1016/j.adhoc.2017.10.007
       
  • No-Collision Grid Based broadcast scheme and Ant Colony System with Victim
           Lifetime Window for navigating robot in first aid applications
    • Authors: Sarah Allali; Mahfoud Fares Ouzzani Hamid Menouar
      Abstract: Publication date: Available online 6 October 2017
      Source:Ad Hoc Networks
      Author(s): Sarah Allali, Mahfoud Benchaïba, Fares Ouzzani, Hamid Menouar
      The system that we propose in this paper aims to help robots to rescue immobilized victims by providing first aid (e.g.: oxygen masks). Such first aid can increase the chances of saved lives, by maintaining the status of victims until the arrive of rescue team for the take over. The proposed system takes advantage from a grid-based architecture for sites monitoring that has been presented in a previous work. It is composed of a mobile robot and a wireless sensor network (WSN). The robot has the mission of rescuing victims, and the WSN has three main missions: (1) detecting the existence of victims or any anomaly in the area, (2) disseminating reliably information and alerts and finally (3) providing the robot with efficient route guidance. To disseminate information with low cost (i.e avoids collisions caused mainly by the hidden node problem), we propose a distributed algorithm that insures the no collisions in the broadcast scheme using a grid, we called it No-Collision Grid Based (NCCB). Using NCGB allows to create all possible paths from any cell to the victim. This helps in guiding the robot through the safest and shortest route in a distributed manner. In order to increase the number of rescued victims, we used Ant Colony System with Victim Lifetime Window (ACS-VLM) to schedule the sequence of victims to rescue. The proposed solution has been validated through intensive simulations which show an important improvement in terms of overall network overhead, success ratio and the number of rescued victims.

      PubDate: 2017-10-08T08:33:11Z
       
  • A Secure and Efficient Group Key Agreement Approach for Mobile Ad Hoc
           Networks
    • Authors: Orhan Ermiş; Şerif Bahtiyar; Emin Anarım; M. Ufuk Çağlayan
      Abstract: Publication date: Available online 3 October 2017
      Source:Ad Hoc Networks
      Author(s): Orhan Ermiş, Şerif Bahtiyar, Emin Anarım, M. Ufuk Çağlayan
      Mobile ad hoc networks have been used in many application areas such as sensors, file sharing and vehicle-to-vehicle communications. Providing secure communications among the users in such networks is a significant issue. Group key agreement protocols are frequently used to provide security in mobile ad hoc networks. There is a number of problems related to the use of group key agreement protocols in mobile ad hoc networks, such as adaptation in cluster-based communications, securely selecting the cluster head for inter-cluster communications, providing secure group key update mechanism for dynamic groups and reducing costs of communications and computations. In this study, we propose a secure and efficient group key agreement protocol that is adaptive for cluster-based communications in mobile ad hoc networks. We describe a novel secure cluster-head selection mechanism in the proposed protocol. The protocol provides security for dynamic group operations in addition to the basic security properties. The proposed protocol also provides better performance in terms of reducing the communications and computational costs. Finally, we present a set of simulations for the proposed protocol in mobile ad hoc networks scenario.

      PubDate: 2017-10-08T08:33:11Z
      DOI: 10.1016/j.adhoc.2017.10.003
       
  • Design and Performance Analysis of a Full-Duplex MAC Protocol for Wireless
           Local Area Networks
    • Authors: Deniz Marlali; Ozgur Gurbuz
      Abstract: Publication date: Available online 2 October 2017
      Source:Ad Hoc Networks
      Author(s): Deniz Marlali, Ozgur Gurbuz
      In this paper, Synchronized Contention Window Full Duplex (S-CW FD) protocol is presented as a medium access control (MAC) protocol that enables full duplex (FD) in wireless local area networks (WLANs), while seamlessly operating together with legacy nodes. For performance analysis, a Markov chain model of S-CW FD is devised, using this model, the saturated throughput of S-CW FD is derived and the results are validated by comparisons with OPNET simulations. Later, through detailed simulations, S-CW FD is evaluated against standard half-duplex IEEE 802.11, considering realistic self-interference and channel models and the effect of hidden nodes. It is shown that S-CW FD MAC protocol can double the throughput of standard half duplex IEEE 802.11 without hidden nodes in the network, and its improvement can get as high as ten fold in the presence of hidden nodes. In this work, S-CW FD is also compared to two similar contention based FD MAC protocols from the literature, and it is shown that, under typical network loads, S-CW FD outperforms those protocols by up to 30%, despite much lower complexity. Overall, S-CW FD stands out as a promising candidate for implementing FD in WLANs due to significant performance improvements, simplicity and flexibility for application in different FD modes to support bidirectional, relaying and cellular scenarios.

      PubDate: 2017-10-08T08:33:11Z
      DOI: 10.1016/j.adhoc.2017.10.001
       
  • The CUSCUS simulator for Distributed Networked Control Systems:
           Architecture and Use-cases
    • Authors: Nicola Roberto Zema; Angelo Trotta; Enrico Natalizio; Marco Di Felice; Luciano Bononi
      Abstract: Publication date: Available online 28 September 2017
      Source:Ad Hoc Networks
      Author(s): Nicola Roberto Zema, Angelo Trotta, Enrico Natalizio, Marco Di Felice, Luciano Bononi
      The current merging of networking and control research fields within the scope of robotic applications is creating fascinating research and development opportunities. However, the tools for a proper and easy management of experiments still lag behind. Although different solutions have been proposed to simulate and emulate control systems and, more specifically, fleets of Unmanned Aerial Vehicles (UAVs), still they do not include an efficient and detailed network-side simulation, which is usually available only on dedicated software. On the other hand, current advancements in network simulations suites often do not include the possibility to include an accurate description of controlled systems. In the middle 2010s, integrated solutions of networking and control for fleets of UAVs are still lacking. In this paper, we fill such gap by presenting a simulation architecture for networked control systems which is based on two well-known solutions in both the fields of networking simulation (the NS-3 tool) and UAV control simulation (the FL-AIR tool). Three main research contributions are provided: (i) first, we show how the existing tools can be integrated on a closed-loop architecture, so that the network propagation model (NS-3 side) is influenced by the drone mobility and by the 3D scenario map (FL-AIR side); (ii) second, we implement a novel module, which allows modeling realistic 3D environments by importing city-wide characteristics by the popular OpenStreetMap service; (iii) third, we demonstrate the modeling capabilities of the CUSCUS framework on two realistic use-cases, corresponding to well-known application scenarios of UAVs, i.e. dynamic formation control and static coverage of a target area.

      PubDate: 2017-09-30T06:38:43Z
      DOI: 10.1016/j.adhoc.2017.09.004
       
  • Interest-aware energy collection & resource management in machine
           to machine communications
    • Authors: Eirini Eleni Tsiropoulou; Giorgos Mitsis; Symeon Papavassiliou
      Abstract: Publication date: Available online 23 September 2017
      Source:Ad Hoc Networks
      Author(s): Eirini Eleni Tsiropoulou, Giorgos Mitsis, Symeon Papavassiliou
      The emerging paradigm of Machine to Machine (M2M)-driven Internet of Things (IoT), where physical objects are not disconnected from the virtual world but aim at collectively provide contextual services, calls for enhanced and more energy-efficient resource management approaches. In this paper, the problem is addressed through a joint interest, physical and energy-aware clustering and resource management framework, capitalizing on the wireless powered communication (WPC) technique. Within the proposed framework the numerous M2M devices initially form different clusters based on the low complexity Chinese Restaurant Process (CRP), properly adapted to account for interest, physical and energy related factors. Following that, a cluster-head is selected among the members of each cluster. The proposed approach enables the devices of a cluster with the support of the cluster-head to harvest and store energy in a stable manner through Radio Frequency (RF) signals adopting the WPC paradigm, thus prolonging the operation of the overall M2M network. Each M2M device is associated with a generic utility function, which appropriately represents its degree of satisfaction in relation to the consumed transmission power. Based on the distributed nature of the M2M network, a maximization problem of each device's utility function is formulated as a non-cooperative game and its unique Nash equilibrium point is determined, in terms of devices’ optimal transmission powers. Considering the devices’ equilibrium transmission powers, the optimal charging transmission powers of the cluster-heads are derived. The performance of the proposed approach is evaluated via modeling and simulation and under various topologies and scenarios, and its operational efficiency and effectiveness is demonstrated.

      PubDate: 2017-09-30T06:38:43Z
      DOI: 10.1016/j.adhoc.2017.09.003
       
  • Drone networks: Communications, coordination, and sensing
    • Authors: Evşen Yanmaz; Saeed Yahyanejad; Bernhard Rinner; Hermann Hellwagner; Christian Bettstetter
      Abstract: Publication date: Available online 23 September 2017
      Source:Ad Hoc Networks
      Author(s): Evşen Yanmaz, Saeed Yahyanejad, Bernhard Rinner, Hermann Hellwagner, Christian Bettstetter
      Small drones are being utilized in monitoring, transport, safety and disaster management, and other domains. Envisioning that drones form autonomous networks incorporated into the air traffic, we describe a high-level architecture for the design of a collaborative aerial system consisting of drones with on-board sensors and embedded processing, coordination, and networking capabilities. We implement a multi-drone system consisting of quadcopters and demonstrate its potential in disaster assistance, search and rescue, and aerial monitoring. Furthermore, we illustrate design challenges and present potential solutions based on the lessons learned so far.

      PubDate: 2017-09-30T06:38:43Z
      DOI: 10.1016/j.adhoc.2017.09.001
       
  • Geographic Routing and Hole Bypass using Long Range Sinks for Wireless
           Sensor Networks
    • Authors: Moysés M. Lima; Horácio A.B.F. Oliveira; Daniel L. Guidoni; Antonio A.F. Loureiro
      Abstract: Publication date: Available online 6 September 2017
      Source:Ad Hoc Networks
      Author(s): Moysés M. Lima, Horácio A.B.F. Oliveira, Daniel L. Guidoni, Antonio A.F. Loureiro
      Greedy Forward is a well-known technique used by most of the geographic routing algorithms to forward packets to the node that is geographically closer to the destination node. It is the simplest form of the proposed geographic routing algorithms and it is particularly attractive in sensor networks by bringing additional advantages such scalability, dynamism, and high delivery rates. However, in the presence of a hole (or voids), greedy forward techniques tend to fail. Thus, a hole bypass solution needs to be used in order to route packets to a node where greedy forwarding process can be resumed. In this work, we propose a new geographic routing algorithm called REACT that can bypass routing holes and create routing paths toward the sink node. Our solution takes advantage of the higher communication range of the sink node and the Received Signal Strength Indicator (RSSI) to enable the construction of routing paths by self-electing the next hop at each step while also performing data aggregation. No extra packets are required to configure the routing task. Our results clearly show an efficient data delivery achieved by the proposed algorithm in scenarios with routing holes with all the benefits of a greedy forwarding technique.

      PubDate: 2017-09-11T12:49:24Z
      DOI: 10.1016/j.adhoc.2017.08.010
       
  • Approximate Cardinality Estimation (ACE) in Large-Scale Internet of Things
           Deployments
    • Authors: Qing Cao; Yunhe Feng; Zheng Lu; Hairong Qi; Leon Tolbert; Lipeng Wan; Zhibo Wang; Wenjun Zhou
      Abstract: Publication date: Available online 26 August 2017
      Source:Ad Hoc Networks
      Author(s): Qing Cao, Yunhe Feng, Zheng Lu, Hairong Qi, Leon Tolbert, Lipeng Wan, Zhibo Wang, Wenjun Zhou
      IoT (Internet of Things) deployments have been used in many diverse applications in increasingly large numbers, usually composed of embedded sensors, computational units, and actuators. One central problem with IoT applications is that we frequently need to query the number of nodes according to certain requirements, or filters. For example, a user may want to query the number of nodes that are currently actively sensing data, or having data above a threshold. Conventional methods typically require each active node to report their status, leading to a total communication overhead that is at least proportional to the network size. In this paper, we study the problem of deployment size estimation by investigating probabilistic methods for processing queries, where we only try to obtain approximate estimates within desired confidence intervals. Our methods are different with other probabilistic methods, such as sampling, in that our approach is based on the well-known birthday paradox in statistics. Hence, our methods provide a different solution that can be combined or used to enhance existing methods. We demonstrate through extensive simulations that their overhead is considerably lower than conventional methods, usually by an order of magnitude.

      PubDate: 2017-08-27T15:13:13Z
      DOI: 10.1016/j.adhoc.2017.08.009
       
  • Convergecast in Wireless Body Area Networks
    • Authors: Wafa Badreddine; Nesrine Khernane; Maria Potop-Butucaru; Claude Chaudet
      Abstract: Publication date: Available online 24 August 2017
      Source:Ad Hoc Networks
      Author(s): Wafa Badreddine, Nesrine Khernane, Maria Potop-Butucaru, Claude Chaudet
      Wireless Body Area Networks (WBAN) is a recent challenging area in the health monitoring domain. There are several concerns in this area ranging from energy efficient communication to designing delays efficient protocols that support nodes dynamicity induced by human body mobility. This paper focuses on the convergecast or data gathering protocols in WBAN. Our contribution is twofold. First, we extensively analyze the impact of postural body mobility on various classes of multi-hop convergecast strategies. Our study does not limit itself to the existing state-of-the-art in WBAN, we adapted to WBAN settings strategies from the areas of Delay Tolerant Networks (DTN) and Wireless Sensor Networks (WSN). We evaluate these strategies in terms of resilience to the human mobility, end-to-end delay and energy consumption, via the OMNeT++ simulator that we enriched with a realistic channel model issued from the recent research on biomedical and health informatics. Our simulations show that strategies that perform well in DTN and WSN cannot be just extrapolated to WBAN without a deeper investigation. That is, existing convergecast strategies for DTN or WSN do not perform well with postural body movements because of the topological partitioning provoked by important link attenuations due to signal obstructions either by clothes or by the body itself. Secondly, our extensive simulations give us valuable insights and directions for designing a novel convergecast strategy for WBAN called Hybrid that presents a good compromise in terms of resiliency to mobility, end-to-end delay and energy consumption.

      PubDate: 2017-08-27T15:13:13Z
      DOI: 10.1016/j.adhoc.2017.08.008
       
  • On State Maintenance in Cluster-Based Mobile Ad-hoc Networks
    • Authors: Amit Banerjee; Chung-Ta King; Hung-Chang Hsiao
      Abstract: Publication date: Available online 24 August 2017
      Source:Ad Hoc Networks
      Author(s): Amit Banerjee, Chung-Ta King, Hung-Chang Hsiao
      Clustering is an effective strategy for tackling the dynamics and scalability in a large-scale mobile ad hoc networks (MANETs). However, the mobility of the nodes makes it very difficult to maintain the states of the clusters, such as connectivity between clusters, available bandwidth, and node membership. A good maintenance scheme should balance the workload and power consumption of the nodes, incur little overhead, and track the changes timely and accurately. For this, we consider the implementation of a maintenance sublayer to handle the dynamic state of the clusters. The idea is to hide the dynamics of the underlying clusters, to improve the performance of applications in MANET. In this paper, we examine the design space of the state maintenance problem in cluster-based MANETs. At one end, we study a fully distributed approach, called Cluster-Based WithOut Head Overlay (CWOHO). At the other end, we consider the strategy that uses cluster heads to handle the maintenance operations, called Cluster-Based With Head Overlay (CWHO). In-between two extremes, we investigate a third possibility, called Clusters with Neighbor Information (CNI). We provide an in-depth and comprehensive study of these strategies under various network conditions and mobility models. Our experimental evaluation shows that the data delivery ratio of CWOHO is at least 7% more than CWHO, under increasing node mobility and number of clusters. However, the reverse is true for the control overhead.

      PubDate: 2017-08-27T15:13:13Z
      DOI: 10.1016/j.adhoc.2017.08.007
       
  • Compressive Detection and Localization of Multiple Heterogeneous Events in
           Sensor Networks
    • Authors: Ruobing Jiang; Yanmin Zhu; Tong Liu; Qiuxia Chen
      Abstract: Publication date: Available online 2 August 2017
      Source:Ad Hoc Networks
      Author(s): Ruobing Jiang, Yanmin Zhu, Tong Liu, Qiuxia Chen
      This paper focuses on the comprehensive event detection and localization problem which efficiently detects not only the number and the position, but also the event signal strength of events in sensor networks. We consider the practical situation where multiple events may simultaneously occur, their signal with heterogeneous strength attenuates over distance and their signal propagation region may overlap. The problem becomes even more challenging when we get rid of the commonly made impractical assumptions, such as the oversimplified binary detection model, the awareness of the number and potential positions of future events, and the existing of super sensor nodes with unlimited sensing range. Inspired by spatially sparse event occurrences, we propose the efficient compressive sensing based approach called CED. Instead of collecting complete sensor readings, our self-driven and fully distributed measurement construction process makes only a small number of qualified measurements, enabling compressive sensing based data recovery. The distinguishing feature of our approach is that it requires no knowledge of, and is adaptive to, the number of occurred events which is changing over time. We have validated signal attenuation model of real-world events and implemented the proposed approach on a testbed of 36 TelosB motes. Testbed experiments and simulation results jointly demonstrate that our approach can achieve high detection rate with event occurred grids while incurring modest transmission overhead.

      PubDate: 2017-08-03T11:34:09Z
      DOI: 10.1016/j.adhoc.2017.08.001
       
  • Performance Analysis of Superior Selective Reporting-based Energy
           Efficient Cooperative Spectrum Sensing in Cognitive Radio Networks
    • Authors: Rajalekshmi Kishore; Ramesha C.K.; Sanjeev Gurugopinath; K.R. Anupama
      Abstract: Publication date: Available online 1 August 2017
      Source:Ad Hoc Networks
      Author(s): Rajalekshmi Kishore, Ramesha C.K., Sanjeev Gurugopinath, K.R. Anupama
      We study the energy efficiency of superior selective reporting-based schemes for spectrum sensing in cognitive radio networks. We first consider the superior selective reporting (SSR) scheme proposed earlier in the literature, and derive the achievable throughput, energy consumption and energy efficiency (EE) of the SSR scheme. We propose the maximization of EE for the SSR scheme as a multiple variable-based, non-convex optimization problem and provide approximations to reduce it to a quasi-convex optimization. We highlight that the errors due to these approximations are negligible. The SSR scheme is designed to optimize the energy consumption, which enhances the EE. Alternatively, EE can be improved by increasing the achievable throughput. Towards this end, we propose a novel variation on the SSR scheme called the opportunistic SSR (OSSR) scheme, and carry out its EE analysis. We study the tradeoff between performances of the SSR and OSSR schemes – the implicit tradeoff between achievable throughput and energy consumption, and discuss the regimes where OSSR is preferred over SSR and vice-versa, in terms of the EE. Also, through an extensive numerical study, we show that both schemes outperform the conventional schemes that employ the OR and AND fusion rules, in terms of energy efficiency.

      PubDate: 2017-08-03T11:34:09Z
      DOI: 10.1016/j.adhoc.2017.07.010
       
  • Simulation of control loops in wireless networks: relating QoS with QoC
    • Authors: Sergio R.M. Canovas; Carlos E. Cugnasca; Cíntia B. Margi
      Abstract: Publication date: Available online 25 July 2017
      Source:Ad Hoc Networks
      Author(s): Sergio R.M. Canovas, Carlos E. Cugnasca, Cíntia B. Margi
      Considering the flexibility of network-based control systems and the wide adoption of wireless IP networks, the relationship between Quality of Service (QoS) and Quality of Control (QoC) parameters is studied in a simple control loop implemented over a wireless ad hoc network. This relationship is investigated using ns-2 simulator in three scenarios: static without packet loss, static with packet loss and mobile. The first scenario was compared to a case study for wired networks presented in the literature. Similar results were obtained, according to the prediction that different packet-switched technologies would present similar results because the concepts of QoS parameters are general enough. Results related to the other two scenarios qualitatively show QoC problems that appear due to the high utilization rate of the network and route disruption due to mobility. These problems can be summarized by the “inertia” of the controlled variable. A proof-of-concept experiment was also implemented to complement and to evaluate simulations.

      PubDate: 2017-08-03T11:34:09Z
      DOI: 10.1016/j.adhoc.2017.07.008
       
  • Optimal Energy Aware Clustering in Circular Wireless Sensor Networks
    • Authors: Mahdi Arghavani; Mohammad Esmaeili; Maryam Esmaeili; Farzad Mohseni
      Abstract: Publication date: Available online 25 July 2017
      Source:Ad Hoc Networks
      Author(s): Mahdi Arghavani, Mohammad Esmaeili, Maryam Esmaeili, Farzad Mohseni
      The lifetime of a wireless sensor node refers to the duration after which the node's energy has ended. Since battery replacement in most applications of wireless sensor networks is not possible, designing an energy-efficient communication protocol in these networks is very important. Therefore, many studies have been conducted to find a solution to increase the lifetime of these networks. Clustering is a useful technique for partitioning the network to areas, called clusters and entrusting energy-waste issues (e.g. data gathering, aggregating and routing to the sink) to some specific nodes, the cluster heads. In this paper, a new method for Optimal Clustering in Circular Networks (OCCN) is proposed which aims to mitigate energy consumption and increase the lifetime of wireless sensor networks. In this method, which is proposed for a circular area surrounding a sink, one hop communication between the cluster heads and the sink is replaced by an optimal multi-hop communications. Moreover, the optimal number of clusters is computed and the energy consumption is optimized by partitioning the network into nearly the same size clusters in a distributed manner. Simulation results indicate that the proposed method achieved more than 35% improvements in terms of energy consumption in comparison to other well-known clustering techniques.

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

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

      PubDate: 2017-06-16T20:23:58Z
      DOI: 10.1016/j.adhoc.2017.06.003
       
 
 
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.198.2.110
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016