New Path Centrality Based on Operator Calculus Approach for Wireless Sensor Network Deployment

Abstract

One of the greatest challenges in computing and estimating the important node metrics of a structural graph is centrality. Since centrality is an essential concept in social network analysis (SNA), it is used to define the importance of a node in a network like a wireless sensor network (WSN). Route optimization is another important feature in a wireless sensor network. This paper proposes an alternative solution to route optimization problems by using the multi-constrained optimal path (MCOP) approach. A new metric called path operator calculus (POC) is proposed as an alternative way to determine nodes with high centrality in wireless sensor network deployment. The estimation of this new metric is based on network topology by using the operator calculus approach, which produces the feasible paths for each node to the sink node. In order to define the path centrality of the network, the proposed approach takes into account two constraints for each node: energy and bit error rate (BER). The experimental evaluation shows improved performance in terms of delivery ratio, latency, throughput, delay, energy remaining and routing overhead.