The Probabilistic Methodology for Distinguishing Node Failures in Mobile Wireless Networks

Ch Sri Krishna Satyanarayana Swamy, K.C. Pradeep

Abstract


The Wireless Mobile Network is work of "nodes"- from a couple to a few hundreds or even thousands, where every node is associated with one mobile. A node in a wireless mobile network that is equipped for using out some procedure and assemble mobile data and speaking with other associated nodes in the network. The nodes to perform transmissions not effectively, there are some issues may emerge in that they are 1) if node failure will happen in any stage, 2) security issues emerges because of transmission includes number of nodes, 3) expanding transmission time because of more number of nodes will be dynamic at a time to finish a specific assignment. To take care of this issue we propose new calculations are 1) node detecting and node failure for movement location, 2) finding courses and give security utilizing neighborhood keys, 3) which node includes to play out the activity that present node just to be dynamic at a time other to rest mode utilizing node booking plan. The way toward identifying the fizzled or harmed nodes in the wireless network is excessively mind boggling due, making it impossible to its dynamic topology and exhibiting of gigantic number of nodes in it. Sometimes the association may get loss amid the time of recognition, it makes us to put in the troublesome position. So as to lessen these complexity and challenges, we approach the probabilistic strategy to supplant the fizzled node with great node to actuate the transmission of information and decrease the time complexity amid the time of correspondence.


References


Ruofan JinDetecting Node Failures in Mobile Wireless Networks: A Probabilistic Approach

T. Chen, J. Tsai, and M. Gerla, “QoS routing performance in multihop multimedia wireless networks,” in Proc. IEEE Int. Conf. Universal Personal Commun., 1997, pp. 557–561.

M. Caccamo, L. Zhang, L. Sha, and G. Buttazzo, “An implicit prioritized access protocol for wireless sensor networks,” in Proc. IEEE Real-Time Syst. Symp., 2002, pp. 39–48.

J. Ben-Othman and B. Yahya, “Energy efficient and QoS based routing protocol for wireless sensor networks,” J. Parallel Distrib. Comput., vol. 70, no. 8, pp. 849–857, 2010.

"Dynamic Routing for Data Integrity and Delay Differentiated Services in Wireless Sensor Networks" Jiao Zhang, Member, IEEE, FengyuanRen, Member, IEEE, Shan Gao, Hongkun Yang, and Chuang Lin, Senior Member, IEEE

P. T. A. Quang and D.-S. Kim, “Enhancing real-time delivery of gradient routing for industrial wireless sensor networks,” IEEE Trans. Ind. Inform., vol. 8, no. 1, pp. 61–68, Feb. 2012.

C.-Y. Wan, S. B. Eisenman, and A. T. Campbell, “CODA: Congestion detection and avoidance in sensor networks,” in Proc. 1st Int. Conf. Embedded Netw. Sensor Syst., 2003, pp. 266–279.

L. Georgiadis, M. J. Neely and L. Tassiulas, “Resource allocation and cross-layer control in wireless networks,” Found. Trends Netw., vol. 1, no. 1, pp. 1–144, 2006.

B. Hinneburg, X. Hinneburg, and A. Keim, ―An efficient approach to clustering in large multimedia databases with noise,‖ in Proc. 4th Int. Conf. Knowl. Discovery Data Mining, 1998, pp. 58–65.

P. Kumar, ―A new shared nearest neighbor clustering algorithm and its applications,‖ in Proc. Workshop Clustering High Dimensional Data Appl. 3rd SIAM Int. Conf. Data Mining, 2002, pp. 105–125.


Full Text: PDF[Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.