Optimal Link Scheduling for Low Latency Data Transfer over Small World WSNs

In recent years, small world characteristics (SWC) received huge attention due to their various advantages in the context of social, electrical, computer, and wireless networks. A wireless sensor network (WSN) exhibiting SWC is known as small world WSN (SW-WSN). Therefore, SW-WSN consists small average path length and large average clustering coefficient. Here, in this paper, a novel optimal link scheduling method is proposed to develop SW-WSN. The proposed method determines, optimal number of new links need to be created in the network. Additionally, the method also finds the optimal node-pairs towards creation of these links. The developed algorithm considers node betweenness centrality measure for the introduction of SWC. SW-WSN obtained using proposed method yields reduced time complexity towards its development. Moreover, it also results in optimal SWC when compared to other existing methods. A reduced data transmission delay is noted over SW-WSN developed using proposed method. Random, near-optimal, and sub-optimal methods of introducing SWC and their time complexities are also investigated and compared to the proposed method. The results are computed over simulated and real WSN testbed. Obtained results demonstrate the significance of proposed method and its utilization over large scale network applications.