European Transactions on Telecommunications最新文献

筛选
英文 中文
Session and media signalling for communication components‐based open multimedia conferencing Web service over IP networks 基于IP网络的开放式多媒体会议Web服务的通信组件的会话和媒体信令
European Transactions on Telecommunications Pub Date : 2011-12-01 DOI: 10.1002/ETT.1494
Cheng Bo, Hu Xiaoxiao, Z. Shicheng, Chen Junliang
{"title":"Session and media signalling for communication components‐based open multimedia conferencing Web service over IP networks","authors":"Cheng Bo, Hu Xiaoxiao, Z. Shicheng, Chen Junliang","doi":"10.1002/ETT.1494","DOIUrl":"https://doi.org/10.1002/ETT.1494","url":null,"abstract":"Service-oriented communication is a new trend in the industry to enable communication through a service-oriented architecture (SOA) and thereby package communications as services, which opens a new paradigm of Web service-based Voice Over Internet Protocol communication, which is extensible and can be easily integrated in end-to-end SOA solutions. In this paper, we proposed the communication components-based open multimedia conferencing Web service over IP networks and mainly focus on the session and media signalling for multimedia conferencing Web service. Details including the multimedia conferencing multiple parties call control state machines and session management, the state life cycle management, and the signal flows for multimedia conferencing scenarios, also including the Simple Object Access Protocol messages mapping to the asynchronous events. The session and media signalling management also provides the Web services interfaces for triggering conferencing session establishment and is further responsible for all necessary media signalling towards a proper media server. In addition, a prototype has been implemented, and its performance has been measured and analysed. Finally, we give the conclusions and future work. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"45 1","pages":"435-450"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73770217","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 passive location system for single frequency networks using digital terrestrial TV signals 一种使用数字地面电视信号的单频网络无源定位系统
European Transactions on Telecommunications Pub Date : 2011-12-01 DOI: 10.1002/ett.1498
Jun Yan, Lenan Wu
{"title":"A passive location system for single frequency networks using digital terrestrial TV signals","authors":"Jun Yan, Lenan Wu","doi":"10.1002/ett.1498","DOIUrl":"https://doi.org/10.1002/ett.1498","url":null,"abstract":"In this work, a passive location system for single frequency networks using digital terrestrial signals is proposed. A cross-correlation method that requires a correlation with fixed frequency was introduced for time delay estimation. The idea is first online reconstruction and update of the transmitted copy of the nearest base station (BS), and then uses this signal copy for correlation with the received signal samples. A time delay extraction method combined with K-mean clustering algorithm is developed. The minimum value of each cluster is extracted as the time delay of each BS. The BS identification can be modelled as a data association problem. A new gate that requires little statistical knowledge was utilised to solve time-of-arrival measurement uncertainty. Meanwhile, the data association strategy is also developed for successive data stream. Mobile station location is formulated as an optimisation problem and solved by a search processing. Simulations study was conducted to evaluate the system performance for different scenarios. The results demonstrate its robustness and high performance. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"81 1","pages":"487-499"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83968880","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}
引用次数: 19
Cross-layer design for double-string cooperative communications in wireless ad-hoc networks 无线自组织网络中双串协作通信的跨层设计
European Transactions on Telecommunications Pub Date : 2011-12-01 DOI: 10.1002/ett.1497
Simone Sergi, F. Pancaldi, G. Vitetta
{"title":"Cross-layer design for double-string cooperative communications in wireless ad-hoc networks","authors":"Simone Sergi, F. Pancaldi, G. Vitetta","doi":"10.1002/ett.1497","DOIUrl":"https://doi.org/10.1002/ett.1497","url":null,"abstract":"This paper proposes a novel architecture for cooperative communication in wireless ad-hoc networks capable of offering reliable and low-latency services efficiently. The proposed solution is characterised by the following relevant features: (i) a wireless connection between each couple of network nodes is established via multiple relays; (ii) each source-to-destination link is characterised by a double-string topology, allowing the use of specific transmit diversity techniques for reliable communications; and (iii) a novel utility-based routing metric providing a fair exploitation of the available energy/bandwidth resources is employed. Simulation results evidence that our solution offers substantial energy savings with respect to traditional ad-hoc architectures employing multihop routing and operating in the absence of cooperative strategies. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"66 1","pages":"471-486"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78174605","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}
引用次数: 8
Round-robin power control for the weighted sum rate maximisation of wireless networks over multiple interfering links 多干扰链路无线网络加权和速率最大化的轮询功率控制
European Transactions on Telecommunications Pub Date : 2011-12-01 DOI: 10.1002/ett.1496
Chung Shue Chen, K. Shum, C. Sung
{"title":"Round-robin power control for the weighted sum rate maximisation of wireless networks over multiple interfering links","authors":"Chung Shue Chen, K. Shum, C. Sung","doi":"10.1002/ett.1496","DOIUrl":"https://doi.org/10.1002/ett.1496","url":null,"abstract":"We study the weighted sum rate maximisation problem of wireless networks consisting of multiple source–destination pairs. The optimisation problem is to maximise a weighted sum of data rates by adjusting the power of each user. The problem is in general a non-convex optimisation problem that will lead to multiple local maxima. A Gauss–Seidel type iterative power control algorithm is presented. The proposed algorithm has the favourable properties that only simple operations are needed in each iteration and the convergence is fast. Performance investigation under some benchmark examples and different user densities has shown its effectiveness. A survey and comprehensive comparison with today’s best-known solutions is provided. Finally, we derive and prove some simple and interesting optimal binary power allocation strategies under special cases of the problem if the network can be represented by a certain approximation. Copyright © 2011 John Wiley & Sons, Ltd. *Correspondence","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"66 2 1","pages":"458-470"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78048281","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}
引用次数: 33
On cost-sharing mechanisms in cognitive radio networks 认知无线网络成本分担机制研究
European Transactions on Telecommunications Pub Date : 2011-12-01 DOI: 10.1002/ett.1501
Shabnam Sodagari, S. Bilén
{"title":"On cost-sharing mechanisms in cognitive radio networks","authors":"Shabnam Sodagari, S. Bilén","doi":"10.1002/ett.1501","DOIUrl":"https://doi.org/10.1002/ett.1501","url":null,"abstract":"We present a framework and pertinent formulations for a coalition of secondary cognitive radios that are willing to lease inactive spectrum band from a primary system through auctioning and to share the received bandwidth and the associated cost among themselves using multiple access techniques. We cast this scenario to submodular class of games and show how a link can be established between the truthful auctioning mechanism and the cost-sharing algorithm. Simulation results verify that the deployed cost-sharing technique leads to encouraging the secondary cognitive radios to truthfully announce their bids. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"60 1","pages":"515-521"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76124202","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}
引用次数: 8
VCAT synchroniser - reduction of buffer size in VCAT enabled next generation SDH networks VCAT同步器-在支持VCAT的下一代SDH网络中减少缓冲区大小
European Transactions on Telecommunications Pub Date : 2011-12-01 DOI: 10.1002/ett.1500
Sunanda Manke, K. Khare, S. Sapre
{"title":"VCAT synchroniser - reduction of buffer size in VCAT enabled next generation SDH networks","authors":"Sunanda Manke, K. Khare, S. Sapre","doi":"10.1002/ett.1500","DOIUrl":"https://doi.org/10.1002/ett.1500","url":null,"abstract":"Next generation synchronous digital hierarchy is a popular transport technology for integrated voice and data communication. It typically uses virtual concatenation (VCAT) for dynamic bandwidth management. This paper discusses different issues related to VCAT. Paper mainly focuses on the differential delay that occurs as all the VCAT members traverse through different path to reach the destination. These streams do not reach the destination at the same time and thus incur differential delay. Buffers are provided at the receiver to compensate for differential delay. The larger the differential delay, the larger is the buffer requirement at the receiver. Differential delay/buffer size can be reduced by proper routing of the traffic. In the existing receiver circuits, all incoming streams are allocated the same buffer space, specifying the maximum differential delay it can compensate. This results in a large buffer requirement. To overcome this limitation, this paper proposes a novel scheme of allocating buffers dynamically to all the streams. To achieve this, differential delay between the streams is computed by extracting the multiframe indicator and then as per the delay, each stream is allocated buffer space from a common buffer pool. The common buffer pool consists of a number of buffer modules. The size of each module is equal to the frame size for the specific virtual channel, and the size of the common buffer pool is architecture dependent. Sixty per cent reduction in the buffer requirement is predicted using this scheme, at the receiver. For functional verification of the concept, a hardware circuit is designed. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"7 1","pages":"500-514"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87799603","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
Energy-aware multipath geographic routing for detouring mode in wireless sensor networks 无线传感器网络绕行模式的能量感知多路径地理路由
European Transactions on Telecommunications Pub Date : 2011-11-01 DOI: 10.1002/ett.1490
Haojun Huang, Guangmin Hu, Fucai Yu
{"title":"Energy-aware multipath geographic routing for detouring mode in wireless sensor networks","authors":"Haojun Huang, Guangmin Hu, Fucai Yu","doi":"10.1002/ett.1490","DOIUrl":"https://doi.org/10.1002/ett.1490","url":null,"abstract":"For energy-constrained wireless sensor networks, we present an Energy-aware Multipath Geographic Routing (EMGR) protocol. EMGR utilizes geographic information, the characteristics of energy consumption and the metric of advanced energy cost to select the next forwarding node, and uses a dynamic anchor list to shift routing path for load balance. Simulation results show that EMGR is superior to other protocols in terms of energy efficiency, network lifetime, end-to-end delay, and packet delivery ratio. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"50 1","pages":"375-387"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75983858","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}
引用次数: 20
A comparison of iterative MIMO receivers under channel uncertainty 信道不确定条件下迭代MIMO接收机的比较
European Transactions on Telecommunications Pub Date : 2011-11-01 DOI: 10.1002/ett.1489
M. Qaisrani, S. M. R. Naqvi
{"title":"A comparison of iterative MIMO receivers under channel uncertainty","authors":"M. Qaisrani, S. M. R. Naqvi","doi":"10.1002/ett.1489","DOIUrl":"https://doi.org/10.1002/ett.1489","url":null,"abstract":"This work investigates iterative architectures for coded transmission over multiple input multiple output channels in the presence of channel uncertainty. Robust receivers that are less sensitive to the uncertainty are designed. The nature of iterative algorithms is especially suited to iterative decoding and channel estimation (ID&CE), which is a widely accepted means of dealing with imperfections in channel state information. ID&CE re-estimates the channel in each iteration to deal with the uncertainty. The derived robust algorithm can be combined with ID&CE to yield significant performance gains as demonstrated by the simulation results. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"58 1","pages":"428-432"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88396274","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
Rateless codes aided coherent M-ary PSK systems in the presence of receiver imperfections and Rician fading 无速率码辅助相干m - ry PSK系统在存在接收机缺陷和信号衰落的情况下
European Transactions on Telecommunications Pub Date : 2011-11-01 DOI: 10.1002/ett.1487
Jing Yang, Jianping An, Xiangming Li, L. Yuan
{"title":"Rateless codes aided coherent M-ary PSK systems in the presence of receiver imperfections and Rician fading","authors":"Jing Yang, Jianping An, Xiangming Li, L. Yuan","doi":"10.1002/ett.1487","DOIUrl":"https://doi.org/10.1002/ett.1487","url":null,"abstract":"In this paper, we study the bit error rate (BER) and the symbol error probability (SEP) performance for a rateless coded M-ary phase-shift keying (MPSK) system in a situation where stochastic phase error, quadrature error and in-phase–quadrature (I–Q) gain mismatch take place all concurrently over a Rician fading channel. Similar scenario has been considered before by Djordjevic et al. for quasi-cyclic low-density parity-check (QC-LDPC) codes, but the effect of I–Q gain mismatch is not correctly modeled, because the Gaussian noise components in I and Q paths are assumed to have the same variance. By taking two different Gaussian noise variances into consideration, precise expressions are derived for the SEP of a coherent MPSK system under the aforementioned condition (with the stochastic phase error depicted by Tikhonov distribution), thus providing a baseline to evaluate the merits of the proposed rateless coded system and that of QC-LDPC codes. The validity of the rateless coded system is substantiated by simulation results. It is observed that rateless codes outperform QC-LDPC codes even the I–Q gain mismatch is modeled in the same way as Djordjevic's work when the target BER is lower than 10−2. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"70 1","pages":"367-374"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83275817","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
Performance analysis of a TH/DS N-ary BPPM UWB system TH/DS n进位BPPM超宽带系统性能分析
European Transactions on Telecommunications Pub Date : 2011-11-01 DOI: 10.1002/ett.1493
Ye-Shun Shen, Fang-Biau Ueng
{"title":"Performance analysis of a TH/DS N-ary BPPM UWB system","authors":"Ye-Shun Shen, Fang-Biau Ueng","doi":"10.1002/ett.1493","DOIUrl":"https://doi.org/10.1002/ett.1493","url":null,"abstract":"A hybrid time-hopping/direct-sequence (TH/DS) multiple access ultra-wideband (UWB) system using N-ary biorthogonal pulse position modulation (BPPM) is proposed and analysed in this paper. Based on the analytical characteristic function method, we derive the accurate probability distribution of the multiple access interference and calculate the average symbol error rate (SER) of the proposed system. Simulation results are provided to verify the analytical frameworks in additive white Gaussian noise channel and to illustrate the system performance in realistic UWB fading channels. The proposed TH/DS N-ary BPPM system is shown to provide better SER performance compared with that of the conventional TH M-ary PPM scheme. We also investigate the trade-off of the proposed system parameters with fixed bit rate and fixed signal bandwidth. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"8 1","pages":"407-414"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78922670","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
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学术文献互助群
群 号:481959085
Book学术官方微信