Let P be a set of n points, where each point is colored with one the k possible colors. We present efficient algorithms to preprocess such that for given query q, we can quickly identify smallest color spanning object desired type containing q. In this paper, focus on (i) intervals, (ii) axis-parallel square, (iii) rectangle, (iv) equilateral triangle fixed orientation and (v) circle, as our ob...

Nowadays, users of information systems have inclination to use a central server to decrease data transferring and maintenance costs. Since such a system is not so trustworthy, users' data usually upkeeps encrypted. However, encryption is not a nostrum for security problems and cannot guarantee the data security. In other words, there are some techniques that can endanger security of encrypted d...

Routing in Wireless Sensor Networks (WSNs) is a very challenging task due to the large number of nodes, their mobility and lack of proper infrastructure. Since the sensors are battery powered devices, energy efficiency is considered as one of the main factors in designing routing protocols in WSNs. Most of energy-aware routing protocols are mere energy savers that attempt to decrease the energy...