Pheromone-based In-Network Processing for wireless sensor network monitoring systems

Monitoring spatio-temporal continuous fields using wireless sensor networks (WSNs) has emerged as a novel solution. An efficient data-driven routing mechanism for sensor querying and information gathering in large-scale WSNs is a challenging problem. In particular, we consider the case of how to query the sensor network information with the minimum energy cost in scenarios where a small subset of sensor nodes has relevant readings. In order to deal with this problem, we propose a Pheromone-based In-Network Processing (PhINP) mechanism. The proposal takes advantages of both a pheromone-based iterative strategy to direct queries towards nodes with relevant information and query- and response-based in-network filtering to reduce the number of active nodes. Additionally, we apply reinforcement learning to improve the performance. The main contribution of this work is the proposal of a simple and efficient mechanism for information discovery and gathering. It can reduce the messages exchanged in the network, by allowing some error, in order to maximize the network lifetime. We demonstrate by extensive simulations that using PhINP mechanism the query dissemination cost can be reduced by approximately 60% over flooding, with an error below 1%, applying the same in-network filtering strategy.Fil: Riva, Guillermo Gaston. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentina. Universidad Tecnológica Nacional; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba; ArgentinaFil: Finochietto, Jorge Manuel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Estudios Avanzados en Ingeniería y Tecnología. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales. Instituto de Estudios Avanzados en Ingeniería y Tecnología; Argentin

Pervasive Data Access in Wireless and Mobile Computing Environments

The rapid advance of wireless and portable computing technology has brought a lot of research interests and momentum to the area of mobile computing. One of the research focus is on pervasive data access. with wireless connections, users can access information at any place at any time. However, various constraints such as limited client capability, limited bandwidth, weak connectivity, and client mobility impose many challenging technical issues. In the past years, tremendous research efforts have been put forth to address the issues related to pervasive data access. A number of interesting research results were reported in the literature. This survey paper reviews important works in two important dimensions of pervasive data access: data broadcast and client caching. In addition, data access techniques aiming at various application requirements (such as time, location, semantics and reliability) are covered

Energy Efficient Rectangular Indexing for Mobile Peer-to-Peer Environment

Now a days in wireless environment there are many challenges. One of them which is need to be addressed in mobile Peer-to-Peer environment is getting the information of interest quickly and efficiently. Wherein whenever the node tries to get the desired data it has to wait too long or have to contact to unnecessary nodes which are not having their data of interest. This causes the node to waste the limited power resources and incurs more cost in terms of energy wastage. Here we proposed an energy efficient rectangular indexing called PMBR (Peer-to-Peer Minimum Bounding Rectangle) which allows the user to get the information of interest in energy efficient manner. We proposed algorithms namely PMBR_DSS, PMBR_HB and PMBR_CP and processed Nearest Neighbor & Range type queries. The experimental results carried out shows that the proposed algorithm PMBR_CP provides the efficient, quick and assured access to information of interest by saving the scarce power resources

Reducing Latency by Clustering Based Index Services using Hybrid Cache in Ad Hoc Networks

An efficient index structure is presented to guide mobile clients to the - objects. The proposed broadcast scheduling and indexing is aimed at minimizing query access time and energy consumption of the clients when retrieving - objects through wireless channels . W e design and evaluate cooperative caching techniques to efficiently support data access in ad hoc networks. We first propose two schemes: Cache Data , which caches the data, and Cache Path , which caches the data path. After analyzing the performance of those two schemes, we propose a hybrid approach ( Hybrid Cache ), which can further improve the performance by taking advantage of Cache Data and Cache Path while avoiding their weaknesses. Cache replacement policies are also studied to further improve the performance. Simulation results show that the proposed schemes can signifi cantly reduce the query delay and message complexity when compared to other caching schemes

A Powerful Optimization Approach for the Multi Channel Dissemination Networks

In the wireless environment, dissemination techniques may improve data access for the users. In this paper, we show a description of dissemination architecture that fits the overall telecommunication network. This architecture is designed to provide efficient data access and power saving for the mobile units. A concurrency control approach, MCD, is suggested for data consistency and conflict checking. A performance study shows that the power consumption, space overhead, and response time associated with MCD is far less than other previous techniques.Comment: 9 Pages, IJCNC Journal 201

Vehicular Inter-Networking via Named Data

In this paper we apply the Named Data Networking, a newly proposed Internet architecture, to networking vehicles on the run. Our initial design, dubbed V-NDN, illustrates NDN's promising potential in providing a unifying architecture that enables networking among all computing devices independent from whether they are connected through wired infrastructure, ad hoc, or intermittent DTN. This paper describes the prototype implementation of V-NDN and its preliminary performance assessment