In Wireless Sensor Network (WSN) sensor nodes are deployed to sense useful data from environment. Sensors are energy-constrained devices. To prolong the sensor network lifetime, now a days mobile robots (sometimes refer as data sink, data mules, or data collectors) are used for collecting the sensed data from the sensors. In this environment sensor nodes directly transfer their sensed data to the data mules. Sensed data are sometime time sensitive; therefore, the data should be collected within a predefined period. Hence, depending on the speed of the data mules the trajectory lengths of the data mules have upper limits. In this paper an approximation algorithm is proposed for collecting data from the mobile sensors using mobile data collectors
In this work we study the problem of collecting protected data in ad-hoc sensor network using a mobile entity called MULE. The objective is to increase information survivability in the network. Sensors from all over the network, route their sensing data through a data gathering tree, towards a particular node, called the $sink$. In case of a failed sensor, all the aggregated data from the sensor and from its children is lost. In order to retrieve the lost data, the MULE is required to travel among all the children of the failed sensor and to re-collect the data. There is a cost to travel betwe…
In this paper, we study the problem of wireless sensor network (WSN) maintenance using mobile entities called mules. The mules are deployed in the area of the WSN in such a way that would minimize the time it takes them to reach a failed sensor and fix it. The mules must constantly optimize their collective deployment to account for occupied mules. The objective is to define the optimal deployment and task allocation strategy for the mules, so that the sensors' downtime and the mules' traveling distance are minimized. Our solutions are inspired by research in the field of computational geometr…
In energy-constrained wireless sensor networks (WSNs), maximizing the data collection using mobile sink(s) with minimum energy consumption is one of the practical challenging issues. In this article, we consider the problem of efficient data collection along with a pre-specified path using a mobile sink with constant speed. We refer the problem as a Maximizing data gathering with minimum energy consumption (MDGMEC) problem. So far, existing works have heuristic algorithms for MDGMEC problem. Therefore, based on network flow optimization approach, we propose a deterministic algorithm called dat…
Node Failure Time and Coverage Loss Time Analysis for Maximum Stability Vs Minimum Distance Spanning Tree based Data Gathering in Mobile Sensor Networks
Usage of mobile sink(s) for data gathering in wireless sensor networks(WSNs) improves the performance of WSNs in many respects such as power consumption, lifetime, etc. In some applications, the mobile sink $MS$ travels along a predefined path to collect data from the nearby sensors, which are referred as sub-sinks. Due to the slow speed of the $MS$, the data delivery latency is high. However, optimizing the {\em data gathering schedule}, i.e. optimizing the transmission schedule of the sub-sinks to the $MS$ and the movement speed of the $MS$ can reduce data gathering latency. We formulate two…
This paper is devoted to mobile cloud services in Smart City projects. As per mobile cloud computing paradigm, the data processing and storage are moved from the mobile device to a cloud. In the same time, Smart City services typically contain a set of applications with data sharing options. Most of the services in Smart Cities are actually mashups combined data from several sources. This means that access to all available data is vital to the services. And the mobile cloud is vital because the mobile terminals are one of the main sources for data gathering. In our work, we discuss criteria fo…
In order to mitigate the problem of data congestion, increased latency, and high energy consumption in Wireless Sensor Networks (WSNs), Mobile Agent (MA) has been proven to be a viable alternative to the traditional client-server data gathering model. MA has the ability to migrate among network nodes based on an assigned itinerary, which can be formed via Single Itinerary Planning (SIP) or Multiple Itinerary Planning (MIP). MIP-based data gathering approach solves problems associated with SIP in terms of task duration, energy consumption, and reliability. However, the majority of existing MIP …
Network anomalies are destructive to networks. Intrusion detection systems monitor network component behavior to detect unusual activity (i.e., possible threats). Application-layer Simple Network Management Protocol (SNMP) has been used for decades via TCP/IP protocol to manage network devices. Raw data security evaluation in intrusion detection incurs latency in detection. Management Information Base (MIB) combined with SNMP is a solution for this, the traditional approach of SNMP is centralized. Thus, rendering it unreliable and non-adaptive to network changes when it comes to distributed ne…
In this paper, we present the Physical Web Browser project for web applications depending on the environment. At this moment, many of users all over the world visit websites using their mobile devices only. Any mobile device (e.g., smartphone) has sensors to capture the environmental information. This information (context) could be analyzed and used within the web applications. There are, at least, two models for using this information. Firstly, we can use context information for data gathering requests in a web application. In this case, the output depends on the context. It is the classical …
