检索结果-内蒙古大学图书馆

Energy Aware IoT Routing Algorithms in Smart City Environment

IEEE ACCESS 2022年 10卷 87733-87744页

作者： ekler, peter Levendovszky, Janos Pasztor, Daniel Budapest Univ Technol & Econ Fac Elect Engn & Informat Dept Automat & Appl Informat H-1111 Budapest Hungary Budapest Univ Technol & Econ Fac Elect Engn & Informat Dept Networked Syst & Serv H-1111 Budapest Hungary

Energy efficiency is one of the key aspects of IoT and Wireless Sensor Networks (WSNs) since the nodes of the network are running on battery power and the lifespan of the system is an important mission-critical parameter. In WSNs, where the energy consumption mainly depends on the radio interface and the transmission protocols, reliable packet forwarding from the source node to Base Station (BS) is crucial. In this paper, we focus on developing new routing algorithms which extend the lifespan of WSNs by achieving optimal energy balancing subject to the criterion that the packets must reach the BS with a predefined probability. We will propose novel two-hop and multi-hop routing algorithms to achieve this objective. The performance of the novel algorithms is compared with the LEACH routing protocol. Extensive simulations prove that the new routing methods are indeed energy efficient, and they are able to meet the predefined reliability criteria as well. The results given in this paper can contribute to reliable communication in IoT or WSN networks and result in lower energy consumption.

关键词： Routing Wireless sensor networks Clustering algorithms Reliability Base stations Spread spectrum communication Collaboration Energy efficiency Internet of Things Energy efficiency IoT routing sensor network

来源：评论

学校读者我要写书评

暂无评论

Algorithmic Splitting: A Method for Dataset Preparation

引用

IEEE ACCESS 2021年 9卷 125229-125237页

作者： Kahloot, Khalid M. ekler, peter Budapest Univ Technol & Econ Dept Automat & Appl Informat H-1117 Budapest Hungary

The datasets that appear in publications are curated and have been split into training, testing and validation sub-datasets by domain experts. Consequently, machine learning models typically perform well on such split-by-hand prepared datasets. Whereas preparing real-world datasets into curated split training, testing and validation sub-dataset requires extensive effort. Usually, repetitive random splits are carried out and trained and evaluated on until reaching out a good score on the evaluation metrics. In this paper, an algorithmic method is proposed for preparing the sub-datasets splits for machine learning models. The objective of the proposed method is to achieve an evenly representative splits out of the dataset with standard and algorithmic way that reduce the perplexity of random splitting.

关键词： Training Testing Data models Machine learning Machine learning algorithms Standards Clustering algorithms Data preprocessing clustering algorithms machine learning

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Routing in Wireless Sensor Networks

引用

ACTA CYBERNETICA 2021年第2期25卷 421-434页

作者： Pasztor, Daniel ekler, peter Levendovszky, Janos Budapest Univ Technol & Econ Dept Automat & Appl Informat Budapest Hungary Budapest Univ Technol & Econ Dept Networked Syst & Serv Budapest Hungary

Efficient data collection is the core concept of implementing Industry4.0 on IoT platforms. This requires energy aware communication protocols for Wireless Sensor Networks (WSNs) where different functions, like sensing and processing on the IoT nodes is supported only by local battery power. Thus, energy aware network protocols, such as routing, became one of the fundamental challenges in IoT data collection schemes. In our research, we have developed a novel routing algorithm which aims at increasing the lifetime of the IoT network subject to pre-defined reliability constraints. Assuming that the data is split and transmitted in the form of packets, we seek the optimal paths over which packets can reach the Base Station (BS) with effective energy usage subject to the condition that the probability of successful packet arrival to the BS exceeds a pre-defined threshold (reliability parameter). As far as the radio propagation is concerned we use Rayleigh-fading in our model. The new algorithm will guarantee an increased longevity and information throughput of the network due to the efficient energy balancing in the IoT network. The performance of the new protocol has also been studied and confirmed by simulations.

关键词： IoT WSN energy-efficient routing WiFi

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Performance of a Novel JWT Revocation Strategy

引用

ACTA CYBERNETICA 2021年第2期25卷 307-318页

作者： Janoky, Laszlo Viktor ekler, peter Levendovszky, Janos Budapest Univ Technol & Econ Dept Automat & Appl Informat Budapest Hungary Budapest Univ Technol & Econ Dept Networked Syst & Serv Budapest Hungary

