Andere Kunden interessierten sich auch für
![Umgang mit dem Broadcast-Storm-Problem in mobilen Ad-hoc-Netzwerken]( "Umgang mit dem Broadcast-Storm-Problem in mobilen Ad-hoc-Netzwerken")
Umgang mit dem Broadcast-Storm-Problem in mobilen Ad-hoc-Netzwerken39,90 €![Omgaan met broadcast storm problem in Mobile Ad Hoc Networks]( "Omgaan met broadcast storm problem in Mobile Ad Hoc Networks")
Omgaan met broadcast storm problem in Mobile Ad Hoc Networks29,99 €![Affrontare il problema del broadcast storm nelle reti ad hoc mobili]( "Affrontare il problema del broadcast storm nelle reti ad hoc mobili")
Affrontare il problema del broadcast storm nelle reti ad hoc mobili29,99 €![Dealing with Elephants in the Internet]( "Dealing with Elephants in the Internet")
Dealing with Elephants in the Internet44,99 €![Evaluation of Probabilistic Broadcast in Mobile Adhoc Networks]( "Evaluation of Probabilistic Broadcast in Mobile Adhoc Networks")
Evaluation of Probabilistic Broadcast in Mobile Adhoc Networks26,99 €![ANTMANET: A Novel Routing Protocol for Mobile Ad-Hoc Networks]( "ANTMANET: A Novel Routing Protocol for Mobile Ad-Hoc Networks")
ANTMANET: A Novel Routing Protocol for Mobile Ad-Hoc Networks35,99 €![Broadcast Algorithm for Wireless Networks]( "Broadcast Algorithm for Wireless Networks")
Broadcast Algorithm for Wireless Networks26,99 €
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, theaverage message burden of the network could be reduced so that routing becomes much easier and can adapt quickly to network topology changes.