BUFFER BASED ROUTING MECHANISM FOR LOAD BALANCING IN WIRELESS MESH NETWORKS
Journal Title: International Journal of Computer Engineering & Technology (IJCET) - Year 2019, Vol 10, Issue 1
Abstract
In recent years it is witnessed that the Wireless Mesh Networks (WMNs) are becoming the most promising technology as they offer low cost broadband wireless connectivity, larger coverage area, high flexibility and easy deployment. WMNs are an extension of existing wireless networks. WMN is an emerging technology; however, there are certain challenges that still exist in the network such as scalability, load balancing, mobility, power management etc. Here we have proposed a novel routing protocol which considers buffer occupancy of intermediate nodes for route selection. Simulation results convey that the proposed protocol outstandingly enhances the performance of the network by balancing the traffic load among less congested nodes compared to the standard protocol
Authors and Affiliations
Keerthi D S, Shobha Rani A and T G Basavaraju
ENHANCED CLUSTER HEAD MANAGEMENT IN LARGE SCALE WIRELESS SENSOR NETWORK USING PARTICLE SWARM OPTIMIZATION (PSO) ON THE BASIS OF DISTANCE, DENSITY & ENERGY
Wireless Sensor Networks (WSNs) are utilized for a plethora of applications such as weather forecasting, monitoring systems, surveillance, and so on. The critical issues of the WSN are energy constraints, limited memor...
MULTI-LEVEL ENERGY EFFICIENT IMPROVED UNEQUAL CLUSTERING IN WIRELESS SENSOR NETWORKS
In wireless sensor networks (WSNs), the node distribution in the unequal clustering is rapidly used for distributing the load and increase the network lifetime. In tradition unequal clustering mechanism, the nodes whic...
COMPARATIVE ANALYSIS OF FACE RECOGNITION BASED ON SIGNIFICANT PRINCIPAL COMPONENTS OF PCA TECHNIQUE
Face recognition systems have been emerging as acceptable approaches for human authorization. Face recognition help in searching and classifying a face database and at a higher level help in identification of possible...
ALGORITHMIC APPROACH FOR DOMINATION NUMBER OF UNICYCLIC GRAPHS
Let 𝐺(𝑉, 𝐸) be a unicyclic graph. A unicyclic graph is a connected graph that contains exactly one cycle. A dominating set of a graph G = (V, E) is a subset D of V, such that every vertex which is not in D is adjacent...
DIGITAL INDIA - THE GREAT DREAM
This paper is an attempt to understand various portals and mobile Apps available for the empowerment of rural folk in India. Digital India programme envisages a digital empowering of the citizens of India i.e. making t...