Informatics Publishing Limited

Harmandeep Kaur Grewal ¹, Anupam Mittal ¹

Affiliations
1 Department of Computer Science and Engineering, Chandigarh University, Gharuan, Mohali - 140413, Punjab, IN

Abstract

Objectives: Wireless Mesh Network is a promising technology in delivering the last mile broadband access. The smart routing technique has been defined during this paper for mesh networks with path selection along the connectivity hole avoidance using pushback mechanism. This paper also deploys a load balancing algorithm among the best paths available. The new design also incorporates the multi-channel triangulation method for the purpose of the optimal path selection among the multiple options. Energy aware routing mechanism is also deployed for evaluating the energy consumed during this network. Methods: The mesh network topology with 120 mesh network nodes deployed randomly over the given area of 100 x 100 meters in order to simulate the multiple networks zones. The network has been majorly divided into the three major zones in order to depict the mesh network zones, which are signified with the different colors in the given topology. The initial connectivity is entirely based upon the transmission radius of the nodes, which keeps the initial connectivity module in to the one-hop connections formation. Findings: The planned methodology compares with the existing routing scheme of Delaunay Triangulation. The performance parameters which compared with existing technique are average distance stretch and packet drop ratio. In this paper, other evaluation metrics are determined which are throughput, latency, number of aggregators and energy consumption. Novelty of the Study: The experimental observations have shown that planned routing mechanism outperforms to other existing scheme in terms of average distance stretch and packet drop ratio.

Keywords

Connectivity Hole Avoidance, Distance Stretch, Load Balanced Routing, Multipath Routing.

Full Text

   

Sapinder Kaur ¹, Anupam Mittal ¹, Ruchi Aggarwal ¹

Affiliations
1 Department of Computer Science and Engineering, Chandigarh University, Gharuan - 140413, Punjab, IN

Abstract

Paper is regarding the use of coverage algorithms on the static and dynamic node to resolve the problem of Coverage. Objectives: Main objective of this research is to minimize energy consumption. Its objective is to provide full connectivity and coverage with dynamic nodes in industrial WSN. Methods: Initially, deploy a number of nodes in an industrial area with the usage of MATLAB environment. Then apply two algorithms Communication Weighted Greedy Cover andOverlapped Target and Connected Coverage algorithms. Communication weighted greedy cover algorithm is used to separate movement of nodes. OTTC algorithm is used to reduce overlapped target problem. Findings: In Industrial Wireless Sensor Network the problem of Network coverage occursdue to large area coverage and heterogeneity of the network. CWCG and OTTC algorithms consume more energy while covering all the nodes. A solution is needed to develop an energy efficient network coverage algorithm which provides full coverage and connectivity. This research paper shows coverage with dynamic nodes in industrial area. Dynamic nodes reduce coverage and overlapped target problem.

Keywords

Connected Target Coverage, Energy Efficient CTC Algorithms, Industrial Wireless Sensor Networks.

Full Text

   

Ramandeep Kaur ¹, Anupam Mittal ¹, Ruchi Aggarwal ¹

Affiliations
1 Department of Computer Science and Engineering, Chandigarh University, Gharuan - 140413, Punjab, IN

Abstract

This paper regarding the use of the natural phenomenon’s based optimization techniques to resolve the problem of nonclustered nodes. Objectives: This research minimizes energy consumption. Its objective is to provide efficient clustering for avoidance of residual nodes and prevents occurrence of dead nodes with usage of mobile nodes. Methods: In this research paper firstly deploy number of mobile nodes in specified region with usage of MATLAB environment. For grouping of these nodes LEACH protocol uses for clustering. During clustering with LEACH some nodes residual and not become part of any cluster. Firefly Optimization used for prevention of residual nodes and efficient clustering. It uses distance and light intensity parameters for clustering. GSA algorithm used for finding best path for data transmission with less energy consumption. Findings: In this research paper shows efficient clustering of nodes with prevention of residual nodes. In existing LEACH protocol some static nodes are residual and not become part of any cluster. These nodes send data directly to base station and consume large amount of energy. These individual nodes die early due to maximum energy consumption. But in this research mobile nodes are used and occurrence of dead nodes prevented on basis of distance and light intensity parameters. Nodes which are at minimum distance are brighter than farthest nodes. Minimum distance nodes join nearest cluster and prevent formation of remaining nodes. Improvements: In this paper results shown that it performs better in terms of network lifetime, energy consumption, end to end delay and throughput and number of dead nodes.

Keywords

Cluster Formation, Firefly Optimization, Routing, Wireless Sensor Networks.

Full Text