207088 633815660985047486
•Télécharger en tant que PPT, PDF•
0 j'aime•491 vues
ppt on adhoc networks
![Contents ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommandé
Contenu connexe
Tendances
Tendances (20)
En vedette
En vedette (20)
Similaire à 207088 633815660985047486
Similaire à 207088 633815660985047486 (20)
Dernier
Dernier (20)
207088 633815660985047486
- 1. Saad Shahid BS Telecommunications Systems 5 th Semester BZU Multan Ad-hoc Networks
- 3. Ad Hoc Networks The Need of “TIME”. Today the networks normally developed are of the type having some fixed infrastructure. What would be the solution if the network is required to be made for some short period of time?
- 14. Data Routing
- 15. Data Routing
- 16. Route Discovery in Mobile Ad-hoc Networks
- 17. Route Discovery in Mobile Ad-hoc Networks
- 19. Cont’d…
- 20. Cont’d…
- 21. Cont’d…
- 22. Cont’d…
- 32. Difference between Cellular and Ad-hoc Networks Cellular Networks Ad-hoc Networks Fixed, pre-located cell sites and base stations. No fixed base stations, very rapid deployment. Static backbone network topology Highly dynamic network topologies, with multi-hop. Relatively favorable environment and stable connectivity. Hostile environment (losses, noise) and irregular connectivity. Detailed planning before base stations can be installed. Ad-hoc network automatically forms and conforms to change.
- 35. Thanks for Your Concentration. Any from your side is welcomed?
Notes de l'éditeur
- also collection of nodes or terminals that communicate with each other by forming a multi-hop network and maintaining connectivity in a decentralized manner.
- a node S that has to send packet P to the node D. Represents that connected nodes are within each other’s transmission range Represents a node that received the packet for the first time. Represents the broadcast transmission of packet P. This broadcast transmission of data is known as the Flooding for Data Delivery. Sequence numbers are used to avoid the possibility of resending the same packet more than once. The node receiving the packet P forwards it to other nodes and also transmits it in the reverse direction. Node C receives the packet P from G and H but does not forward it again because node C has already forwarded packet P once.
- Node D finally receives the packet from the two neighbors, keeps the first received and discards the other. Node D does not forward packet P, because node D is the intended destination of packet P. Nodes unreachable from S do not receive packet P (e.g., node Z). Nodes for which all paths from S go through the destination D also do not receive packet P (example: node N). This process results in a much higher overhead.