Routing in ad-networks has been a challenging task ever since the wireless networks came into existence. The major reason for this is the constant change in network topology because of the high degree of node mobility. Hence a dynamic routing protocol is needed for these networks to function properly. These protocols using a blind flooding mechanism for broadcasting messages from one to another node. The major drawback of this mechanism is the broadcast storm problem because lots of contention and collision exist in the network and the blind flooding approach may increase broadcast redundancy. In this book, we are proposing an approximation algorithm for the mobile ad hoc network. The proposed mechanism is able to reduce the broadcast redundancy and helps to avoid the broadcast redundancy problem. This work proposes an approach based on the theory of neighbor knowledge to improve the construction of Minimal CDS in the mobile ad hoc network. With the help of the new algorithm, the average message burden of the network could be reduced so that routing becomes much easier and can adapt quickly to network topology changes.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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 -Routing in ad-networks has been a challenging task ever since the wireless networks came into existence. The major reason for this is the constant change in network topology because of the high degree of node mobility. Hence a dynamic routing protocol is needed for these networks to function properly. These protocols using a blind flooding mechanism for broadcasting messages from one to another node. The major drawback of this mechanism is the broadcast storm problem because lots of contention and collision exist in the network and the blind flooding approach may increase broadcast redundancy. In this book, we are proposing an approximation algorithm for the mobile ad hoc network. The proposed mechanism is able to reduce the broadcast redundancy and helps to avoid the broadcast redundancy problem. This work proposes an approach based on the theory of neighbor knowledge to improve the construction of Minimal CDS in the mobile ad hoc network. With the help of the new algorithm, the average message burden of the network could be reduced so that routing becomes much easier and can adapt quickly to network topology changes. 76 pp. Englisch. N° de réf. du vendeur 9786203042115
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Tamrakar SitendraDr. Sitendra Tamrakar, is working at Dept. of Computer Science & Engineering, Nalla Malla Reddy Engineering College, Hyderabad. Presently he is serving as Associate Professor. He has 15 years of teaching and research. N° de réf. du vendeur 459164193
Quantité disponible : Plus de 20 disponibles
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Routing in ad-networks has been a challenging task ever since the wireless networks came into existence. The major reason for this is the constant change in network topology because of the high degree of node mobility. Hence a dynamic routing protocol is needed for these networks to function properly. These protocols using a blind flooding mechanism for broadcasting messages from one to another node. The major drawback of this mechanism is the broadcast storm problem because lots of contention and collision exist in the network and the blind flooding approach may increase broadcast redundancy. In this book, we are proposing an approximation algorithm for the mobile ad hoc network. The proposed mechanism is able to reduce the broadcast redundancy and helps to avoid the broadcast redundancy problem. This work proposes an approach based on the theory of neighbor knowledge to improve the construction of Minimal CDS in the mobile ad hoc network. With the help of the new algorithm, the average message burden of the network could be reduced so that routing becomes much easier and can adapt quickly to network topology changes.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 76 pp. Englisch. N° de réf. du vendeur 9786203042115
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Routing in ad-networks has been a challenging task ever since the wireless networks came into existence. The major reason for this is the constant change in network topology because of the high degree of node mobility. Hence a dynamic routing protocol is needed for these networks to function properly. These protocols using a blind flooding mechanism for broadcasting messages from one to another node. The major drawback of this mechanism is the broadcast storm problem because lots of contention and collision exist in the network and the blind flooding approach may increase broadcast redundancy. In this book, we are proposing an approximation algorithm for the mobile ad hoc network. The proposed mechanism is able to reduce the broadcast redundancy and helps to avoid the broadcast redundancy problem. This work proposes an approach based on the theory of neighbor knowledge to improve the construction of Minimal CDS in the mobile ad hoc network. With the help of the new algorithm, the average message burden of the network could be reduced so that routing becomes much easier and can adapt quickly to network topology changes. N° de réf. du vendeur 9786203042115
Quantité disponible : 1 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Dealing with broadcast storm problem in Mobile Ad Hoc Networks | Reduction of Transmission Redundancy and Avoidance of Broadcast Storm Problem in Mobile Ad Hoc Networks | Sitendra Tamrakar | Taschenbuch | Englisch | 2021 | LAP LAMBERT Academic Publishing | EAN 9786203042115 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. N° de réf. du vendeur 119750204
Quantité disponible : 5 disponible(s)