2012 19th International Conference on Telecommunications (ICT)最新文献_第9页

Context-Aware Management Scheme for service continuity 上下文感知管理方案，实现业务连续性

2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221315

Hanan E. Alhazmi, N. Adra

{"title":"Context-Aware Management Scheme for service continuity","authors":"Hanan E. Alhazmi, N. Adra","doi":"10.1109/ICTEL.2012.6221315","DOIUrl":"https://doi.org/10.1109/ICTEL.2012.6221315","url":null,"abstract":"As wireless access technologies grow rapidly, the recent studies have focused on granting mobile users the ability of roaming across different wireless networks in a seamless manner thus offering seamless mobility. The different characteristics of each wireless technology with regard to Quality of Service (QoS) brought many challenges for provisioning the continuous services (audio/video streaming) in a seamless way. The paper proposes Context-Aware Management Scheme (CAMS) which facilitates service continuity in real-time application such as video and audio streaming. Unlike previous research efforts which focuses on session continuity only while handover and does not account for the characteristics differences between the networks, this work focuses on improving QoS and user experience by adapting the session parameters after Vertical Handover (VHO) according to the new environment and available resources. The new scheme would improve users experience and allow the network to admit more users at the same time compared to non-context aware solutions. In this paper, the architecture of the proposed scheme is presented. In addition, detailed signaling messages of the VHO and Context-Aware Management from WiFi to WiMax and vice versa are discussed.","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116930947","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

SCORE: Data Scheduling at roadside units in vehicle ad hoc networks 得分:车辆自组织网络中路边单元的数据调度

2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221270

Khaleel W. Mershad, H. Artail

{"title":"SCORE: Data Scheduling at roadside units in vehicle ad hoc networks","authors":"Khaleel W. Mershad, H. Artail","doi":"10.1109/ICTEL.2012.6221270","DOIUrl":"https://doi.org/10.1109/ICTEL.2012.6221270","url":null,"abstract":"Data Acquisition and delivery in Vehicular Ad hoc Networks (VANETs) is an important topic that has received very little attention. We proposed a system in which roadside units (RSUs) were exploited to satisfy the various requests of VANET users. Our approach uses RSUs as delegates to acquire services from service providers without the users connecting to them. Users' interests range from email messages, news, web downloading, business transactions, multimedia sharing, traffic or weather information, etc... Depending on RSUs to obtain users' data puts a huge load on the RSU network and might lead to a scalability problem, especially with the large number of users in VANETs. In this paper, we build on the approach and propose an RSU scheduling mechanism in which an RSU builds a schedule that is divided into time-slots (TSs). In each TS, all users that are expected to connect to the VANET are specified. Hence, an RSU prepares users' data and caches them during a free TS before the users connect. The users' connection times are derived from observing their actual connections. Our approach was tested using ns2 to assess its efficiency.","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133978974","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}

引用次数: 18

Spectrum sharing optimization model for OFDMA systems under joint time and frequency constraints 时间和频率联合约束下OFDMA系统频谱共享优化模型

2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221295

Ayman Khalil, M. Crussiére, J. Hélard

引用次数: 1

Code division cooperative identification reader anti-collision protocol in smart RFID systems 智能RFID系统中的码分协同识别读写器防碰撞协议

2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221268

Juyi Qiao, Weidong Wang, Yinghai Zhang, Shasha Niu

引用次数: 5

Improved channel estimation methods based on PN sequence for TDS-OFDM 基于PN序列的TDS-OFDM信道估计改进方法

2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221259

Ming Liu, M. Crussiére, J. Hélard

引用次数: 7

Offline multi-class flow allocation in MPLS networks using a distributed multi-objective genetic algorithm 基于分布式多目标遗传算法的MPLS网络离线多类流分配

2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221227

N. E. Mawass, A. Sardouk, S. E. Falou

引用次数: 1

Robust channel estimation for Spectrally Efficient FDM system 频谱高效FDM系统的鲁棒信道估计

2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221292

Safa Isam, I. Darwazeh

引用次数: 38

Complexity reduction of shuffled parallel iterative demodulation with turbo decoding turbo译码的混沌并行迭代解调复杂度降低

2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221298

Salim Haddad, O. Sanchez, A. Baghdadi, M. Jézéquel

{"title":"Complexity reduction of shuffled parallel iterative demodulation with turbo decoding","authors":"Salim Haddad, O. Sanchez, A. Baghdadi, M. Jézéquel","doi":"10.1109/ICTEL.2012.6221298","DOIUrl":"https://doi.org/10.1109/ICTEL.2012.6221298","url":null,"abstract":"High throughput and complexity reduction remain major requirements of future wireless communication system implementations. On the Other hand, iterative processing is being widely investigated and proposed nowadays to cope with the increasing transmission quality requirement. However, these advanced techniques pose a real challenge in terms of achieving high throughput and reduced complexity implementations. A typical example in this domain is the significant performance improvement offered by the use of iterative demodulation with turbo decoding in severe channel conditions. For this iterative system, and targeting a highly parallel architecture for high throughput feature, we analyze the impact of computation scheduling on the complexity. We demonstrate that the adoption of advanced shuffled scheduling can lead to significant complexity reduction. Simulations show that applying the Butterfly-Replica schedule in the turbo decoder reduces the overall number of iterations by at least one iteration in the waterfall region with respect to the Butterfly schedule. This gain in number of iterations comes without any overhead in terms of area and without any lose is communication performance. However, it results in a throughput improvement around 33% and a complexity reduction up to 22% in arithmetic operations, 14.6% in read access memory, and -39.3% in write access memory for the considered configurations.","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115190015","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

A POMDP model for opportunistic spectrum access under ordered channel assignment policy 有序信道分配策略下机会性频谱接入的POMDP模型

2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221317

Atoosa Dalili Shoaei, S. Khorsandi

{"title":"A POMDP model for opportunistic spectrum access under ordered channel assignment policy","authors":"Atoosa Dalili Shoaei, S. Khorsandi","doi":"10.1109/ICTEL.2012.6221317","DOIUrl":"https://doi.org/10.1109/ICTEL.2012.6221317","url":null,"abstract":"In this paper, we consider channel access problem in cognitive radio networks. We assume ordered channel assignment policy in the primary network. Searching channels sequentially from the beginning, the first available channel is assigned when a request arrives from a primary user, leaving idle channels in the upper part of the spectrum. As secondary users have limited sensing capabilities, ordered channel assignment makes finding available channels much easier. When a channel is sensed to be idle, the user can send over that channel and all subsequent channels. Modeling channel occupancy in primary network as a discrete time Markov chain, secondary users use their prior knowledge of state transition probabilities to derive their channel selection action. Under ordered channel assignment, several channel selection strategies are investigated. The optimal strategies based on POMDP framework are derived. For lower complexity, three greedy policies are also proposed. The proposed ordered channel assignment policy results in efficient 1-D Markov model with significant reduction in the size of the state space compared to N-D models deduced in previous works. When secondary network consists of multiple users, users can only send at the sensed channel in each time slot. This problem is also investigated in this paper. Furthermore, partially ordered channel assignment is considered for primary network and a sensing strategy is proposed for this situation.","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126292886","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

Integrated MIP-SIP for IMS-based WiMAX-UMTS vertical handover 基于ims的WiMAX-UMTS垂直切换集成MIP-SIP

2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221306

Nada M. Alamri, N. Adra

引用次数: 10