User:Ligang: Difference between revisions

From
Jump to navigation Jump to search
 
(4 intermediate revisions by the same user not shown)
Line 3: Line 3:




== Links ==
== Paper Links ==


* Wireless Network Protocols
* Wireless Network Protocols
Line 18: Line 18:
[1]Rimon Barr, Zygmunt J. Haas, and Robbert van Renesse, JiST: An efficient approach to simulation using virtual machines. Software Practice & Experience, http://jist.ece.cornell.edu/docs/040827-jist-vmsim-spe.pdf
[1]Rimon Barr, Zygmunt J. Haas, and Robbert van Renesse, JiST: An efficient approach to simulation using virtual machines. Software Practice & Experience, http://jist.ece.cornell.edu/docs/040827-jist-vmsim-spe.pdf


*Dynamic Path Repairing
[1]Jing Deng, Richard Han and Shivakant Mishra, A Robust and Light-Weight Routing Mechanism for Wireless Sensor Networks, http://www.cs.colorado.edu/~rhan/diwans04.pdf

Abstract:This paper presents a light-weight, dependable routing mechanism for communication between sensor nodes and a base station in a wireless sensor network. This mechanism tolerates failures of random individual nodes in the network or a small part of the network. The mechanism is light weight in the sense that every node does only local routing maintenance, needs to record only its neighbor nodes' information, and incurs no extra routing overhead during failure-free periods. It dynamically discovers new routes when an intermediate node or a small part of the network in the path from a sensor node to a base station fails.

== Simulation Tool Links ==


* Sensor Network Simulation Tools
* Sensor Network Simulation Tools
Line 26: Line 32:
[2]Javis Network Animator for JiST/SWANS simulator,http://www.cs.technion.ac.il/~gabik/Javis4Swans.html
[2]Javis Network Animator for JiST/SWANS simulator,http://www.cs.technion.ac.il/~gabik/Javis4Swans.html


== Talk Links ==


* Takls of Other Researchers
* Takls of Other Researchers


[1]Adam Wolisz. Towards a service definition for (Wireless) Sensor Networks. http://www.vs.inf.ethz.ch/events/esf-wsn04/talks/wolisz.pdf
[1]Adam Wolisz. Towards a service definition for (Wireless) Sensor Networks. http://www.vs.inf.ethz.ch/events/esf-wsn04/talks/wolisz.pdf


== Related Research Orgnization Links ==


* Links to Other Research Group
* Links to Other Research Group


[1]ETH Zurich, http://www.vs.inf.ethz.ch/
[1]ETH Zurich, http://www.vs.inf.ethz.ch/

[2]DISCOVER Lab Canada, http://www.discover.uottawa.ca/

Latest revision as of 08:38, 23 March 2006


Paper Links

  • Wireless Network Protocols

[1]David B. Johnson and David A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks, http://wisl.ece.cornell.edu/ECE794/Mar5/johnson-dsr.pdf

[2]A. Helal, N. Desai, V. Verma, and C. Lee, Konark:A Service Discovery and Delivery Protocol for Ad-Hoc Networks,http://www.harris.cise.ufl.edu/projects/publications/konark_wcnc2003.pdf

[3]David Braginsky, Deborah Estrin, Rumor Routing Algorithm For Sensor Networks,http://www.cse.nd.edu/~surendar/conferences/wsna02/papers/p22-braginsky.pdf

[4]Amit Kumar Saha, Khoa Anh To, Santashil PalChaudhuri, Shu Du, David B. Johnson, Physical Implementation and Evaluation of Ad Hoc Network Routing Protocols using Unmodified Simulation Models, http://www.monarch.cs.rice.edu/monarch-papers/sigcomm2005.pdf

  • Simulation

[1]Rimon Barr, Zygmunt J. Haas, and Robbert van Renesse, JiST: An efficient approach to simulation using virtual machines. Software Practice & Experience, http://jist.ece.cornell.edu/docs/040827-jist-vmsim-spe.pdf

  • Dynamic Path Repairing

[1]Jing Deng, Richard Han and Shivakant Mishra, A Robust and Light-Weight Routing Mechanism for Wireless Sensor Networks, http://www.cs.colorado.edu/~rhan/diwans04.pdf

Abstract:This paper presents a light-weight, dependable routing mechanism for communication between sensor nodes and a base station in a wireless sensor network. This mechanism tolerates failures of random individual nodes in the network or a small part of the network. The mechanism is light weight in the sense that every node does only local routing maintenance, needs to record only its neighbor nodes' information, and incurs no extra routing overhead during failure-free periods. It dynamically discovers new routes when an intermediate node or a small part of the network in the path from a sensor node to a base station fails.

Simulation Tool Links

  • Sensor Network Simulation Tools

[1]JiST/SWANS (Java in Simulation Time / Scalable Wireless Ad hoc Network Simulator ),http://jist.ece.cornell.edu/

[2]Javis Network Animator for JiST/SWANS simulator,http://www.cs.technion.ac.il/~gabik/Javis4Swans.html

Talk Links

  • Takls of Other Researchers

[1]Adam Wolisz. Towards a service definition for (Wireless) Sensor Networks. http://www.vs.inf.ethz.ch/events/esf-wsn04/talks/wolisz.pdf


Related Research Orgnization Links

  • Links to Other Research Group

[1]ETH Zurich, http://www.vs.inf.ethz.ch/

[2]DISCOVER Lab Canada, http://www.discover.uottawa.ca/