{"title":"Run-time selection of security algorithms for networked devices","authors":"A. Taddeo, A. Ferrante","doi":"10.1145/1641944.1641963","DOIUrl":"https://doi.org/10.1145/1641944.1641963","url":null,"abstract":"One of the most important challenges that need to be currently faced in securing resource-constrained embedded systems is optimizing the trade-off between resources used (energy consumption and computational capabilities required) and security requirements for cryptographic algorithms: any adopted security solutions should guarantee an adequate level of protection, yet respecting constraints on computational resources and consumed power. In this paper a generic, efficient, and energy-aware mechanism to determine a correct trade off between security requirements and resources consumed is proposed. The solution proposed relies on Analytic Hierarchy Process (AHP) to define priorities among different requirements and to compare different security solutions. A knapsack problem is formulated to select the most relevant algorithms based on their utility and on available resources.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"17 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132033162","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}
{"title":"QoS parameterization algorithm in data collection for wireless sensor networks","authors":"Jun-Zhao Sun","doi":"10.1145/1641944.1641956","DOIUrl":"https://doi.org/10.1145/1641944.1641956","url":null,"abstract":"Environment monitoring is one key application of wireless sensor networks. In a monitoring application, continuous query is adopted to periodically retrieve data from the network. Sensor nodes have limited energy resources and their functionality continues until their energy drains. Data collection algorithm has to be designed to extend the lifetime of sensors to the best extent and at the same time keep the data accuracy to a certain level. This paper presents a novel data gathering algorithm for continuous query in wireless sensor networks. In particular, the problem of adaptive determination of data granularity for QoS-constraint query execution is address. Application specifies its QoS requirements with the query. Then, each node can choose the optimum data granularity for local data collection and transmission. The proposed algorithm is in a distributed fashion, and executed at each local sensor node. The proposed algorithm is verified and the impact of and tradeoff between various design parameters are analyzed.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114669676","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}
Ricardo M. Silva, V. Leithardt, J. Silva, C. Geyer, J. Rodrigues, F. Boavida
{"title":"A comparison of approaches to node and service discovery in 6lowPAN wireless sensor networks","authors":"Ricardo M. Silva, V. Leithardt, J. Silva, C. Geyer, J. Rodrigues, F. Boavida","doi":"10.1145/1641944.1641954","DOIUrl":"https://doi.org/10.1145/1641944.1641954","url":null,"abstract":"Discovering nodes and services in Wireless Sensor Networks poses several challenges. Different sink and sensor nodes announcement strategies lead to different amounts of resource consumption in terms of processing, memory, communication time and drained energy. This may be aggravated if IP is the underlying protocol, such as in the case of 6lowPAN networks. In this paper three paradigms for node and service discovery are proposed, analyzed and evaluated. The results, obtained by prototyping, show that at least one of the proposed strategies leads to efficient use of resources, showing that node and service discovery in resource-constrained networks such as 6lowPAN is feasible.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"12 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131574521","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}
{"title":"End-to-end security and seamless handover solution for real-time communications over 3G networks","authors":"W. B. Diab, S. Tohmé","doi":"10.1145/1641944.1641948","DOIUrl":"https://doi.org/10.1145/1641944.1641948","url":null,"abstract":"The IP Multimedia Subsystem (IMS) defined by 3GPP is designed to provide robust multimedia applications over diverse access technologies. A promising solution to protect such applications is to use the Secure Internet Protocol (IPSec); however, IPSec has some drawbacks, particularly on the performance and the QoS of real-time applications. On the other hand, seamless vertical handover is one of the challenging issues in wireless networks. Vertical handover requires fast and efficient control over various wireless technologies to realize service continuity and seamless mobility. This paper presents an IPSec-based end-to-end securing solution for real-time services and proposes a secure and fast seamless handover solution preserving the QoS and security when moving between heterogeneous access networks. An analytic model is used to evaluate the performance of the proposed solution in term of end-to-end latency and packet loss. The results show that our solution provides high performance for real-time applications while guaranteeing end-to-end security.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133090842","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}
{"title":"PETRA: a secure and energy-efficient software update protocol for severely-constrained network devices","authors":"W. Itani, A. Kayssi, A. Chehab","doi":"10.1145/1641944.1641952","DOIUrl":"https://doi.org/10.1145/1641944.1641952","url":null,"abstract":"In this paper we propose PETRA; an energy-efficient and secure software update protocol for severely-constrained network devices. PETRA ensures the authenticity and end-to-end integrity of software update components delivered from trusted content distribution networks. The protocol operates by employing a set of energy-efficient data structures and cryptographic constructs to efficiently detect any form of man-in-the-middle modification attacks on the update packets. This methodology contributes to a sizeable decrease in network traffic and as a result huge energy savings. This makes PETRA a very suitable security protocol for limited-resource battery-operated devices such as low-end mobile phones, wireless sensors, and even Radio Frequency Identification Devices (RFIDs) tags. Moreover, PETRA realizes an incremental security verification mechanism that allows the dynamic eager loading of received software components. This mechanism prevents any form of service disruption or operation downtime during the code upgrade process. A prototype PETRA implementation is tested on a grid of simulated micaz sensor nodes running the TinyOS operating system. A platform-independent performance analysis and an experimental simulation show that PETRA can achieve up to 30% average reduction in network-wide energy consumption.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129087307","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}
{"title":"A framework for detecting selfish misbehavior in wireless mesh community networks","authors":"F. Martignon, Stefano Paris, A. Capone","doi":"10.1145/1641944.1641958","DOIUrl":"https://doi.org/10.1145/1641944.1641958","url":null,"abstract":"Wireless Mesh Networks (WMNs) have recently emerged as a flexible and low-cost extension of wired infrastructure networks. They consist of mesh routers and clients, where mesh routers are almost static and form the backbone of the WMN.\u0000 The complete absence of an infrastructure and the flexibility provided by the wireless mesh technology has fostered the development of new network paradigms like Wireless Mesh Community Networks. Such networks are usually composed of heterogeneous mesh routers managed by different users (a subset of participants to the community), that collaborate to extend the network coverage. However, in such environment some participants can exhibit selfish behaviors, by dropping selectively the packets sent by other mesh routers, in order to prioritize their own traffic and increase their network utilization.\u0000 In this paper we propose a complete scheme to detect selfish behavior of the mesh routers that participate to the community network. Each node evaluates the trustworthiness of the other mesh routers by combining the direct observations on the relaying behavior of neighbor nodes with the trust information provided by other mesh routers. The proposed scheme has been integrated in the AODV routing protocol, and tested in several network scenarios.\u0000 The numerical results show that our scheme provides a high detection accuracy, even when a high percentage of network nodes provide false trust values (bad-mouthing attack).","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121144358","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}
{"title":"A closed-form expression for queuing delay in Rayleigh fading channels using stochastic network calculus","authors":"G. Verticale","doi":"10.1145/1641944.1641947","DOIUrl":"https://doi.org/10.1145/1641944.1641947","url":null,"abstract":"Stochastic Network Calculus is a modern theory for studying the delay performance of a queuing system. So far, this theory proved very effective in studying QoS in the wireline transmission media. In fact, it provides an upper bound to the probability tail of the queuing delay and requires only the expression of an arrival curve, which models the traffic source, and of a service curve, which models the scheduling discipline. In this paper, we propose a model of the wireless channel based on Stochastic Network Calculus and provide an analytical expression for the first two moments of the service curve of a wireless channel capacity varies over time according to a Rayleigh fading process, such as in the WiMAX and LTE systems. We also provide an approximate closed-form expression for the probability tail of the queuing delay. Finally, we compare our results to simulations in order to assess the validity of our approach.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128776430","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}
{"title":"Generalized self-healing key distribution in wireless adhoc networks with trade-offs in user's pre-arranged life cycle and collusion resistance","authors":"Ratna Dutta, S. Mukhopadhyay, T. Dowling","doi":"10.1145/1641944.1641960","DOIUrl":"https://doi.org/10.1145/1641944.1641960","url":null,"abstract":"Self-healing key distribution deals with the problem of distributing session keys for secure communication to a dynamic group of users over an unreliable, lossy network in a manner that is resistant to packet lost and collusion attacks. Self-healing property enables a user who has been off-line for some period to recover the lost session keys immediately after coming back on-line. We introduce the collusion resistance property in a generalized self-healing key distribution proposed by Dutta et al. with a trade-off of pre-arranged life cycle on authorized users and a slight increase in storage, the approach of Tian et al.. Our setup therefore allows each user to choose its joining session at its will, but the session for its revocation is pre-selected by the group manager. Several innovative business models allow contractual subscription or rental by the service provider for the scalability of business and do not allow the user to revoke before its contract is terminated. Our scheme is suitable for such applications. The proposed scheme provides better efficiency in communication and storage as compared to the existing approaches besides achieving collusion resistance property. Our construction is properly analyzed in an appropriate security model and is proven to be computationally secure and achieve both forward and backward secrecy. Moreover, rejoining of revoked users can be done in our scheme at later sessions with new identities without compromising security, unlike the existing self-healing schemes.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130402678","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}
{"title":"Implementation of a security framework for wireless multi-hop networks","authors":"Stefano Paris, A. Capone","doi":"10.1145/1641944.1641967","DOIUrl":"https://doi.org/10.1145/1641944.1641967","url":null,"abstract":"Wireless Multi-hop Networks represents an emerging technology for next-generation wireless networking. Although very little attention has been devoted so far to the security issues of this technology, they represent a critical feature that can limits the employment of this technology as a convenient alternative to others networking solutions.\u0000 In this demo we present an implementation of a security framework for Wireless Multi-hop Networks that provides authentication and access control of wireless nodes as well as a key distribution scheme.\u0000 We compare our security framework both with a static key approach and with an end-to-end solution that consists in establishing an encrypted IPSec tunnel.\u0000 The experimental analysis shows that our solution enhances the network security with a negligible impact on the network performance, thus representing an effective solution for wireless multi-hop networking.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122088813","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}
{"title":"A highly resilient and zone-based key predistribution protocol for multiphase wireless sensor networks","authors":"Kübra Kalkan, S. Yilmaz, O.Z. Yilmaz, A. Levi","doi":"10.1145/1641944.1641951","DOIUrl":"https://doi.org/10.1145/1641944.1641951","url":null,"abstract":"Pairwise key distribution among the sensor nodes is an essential problem for providing security in Wireless Sensor Networks (WSNs). The common approach for this problem is random key predistribution, which suffers from resiliency issues in case of node captures by adversaries. In the literature, the resiliency problem is addressed by zone-based deployment models that use prior deployment knowledge. Another remedy in the literature, which is for multiphase WSNs, aims to provide self-healing property via periodic deployments of sensor nodes with fresh keys over the sensor field. However, to the best of our knowledge, these two approaches have never been combined before in the literature. In this paper, we propose a zone-based key predistribution approach for multiphase WSNs. Our approach combines the best parts of these approaches and provides self-healing property with up to 9-fold more resiliency as compared to an existing scheme. Moreover, our scheme ensures almost 100% secure connectivity, which means a sensor node shares at least one key with almost all of its neighbors.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126395311","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}