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

84th IEEE Vehicular Technology Conference (VTC-Fall)

作者： Tomoskozi, Mate Seeling, Patrick ekler, peter Fitzek, Frank H. P. 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: (纸本)9781509017010

Modern cellular networks utilising the long-term evolution (LTE) and the coming 5G set of standards face an ever-increasing demand for low-latency mobile data from connected devices. Header compression is employed to minimise the overhead for IP-based cellular network traffic, thereby decreasing the overall bandwidth usage and, subsequently, transmission delays. Since Robust Header Compression, among others, is primarily designed for the compression of live audio transmissions on endpoint devices, it performs best if certain fields, like the IP ID and RTP Timestamp, stay constant or change at a predetermined rate. Moreover, the compressor expects the uncompressed stream to be loss-free as well, which might not be the case in general scenarios. We employ machine learning approaches for the prediction of Robust Header Compression version 1 ' s and version 2 ' s compression utility under various loss rates and header field dynamics. We analyse how the compressions react to different fluctuations in the headers and choose the compressor configuration which maximises utility. We show that the appropriate choice of compressor repetition configuration increases the overall utility under dynamic channel conditions, such as in the case of remote steering and various IoT applications, and finding the optimal configuration could produce significant benefits, like 1.2 speed-up in a fully utilised network.

关键词： Robust header compression Mobile multimedia Cellular networks Bandwidth savings Linear regression Machine learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Applying Robust Header Compression 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 Spring)

作者： Tomoskozi, Mate Seeling, Patrick ekler, peter 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 applications 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 capabilities 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 potential approaches for reducing the traffic in such scenarios is broadcasting, which could be even more efficient when paired with compression approaches, such as header compression. Normally header compression is employed to minimise the overhead of IP-based cellular traffic between two directly connected peers. However, in broadcasting scenarios, the compression has to balance the trade-off between servicing the least reliable channels (i.e., robustness to losses) and performing at peak compression rates (generating smaller packet headers). In order to circumvent these limitations, we propose a constraint on various IP and RTP fields when employing the industry-standard Robust Header Compression version 2 (which was designed for direct links) in a broadcast scenario without modifications of the underlying mechanisms, i.e., with full RFC compliance. With this approach the compression becomes impervious to packet losses up to 50% and for UDP profile compression with IPv6 it is practically unaffected by the link quality. In turn the compression retains at least 50 % efficiency but can be as high as 90 %.

关键词： Robust header compression Mobile multimedia Cellular networks Bandwidth savings Broadcasting V2V IoT

来源：评论

学校读者我要写书评

暂无评论

Demonstration of a P2P 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, Patrik J. ekler, peter 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 proportion of the global IP traffic. Conventional streaming approaches use a client-server topology, where one server or a group of servers serve all the clients. The main drawbacks of this technology is poor scalability. An alternative is the well known Peer-to-Peer (P2P) network topology which addresses this problem. However, for browser-based application, there is no standard method for distributed data dissemination. We present an application that uses WebRTC to establish direct browser to browser connections. We have designed two protocols WebPeer and CodedWebPeer for browser based P2P streaming. WebPeer is a conventional P2P protocol, while CodedWebPeer is a network coding enhanced P2P protocol. With our system, we demonstrate that using WebRTC P2P assisted VOD streaming can be accomplished. Furthermore, it outperforms the conventional client-server setup in terms of throughput by 70%, for the investigated scenario. In addition, by applying network coding, the performance of the network improves even further.

关键词： Protocols Peer-to-peer computing Servers Browsers Network coding WebRTC Network topology

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation and Implementation of IP and Robust Header Compression Schemes for TCP and UDP Traffic in the Wireless Context 4

Performance Evaluation and Implementation of IP and Robust H...

引用

Eastern European Regional Conference on the Engineering of Computer-Based Systems ECBS-EERC

作者： Tomoskozi, Mate Seeling, Patrick ekler, peter Fitzek, Frank H. P. Acticom GmbH Berlin Germany Aalborg Univ Dept Elect Syst Aalborg Denmark Cent Michigan Univ Dept Comp Sci Mt Pleasant MI 48859 USA Budapest Univ Technol & Econ Dept Automat & Appl Informat Budapest Hungary

ISBN: (纸本)9781467379670

Modern cellular networks utilizing the long-term evolution (LTE) set of standards face an ever-increasing demand for mobile data from connected devices and header compression is employed to minimize the overhead for IP-based cellular network traffic. In this paper, we evaluate the three implementations of header compressions used by these networks with respect to their potential throughput increase and complexity for different mobile service scenarios over wireless IP networks. Specifically, we consider header compression as defined by (i) IP Header Compression (RFC 2507), (ii) Robust Header Compression version 1 (RFC 3095), and (iii) the recently updated Robust Header Compression version 2 (RFC 5225) with TCP/IP profile (RFC 6846). The novelty of this paper is the presentation of the performance evaluation of IP Header Compression for UDP and TCP, as well as a comparison between the two compression methods. Our findings show that all implementations have great potential for saving bandwidth in IP-based wireless networks, even under varying channel conditions. While the RoHC versions generally provide more reliable results than IPHC, we find that on a unidirectional channel, IPHC could perform better.

关键词： Robust header compression Mobile multimedia Cellular networks Bandwidth savings

来源：评论

学校读者我要写书评

暂无评论

The Accuracy of Power Law Based Similarity Model in Phonebook-Centric Social Networks

The Accuracy of Power Law Based Similarity Model in Phoneboo...

引用

International Conference on Wireless and Mobile Communications (ICWMC)

作者： peter ekler Tamas Lukovszki Department of Automation and Applied Informatics Budapest University슠of슠Technology슠and슠Economics Budapest Hungary Faculty of Informatics Eötvös Lonránd University Budapest Hungary

