(<< back)

This page is a collections of projects on which I've worked while pursuing the PhD. Unless otherwise noted, all materials have been produced by me.

Packet Out-of-orderness in a PSFQ Network

Summer 2007

During the summer, I wrote a few programs that allowed us to investigate the order in which packets arrive to nodes in a PSFQ wireless network. The following is a description of these programs and the measure of order used.
All programs listed below are single source programs. They may all be compiled by: 
  %cc file.c -o prog.x
The measure program is designed to accept input directly from the packet generation programs: 
  $./gen-all.x -n 5 | ./measure.x   # produces stats for all packet orders of size 5
  1. Generate all orders of packets sized N
  2. Simulate packet arrival ordering given some chance of a successful send
  3. Measure M2 order and generate statistics for packet orders generated using the programs above

LooseMAC Simulator

Spring 2007

The following is a Perl program that attempts to simulate the LooseMAC algorithm.
  1. Presentation 1 - problem introduction
  2. Presentation 2 - simulator details
  3. loosemac.pl - the simulator
    input 1 - linear conflict
    input 2 - linear graph
    input 3 - simple conflict
    input 4 - square graph

(<< back)

Copyright © 2004-2009. All Rights Reserved. The statements and opinions included in these pages are those of me only. Any statements and opinions included in these pages are not those of Louisiana State University or the LSU Board of Supervisors.