The objective of this research is to focus on handling QoS for Wireless Sensor Network (WSN). Packet dropping and modifying is common attack in wireless sensor networks. These attacks interrupt the communication network and are difficult to identify in multi hop sensor networks. This paper presents an effective scheme to identify the packet droppers and modifiers by using ranking algorithms on the DAG generated by the nodes in the network. Simulation results are presented. Analysis of the performance of prominent routing protocols used in Wireless sensor networks with respect to throughput, routing overhead, PDR, delay. These parameters are calculated for the routing protocols AODV, DSDV, TORA, LEACH and the performance is measured and compared for the parameters to improve QoS of WSN. Wireless sensor network can get separated into multiple connected components due to the failure of some of its nodes, which is called a “cut.” In this paper, we consider the problem of detecting cuts by the remaining nodes of a wireless sensor network. We propose an algorithm that allows 1) every node to detect when the connectivity to a specially designated node has been lost, and 2) one or more nodes (that are connected to the special node after the cut) to detect the occurrence of the cut. The algorithm is distributed and asynchronous: every node needs to communicate with only those nodes that are within its communication range. The algorithm is based on the iterative computation of a fictitious “electrical potential” of the nodes. The convergence rate of the underlying iterative scheme is independent of the size and structure of the network.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9789994980574
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L0-9789994980574
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L0-9789994980574
Quantité disponible : Plus de 20 disponibles
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 87 pages. 6.00x0.20x9.00 inches. In Stock. N° de réf. du vendeur x-9994980572
Quantité disponible : 2 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9789994980574_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. N° de réf. du vendeur 26397672722
Quantité disponible : 4 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand. N° de réf. du vendeur 398704333
Quantité disponible : 4 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND. N° de réf. du vendeur 18397672728
Quantité disponible : 4 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The objective of this research is to focus on handling QoS for Wireless Sensor Network (WSN). Packet dropping and modifying is common attack in wireless sensor networks. These attacks interrupt the communication network and are difficult to identify in multi hop sensor networks. This paper presents an effective scheme to identify the packet droppers and modifiers by using ranking algorithms on the DAG generated by the nodes in the network. Simulation results are presented.Analysis of the performance of prominent routing protocols used in Wireless sensor networks with respect to throughput, routing overhead, PDR, delay. These parameters are calculated for the routing protocols AODV, DSDV, TORA, LEACH and the performance is measured and compared for the parameters to improve QoS of WSN.Wireless sensor network can get separated into multiple connected components due to the failure of some of its nodes, which is called a 'cut.' In this paper, we consider the problem of detecting cuts by the remaining nodes of a wireless sensor network. We propose an algorithm that allows 1) every node to detect when the connectivity to a specially designated node has been lost, and 2) one or more nodes (that are connected to the special node after the cut) to detect the occurrence of the cut. The algorithm is distributed and asynchronous: every node needs to communicate with only those nodes that are within its communication range. The algorithm is based on the iterative computation of a fictitious 'electrical potential' of the nodes.The convergence rate of the underlying iterative scheme is independent of the size and structure of the network. 88 pp. Englisch. N° de réf. du vendeur 9789994980574
Quantité disponible : 2 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -The objective of this research is to focus on handling QoS for Wireless Sensor Network (WSN). Packet dropping and modifying is common attack in wireless sensor networks. These attacks interrupt the communication network and are difficult to identify in multi hop sensor networks. This paper presents an effective scheme to identify the packet droppers and modifiers by using ranking algorithms on the DAG generated by the nodes in the network. Simulation results are presented.Analysis of the performance of prominent routing protocols used in Wireless sensor networks with respect to throughput, routing overhead, PDR, delay. These parameters are calculated for the routing protocols AODV, DSDV, TORA, LEACH and the performance is measured and compared for the parameters to improve QoS of WSN.Wireless sensor network can get separated into multiple connected components due to the failure of some of its nodes, which is called a 'cut.' In this paper, we consider the problem of detecting cuts by the remaining nodes of a wireless sensor network. We propose an algorithm that allows 1) every node to detect when the connectivity to a specially designated node has been lost, and 2) one or more nodes (that are connected to the special node after the cut) to detect the occurrence of the cut. The algorithm is distributed and asynchronous: every node needs to communicate with only those nodes that are within its communication range. The algorithm is based on the iterative computation of a fictitious 'electrical potential' of the nodes.The convergence rate of the underlying iterative scheme is independent of the size and structure of the network.Libri GmbH, Europaallee 1, 36244 Bad Hersfeld 88 pp. Englisch. N° de réf. du vendeur 9789994980574
Quantité disponible : 1 disponible(s)