|K.G.S. Venkatesan1, Dr. V. Khanaa2, Dr. A. Chandrasekar 3
|Related article at Pubmed, Scholar Google|
Visit for more related articles at International Journal of Innovative Research in Computer and Communication Engineering
This paper Routing using Autonomous Network Reconfiguration System (ANRS) with bandwidth guarantees focuses on a wireless mesh network (WMN) consists of a large number of wireless nodes. WMN has to support diversified multimedia applications for its users . It is essential to provide efficient Quality-of-Service (QoS) support in this kind of network. Seeking the path with the maximum available bandwidth is one of the fundamental issues for supporting QoS in the wireless mesh network. In real time application, the communication path usually consists of a succession of links, each with its own bandwidth. If any one of these links is much slower than it is called bandwidth bottleneck. So in this paper we propose a new path weight which captures the maximum available bandwidth path information. In case of link failures which are recovered by Autonomous Network Reconfiguration System(ARNS) technique that allows to autonomously reconfiguring its local network settings. Finally routing can be performed with guarantee bandwidth where the routing protocols should satisfy both optimality and consistency.
|Multiradio Wireless Mesh Networks (MRWMNS), Wireless Mesh Network; Reconfiguration System, Wireless Link Failures.|
|Wireless mesh network (WMN) is the key technology for present generation in wireless networking for providing fast and has self service to users. Nodes in wireless mesh networks comprise mesh routers and mesh clients. Each node operates not only a host but also as a router, forwarding packets on behalf of other nodes that may not be in with indirect wireless transmission vary .|
|Connectivity between nodes in wireless mesh networks is automatically established and maintained among the participating nodes. This makes wireless mesh network a dynamically, self-organized, and self-configured wireless network. This feature brings many advantages such as low installation cost, low cost in maintenance, robustness and reliable service coverage .|
|Wireless mesh networks can also be used in other applications such as broadband, Networking, community and neighborhood networks, enterprise networking building automation, etc Wireless mesh networks can be deployed one node at a time and they also have a capability of self-organization and self-configuring. Reliability and connectivity for the users of such networks increases significantly as more nodes are installed .|
|Wireless mesh network infrastructure is considered as the network providing cost effective and dynamic high bandwidth networks over a specific coverage area . Mesh architecture sustains signal strength by breaking the long distances into a series of shorter hops. Intermediate nodes not only boost the signal, but cooperatively make forwarding Decisions based on their knowledge of the network, i.e. perform routing. Such architecture may with careful design provide high bandwidth, spectral efficiency, and economic advantage over the coverage area . The Role of Access Points(APs) in WMN is it provides internet access to Mesh Clients(MCs) by forwarding aggregated traffic to Mesh Routers(MRs), known as relays, in a multi-hop fashion until a Mesh Gateway(MG) is reached. MG act as bridges between the wireless infrastructure and the Internet. WMNs are comprised of two types of nodes: mesh routers and mesh clients .|
II. RELATED WORKS
|Generally Link failures are one of major issue in the networking area. So, that wireless information communication is the most promising and complicated field. As wireless mesh networks are concerned the provides larger coverage’s and high data rate information transfer. Even though they provide lot of benefits to the user and several high range applications they still suffer from the occurrences of the link failure .|
|A considerable amount of work has been done to solve the problems in WMNs and to build a heal wireless network. Network reconfiguration needs a planning algorithm that keeps necessary network changes that is to recover from link failures as local as possible, as opposed to changing the entire network settings. And also the network change made autonomously when failure happens .|
|These link failures will occur due to some interferences, different obstacles etc.. By this link failure the information transfer can be lost quality of communication cannot be achieved and also the performance of this Wireless Mesh Networks can low. So in order to recover from the link failures Autonomous Reconfiguration System is commonly used .|
|In environmental monitoring some link sofa WMN may experience significant channel interference from other coexisting wireless networks . Some parts of networks might not be able to meet increasing bandwidth demands from new mobile users and data can not reach to the destination within time owing to link failures .|
III. EXISTING SYSTEM
|In Existing System, the packet can be route do available path bandwidth between the intermediate routers. It also considers the interference occur in the link. Static Protocol makes the packet forwarding in WMN. This protocol does not guaranteed the packet delivery and network performance in case of any link failures. If any link failures occur then the routing protocol made a manual change stop recede the further processing. When the packet will be lost in the network it leads to degraded performances. So retransmission of packet be the major issues in existing system and that can be overcome in proposed system by different techniques and routing Protocols .|
|Already the following technique made some more changes in network but they fail to satisfy the markable performance in the networking bandwidth guarantee. Resource-Allocation Algorithm when the link failure occur the entire network configuration settings have to change to recover from these local link failures. Drawback of this method is when the local link failure occur we have to change the entire configuration settings time is inefficient in this method . Greedy Channel-Assignment Algorithm when the link failure occurs the acknowledgment will be send to the source. Source will transmit the data again in another path. Drawback of this method is when the link failure occurs the data have to be retransmitted from the source. Time is inefficient by using greedy method. Local rerouting or multipath routing can be adopted to use network-level path diversity for avoiding the faulty links. However, they rely on|
|Our paths or redundant transmissions, which may require more network resources than link-level network reconfiguration. To overcome the above limitations ANRS is proposed. Through put and efficiency improved with guaranteed information measure .|
IV. PROPOSED SYSTEM
|The routing protocol used is OSPF. This Open Shortest Path First (OSPF) is an Interior Gateway Routing Protocol based on Shortest Path First (SPF) or link-state technology. OSPF is defined in RFC. OSPF was designed specifically for the TCP/IP Internet environment, and supports the following features like Authentication of routing updates, Tagging of externally-derived routes, Fast response to topology changes with low overhead, Load sharing over meshed links. And finally they should satisfy both consistency and optimal it requirements. Optimal it requirements made routing protocol and Consistency tend stop packet forwarding. While this is in progress the link failure also occurred in WMN. This Paper mainly proposed for link failure problem .|
|The link failure occurred means the packet will be reroute to another path by carrying the widest path by using the ANRS technique. ANRS technique autonomously recovers the local link failures and enable the reconfiguration phase. By reconfiguration the packets will be delivered to the particular destination with out the packet loss. And also we use Reconfiguration Planning Algorithm for further enhancements in order to achieve the higher information measure .|
|The algorithm used in ANRS technique is Reconfiguration Planning Algorithm. Why we need this algorithm is to improve and maintain the performance of ANRS and WMN in case of dynamic link failures in the network. To with stand failures by enabling MRWMN and to autonomously reconfigure channel and radio assignments. This algorithm have different phases to monitor and recover the dynamic link failures in the network. The major phases are;|
|• Monitoring Period|
|• Failure Detection|
|• Planning amount|
|• Reconfiguration Period|
|Monitoring is an important phenomenon when we consider the link failure. Generally monitoring is the basic operation involved in many link recovery algorithms. Monitoring period is used to monitor the links from which the information is started to the end of that period in the network that we considered .|
|B. Failure Detection|
|After this link monitoring, the failure links are detected using the failure detector. Due to this link failure the packet dropping occurs. This packet loss occurred not only for link failure event hey occur if the traffic exhibit some congestion .|
|C. Planning Amount|
|The planning is here fully based on energy. And Energy is calculated for the neighboring nodes from the link failure occurred node. Then the node with highest energy is elected as an leader. It will send there quest to the failure occurred node and then that node will generate there configuration plan, send to the leader node. Finally the link failures are recovered and transmission continues through the leader node to the destination .|
|D. Reconfiguration Amount|
|By using reconfiguration plan send to the leader node the changes to node are made. So that the changes are made to the links. The most important task car tried out in this period is the changes must be made to link. Here the link recovery is based on the high energy which is at the path in near by distance .|
V. RESULT ANALSYSIS
|They are under going rapid progress and inspiring numerous deployments in WMNs will deliver wireless services for a large variety of applications in personal, local, campus, and metropolitan areas. But they should satisfy some more requirements based on the application. It is essential to provide QoS guaranteed bandwidth, high Throughput, low cost, etc.|
|In this Paper, We Propose new path weight that captures the maximum available bandwidth incase of failure packets. The Packet can be routed based on OSPF protocols which satisfy consistency and optimality. If the link failure occurred then the packet can be rerouted to another path using Autonomous Network Reconfiguration System in order to find the bandwidth of packet transferred in WMN .|
|Finally the performance of the system can be measured by parameters like throughput, delay, packet delivery ratio, guaranteed bandwidth etc. A high performance system achieved high throughput, low delay, and high packet ratio compared to the existing system. And also by this technique we measure the each nodes involvement that is we found the flows taken by the each and every node in the network for the particular packet transmission. By finding each node flow we can able knows the traffic occurrence in each and every link of nodes concerned .|
|So by this we will able to know which path is better for particular size packet transmission in order to get a high packet delivery ratio and high performance compared to the existing techniques. Obviously we will get the guaranteed bandwidth, high throughput, and high packet delivery ratio when router flow or the performance is known. So this system can also be implemented in Java platform .|
VI. CONCLUSION AND FUTURE WORK
|In this paper, the link failure recovery is considered as the main objective. It is done by using Autonomous Network Reconfigurable System with Reconfiguration Planning Algorithm. Even though it provides a lot of benefits still the router require more energy for every packet transfer. So Energy consumption can be considered as an issue for the future work. We can solve this energy consumption issue by preserving and fulfilling the demands of WMN. Mainly energy consumed because of the reconfiguration process. So it will be reduced for the high throughput. Then some Theoretical results need to be confirmed to enhance the scalability of Protocols. In order to overcome from these limitations, increased form will need.|
|The author would like to thank the Vice Chancellor, Dean-Engineering, Director, Secretary, Correspondent, HOD of Computer Science & Engineering, Dr. K.P. Kaliyamurthie, Bharath University, Chennai for their motivation and constant encouragement. The author would like to specially thank Dr. A. Kumaravel for his guidance and for critical review of this manuscript and for his valuable input and fruitful discussions in completing the work and the Faculty Members of Department of Computer Science &Engineering. Also, he takes privilege in extending gratitude to his parents and family members who rendered their support throughout this Research work.|
|1. Kyu-Han Kim and Kang G. Shin, “Self-Reconfigurable wireless mesh networks”, IEEE/ACM Transactions on networking , Vol. 19, No. 2, April – 2011.
2. I. Akyildiz, X. Wang and W. Wang, “Wireless mesh network : A Survey”, Computer networking, Vol. 47, No. 4, PP. 445 – 487, March – 2005.
3. Anand Prabhu Subramanian, Himanshu Gupta, Samir R. Das and Jing Cao, “ Minimum Interference channel assignment in multiradio wireless mesh networks”, IEEE Transactions on mobile computing, Vol. 7, No. 12, December – 2008.
4. J. Tang, G. Xue and W. Zhang, “Interference – Aware Topology control and QoS Routing in multi-channel wireless mesh networks”, Proc. ACM MobiHoc, 2005.
5. K.G.S. Venkatesan. Dr. V. Khanna, Dr. A. Chandrasekar, “Autonomous System( AS ) for mesh network by using packet transmission & failure detection”, Inter. Journal of Innovative Research in computer & comm. Engineering, Vol . 2 , Is su e 1 2, PP. 7 289 – 729 6, Dec emb er - 2014.
6. K.G.S. Venkatesan and M. Elamurugaselvam, “Design based object oriented Metrics to measure coupling & cohesion”, International journal of Advanced & Innovative Research, Vol. 2, Issue 5, PP. 778 – 785, 2013.
7. Teerawat Issariyakul • Ekram Hoss, “Introduction to Network Simulator NS2”.
8. S. Sathish Raja and K.G.S. Venkatesan, “Email spam zombies scrutinizer in email sending network Infrastructures”, International journal of Scientific & Engineering Research, Vol. 4, Issue 4, PP. 366 – 373, April 2013.
9. G. Bianchi, “Performance analysis of the IEEE 802.11 distributed coordination function,” IEEE J. Sel. Areas Communication., Vol. 18, No. 3, PP. 535–547, Mar. 2000.
10. K.G.S. Venkatesan, “Comparison of CDMA & GSM Mobile Technology”, Middle-East Journal of Scientific Research, 13 (12), PP. 1590 – 1594, 2013.
11. P. Indira Priya, K.G.S.Venkatesan, “Finding the K-Edge connectivity in MANET using DLTRT, International Journal of Applied Engineering Research, Vol. 9, Issue 22, PP. 5898 – 5904, 2014.
12. K.G.S. Venkatesan and M. Elamurugaselvam, “Using the conceptual cohesion of classes for fault prediction in object-oriented system”, International journal of Advanced & Innovative Research, Vol. 2, Issue 4, PP. 75 – 80, April 2013.
13. Ms. J.Praveena, K.G.S. Venkatesan, “Advanced Auto Adaptive edge-detection algorithm for flame monitoring & fire image processing”, International Journal of Applied Engineering Research, Vol. 9, Issue 22, PP. 5797 – 5802, 2014.
14. K.G.S. Venkatesan. Dr. V. Khanna, “Inclusion of flow management for Automatic & dynamic route discovery system by ARS”, International Journal of Advanced Research in computer science & software Engg., Vol.2, Issue 12, PP. 1 – 9, December – 2012.
15. Needhu. C, K.G.S. Venkatesan, “A System for Retrieving Information directly from online social network user Link ”, International Journal of Applied Engineering Research, Vol. 9, Issue 22, PP. 6023 – 6028, 2014.
16. K.G.S. Venkatesan, R. Resmi, R. Remya, “Anonymizimg Geographic routing for preserving location privacy using unlinkability and unobservability”, International Journal of Advanced Research in computer science & software Engg., Vol. 4, Issue 3, PP. 523 – 528, March – 2014.
17. Selvakumari. P, K.G.S. Venkatesan, “Vehicular communication using Fvmr Technique”, International Journal of Applied Engineering Research, Vol. 9, Issue 22, PP. 6133 – 6139, 2014.
18. K.G.S. Venkatesan, G. Julin Leeya, G. Dayalin Leena, “Efficient colour image watermarking using factor Entrenching method”, International Journal of Advanced Research in computer science & software Engg., Vol. 4, Issue 3, PP. 529 – 538, March – 2014.
19. K.G.S. Venkatesan. Kausik Mondal, Abhishek Kumar, “Enhancement of social network security by Third party application”, International Journal of Advanced Research in computer science & software Engg., Vol. 3, Issue 3, PP. 230 – 237, March – 2013.
20. Annapurna Vemparala, Venkatesan.K.G., “Routing Misbehavior detection in MANET’S using an ACK based scheme”, International Journal of Advanced & Innovative Research, Vol. 2, Issue 5, PP. 261 – 268, 2013.
21. K.G.S. Venkatesan. Kishore, Mukthar Hussain, “SAT : A Security Architecture in wireless mesh networks”, International Journal of Advanced Research in computer science & software Engineering, Vol. 3, Issue 3, PP. 325 – 331, April – 2013.
22. Annapurna Vemparala, Venkatesan.K.G., “A Reputation based scheme for routing misbehavior detection in MANET”S ”, International Journal of computer science & Management Research, Vol. 2, Issue 6, June - 2013.
23. K.G.S. Venkatesan, “Planning in FARS by dynamic multipath reconfiguration system failure recovery in wireless mesh network”, International Journal of Innovative Research in computer & comm. Engineering, Vol . 2 , Is su e 8 , Au gu s t - 2014.
24. K.G.S. Venkatesan, AR. Arunachalam, S. Vijayalakshmi, V. Vinotha, “Implementation of optimized cost, Load & service monitoring for grid computing”, International Journal of Innovative Research in computer & comm. Engineering, Vol . 3 , Is su e 2 , PP. 8 64 – 870 , Feb ru a ry - 2015.
25. R. Karthikeyan, K.G.S. Venkatesan, M.L. Ambikha, S. Asha, “Assist Autism spectrum, Data Acquisition method using Spatio-temporal Model”, International Journal of Innovative Research in computer & communication Engineering, Vol . 3 , Is su e 2 , PP. 8 71 – 877 , Feb ru a ry - 2015.
26. K.G.S. Venkatesan, B. Sundar Raj, V. Keerthiga, M. Aishwarya, “Transmission of data between sensors by devolved Recognition”, International Journal of Innovative Research in computer & comm. Engineering, Vo l . 3 , Is su e 2 , PP. 8 78 – 8 86, Feb ru a ry - 2015.
27. K.G.S. Venkatesan, N.G. Vijitha, R. Karthikeyan, “Secure data transaction in Multi cloud using Two-phase validation”, International Journal of Innovative Research in computer & comm. Engineering, Vol . 3, Is su e 2 , PP. 84 5 – 85 3, Feb ru a ry - 2015.
28. K.G.S. Venkatesan, “Automatic Detection and control of Malware spread in decentralized peer to peer network”, International Journal of Innovative Research in computer & comm. Engineering, Vol . 1 , Is su e 7, PP. 1 5157 – 15 159 , Sept emb er - 2013.
29. Satthish Raja, S K.G.S. Venkatesan, “Electronic Mail spam zombies purify in email connection”, International Journal of Advanced Research in Computer Science Engineering & Information Technology, Vol. 1, Issue 1, PP. 26 – 36, June – 2013.
30. K.G.S. Venkatesan. Dr. V. Khanna, S.B. Amarnath Reddy, “Providing Security for social Networks from Inference Attack”, International Journal of Computer Science Engineering & Scientific Technology, March – 2015.
31. K.G.S. Venkatesan, Dr. Kathir. Viswalingam, N.G. Vijitha, “ Associate Adaptable Transactions Information store in the cloud using Distributed storage and meta data manager”, International Journal of Innovative Research in computer & communication Engineering, Vol . 3 , Is su e 3 , PP. 15 48 – 1 555 , Ma r ch - 2015.
32. K.G.S. Venkatesan, Dr. V. Khanna, Jay Prakash Thakur, Banbari Kumar, “Mining User profile Exploitation cluster from computer program Logs”, International Journal of Innovative Research in computer & communication Engineering, Vol . 3 , Is su e 3 , PP. 1 557 – 156 1, Ma r ch - 2015.
33. Ms.J.Praveena, K.G.S.Venkatesan, “Advanced Auto Adaptive edge-detection algorithm for flame monitoring & fire image processing”, International Journal of Applied Engineering Research, Vol. 9, Issue 22, PP. 5797 – 5802, 2014.
34. K.G.S.Venkatesan, “Planning in FARS by dynamic multipath reconfiguration system failure recovery in wireless mesh network”, International Journal of Innovative Research in computer & comm. Engineering, Vo l . 2 , Is su e 8 , Au gu s t -2014.
35. Akyildiz, I.,Wang,X., and Wang,W.,2005, “Wireless mesh networks: A survey,” Computer Networks., Vol. 47, No.4, PP. 445–487.
36. Kyu-Han Kim, Member, IEEE, and Kang G. Shin,Fellow, IEEE, ACM, 2011, “Self-Reconfigurable Wireless Mesh Networks” IEEE/ACMTRANSACTIONS ON NETWORKING, Vol. 19, No.2.
37. Kodialam,M., and Nandagopal,T.,2005 “Characterizing the capacity region in multi-radio multi-channel wireless mesh networks,” in Proc. ACM MobiCom, Cologne,Germany, PP. 73–87 .
38. Brzezinski,M., Zussman,G., and Modiano,E., 2006“Enabling distributed throughput maximization in wireless mesh networks: A partitioning approach,” inProc. ACM MobiCom, Los Angeles, CA, PP.26–37.
39. Raniwala,A., and Chiueh,T., 2005 “Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network,” in Proc. IEEE INFOCOM,Miami, FL, vol. 3, PP. 2223–2234.