Pub Date : 2011-05-08DOI: 10.1109/CTS.2011.5898970
N. Dharmaweera, R. Parthiban, Y. Sekercioglu
In optical networks, physical topology design is critically important, and key underlying parameters to be considered are cost, power consumption, and resilience. Optimization of these parameters is a difficult problem to solve. In this paper, we present a new heuristic algorithm that successfully minimizes the cost and power consumption of an optical network without compromising its resilience. The algorithm's results were demonstrated against two topologies obtained from real-life optical networks covering Australia.
{"title":"Multi-constraint physical topology design for all optical networks","authors":"N. Dharmaweera, R. Parthiban, Y. Sekercioglu","doi":"10.1109/CTS.2011.5898970","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898970","url":null,"abstract":"In optical networks, physical topology design is critically important, and key underlying parameters to be considered are cost, power consumption, and resilience. Optimization of these parameters is a difficult problem to solve. In this paper, we present a new heuristic algorithm that successfully minimizes the cost and power consumption of an optical network without compromising its resilience. The algorithm's results were demonstrated against two topologies obtained from real-life optical networks covering Australia.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"1 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":"125817417","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}
Pub Date : 2011-05-08DOI: 10.1109/CTS.2011.5898982
S. Biyanwilage, U. Gunawardana, R. Liyanapathirana
In this paper, we investigate the relay selection, sub-carrier pairing, and power allocation problems in a two-hop, multi-relay-assisted cooperative OFDM system with amplify-and-forward (AF) relays. We study the application of selective sub-carrier relaying, where the relays collectively forward only a subset of the available sub-carriers, in a multi-relay-assisted environment. Transmit power allocation is performed such that the end-to-end system capacity is maximized under individual power constraints at each node. We evaluate the system performance when the available channel state information (CSI) is outdated and compare the performance with the all sub-carrier relaying method.
{"title":"Selective sub-carrier relaying and power allocation for multi-relay-assisted cooperative OFDM systems with outdated CSI","authors":"S. Biyanwilage, U. Gunawardana, R. Liyanapathirana","doi":"10.1109/CTS.2011.5898982","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898982","url":null,"abstract":"In this paper, we investigate the relay selection, sub-carrier pairing, and power allocation problems in a two-hop, multi-relay-assisted cooperative OFDM system with amplify-and-forward (AF) relays. We study the application of selective sub-carrier relaying, where the relays collectively forward only a subset of the available sub-carriers, in a multi-relay-assisted environment. Transmit power allocation is performed such that the end-to-end system capacity is maximized under individual power constraints at each node. We evaluate the system performance when the available channel state information (CSI) is outdated and compare the performance with the all sub-carrier relaying method.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"40 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":"129710557","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}
Pub Date : 2011-05-08DOI: 10.1109/CTS.2011.5898910
Alexandre Massayuki Okazaki, A. A. Fröhlich
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.
{"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}
Pub Date : 2011-05-08DOI: 10.1109/CTS.2011.5898964
Eliana Stavrou, A. Pitsillides
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.
{"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}
Pub Date : 2011-05-08DOI: 10.1109/CTS.2011.5898991
Emad Meimand Kermani, H. Salehinejad, S. Talebi
Orthogonal frequency division multiplexing (OFDM) is one of the widely used multiplexing techniques in wireless communications and especially cognitive radio networks. One of the key challenges of this technique is its high peak to average power ratio (PAPR) of the transmitted signal. This paper, introduces a new approach to PAPR reduction of OFDM signals using harmony search algorithm (HSA) based on the partial transmit sequence (PTS) method. The simulation results demonstrate that the proposed algorithm has better PAPR reduction performance as an accurate and low complexity approach for OFDM systems.
{"title":"PAPR reduction of OFDM signals using harmony search algorithm","authors":"Emad Meimand Kermani, H. Salehinejad, S. Talebi","doi":"10.1109/CTS.2011.5898991","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898991","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) is one of the widely used multiplexing techniques in wireless communications and especially cognitive radio networks. One of the key challenges of this technique is its high peak to average power ratio (PAPR) of the transmitted signal. This paper, introduces a new approach to PAPR reduction of OFDM signals using harmony search algorithm (HSA) based on the partial transmit sequence (PTS) method. The simulation results demonstrate that the proposed algorithm has better PAPR reduction performance as an accurate and low complexity approach for OFDM systems.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"288 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":"132458199","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}
Pub Date : 2011-05-08DOI: 10.1109/CTS.2011.5898944
A. Frikha, S. Lahoud
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.
{"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}
Pub Date : 2011-05-08DOI: 10.1109/CTS.2011.5898966
S. Athanasiadou, G. Stamatelos
The Resilient Packet Ring (RPR) is a packet network technology designed to provide broadband traffic transport in a metropolitan area according to IEEE 802.17 specifications. Its advantages include flexibility in bandwidth allocation, fairness and traffic shaping criteria for the acceptance of elastic transit traffic, as well as highly reliable transport. Here we focus on possible future amendments to these specifications (such as inclusion of efficient coding / modulation schemes) that would allow RPRs to support reliably wireless traffic as well.
{"title":"An amendment to IEEE 802.17 (RPR) for wireless transport","authors":"S. Athanasiadou, G. Stamatelos","doi":"10.1109/CTS.2011.5898966","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898966","url":null,"abstract":"The Resilient Packet Ring (RPR) is a packet network technology designed to provide broadband traffic transport in a metropolitan area according to IEEE 802.17 specifications. Its advantages include flexibility in bandwidth allocation, fairness and traffic shaping criteria for the acceptance of elastic transit traffic, as well as highly reliable transport. Here we focus on possible future amendments to these specifications (such as inclusion of efficient coding / modulation schemes) that would allow RPRs to support reliably wireless traffic as well.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"144 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":"122550935","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}
Pub Date : 2011-05-08DOI: 10.1109/CTS.2011.5898942
M. Markou, C. Panayiotou
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.
{"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}
Pub Date : 2011-05-08DOI: 10.1109/CTS.2011.5898905
A. Kamilaris, V. Trifa, A. Pitsillides
Household appliances are being equipped with embedded micro-controllers and wireless transceivers, offering smart behavior. These augmented appliances form wireless networks and transform residential areas into smart homes. Advancements such as the effective penetration of the Internet in embedded computing and the promising practice of the Web of Things, allow the realization of Web-oriented smart homes. In a previous work, we developed a Web-based application framework for smart homes, supporting concurrent interaction from multiple family members. In this paper, we improve the functionality of our system by including a 6LoWPAN-based wireless sensor network inside the home environment, addressing issues such as device discovery and service description. Web techniques such as HTTP caching and push messaging, facilitate the efficient operation of a fully Web-based smart home. Through a technical evaluation, we show the benefits of directly Web-enabling embedded sensors in terms of performance and energy conservation. The development of a Web-based graphical application abstracts home automation procedure for typical residents.
{"title":"HomeWeb: An application framework for Web-based smart homes","authors":"A. Kamilaris, V. Trifa, A. Pitsillides","doi":"10.1109/CTS.2011.5898905","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898905","url":null,"abstract":"Household appliances are being equipped with embedded micro-controllers and wireless transceivers, offering smart behavior. These augmented appliances form wireless networks and transform residential areas into smart homes. Advancements such as the effective penetration of the Internet in embedded computing and the promising practice of the Web of Things, allow the realization of Web-oriented smart homes. In a previous work, we developed a Web-based application framework for smart homes, supporting concurrent interaction from multiple family members. In this paper, we improve the functionality of our system by including a 6LoWPAN-based wireless sensor network inside the home environment, addressing issues such as device discovery and service description. Web techniques such as HTTP caching and push messaging, facilitate the efficient operation of a fully Web-based smart home. Through a technical evaluation, we show the benefits of directly Web-enabling embedded sensors in terms of performance and energy conservation. The development of a Web-based graphical application abstracts home automation procedure for typical residents.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"41 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":"132339029","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}
Pub Date : 2011-05-08DOI: 10.1109/CTS.2011.5898962
Ahmad Sabouri, N. Komninos, C. Douligeris
In this paper we propose a user dependent scheme for enhancing security of the transmitted content in the future telecommunication systems. In order to achieve a higher level of security we introduce a scheme where the user identity gets involved in the encryption/decryption processes using an additional component for the block cipher which represents the user's behavioural model. Applying such a scheme, in addition to introducing more difficulties to an attacker due to the user dependency of the cipher algorithm, gives the mobile operator the opportunity to ensure that a licensed service has not been shared by the customer. To show the feasibility of our approach we use the concept of invertible Boolean functions as an example.
{"title":"User dependent cryptography for security in future mobile telecommunication systems","authors":"Ahmad Sabouri, N. Komninos, C. Douligeris","doi":"10.1109/CTS.2011.5898962","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898962","url":null,"abstract":"In this paper we propose a user dependent scheme for enhancing security of the transmitted content in the future telecommunication systems. In order to achieve a higher level of security we introduce a scheme where the user identity gets involved in the encryption/decryption processes using an additional component for the block cipher which represents the user's behavioural model. Applying such a scheme, in addition to introducing more difficulties to an attacker due to the user dependency of the cipher algorithm, gives the mobile operator the opportunity to ensure that a licensed service has not been shared by the customer. To show the feasibility of our approach we use the concept of invertible Boolean functions as an example.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"160 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":"115600495","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：