Accueil › Annuaire des chercheurs › Mourad Amad
Mourad Amad
Affiliation : University of Béjaïa · University of Bouira
- 62Publications (affiliation algérienne)
- 83Publications au total
- 310Citations
- 10Indice h
Profil de recherche
Mourad Amad compte 62 publications référencées (2006–2026). Ses travaux paraissent principalement dans « Research Square », « Journal of High Speed Networks » et « Telecommunication Systems ». Son article le plus cité, « Towards a Smart Interface-Based Automated Learning Environment Through Social Media for Disaster Management and Smart Disaster Education » (2020), a été cité 15 fois. 6 de ces publications datent des trois dernières années d’activité. Ses travaux sont cosignés avec au moins 12 chercheurs, notamment dans des établissements de France, États-Unis.
C’est vous ? Faites connaître vos travaux
Créez gratuitement votre profil DzCademia et ajoutez vos articles : ils apparaîtront plus facilement sur Google et dans les assistants d’IA comme ChatGPT. Plus de personnes pourront vous lire et vous citer.
Créer mon profil gratuit Ajouter mes publicationsDomaines de recherche
- Peer-to-Peer Network Technologies
- Opportunistic and Delay-Tolerant Networks
- Network Traffic and Congestion Control
- Security in Wireless Sensor Networks
- Mobile Ad Hoc Networks
Publications (62)
- A real-time adaptive traffic light control algorithm at urban intersections for smart cities
- An innovative mobility aware distributed service discovery mechanism using aco algorithm (MDSDA) for internet of things environment
- Optimizing waste management with integrated AIoT, edge computing, and LoRaWAN communication technologies
- Decentralized Service Discovery in IoT applications based on Improved Cuckoo Search Algorithm
- Enhanced K-Nearest Neighbors for Smart Cardiovascular Disease Prediction in IoT System
- A Collaborative and Real-Time Model for Trusties Content in Social Media
- Grey Wolf Optimizer-based Decentralized Service Discovery in the Internet of Things Applications
- A Novel Energy-Efficient Hierarchical Routing Protocol (EEHRP) for IoT Networks Using K-Means Machine Learning
- Deep Learning-Based Automated Learning Environment Using Smart Data to Improve Corporate Marketing, Business Strategies, Fraud Detection in Financial Services, and Financial Time Series Forecasting
- Enhancing Warning, Situational Awareness, Assessment and Education in Managing Emergency: Case Study of COVID-19
- User Mobility Dataset for 5G Networks Based on GPS Geolocation
- Handfan: A flexible peer-to-peer service discovery system for internet of things applications
- Cardiovascular Diseases Prediction Based on Dense-DNN and Feature Selection Techniques
- Smart Education with Deep Learning and Social Media for Disaster Management in the pursuit of Environmental Sustainability While avoiding Fake News
- Grey Wolf Optimizer-based decentralized service discovery in Internet of Things applications
- Context-based Detecting Fake News
- Social Context-Based Non-overlapping Communities’ Detection Model in Social Networks
- P2PCF: A collaborative filtering based recommender system for peer to peer social networks
- Enhancing Crisis Management because of Deep Learning, Big Data and Parallel Computing Environment: Survey
- LSTM-BASED AUTOMATED LEARNING WITH SMART DATA TO IMPROVE MARKETING FRAUD DETECTION AND FINANCIAL FORECASTING
- Deep Learning and Social Media for Managing Disaster: Survey
- Hierarchical and scalable peer-to-peer architecture for online social network
- Towards a Smart Interface-Based Automated Learning Environment Through Social Media for Disaster Management and Smart Disaster Education
- CHEARP: Chord-based hierarchical energy-aware routing protocol for wireless sensor networks
- A new model for communities' detection in dynamic social networks inspired from human families
- EEPSCZ: An Energy-Efficient Protocol with Static Clustering Zones
- Improving performance overhead of a trust-clustering key management protocol in ad hoc networks
- Improving performance overhead of a trust-clustering key management protocol in ad hoc networks
- Intelligent and real-time alert model for disaster management based on information retrieval from multiple sources
- Effective peer-to-peer design for supporting range query in Internet of Things applications
- A Survey on Vehicular Ad-Hoc Networks Routing Protocols: Classification and Challenges
- A new overlay P2P network for efficient routing in group communication with regular topologies
- Routing Approach in Wireless Sensor Network
- Application Layer Multicast Based Services on Hierarchical Peer to Peer Architecture
- Energy-Efficient and Degree-Distance Clustering Based Hierarchical Routing Protocol for WSNs
- A New Model for Communities' Detection in Dynamic Social Networks Inspired From Human Families.
- HiCo-MoG: Hierarchical consensus-based group membership service in mobile Ad Hoc networks
- A priority-based queuing system for P2P-SIP call communications control
- A priority-based queuing system for P2P-SIP call communications control
- Communities' Detection in Social Networks: State of the art and perspectives
- Energy Efficient Physical Proximity based Chord Protocol for Data Delivery in WSNs
- Enhanced source location privacy mechanism for WSNs
- Pancake graphs for lookup acceleration and optimization in P2P networks
- A Limited Energy Consumption Model for P2P Wireless Sensor Networks
- A scalable and hierarchical P2P architecture based on Pancake graph for group communication
- Asynchronous model for updating replicated profiles in decentralized social network
- ROUTIL: P2P routing protocol based on interest links
- Novel approach for replacement of a failure node in wireless sensor network
- A self-adaptive ALM architecture for P2P media streaming
- De Bruijn Graph Based Solution for Lookup Acceleration and Optimization in P2P Networks
- Replacement of a failing node by using a two-phase method
- A Priority Based Lookup Model for VoIP Applications in Unstructured P2P Networks
- A Pragmatic and Scalable Solution for Free Riding Problem in Peer to Peer Networks
- HPM: A novel hierarchical Peer-to-Peer model for lookup acceleration with provision of physical proximity
- GPM: A generic and scalable P2P model that optimizes tree depth for multicast communications
- A scalable based multicast model for P2P Conferencing applications
- Asynchronous distributed P2P-SIP model for VoIP
- A Scalable Approach for Application Layer Multicast in P2P Networks
- A scalable P2P model for optimizing application layer multicast
- "DV-Flood": An Optimized Flooding and Clustering Based Approach for Lookup Acceleration in P2P Networks
- SPMCS: A Scalable Architecture for Peer to Peer Multiparty Conferencing
- ”P4L”: A Four Layers P2P Model for Optimizing Resources Discovery and Localization
Revues de publication
- Research Square × 4
- Journal of High Speed Networks × 3
- Telecommunication Systems × 2
- Journal of King Saud University - Computer and Information Sciences × 2
- Lecture notes in networks and systems × 2
- Advances in intelligent systems and computing × 2
Publications par année
- 20262
- 20252
- 20242
- 20232
- 20229
- 20215
- 20206
- 201911
- 20184
- 20173
Collaborations
Établissements partenaires : University of Boumerdes · University Ferhat Abbas of Setif · Centre de Recherche sur l'Information Scientifique et Technique · University of Algiers Benyoucef Benkhedda · University of Maryland, Baltimore County
Pays des co-auteurs : France · États-Unis
Co-auteurs
- Abdelmalek Boudries
- Djamil Aı̈ssani
- Zair Bouzidi
- Rabah Imache
- Lyes Badis
- Rachid Djerbi
- Abdellah Boukerram
- Mustapha Sadi
- Nadjib Badache
- Lamia Cheklat
- Razika Bouiche
- Nourredine Oukas
Données bibliographiques issues d’OpenAlex (base ouverte).
Pourquoi choisir DzCademia ?
Pour donner à vos travaux plus de chances d’être découverts et recommandés par les IA. Profils, articles et communications : donnez à votre recherche une présence publique structurée. Les métadonnées intégrées aident les moteurs de recherche et les assistants IA à identifier vos travaux et à comprendre leurs références.
Commenter avec Google
Connecte-toi avec Google pour commenter directement sur cette page.