Towards Formal Modeling of Subnet Based Hotspot Algorithm in Wireless Sensor Networks

Timely partition of the whole network is extremely difficult task in dynamic large-scale wireless sensor network (WSN). A lot of existing technique that solved this issue with maintaining the network status and relevant information, but these techniques do not provide the proper validation and verification and completely depend upon the simulation. Due to the distributed and heterogeneous nature of WSN, management of such environment is highly complex. The dynamic self-configuring behavior of the nodes and scalable nature of WSN may cause critical issues, like hotspot, power consumption, unnecessary delays, throughput and network lifetime. This paper, therefore, presents the Subnet Based Hotspot Algorithm (SBHA) that not only discus the strategy of network division in the form of subnets but also provide the detail verification proof of correctness. By doing so, routing path towards sink nodes become small in size that reduces the traffic load at the neighboring nodes of the sink. As a result, nodes around the sink will not early depreciate hence the chances of hotspot occurrence will be reduced, ultimately network lifetime will be increased. Firstly, we analyze SBHA with detail formal specifications in order to validate and verify the performance of proposed algorithm with VDM-SL tool box, after this we simulate the SBHA to demonstrate its accuracy and efficiency. The results analysis shows that the E2E delay and network lifetime of SBHA is comparatively 50% and 75% higher than the EE-CBA, while the energy consumption ration for 600 number of nodes consumed 750J by SBHA and 850J by EE-CBA.