Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

41

MASCOTS
2001

favoriteEmaildiscussreport

124views Modeling And Simulation» more MASCOTS 2001»

Minimizing Routing State for Light-Weight Network Simulation

14 years 16 days ago

Minimizing Routing State for Light-Weight Network Simulation

Download nslab.ee.ntu.edu.tw

We introduce a routing mechanism, referred to as algorithmic routing. It is a viable routing alternative for network simulations with minimal space complexity

Polly Huang, John S. Heidemann

Real-time Traffic

Algorithmic Routing | MASCOTS 2001 | MASCOTS 2007 | Network Simulations | Viable Routing Alternative |

claim paper

Related Content

» A LightWeight Client Mobility Approach for Infrastructure Mesh Networks

» Minimizing recovery state In geographic adhoc routing

» S4 Small State and Small Stretch Compact Routing Protocol for Large Static Wireless Networ...

» NETSAQ Network State Adaptive QoS Provisioning for MANETs

» S4 Small State and Small Stretch Routing Protocol for Large Wireless Sensor Networks

» Simulations of the Impact of Controlled Mobility for Routing Protocols

» Cost and Collision Minimizing Forwarding Schemes for Wireless Sensor Networks

» Distributed Routing for Vehicular Ad Hoc Networks ThroughputDelay Tradeoff

» A Neural Network Approach to Routing in Multihop Radio Networks

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	MASCOTS
Authors	Polly Huang, John S. Heidemann

Comments (0)