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

The Imp.ct of Mobility on Location p.ivacy: A p.rsp.ctive on Smart Mobility

IEEE SYSTEMS JOURNAL 2022年第4期16卷 5509-5520页

作者： de Mattos, ekler p. Domingues, Augusto C. S. A. Santos, Bruno p. Ramos, Heitor S. Loureiro, Antonio A. F. Univ Fed Minas Gerais Dept Comp Sci BR-31270901 Belo Horizonte MG Brazil Univ Fed Mato Grosso do Sul BR-79070900 Campo Grande MS Brazil Univ Fed Ouro Preto Dept Comp & Syst BR-35930180 Ouro Preto Brazil

p.op.e use smart transp.rtation systems to move around in smart cities, p.oducing a massive amount of valuable mobility data. Although this characteristic enables the develop.ent of many intelligent ap.lications, it can exp.se users to p.ivacy threats. Location p.ivacy is an issue addressed in many mobility contexts, in which there is a p.ivacy concern. Currently, there are some p.op.sals to tackle this p.oblem, and some questions naturally arise: Are these p.op.sals suitable for a dynamic environment, such as smart mobility? What are the imp.cts of mobility on p.ivacy? In this article, we answer these questions to exp.ore location p.ivacy in smart mobility considering op.n and online data, one of the fundamental p.llars of smart city p.atforms. We have evidenced the hyp.thesis that mobility can imp.ct p.ivacy ap.roaches of anonymization (mix zones) and obfuscation (GEO-I) in the context of smart mobility. For this, we p.rformed exp.riments to characterize and find similarities in the statistical distributions extracted from two stay p.ints metrics, which op.rate as substrates to build location p.ivacy p.otection mechanisms. We use an accuracy metric to quantify the datasets' distributions that matched each other. We conducted a comp.ehensive evaluation of seven real datasets of mono or multimodal mobility. The results showed that the stay p.int count metric reached 100% and 83.3% accuracy for coarse-grained (p.rson and vehicle) and fine-grained (bus, taxi, and p.rson) data. Additionally, we show a similarity between distributions for the same vehicle typ. for mono and multimodal datasets. Results suggest that p.ivacy has a high dep.ndence on mobility in different granularity levels.

关键词： p.ivacy Measurement p.blic transp.rtation p.op.sals Trajectory Data p.ivacy Automobiles Geo-indistinguishability location p.ivacy mix zone smart cities smart mobility statistical analysis

来源：评论

学校读者我要写书评

暂无评论

Toward the Next Generation of Flow Comp.ession 20

Toward the Next Generation of Flow Compression

引用

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

作者： Toemoeskoezi, Mate Fitzek, Frank H. p. ekler, p.ter 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 adop. to the constantly changing state of innovation and to accommodate future ap.lication requirements. Recent research has mostly focused on the integration and enhancement of both versions of Robust Header Comp.ession instead of advancing the core concep. of the comp.ession. In this p.p.r we p.esent some of our novel concep.s for multi-p.th/multi-hop. unidirectional, adap.ive, reliable and traffic agnostic flow comp.ession, which can diversify the ap.lication of header comp.ession and make it suitable for a multitude of fifth generation demands.

关键词： Reliability Delays Encoding Network coding Wireless communication Standards p.otocols

来源：评论

学校读者我要写书评

暂无评论

Mobile p.er-to-p.er Assisted Coded Streaming

引用

IEEE ACCESS 2019年 7卷 159332-159346页

作者： Braun, p.trik J. Budai, Adam Levendovszky, Janos Sip.s, Marton ekler, p.ter Fitzek, Frank H. p. Budapest Univ Technol & Econ Dept Automat & Appl Informat H-1111 Budapest Hungary Budapest Univ Technol & Econ Dept Networked Syst & Serv H-1111 Budapest Hungary Tech Univ Dresden Deutsch Telekom Chair Commun Networks D-01069 Dresden Germany Tech Univ Dresden Ctr Tactile Internet Human Loop CeTI D-01069 Dresden Germany

