Abstract
Wireless sensor networks (WSNs) have been applied in networking devices, and a new problem has emerged called source-location privacy (SLP) in critical security systems. In wireless sensor networks, hiding the location of the source node from the hackers is known as SLP. The WSNs have limited battery capacity and low computational ability. Many state-of-the-art protocols have been proposed to address the SLP problems and other problems such as limited battery capacity and low computational power. One of the popular protocols is random path routing (RPR), and in random path routing, the system keeps sending the message randomly along all the possible paths from a source node to a sink node irrespective of the path's distance. The problem arises when the system keeps sending a message via the longest route, resulting because of high battery usage and computational costs. This research paper presents a novel networking model referred to as calculated random path routing (CRPR). CRPR first calculates the top three shortest paths, and then randomly sends a token to any of the top three shortest calculated paths, ensuring the optimal tradeoff between computational cost and SLP. The proposed methodology includes the formal modeling of the CRPR in Colored Petri Nets. We have validated and verified the CRPR, and the results depict the optimal tradeoff.