University of Patras
Τεχνικές ασφαλείας σε ασύρματα δίκτυα αισθητήρων με έμφαση στην μείωση κόστους σε σχήματα διαχείρισης κλειδιών με χρήση τοπολογικών μεθόδων
Abstract
dc:descriptionWireless Sensor Networks are an emerging type of industry-targeted networks that typically consist of a number of spatially distributed nodes, usually equipped with environmental sensors, working together to execute a particular application. As the utility of WSN becomes more apparent in recent years, and new types of applications are being implemented in sensitive application areas, the necessity of securing these networks, and especially inter-node communications within them, from interception and injection of malicious data is becoming apparent.This dissertation focuces mainly on the study of key management schemes, and specifically, the minimization of network overhead for key management processes when a group communication model-supporting scheme is used, in which each node possesses cryptographic material that enables it to communicate directly with all other nodes in the network.The Logical Key Hierarchy scheme is used as a basis. In this scheme, key management is performed by a Key Server. There exists a network key, shared between all nodes in the network, and which can be used to communicate between any two nodes. To reduce the cost of changing it, a hierarchy of keys, in the form of a tree, is used.As an initial step in the dissertation, an encrypted image transmission application is implemented on network of TelosB nodes, running the Contiki operating system. Key management was implemented using the S2RP scheme, which is based on LKH. The performance of the encrypted image transmission was tested and compared to unencrypted transmission. Additionally, measurements were taken for the performance of the S2RP rekeying procedures.The results of the encrypted image transmission showed that encryption of data transmissions, even for a demanding application like image transmission, is quite applicable, despite the additional overhead. Rekeying procedure measurements showed that such key management schemes are indeed applicable in a WSN, but the overhead is non-negligible and must be taken into account in the design of the network, and it may be necessary to regulate network transmission parameters, such as the minimum transmission interval, to minimize the losses in the critical rekeying packets, while keeping the execution time of these processes within reasonable limits.As a next step in the thesis, methods of minimizing the network overhead for LKH key management schemes were studied and implemented. Method of creation of efficient key hierarchies, that lead to rekeyings with minimal network transmissions were explored. The approach that was followed was topological, or topology-aware, i.e. key structures correspond to the network connection graph. The methods are collectively named TALK: Topology-Aware LKH Key ManagementThe algorithms that were developed are logically split into two sections. The first is finding the optimal node to assume the Key Server role. This is done by locally collecting data on the network topology at each node, and calculating at each candidate node some suitability metrics. The second part of the algorithms is the very creation of the key tree on the Key Server, using the knowledge of the network topology received during the previous step.Measurements and simulations that show the applicability of the algorithms, as well as the improvement of the network overhead in relation to the plain, random creation of key trees, were performed.In the next chapter, the possibility to further reduce the rekeying overhead is studied, using two nested levels of LKH key hierarchies. At the lower level, the nodes of the network are assigned into End Clusters, each having an End Cluster Head. Cluster heads of this level comprise the Super Cluster, which has a Super Cluster Head, that acts as general network coordinator. A separate LKH tree is used in each cluster. The proposed Key Management Scheme is named CHAT: clustered hierarchical key management for Wireless Sensor Networks using network topology.In the basic scheme, non-ECH nodes share cryptographic material only with nodes in their own their EC, and can communicate directly with them. Inter-EC communication is routed through the corresponding ECHs, who, being able to communicate with each otherand, take on the role of message re-encryption . In relation to a real group communication model, there is some overhead on inter-cluster communication, but the rekeying cost is heavily reduced, as key changes no longer concern the whole network, but only parts of it.Using the TALK methods as a basis, the SCH and first ECH is selected using the TALK Key Server selection procedure. The remaining ECHs are selected using an iterative algorithm, whereby the most suitable of the remaining candidates is chosen at each step. The general idea behind the selection criteria is preference of candidates with several nodes in their neighborhood, and who also are not near any already selected ECHs. Having all needed ECHs selected, the remaining nodes are assigned to ECs, using an algorithm which yields coherent ECs and minimum hops assignments.Two variants of the basic scheme are also presented: The first is the introduction of a network-wide encryption key, which is shared between all network nodes, allowing the use of a group communication model, such as a simple LKH, and overhead-free inter-cluster communication, at the expense of an increase in the rekeying cost. The second variation in the basic scheme is the introduction of overlap between the ECs. This is a compromise between the previous variants, having more flexibility than the basic scheme in data transmissions, and a rekeying cost that is greater than in the basic scheme, but lower than using a network-wide key.Simulations were performed for the validation of the schemes' performance. These show that each variant has different rekeyign and data traffic cost characteristics, and thus each one is proposed for different types of applications: The basic scheme presents minimal key change costs, which do not increase much with the network size. However it also exhibits a non-negligible increase in inter-cluster communication costs. Therefore, its used is recommended for applications the traffic patterns of which can match the scheme's clusters. The variant with the network-wide key does not incur an overhead for communication costs. The rekeying cost is far greater than the basic scheme, but much less than the simple LKH application, and even the TALK scheme. Thus, it is proposed as a generic solution for applications which have traffic between any nodes, but also need a fairly low rekeying cost for a group communication scheme. Finally, the cluster overlapping variant presents very low rekeying cost for large networks, approaching that of the basic scheme, while offering much greater flexibility in communication, while the communication overhead due to the non-optimal routing of the packets can be replaced by routing through the minimum path and performing additional re-encryptions as needed. It is recommended for very large networks with any communication needs.
Degree
thesis:*- Grantor dc:publisher
- University of Patras
- Year dc:date
- 2018
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Tsitsipis, Dimitrios
- Τσιτσιπής, Δημήτριος
Subjects
dc:subject × 24- Ασύρματα Δίκτυα Αισθητήρων Ενεργοποιητών
- ΑΔΑ
- Δίκτυα
- Ασφάλεια δικτύων
- Διαχείριση Κλειδιών
- Ιεραρχία Κλειδιών
- Τοπολογία
- Συστάδες
- Wireless sensor networks
- WSN
- Networks
- Network security
- Key Management
- Key Hierarchy
- Topology
- Clusters
- Φυσικές Επιστήμες
- Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική
- Επιστήμες Μηχανικού και Τεχνολογία
- Επιστήμη Ηλεκτρολόγου Μηχανικού, Ηλεκτρονικού Μηχανικού, Μηχανικού Η/Υ
- Natural Sciences
- Computer and Information Sciences
- Engineering and Technology
- Electrical Engineering, Electronic Engineering, Information Engineering
Rights
dc:rights- Statement dc:rights
-
- BY_SA
- Language dc:language
- gre
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/43574