发布求助
文献互助 智能选刊 最新文献

IEEE Networking Letters最新文献

筛选
英文 中文
A Network Model to Study the Underlying Characteristics of Phishing Sites 研究钓鱼网站基本特征的网络模型
IEEE Networking Letters Pub Date : 2023-12-28 DOI: 10.1109/LNET.2023.3347724
Avijit Gayen;Sukriti Santra;Ayush Dey;Angshuman Jana
{"title":"A Network Model to Study the Underlying Characteristics of Phishing Sites","authors":"Avijit Gayen;Sukriti Santra;Ayush Dey;Angshuman Jana","doi":"10.1109/LNET.2023.3347724","DOIUrl":"https://doi.org/10.1109/LNET.2023.3347724","url":null,"abstract":"In the rapidly evolving landscape of cyber threats, phishing continues to be a prominent vector for cyberattacks, posing significant risks to individuals, organizations and information systems. This letter delves into a comprehensive analysis of phishing sites, focusing on their distinctive characteristics through the lens of network perspectives. In this letter, we study the underlying characteristics of phishing sites from the hyperlinked connectivity perspectives. In this letter, we have used a phishing site dataset available at Mendeley data. As the dataset does not contain any hyperlinked information, We further collect the hyperlinks in each site and store that information in a JSON file. We further analyze the hyperlinks and the various features of those sites. The initial study reveals that though the Phishing sites mimic the original legitimate sites to trap people in their sites, it has distinct differences from the perspective of structural connectivity as well as the content of sites.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 1","pages":"46-49"},"PeriodicalIF":0.0,"publicationDate":"2023-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140042931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
User Scheduling in Wireless Networks for Deterministic Service: An Efficient Genetic Algorithm Method 无线网络中确定性服务的用户调度：一种高效的遗传算法方法
IEEE Networking Letters Pub Date : 2023-12-13 DOI: 10.1109/LNET.2023.3342424
You Zhao;Yuchao Zhu;Shaowei Wang
{"title":"User Scheduling in Wireless Networks for Deterministic Service: An Efficient Genetic Algorithm Method","authors":"You Zhao;Yuchao Zhu;Shaowei Wang","doi":"10.1109/LNET.2023.3342424","DOIUrl":"https://doi.org/10.1109/LNET.2023.3342424","url":null,"abstract":"To meet the stringent latency and reliability requirements of deterministic service in 5G and beyond networks, we investigate the user selection scheme jointly considering multiple transmission time intervals in a radio access network system with multiple access technology. The objective is to maximize the number of users that satisfy both data volume and latency requirements. Due to the NP-hardness of the formulated optimization task, we propose an efficient genetic algorithm to find promising user subsets at low complexity. Numerical results demonstrate that our proposal outperforms the compared greedy algorithm and round-robin algorithm, which can provide a guideline for the design of systems with deterministic requirements in practice.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2023-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140042929","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
IEEE Networking Letters Author Guidelines IEEE Networking Letters 作者指南
IEEE Networking Letters Pub Date : 2023-12-01 DOI: 10.1109/LNET.2023.3333134
{"title":"IEEE Networking Letters Author Guidelines","authors":"","doi":"10.1109/LNET.2023.3333134","DOIUrl":"https://doi.org/10.1109/LNET.2023.3333134","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 4","pages":"309-310"},"PeriodicalIF":0.0,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10385206","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
2023 Index IEEE Networking Letters Vol. 5 2023 Index IEEE Networking Letters Vol.
IEEE Networking Letters Pub Date : 2023-12-01 DOI: 10.1109/LNET.2024.3358115
{"title":"2023 Index IEEE Networking Letters Vol. 5","authors":"","doi":"10.1109/LNET.2024.3358115","DOIUrl":"https://doi.org/10.1109/LNET.2024.3358115","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 4","pages":"311-323"},"PeriodicalIF":0.0,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10414365","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139572837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
IEEE COMMUNICATIONS SOCIETY IEEE 通信学会
IEEE Networking Letters Pub Date : 2023-12-01 DOI: 10.1109/LNET.2023.3333138
{"title":"IEEE COMMUNICATIONS SOCIETY","authors":"","doi":"10.1109/LNET.2023.3333138","DOIUrl":"https://doi.org/10.1109/LNET.2023.3333138","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 4","pages":"C2-C2"},"PeriodicalIF":0.0,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10385203","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Organic 6G Continuum Architecture: A Uniform Control Plane Across Devices, Radio, and Core 有机 6G 连续架构：跨越设备、无线电和核心的统一控制平面
IEEE Networking Letters Pub Date : 2023-12-01 DOI: 10.1109/LNET.2023.3338363
Marius Corici;Fabian Eichhorn;Thomas Magedanz
{"title":"Organic 6G Continuum Architecture: A Uniform Control Plane Across Devices, Radio, and Core","authors":"Marius Corici;Fabian Eichhorn;Thomas Magedanz","doi":"10.1109/LNET.2023.3338363","DOIUrl":"https://doi.org/10.1109/LNET.2023.3338363","url":null,"abstract":"6G visionaries propose uniform control plane operations across connected devices, radio, and core networks. We introduce an advanced, organic 6G continuum concept and architecture, extending the core network’s control plane to encompass near-real-time radio control and user equipment via a novel Web-based services functionality split. This design, when compared with the 5G Service Based Architecture, showcases a reduction in complexity and an increase in flexibility.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 1","pages":"11-15"},"PeriodicalIF":0.0,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10336892","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140042930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
IEEE Communications Society 电气和电子工程师学会通信协会
IEEE Networking Letters Pub Date : 2023-12-01 DOI: 10.1109/LNET.2023.3333136
{"title":"IEEE Communications Society","authors":"","doi":"10.1109/LNET.2023.3333136","DOIUrl":"https://doi.org/10.1109/LNET.2023.3333136","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 4","pages":"C3-C3"},"PeriodicalIF":0.0,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10385200","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Exact Solution of the Full RMSA Problem in Elastic Optical Networks 弹性光网络中全 RMSA 问题的精确解决方案
IEEE Networking Letters Pub Date : 2023-11-28 DOI: 10.1109/LNET.2023.3337041
Fabio David;José F. de Rezende;Valmir C. Barbosa
{"title":"Exact Solution of the Full RMSA Problem in Elastic Optical Networks","authors":"Fabio David;José F. de Rezende;Valmir C. Barbosa","doi":"10.1109/LNET.2023.3337041","DOIUrl":"10.1109/LNET.2023.3337041","url":null,"abstract":"Exact solutions of the Routing, Modulation, and Spectrum Allocation (RMSA) problem in Elastic Optical Networks (EONs), so that the number of admitted demands is maximized while those of regenerators and frequency slots used are minimized, require a complex ILP formulation taking into account frequency-slot continuity and contiguity. We introduce the first such formulation, ending a hiatus of some years since the last ILP formulation for a much simpler RMSA variation was introduced. By exploiting a number of problem and solver specificities, we use the NSFNET topology to illustrate the practicality and importance of obtaining exact solutions.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 1","pages":"55-59"},"PeriodicalIF":0.0,"publicationDate":"2023-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139340081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Modeling Super-Lightweight Cellular Traffic Prediction via Multiservice and Multimodal Feature Fusion Network 通过多服务和多模式特征融合网络构建超轻量级蜂窝流量预测模型
IEEE Networking Letters Pub Date : 2023-11-02 DOI: 10.1109/LNET.2023.3329744
Yingqi Li;Mingxiang Hao;Xiaochuan Sun;Haijun Zhang
{"title":"Modeling Super-Lightweight Cellular Traffic Prediction via Multiservice and Multimodal Feature Fusion Network","authors":"Yingqi Li;Mingxiang Hao;Xiaochuan Sun;Haijun Zhang","doi":"10.1109/LNET.2023.3329744","DOIUrl":"10.1109/LNET.2023.3329744","url":null,"abstract":"Cellular Traffic Prediction has proven to be a key enabler towards automatic network management. However, to pursue performance improvement, the existing studies mainly focus on developing complex deep neural network models, which suffer from extensive computation cost and large model size inevitably. Such models are quite difficult to be deployed on resource-constrained devices. In this letter, we propose a multiservice and multimodal feature fusion network for super-lightweight cellular network traffic prediction, namely \u0000<inline-formula> <tex-math>$m^{2}FFNet$ </tex-math></inline-formula>\u0000, to address the issue. Briefly speaking, such a network consists of a duel feature extraction channel based on grouped 3D convolution for capturing multiservice feature and multimodal feature (yielded from wavelet transform decomposition), respectively. Simulation results demonstrate that our proposal can achieve comparable prediction accuracy as the state-of-the-art deep learning methods, meanwhile obtaining much less computation burden with rather few model size.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 1","pages":"16-20"},"PeriodicalIF":0.0,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134889870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Energy-Aware Relaying in Dense LoRa Networks With Heterogeneous Batteries 使用异构电池的密集 LoRa 网络中的能量感知中继
IEEE Networking Letters Pub Date : 2023-11-01 DOI: 10.1109/LNET.2023.3329030
Sonu Rathi;Jorge F. Schmidt;Udo Schilcher;Siddhartha S. Borkotoky
{"title":"Energy-Aware Relaying in Dense LoRa Networks With Heterogeneous Batteries","authors":"Sonu Rathi;Jorge F. Schmidt;Udo Schilcher;Siddhartha S. Borkotoky","doi":"10.1109/LNET.2023.3329030","DOIUrl":"10.1109/LNET.2023.3329030","url":null,"abstract":"We propose a relaying scheme for a LoRa network’s uplink, where some end devices (EDs) overhear and relay messages from other EDs. The scheme’s salient feature is that it allows the EDs to adjust their relaying behavior according to their energy status, such that EDs with higher energy reserves perform more forwarding. This prevents early depletion of batteries at the low-energy forwarders, while still achieving high reliability levels. The network is divided into tiers. Any ED in a given tier can relay message from any other ED in certain other tier; this eliminates the need for complicated relay-selection procedures. No synchronization requirement is imposed on the EDs. We demonstrate large reductions in the loss rate with just 10% of the EDs acting as relays, operating within 1% duty cycle.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 1","pages":"41-45"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135362165","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信