Difference between revisions of "software"
| Line 23: | Line 23: | ||
* More details at [[Probabilistic_Coverage_and_Connectivity | project page]] | * More details at [[Probabilistic_Coverage_and_Connectivity | project page]] | ||
| − | * Implementation of the Probabilistic Coverage Protocol (PCP) in NS-2 | + | * ''Implementation of the Probabilistic Coverage Protocol (PCP) in NS-2'' |
** [http://nsl.cs.sfu.ca/projects/wsn/PCP-NS-README ReadMe] | ** [http://nsl.cs.sfu.ca/projects/wsn/PCP-NS-README ReadMe] | ||
** [http://nsl.cs.sfu.ca/projects/wsn/pcp-ns.tar.gz Download Source Code] | ** [http://nsl.cs.sfu.ca/projects/wsn/pcp-ns.tar.gz Download Source Code] | ||
| − | * Implementation of the Probabilistic Coverage Protocol (PCP) in C++ | + | * ''Implementation of the Probabilistic Coverage Protocol (PCP) in C++'' |
** [http://nsl.cs.sfu.ca/projects/wsn/PCP-SenSim-README ReadMe] | ** [http://nsl.cs.sfu.ca/projects/wsn/PCP-SenSim-README ReadMe] | ||
** [http://nsl.cs.sfu.ca/projects/wsn/PCP-SenSim.tar.gz Download Source Code] | ** [http://nsl.cs.sfu.ca/projects/wsn/PCP-SenSim.tar.gz Download Source Code] | ||
Revision as of 11:58, 14 October 2010
This page contains a list of all the software that was developed at NSL as part organized by project with links to download the code.
Real Implementations
pCDN: Peer-assisted Content Distribution Network
Implementation
- ReadMe
- Latest Released Version
- Browse Source Code (Subver Server)
- Bug Tracking and Feature Suggestion System at: Bugzilla.
Simulators
svcAuth
Library + Simulator
PCP: Probabilistic Coverage Protocol
In this project, we consider probabilistic sensing and radio communication models in designing protocols for large-scale sensor networks. Probabilistic models are more realistic in capturing the characteristics of actual sensors than the over-simplified regular disk model.
- More details at project page
- Implementation of the Probabilistic Coverage Protocol (PCP) in NS-2
- Implementation of the Probabilistic Coverage Protocol (PCP) in C++
K-Coverage and its Application to Forest Fire Detection
In this project, we design new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been shown before that selecting the minimum set of sensors to activate from an already deployed sensors is NP-hard. We propose an efficient approximation algorithm which achieves a solution of size within a constant factor from the optimal. We are also interested in applying our k-coverage algorithms in designing a wireless sensor network for early detection of forest fires. Forest fires, also known as wild fires, are uncontrolled fires occurring in wild areas and cause significant damage to natural and human resources. Forest fires eradicate forests, burn the infrastructure, and may result in high human death toll near urban areas. In the province of British Columbia alone, there have been 2,590 forest fires during 2006. These burned 131,086 hectares and costed about $156 million. (Source: BC Ministry of Forests and Range.) Wireless sensor networks could help in reducing some of the damages caused by forest fires.
- More details at project page
- Implementation of the Centralized Randomized K-Coverage Protocols (RKC) in C++
- ReadMe
- Download Source Code
- Subversion
- Implementation of the Decentralized Randomized K-Coverage Protocols (DRKC) in C++
- ReadMe
- Download Source Code
- Subversion
NC+SVC
Simulator
efficient multimedia broadcast over mobile WiMAX networks
Simulator
