Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  sensor nodes
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
Wireless Sensor Network (WSN) technology has grown in importance in recent years. All WSN implementations need secure data transmission between sensor nodes and base stations. Sensor node attacks introduce new threats to the WSN. As a result, an appropriate Intrusion Detection System (IDS) is required in WSN for defending against security attacks and detecting attacks on sensor nodes. In this study, we use the Routing Protocol for Low Power and Lossy Networks (RPL) for addressing security services in WSN by identifying IDS with a network size of more or less 20 nodes and introducing 10% malicious nodes. The method described above is used on Cooja in the VMware virtual machine Workstation with the InstantContiki2.7 operating system. To track the movement of nodes, find network attacks, and spot dropped packets during IDS in WSN, an algorithm is implemented in the Network Simulator (NS2) using the Ad-hoc On-Demand Distance Vector (AODV) protocol in the Linux operating system.
EN
With an explosive growth of wireless sensor networks (WSN), many of their features and applications have become important. Localization of sensor nodes is one of the most important problems in WSN whose accuracy has a very large impact on its performance. Global positioning system (GPS) is a well-known and powerful way which differentiates methods of its use on each node individually. But, because of high energy consuming and processing GPS, it is inappropriate for WSNs. Different algorithms are suggested to overcome the consumed cost of GPS by putting GPS on only some nodes instead of all nodes in the network for localization. So, for nodes localization, just a number of nodes exploit GPS and, they can help other nodes of network in localization via distribution of their coordinates. The use of a mobile robot to send signals to coordinate the target node localization is a good idea. The mobile robot should move in the right path and can localize node more accurately at lower cost. This paper proposes a new method to localize all nodes through some localized nodes based on graph theory in a tree and network topology. The proposed method provides better performance at the cost of accuracy and the number of nodes that can be made up of local consumption.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.