“…Moreover, the results estimated how many messages we minimize during installation of the keys and how fast generating and storing of the ECC keys occur. In section 6, we also compared the result with the following implementations; specially RECC [12] and AVL-Headers/AVL-KDC [13]. The obtained results proved that the proposed algorithm can outperform other approaches based on the ECC.…”
Section: The Proposed Methodsmentioning
confidence: 87%
“…They receive and then transmit nodes messages to the base station. The ECC keys generation and storage in the AVL tree are done by the base station while distribution is done either by a KDC server or by CH [13]. In AVL-KDC approach, when a node arrives or leaves the network, the KDC server starts updating public keys located throughout the node path to the base of the AVL tree and reconfigures the AVL tree.…”
Section: B-avl-headers and Avl-kdcmentioning
confidence: 99%
“…Thereafter, we described the proposed approach and its added value by algorithms and explanations of each phase. In the last section, we analyzed the different algorithms and compared the performance of each approach [12]- [13] by looking at: the average energy consumed per node, the memory used by node for storing ECC keys, the number of packets exchanged when installing keys and ECC keys computing time and rekeying.…”
To maintain the proper functioning of critical applications based on Wireless Sensor Networks, we must provide an acceptable level of security while taking into account limited capabilities of the sensors. In this paper we proposed a mobile approach to secure data exchanged by structured nodes in cluster. The approach is based on mobile nodes with significant calculation and energy resources that allow cryptographic key management and periodic rekeying. However, mobility in wireless sensor networks aims to increase the security and lifetime of the entire
network. The technical methods used in this paper are based on cryptography elliptic curves and key management through a balanced binary tree. To compare the performance of the proposed approach with other mobile algorithms, we focused on the following metrics: the energy
consumed by normal sensors and cluster heads, the number of packets exchanged during key installation, time to generate and distribute cryptographic keys, and the memory used by the different sensors to store keys.
“…Moreover, the results estimated how many messages we minimize during installation of the keys and how fast generating and storing of the ECC keys occur. In section 6, we also compared the result with the following implementations; specially RECC [12] and AVL-Headers/AVL-KDC [13]. The obtained results proved that the proposed algorithm can outperform other approaches based on the ECC.…”
Section: The Proposed Methodsmentioning
confidence: 87%
“…They receive and then transmit nodes messages to the base station. The ECC keys generation and storage in the AVL tree are done by the base station while distribution is done either by a KDC server or by CH [13]. In AVL-KDC approach, when a node arrives or leaves the network, the KDC server starts updating public keys located throughout the node path to the base of the AVL tree and reconfigures the AVL tree.…”
Section: B-avl-headers and Avl-kdcmentioning
confidence: 99%
“…Thereafter, we described the proposed approach and its added value by algorithms and explanations of each phase. In the last section, we analyzed the different algorithms and compared the performance of each approach [12]- [13] by looking at: the average energy consumed per node, the memory used by node for storing ECC keys, the number of packets exchanged when installing keys and ECC keys computing time and rekeying.…”
To maintain the proper functioning of critical applications based on Wireless Sensor Networks, we must provide an acceptable level of security while taking into account limited capabilities of the sensors. In this paper we proposed a mobile approach to secure data exchanged by structured nodes in cluster. The approach is based on mobile nodes with significant calculation and energy resources that allow cryptographic key management and periodic rekeying. However, mobility in wireless sensor networks aims to increase the security and lifetime of the entire
network. The technical methods used in this paper are based on cryptography elliptic curves and key management through a balanced binary tree. To compare the performance of the proposed approach with other mobile algorithms, we focused on the following metrics: the energy
consumed by normal sensors and cluster heads, the number of packets exchanged during key installation, time to generate and distribute cryptographic keys, and the memory used by the different sensors to store keys.
“…[21] Proposes an algorithm for indexing the keyword extracted from the web documents along with their context based on AVL tree. [22] Used them in Wireless sensor network to provide a security protocol. Also [23] has used this structure in data mining classification for a decision tree induction.…”
Since the invention of AVL trees in 1962 and Red-black trees in 1978, researchers were divided in two separated communities, AVL supporters and Red-Black ones. Indeed, AVL trees are commonly used for retrieval applications whereas Red Black trees are used in updates operations, so, the choice of a structure must be done firstly even if the operations are not known to be searches or updates. That is the main reason why we propose a common tree with the same complexity and memory space, representing both an AVL and a Red-Black tree, this new tree allows to gather together the two communities on one hand, and to expand the scope of AVL and Red-Black tree applications on the other hand.
“…The next two papers deal with the design and use of efficient data structures for mobile P2P networks and WSN. H. Boumerzoug et al propose the use the AVL tree and elliptic curve cryptography to design an efficient lightweight key management scheme for WSN. Y. Feng et al further explore error‐resilient routing and load balancing strategies that can be employed in the hierarchically distributed tree, in order to better support multidimensional range queries in the mobile P2P overlay network.…”
This special issue is intended to collect state-of-the-art research works that include a set of concepts for wireless networking. This issue also presents the objective of enabling access to future trends and directions in the scope of wireless networking and communication, covering wireless sensor networks (WSN), wireless multimedia, and peer-to-peer (P2P) networking.Five articles have been chosen using a strict selective process; all articles have been thoroughly reviewed by highly qualified anonymous referees. The articles cover a variety of important and challenging topics in the areas of wireless communication and mobile networking [1][2][3][4].With the increasing demand for video streaming over mobile networks, we are witnessing a growing interest in designing new three-dimensional (3D) streaming protocols for mobile ad hoc networks [5,6].Although a great amount of work [5,6] has been dedicated to video streaming or real-time streaming, a few studies have concentrated on 3D streaming over mobile devices [7,8]. In the first paper of this special issue, H. Maamar et al.[9] present an efficient multihop supplying partner protocol, coupled with an original content delivery technique for mobile ad hoc network-based 3D streaming systems. The proposed protocol successfully manages to determine the potential sources that hold the relevant 3D data while overcoming the limitations of wireless medium.The next two papers are motivated by the problem of efficient energy consumption and collecting data from WSN [1, 2, 10, 11]. C. M. Angelopoulos et al. [12] propose a novel random walk for WSN, which they refer to as 'γ-stretched random walk', coupled with an original scheme that favors visiting distant neighbors of the current node in order to further reduce any potential nodes overlap of potential nodes, while extending WSN coverage time. Meanwhile, S. Clement et al.[13] present a novel energy harvesting model to extend WSN lifetime. The proposed model has been validated against a real and fully functional prototype, and encouraging results have been obtained.The next two papers deal with the design and use of efficient data structures for mobile P2P networks [14] and WSN. H. Boumerzoug et al. [15] propose the use the AVL tree and elliptic curve cryptography to design an efficient lightweight key management scheme for WSN. Y. Feng et al. [16] further explore error-resilient routing and load balancing strategies that can be employed in the hierarchically distributed tree, in order to better support multidimensional range queries in the mobile P2P overlay network.
ACKNOWLEDGEMENTSThe guest editor of this special issue wishes to express sincere gratitude to all the authors who contributed with their works for this issue. We wish to thank the anonymous reviewers who donated their time and effort to the reviewing process. Without them, this high-quality issue would not be possible. We hope that this selection of works will serve as a great inspiration and foster advancements in distribution simulations and real-time appl...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.