Welcome![Sign In][Sign Up]
Location:
Search - Greedy Perimeter stateless Routing

Search list

[matlabAODV_2

Description: 这是一个基于贪婪算法和右手法则基础上得到的路由仿真程序。对于初学者还是有借鉴意义的!-Greedy Perimeter Stateless Routing for Wireless Networks and right hand rule
Platform: | Size: 1024 | Author: 庆栋梁 | Hits:

[OtherGPSR-SCRIPT-VoIP-NoBAckgrounTRaffic

Description: TCl Script for simulating mobile ad hoc network using greedy perimeter stateless routing and application is VoIP with no background traffic
Platform: | Size: 4096 | Author: as-sundais | Hits:

[OtherGPSR-SCRIPT-VoIP-WithBAckgrounTRaffic

Description: TCl Script for simulating mobile ad hoc network using greedy perimeter stateless routing and application is VoIP with background traffic
Platform: | Size: 4096 | Author: as-sundais | Hits:

[OthermeasuretoolsGPSR.NS2

Description: MEasurement tools for calculate Packet Delivery fraction and normalized routing load for greedy perimeter stateless routing
Platform: | Size: 1024 | Author: as-sundais | Hits:

[matlabgprs

Description: greedy perimeter stateless routing(GPSR)
Platform: | Size: 2048 | Author: banafshe | Hits:

[Othergpsr.tar

Description: gpsr protocol Greedy Perimeter Stateless Routing (GPSR) In wireless networks comprised of numerous mobile stations, the routing problem of finding paths a traffic source to a traffic destination through a series of intermediate forwarding nodes is particularly challenging. When nodes move, the topology of the network can change rapidly. Such networks require a responsive routing algorithm that finds valid routes quickly as the topology changes and old routes break. Yet the limited capacity of the network channel demands efficient routing algorithms and protocols, that do not drive the network into a congested state as they learn new routes. The tension between these two goals, responsiveness and bandwidth efficiency, is the essence of the mobile routing problem. -gpsr protocol Greedy Perimeter Stateless Routing (GPSR) In wireless networks comprised of numerous mobile stations, the routing problem of finding paths a traffic source to a traffic destination through a series of intermediate forwarding nodes is particularly challenging. When nodes move, the topology of the network can change rapidly. Such networks require a responsive routing algorithm that finds valid routes quickly as the topology changes and old routes break. Yet the limited capacity of the network channel demands efficient routing algorithms and protocols, that do not drive the network into a congested state as they learn new routes. The tension between these two goals, responsiveness and bandwidth efficiency, is the essence of the mobile routing problem.
Platform: | Size: 943104 | Author: neeraj singla | Hits:

[OtherGPSR-Greedy-Perimeter-Stateless-Routing-for-Wirel

Description: gpsr greedy perimeter stateless rooting protocol
Platform: | Size: 182272 | Author: sam | Hits:

CodeBus www.codebus.net