[go: up one dir, main page]

Ghanbari et al., 2025 - Google Patents

An efficient routing protocol based on a fast-lookup cuckoo filter for Internet of things networks

Ghanbari et al., 2025

Document ID
3967098859986277221
Author
Ghanbari P
Soleimani S
Ghaffarian H
Publication year
Publication venue
International Journal of Data Science and Analytics

External Links

Snippet

In view of some features of great importance, eg, the irregular topologies, multiple nodes, and variable structures of the Internet of things (IoT) networks, choosing the best routing protocols (RPs) directly impacts their efficiency. Wireless sensor networks (WSNs) hold …
Continue reading at link.springer.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30861—Retrieval from the Internet, e.g. browsers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • H04L67/104—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network for peer-to-peer [P2P] networking; Functionalities or architectural details of P2P networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/28—Network-specific arrangements or communication protocols supporting networked applications for the provision of proxy services, e.g. intermediate processing or storage in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organizing networks, e.g. ad-hoc networks or sensor networks

Similar Documents

Publication Publication Date Title
Alam A reliable communication framework and its use in internet of things (IoT)
Jazebi et al. RISA: routing scheme for Internet of Things using shuffled frog leaping optimization algorithm
Ramalingam et al. Performance enhancement of efficient clustering and routing protocol for wireless sensor networks using improved elephant herd optimization algorithm
Al-Karaki et al. Data aggregation and routing in wireless sensor networks: Optimal and heuristic algorithms
CN103399902B (en) Digraph accessibility chained list under a kind of parallel environment generates and querying method
US20100215051A1 (en) Network routing with path identifiers
Orojloo et al. A Tabu search based routing algorithm for wireless sensor networks
Harb et al. An energy-efficient data prediction and processing approach for the internet of things and sensing based applications
Deng et al. Hybrid data transmission scheme based on source node centrality and community reconstruction in opportunistic social networks
Sun [Retracted] Research on the Construction of Smart Tourism System Based on Wireless Sensor Network
Lin et al. Trustworthiness-hypercube-based reliable communication in mobile social networks
Sankar et al. Cluster head selection for the internet of things using a sandpiper optimization algorithm (SOA)
Lei et al. Deep Learning Based Proactive Caching for Effective WSN‐Enabled Vision Applications
Mohammadi et al. F-EVM: improving routing in Internet of Things using fuzzy MAIRCA approach and fuzzy eigenvector method
Luo et al. A relationship matrix resolving model for identifying vital nodes based on community in opportunistic social networks
Rahmani et al. A routing approach based on combination of gray wolf clustering and fuzzy clustering and using multi-criteria decision making approaches for WSN-IoT
Cai et al. Efficient content transmission algorithm based on multi-community and edge-caching in ICN-SIoT
Hemmati et al. ClusFC‐IoT: A clustering‐based approach for data reduction in fog‐cloud‐enabled IoT
Ashraf et al. Dynamic cooperative cache management scheme based on social and popular data in vehicular named data network
Saravanan et al. An effective model for QoS assessment in data caching in MANET environments
Ghanbari et al. An efficient routing protocol based on a fast-lookup cuckoo filter for Internet of things networks
Zheng et al. Cooperative‐routing mechanism based on node classification and task allocation for opportunistic social networks
Toce et al. An efficient hypercube labeling schema for dynamic Peer-to-Peer networks
Yousefi et al. Artificial bee colony-based routing for mobile agents on the internet of things
Moradi et al. MSN‐CDF: New community detection framework to improve routing in mobile social networks