发布求助
文献互助 智能选刊 最新文献

2008 International Symposium on Telecommunications最新文献

筛选
英文 中文
Energy efficient and congestion aware routing algorithms for Wireless Sensor Networks connected as Hypercube 连接为Hypercube的无线传感器网络的节能和拥塞感知路由算法
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651322
A. Mohajerzadeh, M. Yaghmaee, Zahra Eskandari, Hossein Deldari
{"title":"Energy efficient and congestion aware routing algorithms for Wireless Sensor Networks connected as Hypercube","authors":"A. Mohajerzadeh, M. Yaghmaee, Zahra Eskandari, Hossein Deldari","doi":"10.1109/ISTEL.2008.4651322","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651322","url":null,"abstract":"Wireless Sensor Networks (WSN) have been noticed and researched nowadays. These new type of networks have unique characteristics. WSNs have different limitations such as computational power, storage capacity, energy source and etc. The main constraint of wireless sensor networks is energy. The energy source of sensor nodes is limited and not rechargeable. Therefore, optimizing consumption of energy is essential for WSNs protocols. Hypercube topology is very popular in distributed environments. In last few years, many different topology specific routing algorithms have been designed for wireless sensor networks, but to the best of our knowledge, none of them consider hypercube as their topology. In this paper, different routing algorithms are proposed for WSN with hypercube topology. The performance of all proposed routing algorithms is evaluated, and the best algorithm which can provide more fairness is introduced. Simulation results which are represented in last section of this paper are the base of our conclusions. The main goal of this paper is to find a fair energy aware routing algorithm for wireless sensor network connected as hypercube.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115402003","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
Two Layer Secure Network Coding - (2-LSNC) 两层安全网络编码- (2-LSNC)
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651263
M. Hassanzadeh, M. Ravanbakhsh, O. Ytrehus
{"title":"Two Layer Secure Network Coding - (2-LSNC)","authors":"M. Hassanzadeh, M. Ravanbakhsh, O. Ytrehus","doi":"10.1109/ISTEL.2008.4651263","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651263","url":null,"abstract":"Two important parameters for network users are security and cost of network resource utilization. From a cost perspective, network coding promises a higher gain compared to ordinary routing. In this paper, a new model for secure network coding is proposed. This model is named two layer secure network coding or 2-LSNC. The advantage of our new model is three-fold: 1) The number of links required for the wiretapper to extract the secret is improved. 2) For scalability analysis we have established a metric called level of security, and we demonstrate that our model scales well with respect to this metric. 3) The tradeoff between cost and the level of security is analyzed. In our model, this cost is lower than in Cai and Yeungpsilas model when the network size and the number of sinks reaches a critical point. Our approach is compared to other models by simulation.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123069302","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
A modified very fast Simulated Annealing algorithm 一种改进的快速模拟退火算法
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651272
M. Vakil-Baghmisheh, A. Navarbaf
{"title":"A modified very fast Simulated Annealing algorithm","authors":"M. Vakil-Baghmisheh, A. Navarbaf","doi":"10.1109/ISTEL.2008.4651272","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651272","url":null,"abstract":"Simulated Annealing algorithm (SA) is a local search method invented to avoid local minima. The main shortcomings of this algorithm are its slowness and difficult tuning of its parameters. It is claimed that newer versions of fast SA (FSA) and very fast SA (VFSA) have resolved these problems, but these algorithms have some problems such as estimation of initial temperature and neighborhood generation. In this paper a modified form of VFSA is represented in which the standard deviation of the cost function is used for the estimation of initial temperature and also some modifications is done in neighborhood generation which made the algorithm more accurate. This algorithm is compared with some evolutionary-based algorithms and as simulation results show, it can optimize the complex problems with high accuracy in a feasible time.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123510993","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}
引用次数: 22
A comparison of rerouting methods in Network Centric Environments based on Swarm topology 网络中心环境下基于群拓扑的重路由方法比较
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651358
M. Fesharaki, M. Tavanpour, S. Saberi, A. Hedayati
{"title":"A comparison of rerouting methods in Network Centric Environments based on Swarm topology","authors":"M. Fesharaki, M. Tavanpour, S. Saberi, A. Hedayati","doi":"10.1109/ISTEL.2008.4651358","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651358","url":null,"abstract":"Due to vast use of network centric environments in critical applications, reliability and availability are the essential characteristics of these networks. A fundamental requirement is the ability to keep the relation between the network elements even in any malfunctions in network topology. Rerouting is a suitable response to this issue. In this paper, we consider several retrieval and rerouting methods based on MPLS and normal IP in Swarm topology. Besides, the method is simulated in NS2 in order to evaluate the performance of these methods and calculate and compare their quality of service (QoS) parameters. Results depicts that in the beginning of simulation, when the network traffic load is low, the methods which reroute after a fault occurrence represent much better QoS. However, it decreases in the situation in which the traffic load increases. In addition, the methods which provide the alternate route before misconduct represent static and constant behavior.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122090071","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 Fuzzy Energy-based extension to AODV routing 基于模糊能量的AODV路由扩展
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651330
M. N. Torshiz, H. Amintoosi, A. Movaghar
{"title":"A Fuzzy Energy-based extension to AODV routing","authors":"M. N. Torshiz, H. Amintoosi, A. Movaghar","doi":"10.1109/ISTEL.2008.4651330","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651330","url":null,"abstract":"Ad hoc wireless networks are power constrained since nodes operate with a limited battery energy. To maximize the lifetime of these networks, transactions through mobile nodes must be controlled such that the power dissipation rates of all nodes are rarely the same. This paper presents a fuzzy extension to ad hoc on demand distance vector routing protocol with power considerations. The path selected by conventional AODV routing protocol is not the optimal path because AODV selects the first path that has been found which is not necessarily the best. Routing optimality affects the network performance, especially when the load is high. Longer route consumes more bandwidth, produces more delay, and is more prone to disconnections. Fuzzy energy-based AODV (FE-AODV) is a technique that monitors the routes and tries to select the optimal route on the basis of the minimum bandwidth and hop count of each route. It also tries to increase the network life time so that the power dissipation rates of all nodes are rarely the same. The proposed fuzzy logic method is evaluated and compared with conventional method using NS2.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122566879","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
M-ary Frequency Shifted Reference for Ultra-wideband communication systems 超宽带通信系统的多频移基准
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651309
Saeed Manaffam, M. Nasiri-Kenari
{"title":"M-ary Frequency Shifted Reference for Ultra-wideband communication systems","authors":"Saeed Manaffam, M. Nasiri-Kenari","doi":"10.1109/ISTEL.2008.4651309","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651309","url":null,"abstract":"In this paper, we propose a new method of signaling based on Frequency Shifted Reference (FSR) for Ultra-wideband (UWB) communication system in which the channel estimation is not required in the decoder. This signaling is more like orthogonal signaling of frequency shift keying (FSK), and has its advantage of non-coherent detection; so as a result, one of the major drawbacks of previously introduced FSR-UWB system can be eliminated. It is shown that in binary signaling the proposed method achieves similar performance as conventional Transmitted Reference UWB (TR-UWB) systems without any rate loss. Also, it is demonstrated that the proposed method outperforms the conventional FSR-UWB system in M-ary signaling for M ges 4. This way, the proposed method provides multi-rate transmission capabilities as well.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"2022 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128060593","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
Securing wireless sensor networks against broadcast attacks 保护无线传感器网络免受广播攻击
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651270
Mohammad Sayad Haghighi, Kamal Mohamedpour
{"title":"Securing wireless sensor networks against broadcast attacks","authors":"Mohammad Sayad Haghighi, Kamal Mohamedpour","doi":"10.1109/ISTEL.2008.4651270","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651270","url":null,"abstract":"Wireless sensor networks, applied for monitoring physical environments, have recently emerged as an important application of the ad hoc networks paradigm. Low processing power and wireless connectivity make such networks vulnerable to various types of attacks. The dense deployment of sensors along with the protocol deficiencies, make broadcast attacks feasible. The current solutions for these types of attacks are mainly cryptographic and suffer from either heavy computational complexity or lack of mobility support. In this paper we propose an energy efficient method to fortify sensor networks against broadcast attacks using some key features of such networks like small transmission range and low reception-sensitivity. The main idea relies on modifying the reply timings of current MAC sub-layer protocols and embedding a two or three-way handshake protocol in broadcast scenarios so that the adversary receives a negative feedback from the network in response to his greediness in infecting nodes. The simulations confirm the efficiency of this countermeasure applied to the IEEE 802.15.4.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130200315","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}
引用次数: 15
A novel approach for providing QoS with network coding 一种利用网络编码提供QoS的新方法
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651344
A. Salavati, B. Khalaj, M. Aref
{"title":"A novel approach for providing QoS with network coding","authors":"A. Salavati, B. Khalaj, M. Aref","doi":"10.1109/ISTEL.2008.4651344","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651344","url":null,"abstract":"In this paper, we present a decentralized algorithm that computes minimum cost QoS flow subgraphs in network coded multicast networks. These subgraphs are minimum cost solutions that also satisfy user-specified QoS constraints, specifically handling elastic rate and delay demands. Although earlier network coding algorithms in this area have only demonstrated QoS improvements, the proposed QoS network coding is clearly different in the sense that it guarantees that given QoS constraints are met over the network.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123765452","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 reconfigurable hybrid hardware/software architecture for EFM/Ethernet 用于EFM/Ethernet的可重构混合硬件/软件体系结构
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651348
A. Vosoughi, M. Sedighi
{"title":"A reconfigurable hybrid hardware/software architecture for EFM/Ethernet","authors":"A. Vosoughi, M. Sedighi","doi":"10.1109/ISTEL.2008.4651348","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651348","url":null,"abstract":"With the growing demands of data network users, the existing broadband access technologies may not satisfy subscriberspsila expectations any more. Multiple protocol translations in access networks reduce the network performance considerably. EFM (Ethernet in the First Mile) has been introduced to mitigate this problem by extending Ethernet from local networks to access networks. EFM and Ethernet are similar in data link layer; hence, making an EFM/Ethernet reconfigurable system appears to be cost-effective. On the other hand, hardware/software co-design is usually a preferred approach in system design when we seek an optimized solution. In this paper, a hybrid hardware/software architecture is proposed for a reconfigurable EFM/Ethernet transceiver. The reconfigurability of the end-system was taken into account while doing hardware/software partitioning. Our proposed architecture has been validated through experiments. The results show that the proposed architecture is a viable solution to be implemented and used by broadband access networkspsila subscribers.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121181665","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
Hierarchical mixture clustering and its application to GMM based text independent speaker identification 层次混合聚类及其在基于GMM的文本独立说话人识别中的应用
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651403
R. Saeidi, Hamid Reza Mohammadi, T. Ganchev, R. Rodman
{"title":"Hierarchical mixture clustering and its application to GMM based text independent speaker identification","authors":"R. Saeidi, Hamid Reza Mohammadi, T. Ganchev, R. Rodman","doi":"10.1109/ISTEL.2008.4651403","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651403","url":null,"abstract":"In this paper, we propose a hierarchical mixture clustering method and investigate its application for complexity reduction of a GMM based speaker identification system. We show that by using GMM-HMC one can cluster speakers more accurately than that of a sorted GMM with the same acceleration rate. The system was tested on a universal background model-Gaussian mixture model with KL-divergence as the distance measure. While the proposed systempsilas performance is slightly inferior to the baseline system, its comparatively smaller computational load provides the potential to develop systems with higher performance.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125717510","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
首页 上一页 下一页 尾页
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学术官方微信