2008 16th International Conference on Software, Telecommunications and Computer Networks最新文献

筛选
英文 中文
Analysis of complexity for the message passing algorithm 消息传递算法的复杂度分析
F. Maguolo, A. Mior
{"title":"Analysis of complexity for the message passing algorithm","authors":"F. Maguolo, A. Mior","doi":"10.1109/SOFTCOM.2008.4669498","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669498","url":null,"abstract":"Besides turbo codes, low-density parity-check (LDPC) codes form another class of Shannon limit-approaching codes. Their large coding gains are mostly due to the decoding algorithm, termed message passing algorithm (MPA) or sum-product algorithm (SPA).","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":" 95","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120834640","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
Roaming, accounting and seamless handover in EAP-TLS authenticated networks EAP-TLS认证网络中的漫游、计费和无缝切换
C. Latze, U. Ultes-Nitsche
{"title":"Roaming, accounting and seamless handover in EAP-TLS authenticated networks","authors":"C. Latze, U. Ultes-Nitsche","doi":"10.1109/SOFTCOM.2008.4669457","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669457","url":null,"abstract":"The emergence of mobile phones with integrated 802.11 chipsets lead to the idea of replacing GSM calls with VOIP calls. Mutual authentication using EAP-TLS based protocols allows to automatically authenticate embedded devices at public wireless hotspots, which is one of the prerequisites in order to have a comfortable GSM-like 802.11 based setup. This work proposes a possible accounting and roaming scheme and discusses seamless handovers in EAP-TLS authenticated networks. It shows that EAP-TLS authenticated VOIP setups provide even more comfort for the user than GSM networks since there is the possibility to have one identity for every different operator that controls the hotspots.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115182608","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 new routing rotocol in Mobile Ad hoc Networks with selfish nodes 移动自组网中一种新的路由协议
F. Saremi, H. Mousavi, A. Movaghar
{"title":"A new routing rotocol in Mobile Ad hoc Networks with selfish nodes","authors":"F. Saremi, H. Mousavi, A. Movaghar","doi":"10.1109/SOFTCOM.2008.4669463","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669463","url":null,"abstract":"Mobile ad hoc networks (MANETs) are based on the assumption of that all participants in the network cooperate and forward packets towards the destinations. However, due to the limited nature of the nodespsila resources, a node may decide not to cooperate to save its resources while still using the network. Such behavior of some nodes may degrade the whole network performance. To cope with such a situation, we propose a Stable path, Low overhead, Truthful, and Cost efficient (SLTC) routing protocol which stimulates nodes to cooperate. SLTC utilizes the game theoretic notion of mechanism design. To the best of our knowledge, SLTC is the first protocol attaining the message complexity of O(nd), where n is the number of nodes, and d is the network diameter. The best previously proposed approaches in this area has the message complexity of O(n2 log n). In addition, SLTC considers path stability in order to deal with the mobility of the nodes in a better way.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116740411","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
Joint Source Channel Speech Decoding using long-term residual redundancy 联合源信道语音解码利用长期剩余冗余
A.M. Pourmir, F. Lahouti
{"title":"Joint Source Channel Speech Decoding using long-term residual redundancy","authors":"A.M. Pourmir, F. Lahouti","doi":"10.1109/SOFTCOM.2008.4669505","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669505","url":null,"abstract":"In this paper, we present a minimum mean squared error decoding scheme for reconstruction of encoded speech transmitted over a noisy channel, utilizing the residual redundancy due to the quasi-periodic property of voiced segments of speech. The proposed algorithm is in general applicable to any speech codec provided that the long-term memory is not exploited in the encoding process. An enabling step of the proposed solution is the pitch extraction based on the noisy source encoder output. This work is the first attempt in the concept of joint source channel decoding (JSCD) which uses the long-term residual redundancy of speech encoders output. Prior art has focused on the short term redundancy or the memory between successive symbols. Simulation results, based on the 32 kbps ADPCM codec of the ITU-T G.726 standard, indicate enhanced reconstruction performance when compared to the standard decoder.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123387845","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
Residual bandwidth as localized QoS routing metric 剩余带宽作为本地化QoS路由度量
A. Alzahrani, M. E. Woodward
{"title":"Residual bandwidth as localized QoS routing metric","authors":"A. Alzahrani, M. E. Woodward","doi":"10.1109/SOFTCOM.2008.4669465","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669465","url":null,"abstract":"Quality of service (QoS) routing has been proposed for supporting the requirements of network applications and satisfying connection constraints. A large amount of information needs to be exchanged periodically among routers. Therefore, in order to satisfy such requirements localized QoS routing algorithms have been proposed. This is where source nodes make routing decisions based on statistics collected locally. Using local information for routing avoids the overheads of exchanging global information with other nodes. In this paper we present a localized bandwidth-based QoS routing (BBR) algorithm, which relies on residual bandwidth that each path can support to make routing decisions. We compare our scheme with Credit Based Routing (CBR) and the commonly used global WSP routing scheme under different traffic loads and network topologies. We demonstrated through simulation that our scheme performs better than CBR and outperforms the WSP scheme in some network topologies, even for a small update interval of link state.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126459200","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
Evaluation of fuzzy clustering methods for segmentation of environmental images 环境图像分割的模糊聚类方法评价
B. Barišic, M. Bonkovic, V. Papic
{"title":"Evaluation of fuzzy clustering methods for segmentation of environmental images","authors":"B. Barišic, M. Bonkovic, V. Papic","doi":"10.1109/SOFTCOM.2008.4669496","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669496","url":null,"abstract":"The article compares three methods for segmentation of environmental images. Hue and saturation values of the image pixels were used as the input values for the clustering. The methods that have been examined are K-medoid, fuzzy Cmeans and Gustafson-Kessel. Results of the fuzzy clustering methods were compared with the results obtained with method using the mean-shift algorithm.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131302134","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
Implementation of a framework for a DHT-based Distributed Location Service 基于dht的分布式位置服务框架的实现
S. Cirani, L. Veltri
{"title":"Implementation of a framework for a DHT-based Distributed Location Service","authors":"S. Cirani, L. Veltri","doi":"10.1109/SOFTCOM.2008.4669495","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669495","url":null,"abstract":"Distributed hash tables (DHTs) are structured peer-to-peer systems in which a number of peer nodes collectively cooperate to provide a key/value pair information storage and retrieval service. All DHTs are characterized by desirable features such as scalability, fault tolerance, and self organization. Each DHT node is responsible for maintaining a subset of the stored information, which depends on the specific DHT algorithm. Many Internet-based applications strongly rely on a location service (LS), such as DNS, in order to map a URI to one or more IP addresses (and port numbers) that specify where the resource identified by the URI can actually be accessed. However, location services typically introduce centralization points into the architectures they are used in and therefore expose the overall system to possible failures. Because of their nature, DHT appear to be a perfect mean for setting up a distributed location service (DLS). In this paper we present a Java-based framework that can be used for building a DLS independent from the specific DHT algorithm and communication protocol adopted.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133722968","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}
引用次数: 17
Scheduling in Performance Test environment 性能测试环境中的调度
F. Bozoki, T. Csondes
{"title":"Scheduling in Performance Test environment","authors":"F. Bozoki, T. Csondes","doi":"10.1109/SOFTCOM.2008.4669519","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669519","url":null,"abstract":"Nowadays automatic testing is getting more and more important in the telecommunication world. The sooner a fault is discovered the cheaper it is to correct it. If a fault is discovered during the development process the cost of the correction is significantly smaller. There are different test strategies, with different approaches like, conformance test, system test and performance test. The system test takes place after a successful conformance test. Performance test is analyzing the load characteristics of the system under test (SUT). In this article we describe the main attributes of performance testing, where the main challenge is to generate the expected load without having as complex hardware as the SUT is itself. Most of the papers, presented in this subject are focusing on the characteristics of the generated load, but not the way how to achieve it. These papers usually have the assumption that the load can be generated by deploying more hardware resources. Other papers propose new extensions for test description languages such SDL or TTCN-3. In this article we intend to describe a finite state machine (FSM) based model and an algorithm which improves the efficiency of scheduling in this performance test environment. We present an architecture based on the so called virtual threads, an algorithm to optimize the scheduling between these threads, and an example to demonstrate the algorithm.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114345528","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
Identifier based key distribution protocol for Wireless Sensor Networks 基于标识符的无线传感器网络密钥分配协议
M. Adeel, M. Hussain, U. Beenish, S. Mehwish, L. Tokarchuk, A. Shahzad
{"title":"Identifier based key distribution protocol for Wireless Sensor Networks","authors":"M. Adeel, M. Hussain, U. Beenish, S. Mehwish, L. Tokarchuk, A. Shahzad","doi":"10.1109/SOFTCOM.2008.4669473","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669473","url":null,"abstract":"Wireless Sensor Networks are being widely deployed for their inimitable characteristics. Besides benefiting through the features of scalability and coverage, these networks are prone to many security threats including Denial of Service (DoS) attacks. There are many aspects of security in sensor networks but our work focuses on key distribution and sharing protocols. We conduct a critical study of different key distribution & sharing protocols and analyze them for the possibilities of DoS attacks. We also propose Identifier Based Key Distribution Protocol that provides the solution for varied Battery Exhaustion Attacks in these protocols.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114893169","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
Conceptual object model of a classified electronic documents information system 分类电子文档信息系统的概念对象模型
I. Matić, Z. Skocir
{"title":"Conceptual object model of a classified electronic documents information system","authors":"I. Matić, Z. Skocir","doi":"10.1109/SOFTCOM.2008.4669512","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669512","url":null,"abstract":"Business organisations in their everyday operations implement a degree of information classification with regard to the level of secrecy. As a result of that process, a number of classified information in electronic format is created. The information requires a fulfilment of strict security criteria with the aim of preserving its confidentiality, integrity and availability. We believe that the only safe and dependable manner of handling such classified electronic documents is through special information systems used exclusively for managing the above-mentioned type of sensitive data. Thus, this paper analyses the modelling of a conceptual object model of an information system used for managing classified electronic documents.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129799173","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
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学术官方微信
小红书