JSON Web Tokens (JWT) provide a scalable, distributed way of user access control for modern web-based systems. The main advantage of the scheme is that the tokens are valid by themselves - through the use of digital signing - also imply its greatest weakness. Once issued, there is no trivial way to revoke a JWT token. In our work, we present a novel approach for this revocation problem, overcoming some of the problems of currently used solutions. To compare our solution to the established solutions, we also introduce the mathematical framework of comparison, which we ultimately test using real-world measurements.

关键词： JWT JSON Web Tokens user access control

来源：评论

学校读者我要写书评

暂无评论

Practical Evaluation of Multi-Source Coded Downloads

引用

IEEE ACCESS 2019年 7卷 120304-120314页

作者： Braun, Patrik J. Medard, Muriel ekler, peter MIT Res Lab Elect Cambridge MA 02139 USA Budapest Univ Technol & Econ Dept Automat & Appl Informat H-1111 Budapest Hungary

In this paper, we introduce two multi-source download protocols for loosely orchestrated networks that have high potential in Information-Centric Networking (ICN). We focus on services with high bandwidth and low delay requirements, such as video streaming. We propose MUlti-source Transmission Protocol (MUTP) for uncoded multi-source data delivery and extend it with network coding capabilities to create Coded MUTP. We investigate their throughput using a custom-designed system that includes browser extensions and proxy servers. The browser extensions intercept YouTube video downloads and forward them through our proxy server, using parallel HTTP requests, Uncoded MUTP or Coded MUTP approach. We present measurement results collected in 2018-2019, over eleven months that include 1,300,000 log records from more than 960 GBs of video download. We show that even when downloading from only two sources, our protocols can match the heavily optimized HTTP. Furthermore, by increasing the number of sources to four or higher, MUTP protocols can outperform HTTP, reaching an up to three-fold goodput (useful throughput) increase. In addition, we show that the proposed solution avoids the straggler problem, therefore adding more sources to a network increases its goodput.

关键词： Servers Protocols Streaming media Throughput Network coding YouTube Bandwidth Edge cloud JavaScript multi-source download network coding video download WebRTC

来源：评论

学校读者我要写书评

暂无评论

Toward the Next Generation of Flow Compression 20

Toward the Next Generation of Flow Compression

引用

20th IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)

作者： Toemoeskoezi, Mate Fitzek, Frank H. P. ekler, peter Tech Univ Dresden Commun Networks Grp Dresden Germany Budapest Univ Technol & Econ Dept Automat & Appl Informat Budapest Hungary

ISBN: (纸本)9781728102702

Next generation use-cases of wireless networks require a great deal of flexibility in order to adopt to the constantly changing state of innovation and to accommodate future application requirements. Recent research has mostly focused on the integration and enhancement of both versions of Robust Header Compression instead of advancing the core concept of the compression. In this paper we present some of our novel concepts for multi-path/multi-hop, unidirectional, adaptive, reliable and traffic agnostic flow compression, which can diversify the application of header compression and make it suitable for a multitude of fifth generation demands.

关键词： Reliability Delays Encoding Network coding Wireless communication Standards Protocols

来源：评论

学校读者我要写书评

暂无评论

Enabling multi-source coded downloads 3

Enabling multi-source coded downloads

引用

3rd IEEE International Conference on Edge Computing (IEEE EDGE)

作者： Braun, Patrik J. Malak, Derya Medard, Muriel ekler, peter MIT Res Lab Elect RLE 77 Massachusetts Ave Cambridge MA 02139 USA Budapest Univ Technol & Econ Dept Automat & Appl Informat H-1111 Budapest Hungary

ISBN: (纸本)9781728127088

In this paper, we introduce two multi-source download protocols for loosely orchestrated edge cloud scenarios involving mobile devices. We focus on services with high bandwidth and low delay requirements, like video streaming. We propose MUlti-source Transmission Protocol (MUTP) for uncoded multi-source data delivery and extend it with network coding capabilities to create coded MUTP. We investigate their throughput using a custom designed testbed. We present measurement results collected over eight months that include more than 630 GBs of video download. We show that even when downloading from only two sources, our protocols can match the heavily optimized HTTP protocol. Furthermore, by increasing the number of sources to four or higher, MUTP protocols can outperform the HTTP approach, reaching an up to three-fold goodput increase.

关键词： Network coding multi-source download WebRTC JavaScript video download edge cloud

来源：评论

学校读者我要写书评

暂无评论

Multi-Source Coded Downloads

Multi-Source Coded Downloads

引用

IEEE International Conference on Communications (IEEE ICC)

