2011 18th International Conference on Telecommunications最新文献_第2页

Multi-constraint physical topology design for all optical networks 全光网络的多约束物理拓扑设计

2011 18th International Conference on Telecommunications Pub Date : 2011-05-08 DOI: 10.1109/CTS.2011.5898970

N. Dharmaweera, R. Parthiban, Y. Sekercioglu

引用次数: 5

Selective sub-carrier relaying and power allocation for multi-relay-assisted cooperative OFDM systems with outdated CSI 具有过时CSI的多中继辅助合作OFDM系统的选择性子载波中继和功率分配

2011 18th International Conference on Telecommunications Pub Date : 2011-05-08 DOI: 10.1109/CTS.2011.5898982

S. Biyanwilage, U. Gunawardana, R. Liyanapathirana

引用次数: 2

AD-ZRP: Ant-based routing algorithm for dynamic wireless sensor networks AD-ZRP:基于蚁群的动态无线传感器网络路由算法

2011 18th International Conference on Telecommunications Pub Date : 2011-05-08 DOI: 10.1109/CTS.2011.5898910

Alexandre Massayuki Okazaki, A. A. Fröhlich

{"title":"AD-ZRP: Ant-based routing algorithm for dynamic wireless sensor networks","authors":"Alexandre Massayuki Okazaki, A. A. Fröhlich","doi":"10.1109/CTS.2011.5898910","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898910","url":null,"abstract":"In this paper, we introduce Ant-based Dynamic Zone Routing Protocol (AD-ZRP), a self-configuring reactive routing protocol for Wireless Sensor Networks (WSNs). Our approach is based on HOPNET, a multi-hop and self-configuring hybrid routing protocol based on Ant Colony Optimization (ACO) and Zone Routing Protocol (ZRP) for Mobile Ad Hoc Networks (MANETs). There are many challenges in designing routing protocols for WSNs, and topology change is a factor that affects the network lifetime of WSNs. And with the robustness of routing protocols for MANETs, dealing with dynamic topologies becomes a less arduous task. However, WSNs tend to be more stringent than MANETs in respect to resource availability, then the AD-ZRP design must consider several restrictions including energy consumption, processing power, memory, and bandwidth. AD-ZRP also consists of ZRP, but it is based on dynamic zones which, acting together with ACO, allows us to deal with the restrictions of WSNs and yet improve the route discovery and the route maintenance through pheromone. We have evaluated and compared our algorithm to the original HOPNET and obtained better results in terms of data delivery ratio, routing overhead, and congestion avoidance for environments of dynamic topology.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129645460","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

Combating persistent adversaries in wireless sensor networks using directional antennas 利用定向天线对抗无线传感器网络中的顽固对手

2011 18th International Conference on Telecommunications Pub Date : 2011-05-08 DOI: 10.1109/CTS.2011.5898964

Eliana Stavrou, A. Pitsillides

{"title":"Combating persistent adversaries in wireless sensor networks using directional antennas","authors":"Eliana Stavrou, A. Pitsillides","doi":"10.1109/CTS.2011.5898964","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898964","url":null,"abstract":"Security is an important property in applications offering services in mission-critical areas, such as in healthcare, military, transportation, etc. Wireless sensor networks (WSN) support the mission of these applications by monitoring the environment and reporting observations to appropriate authorities that are responsible for decision-making. Often, their operation can be at risk by adversaries that launch attacks against the WSN with the aim of compromising the reliability and availability of the network and the respective application. The outcome of an attack highly depends on the experience of the adversary and his capabilities in terms of programming skills, security knowledge and resources. From the network perspective, the challenge is to reliably recover to a normal operation as soon as the adversary is been detected and allow for packet delivery to destination. The challenge is even greater in the presence of adversaries that adapt their intrusion strategy to break the deployed recovery countermeasures and continue affecting the network. Proposed recovery countermeasures typically assume the use of omni-directional antennas, which cannot take advantage of antenna directivity in order to manipulate communication paths between WSN nodes for the purpose of (physically) bypassing an adversary. This paper presents an intrusion recovery protocol in WSNs that uses directional antennas to create controlled communication paths, thus routing, and enhancing the reliability, self-healingness and resilience of the network. The proposed protocol is implemented within the AODV context and evaluated using ns-2. We demonstrate the effectiveness of the proposed protocol to deliver packets to the destination in the presence of multiple persistent adversaries that deploy different types of simple to extended attacks.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127100372","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

PAPR reduction of OFDM signals using harmony search algorithm 利用和谐搜索算法降低OFDM信号的PAPR

2011 18th International Conference on Telecommunications Pub Date : 2011-05-08 DOI: 10.1109/CTS.2011.5898991

Emad Meimand Kermani, H. Salehinejad, S. Talebi

引用次数: 11

Performance evaluation of pre-computation algorithms for inter-domain QoS routing 域间QoS路由预计算算法的性能评价

2011 18th International Conference on Telecommunications Pub Date : 2011-05-08 DOI: 10.1109/CTS.2011.5898944

A. Frikha, S. Lahoud

{"title":"Performance evaluation of pre-computation algorithms for inter-domain QoS routing","authors":"A. Frikha, S. Lahoud","doi":"10.1109/CTS.2011.5898944","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898944","url":null,"abstract":"Inter-domain QoS routing is a very challenging problem area. This problem combines the complexity of QoS routing, with the limitations of inter-domain routing, such as domain heterogeneity and information confidentiality. The pre-computation offers a very promising solution for addressing this problem. Although the pre-computation scheme has been investigated in several previous studies for a single routing domain, applying pre-computation on an inter-domain level is not straightforward and necessitates deeper investigation. In this work, we study different algorithms for QoS routing based on pre-computation. First, we investigate an exact algorithm. This algorithm provides an optimal solution for the QoS routing problem. However, its application in large scale networks is not always practical. Second, heuristic solutions are also investigated in this work. Particularly, a detailed study of the ID-MEFPA and the ID-PPPA heuristics is provided. Analytical studies and extensive simulations confirm that the exact algorithm achieves the best success rate, but has a very high computational complexity. The ID-MEFPA heuristic has a lower complexity and provides a success rate always close to the exact algorithm. When inter-domain connectivity is high, the ID-PPPA heuristic is the most appropriate with the lowest computation complexity and a success rate very close to the exact algorithm.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"59 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129271572","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

An amendment to IEEE 802.17 (RPR) for wireless transport 针对无线传输的IEEE 802.17 (RPR)的修订

2011 18th International Conference on Telecommunications Pub Date : 2011-05-08 DOI: 10.1109/CTS.2011.5898966

S. Athanasiadou, G. Stamatelos

引用次数: 0

On-line optimization and control of the buffer sizes in a cellular network communication system 蜂窝网络通信系统中缓冲区大小的在线优化与控制

2011 18th International Conference on Telecommunications Pub Date : 2011-05-08 DOI: 10.1109/CTS.2011.5898942

M. Markou, C. Panayiotou

{"title":"On-line optimization and control of the buffer sizes in a cellular network communication system","authors":"M. Markou, C. Panayiotou","doi":"10.1109/CTS.2011.5898942","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898942","url":null,"abstract":"Motivated by the cellular model paradigm, this paper develops a distributed on-line algorithm for determining the values of the control parameters (in this case, the buffer sizes) that optimize some predefined performance metrics of interest (e.g. average queue length, average loss probability). Stochastic Fluid Model (SFM) framework is adopted to model the queuing systems. Using this framework, we derive Infinitesimal Perturbation Analysis (IPA) estimates of the performance metrics of interest with respect to the control parameters. These estimates are shown to be unbiased which means that they can be used in a Stochastic Approximation (SA) based algorithm to drive the system to the optimal solution. Subsequently, these estimators are evaluated based on data observed from the sample path of the “real” system and used in the SA algorithm to dynamically control the buffer sizes in a distributed manner, allowing the network to work continuously at an optimal point. The correctness of the algorithm is verified through simulations using a network model of two tightly coupled nodes. The contribution of this paper is that it derives the fluid-based IPA algorithms for the specific communication network investigated, which can eventually lead to distributed protocols for controlling the buffer size of the nodes of a cellular network to optimize the overall network's performance.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122674260","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

HomeWeb: An application framework for Web-based smart homes HomeWeb:基于web的智能家居的应用程序框架

2011 18th International Conference on Telecommunications Pub Date : 2011-05-08 DOI: 10.1109/CTS.2011.5898905

A. Kamilaris, V. Trifa, A. Pitsillides

引用次数: 81

User dependent cryptography for security in future mobile telecommunication systems 未来移动通信系统中基于用户的安全加密技术

2011 18th International Conference on Telecommunications Pub Date : 2011-05-08 DOI: 10.1109/CTS.2011.5898962

Ahmad Sabouri, N. Komninos, C. Douligeris

引用次数: 0