Random Linear Codes in Limited Resource Environments- 05/05/2006

Andrew Hagedorn

The algorithm for Random Linear Codes is put forth in "Fast data access over asymmetric channels using fair and secure bandwidth sharing" by Agarwal, Laifenfeld, Trachtenberg, and Alanyali. From this algorithm an implementation has been developed with emphasis on efficient data structures to minimize memory use and computation complexity. This implementation will allow the algorithm to be implemented in a wireless sensor network based on MICA2 motes (which have severely limited resources) that resides on the fourth floor of the Photonics building. Current and future work is detailed.