Conference PaperPDF Available

Hybrid protocol for group key management and transparent cluster interconnection in a secure wireless sensor network

Authors:

Abstract

Wireless sensor networks are a limited set of devices in low battery power, processing, communication, and also low memory bandwidth. For these limitations, most security methodologies applied in wired networks cannot be exploited in this environment. Due to this reality is that we present a hybrid protocol that handles the regime group of key management system and for the interconnection of the transparent cluster. Do not treat the problem of tampering with node-key control group. The feasibility of this protocol was verified by simulation and proved that the increase of network nodes does not affect the performance of the interconnection between two clusters.
8/18/13 12:55 AMIEEE Xplore - Hybrid protocol for group key management and transparent cluster interconnection in a secure wireles...
Page 1 of 2http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6211966&url=h…%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6211966
For Institutional Users:
Institutional Sign In
Athens/Shibboleth
Browse Conference Publications > Network Operations and Manage ...
Hybrid protocol for group key
management and transparent cluster
interconnection in a secure wireless
sensor network
Full Text
Sign-In or Purchase
4
Author(s)
Tweet
Tweet
0
0
Share
Share
Page(s):
603 - 606
ISSN :
1542-1201
E-ISBN :
978-1-4673-0268-5
Print ISBN:
978-1-4673-0267-8
INSPEC Accession Number:
12785195
Conference Location :
Maui, HI
Digital Object Identifier :
10.1109/NOMS.2012.6211966
Wireless sensor networks are a limited set of devices in low battery power, processing,
communication, and also low memory bandwidth. For these limitations, most security methodologies
applied in wired networks cannot be exploited in this environment. Due to this reality is that we
present a hybrid protocol that handles the regime group of key management system and for the
interconnection of the transparent cluster. Do not treat the problem of tampering with node-key
control group. The feasibility of this protocol was verified by simulation and proved that the increase
of network nodes does not affect the performance of the interconnection between two clusters.
Published in:
Network Operations and Management Symposium (NOMS), 2012 IEEE
Date of Conference: 16-20 April 2012
Sign In | Create Account
IEEE.org | IEEE Xplore Digital Library | IEEE Standards | IEEE Spectrum | More Sites
Menezes, A.G. ; Networks & Manage. Lab., Fed. Univ. of Santa Catarina, Florianópolis, Brazil ; Westphall, C.B. ; Westphall, C.M. ; de Lima Pinto, E.M.
Authors References Cited By Keywords Metrics SimilarAbstract
0
Like
8/18/13 12:55 AMIEEE Xplore - Hybrid protocol for group key management and transparent cluster interconnection in a secure wireles...
Page 2 of 2http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6211966&url=h…%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6211966
IEEE Account
Change Username/Password
Update Address
Purchase Details
Payment Options
Order History
Access Purchased Documents
Profile Information
Communications Preferences
Profession and Education
Technical Interests
Need Help?
US & Canada: +1 800 678 4333
Worldwide: +1 732 981 0060
Contact & Support
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
Book
Full-text available
Os principais problemas associados à implementação e uso da gerência de redes e serviços ocorrem devido à grande quantidade de proposições, padrões e de diferentes produtos oferecidos no mercado, dificultando consideravelmente a tomada de decisão no que se refere a utilização da abordagem de gerência de redes e serviços mais adequada. Além disso, novas tendências na área de gerência de redes e serviços vêm sendo pesquisadas, entre estas destacam-se: gerência de redes sem fio, de sensores, óticas, futura internet...; áreas funcionais de segurança, configuração, desempenho, contabilidade...; gerência de serviços de multimídia, data centers, grid, cloud, virtualização...; e gerência centralizada, autonômica, distribuída, auto- gerência, baseada em políticas... Estas novas tendências vêm sendo pesquisadas no Laboratório de Redes e Gerência (LRG) da UFSC e a partir deste projeto as mesmas poderão ser aperfeiçoadas através das seguintes atividades deste projeto: - Aperfeiçoamentos no monitoramento para computação em nuvem. - Aperfeiçoamentos na gerência autonômica para computação em nuvem. - Aperfeiçoamentos na gerência de segurança para computação em nuvem. - Aperfeiçoamentos na análise de riscos para computação em nuvem. - Aperfeiçoamentos no gerenciamento de identidade para computação em nuvem. - Aperfeiçoamentos nas redes bayesianas para gerência de computação em nuvem. - Aperfeiçoamentos na sustentabilidade para computação em nuvem.
Conference Paper
Full-text available
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm
Conference Paper
Full-text available
Abstract—Green Cloud Computing aims at a processing infrastructure that combines flexibility, quality of services, and reduced energy utilization. In order to achieve this objective, the management solution must regulate the internal settings to address the pressing issue of data center over-provisioning related to the need to match the peak demand. In this context, we propose an integrated solution for resource management based on organization models of autonomous agent components. This work introduces the system management model, analyzes the system’s behavior, describes the operation principles, and presents a use case scenario. To simulate the approach of organization, theory and implementation of migration policies and reallocation changes were made as improvements in the code of CloudSim framework.
Conference Paper
Full-text available
Strong public-key cryptography is often considered to be too computationally expensive for small devices if not accelerated by cryptographic hardware. We revisited this statement and implemented elliptic curve point multiplication for 160-bit, 192-bit, and 224-bit NIST/SECG curves over GF(p) and RSA-1024 and RSA-2048 on two 8-bit microcontrollers. To accelerate multiple-precision multiplication, we propose a new algorithm to reduce the number of memory accesses. Implementation and analysis led to three observations: 1. Public-key cryptography is viable on small devices without hardware acceleration. On an Atmel ATmega128 at 8 MHz we measured 0.81s for 160-bit ECC point multiplication and 0.43s for a RSA-1024 operation with exponent e=216+1. 2. The relative performance advantage of ECC point multiplication over RSA modular exponentiation increases with the decrease in processor word size and the increase in key size. 3. Elliptic curves over fields using pseudo-Mersenne primes as standardized by NIST and SECG allow for high performance implementations and show no performance disadvantage over optimal extension fields or prime fields selected specifically for a particular processor architecture.
Article
The negative impact of network partitions on the availability of key management services in mobile ad hoc networks (MANET) is alleviated by a robust key management approach for MANET based on the distributed certificate authority (DCA). Auxiliary shares are used to increase the redundancy of shares in the networks thereby ensuring robustness and security at the same time. Simulations show that the average failure ratio for DCA requests is reduced by more than 50%. A security analysis and simulations show that the approach ensures system robustness and thwarts common attacks.
Conference Paper
Ubiquitous communication networks is a keystone for New Generation Network (NWGN). Mobile Wireless Communication Networks (MWSN) is a viable solution to accomplish the requirements of NWGN. Due to mobility of sensor nodes, the data reliability and end-to-end delay with energy efficiency in the network is an enormous concern. Various real-time and delay sensitive applications enforced to use both environments mobile and fixed sensor nodes, whereas the others claims an entire mobile sensors environments in network. Packet loss ratio and end-to-end delay happened because of the nodes mobility which is directly impact to degrade the quality of service, network lifetime and energy consumption. This paper enlightens a comprehensive comparison between single and multi hop inter-cluster routing strategy from cluster head to base station. Moreover, the performance of multi hop routing is calculated and compared with single hop LEACH routing strategy. The simulation results reveal that multi hop routing strategy is to increase the sensor nodes throughput and network lifetime but not efficient approach for delay sensitive and data reliable applications.
Article
http://www.tm.uka.de Abstract. One of the huge problems for security in sensor networks is the lack of resources. Typical sensor nodes such as the quite popular MICA and MICA2 Motes from UC Berkeley (1) are based on a microcontroller architecture with only a few KBytes of memory and severe limited computing ability. Strong public- key cryptography is therefore commonly seen as infeasible on such devices. In contrast to this prejudice this paper presents an efficient a nd lightweight imple- mentation of public-key cryptography algorithms relying on elliptic curves. The code is running on Atmels 8Bit ATMEGA128 microcontroller, the heart of the MICA2 platform. The key to our fast implementation is the use of offline pre- computation and handcrafting.
Article
In this article we offer guidelines for the determination of key sizes for symmetric cryptosystems, RSA, and discrete logarithm-based cryptosystems both over finite fields and over groups of elliptic curves over prime fields. Our recommendations are based on a set of explicitly formulated parameter settings, combined with existing data points about the cryptosystems.
Article
In future smart environments, ad hoc sensor networks will play a key role in sensing, collecting, and disseminating information about environmental phenomena. As sensor networks come to be wide-spread deployment, security issues become a central concern. So far, the main research focus has been on making sensor networks feasible and useful, and less emphasis has been placed on security. This paper analyzes security challenges in wireless sensor networks and summarizes key issues that need be solved for achieving security in an ad hoc network. It gives an overview of the current state of solutions on such key issues as secure routing, prevention of denial-of-service, and key management service.