Using Laplacian Eigenmap as Heuristic Information to Solve Nonlinear Constraints Defined on a Graph and Its Application in Distributed Range-Free Localization of Wireless Sensor Networks
Tóm tắt
In this paper, we are concerned with the problem of nonlinear inequalities defined on a graph. The feasible solution set to this problem is often infinity and Laplacian eigenmap is used as heuristic information to gain better performance in the solution. A continuous-time projected neural network, and the corresponding discrete-time projected neural network are both given to tackle this problem iteratively. The convergence of the neural networks are proven in theory. The effectiveness of the proposed neural networks are tested and compared with others via its applications in the range-free localization of wireless sensor networks. Simulations demonstrate the effectiveness of the proposed methods.
Tài liệu tham khảo
Jeong H, Tombor B, Albert R, Oltvai ZN, Barabasi AL (2000) The large-scale organization of metabolic networks. Nature 407: 651
Buldyrev SV, Parshani R, Paul G, Stanley HE, Havlin S (2009) Catastrophic cascade of failures in interdependent networks. Nature 464(7291): 1025–1028
Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E (2002) Wireless sensor networks: a survey. Comput Netw 38: 393–422
Mohammed JZ, Vinay N, Deb B, Chris B (2004) Predicting protein folding pathways. Bioinformatics 20(1): 386–393
Cao YU, Fukunaga AS, Kahng AB (1997) Cooperative mobile robotics: antecedents and directions. Auton Robots 4: 226–234
Bullo F, Cortés J, Martínez S (2009) Distributed control of robotic networks. Applied Mathematics Series. Princeton University Press. Electronically available at http://coordinationbook.info
Kulaib AR, Shubair RM, Al-Qutayri MA, Ng JWP (2011) An overview of localization techniques for wireless sensor networks. Innovations in Information Technology (IIT), 2011 International Conference on, pp 167–172, April 2011
Reich J, Misra V, Rubenstein D, Zussman G (2011) Connectivity maintenance in mobile wireless networks via constrained mobility. In INFOCOM, 2011 Proceedings IEEE, pp 927–935, April 2011
Mathar R, Niessen T (2000) Optimum positioning of base stations for cellular radio networks. Wirel. Netw 6(6): 421–428
Ghrist R, Muhammad A (2005) Coverage and hole-detection in sensor networks via homology. In IPSN ’05: Proceedings of the 4th international symposium on information processing in sensor networks. IEEE Press, Piscataway
Li S, Wang Y, Yu J, Liu B (2013) A nonlinear model to generate the winner-take-all competition. Commun Nonlinear Sci Numer Simul 18(3): 435–442
Xia Y (2009) A compact cooperative recurrent neural network for computing general constrained l1 norm estimators. IEEE Trans Signal Process 57(9): 3693–3697
Niranjan B, Burrows TL, Niranjan M (1994) The use of recurrent neural networks for classification. In IEEE workshop on neural networks for signal processing IV pp 117–125
Husken M, Stagge P (2003) Recurrent neural networks for time series classification. Neurocomputing 50: 223–235
Li S, Cui H, Li Y, Liu B, Lou Y (2012) Decentralized control of collaborative redundant manipulators with partial command coverage via locally connected recurrent neural networks. Neural Comput Appl 1–10
Li S, Chen S, Liu B, Li Y, Liang Y (2012) Decentralized kinematic control of a class of collaborative redundant manipulators via recurrent neural networks. Neurocomputing 91(0): 1–10
Tong M, Bickett A, Christiansen E, Cottrell G (2007) Learning grammatical structure with Echo State Networks. Neural Netw 20(3): 424–432
Li S, Chen S, Liu B (2012) Accelerating a recurrent neural network to finite-time convergence for solving time-varying sylvester equation by using a sign-bi-power activation function. Neural Process Lett 1–17. doi:10.1007/s11063-012-9241-1
Doherty L, pister KSJ, Ghaoui EL (2001) Convex position estimation in wireless sensor networks. In INFOCOM 2001. Twentieth annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE,vol 3:1655–1663
Niculescu D, Nath B (2003) Dv based positioning in ad hoc networks. Telecommun Syst 22(1): 267–280
He T, Huang C, Blum Brian M, Stankovic JA, Abdelzaher T (2003) Range-free localization schemes for large scale sensor networks. In Proceedings of the 9th annual international conference on Mobile computing and networking, MobiCom ’03, ACM, New York, pp 81–95
Hopfield JJ (1984) Neurons with graded response have collective computational properties like those of two-state neurons. Proc Natl Acad Sci 81(10): 3088–3092
Kennedy MP, Chua LO (1988) Neural networks for nonlinear programming. Circuits Syst IEEE Trans 35(5): 554–562
Xia Y, Ye D (2008) On exponential convergence conditions of an extended projection neural network. Neural Comput 20(9): 2227–2237
Jiang S, Han D, Yuan X (2012) Efficient neural networks for solving variational inequalities. Neurocomputing 86(0): 97–106
Liu L, Ge R, Gao P (2011) A novel neural network for solving singular nonlinear convex optimization problems. In neural information processing, vol 7063 of Lecture Notes in Computer Science, pp 554–561
Li S, Chen S, Lou Y, Lu B, Liang Y (2012) A recurrent neural network for inter-localization of mobile phones. In neural networks (IJCNN), The 2012 International Joint Conference on June 2012, pp 1–5
Li S, Lou Y, Liu B Bluetooth aided mobile phone localization: a nonlinear neural circuit approach. ACM Transac Embed Comput Syst. Accepted
Li S, Qin F A dynamic neural network approach for solving nonlinear inequalities defined on a graph and its application to distributed, routing-free, range-free localization of WSNS. Neurocomputing. Accepted
Li S, Liu B, Chen B, Lou Y (2012) Neural network based mobile phone localization using bluetooth connectivity. Neural Comput Appl, 1–9
Zhang Y, Wang J (2002) A dual neural network for convex quadratic programming subject to linear equality and inequality constraints. Phys Lett A 298(4): 271–278
Xia Y, Feng G, Wang J (2004) A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations. Neural Netw 17(7): 1003–1015
Wu N (1997) The maximum entropy method (Springer series in information sciences). Springer, Berlin
Belkin M, Niyogi P (2001) Laplacian eigenmaps and spectral techniques for embedding and clustering. In advances in neural information processing systems 14, MIT Press, Cambridge, pp 585–591
Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, New York
Xia Y (2004) An extended projection neural network for constrained optimization. Neural Comput 16: 863–883
Nedic A, Ozdaglar A (2009) Subgradient methods for saddle-point problems. J Optim Theory Appl 142: 205–228
Mao G, Fidan B, Anderson BDO (2007) Wireless sensor network localization techniques. Computer Netw 51(10): 2529–2553
Biswas P, Liang TC, Wang TC, Ye Y (2006) Semidefinite programming based algorithms for sensor network localization. ACM Trans Sens Netw 2: 2006
Shang Y, Ruml W, Zhang Y, Fromherz MPJ (2003) Localization from mere connectivity. In Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, MobiHoc ’03. ACM, NY, pp 201–212
Stankovic JA, Stoleru R, He T (2007) Secure Localization and Time Synchronization for Wireless Sensor and Ad Hoc Networks, vol 30, chapter range-free localization. Springer