Paper Review of PBPO

Decentralized detection
Tsitsiklis has shown that the computational complexity of determining the optimal strategy is exponential in the number of sensors.

An algorithm for determining the decision thresholds in a distributed detection problem
Tang et al. have addressed a number of issues, e.g., the effect of different starting points, variations in costs, number and quality of local detectors, etc.

Optimization of detection networks. I. Tandem structures
Optimization of detection networks. II. Tree structures
Tang found the PBPO algorithm was most efficient but more sensitive to initial larg number of sensors. But the other three algorithms were found to be more robust to initial conditions.

Direction of Research About Fault Tolerance

Optimal 4x10 Code Matrix (min. Hamm dist = 5)

1 1 1 1 1 0 0 0 0 0
1 1 1 1 1 1 1 1 1 1
0 0 0 0 0 1 1 1 1 1
0 0 0 0 0 0 0 0 0 0

Proof ?
Design ?

Direction of The Recent Research

1. Tolerance to the certain sensors in specail cases.
2. Simulated annealing algorithm for the large code matrix.
3. Proof of the same tolerance for the same characterized codematrix.
4. (Hans) Simplify the process of PBPO.
   

The Note for Full Paper

1. Introduction
   
   
   • WSN
   
   
   • Wang's paper
   
   
2. Problem Statements and Previous Works


3. Our scheme
   
   
   1. Two-Dimensional code
      
      
      • Better performance
      
      
      • higher
   
   
   2. Repetition code
      
      
      • work performance
      
      
      • lower cost
      
      
      • flexible
   
   
4. Analyze


5. New Code design & Faluty tolerance (Proof)


6. Simulations


7. Conclusion

中央的研討會 WASN 截稿日

今天是中央研討會 WASN 的截稿日。雖然只是台灣一個小小的 conference，但這是我進入 wireless sensor networks 這個領域以來，「比較」屬於自己的（用「比較」這個詞，代表老闆還是出了一些關鍵性的意見，學弟 Hans 也在開始的時候幫了不少忙）。雖然是中文寫的，不過句型都很明朗簡單，將來翻成英文應該不難。關於證明的部分，所長建議再補證一些部分，應該可以很快完成。

摘錄要點如下：

當在 DCFECC 方法中，code matrix 若符合下列條件，則具有相同特性（錯誤率）

• 任意 column 互換組合。
• 任意 column 中，每個元素反相。
• 矩陣上下顛倒。

因此，根據上述規則，我們可以縮少要尋找的 code matrix 個數，達到搜尋 global optimal code matrix 的目的。


接下來就全力衝 ICPADS 的 presentation了。

The best code mtarix (4 x 20)

Code Name: Hans-Tain Code #2


RCOST = 0.199613

codematrix = [
1 0 0 1 0 1 0 0 1 1 0 0 0 1 0 1 0 0 1 1;
0 1 0 0 0 0 0 1 0 1 1 0 0 0 0 0 0 1 0 1;
0 0 1 0 1 0 1 1 0 0 1 1 1 0 1 0 1 1 0 0;
1 1 0 1 1 1 1 0 0 0 0 1 0 1 1 1 1 0 0 0; ]

X-Win32 for Matlab and Latexse

• X-Win32 download
• X-Win32 setup
• Edit Latex article employing X-Win32
  

Achievement 20050325

By the aid of Hans, the C program for simulated annealing (SA) algorithm could be ran in the server (pear.ce.ntpu.edu.tw) successfully. The problem occurred when the program was compiled by gcc was solved by the following command.

gcc -0 OuputFileName FileName.o -lm -L/usr/lib -L/usr/include -lstdc++

(Ref. 鳥哥的 Linux 私房菜)

The speed of this program is about six times faster than the program simulated by the matlab codes. The sub-optimal code matrix will be found and saved in the file "log.txt".

The sub-optimal code matrix (4 by 20) will be performed in the multi-detection & different multi-conveyance bit scheme for wireless sensor networks.

Test !!

Test !!
中文測試！！