||In this thesis, the fundamental knowledge about wireless localization is first introduced. The compressed sensing techniques exploiting the signal sparsity can increase the efficiency of data collection and thus are widely investigated. Some linear programming algorithms can be adopted to solve the range-free localization problem from compressive sensing, such as the simplex algorithm, interior-point algorithm, and OMP algorithm. |
The steps of the simplex algorithm perform as follows: listing a tableau, finding an entering variable, and pivoting. In our simulation environments, the network sizes are set to 5m×5m, 7.5m×7.5m, 10m×10m with grid sizes 12×12, 18×18, 24×24. Several sensor nodes are spread inside the network close to the boundary to provide the measurements of received signal strengths. From the simulation results, we show that the performance of the simplex algorithm approaches to that of the interior-point algorithm for l_1 optimization. However, the complexity of the former is much less. Consequently, the implementation of the simplex algorithm is considered. Since the simplex algorithm is an iterative algorithm, the error will be easily accumulated. Thus, a floating-point representation with total 25 bits is adopted for the data path. The hardware parallelism will affect the complexity and execution clock cycles. After evaluation, the degree of parallelism is set to 13 to strike a balance between processing time and hardware complexity. As a result, the total execution time are 496 clock cycles for one iteration.
|| N. Patwari, J. N. Ash, S. Kyperountas, A. O. Hero, R. L. Moses and N. S. Correal, "Locating the nodes: cooperative localization in wireless sensor networks," in IEEE Signal Processing Magazine, vol. 22, no. 4, pp. 54-69, July 2005.|
 Waltenegus Dargie, Christian Poellabauer, “Fundamentals of Wireless Sensor Networks Theory and Practice”, 1st Edition, Wiley, 2010
 C. L. Wang, Y. W. Hong and Y. S. Dai, "A Decentralized Positioning Method for Wireless Sensor Networks Based on Weighted Interpolation," 2007 IEEE International Conference on Communications, Glasgow, 2007, pp. 3167-3172.
 C. H. Wang, 2012, Design and Implementation of Localization and Tracking in Wireless Sensor Network, Department of Electrical Engineering, National Central University, Taoyuan, Taiwan.
 翁偉泰, (2011). 數學規劃（一）Mathematical Programming (I). [.pdf] http://wtwengkm.iem.mcut.edu.tw/xms/index.php?courseID=21
 R. Fourer, (2005). III. Solving Linear Programs by Interior-Point Methods. [.pdf]. http://www.4er.org/CourseNotes/
 C. E. Shannon, "Communication In The Presence Of Noise," Proceedings of the IEEE, vol. 86, no. 2, pp. 447-457, Feb. 1998.
 E. J. Candes and M. B. Wakin, "An Introduction To Compressive Sampling," IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 21-30, March 2008.
 L. Carin, D. Liu and B. Guo, "Coherence, Compressive Sensing, and Random Sensor Arrays," in IEEE Antennas and Propagation Magazine, vol. 53, no. 4, pp. 28-39, Aug. 2011.
 Zouxy09, (2012). 壓缩感知（Compressive Sensing）學習之（二）, http://blog.csdn.net/zouxy09/article/details/8118329
 C. Feng, S. Valaee and Z. Tan, "Multiple Target Localization Using Compressive Sensing," IEEE Global Telecommunications Conference, 2009. GLOBECOM 2009. Honolulu, HI, 2009, pp. 1-6.
 S. S. Chen , D. L. Donoho and M. A. Saunders, "Atomic decomposition by basis pursuit", SIAM Rev., vol. 43, no. 1, pp. 129-159, 2001
 R. Andraka, "A Survey of CORDIC Algorithms for FPGA-Based Computers," Proc. Sixth ACM/SIGDA Int′,l Symp. Field Programmable Gate Array (FPGA ′,98), pp. 191-200, Feb. 1998.
 S. Pongyupinpanich, F. A. Samman, M. Glesner and S. Singhaniyom, "Design and evaluation of a floating-point division operator based on CORDIC algorithm," Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON), 2012 9th International Conference on, Phetchaburi, 2012, pp. 1-4.
 J. Wang, S. Kwon, and B. Shim, “Generalized orthogonal matching pursuit,”IEEE Transactions on Signal Processing, Vol. 60, pp. 6202-6216, Dec. 2012.