作者： Braun, Patrik J. Malak, Derya Medard, Muriel ekler, peter MIT RLE 77 Massachusetts Ave Cambridge MA 02139 USA Budapest Univ Technol & Econ Dept Automat & Appl Informat H-1111 Budapest Hungary

ISBN: (纸本)9781538680889

In this paper, we propose a selective-repeat (SR) automatic repeat-request (ARQ) model for multi-source download scenarios and analyze their useful throughput that we refer to as goodput. The multi-source scenario comprises a set of transmitters that send packets to a receiver. We characterize the forward channels from the transmitters to the receiver via a general hidden Markov model (HMM) and assume that the reverse channels from the receiver to the transmitter are lossless. To find the average goodput of the network, we exploit the probability-generation function. We consider different packet transmission schemes, including uncoded random, network coded and sliding window-based network coded packets, and contrast their performance. Our calculations show that using network coding in a multi-source scenario can increase the average goodput, while sliding window-based coding may also archive the theoretical maximum goodput. We show that our multi-source approach avoids the straggler problem, therefore adding more transmitters to the network increases its throughout and the system does not get limited by the weakest transmitter. We also verify our analytic results with extensive simulations.

关键词： Network coding selective-repeat (SR) Automatic Repeat-reQuest (ARQ) Hidden Markov model (HMM) Multi-source network Throughput

来源：评论

学校读者我要写书评

暂无评论

Unidirectional Robust Header Compression for Reliable Low Latency Mesh Networks

Unidirectional Robust Header Compression for Reliable Low La...

引用

IEEE International Conference on Communications (IEEE ICC)

作者： Toemoeskoezi, Mate Lucani, Daniel Fitzek, Frank H. P. ekler, peter Tech Univ Dresden Commun Networks Grp Dresden Germany Aarhus Univ Dept Engn Commun Syst Aarhus Denmark Budapest Univ Technol & Econ Dept Automat & Appl Informat Budapest Hungary

ISBN: (纸本)9781538680889

Next generation use-cases of mesh networks, such as connected vehicles and industrial devices, require low latency transmissions while fulfilling high reliability constraints. However, they also suffer from an increased protocol encapsulation overhead when handling a large number of messages with small payloads. A solution to this problem is to employ header compression algorithms in order to reduce the size of the individual protocol headers. Unfortunately, the current state-of-the-art header compression schemes cannot be readily applied to network topologies that contain a combination of multiplehops and paths, as the compression only works favourably on a peer-to-peer, single-hop basis. With the unique combination of network coding and header compression one can always utilise unidirectional compression with maximum gain. In this paper we introduce and evaluate, for the first time, an integrated network coded header compression solution, which we call unidirectional Robust Header Compression (uRoHC). We show that one can - proportionally to the logical payload size - double the payload delivery efficiency compared to standard IPv4 and that we achieve results 10-15 % better than that of RoHCv2 for streams containing 33 bytes of payload.

关键词： Robust Header Compression Network Coding RoHCv2 uRoHC Mesh Network Latency Reliability

来源：评论

学校读者我要写书评

暂无评论

Reliable Base Proposal for Header Compression 90

Reliable Base Proposal for Header Compression

引用

90th IEEE Vehicular Technology Conference (IEEE VTC-Fall)

作者： Tomoskozi, Mate Lucani, Daniel Fitzek, Frank H. P. ekler, peter Tech Univ Dresden Commun Networks Grp Dresden Germany Aarhus Univ Dept Engn Commun Syst Aarhus Denmark Budapest Univ Technol & Econ Dept Automat & Appl Informat Budapest Hungary

ISBN: (纸本)9781728112206

The upcoming wireless network generation has put a large emphasis on the fulfilment of high reliability constraints. Nonetheless, the trade-off between these and other network aspects, mainly delay and bandwidth, is a constant optimisational question and a tough challenge. The various employed protocols add certain encapsulation overheads, which albeit necessary, however could potentially be excessive, such as in the case of various IoT, and similar applications with small payloads. Header compression aims to reduce these headers, but a general problem still plagues the standards since their introduction to loss-prone wireless networks, which is the issue of lost context (re)initialisation packets that can make the compression upstart and the transmission of major changes unreliable, slow and costly. In this paper we propose a solution that circumvents some concerns of traditional header compression context initialisation by the employment of network coding, which we call the reliable base proposal technique. This provides a finely tunable method for balancing reliability and delay of decompression with bandwidth gain. Our results show that both compression gain and reliability can be increased over the previous standards.

关键词： Robust Header Compression Compression Context Network Coding RoHCv2 Latency Reliability

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：