Hellenic Authority for Communications Security and Privacy ADAE

Athens, Greece

Hellenic Authority for Communications Security and Privacy ADAE

Athens, Greece

Time filter

Source Type

Leligou H.C.,TEI of Chalkis | Trakadas P.,Hellenic Authority for Communications Security and Privacy ADAE | Maniatis S.,Hellenic Authority for Communications Security and Privacy ADAE | Karkazis P.,TEI of Chalkis | Zahariadis T.,TEI of Chalkis
Wireless Communications and Mobile Computing | Year: 2012

As the applications of wireless sensor networks proliferate, the efficiency in supporting large sensor networks and offering security guarantees becomes an important requirement in the design of the relevant networking protocols. Geographical routing has been proven to efficiently cope with large network dimensions while trust management schemes have been shown to assist in defending against routing attacks. Once trust information is available for all network nodes, the routing decisions can take it into account, i.e. routing can be based on both location and trust attributes. In this paper, we investigate different ways to incorporate trust in location-based routing schemes and we propose a novel way of balancing trust and location information. Computer simulations show that the proposed routing rule exhibits excellent performance in terms of delivery ratio, latency time and path optimality. Copyright © 2010 John Wiley & Sons, Ltd.


Zahariadis T.,Alexander Technological Educational Institute of Thessaloniki | Trakadas P.,Hellenic Authority for Communications Security and Privacy ADAE | Leligou H.,Alexander Technological Educational Institute of Thessaloniki | Karkazis P.,Alexander Technological Educational Institute of Thessaloniki | Voliotis S.,Alexander Technological Educational Institute of Thessaloniki
Proceedings - 3rd International Conference on Developments in eSystems Engineering, DeSE 2010 | Year: 2010

Wireless Sensor Networks are gaining popularity due to the fact that they offer low-cost solutions for a variety of application domains. However, these networks are highly susceptible to attacks, due to both the open and distributed nature of the network, as well as the limited resources of the nodes, which dictate the implementation of sophisticated security frameworks. Trust-aware routing is an important direction in designing secure routing protocols for WSN. The common approach to provide trust-aware routing is to implement an efficient mechanism to evaluate the trustworthiness of neighboring nodes, based on a proper set of trust metrics. In this paper, we discuss several challenges addressed during the implementation of a trust-aware management scheme on commercial sensor nodes, as well as problems faced during the deployment of the test-bed network. As it will be discussed, the limited memory, computational power, energy resources and radio bandwidth of sensor nodes deeply impact the implementation strategy, while additionally, the realities of radio propagation, such as lossy and asymmetric links, require careful evaluation of the routing selection metrics. © 2010 IEEE.


Zahariadis T.,Alexander Technological Educational Institute of Thessaloniki | Trakadas P.,Hellenic Authority for Communications Security and Privacy ADAE | Leligou H.C.,Alexander Technological Educational Institute of Thessaloniki | Maniatis S.,Hellenic Authority for Communications Security and Privacy ADAE | Karkazis P.,Technical University of Crete
Wireless Personal Communications | Year: 2013

Wireless sensor networks are vulnerable to a wide set of security attacks, including those targeting the routing protocol functionality. The applicability of legacy security solutions is disputable (if not infeasible), due to severe restrictions in node and network resources. Although confidentiality, integrity and authentication measures assist in preventing specific types of attacks, they come at high cost and, in most cases, cannot shield against routing attacks. To face this problem, we propose a secure routing protocol which adopts the geographical routing principle to cope with the network dimensions, and relies on a distributed trust model for the detection and avoidance of malicious neighbours. A novel function which adaptively weights location, trust and energy information drives the routing decisions, allowing for shifting emphasis from security to path optimality. The proposed trust model relies on both direct and indirect observations to derive the trustworthiness of each neighboring node, while it is capable of defending against an increased set of routing attacks including attacks targeting the indirect trust management scheme. Extensive simulation results reveal the advantages of the proposed model. © 2012 Springer Science+Business Media, LLC.


Karkazis P.,Technical University of Crete | Trakadas P.,Hellenic Authority for Communications Security and Privacy ADAE | Zahariadis Th.,Alexander Technological Educational Institute of Thessaloniki | Hatziefremidis A.,Alexander Technological Educational Institute of Thessaloniki | Leligou H.C.,Alexander Technological Educational Institute of Thessaloniki
9th International Conference on Networked Sensing Systems, INSS 2012 - Conference Proceedings | Year: 2012

Recently, Routing Protocol for Low Power and Lossy Networks (RPL) has been proposed by IETF ROLL WG in order to cope with Low Power and Lossy Networks (LLN) requirements implied by different application domains. In this paper, we present RPL modeling in J-Sim simulation environment, providing a complete simulation framework for performance evaluation as well as experimentation on open issues, such as the support of multiple instances and the definition of routing strategies based on the composition of several metrics. © 2012 IEEE.


