• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    Journal of Internet Services and Applications

    Journal of Internet Services and Applications

    JournalISSN 1867-4828eISSN 1869-0238中科院 计算机科学 4区

    年发文量

    研究主题

    论文(369)

    排序
    1EDRaft: an Energy-Driven Consensus Protocol for Energy-Harvesting IoT Networks
    Glauber Barros, Gibeon Aquino

    In resource-constrained IoT networks, limited battery capacity and intermittent energy sources necessitate consensus protocols capable of efficiently adapting to energy scarcity. However, standard consensus algorithms such as Raft are energy-agnostic, operating under the implicit assumption that all nodes have stable power supplies, risking the election of Leaders with critical energy levels and triggering frequent re-election cycles that accelerate network-wide depletion. To address this, we propose EDRaft, a phase-based, energy-driven evolution of Raft in which nodes continuously adjust their behavior, and the cluster's required majority, in response to real-time energy availability. We evaluate EDRaft against three baseline protocols, Raft, E-Raft, and Nakagawa's protocol, using a discrete-event simulator, across nine scenarios varying cluster size and client workload, under both non-harvesting and harvested energy conditions. EDRaft's Leader consistently outlasts its counterpart under the baseline protocols, by 9.8 to 40.8% under active workload and up to 78.7% when idle, translating into 44 to 115% higher request throughput at the network level.

    2026
    引用
    AI阅读
    加入学术空间
    2Analytical Evaluation of VANETs Routing Strategies
    José Miqueias Araújo, Lucas Silva Lopes, Luiz Nelson Lima, Vandirleya Barbosa, Arthur Sabino, Ericksulino Araújo, Luis Guilherme Silva,Francisco Airton Silva

    Vehicular ad hoc networks (VANETs) have emerged as a critical enabler of intelligent transportation systems, particularly when integrated with 5G infrastructure to achieve high-throughput, low-latency vehicle-to-everything (V2X) communication. Nevertheless, optimizing message routing in such environments remains a significant challenge, as the operational complexity and prohibitive cost of large-scale physical deployments severely limit empirical evaluation of alternative transmission strategies. This paper presents a stochastic Petri nets (SPNs) model for evaluating routing configurations in 5G-enabled vehicular ad hoc networks (5G-VANETs). The proposed model evaluates mean response time, drop probability, utilization, and throughput, enabling the identification of communication bottlenecks without requiring physical deployment. By abstracting the system's stochastic behavior through SPN formalism, the model supports both steady-state analysis and sensitivity evaluation under varying traffic workloads. Results demonstrate that Route 1, with direct RSU connection, achieves the lowest mean response time and highest throughput, while Route 3, which relays messages through a rear vehicle and an auxiliary RSU, yields the lowest drop probability. A sensitivity analysis based on Design of Experiments reveals that cloud capacity and cloud service time are the dominant factors affecting mean response time. The SPN model thus enables system architects to compare routing configurations, identify performance bottlenecks, and size infrastructure components without requiring physical deployment.

    2026
    引用
    AI阅读
    加入学术空间
    3Reducing Replica Coordination in BFT Consensus Through Dependable and Secure In-Network Message Ordering
    Gabriel Faustino Lima Da Rocha,Eduardo Alchieri,Giovanni Venâncio, Vinicius Fulber-Garcia, Elias P. Duarte Jr.

    Programmable networks enable the deployment of in-network ordering services that can improve the performance of consensus protocols. However, existing approaches either tolerate only crash faults or require additional replica coordination to handle Byzantine failures, limiting their performance gains. In this work, we present NsoBFT, a Byzantine fault-tolerant (BFT) consensus protocol that leverages secure in-network ordering through a USIG (Unique Sequential Identifier Generator)-based message ordering service deployed at the network layer. The ordering service is implemented using Network Functions Virtualization (NFV), allowing it to operate as a virtualized network function that provides isolation and flexible integration into modern infrastructures. By combining NFV-based in-network sequencing with a USIG-protected sequencer, NsoBFT eliminates the extra replica confirmation step required by prior BFT in-network protocols, shortening the critical execution path while preserving consensus safety and liveness properties. We implemented NsoBFT and evaluated it against NeoBFT and NOPaxos, two representative in-network consensus protocols. Experimental results show that NsoBFT consistently achieves lower latency and higher throughput than NeoBFT, significantly narrowing the performance gap between crash-tolerant and Byzantine-tolerant in-network consensus.

    2026
    引用
    AI阅读
    加入学术空间
    4Optimizing Preventive Police Patrol Routes in Brazilian Cities Using a GRASP-Based Routing Heuristic
    Isabel Rosseti, Eduardo Canellas, Wagner Santos,Marcos Lage,Yuri Frota,Daniel De Oliveira

    Criminal activity is a major challenge for governments in large urban centers worldwide. Within Smart City initiatives, ensuring urban safety is a key priority. However, developing and applying data-driven approaches to reduce urban crime remains an open, yet important, issue. This paper addresses the Routing of Police Vehicles in Large Urban Centers (RVP-Urb) problem, which aims to maximize crime coverage while considering resource constraints. The proposed solution, called PROTECTOR, is a heuristic based on the Greedy Randomized Adaptive Search Procedure (GRASP), designed to generate preventive patrol routes that enhance police visibility in crime hotspots. Unlike existing methods, PROTECTOR mirrors the structure of Brazilian police departments by dividing urban areas into smaller zones and generating both intra- and inter-zone routes. The heuristic uses real-world crime hotspot data over defined time intervals to create daptive patrol plans that can be updated as hotspot patterns change. Experimental results using the RolRoute-DS ataset demonstrate that PROTECTOR performs effectively, producing near-optimal routes comparable to those enerated by exact mathematical models while maintaining computational efficiency.

    2026
    引用
    AI阅读
    加入学术空间
    5PULSE-FHIR: Platform for Unified Labeled Signals of Electrocardiograms in FHIR
    Adriano Paulichi, Vinícius Coradassi, André L. M. Martins, Daniel F. Pigatto, Fábio Pires Itturriet

    This work presents PULSE-FHIR, an open-source web platform that integrates Fast Healthcare Interoperability Resources (FHIR)-compliant electrocardiogram (ECG) recordings with temporally synchronized visualization of clinical and AI-generated annotations. PULSE-FHIR supports multi-lead display, including 12-lead ECG recordings, flexible temporal navigation, and the overlay of beat-level annotations from reference databases, such as MIT-BIH, or neural network outputs. Additionally, it interfaces with FHIR servers, such as HAPI-FHIR, using SMART on FHIR when authentication and authorization are required. Precise alignment of raw signals and annotation markers enables direct comparison of AI classifications with reference labels, supporting ECG review and validation workflows in Internet of Medical Things (IoMT) ecosystems. The manuscript details the system architecture, FHIR representations for ECG signals and annotations, the implementation of the visualization interface, and experimental validation using MIT-BIH recordings. Results demonstrate effective temporal synchronization and rendering latencies below 200 ms for complete one-minute ECG records. The evaluation also indicates the importance of incremental retrieval strategies for handling long-term ECG recordings. A QR code links to a demonstration video and the project source code on GitHub.

    2026
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 369 篇论文

    高被引作者

    作者引用发文
    Raouf Boutaba73897
    Lu Cheng63132
    Qi Zhang63132
    Jameela Al-Jaroodi16462
    Nader Mohamed16462
    Eiman Al Nuaimi15681
    Eduardo Fernández Medina15181
    Mauricio Caicedo8341
    Noura Limam8341
    Mohammad Ali Salahuddin8341

    高产作者

    作者引用发文
    F. Kon3611
    Gordon Blair5610
    Luís Veiga14410
    Eduardo Cerqueira599
    Denis Do Rosário598
    Wouter Joosen1188
    Raouf Boutaba73897
    Paulo Ferreira1437
    Vinicius Pereira Goncalves76
    Allan Mariano de Souza836

    相关期刊

    International Journal Of Network Management
    Spring Simulation Multiconference
    Advanced Information Networking and Applications
    World Congress on Services
    Cyber Security in Networking
    Future Internet of Things and Cloud
    Conference on Privacy, Security and Trust
    Availability, Reliability and Security
    IEEE/ACM International Conference Utility and Cloud Computing
    Brains, Minds & Media