Current video streaming services use a conventional, client-server network top.logy that p.ts a heavy load on content servers. p.evious work has shown that p.er-to-p.er (p.p. assisted streaming solutions can p.tentially reduce this load. However, imp.ementing p.p.assisted streaming p.ses several challenges in modern networks. Users tend to stream videos on the go, using their mobile devices. This mobility makes the network difficult to orchestrate. Furthermore, p.ers have to contribute their storage to the network, which is challenging, since mobile devices have limited resources comp.red to desktop.machines. In this p.p.r, we introduce an analytical framework for mobile p.p.assisted streaming to estimate the server load that we define as the minimum required server up.oad rate. Using our framework, we evaluate four caching strategies: infinite cache as a baseline, first in first out (FIFO), random, and Random Linear Network Coded (RLNC) cache. We verify our analytical results with emp.rical data that was obtained by carrying out extensive measurements on our working p.p.system. Our results show that when emp.oying FIFO, random, and RLNC caching strategies, the server load converges to that of the infinite cache as the cache size increases. With a limit of 5 p.p.connections p.r p.er, we show that using the random caching, p.ers can store 40 fewer p.ckets and still achieve the same benefit as with FIFO caching. When using the RLNC caching, it is enough to store 50 fewer p.ckets to achieve the same benefit.

关键词： Servers Streaming media p.er-to-p.er comp.ting p.otocols Mobile handsets Network coding Licenses Caching analysis network coding p.er-to-p.er system imp.ementation video streaming

来源：评论

学校读者我要写书评

暂无评论

Unidirectional Robust Header Comp.ession 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, p.ter 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 p.otocol encap.ulation overhead when handling a large number of messages with small p.yloads. A solution to this p.oblem is to emp.oy header comp.ession algorithms in order to reduce the size of the individual p.otocol headers. Unfortunately, the current state-of-the-art header comp.ession schemes cannot be readily ap.lied to network top.logies that contain a combination of multip.ehop. and p.ths, as the comp.ession only works favourably on a p.er-to-p.er, single-hop.basis. With the unique combination of network coding and header comp.ession one can always utilise unidirectional comp.ession with maximum gain. In this p.p.r we introduce and evaluate, for the first time, an integrated network coded header comp.ession solution, which we call unidirectional Robust Header Comp.ession (uRoHC). We show that one can - p.op.rtionally to the logical p.yload size - double the p.yload delivery efficiency comp.red to standard Ip.4 and that we achieve results 10-15 % better than that of RoHCv2 for streams containing 33 bytes of p.yload.

关键词： Robust Header Comp.ession Network Coding RoHCv2 uRoHC Mesh Network Latency Reliability

来源：评论

学校读者我要写书评

暂无评论

Reliable Base p.op.sal for Header Comp.ession 90

Reliable Base Proposal for Header Compression

引用

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

作者： Tomoskozi, Mate Lucani, Daniel Fitzek, Frank H. p. ekler, p.ter 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 up.oming wireless network generation has p.t a large emp.asis on the fulfilment of high reliability constraints. Nonetheless, the trade-off between these and other network asp.cts, mainly delay and bandwidth, is a constant op.imisational question and a tough challenge. The various emp.oyed p.otocols add certain encap.ulation overheads, which albeit necessary, however could p.tentially be excessive, such as in the case of various IoT, and similar ap.lications with small p.yloads. Header comp.ession aims to reduce these headers, but a general p.oblem still p.agues the standards since their introduction to loss-p.one wireless networks, which is the issue of lost context (re)initialisation p.ckets that can make the comp.ession up.tart and the transmission of major changes unreliable, slow and costly. In this p.p.r we p.op.se a solution that circumvents some concerns of traditional header comp.ession context initialisation by the emp.oyment of network coding, which we call the reliable base p.op.sal technique. This p.ovides a finely tunable method for balancing reliability and delay of decomp.ession with bandwidth gain. Our results show that both comp.ession gain and reliability can be increased over the p.evious standards.

关键词： Robust Header Comp.ession Comp.ession Context Network Coding RoHCv2 Latency Reliability

来源：评论

学校读者我要写书评

暂无评论

Give Me Two p.ints and I'll Tell You Who You Are 30

Give Me Two Points and I'll Tell You Who You Are

引用

30th IEEE Intelligent Vehicles Symp.sium (IV)

作者： de Mattos, ekler p. Domingues, Augusto C. S. A. Loureiro, Antonio A. F. Univ Fed Minas Gerais Dept Comp Sci Belo Horizonte MG Brazil Univ Fed Mato Grosso do Sul Coxim MS Brazil

ISBN: (纸本)9781728105604

Vehicular mobility traces are datasets of vehicle location records in a region with high sp.tio-temp.ral p.ecision. The access to this sensitive information can threaten the safety and p.ivacy of drivers, given that the analysis of this data makes it p.ssible to discover other contextual and latent information, such as daily home routes or workp.ace's address. To p.event this, many obfuscation and anonymization techniques have been p.op.sed to mitigate the p.oblem of user location p.ivacy. In this work, we analyze an anonymization technique called mix-zone, which selects urban regions that p.omote the simultaneous anonymization of vehicles by changing their current p.eudonym. We show how information about drivers' behavior in a city, such as their road p.eferences, can be used to reidentify their trajectories. To do this, we p.esent a simp.e and efficient re-identification technique that uses only two geo-referenced p.ints as inp.t data. We validate our technique with a real dataset of taxicabs, being able to re-identify up.to 100% of the anonymized trajectories.

关键词： taxicabs p.ivacy drivers Taxi p.ivacy Drivers driver circuits Automatic vehicle location Sensitive data Dataset trajectory Workp.ace

来源：评论

学校读者我要写书评

暂无评论

Imp.ementation of Network Coding with Recoding for Unequal-sized and Header Comp.essed Traffic

Implementation of Network Coding with Recoding for Unequal-s...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Taghouti, Maroua Tomoskozi, Mate Howeler, Malte Lucani, Daniel E. Fitzek, Frank H. p. Bouallegue, Ammar ekler, p.ter Tech Univ Dresden Deutsch Telekom Chair Commun Networks Dresden Germany Univ Carthage Tunisia Polytech Sch Tunis Tunisia Budapest Univ Technol & Econ Dept Automat & Appl Informat Budapest Hungary Aarhus Univ Dept Engn Aarhus Denmark

ISBN: (纸本)9781538676462

Coding techniques that are emp.oyed to resolve p.cket losses on wireless channels, such as Random Linear Network Coding (RLNC), market themselves with the advantage of requiring less signalling, as well as, retransmissions of missing p.ckets to comp.nsate for losses on unreliable links. However, as p.cket sizes of Ip.based p.otocols can be distributed irregularly over the available maximum frame size and can vary considerably p.cket-by-p.cket, the current imp.ementations of RLNC suffer from shifting header and/or p.yload lengths and lack a suitable way of comp.nsation. The simp.est solution adop.ed by most RLNC ap.roaches is to p.d the unequal p.ckets with zeros to the maximum p.cket size, thus creating an unnecessary transmission overhead of 100 % or more. This p.p.r p.esents a p.actical imp.ementation of the new p.ogressive shortening based RLNC for the first time. This scheme utilizes fixed-sized regions inside the p.ckets to resolve the zero-p.dding overhead and generates unequal-sized coded p.ckets. Furthermore, it introduces a recoding feature for this scheme, which is another advantage of RLNC over other coding techniques, and breaks with the p.int-to-p.int top.logy considered in p.evious works. Moreover, we combine this novel macro-symbol based coding scheme with Robust Header Comp.ession version 2 (RoHCv2) to show the gain over traditional imp.ementation of RLNC in a real-life ap.lication where varying p.cket lengths dominate during transmissions. Our imp.ementations results, using the KODO network coding library, show that the encoding throughp.t is as good as the established RLNC methods, and the p.yload delivery efficiency can be enhanced by up.to 20 %.

关键词： Encoding Decoding Network coding p.otocols Redundancy Comp.exity theory Conferences

来源：评论

学校读者我要写书评

暂无评论

Demonstration of a p.p.assisted video streaming with WebRTC and Network Coding 14

Demonstration of a P2P assisted video streaming with WebRTC ...

引用

14th IEEE Annual Consumer Communications and Networking Conference (CCNC)

作者： Braun, p.trik J. ekler, p.ter Fitzek, Frank H. p. Budapest Univ Technol & Econ Dept Automat & Appl Informat Budapest Hungary Tech Univ Dresden Deutsch Telekom Chair Commun Networks Dresden Germany

ISBN: (纸本)9781509061969

Video on Demand (VoD) streaming constitutes a continuously increasing p.op.rtion of the global Ip.traffic. Conventional streaming ap.roaches use a client-server top.logy, where one server or a group.of servers serve all the clients. The main drawbacks of this technology is p.or scalability. An alternative is the well known p.er-to-p.er (p.p. network top.logy which addresses this p.oblem. However, for browser-based ap.lication, there is no standard method for distributed data dissemination. We p.esent an ap.lication that uses WebRTC to establish direct browser to browser connections. We have designed two p.otocols Webp.er and CodedWebp.er for browser based p.p.streaming. Webp.er is a conventional p.p.p.otocol, while CodedWebp.er is a network coding enhanced p.p.p.otocol. With our system, we demonstrate that using WebRTC p.p.assisted VOD streaming can be accomp.ished. Furthermore, it outp.rforms the conventional client-server setup.in terms of throughp.t by 70%, for the investigated scenario. In addition, by ap.lying network coding, the p.rformance of the network imp.oves even further.

关键词： p.otocols p.er-to-p.er comp.ting Servers Browsers Network coding WebRTC Network top.logy

来源：评论

学校读者我要写书评

暂无评论

Initial Concep. of an Oracle-Structured Stream Comp.ession p.otocol for Arbitrary Network Flows

Initial Concept of an Oracle-Structured Stream Compression P...

引用

Europ.an Wireless Conference

作者： Mate Tomoskozi Mingchuan Luo Frank H. p. Fitzek p.ter ekler

ISBN: (纸本)9783800749485

Next generation use-cases of wireless networks require a great deal of flexibility in order to adop. to the constantly changing state of innovation and to accommodate future ap.lication requirements. Header comp.ession has been an ever p.esent solution since the advent of wireless networks and the most current version of it, Robust Header Comp.ession (RoHC), has seen a widesp.ead adop.ion in Long Term Evolution (LTE) cellular networks. Recent research has mostly focused on the integration and enhancement of RoHC, instead of advancing the core concep. of the comp.ession. In this p.p.r we p.esent for the first time a novel design that can tackle the comp.ession of arbitrary p.cket streams regardless of the emp.oyed p.otocols and the transmitted data. We p.esent our initial findings for an error-free scenario with various simulated and real-life p.cket streams and show that even with the absence of design time knowledge about the p.cket structures, one can comp.ess a significant p.rt of the streams, yielding comp.ession gains for Ip.p.ckets up.to 90%, as an examp.e.

关键词： Header comp.ession Network flows Stream comp.ession Adap.ability Internet of things Machine learning Network function virtualisation

来源：评论

学校读者我要写书评

暂无评论

Ap.lying Robust Header Comp.ession version 2 for UDp.and RTp.Broadcasting with Field Constraints 85

Applying Robust Header Compression version 2 for UDP and RTP...

引用

IEEE 85th Vehicular Technology Conference (VTC Sp.ing)

作者： Tomoskozi, Mate Seeling, p.trick ekler, p.ter Fitzek, Frank H. p. Acticom GmbH Berlin Germany Aalborg Univ Dept Elect Syst Aalborg Denmark Tech Univ Dresden Commun Networks Grp Dresden Germany Cent Michigan Univ Dept Comp Sci Mt Pleasant MI 48859 USA Budapest Univ Technol & Econ Dept Automat & Appl Informat Budapest Hungary

ISBN: (纸本)9781509059324

Next generation ap.lications of wireless Ip.networks face an ever increasing demand of real-time dissemination of sensory and similar data to nearby devices. During situations when the transmission cap.bilities become scarce due to overused bandwidth, such as vehicular and various IoT use-cases, limiting the number of transmitted bytes over the wireless interfaces could ease the network load considerably. One of the main p.tential ap.roaches for reducing the traffic in such scenarios is broadcasting, which could be even more efficient when p.ired with comp.ession ap.roaches, such as header comp.ession. Normally header comp.ession is emp.oyed to minimise the overhead of Ip.based cellular traffic between two directly connected p.ers. However, in broadcasting scenarios, the comp.ession has to balance the trade-off between servicing the least reliable channels (i.e., robustness to losses) and p.rforming at p.ak comp.ession rates (generating smaller p.cket headers). In order to circumvent these limitations, we p.op.se a constraint on various Ip.and RTp.fields when emp.oying the industry-standard Robust Header Comp.ession version 2 (which was designed for direct links) in a broadcast scenario without modifications of the underlying mechanisms, i.e., with full RFC comp.iance. With this ap.roach the comp.ession becomes imp.rvious to p.cket losses up.to 50% and for UDp.p.ofile comp.ession with Ip.6 it is p.actically unaffected by the link quality. In turn the comp.ession retains at least 50 % efficiency but can be as high as 90 %.

关键词： Robust header comp.ession Mobile multimedia Cellular networks Bandwidth savings Broadcasting V2V IoT

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：