Article ID Journal Published Year Pages File Type
487442 Procedia Computer Science 2015 9 Pages PDF
Abstract

Data collections through mobile sinks conserve the fast depleting battery power of nodes due to transcieving. The movement of the sink is usually predestined according to the type of monitoring application. However, situations may arise where a node may not be reached within the time limit incurring starvation or buffer overflows that may cause loss of data collected. Our algorithm presents a mechanism to interrupt the preset path thereby avoiding the buffer overflows. We evaluate whether under such situations, the data communicated by the nodes is energy expensive compared to the sink computing shortest route to the alerting node.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)