Social networks are becoming increasingly popular nowadays. The increasing capabilities of mobile phones enable them to participate in such networks. We should consider the fact, that the phonebooks in the mobile devices represent social relationships that can be integrated in the social networks. Such networks provide a synchronization mechanism between phonebooks of the users and the social network which allows detecting other users listed in the phonebooks. Users can accept detected similarities. After that, if one of their contacts changes her or his personal detail, it will be propagated automatically into the phonebooks, after considering privacy settings. Estimating the total number of these similarities is a key issue from scalability point of view in such networks. We implemented a phonebook-centric social network, called Phonebookmark and investigated the structure of the network. Previously it was shown that the distribution of similarities follows a power law. Also a model was proposed by us, which can be used to calculate the total number of similarities. However the accuracy of the model is another question, because of the infinite variance of the power law distribution. The contribution of this paper is that using the fact that a member of the network can only be involved in a limited number of similarities results in a similarity distribution with a finite variance. Therefore, central limit theorems can be used to show the accuracy of our estimation of the total number of similarities. However the model can be used in other power law distributions which apply to the requirements.

关键词： Mobile handsets Facebook Accuracy Internet Image edge detection Upper bound

来源：评论

学校读者我要写书评

暂无评论

Robust Header Compression Version 2 Power Consumption on Android Devices via Tunnelling

Robust Header Compression Version 2 Power Consumption on And...

引用

IEEE International Conference on Communications (ICC) / Wireless Communications Symposium / 3rd Workshop on Optical Wireless Communications (OWC)

ISBN: (纸本)9781509015252

Next generation use-cases of wireless IP networks, including especially the Massive Machine Type Communications and IoT applications for the distribution of sensory and similar data will require the capability to handle large number of connections while maintaining a low-power footprint in order to function efficiently during long-term deployments. The reduction of the packetisation overhead resulting from the adaptation of header compression could potentially decrease the battery usage of network heavy applications via diminished wireless interface activity. Normally header compression is employed to minimise the overhead of IP-based cellular traffic between two connected peers. This paper presents for the first time comparative power consumption measurements for Robust Header Compression version 2 (RoHCv2) using WiFi and LTE. We find that the adoption of header compression on modern mobile devices will generally not result in increased power consumption based on the extra complexity added by the execution of the algorithms. We also show that the usage of RoHCv2 can potentially even decrease the battery drain on average by about 0.05 W when payloads are small.

关键词： Robust Header Compression Cellular networks Bandwidth savings IoT Power consumption Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Experiences with Phonebook-Centric Social Networks

Experiences with Phonebook-Centric Social Networks

引用

Consumer Communications and Networking Conference, CCNC IEEE

作者： peter ekler Tamas Lukovszki Department of Automation and Applied Informatics Budapest University슠of슠Technology슠and슠Economics Hungary Faculty of Informatics Eötvös Lonránd University Hungary

ISBN: (纸本)9781424451753

Social networks are becoming more and more popular nowadays. The increasing capabilities of mobile phones enable them to participate in such networks. The phonebooks in the mobile devices represent social relationships, that can be integrated in the social networks. Following we refer to this solution as phonebook-centric social networks. Such networks provide a synchronization mechanism between phonebooks of the users and the social network which allows detecting network members listed in the phonebooks (semi-) automatically. The detection of those members is based on the similarity of the personal data, e.g., similar name, same phone number, address, etc... Users can mark similarities between their phonebook contacts and members in the network. After this, if one of their contacts changes her or his personal detail, it will be propagated automatically into the phonebooks, after considering privacy settings. Synchronization time and energy consumption for synchronization on the mobiles and the scalability of the system strongly depend on the number of users and similarities. We have implemented a phonebook-centric social network, called Phonebookmark and investigated the structure of the network. We experienced that the distribution of similarities follows a power law, as well as the distribution of the in- and out-degrees in the social network. In this paper we propose a model for estimating the total number of similarities and we show that this estimation applies very well to the historical data of Phonebookmark.

关键词： Social network services Mobile handsets Informatics Privacy Scalability IP networks Communications Society Automation Paper technology Power generation economics

来源：评论

学校读者我要写书评

暂无评论

Regression Model Building and Efficiency Prediction of RoHCv2 Compressor Implementations for VoIP 59

Regression Model Building and Efficiency Prediction of RoHCv...

引用

59th Annual IEEE Global Communications Conference (IEEE GLOBECOM) / Conference on Network Coding and Applications (NetCod)

作者： Toemoeskoezi, Mate Seeling, Patrick ekler, peter 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: (纸本)9781509013289

Modern cellular networks utilising the long-term evolution (LTE) and the coming 5G set of standards face an ever-increasing demand for low-latency mobile data from connected devices. Header compression is employed to minimise the overhead for IP-based cellular network traffic, thereby decreasing the overall bandwidth usage and, subsequently, transmission delays. We employ machine learning approaches for the prediction of Robust Header Compression version 2' s (RFC 5225) compression utility for VoIP transmissions, which enables the compression to dynamically adapt to varying channel conditions. We evaluate the prediction models employing.. 2 and mean square error scores next to complexity (number of coefficients) based on an RTP specific training data set and a separately captured live VoIP audio call. We find that the proposed weighted Ridge regression model explains about 70 % of the training data and 72 % of a separate VoIP transmission's utility. This approach outperforms the Ridge and first-order Bayesian regressions by up to 50 % and the second and third order regressions utilising polynomial basis functions by up to 20 %, making it well-suited for utility estimation.

关键词： Robust header compression Mobile multimedia Cellular networks Bandwidth savings Linear regression 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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：