A Heuristic Local Search Algorithm for Improving Cluster and Routing Stability in Sensor Networks

Route selection using optimal nodes in Wireless Sensor Network (WSN) is a prominent task to improve network performance without deterioration. Intrinsic characteristics of the node, network traffic are some of the reason where routing algorithms fail to prove their consistency. In such cases, the conventional routing schemes must be equipped with additional network management features to retain network performance. This manuscript proposes a Heuristic Local Search (HLS) algorithm for improving routing efficiency of WSN. This search algorithm is backboned by clustering process; the cluster head is elected by satisfying balanced network metrics: energy and distance. Congestion preventive routing considers the same objective function in selecting an outside intermediate node that mitigates packet loss due to congestion. Implication of similar objective function under different constraints streamlines routing and prolongs the operation period of the cluster head. The process of the proposed HLS is evaluated using extensive simulation for the metrics: throughput, network lifetime, cluster head changes, energy utilization and packet loss ratio.

A Heuristic Local Search Algorithm for Improving Cluster and Routing Stability in Sensor Networks

Route selection using optimal nodes in Wireless Sensor Network (WSN) is a prominent task to improve network performance without deterioration. Intrinsic characteristics of the node, network traffic are some of the reason where routing algorithms fail to prove their consistency. In such cases, the conventional routing schemes must be equipped with additional network management features to retain network performance. This manuscript proposes a Heuristic Local Search (HLS) algorithm for improving routing efficiency of WSN. This search algorithm is backboned by clustering process; the cluster head is elected by satisfying balanced network metrics: energy and distance. Congestion preventive routing considers the same objective function in selecting an outside intermediate node that mitigates packet loss due to congestion. Implication of similar objective function under different constraints streamlines routing and prolongs the operation period of the cluster head. The process of the proposed HLS is evaluated using extensive simulation for the metrics: throughput, network lifetime, cluster head changes, energy utilization and packet loss ratio.

Multi-Dimensional Comprehensive Link Stability Model in Ad Hoc Network

Routing Optimization is always a key issue in MANET (Mobile Ad-Hoc Network). When referring to multi-media communication, the routing stability, which is up to link stability, is in urgent need. On the analysis of kinds of factors that affect link stability greatly, a multi-dimensional comprehensive evaluation model (MVCLS) was presented based on factor classification. In the model, the weight levels were classified, a mechanism of weight rotation was available, and a normalized link stability evaluation system with multi-attribute and multi-weight was formed. In addition, aiming at reliability and robust of the model, time series analysis and Kalman filter were combined to smooth and predict the value of key factors. At last, the link stability model is used to optimize the OLSR routing protocol, which takes the link stability as the important stuff for path selection. Simulation experiments of modified OLSR were done with support of Qualnet, the results of which show that the network performance is improved and also prove the effectiveness of the link stability model.