Paper Recommendation
2000 Energy Conserving Routing in Wireless Ad-hoc Networks

1982 A Responsive Distributed Routing Algorithm For Computer Networks

1997 A Discrete Binary Version of The Particle Swarm Algorithm

1974 A Protocol For Packet Network intercommunication

1997 Modeling internet Topology

1992 Field-programmable Gate Arrays

2000 The Capacity of Wireless Networks

1981 Distributed Algorithms For Generating Loop-Free Routes in Networks With Frequently Changing Topology

1980 The New Routing Algorithm For The ARPANET

1979 Distributed Simulation: A Case Study in Design and Verification of Distributed Programs

1987 On Packet Switches With infinite Storage

1987 Routing and Addressing Problems in Large Metropolitan-Scale internetworks

1994 Fat-trees: Universal Networks For Hardware-efficient Supercomputing

2003 Chord: A Scalable Peer-to-peer Lookup Protocol For internet Applications

2000 Max-min D-cluster Formation in Wireless Ad Hoc Networks

1997 Routing in Ad-hoc Networks Using Minimum Connected Dominating Sets

2002 Wireless Sensor Networks: A Survey

1996 Routing and Channel Assignment For Low Power Transmission in PCS

1985 Tight Bounds on The Complexity of Parallel Sorting

1988 Link Scheduling in Polynomial Time