To search, Click below search items.


All Published Papers Search Service


Nodes Energy Conserving Algorithms to prevent Partitioning in Wireless Sensor Networks




Vol. 17  No. 9  pp. 139-150


Joint scheduling method satisfies both necessary requirements of sensing coverage and network connectivity for the successful reporting simultaneously. For the sensing coverage uses randomized scheduling method, which divides sensor nodes to k subsets. Each sensor node randomly joins one predefined subset. Then, this method turns on some sensor nodes in extra subsets for the network connectivity. Some of extra-on nodes are subjected to many transmissions and receptions, in addition to the transmissions of their packets and even some of them should be stay on all the time. These problems can cause rapid battery depletion in extra-on nodes and may lead to network partitioning. In this article, algorithms are proposed to minimize the number of extra-on sensor nodes. The probing mechanism (pbm) algorithm consists of three methods that allow for some nodes to change their working shift assigned by the randomized scheduling algorithm based on different scheduling rules. Matlab simulation proved that the pbm algorithms reduces the number of extra active sensor nodes up to 35% while the sensor nodes still transmit via the shortest path to the sink node. By using the nearly shortest path algorithm, the nodes find paths to the sink node via neighboring nodes instead of turning on extra nodes. Nearly shortest path algorithm can reduce the number of extra-on sensor nodes by 96.85%. Integrating the probing mechanism and nearly shortest path algorithms can also reduce the number of extra-on sensor nodes up to 96.85%. Since the rescheduling process fulfilled by the probing mechanism in the integrated approach covers some blind points by the rescheduled sensor nodes, the integrated approach is preferable.


wireless sensor networks, probing mechanism algorithms, joint scheduling method, partitioning, shortest path routing