Pub Date : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.26
Lydia Michotte, T. Vergnaud, P. Feiler, R. France
Dependable embedded software system design is fastidious because designers have to understand and handle multiple, interdependent, pervasive dependability concerns such as fault tolerance, timeliness, performance, security. Because these concerns tend to crosscut application architecture, understanding and changing their descriptions can be difficult. Separating theses concerns at architectural level allow the designers to locate them, to understand them and thus to preserve the required properties when making the change in order to keep the architecture consistent. That separation of concerns leads to better understanding, reuse, analysis and evolution of these concerns during design. The Architecture Analysis and Design Language (AADL) is a standard architecture description language in use by a number of organizations around the world to design, analyze embedded software architectures and generate application code. In this paper we explain how aspect oriented modeling (AOM) techniques and AADL can be used to model dependability aspects of component architecture separately from other aspects. The AOM architectural model used to illustrate the approach in this paper consists of a component primary view describing the base architecture and a component template aspect model describing a fault tolerance concern that provides error detection and recovery services.
{"title":"Aspect Oriented Modeling of Component Architectures Using AADL","authors":"Lydia Michotte, T. Vergnaud, P. Feiler, R. France","doi":"10.1109/NTMS.2008.ECP.26","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.26","url":null,"abstract":"Dependable embedded software system design is fastidious because designers have to understand and handle multiple, interdependent, pervasive dependability concerns such as fault tolerance, timeliness, performance, security. Because these concerns tend to crosscut application architecture, understanding and changing their descriptions can be difficult. Separating theses concerns at architectural level allow the designers to locate them, to understand them and thus to preserve the required properties when making the change in order to keep the architecture consistent. That separation of concerns leads to better understanding, reuse, analysis and evolution of these concerns during design. The Architecture Analysis and Design Language (AADL) is a standard architecture description language in use by a number of organizations around the world to design, analyze embedded software architectures and generate application code. In this paper we explain how aspect oriented modeling (AOM) techniques and AADL can be used to model dependability aspects of component architecture separately from other aspects. The AOM architectural model used to illustrate the approach in this paper consists of a component primary view describing the base architecture and a component template aspect model describing a fault tolerance concern that provides error detection and recovery services.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115987060","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.89
M. Elboukhari, A. Azizi, M. Azizi
This paper presents a methodology for analyzing quantum information systems, based on model checking; particularly we are interested in the protocol of quantum key distribution B92. It has been proved that this protocol is unconditionally secure against all kinds of attacks according to the information theory, but this security proof is not easily adaptable to practical scenarios. Our approach is based on probabilistic model checking; using the PRISM tool, we show that the protocol B92 fulfilled specific security properties.
{"title":"Security Oriented Analysis of B92 by Model Checking","authors":"M. Elboukhari, A. Azizi, M. Azizi","doi":"10.1109/NTMS.2008.ECP.89","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.89","url":null,"abstract":"This paper presents a methodology for analyzing quantum information systems, based on model checking; particularly we are interested in the protocol of quantum key distribution B92. It has been proved that this protocol is unconditionally secure against all kinds of attacks according to the information theory, but this security proof is not easily adaptable to practical scenarios. Our approach is based on probabilistic model checking; using the PRISM tool, we show that the protocol B92 fulfilled specific security properties.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129466549","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.60
Abolfazl Asudeh, A. Movaghar
Nowadays, wireless sensor networks are known as a new challenge in network science. New features of these networks have made it impossible to use the traditional routing protocols. The most important challenge of these networks is the limited energy of nodes. In this paper, we will introduce MEHR as a multi-hop location-unaware hierarchical routing protocol to decrease the energy consumption in nodes, and to increase the network lifetime, we also apply MEHR to reach to a scalable routing. We will introduce a new factor to select candidate nodes and to send intra-cluster messages. We will use place-advertisement messages of sink, and a limiting parameter and also overhearing concept to create cluster hierarchies with no extra message.
{"title":"MEHR: Multi-Hop Energy-Aware Hierarchical Routing for Wireless Sensor Networks","authors":"Abolfazl Asudeh, A. Movaghar","doi":"10.1109/NTMS.2008.ECP.60","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.60","url":null,"abstract":"Nowadays, wireless sensor networks are known as a new challenge in network science. New features of these networks have made it impossible to use the traditional routing protocols. The most important challenge of these networks is the limited energy of nodes. In this paper, we will introduce MEHR as a multi-hop location-unaware hierarchical routing protocol to decrease the energy consumption in nodes, and to increase the network lifetime, we also apply MEHR to reach to a scalable routing. We will introduce a new factor to select candidate nodes and to send intra-cluster messages. We will use place-advertisement messages of sink, and a limiting parameter and also overhearing concept to create cluster hierarchies with no extra message.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129941811","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.34
Jianjin Li, K. Hou, Haiying Zhou, Xunxing Diao
MANET marks the new age of the modern communication and it is a key technology to solve many applications such as telemedicine, environment monitoring, intelligent transport system (inter-vehicle communication) etc. In this paper a new MANET protocol dedicated to intelligent transport system: CIVIC (communication inter vehicule intelligente et cooperative) is described. CIVIC is a context aware routing protocol taking into account the location of each mobile node, road traffic, geographic environment (road map) etc. Moreover, CIVIC is implemented to support infrastructure and ad-hoc network, hybrid MANET protocol, and multi- support wireless access mediums. In this paper, we introduce the different worldwide leading research projects dedicated to inter- vehicle communication, the key features of CIVIC, the implementation of CIVIC on LiveNode sensor and the application project MobiPlus.
MANET标志着现代通信的新时代，是解决远程医疗、环境监测、智能交通系统(车际通信)等诸多应用的关键技术。本文介绍了一种新的专用于智能交通系统的MANET协议:CIVIC (communication intervehicle intelligent et cooperative)。CIVIC是一种上下文感知路由协议，考虑到每个移动节点的位置、道路交通、地理环境(路线图)等。此外，CIVIC的实现支持基础设施和自组织网络、混合MANET协议和多支持无线接入介质。在本文中，我们介绍了不同的世界领先的研究项目致力于车际通信，思域的主要特点，思域在LiveNode传感器上的实现和应用项目MobiPlus。
{"title":"Cooperative Inter-Vehicle Communication Protocol Dedicated to Intelligent Transport Systems","authors":"Jianjin Li, K. Hou, Haiying Zhou, Xunxing Diao","doi":"10.1109/NTMS.2008.ECP.34","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.34","url":null,"abstract":"MANET marks the new age of the modern communication and it is a key technology to solve many applications such as telemedicine, environment monitoring, intelligent transport system (inter-vehicle communication) etc. In this paper a new MANET protocol dedicated to intelligent transport system: CIVIC (communication inter vehicule intelligente et cooperative) is described. CIVIC is a context aware routing protocol taking into account the location of each mobile node, road traffic, geographic environment (road map) etc. Moreover, CIVIC is implemented to support infrastructure and ad-hoc network, hybrid MANET protocol, and multi- support wireless access mediums. In this paper, we introduce the different worldwide leading research projects dedicated to inter- vehicle communication, the key features of CIVIC, the implementation of CIVIC on LiveNode sensor and the application project MobiPlus.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123599074","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.18
B. Tian, Song Han, T. Dillon
Self-healing key distribution schemes enable a group user to recover session keys from two broadcast messages it received before and after those sessions, even if broadcast messages for middle sessions are lost due to network failure. These schemes are quite suitable for supporting secure communication over unreliable networks such as sensor networks and ad hoc networks. An efficient self-healing key distribution scheme is proposed in this paper. The scheme based on the concept of access polynomial and self-healing key distribution model constructed by Hong et al. The new scheme reduces communication overhead and computation overhead greatly yet still keeps the constant storage overhead. In addition, we consider the possibility of mutual-healing between neighbor users in wireless networks.
{"title":"An Efficient Self-Healing Key Distribution Scheme","authors":"B. Tian, Song Han, T. Dillon","doi":"10.1109/NTMS.2008.ECP.18","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.18","url":null,"abstract":"Self-healing key distribution schemes enable a group user to recover session keys from two broadcast messages it received before and after those sessions, even if broadcast messages for middle sessions are lost due to network failure. These schemes are quite suitable for supporting secure communication over unreliable networks such as sensor networks and ad hoc networks. An efficient self-healing key distribution scheme is proposed in this paper. The scheme based on the concept of access polynomial and self-healing key distribution model constructed by Hong et al. The new scheme reduces communication overhead and computation overhead greatly yet still keeps the constant storage overhead. In addition, we consider the possibility of mutual-healing between neighbor users in wireless networks.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116291717","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.23
S. Kartalopoulos
In recent years, the sophistication of attackers in cryptographic algorithms has been alarmingly increased in all media, wireled, optical and wireless. As a result, stronger cryptographic algorithms have been developed to assure data integrity and confidentiality, among them those that are based on chaotic functions. Chaotic functions in cryptography are natural random number generators with non repetitive behavior and yet reproducible if the chaotic function and the initial conditions are known; random number generators are key functions in almost all secure communication systems. However, we have found that under certain circumstances, the chaotic behavior of a function may be obliterated. In this paper we discuss two trap conditions in chaotic functions that are encountered under specific initial conditions; one collapses the chaotic process and we call it chaos annulling trap (CAT), and the other produces the same output and we call it chaos fixed trap (CFT). We also propose two possible methods that may help to identify functions and initial conditions that cause one of these two traps.
{"title":"Annulling Traps & Fixed Traps in Chaos Cryptography","authors":"S. Kartalopoulos","doi":"10.1109/NTMS.2008.ECP.23","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.23","url":null,"abstract":"In recent years, the sophistication of attackers in cryptographic algorithms has been alarmingly increased in all media, wireled, optical and wireless. As a result, stronger cryptographic algorithms have been developed to assure data integrity and confidentiality, among them those that are based on chaotic functions. Chaotic functions in cryptography are natural random number generators with non repetitive behavior and yet reproducible if the chaotic function and the initial conditions are known; random number generators are key functions in almost all secure communication systems. However, we have found that under certain circumstances, the chaotic behavior of a function may be obliterated. In this paper we discuss two trap conditions in chaotic functions that are encountered under specific initial conditions; one collapses the chaotic process and we call it chaos annulling trap (CAT), and the other produces the same output and we call it chaos fixed trap (CFT). We also propose two possible methods that may help to identify functions and initial conditions that cause one of these two traps.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126439587","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.20
F. Bendali, C. Duhamel, K. M. Hou, J. Mailfert, A. C. Santos
Wireless sensor networks have been studied in several contexts because of their large number of applications. There are many challenges involving such networks as the energy resources optimization, the robustness and the network coverage. We address here the problem of energy efficient topology design. A well-designed dynamic topology and an efficient routing algorithm allow to reduce energy consumption, which is the main constraint of wireless sensor node. In this work, we propose to model the problem as a variation of the independent set optimization problem, for the clustering the wireless sensor nodes. We also propose a local search procedure to improve the whole network topology and a specific evaluation procedure.
{"title":"An Optimization Approach for Designing Wireless Sensor Networks","authors":"F. Bendali, C. Duhamel, K. M. Hou, J. Mailfert, A. C. Santos","doi":"10.1109/NTMS.2008.ECP.20","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.20","url":null,"abstract":"Wireless sensor networks have been studied in several contexts because of their large number of applications. There are many challenges involving such networks as the energy resources optimization, the robustness and the network coverage. We address here the problem of energy efficient topology design. A well-designed dynamic topology and an efficient routing algorithm allow to reduce energy consumption, which is the main constraint of wireless sensor node. In this work, we propose to model the problem as a variation of the independent set optimization problem, for the clustering the wireless sensor nodes. We also propose a local search procedure to improve the whole network topology and a specific evaluation procedure.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"37 14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125702998","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.80
S. Rahman, N. Nasser, A. Inomata
Key management is a key concern for security operation in sensor network. Most existing key management schemes try to establish shared keys for all pairs of neighbor sensors, no matter whether these nodes communicate with each other or not, and causes large overhead. In this paper, we propose a novel key agreement protocol based on pairing-based cryptography. The proposed protocol reduces the key spaces of the nodes, in fact nodes do not need to store any key of the other nodes rather it computes secret sharing key by using pairing and identity based properties. Security analysis shows it robust against different attacks such as masquerade attack, wormhole attack, selective forwarding attack and message manipulation attack.
{"title":"Private Communication and Authentication Protocol for Wireless Sensor Networks","authors":"S. Rahman, N. Nasser, A. Inomata","doi":"10.1109/NTMS.2008.ECP.80","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.80","url":null,"abstract":"Key management is a key concern for security operation in sensor network. Most existing key management schemes try to establish shared keys for all pairs of neighbor sensors, no matter whether these nodes communicate with each other or not, and causes large overhead. In this paper, we propose a novel key agreement protocol based on pairing-based cryptography. The proposed protocol reduces the key spaces of the nodes, in fact nodes do not need to store any key of the other nodes rather it computes secret sharing key by using pairing and identity based properties. Security analysis shows it robust against different attacks such as masquerade attack, wormhole attack, selective forwarding attack and message manipulation attack.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115408233","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.56
J. Okech, A. Kurien, M. Odhiambo
Voice over IP (VoIP) over wireless mesh network (WMNs) has become a topic of great interest in both enterprise and research arena. The IEEE 802.11 standard is the most popular wireless LAN standard for extending the access point (AP) based network. However, it does not provide guaranteed quality for real-time applications such as VoIP. Besides, with the large number of injected flows in WMNs, only a handful of these packets can be supported due to protocol overhead, packet collision and Interferences. In this paper, a link-based aggregation is proposed and its performance improvement is compared with those of fixed aggregation and performance under standard access network. Simulation results show that the proposed aggregation scheme increases the number of supported flow while also reducing end-to-end delay, jitter, and packet loss of VoIP in WMNs.
{"title":"Link-Based VoIP Aggregation in Mesh Networks","authors":"J. Okech, A. Kurien, M. Odhiambo","doi":"10.1109/NTMS.2008.ECP.56","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.56","url":null,"abstract":"Voice over IP (VoIP) over wireless mesh network (WMNs) has become a topic of great interest in both enterprise and research arena. The IEEE 802.11 standard is the most popular wireless LAN standard for extending the access point (AP) based network. However, it does not provide guaranteed quality for real-time applications such as VoIP. Besides, with the large number of injected flows in WMNs, only a handful of these packets can be supported due to protocol overhead, packet collision and Interferences. In this paper, a link-based aggregation is proposed and its performance improvement is compared with those of fixed aggregation and performance under standard access network. Simulation results show that the proposed aggregation scheme increases the number of supported flow while also reducing end-to-end delay, jitter, and packet loss of VoIP in WMNs.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114502228","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 : 2008-11-25DOI: 10.1109/NTMS.2008.ECP.68
P. Giacomazzi, A. Poli
Municipal Wireless Networks planning is a challenging task, since many optimization choices should be taken into account in large metropolitan areas. This paper formalizes the problem of choosing appropriate access points' locations and to connect the so built access network to the backbone network. We provide an optimization algorithm able to find a solution with a fast heuristic approach, and apply it to a real-world scenario.
{"title":"Municipal Wireless Networks Planning","authors":"P. Giacomazzi, A. Poli","doi":"10.1109/NTMS.2008.ECP.68","DOIUrl":"https://doi.org/10.1109/NTMS.2008.ECP.68","url":null,"abstract":"Municipal Wireless Networks planning is a challenging task, since many optimization choices should be taken into account in large metropolitan areas. This paper formalizes the problem of choosing appropriate access points' locations and to connect the so built access network to the backbone network. We provide an optimization algorithm able to find a solution with a fast heuristic approach, and apply it to a real-world scenario.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129948113","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
扫码关注我们
求助内容：
应助结果提醒方式：