Zahariadis T.,Alexander Technological Educational Institute of Thessaloniki | Leligou H.,Alexander Technological Educational Institute of Thessaloniki | Karkazis P.,Alexander Technological Educational Institute of Thessaloniki | Trakadas P.,Hellenic Authority for Communications Security and Privacy ADAE
Proceedings - 14th Panhellenic Conference on Informatics, PCI 2010 | Year: 2010

Wireless Sensor Networks are gaining popularity due to the fact that they offer low-cost solutions for a variety of application areas. However, these networks are highly susceptible to attacks, due to both the open and distributed nature of the network, as well as the limited resources of the nodes, which dictate the implementation of sophisticated security frameworks. Addressing this challenge in this paper, we present a distributed trust management framework, which allows for trusted path selection. The framework has been initially evaluated based on simulations in JSIM, and then adapted and implemented in state-of- the-art sensor nodes. In this paper, we discuss its implementation feasibility and cost, as well as the energy consumption issues. © 2010 IEEE.


Karkazis P.,Technical University of Crete | Leligou H.C.,Technological Educational Institute of Chalkida | Sarakis L.,Technological Educational Institute of Chalkida | Zahariadis T.,Technological Educational Institute of Chalkida | And 3 more authors.
2012 International Conference on Telecommunications and Multimedia, TEMU 2012 | Year: 2012

The diversity of applications that current and emerging Wireless Sensor Networks (WSNs) are called to support imposes different requirements on the underlying network with respect to delay and loss, while at the same time the WSN imposes its own intricacies. The satisfaction of these requirements highly depends on the metric upon which the forwarding routes are decided. In this view, the IETF ROLL group has proposed the RPL routing protocol, which can flexibly work on various routing metrics, as long as they hold specific properties. The system implementer/user is free to decide whether to use one or multiple routing metrics, as well as the way these metrics can be combined. In this paper, we provide ways to quantify the routing metrics so that they can be combined in an additive or lexical manner. We use extensive simulation results to evaluate the impact of several routing metrics on the achieved performance. © 2012 IEEE.


Velivasaki T.-H.N.,National Technical University of Athens | Karkazis P.,Technical University of Crete | Zahariadis T.V.,Technological Educational Institute of Chalkida | Trakadas P.T.,Hellenic Authority for Communications Security and Privacy ADAE | Capsalis C.N.,National Technical University of Athens
European Transactions on Telecommunications | Year: 2014

The usability of wireless sensor networks in modern applications requires the fulfillment of dynamic Quality of Service (QoS) requirements that can only be met in a reactive manner by the introduction of composite routing metrics, capturing several distinct network characteristics. However, combining routing metrics is neither a trivial nor an arbitrary task, given the routing protocol requirements and routing metrics properties. In this paper, the theoretical framework of routing algebra formalism is adopted and extended to incorporate single or composite routing metrics, because the satisfaction of routing algebra properties ensures convergence, optimality, and loop-freeness. Moreover, packet forwarding indication is defined as a new trust metric for systems (a) with or (b) without network retransmissions to avoid forwarding attacks, while a novel composite routing metric is presented, combining link reliability and trust-awareness in an additive manner, fulfilling the theoretical requirements. Finally, this composite metric is applied to the Routing Protocol for Low Power and Lossy Networks via simulations, which verify its efficiency in several scenarios, including the comparison between lexical and additive metric composition approaches. © 2012 John Wiley & Sons, Ltd.


Zahariadis T.,Technological Educational Institute of Chalkida | Leligou H.C.,Technological Educational Institute of Chalkida | Trakadas P.,Hellenic Authority for Communications Security and Privacy ADAE | Voliotis S.,Technological Educational Institute of Chalkida
European Transactions on Telecommunications | Year: 2010

The range of applications of wireless sensor networks is so wide that it tends to invade our every day life. In the future, a sensor network will survey our health, our home, the roads we follow, the office or the industry we work in or even the aircrafts we use, in an attempt to enhance our safety. However, the wireless sensor networks themselves are prone to security attacks. The list of security attacks, although already very long, continues to augment impeding the expansion of these networks. The trust management schemes consist of a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them, either for data forwarding, data aggregation or any other cooperative function. A variety of trust models which follow different directions regarding the distribution of measurement functionality, the monitored behaviours and the way measurements are used to calculate/define the node's trustworthiness has been presented in the literature. In this paper, we survey trust models in an attempt to explore the interplay among the implementation requirements, the resource consumption and the achieved security. Our goal is to draw guidelines for the design of deployable trust model designs with respect to the available node and network capabilities and application peculiarities. Copyright © 2010 John Wiley & Sons, Ltd.

Loading Hellenic Authority for Communications Security and Privacy ADAE collaborators
Loading Hellenic Authority for Communications Security and Privacy ADAE collaborators