Algorithms for bounding end-to-end delays in Wireless Sensor Networks

摘要

Wireless Sensor Networks (WSNs) have many characteristics that are attractive to a myriad of applications. In particular, nodes employ multi-hop communications to collaboratively forward sensed data back to one or more sinks. In this context, reducing the end-to-end delay between the sink and sensor/source nodes is of interest to many applications. In particular, those that require a fixed, upper bound on end-to-end delays. To this end, we focus on bounding the end-to-end delay from the sink to each source. We first formulate the problem as a Binary Integer Program (BIP). As the problem is NP-hard, this paper proposes and studies two centralized, heuristic algorithms: Tabu and Domino. The key approach used by both algorithms is to determine the minimal number of extra wake-up slots required by a given network in order to ensure the delay of all end-to-end paths is within a given bound. We conducted two sets of experiments. The first set compares BIP, Tabu, and Domino in WSNs with up to 80 nodes. These experiments serve to compare the proposed algorithms against BIP, which become computationally expensive in large scale WSNs. The results show that, compared to BIP, the number of additional wake-up times generated by Tabu and Domino are within 5 and 10 % of the optimal solution. In the second set of experiments, which evaluates the algorithms in WSNs with 100-500 nodes, the average number of extra wake-up slots activated by Domino is 13 % greater than Tabu. These algorithms have a time complexity of O(αn~2T + n~3) and O(n~3) respectively, where n is the number of nodes, T is the number of slots in one period, and α is the maximum number of iterations carried out by the Tabu algorithm.