24.6 FUTURE DIRECTIONS AND OPEN ISSUES

In the previous subsections, several data-centric storage articles have been introduced. Although the above-mentioned articles devote themselves to develop data-centric storage architecture in different environments, most of them did not consider the multiple sinks environment and the factor of query frequencies. Using static hash table to determine the location of data-centric node might raise communication overhead, which highly relies on the locations of the sink nodes and the frequencies of data delivery, especially in a multisink environment. Moreover, if the information of specific event is stored in a fixed data-centric node for a long time, sensor nodes that are nearby the data-centric node likely exhaust their energy due to frequent data forwarding, resulting in unbalanced power consumption.

One of the open issues is to develop path sharing for those sink nodes that have the similar or even same queries. The developing of path-sharing mechanism should consider the arriving of a new query, initiated by a new sink node, which has the same query to the existing queries except the query frequency. In addition, the optimal sharing paths from the same data-centric node to multiple sink nodes also should be changed if there are some sink nodes completing their queries. The changes of queries would raise the problems that the data-centric nodes might be changed and hence the optimal sharing paths for the existing queries should be changed ...

Get Mobile Intelligence now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.