for Journals by Title or ISSN
for Articles by Keywords

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

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

Similar Journals
Journal Cover
Ad Hoc Networks
Journal Prestige (SJR): 0.53
Citation Impact (citeScore): 4
Number of Followers: 11  
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 1570-8705
Published by Elsevier Homepage  [3177 journals]
  • An intelligent Edge-IoT platform for monitoring livestock and crops in a
           dairy farming scenario
    • Abstract: Publication date: Available online 1 December 2019Source: Ad Hoc NetworksAuthor(s): Ricardo S. Alonso, Inés Sittón-Candanedo, Óscar García, Javier Prieto, Sara Rodríguez-GonzálezAbstractToday’s globalized and highly competitive world market has broadened the spectrum of requirements in all the sectors of the agri-food industry. This paper focuses on the dairy industry, on its need to adapt to the current market by becoming more resource efficient, environment-friendly, transparent and secure. The Internet of Things (IoT), Edge Computing (EC) and Distributed Ledger Technologies (DLT) are all crucial to the achievement of those improvements because they allow to digitize all parts of the value chain, providing detailed information to the consumer on the final product and ensuring its safety and quality. In Smart Farming environments, IoT and DLT enable resource monitoring and traceability in the value chain, allowing producers to optimize processes, provide the origin of the produce and guarantee its quality to consumers. In comparison to a centralized cloud, EC manages the Big Data generated by IoT devices by processing them at the network edge, allowing for the implementation of services with shorter response times, and a higher Quality of Service (QoS) and security. This work presents a platform oriented to the application of IoT, Edge Computing, Artificial Intelligence and Blockchain techniques in Smart Farming environments, by means of the novel Global Edge Computing Architecture, and designed to monitor the state of dairy cattle and feed grain in real time, as well as ensure the traceability and sustainability of the different processes involved in production. The platform is deployed and tested in a real scenario on a dairy farm, demonstrating that the implementation of EC contributes to a reduction in data traffic and an improvement in the reliability in communications between the IoT-Edge layers and the Cloud.
  • An Efficient Route Planning Model for Mobile Agents on the Internet of
           Things using Markov Decision Process
    • Abstract: Publication date: Available online 30 November 2019Source: Ad Hoc NetworksAuthor(s): Shamim Yousefi, Farnaz Derakhshan, Hadis Karimipour, Hadi S. AghdasiAbstractData aggregation on the Internet of Things (IoT) needs context-aware routing protocols to satisfy the Quality of Services (QoS) requirements. Developing energy-efficient, delay-aware, and reliable route planning, in particular, is one of the significant challenges in the scenarios of data aggregation for IoT applications. The established data aggregation approaches, which exploit the client-server-based methods, struggle with the short lifetime of the network, and high data transmission delay. It does not cover the variety of applications, which developed through IoT. To address these challenges, in this paper, the concept of mobile software agents for data aggregation on the IoT is used. The paper proposes a novel route planning mechanism for data aggregation on IoT using mobile agents. The proposed mechanism is composed of two main stages. The first stage clusters the IoT devices; then, organizes the cluster-heads into some groups by using an angle-based process for the assignment of mobile agents. The main purpose of the second stage is to provide route planning for each mobile agent in each group of the cluster-heads for efficient data aggregation through Markov Decision Process (MDP). The results show that the proposed mechanism improves energy consumption, data transmission delay, and the reliability of the IoT.
  • UAV-Assisted Wireless Powered Internet of Things: Joint Trajectory
           Optimization and Resource Allocation
    • Abstract: Publication date: Available online 29 November 2019Source: Ad Hoc NetworksAuthor(s): Zhenyu Na, Mengshu Zhang, Jun Wang, Zihe GaoAbstractDue to affordable price, high mobility and flexible maneuverability, Unmanned Aerial Vehicle (UAV)-assisted communication can play an important role in the deployment of the Internet of Things (IoT) in emergency. Since UAV network performance is highly dependent on UAV deployment location, trajectory design becomes the research hotspot in UAV-assisted communication. To this end, a UAV-assisted multicarrier wireless powered communication model is proposed for IoT scenarios in this paper. Specifically, as an aerial base station, the UAV transmits Orthogonal Frequency Division Multiplexing (OFDM) signals to IoT nodes, while IoT nodes decode information and harvest energy from the signals. Afterwards, IoT nodes transmit information to the UAV by using the harvested energy. A joint UAV trajectory and resource allocation scheme based on OFDM is proposed. The aim is to maximize the minimum achievable rate in the uplink among all IoT nodes by jointly optimizing UAV trajectory, subcarrier, power and subslot allocation, subject to the achievable sum rate of all IoT nodes in the downlink. Due to the non-convexity and complexity of the formulated optimization problem, an alternative iteration algorithm is proposed to deal with the problem. Simulation results that the proposed algorithm can optimize the UAV trajectory and adapt to the node movement. Compared with conventional resource allocation schemes, the proposed scheme not only significantly enhances the minimum achievable rate, but also works well for two flight modes.
  • Buffer-Aided Relay Selection for Secure Two-Hop Wireless Networks with
           Decode-and-Forward Relays and a Diversity-Combining Eavesdropper
    • Abstract: Publication date: Available online 15 November 2019Source: Ad Hoc NetworksAuthor(s): Xuening Liao, Yuanyu Zhang, Zhenqiang Wu, Xiaohong JiangAbstractThis paper investigates the buffer-aided relay selection issue for achieving physical layer security (PLS) in two-hop wireless networks with Decode-and-Forward (DF) relays. Available works mainly focus on scenarios with independent-decoding eavesdroppers. However, the more hazardous scenarios with diversity-combining eavesdroppers that combine the signals in two hops to decode the packets are largely ignored. This paper considers a two-hop wireless network with multiple DF relays and one diversity-combining eavesdropper under two cases with perfect and partial eavesdropper channel state information (CSI) respectively. We first propose two secure buffer-aided relay selection schemes to suppress the eavesdropper for both eavesdropper CSI cases respectively. We then derive analytical expressions for the end-to-end (E2E) secure transmission probability (STP) and E2E delay of the network. Finally, we provide extensive simulation and numerical results to validate the correctness of the expressions and also to investigate the E2E STP and E2E delay performances. The results showed that the proposed schemes can achieve better E2E STP performance than the well-known Max-ratio buffer-aided relay selection scheme but at the cost of an increased E2E delay.
  • Performance Analysis of Cooperative NOMA at Intersections for Vehicular
           Communications in the Presence of Interference
    • Abstract: Publication date: Available online 13 November 2019Source: Ad Hoc NetworksAuthor(s): Baha eddine Youcef Belmekki, Abdelkrim Hamza, Benoît EscrigAbstractRoad traffic safety is a crucial issue, and more specifically at road intersections. At the same time, vehicular communications (VCs) are attracting a great attention thanks to their useful safety applications. In this paper, we study the performance of cooperative VCs at intersections, in the presence of interference when the communication system implements a non-orthogonal multiple access (NOMA) scheme. First, we derive the outage probability and the average achievable rate for a scenario involving a source, a relay, and two destinations, when the destinations can be either on the roads or outside the roads. The derivations are extended for K destinations. Closed form outage probability expressions and quasi-closed form average achievable rate expressions are obtained. Both perfect and imperfect successive interference cancellation (SIC) are incorporated into the analysis. We show that the outage probability increases and the average achievable rate decreases when vehicles move toward the intersection. We also compare the performance of VCs at intersections and at highways, and show that the performance of VCs at intersections is worse than at highways. We compare cooperative NOMA with cooperative orthogonal multiple access (OMA) in VCs, and show that average achievable rate NOMA outperforms average achievable rate OMA in terms of outage probability and average achievable rate. We also demonstrate that the benefits of cooperative NOMA over cooperative OMA becomes greater for high data rates. We also investigate the best relay position for the two destinations. Finally, we show that the performance of cooperative NOMA decreases drastically when the system parameters are not chosen carefully. All the analytical results are validated by Monte-Carlo simulations.
  • Rate and Coverage Analysis in Multi-tier Heterogeneous Network Using
           Stochastic Geometry Approach
    • Abstract: Publication date: Available online 12 November 2019Source: Ad Hoc NetworksAuthor(s): Moubachir Madani FadoulAbstractTo meet massive wireless traffic demand in the upcoming fifth generation cellular networks, the rapid growth of small cells is emerging as an attractive solution and deriving cellular network toward randomness and heterogeneity. In a typical macrocell, there are many deployed femtocells and few picocells with unplanned users. In such a heterogeneous cellular network, using random spatial models is a rational approach to characterize the base stations (BS) locations. The key issue for the deployment of small cells is interference management. Considering multi-tier cellular network, in this paper we develop a general kth-tier BSs model that captures the downlink multi-antenna heterogeneous cellular network with variable parameters such as the number of antenna, target signal-to-noise-and-interference ratio (SINR), transmitted power, and deployment density. In particular, we consider K−tier transmission and compare it with a single-tier, traditional grid model and multi-antenna ultra-dense network (UDN) model to obtain tractable rate and coverage probability. The results showed that the proposed model outperforms the traditional multi-antenna ultra-dense network (UDN) model and its accuracy is confirmed to be similar to the traditional grid model. In addition, a comparison with the counterpart uplink model is provided, which reveals that the coverage probability of the proposed downlink model decreases when the fractional power control (ϵ) increases in the uplink.
  • Reliable Congestion Control Mechanism for Safety Applications in Urban
    • Abstract: Publication date: Available online 8 November 2019Source: Ad Hoc NetworksAuthor(s): Wenfeng Li, Wuli Song, Qiang Lu, Chao YueAbstractIn vehicular ad hoc networks (VANETs), cooperation between vehicles is needed for proper performance of safety applications. Beacons are periodically broadcasted by vehicles to inform their neighbors of their information, such that periodic beacons are one of the building blocks that enable the operation of safety applications. Safety applications have their own strict quality of service (QoS) requirements, and they require reliable and timely data communication within networks. When many vehicles are trying to broadcast within a confined area at the same time, frequent channel contention and congestion may occur. Therefore, channel congestion control mechanisms are key for reliable and efficient operation of safety applications.In this paper, an adaptive beacon generation rate (ABGR) congestion control mechanism is proposed to reduce channel congestion and contention. ABGR can dynamically adjust the beacon generation rate according to varying levels of vehicles’ density to ensure reliable and timely delivery of beacons. Inspired by the correlation between traffic density and vehicle speed, a dynamic application-level reliability assessment scheme (T-Pro) is proposed to evaluate the reliability of various safety applications at varying density. Finally, the application-level reliability of three safety applications is evaluated using the ABGR mechanism. Numerical results show that the performance of ABGR is far higher than that of the current DSRC. The application-level reliability of three safety applications exceeds 99%, even if density reaches 450 vehicles/(km*3lanes).
  • Intelligent Jamming-aware Routing in Multi-hop IoT-based Opportunistic
           Cognitive Radio Networks
    • Abstract: Publication date: Available online 7 November 2019Source: Ad Hoc NetworksAuthor(s): Haythem Bany Salameh, Safa Otoum, Moayad Aloqaily, Rawan Derbas, Ismaeel Al Ridhawi, Yaser JararwehAbstractCognitive Radio Networks (CRNs) have emerged as a promising next-generation network technology that solves the spectrum scarcity issue and improves spectrum utilization. It is designed to help grant access for unlicensed users and utilize the maximum available licensed bandwidth. Moreover, the Internet of Things (IoT) has brought a significant promise to a multitude of applications and services allowing for anytime and anywhere connectivity. The coexistence of IoT and CRN has enabled a broad range of solutions to be available for users in an efficient and somewhat secure manner. But, with today’s resource consuming and time-sensitive IoT applications, the lack of communication security proves to be a challenge. CRNs are prone to more attacks and have much more risks than traditional wireless networks. This paper introduces a security-aware routing protocol that considers jamming attacks which interrupt cognitive radio transmissions. The proposed protocol assigns the most secure channel for each hop within an IoT source-destination pair in accordance to an optimization problem. Moreover, since CRNs are more vulnerable to threats, an Ensemble-based Jamming Behaviour Detection and Identification (E-JBDI) technique is proposed as a second line of defence. It is used to identify the behavior anomaly of jamming attack. Extensive simulations are conducted to showcase the effectiveness of the proposed routing protocol in comparison to other relatively similar state-of-the-art solutions. Results show network performance improvements against increased numbers of proactive jamming attacks. Moreover, results also show the effectiveness of E-JBDI in terms of accuracy, detection and precision-recall rates with values of  ≈ 1.
  • Join Trajectory Optimization and Communication Design for UAV-Enabled OFDM
    • Abstract: Publication date: Available online 6 November 2019Source: Ad Hoc NetworksAuthor(s): Zhenyu Na, Jun Wang, Chungang Liu, Mingxiang Guan, Zihe GaoAbstractDue to the advantages of high mobility, flexible maneuverability and fast deployment, Unmanned Aerial Vehicle (UAV), which can be usually served as aerial communication platform, not only supports information transmission in the Internet of things (IoT), but also provides reliable power supplement for low-power wireless devices. Considering an UAV-enabled Orthogonal Frequency Division Multiplexing (OFDM) network where subcarriers are divided into two groups for information transmission and energy harvesting, respectively, a joint UAV trajectory optimization and communication design scheme is proposed based on Simultaneous Wireless Information and Power Transfer (SWIPT) technology. Under the given average harvested energy for users, the objective of the scheme is to maximize the average achievable rate for all users by jointly optimizing UAV trajectory, user scheduling, subcarrier and power allocation. To solve the formulated optimization problem, it is transformed into two subproblems to optimize resource allocation and UAV trajectory, respectively. The former is a mixed integer non-convex optimization problem. To solve it, a three-variable alternative iteration algorithm is proposed to obtain the optimal user scheduling, subcarrier and power allocation. Since the latter is non-convex, it can be transformed into convex optimization problem by relaxing objective function and constraint to obtain the optimal trajectory. Simulation results demonstrate that the proposed algorithm has good convergence and the proposed UAV-enabled OFDM network has better performance.
  • Maximizing Network Lifetime Using Coverage Sets Scheduling in Wireless
           Sensor Networks
    • Abstract: Publication date: Available online 5 November 2019Source: Ad Hoc NetworksAuthor(s): Chuanwen Luo, Yi Hong, Deying Li, Yongcai Wang, Wenping Chen, Qian HuAbstractIn a Wireless Sensor Network (WSN), when a large amount of sensors are randomly deployed into a detection area, an efficient sleep/active scheduling for sensors to maximize the network lifetime of target (or detection area) coverage, which is called the coverage problem, is an important issue. The problem was proved NP-complete [1]. Recently, many methods were proposed for solving the coverage problem [2, 3], each of which can be divided into two phases: the first is to find as many as possible coverage sets from the sensors and the other is to schedule the coverage sets got from the first phase. Therefore, all coverage problems involve the scheduling process of the coverage sets to maximize the network lifetime. In this paper, we investigate the Maximum Coverage Sets Scheduling (MCSS) problem: given a coverage set collection in which each coverage set covers all targets (or the whole detection area) in WSN, the problem is to find a feasible scheduling for the coverage set collection to maximize the network lifetime. Firstly, we prove the MCSS problem is NP-hard. Secondly, we formulate the problem as an integer linear programming problem. Thirdly, we first propose a greedy algorithm, called Greedy-MCSS, to solve the MCSS problem. Then based on the Greedy-MCSS algorithm, we propose an approximation algorithm, MCSS Algorithm (MCSSA) for solving the MCSS problem, which gives the theoretical performance guarantee. Finally, extensive simulation results are shown to further verify the performance of our algorithms.
  • Exploiting Performance of Two-way Non-Orthogonal Multiple Access Networks:
           Joint Impact of Co-Channel Interference, Full-Duplex/Half-Duplex mode and
           SIC Receiver
    • Abstract: Publication date: Available online 2 November 2019Source: Ad Hoc NetworksAuthor(s): Tu-Trinh Thi Nguyen, Dinh-Thuan DoAbstractTo achieve low latency and improved spectral efficiency, as well as satisfy massive connections, the application of non-orthogonal multiple access (NOMA) is a promising candidate in the physical layer to consider in uplink and downlink in wireless network. In this paper, two user pairs are studied to exhibit performance gap since different power allocation factors provided. In particular, the Rayleigh fading channel models consisting of independent and non-identical (i.n.i.d.) and independent identically distributed (i.i.d.) are two considered cases to evaluate the outage probability of the proposed NOMA. Especially, practical environment is highlighted in scenario in which existence of co-channel interference (CCI) at both relay and destinations make their impacts on decreasing performance. In addition, successive interference cancellation (SIC) in two possible situations including perfect and imperfect SIC (pSIC, ipSIC) are further examined on system performance of such NOMA. To further provide clear performance evaluation, a closed-form expressions for the outage probability are derived and throughput performance is provided as well. This study also performs Monte Carlo simulations to validate the accuracy of the theoretical analysis. Furthermore, both the obtained analytical and simulation results demonstrate that the proposed NOMA scheme can offer performance gap between full-duplex (FD) mode and half-duplex (HD) mode implemented at the relay, and between pSIC and ipSIC as well.
  • Directional Modulation Design Under Maximum and Minimum Magnitude
           Constraints for Weight Coefficients
    • Abstract: Publication date: Available online 2 November 2019Source: Ad Hoc NetworksAuthor(s): Bo Zhang, Wei Liu, Yang Li, Xiaonan Zhao, Cheng WangAbstractDirectional modulation (DM) as a physical layer security technique has been studied widely to meet different design requirements, such as minimum spacing between adjacent antennas, and robust against steering vector errors. However, weight magnitude constraints in DM area have not been studied thoroughly. In this paper, the possibility of imposing various weight magnitude constraints is explored and simultaneous maximum and minimum magnitude constraints for weight coefficients are proposed in DM design for the first time. The proposed maximum magnitude constraint can avoid the use of multiple-stage power amplifiers, and the minimum magnitude constraint can make sure a minimum power requirement for each antenna is achieved so that a reasonable minimum transmission range of the system can be maintained by effectively using all employed antennas. Since the resultant problem is non-convex, a solution to transform it into a convex form is described, allowing the problem to be solved conveniently using existing convex optimisation toolboxes. Design examples are provided to show the effectiveness of the proposed design.
  • Environment-Aware Localization for Wireless Sensor Networks using Magnetic
    • Abstract: Publication date: Available online 31 October 2019Source: Ad Hoc NetworksAuthor(s): Xin Tan, Zhi Sun, Pu Wang, Yanjing SunAbstractThe Magnetic Induction (MI) communication techniques can enable or enhance many wireless applications in the complex environments where line-of-sight (LOS) links do not exist. The critical position information of each wireless device can also be derived by the same MI systems without additional hardware or infrastructure. However, while MI signals can penetrate most of the transmission media without significant attenuation or phase shifting, the obstacles with high conductivity can still influence the signal propagation, which incurs additional positioning errors in the MI-based localization. To address such challenge, this paper develops an environment-aware MI-based localization technique for wireless sensor networks in complex environments with significant amount of high-conductive obstructions. First, the system architecture of the MI-based environment-aware localization and the MI channel is introduced. The environment-aware capability is realized by analyzing the unique MI response information gathered by each MI-based sensor node. Then, a joint device localization and environment sensing algorithm is developed to estimated the position of each device in the network as well as the distribution of the high-conductive objects. Finally, the performance of the proposed solution is validated through both computer simulations and real-world experiments.
  • Peer-to-Peer Energy Sharing in Mobile Networks: Applications, Challenges,
           and Open Problems
    • Abstract: Publication date: Available online 23 October 2019Source: Ad Hoc NetworksAuthor(s): Aashish Dhungana, Eyuphan BulutAbstractEnergy is a scarce resource in mobile wireless networks that consist of devices mainly powered by their batteries. Providing energy ubiquitously to these devices for making them functional for a long time is a challenging task. With the advent of energy sharing techniques, either by wired or wireless mediums, it is possible to extend the lifetime of such networks by utilizing the energy from other energy sources (e.g., chargers, other devices) within the network. In this paper, we explore the utilization of peer-to-peer energy sharing in various applications of mobile networks that consist of agents from low-power devices such as sensors to high-power ones such as electric vehicles. We provide an overview of the current research directions and developments of new protocols and algorithms that exploit the energy sharing techniques to solve the scarce energy problem in mobile networks. For each mobile networking domain, we highlight the specific challenges and describe the approaches followed to address them under various research problems. We also discuss open problems yet to be solved in each specific application.
  • Influence of Node Mobility, Recharge, and Path Loss on the Optimized
           Lifetime of Wireless Rechargeable Sensor Networks
    • Abstract: Publication date: Available online 16 October 2019Source: Ad Hoc NetworksAuthor(s): Dayan Adionel Guimarães, Edielson Prevato Frigieri, Lucas Jun SakaiAbstractRecently, a powerful lifetime improvement algorithm for mobile wireless sensor networks has been reported in the literature. It controls the communication activity between the sensor nodes and the sink node through the solution of a simple convex optimization problem. In this article, a systemic performance assessment of this algorithm is carried out, taking into consideration that: i) the energy storage devices of the sensor nodes are subjected to recharge via radiative wireless power transfer events, ii) the node mobility patterns are governed by the random waypoint, the random Gauss-Markov, and the reference point group models, iii) a two-slope distance-dependent propagation path loss prediction model governs the energy consumption and the amount of recharge delivered to the sensor nodes, and iv) recharge takes place via omnidirectional and directional radiation patterns. Proper modeling and a large number of computer simulation results are presented and discussed. The factorial analysis of variance is applied to analyze the results, measuring individual and interaction effects of the node mobility patterns, the path loss models and the recharge mechanisms on the optimized network lifetime. Among the reported findings, some are worth highlighting: i) different mobility patterns may result in considerably dissimilar performances of the adopted lifetime optimization strategy; ii) the adoption of the two-slope propagation loss model unveiled the need for developing efficient recharge mechanisms to cope with the potentially inefficient recharges that might happen when the target nodes are far away from the charger; iii) a poorly designed recharge mechanism might not bring sufficient lifetime improvement or sustained network operation.
  • Multihop Full Duplex Relaying with Coherent Signaling: Outage Probability
           Analysis and Power Optimization
    • Abstract: Publication date: Available online 16 October 2019Source: Ad Hoc NetworksAuthor(s): Rambabu Katla, A.V. BabuAbstractThis paper considers coherent relaying with interference subtraction (CRIS) for exploiting the direct links in multi-hop decode-and-forward full duplex relay (MHDF-FDR) networks. Initially, we derive new approximate closed form expression for the end-to-end outage probability of MHDF-FDR networks that use CRIS (i.e., MHDF-CRIS-FDR networks), taking into account the residual self-interference (RSI) generated by full duplex operation at the relay nodes and by considering the links in the network to suffer from independent, non-identical Nakagami fading. We provide an upper bound for the outage probability as well and further present an asymptotic expression by considering Rayleigh fading channels. Secondly, optimal power allocation (OPA) is considered for MHDF-CRIS-FDR networks that either maximizes the end-to-end instantaneous rate or minimizes the end-to-end outage probability, with constraints on the maximum power for the transmitting nodes. We observe that both these problems are non-convex. Sequential convex programming (SCP) based iterative algorithms are then proposed to determine the OPA vectors corresponding to the above optimization problems. The convergence of the algorithms are also established. The benefits of OPA are reported in terms of improvements in outage and rate performance of the network. We also make extensive comparison of the outage performance of MHDF-CRIS-FDR scheme against two conventional FDR schemes. The analytical results are corroborated by conducting Monte-Carlo simulations.
  • LD2FA-PSO: ANOVEL LEARNING Dynamic Deterministic Finite AutomatA with PSO
    • Abstract: Publication date: Available online 16 October 2019Source: Ad Hoc NetworksAuthor(s): S. Prithi, S. SumathiAbstractWireless sensor networks (WSNs) are networks of autonomous nodes used for monitoring an environment. Energy efficiency and secured data transmission areconsidered as the most important design goals for WSN. As the complexity of computer networks increased, the erudition of network-based attacks drew the attention of various researchers from several sectors. As a result of this, many Intrusion Detection System (IDS) have been deployed in such a way that it resolves various aspects of network security such as DoS, worms, viruses, malware, etc. Automation of IDS has been proposed in order to improve the energy efficient routing in Wireless Sensor Network in a secured manner. The proposed work incorporates the Deterministic Finite Automata (DFA) and Particle Swarm Optimization (PSO) for intrusion detection and the data transmission is done in a secured manner by determining and following the optimized route. A novel LD2FA (Learning Dynamic Deterministic Finite Automata) has been proposed so that the dynamic nature of the network is cultured. In turn, LD2FA - PSO provides the information about the node, packet and route inspection for detection and elimination of intruders so that the data transmission is done in an energy efficient manner through the optimal path. Routing through optimal path improves the overall performance of the sensor network and it has been examined through various metrics such as energy consumption, throughput, network lifetime, alive and dead nodes. The performance is evaluated by simulating in MATLAB with sensor nodes ranging from 100-700 in a region of 500 × 500 m^2 and comparing the obtained experimental results with the existing PSO, Greedy Load Balanced Clustering Algorithm (GLBCA), Genetic Algorithm (GA) based clustering, Least Distance Clustering (LDC), cluster-based IDS, light weight IDS. It is observed that, LD2FA-PSO obtained 16% increase in throughput than cluster-based IDS, almost 70% increase in throughput than light weight IDS, 6% and 32% improvement in network lifetime than PSO and GLBCA respectively, almost 30% and 54% improvement in network lifetime than GA and LDC respectively. The energy consumed is almost 3% and 6% lesser than PSO and GA, and 13% higher energy is consumed than LDC. The alive sensor node becomes nil at 2600th round which is better than cluster-based IDS and light weight IDS.
  • An Efficient Queries Processing Model Based on Multi Broadcast Searchable
           Keywords Encryption (MBSKE)
    • Abstract: Publication date: Available online 16 October 2019Source: Ad Hoc NetworksAuthor(s): Belal Ali Al-Maytami, Pingzhi Fan, Abir Jaafar Hussain, Thar Baker Shamsa, Panos LiatsisAbstractCloud computing is a technology which has enabled many organizations to outsource their data in an encrypted form to improve processing times. The public Internet was not initially designed to handle massive quantities of data flowing through millions of networks. Thus, the rapid increase in broadcast users and growth in the amount of broadcasted information leads to a decrease in the speed of sending queries and receiving encrypted data from the cloud. In order to address this issue, Next Generation Internet (NGI) is being developed, capable of high speeds, while maintaining data privacy. This research proposes a novel search algorithm, entitled Multi-broadcast Searchable Keywords Encryption, which processes queries through a set of keywords. This set of keywords is sent from the users to the cloud server in an encrypted form, thus hiding all information about the user and the content of the queries from the cloud server. The proposed method uses a caching algorithm and provides an improvement of 40% in terms of runtime and trapdoor. In addition, the method minimizes computational costs, complexity, and maximizes throughput, in the cloud environment, whilst maintaining privacy and confidentiality of both the user and the cloud. The cloud returns encrypted query results to the user, where data is decrypted using the user's private keys.
  • A Hybrid Secure Routing and Monitoring Mechanism in IoT-based Wireless
           Sensor Networks
    • Abstract: Publication date: Available online 15 October 2019Source: Ad Hoc NetworksAuthor(s): Deebak B D, Fadi Al-TurjmanAbstractInternet of Things (IoT) has advanced its pervasiveness across the globe for the development of smart networks. It is aimed to deploy network edge that enables smart services and computation for the IoT devices. In addition, this deployment would not only improve the user experience but also provide service resiliency in case of any catastrophes. In IoT applications, the edge computing exploits distributed architecture and closeness of end-users to provide faster response and better quality of service. However, the security concern is majorly addressed to resist the vulnerability of attacks (VoA). Existing methodologies deal only with static wireless sensor web to deduce the intrusions in which the sensor nodes are deployed in a uniform manner to retain the constancy. Since the sensor nodes are constantly being in question through different transmission regions with several levels of velocities, selection of sensor monitoring nodes or guard nodes has become a challenging job in recent research. In addition, the adversaries are also moving from one location to another to explore its specific chores around the network. Thus, to provide flexible security, we propose a secure routing and monitoring protocol with multi-variant tuples using Two-Fish (TF) symmetric key approach to discover and prevent the adversaries in the global sensor network. The proposed approach is designed on the basis of the Authentication and Encryption Model (ATE). Using Eligibility Weight Function (EWF), the sensor guard nodes are selected and it is hidden with the help of complex symmetric key approach. A secure hybrid routing protocol is chosen to be built by inheriting the properties of both Multipath Optimized Link State Routing (OLSR) and Ad hoc On-Demand Multipath Distance Vector (AOMDV) protocols. The result of the proposed approach is shown that it has a high percentage of monitoring nodes in comparison with the existing routing schemes. Moreover, the proposed routing mechanism is resilient to multiple mobile adversaries; and hence it ensures multipath delivery.
  • Minimum Connected Dominating Sets in Heterogeneous 3D Wireless Ad Hoc
    • Abstract: Publication date: Available online 14 October 2019Source: Ad Hoc NetworksAuthor(s): Xin Bai, Danning Zhao, Sen Bai, Qiang Wang, Weilue Li, Dongmei MuAbstractThe Minimum Connected Dominating Set (MCDS) problem is a fundamental problem in wireless ad hoc networks. The majority of approximation algorithms for this NP-hard problem follow a two-phased approach: The first phase is to construct a Maximal Independent Set (MIS), and the second phase is to connect the nodes in it. The upper bounds of the MISs play a key role in the design of constant approximation MCDS algorithms. This paper considers this problem for 3D heterogeneous ad hoc networks, where the transmission ranges of nodes are allowed to be different. We prove upper bounds of MISs with two classical mathematical problems, the Spherical Code Problem and the Sphere Packing Problem. When the transmission range ratio (the ratio of the maximum transmission range over the minimum transmission range) is (1, 1.023], (1.023, 1.055], (1.055, 1.082], ..., we reduce the MIS upper bounds from the best-known results 22 OPT +1, 23 OPT +1, 24 OPT +1,..., to 12 OPT +1, 13 OPT +1, 14 OPT +1,..., where OPT is an optimal CDS and OPT is the size of OPT. With the bounds of MISs, the approximation ratio of MCDS algorithms can be reduced from 25.02 to 16.02 in heterogeneous 3D wireless ad hoc networks.
  • QoS-Aware Traffic Scheduling Framework in Cognitive Radio based Smart
           Grids using Multi-objective Optimization of Latency and Throughput
    • Abstract: Publication date: Available online 14 October 2019Source: Ad Hoc NetworksAuthor(s): Muhammad Waqas Khan, Muhammad Zeeshan, Asma Farid, Muhammad UsmanAbstractTo meet the diverse QoS requirements of future Smart Grid (SG) communication network, efficient traffic scheduling and optimization techniques to prioritize data from various SG applications are required. Recently, focus has only been on the latency and criticality based priority-aware policies for same channel bandwidth. Traffic scheduling and subsequent channel allocation are required to support both the differential throughput and latency requirements simultaneously for channels having different bandwidths and SNRs. In this paper, a QoS-aware framework for data traffic scheduling in cognitive radio based SG communication network is proposed. The channels available to smart grid Communication Nodes (SCNs) are categorized as low and high bandwidths. For each bandwidth, all SG applications are categorized into several priority-classes comprised of latency and throughput sub-classes. For both channel bandwidths, the scheduler maintains and updates two sets of priority queues based on weights associated with each class and its data type. The complete scheduling framework is formulated as a multi-objective optimization problem. The overall objective function is the weighted sum of individual utility functions of latency and throughput. A novel usage of Adam optimizer is proposed to minimize the latency and maximize the throughput by obtaining optimal system cost, resulting in optimal decision policy. Simulation results show that the proposed algorithm achieves desired QoS requirements in the presence of heavy PU traffic, whereas in case of no priority assignment, QoS requirements of lower priority applications are met by compromising the QoS of higher priority data.
  • On The Distribution of Nodal Distances in Random Wireless Ad Hoc Network
           with Mobile Node
    • Abstract: Publication date: Available online 14 October 2019Source: Ad Hoc NetworksAuthor(s): Xuefeng Zhong, Fangjiong Chen, Quansheng Guan, Ji Fei, Hua YuAbstractThe distribution of nodal distance is of vital importance in connectivity analysis of wireless ad hoc networks. Existing research on distance distribution focuses on static network deployment. In this paper we consider the distribution of nodal distance between uniformly deployed static nodes and multiple mobile nodes. The Random-Way-Point (RWP) mobility model is applied for mobile nodes. We derive the analytic expressions of the cumulative distribution function and probability density function of the nodal distance in square and circular areas. The validity of our theoretical results is verified through computer simulations, which show that the analytical results are consistent with the simulated results.
  • Cross-Domain Person Re-Identification using Dual Generation Learning in
           Camera Sensor Networks
    • Abstract: Publication date: Available online 11 October 2019Source: Ad Hoc NetworksAuthor(s): Zhong Zhang, Yanan Wang, Shuang LiuAbstractCross-domain person re-identification (Re-ID) in camera sensor networks is a challenge task due to large domain-style and camera-style variances. In this work, we propose a novel deep learning method called Dual Generation Learning (DGL) for cross-domain person Re-ID, which simultaneously considers domain and camera styles by expanding training samples. Correspondingly, we design a three-branch deep model with different losses. We further propose Hybrid Triplet Loss (HTL) to deal with the combination of the source dataset, the target dataset and their expansions. Thus, the learned features are robust to domain shifts and camera differences. The experimental results prove that DGL achieves the promising generalization ability and accuracy compared with the state-of-the-art methods.
  • Person Re-identification using Hybrid Task Convolutional Neural Network in
           Camera Sensor Networks
    • Abstract: Publication date: Available online 10 October 2019Source: Ad Hoc NetworksAuthor(s): Shuang Liu, Wenmin Huang, Zhong ZhangAbstractThis paper proposes a new framework called Hybrid Task Convolutional Neural Network (HTCNN) which combines the advantages of ranking and classification tasks for person re-identification (re-ID) in camera sensor networks. As for the ranking task, we propose Weighted Triplet Loss (WTL) to optimize global features of pedestrians, and meanwhile WTL emphasizes the foreground of pedestrian image and weakens the background in order to enhance the feature discrimination. As for the classification task, we evenly divide the convolutional activation map into several horizontal parts and utilize average pooling to obtain local features of pedestrians. We evaluate our method on public person re-ID datasets, and the results indicate HTCNN exceeds the state-of-the-art re-ID methods.
  • An Efficient Energy-Aware Routing Scheme for Cloud-Assisted MANETs in 5G
    • Abstract: Publication date: Available online 7 October 2019Source: Ad Hoc NetworksAuthor(s): H. Riasudheen, K. Selvamani, Saswati Mukherjee, I.R. DivyasreeAbstractEnergy-Saving techniques for mobile communication systems has recently received a great deal of attention in Fifth Generation (5G) networks. The Device-to-Device (D2D) communication in 5G networks has increased number of users and the data transmission rate among the mobile nodes in Cloud Assisted-Mobile Ad Hoc Networks (CA-MANETs). However, the connection between these mobile nodes and peer nodes has to frequently renew due to mobility, link failure, routing overhead and low battery power. During this period, it consumes high energy in searching and linking the mobile nodes. Hence, this research work attempts to reduce the energy consumption by proposing an Energy-Efficient Cloud-Assisted Routing Mechanism (EECRM) for CA-MANETs. Energy consumption is minimized by performing fast local route recovery among mobile nodes and peer nodes. If the link failure occurs, the backup nodes are identified by neighbour nodes and these backup nodes form an overlay that provides the coverage and this overlay network consumes less energy in routing. The results obtained from this proposed routing algorithm provides better performance in terms of less energy consumption, residual energy and network lifetime when compared with other existing network models and routing protocols.
  • An accurate UWB based localization system using modified leading edge
           detection algorithm
    • Abstract: Publication date: Available online 7 October 2019Source: Ad Hoc NetworksAuthor(s): Sreenivasulu Pala, Sarada Jayan, Dhanesh G. KurupAbstractUltra-wideband (UWB) localization systems have gained wide attention in precise indoor positioning applications, due to the usage of high bandwidth signals. We propose a modified leading edge detection algorithm for estimating the time of arrival (TOA) of the received UWB signal. The proposed method performs well even under low signal-to-noise ratio (SNR) conditions. We simulate a UWB localization system using the proposed algorithm and evaluate its performance under additive white Gaussian noise (AWGN). We study the influence of tuning parameters of the proposed algorithm on the positioning accuracy. We evaluate 1D and 2D positioning accuracies of the localization system using the optimal tuning parameters of the proposed algorithm. We further evaluate the performance of the proposed algorithm in multipath conditions. Simulation results show that the proposed algorithm provides enhanced positioning accuracy compared to the previously published methods including the state-of-the-art methods. We improve the positioning accuracy of the localization system further by deploying more base stations.
  • Uplink/Downlink Decoupled Energy Efficient User Association in
           Heterogeneous Cloud Radio Access Networks
    • Abstract: Publication date: Available online 3 October 2019Source: Ad Hoc NetworksAuthor(s): Merve Saimler, Sinem Coleri ErgenAbstractHeterogeneous Cloud Radio Access Networks (H−CRAN) is a network architecture that combines Macro Base Stations (MBS)s and Small Base Stations (SBS)s with cloud infrastructures. The dense deployment of SBSs in H-CRAN is needed to provide high data rates to User Equipments (UEs) but causes high energy consumption. Unrealistic power models lead to inefficient UE association schemes in terms of energy. In this paper, we study the joint optimization of Uplink (UL) and Downlink (DL) decoupled UE association and switching on/off the SBSs in H-CRAN by incorporating a realistic power model with the objective of minimizing the power consumption in H-CRAN. The power model encompasses static and the dynamic power consumption of MBS, the static power consumption of SBS, the power consumption of transmission links to cloud infrastructure and the power consumption of UEs. The problem is transformed into Single Source Capacitated Facility Location Problem (SSCFLP) which is NP-Hard. We then propose a heuristic algorithm based on the use of LP relaxation and solving many-to-one assignment problem with generalized assignment problem heuristics. Extensive simulations demonstrate that the proposed heuristic algorithm performs very close to optimal and achieves significant improvements in minimizing total power consumption compared to coupled UE association algorithm and algorithms utilizing the power consumption models that do not encompass MBS dynamic power consumption and the power consumption of transmission links to cloud infrastructure for various scenarios.
  • Beyond Beaconing: Emerging Applications and Challenges of BLE
    • Abstract: Publication date: Available online 25 September 2019Source: Ad Hoc NetworksAuthor(s): Jian Yang, Christian Poellabauer, Pramita Mitra, Cynthia NeubeckerAbstractAs an emerging technology with exceptional low energy consumption and low-latency data transmissions, Bluetooth Low Energy (BLE) has gained significant momentum in various application domains, such as Indoor Positioning, Home Automation, and Wireless Personal Area Network (WPAN) communications. With various novel protocol stack features, BLE is finding use on resource-constrained sensor nodes as well as more powerful gateway devices. Particularly proximity detection using BLE beacons has been a popular usage scenario ever since the release of Bluetooth 4.0, primarily due to the beacons’ energy efficiency and ease of deployment. However, with the rapid rise of the Internet of Things (IoT), BLE is likely to be a significant component in many other applications with widely varying performance and Quality-of-Service (QoS) requirements and there is a need for a consolidated view of the role that BLE will play in applications beyond beaconing. This paper comprehensively surveys state-of-the-art applications built with BLE, obstacles to adoption of BLE in new application areas, and current solutions from academia and industry that further expand the capabilities of BLE.
  • Techno-Economic Framework for Dynamic Operator Selection in a Multi-Tier
           Heterogeneous Network
    • Abstract: Publication date: Available online 18 September 2019Source: Ad Hoc NetworksAuthor(s): Gabriel Bugár, Marcel Vološin, Taras Maksymyuk, Jana Zausinová, Vladimír Gazda, Denis Horváth, Juraj GazdaAbstractTremendous growth of the mobile network market driven by technology evolution requires a corresponding paradigm shift of the economic aspects of mobile networks. The high heterogeneity and flexibility of 5G mobile networks have led operators to shift their business models towards an open spectrum market. In this paper, we first introduce a comprehensive techno-economic framework to investigate a heterogeneous network (HetNet) that consists of two operators: a macro cell operator and a small cell operator, operating in conditions of an open spectrum market. Both operators coexist in such a way that the small cell operator leases the spectrum from the macro cell operator. In contrast to other similar studies, in our framework, we apply the concept of evolutionary stable equilibrium (ESE), which provides some level of intuition to the behaviour of the operators. In addition, we implement the method of dynamic service selection by the end users based on a utility function, which is sensitive to both the service price and the expected throughput. To analyse the techno-economic performance of the system, we develop a real-world simulation model that encompasses a 3D urban environment using real network topology from the OpenCellID database; this model includes a large number of end users with realistic mobility patterns. The simulation results show that, from the user’s perspective, the network switching mode provides better service at a lower price due to high market competition. From the view of the operator, the most profitable mode is the static contract because there is stable service demand regardless of the price. The multi-homing mode is a promising intermediate solution that can satisfy both the end users and the operators.
  • Broadcast Strategies and Performance Evaluation of IEEE 802.15.4 in
           Wireless Body Area Networks WBAN
    • Abstract: Publication date: Available online 16 September 2019Source: Ad Hoc NetworksAuthor(s): Wafa Badreddine, Claude Chaudet, Federico Petruzzi, Maria Potop-ButucaruAbstractWireless Body Area Networks (WBANs) can be considered as an evolution of wireless sensor networks towards wearable and implanted technologies. Radio propagation and mobility are particular in this context, as they are influenced by the characteristics and movement of the human body and by the necessity to keep the transmission power at its minimum to save energy and limit interactions with the wearer.In this paper, we investigate the broadcasting problem in which a node, typically the gateway, tries to send a packet to all other nodes in the network at minimal cost. This problem is not as trivial as it looks and we show through simulation that forwarding strategies coming from the Delay Tolerant Networks world cannot be transposed without adaptation. We enriched the Omnet++ simulator with a WBAN-specific channel model from the literature, and use this model to evaluate 9 classes of broadcasting algorithms, including our own proposals, with respect to their ability to cover the whole network, their completion delay, their cost in terms of transmissions volume and their capability to preserve multiple packets order (i.e. total order broadcast).Our study shows that there is a subtle compromise to find between verbose strategies that achieve good performance at the cost of numerous transmissions, ultimately provoking collisions and more cautious solutions that miss transmission opportunities because of mobility.
  • Fractional chaos based-cryptosystem for generating encryption keys in Ad
           Hoc networks
    • Abstract: Publication date: Available online 10 September 2019Source: Ad Hoc NetworksAuthor(s): Rolando Montero-Canela, Ernesto Zambrano-Serrano, Edna I. Tamariz-Flores, Jesus M. Muñoz-Pacheco, Richard Torrealba-MeléndezAbstractAd Hoc networks are considered essential elements of the Internet of Things (IoT), which is a technological trend for innovative future applications. Since in IoT systems the devices are mostly connected among them, the data exchange is a vital activity in the network. In this kind of networks, not only non-sensitive data exchange is performed, but also sensitive data (digital signatures, login credentials, account numbers, personal images, and so on) are shared. Therefore, new appropriate approaches to encrypt the secret information are highly required. This paper presents an experimental setup of a fractional-chaos based-cryptosystem for ad hoc networks under the IEEE 802.15.4 standard. The proposed cryptosystem is composed of a novel chaotic pairing approach between the coordinator node and end-devices nodes to sending data into the network. More specifically, the RF-data of the IEEE 802.15.4 frame is encrypted using a fractional-order encryption key and four iterative steps. It is worth to note that the chaotic key is based on a fractional-order chaotic system, which is derived from the fractional calculus theory. Fractional-order chaotic dynamics are demonstrated using the Lyapunov method and equilibria stability. Next, the experimental validation of the cryptosystem is shown sending an encrypted image between ARM digital platforms and wireless Xbee modules. Several security analyses indicate the proposed encryption scheme has suitable statistical properties, sizeable keyspace, and high sensitivity providing secure communications.
  • Authentication Protocol in CTNs for a CWD-WPT Charging System in a Cloud
    • Abstract: Publication date: Available online 5 September 2019Source: Ad Hoc NetworksAuthor(s): Luis F.A. Roman, Paulo R.L. GondimAbstractThe Internet of Things (IoT) has developed very rapidly in recent years, becoming increasingly complex. The communication things networks (CTNs) is a very important element in IoT for the interconnection of several objects (between objects or objects with the internet). In the context of electric vehicles, the development of CTNs represents a pillar for the implementation of new services such as charge while driving (CWD) based on wireless power transfer (WPT) technology. Cloud-based vehicular ad-hoc networks (VANETs) are one of the networks that can support the high mobility, low latency and connectivity required for a CWD-WPT system. The CWD-WPT charging system provides comfort and time optimization for users if the privacy, integrity and availability of the system are guaranteed. This paper proposes an authentication protocol that uses different cryptographic schemes for key management and distribution in a CWD-WPT cloud charging system that guarantees message privacy and integrity, mutual authentication of system elements and anonymity of EVs.
  • Matrix-Based Key Management Scheme for IoT networks
    • Abstract: Publication date: Available online 4 September 2019Source: Ad Hoc NetworksAuthor(s): Mohammed Nafi, Samia Bouzefrane, Mawloud OmarAbstractThe key management is the central element of network security. In fact, key distribution is necessary for securing applications in the context of Internet of Things (IoT). However, existing key management protocols are not directly applicable on IoT due, among other things, to severe and high resource constraints of some devices that make up the IoT network. Therefore, it is necessary that the proposed key management protocols takes in charge these features and constraints. Most existing solutions didn’t focus on optimizing, at the same time, all performance criteria, like communication, computation and storage. Some of them put special emphasis on minimizing one criteria but ignore the others. In this paper, we propose a new lightweight matrix based key management protocol for Iot network, which is not only flexible, scalable and resilient to many types of attacks, but also can reduce the communication, computation and storage overheads at constrained nodes side. The security properties like authentication, integrity and secrecy have been checked by using the formal verification tool AVISPA. Moreover, security and performance analysis show that our scheme protects user’s sensitive data from several types of attacks by achieving secure end-to-end communications, and optimizes the energy consumption, which is suitable for resource-limited networks.
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
Home (Search)
Subjects A-Z
Publishers A-Z
Your IP address:
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-