Name Modified Size Downloads / Week Status
solution_N5.dat 2011-12-24 410 Bytes 0
README.txt 2011-12-24 1.2 kB 0
unique_notunique.cpp 2011-12-24 5.2 kB 0
tot_comb.cpp 2011-12-24 726 Bytes 0
collision.cpp 2011-12-24 7.0 kB 0
Totals: 5 Items   14.5 kB
FULLTEXT For the fulltext of the paper visit: http://arxiv.org/abs/1007.1100 FILES 1) tot_comb.cpp - For a given number of maximum "1" bits (n), finds the number of permutations which can be generated using 1<=k<=n "1" bits and corresponding n-k "0" bits. This is useful in deciding the minimum number of bits required to generate unique bitpatterns for a specified network size. 2) collision.cpp - For a specified number of bits and network size, runs an exhaustive search algorithm to find out whether the given number of bits will generate a bit pattern scheme for all the nodes of the network which results in unique bit patterns for all the combination of packet collision. Output file patterns.dat generates the initial bit patterns which resulted in unique patterns. Output file result.dat generates the results of the combination of all packet collision. 3) unique_notunique.cpp - Given a matrix of binary bit patterns, the program tells whether that given binary bit pattern generate combination packet collisions which are unique or not. NOTE Using the exhaustive search approach, we were only able to find optimal solution for a network of size 7 receivers.
Source: README.txt, updated 2011-12-24

Thanks for helping keep SourceForge clean.

Screenshot instructions:
Red Hat Linux   Ubuntu

Click URL instructions:
Right-click on ad, choose "Copy Link", then paste here →
(This may not be possible with some types of ads)

More information about our ad policies

Briefly describe the problem (required):

Upload screenshot of ad (required):
Select a file, or drag & drop file here.

Please provide the ad click URL, if possible:

Get latest updates about Open Source Projects, Conferences and News.

Sign up for the SourceForge newsletter:

No, thanks