2012 19th International Conference on Telecommunications (ICT)最新文献

筛选
英文 中文
Probabilistic flooding coverage analysis in large scale wireless networks 大规模无线网络的概率泛洪覆盖分析
2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221290
K. Oikonomou, George Koufoudakis, S. Aïssa
{"title":"Probabilistic flooding coverage analysis in large scale wireless networks","authors":"K. Oikonomou, George Koufoudakis, S. Aïssa","doi":"10.1109/ICTEL.2012.6221290","DOIUrl":"https://doi.org/10.1109/ICTEL.2012.6221290","url":null,"abstract":"Information dissemination is a challenging problem in modern wireless networks in which unnecessary transmissions waste valuable resources. Approaches like traditional flooding, are not suitable in these typically large scale and inherently dynamic environments due to the large number of messages transmitted in the network. Probabilistic flooding has been proposed as a suitable alternative, capable of pruning unnecessary transmissions, while at the same time maintaining a large proportion of the network nodes covered. In this approach, the main analysis objective is on the particular threshold probability, for which the number of messages is minimized and almost all network nodes receive the initial piece of information. The analysis proposed in this paper results in a tractable analytical expression regarding coverage, in the form of a polynomial. Studying its roots: (i) results existing in the open literature are confirmed; and (ii) new and tighter boundaries for the threshold probability are derived. Simulation results confirm the analytical findings and in addition, they demonstrate that the obtained boundaries are suitable for achieving high coverage when probabilistic flooding is employed.","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"30 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":"127199954","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
Indoor localization using polar intervals in wireless sensor networks 无线传感器网络中基于极间隔的室内定位
2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221222
F. Mourad, P. Honeine, H. Snoussi
{"title":"Indoor localization using polar intervals in wireless sensor networks","authors":"F. Mourad, P. Honeine, H. Snoussi","doi":"10.1109/ICTEL.2012.6221222","DOIUrl":"https://doi.org/10.1109/ICTEL.2012.6221222","url":null,"abstract":"Wireless sensor networks are networks composed of a large number of distributed sensors, connected via wireless links. This paper deals with the problem of localization in wireless sensor networks. Such a problem becomes challenging in indoor environments, where signals of Global Positioning Systems are no more reliable. In this paper, the localization problem is defined using connectivity measurements. The proposed technique consists thus of estimating unknown sensors positions using known position information of neighboring sensors. The estimation is then performed using polar intervals. The estimated positions are thus two-dimensional intervals defined in some polar coordinates system. Using intervals, the proposed approach performs an outer estimation of the solution, leading to estimates covering for sure the actual positions of the sensors.","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"1 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":"130992970","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
Cedar: An optimized network-aware solution for P2P video multicast Cedar:一个优化的P2P视频多播网络感知解决方案
2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221262
E. Mora, C. Greco, B. Pesquet-Popescu, Marco Cagnazzo, J. Farah
{"title":"Cedar: An optimized network-aware solution for P2P video multicast","authors":"E. Mora, C. Greco, B. Pesquet-Popescu, Marco Cagnazzo, J. Farah","doi":"10.1109/ICTEL.2012.6221262","DOIUrl":"https://doi.org/10.1109/ICTEL.2012.6221262","url":null,"abstract":"Video multicast is an important application for P2P networks, which can benefit from the load repartitioning and large scale distribution properties they offer. In this context, the Orchard algorithm was developed in 2007, with an aim to build a P2P system meeting video multicast requirements. However, Orchard suffers from a slow overlay construction and a potentially high end-to-end delay. In this work, we propose a new algorithm that we call Cedar. Based on Orchard, it integrates original functionalities to speed-up the tree construction and builds a topologically-aware overlay network in order to minimize end-to-end delay. Simulation results showed that Cedar fulfilled its requirements, as the tree construction speed was increased by at least 64%, and the end-to-end delays reduced from around 20 seconds to a maximum of 5 seconds. The Network Awareness functionality also reduced end-to-end delays by 33%.","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"37 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":"125812899","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
Cache management using temporal pattern based solicitation for content delivery 使用基于时间模式的请求进行内容交付的缓存管理
2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221225
D. Marinca, Ali Hamieh, D. Barth, K. Khawam, D. D. Vleeschauwer, Yannick Le Louédec
{"title":"Cache management using temporal pattern based solicitation for content delivery","authors":"D. Marinca, Ali Hamieh, D. Barth, K. Khawam, D. D. Vleeschauwer, Yannick Le Louédec","doi":"10.1109/ICTEL.2012.6221225","DOIUrl":"https://doi.org/10.1109/ICTEL.2012.6221225","url":null,"abstract":"Caching is an effective technique to improve the quality of streaming multimedia services. In this paper, we propose a novel content caching scheme referred as “Cache Management using Temporal Pattern based Solicitation” (CMTPS), to further minimize both service delays and load in the network for Video on Demand (VoD) applications. CMPTS is based on the analysis of clients' requests over passed time intervals to predict the contents that will be solicited in the near future. By means of experimental tests, the CMTPS protocol is evaluated. The obtained results show that CMTPS outperforms LRU, in terms of peak traffic reduction and number of cache hits.","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"26 19","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113976552","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
Further results on Bayesian and deterministic CRBs in the context of blind SIMO channel estimation 盲SIMO信道估计中贝叶斯和确定性crb的进一步结果
2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221253
Samir-Mohamad Omar, D. Slock, O. Bazzi
{"title":"Further results on Bayesian and deterministic CRBs in the context of blind SIMO channel estimation","authors":"Samir-Mohamad Omar, D. Slock, O. Bazzi","doi":"10.1109/ICTEL.2012.6221253","DOIUrl":"https://doi.org/10.1109/ICTEL.2012.6221253","url":null,"abstract":"The performance of channel estimation is often assessed by deriving the proper Cramér-Rao Bound (CRB). However, in the blind case a special treatment is required due to the singularity of the Fisher Information Matrix (FIM). Usually a constraint is introduced to overcome the blind ambiguity and ensuing singularity. Hence, a constrained CRB has been derived in the literature since a long time ago. Although this constrained CRB has been proven to be a valid lower bound in the medium and high SNR regimes, it fails completely in the low SNR regime because unlike the MSE it does not saturate. Motivated by the shortcoming of the constrained CRB, we derive in this paper a modified constrained CRB (MCCRB) for deterministic blind channel estimation. The MCCRB is valid over the whole SNR regime. In the second part of the paper we address Bayesian blind channel estimation and explore the apparent discrepancy between channel unidentifiability with a non-singular FIM. We highlight that in the less familiar Bayesian case this relationship needs to be interpreted differently. The analytical formulas for the introduced bounds are validated by some Monte-Carlo simulations.","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"1 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":"130303698","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
Smart public transportation services using smart phones in vehicular environments 在车辆环境中使用智能手机的智能公共交通服务
2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221297
Rakan Nimer, Nourhan Farhat, Hadi El Hosni, Chadi El Masri, Nour Alawieh, Mark Saroufim, H. Artail
{"title":"Smart public transportation services using smart phones in vehicular environments","authors":"Rakan Nimer, Nourhan Farhat, Hadi El Hosni, Chadi El Masri, Nour Alawieh, Mark Saroufim, H. Artail","doi":"10.1109/ICTEL.2012.6221297","DOIUrl":"https://doi.org/10.1109/ICTEL.2012.6221297","url":null,"abstract":"Taxis play an important role in modern public transportation networks, especially in Lebanon where public transportation services are still underdeveloped. Street hailing is the current common method for getting a taxi, where you simply wait on side roads and hail to find a taxi who thinks you fit within his planned route. Taxi drivers currently rely on a simple first come-first serve approach with luck playing a large role in their daily profit. Problems arising from the current system are low taxi utilization, long passenger waiting times, road safety issues and traffic congestion. Our objective is to implement a new system that improves the existing shared taxi service by benefiting both the taxi drivers and passengers. The general idea is to design a system whose server receives requests from passengers and offers from drivers using smart phones with GPS capabilities and Internet access (3G/WIFI hotspots). The server periodically analyzes the geographical distribution of potential passengers on a digital map and then runs a scheduling algorithm to generate a stable taxi-passenger scheduling and finally broadcasts the allocations back to taxi drivers and potential passengers. The server will also utilize the taxi drivers' movement patterns to gain insight into the traffic congestion levels on Beirut's streets. The algorithm will be tested by running a model system on a network simulator.","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"1 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":"126188024","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
P2P application for file sharing P2P应用程序的文件共享
2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221249
H. Amin, M. Chahine, G. Mazzini
{"title":"P2P application for file sharing","authors":"H. Amin, M. Chahine, G. Mazzini","doi":"10.1109/ICTEL.2012.6221249","DOIUrl":"https://doi.org/10.1109/ICTEL.2012.6221249","url":null,"abstract":"The novelty of the peer-to-peer (P2P) paradigm relies on two main concepts: cooperation among users and resource sharing. There are many applications based on peer-to-peer paradigm, but the most popular one is the file sharing. We can classify the file sharing application into centralized systems, (having a central server), and decentralized systems. Another classification would be structured and unstructured systems, based on the way of managing the indexing information. In this paper we implement a centralized peer-to-peer application for file sharing. And we evaluate the application by means of simulation.","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"415 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":"130111342","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
Capacity evaluation in OFDMA cognitive radio networks OFDMA认知无线网络的容量评估
2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221235
Mohammad Robat Mili, K. Hamdi
{"title":"Capacity evaluation in OFDMA cognitive radio networks","authors":"Mohammad Robat Mili, K. Hamdi","doi":"10.1109/ICTEL.2012.6221235","DOIUrl":"https://doi.org/10.1109/ICTEL.2012.6221235","url":null,"abstract":"In this paper, we evaluate the total ergodic capacity of channels in an OFDMA cognitive radio network using the interference concept. It is assumed that all links associated with primary and secondary networks experience Rayleigh fading. The optimum power allocation scheme and the channel capacity are derived under different secondary to primary interference constraints. These constraints at the primary receiver belong to the following two types: the first one is the long-term constraint that regulates the average interference across all the fading states, and the other is the short-term constraint that limits the instantaneous interference over each fading state. Simulation results show the impact of the interference from other primary transmitters on the ergodic capacity of cognitive radio networks over the same subchannel.","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"132 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":"124634604","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
A performance comparison of FBMC modulation schemes with short perfect reconstruction filters 短时间完全重构滤波器FBMC调制方案的性能比较
2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221247
Damien Roque, C. Siclet, P. Siohan
{"title":"A performance comparison of FBMC modulation schemes with short perfect reconstruction filters","authors":"Damien Roque, C. Siclet, P. Siohan","doi":"10.1109/ICTEL.2012.6221247","DOIUrl":"https://doi.org/10.1109/ICTEL.2012.6221247","url":null,"abstract":"In this paper, we study the performance of filter bank based multicarrier (FBMC) transmission systems over doubly-dispersive channels. FBMC generalizes traditional orthogonal frequency-division multiplexing (OFDM) schemes, allowing a non-rectangular sub-channel pulse shape in the time domain. This approach leads to a better spectral containment that improves interference mitigation in several time-variant environments. A general analysis describes the transmultiplexer structure and the time-variant multipath channel model. We specify rectangular filters and short perfect reconstruction (PR) filters that give rise to two families of FBMC transceivers. A performance comparison between these schemes is performed in terms of bit-error-rate using a single-tap per sub-channel equalizer. This study emphasizes the low complexity of the FBMC transceivers in the case of short filters and discusses its usefulness through simulation results in two mobility scenarios.","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"1 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":"130672608","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}
引用次数: 21
Coordinated multipoint power consumption modeling for energy efficiency assessment in LTE/LTE-advanced cellular networks 用于LTE/LTE-advanced蜂窝网络能效评估的协调多点功耗建模
2012 19th International Conference on Telecommunications (ICT) Pub Date : 2012-04-23 DOI: 10.1109/ICTEL.2012.6221266
Opeoluwa Tosin Eluwole, M. Lohi
{"title":"Coordinated multipoint power consumption modeling for energy efficiency assessment in LTE/LTE-advanced cellular networks","authors":"Opeoluwa Tosin Eluwole, M. Lohi","doi":"10.1109/ICTEL.2012.6221266","DOIUrl":"https://doi.org/10.1109/ICTEL.2012.6221266","url":null,"abstract":"Chronological developments from first (1G) to state-of-the-art fourth generation (4G) cellular networks have demonstrated remarkable exploits particularly in terms of peak data rate, throughput and spectral efficiency. However, this paper focuses on the energy efficiency (EE) aspect of cellular communications which apparently has been neglected until very recent years. Popular approaches for EE assessment (2G and 3G power consumption models) have been base station deployment strategies and joint management design/optimization techniques. This paper takes a step further to present a coordinated multipoint (CoMP)-enabled mathematical power consumption model for cooperating 4G base stations (eNodeBs) derived via component-oriented modeling technique; a view that a system or equipment comprises numerous energy-consuming components. We utilize the energy consumption rating (ECR) metric for the assessment of energy efficiency and simulations are carried out on the model with or without base station cooperation (BSC). Overall, results indicate on average that considerable energy savings up to 13% can be realized through BSC (CoMP).","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"1 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":"129308503","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}
引用次数: 13
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信