首页 > 最新文献

2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies最新文献

英文 中文
Cross-Layer Joint Optimization of FEC Channel Codes and Multiple Description Coding for Video Delivery over IEEE 802.11e Links IEEE 802.11e链路视频传输FEC信道码和多重描述编码的跨层联合优化
S. Milani, G. Calvagno, R. Bernardini, P. Zontone
The paper presents two cross-layer optimization strategies based on the IEEE 802.11e standard that enable a robust video transmission using adaptively forward error correction (FEC) channel codes at transport layer and a multiple description coding (MDC) architecture. The first approach estimates an array of correlation measures for the group of picture to be transmitted and classifies it using a vector quantizer. The most appropriate coding mode is selected according to the correlation class and the channel conditions obtained through a cross-layer signalling protocol. The second solution relies on a parametric model of the channel distortion based on the percentage of null quantized transform coefficients, which can be obtained during the coding operations. According to the state of the network, the optimization algorithm estimates the expected quality of the reconstructed sequence for each mode and chooses the best one. Experimental results show that both algorithms perform well with a small computational effort but different playout delays.
本文提出了基于IEEE 802.11e标准的两种跨层优化策略,通过在传输层使用自适应前向纠错(FEC)信道码和多描述编码(MDC)架构实现鲁棒视频传输。第一种方法是估计要传输的图像组的一系列相关度量,并使用矢量量化器对其进行分类。根据通过跨层信令协议获得的相关类和信道条件选择最合适的编码模式。第二种解决方案依赖于基于零量化变换系数百分比的信道失真参数模型,该模型可以在编码操作中获得。优化算法根据网络的状态,对每一种模式的重构序列的期望质量进行估计,并选择最优的重构序列。实验结果表明,两种算法都具有较好的性能,计算量小,但播放延迟不同。
{"title":"Cross-Layer Joint Optimization of FEC Channel Codes and Multiple Description Coding for Video Delivery over IEEE 802.11e Links","authors":"S. Milani, G. Calvagno, R. Bernardini, P. Zontone","doi":"10.1504/IJIPT.2009.024168","DOIUrl":"https://doi.org/10.1504/IJIPT.2009.024168","url":null,"abstract":"The paper presents two cross-layer optimization strategies based on the IEEE 802.11e standard that enable a robust video transmission using adaptively forward error correction (FEC) channel codes at transport layer and a multiple description coding (MDC) architecture. The first approach estimates an array of correlation measures for the group of picture to be transmitted and classifies it using a vector quantizer. The most appropriate coding mode is selected according to the correlation class and the channel conditions obtained through a cross-layer signalling protocol. The second solution relies on a parametric model of the channel distortion based on the percentage of null quantized transform coefficients, which can be obtained during the coding operations. According to the state of the network, the optimization algorithm estimates the expected quality of the reconstructed sequence for each mode and chooses the best one. Experimental results show that both algorithms perform well with a small computational effort but different playout delays.","PeriodicalId":247507,"journal":{"name":"2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125180599","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}
引用次数: 11
Simple Mobile Services for IMS IMS的简单移动服务
A. Polidoro, S. Salsano, Giovanni Bartolomeo
In this paper we present an open source platform for mobile services execution and creation that has been ported to work into the IMS architecture. The platform has been developed in the context of the simple mobile services research project and it includes a mobile client called MOVE (Mobile Open and Very Easy) developed using the Java 2 Micro Edition (J2ME) platform. The paper describes the features of the service execution/creation platforms, then it shortly introduces the IMS (IP multimedia subsystem), finally it describes the process of porting the simple mobile services architectural elements into the IMS architecture.
在本文中,我们提供了一个用于移动服务执行和创建的开源平台,该平台已被移植到IMS体系结构中。该平台是在简单移动服务研究项目的背景下开发的,它包括一个使用Java 2 Micro Edition (J2ME)平台开发的名为MOVE (mobile Open and Very Easy)的移动客户端。本文首先介绍了业务执行/创建平台的特点,然后简要介绍了IMS (IP多媒体子系统),最后描述了将简单的移动业务体系结构元素移植到IMS体系结构中的过程。
{"title":"Simple Mobile Services for IMS","authors":"A. Polidoro, S. Salsano, Giovanni Bartolomeo","doi":"10.1109/NGMAST.2008.67","DOIUrl":"https://doi.org/10.1109/NGMAST.2008.67","url":null,"abstract":"In this paper we present an open source platform for mobile services execution and creation that has been ported to work into the IMS architecture. The platform has been developed in the context of the simple mobile services research project and it includes a mobile client called MOVE (Mobile Open and Very Easy) developed using the Java 2 Micro Edition (J2ME) platform. The paper describes the features of the service execution/creation platforms, then it shortly introduces the IMS (IP multimedia subsystem), finally it describes the process of porting the simple mobile services architectural elements into the IMS architecture.","PeriodicalId":247507,"journal":{"name":"2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126454179","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}
引用次数: 3
A Multi-facet Requirement Assessment of Customer-Oriented Mobile Tourism Services 面向客户的移动旅游服务的多方面需求评估
Chien-Chih Yu, H. Chang
This paper presents a multi-facet requirement assessment approach for specifying and relating potential business-to-customer mobile tourism services. An integrated requirement model of mobile tourism services including search & notification, community, tour-guide, recommendation, auction, and transaction & payment services is formulated and validated. Three surveys are conducted to collect data from tourists, 3G operators, and travel agencies for assessing usefulness, importance, feasibility, and effectiveness, as well as for illustrating structural relationships of these services. Survey results and implications serve as a valuable guidance for helping mobile service providers in the tourism domain to improve their services for meeting customers' needs.
本文提出了一个多方面的需求评估方法,用于指定和关联潜在的企业对客户移动旅游服务。构建并验证了搜索通知、社区、导游、推荐、拍卖、交易支付等移动旅游服务的集成需求模型。我们进行了三项调查,从游客、3G运营商和旅行社收集数据,以评估有用性、重要性、可行性和有效性,并说明这些服务的结构关系。调查结果和启示为帮助旅游领域的移动服务提供商改善其服务以满足客户需求提供了宝贵的指导。
{"title":"A Multi-facet Requirement Assessment of Customer-Oriented Mobile Tourism Services","authors":"Chien-Chih Yu, H. Chang","doi":"10.1109/NGMAST.2008.53","DOIUrl":"https://doi.org/10.1109/NGMAST.2008.53","url":null,"abstract":"This paper presents a multi-facet requirement assessment approach for specifying and relating potential business-to-customer mobile tourism services. An integrated requirement model of mobile tourism services including search & notification, community, tour-guide, recommendation, auction, and transaction & payment services is formulated and validated. Three surveys are conducted to collect data from tourists, 3G operators, and travel agencies for assessing usefulness, importance, feasibility, and effectiveness, as well as for illustrating structural relationships of these services. Survey results and implications serve as a valuable guidance for helping mobile service providers in the tourism domain to improve their services for meeting customers' needs.","PeriodicalId":247507,"journal":{"name":"2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129936057","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}
引用次数: 5
Identification of Feature Denial of Services 特征拒绝服务识别
R. G. Crespo
Internet applications, such as Email, VoIP and WWW, have been enhanced with many features. However, the introduction and modification of features may result in undesired behaviors, and this effect is known as feature interaction-FI. FI resolution may be implemented by a Feature Manager, which is directed by a set of interdiction formulas. On the other hand, the approach by interdiction may eliminate all features candidate for execution, and this result on a feature denial of service. In this paper we analyze how feature denial of service can be detected, with a design stage algorithm. The detection algorithm has a time complexity of the quadratic of interdiction formulas.
互联网应用,如电子邮件、VoIP和WWW,已经增强了许多功能。然而,特征的引入和修改可能会导致不希望的行为,这种影响被称为特征交互- fi。FI解析可以由功能管理器实现,它由一组拦截公式指导。另一方面,通过阻断的方法可能会消除所有候选执行的特征,从而导致特征拒绝服务。本文利用设计阶段算法分析了特征拒绝服务的检测方法。该检测算法的时间复杂度为拦截公式的二次元。
{"title":"Identification of Feature Denial of Services","authors":"R. G. Crespo","doi":"10.1109/NGMAST.2008.14","DOIUrl":"https://doi.org/10.1109/NGMAST.2008.14","url":null,"abstract":"Internet applications, such as Email, VoIP and WWW, have been enhanced with many features. However, the introduction and modification of features may result in undesired behaviors, and this effect is known as feature interaction-FI. FI resolution may be implemented by a Feature Manager, which is directed by a set of interdiction formulas. On the other hand, the approach by interdiction may eliminate all features candidate for execution, and this result on a feature denial of service. In this paper we analyze how feature denial of service can be detected, with a design stage algorithm. The detection algorithm has a time complexity of the quadratic of interdiction formulas.","PeriodicalId":247507,"journal":{"name":"2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130700139","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}
引用次数: 1
A Proactive and Distributed QoS Negotiation Approach for Heterogeneous Environments: An Evaluation of QoS Signalling Overhead 异构环境下的主动分布式QoS协商方法:QoS信令开销的评估
A. Zouari, L. Suciu, J. Bonnin, K. Guillouard
The recent boom in radio access technologies and their diversification have opened the way to new studies on quality of services (QoS) management in such heterogeneous environments. Indeed, the need for efficient QoS mechanisms is increasing since these new technologies provide scarce resources (e.g. unpredictable bandwidth and variable error rates). In this environment, nomadic hosts have a greater choice of access technologies. Thus, keeping the same QoS level for one user's application, anywhere user is connecting, may require some mechanisms to control QoS in each target network. In this framework, we propose to adopt a proactive and dynamic negotiation approach coupled with the hand over decision algorithm implemented in (L. Suciu et al., 2007). In this approach, decision parameters (e.g. throughput, transmission delay, etc.) can be distributed between several hierarchical entities in the network. If one decision parameter's value should be negotiated, negotiation process will be immediately started before taking the hand over decision. A comparison of several QoS parameter distributions (e.g. QoS parameters are stored either in mobile terminal or in control entity located more or less deeply in the core network) has been carried out thanks to a mathematical model, which takes into account the size of all messages necessary to achieve QoS parameter negotiation during a mobility scenario.
近年来无线电接入技术的蓬勃发展及其多样化为异构环境下服务质量(QoS)管理的新研究开辟了道路。事实上,由于这些新技术提供了稀缺的资源(例如,不可预测的带宽和可变的错误率),对有效的QoS机制的需求正在增加。在这种环境中,游牧主机有更多的访问技术选择。因此,无论用户在何处连接,为一个用户的应用程序保持相同的QoS级别,可能需要一些机制来控制每个目标网络中的QoS。在这个框架中,我们建议采用一种主动和动态的协商方法,并结合(L. Suciu et al., 2007)中实现的移交决策算法。在这种方法中,决策参数(如吞吐量、传输延迟等)可以分布在网络中的多个分层实体之间。如果需要协商某一决策参数的值,则立即启动协商过程,然后再进行移交决策。通过一个数学模型,对几种QoS参数分布(例如,QoS参数存储在移动终端或位于核心网或多或少深处的控制实体中)进行了比较,该模型考虑了在移动场景中实现QoS参数协商所需的所有消息的大小。
{"title":"A Proactive and Distributed QoS Negotiation Approach for Heterogeneous Environments: An Evaluation of QoS Signalling Overhead","authors":"A. Zouari, L. Suciu, J. Bonnin, K. Guillouard","doi":"10.1109/NGMAST.2008.55","DOIUrl":"https://doi.org/10.1109/NGMAST.2008.55","url":null,"abstract":"The recent boom in radio access technologies and their diversification have opened the way to new studies on quality of services (QoS) management in such heterogeneous environments. Indeed, the need for efficient QoS mechanisms is increasing since these new technologies provide scarce resources (e.g. unpredictable bandwidth and variable error rates). In this environment, nomadic hosts have a greater choice of access technologies. Thus, keeping the same QoS level for one user's application, anywhere user is connecting, may require some mechanisms to control QoS in each target network. In this framework, we propose to adopt a proactive and dynamic negotiation approach coupled with the hand over decision algorithm implemented in (L. Suciu et al., 2007). In this approach, decision parameters (e.g. throughput, transmission delay, etc.) can be distributed between several hierarchical entities in the network. If one decision parameter's value should be negotiated, negotiation process will be immediately started before taking the hand over decision. A comparison of several QoS parameter distributions (e.g. QoS parameters are stored either in mobile terminal or in control entity located more or less deeply in the core network) has been carried out thanks to a mathematical model, which takes into account the size of all messages necessary to achieve QoS parameter negotiation during a mobility scenario.","PeriodicalId":247507,"journal":{"name":"2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130079493","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}
引用次数: 2
Data Availability in P2P Streaming Systems P2P流媒体系统中的数据可用性
H. Alustwani, J. Bahi, A. Mostefaoui
Nowadays, sharing multimedia contents in P2P systems has become a common practice. In general, it is done in "download" mode as any other type of data. However, due to their huge volume and real time constraint, multimedia data present another consumption mode which is the streaming mode. In this mode, rather than downloading the entire data before viewing it, it initiates a stream from the source peer to the destination one. The advantages of this mode are numerous such as latency reduction, copyright preservation (in the sense that the consumption peer does not hold the multimedia content), etc. Nevertheless, due to the unpredictable departure of peers and the real time constraint of the consumed data, the problem of maintaining data availability remains open. In this paper we propose to set up a cache to save the "last part" of the "now playing" videos. We demonstrate that such a cache can enhance the data availability in these systems while introducing an acceptable additional traffic. Additionally, we develop a cache management policy that automatically adapts the size of the cached data to the system workload. The simulations we conducted show the effectiveness of our approach.
目前,在P2P系统中共享多媒体内容已经成为一种普遍的做法。一般来说,它是在“下载”模式下完成的,就像任何其他类型的数据一样。然而,由于多媒体数据量大、实时性受限,多媒体数据呈现出另一种消费模式,即流媒体模式。在这种模式下,它不是在查看数据之前下载整个数据,而是启动一个从源对等点到目标对等点的流。这种模式有很多优点,比如延迟减少、版权保护(在这种意义上,消费对等体不持有多媒体内容)等。然而,由于节点不可预测的离开和消费数据的实时约束,维护数据可用性的问题仍然存在。在本文中,我们提出建立一个缓存来保存“正在播放”的视频的“最后一部分”。我们证明,这样的缓存可以增强这些系统中的数据可用性,同时引入可接受的额外流量。此外,我们还开发了一个缓存管理策略,可以根据系统工作负载自动调整缓存数据的大小。仿真结果表明了该方法的有效性。
{"title":"Data Availability in P2P Streaming Systems","authors":"H. Alustwani, J. Bahi, A. Mostefaoui","doi":"10.1109/NGMAST.2008.36","DOIUrl":"https://doi.org/10.1109/NGMAST.2008.36","url":null,"abstract":"Nowadays, sharing multimedia contents in P2P systems has become a common practice. In general, it is done in \"download\" mode as any other type of data. However, due to their huge volume and real time constraint, multimedia data present another consumption mode which is the streaming mode. In this mode, rather than downloading the entire data before viewing it, it initiates a stream from the source peer to the destination one. The advantages of this mode are numerous such as latency reduction, copyright preservation (in the sense that the consumption peer does not hold the multimedia content), etc. Nevertheless, due to the unpredictable departure of peers and the real time constraint of the consumed data, the problem of maintaining data availability remains open. In this paper we propose to set up a cache to save the \"last part\" of the \"now playing\" videos. We demonstrate that such a cache can enhance the data availability in these systems while introducing an acceptable additional traffic. Additionally, we develop a cache management policy that automatically adapts the size of the cached data to the system workload. The simulations we conducted show the effectiveness of our approach.","PeriodicalId":247507,"journal":{"name":"2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114413127","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}
引用次数: 4
Continuous Scheduling for Data-Driven Peer-to-Peer Streaming 数据驱动的点对点流的连续调度
J. Akkanen
The paper introduces a new approach to data-driven peer-to-peer media streaming. While classical algorithms send buffer maps and run scheduling periodically, we experiment by continuously sending incremental notifications of buffer contents and by running a continuous scheduling process. The approach has been tested both in a network simulator and in a small network of smart phones with live video content. The protocol seems to adapt quickly to changing data rate or churn without producing intolerable overhead. The approach leads to small latency and strong peer equality and may thus ease neighbor management. The end-to-end delay is small and one may alleviate a need for large buffers.
本文介绍了一种数据驱动的点对点媒体流的新方法。经典算法周期性地发送缓冲区映射并运行调度,而我们通过不断地发送缓冲区内容的增量通知并运行连续调度过程来进行实验。该方法已在网络模拟器和具有实时视频内容的小型智能手机网络中进行了测试。该协议似乎能够快速适应不断变化的数据速率或流量,而不会产生无法忍受的开销。该方法延迟小,对等性强,可以简化邻居管理。端到端延迟很小,可以减少对大缓冲区的需求。
{"title":"Continuous Scheduling for Data-Driven Peer-to-Peer Streaming","authors":"J. Akkanen","doi":"10.1109/NGMAST.2008.33","DOIUrl":"https://doi.org/10.1109/NGMAST.2008.33","url":null,"abstract":"The paper introduces a new approach to data-driven peer-to-peer media streaming. While classical algorithms send buffer maps and run scheduling periodically, we experiment by continuously sending incremental notifications of buffer contents and by running a continuous scheduling process. The approach has been tested both in a network simulator and in a small network of smart phones with live video content. The protocol seems to adapt quickly to changing data rate or churn without producing intolerable overhead. The approach leads to small latency and strong peer equality and may thus ease neighbor management. The end-to-end delay is small and one may alleviate a need for large buffers.","PeriodicalId":247507,"journal":{"name":"2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133365925","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
Palpatine: A P2MP IMS Video Share Architecture and Implementation Palpatine:一个p2p IMS视频共享架构和实现
Luis López Fernández, Micael Gallego Carrillo, J. Peláez, Francisco Javier López Fernández
In this paper we present Palpatine, an IMS application server providing a point-to-multi-point video share delivery service where a video share capable 3G device can capture audio and video in real time and send it lively to a group of 3G terminals wishing to receive it. Palpatine integrates seamlessly into IMS infrastructures without requiring any network modification and fulfilling all required standards. For this reason, Palpatine can be directly used over any IMS-compliant network without requiring the installation of any external application on current commercial video share capable mobile devices.
在本文中,我们介绍了一种IMS应用服务器Palpatine,它提供点对多点视频共享交付服务,其中具有视频共享功能的3G设备可以实时捕获音频和视频,并将其生动地发送到希望接收它的一组3G终端。Palpatine无缝集成到IMS基础设施中,不需要任何网络修改并满足所有所需的标准。因此,Palpatine可以直接在任何ims兼容的网络上使用,而无需在当前具有商业视频共享功能的移动设备上安装任何外部应用程序。
{"title":"Palpatine: A P2MP IMS Video Share Architecture and Implementation","authors":"Luis López Fernández, Micael Gallego Carrillo, J. Peláez, Francisco Javier López Fernández","doi":"10.1109/NGMAST.2008.30","DOIUrl":"https://doi.org/10.1109/NGMAST.2008.30","url":null,"abstract":"In this paper we present Palpatine, an IMS application server providing a point-to-multi-point video share delivery service where a video share capable 3G device can capture audio and video in real time and send it lively to a group of 3G terminals wishing to receive it. Palpatine integrates seamlessly into IMS infrastructures without requiring any network modification and fulfilling all required standards. For this reason, Palpatine can be directly used over any IMS-compliant network without requiring the installation of any external application on current commercial video share capable mobile devices.","PeriodicalId":247507,"journal":{"name":"2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130539689","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}
引用次数: 1
Mobility Management with OLSR Protocol for Fourth Generation (4G) Mobile Networks 基于OLSR协议的第四代(4G)移动网络移动性管理
S. Jazayeri
Trends in fourth generation (4G) wireless networks are clearly identified by the full-IP concept where all traffic (data, control, voice and video services,etc.) will be transported in IP packets. Many proposals are being made to enhance IP with the functionalities necessary to manage the mobility of nodes, so that networks can provide global seamless roaming between heterogeneous wireless and wired networks. OLSR (Optimized Link State Routing) is that way for IPv6 management, this cause of reduction of overhead and recovery routing. OLSR for adhoc networks with fast nodes have poor efficiency therefore kind of OLSR that named fast-OLSR is proposed. In this paper, we propose implementation of fast-OLSR for improvement efficiency of fourh generation (4G) mobile networks. In this implementation, use IP protocol for macro-mobility management and for micro-mobility use fast-OLSR to manage mobility. Efficiency evaluation show that loss rate proportion of use OLSR is decrease. As a result increase reliability of services.
第四代(4G)无线网络的趋势由全IP概念清楚地确定,在全IP概念中,所有流量(数据、控制、语音和视频业务等)都将以IP分组传输。人们提出了许多建议,通过管理节点的移动性所需的功能来增强IP,以便网络可以在异构无线和有线网络之间提供全球无缝漫游。OLSR(优化链路状态路由)是IPv6管理的一种方式,它可以减少开销和恢复路由。针对快速节点自组织网络的OLSR效率较差的问题,提出了一种称为快速OLSR的OLSR。在本文中,我们提出实施快速olsr以提高第四代(4G)移动网络的效率。在此实现中,使用IP协议进行宏观移动性管理,使用fast-OLSR进行微观移动性管理。效率评价结果表明,利用OLSR的损失率比例有所降低。从而提高了服务的可靠性。
{"title":"Mobility Management with OLSR Protocol for Fourth Generation (4G) Mobile Networks","authors":"S. Jazayeri","doi":"10.1109/NGMAST.2008.12","DOIUrl":"https://doi.org/10.1109/NGMAST.2008.12","url":null,"abstract":"Trends in fourth generation (4G) wireless networks are clearly identified by the full-IP concept where all traffic (data, control, voice and video services,etc.) will be transported in IP packets. Many proposals are being made to enhance IP with the functionalities necessary to manage the mobility of nodes, so that networks can provide global seamless roaming between heterogeneous wireless and wired networks. OLSR (Optimized Link State Routing) is that way for IPv6 management, this cause of reduction of overhead and recovery routing. OLSR for adhoc networks with fast nodes have poor efficiency therefore kind of OLSR that named fast-OLSR is proposed. In this paper, we propose implementation of fast-OLSR for improvement efficiency of fourh generation (4G) mobile networks. In this implementation, use IP protocol for macro-mobility management and for micro-mobility use fast-OLSR to manage mobility. Efficiency evaluation show that loss rate proportion of use OLSR is decrease. As a result increase reliability of services.","PeriodicalId":247507,"journal":{"name":"2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124700468","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}
引用次数: 2
Cost Efficient Media Streaming Algorithms for Rate-Dependent Pricing Strategies in Heterogeneous Wireless Networks 异构无线网络中速率相关定价策略的高效流媒体算法
A. Zahran, C. Sreenan
The future of wireless networking is envisioned as an integrated system of wireless radio access technologies with heterogeneous features. This heterogeneity combined with the characteristic diversity of provided services create promising opportunities for improving the utility of both operators and users. In this paper, we investigate the opportunity to reduce the average cost of streaming sessions by benefiting from the system embedded heterogeneity and streaming application buffering capability. First, we analyze the optimal streaming strategy for a theoretical infinite session. Based on this analysis, we propose pseudo-optimal and greedy-optimal adaptive media streaming algorithms for heterogeneous wireless networks. The performance of these algorithms is compared to a naive greedy streaming approach using NS2 simulations. The results show that the greedy-optimal algorithm reduces the average session cost down to 73.9% of the average cost incurred on using greedy algorithm. This cost saving is realized at an insignificant increase in signaling load and session blocking probability. Hence, we strongly recommend the developed greedy-optimal algorithm for media streaming in next-generation heterogeneous wireless networks.
无线网络的未来被设想为具有异构特征的无线接入技术的集成系统。这种异质性与所提供服务的特性多样性相结合,为提高运营商和用户的效用创造了有希望的机会。在本文中,我们研究了利用系统嵌入式异构性和流应用缓冲能力来降低流会话平均成本的机会。首先,我们分析了一个理论无限会话的最优流策略。在此基础上,我们提出了异构无线网络的伪最优和贪婪最优自适应媒体流算法。这些算法的性能与使用NS2模拟的朴素贪婪流方法进行了比较。结果表明,该算法将平均会话开销降低到使用贪婪算法平均开销的73.9%。这种成本节约是在信令负载和会话阻塞概率微不足道的增加下实现的。因此,我们强烈推荐所开发的贪婪最优算法用于下一代异构无线网络中的媒体流。
{"title":"Cost Efficient Media Streaming Algorithms for Rate-Dependent Pricing Strategies in Heterogeneous Wireless Networks","authors":"A. Zahran, C. Sreenan","doi":"10.1109/NGMAST.2008.32","DOIUrl":"https://doi.org/10.1109/NGMAST.2008.32","url":null,"abstract":"The future of wireless networking is envisioned as an integrated system of wireless radio access technologies with heterogeneous features. This heterogeneity combined with the characteristic diversity of provided services create promising opportunities for improving the utility of both operators and users. In this paper, we investigate the opportunity to reduce the average cost of streaming sessions by benefiting from the system embedded heterogeneity and streaming application buffering capability. First, we analyze the optimal streaming strategy for a theoretical infinite session. Based on this analysis, we propose pseudo-optimal and greedy-optimal adaptive media streaming algorithms for heterogeneous wireless networks. The performance of these algorithms is compared to a naive greedy streaming approach using NS2 simulations. The results show that the greedy-optimal algorithm reduces the average session cost down to 73.9% of the average cost incurred on using greedy algorithm. This cost saving is realized at an insignificant increase in signaling load and session blocking probability. Hence, we strongly recommend the developed greedy-optimal algorithm for media streaming in next-generation heterogeneous wireless networks.","PeriodicalId":247507,"journal":{"name":"2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124188638","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}
引用次数: 7
期刊
2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1