PIYAS-Proceeding to Intelligent Service Oriented Memory Allocation for Flash Based Data Centric Sensor Devices in Wireless Sensor Networks

Flash memory has become a more widespread storage medium for modern wireless devices because of its effective characteristics like non-volatility, small size, light weight, fast access speed, shock resistance, high reliability and low power consumption. Sensor nodes are highly resource constrained in terms of limited processing speed, runtime memory, persistent storage, communication bandwidth and finite energy. Therefore, for wireless sensor networks supporting sense, store, merge and send schemes, an efficient and reliable file system is highly required with consideration of sensor node constraints. In this paper, we propose a novel log structured external NAND flash memory based file system, called Proceeding to Intelligent service oriented memorY Allocation for flash based data centric Sensor devices in wireless sensor networks (PIYAS). This is the extended version of our previously proposed PIYA [1]. The main goals of the PIYAS scheme are to achieve instant mounting and reduced SRAM space by keeping memory mapping information to a very low size of and to provide high query response throughput by allocation of memory to the sensor data by network business rules. The scheme intelligently samples and stores the raw data and provides high in-network data availability by keeping the aggregate data for a longer period of time than any other scheme has done before. We propose effective garbage collection and wear-leveling schemes as well. The experimental results show that PIYAS is an optimized memory management scheme allowing high performance for wireless sensor networks

Energy efficient organization and modeling of wireless sensor networks

With their focus on applications requiring tight coupling with the physical world, as opposed to the personal communication focus of conventional wireless networks, wireless sensor networks pose significantly different design, implementation and deployment challenges. Wireless sensor networks can be used for environmental parameter monitoring, boundary surveillance, target detection and classification, and the facilitation of the decision making process. Multiple sensors provide better monitoring capabilities about parameters that present both spatial and temporal variances, and can deliver valuable inferences about the physical world to the end user. In this dissertation, the problem of the energy efficient organization and modeling of dynamic wireless sensor networks is investigated and analyzed. First, a connectivity distribution model that characterizes the corresponding sensor connectivity distribution for a multi-hop sensor networking system is introduced. Based on this model, the impact of node connectivity on system reliability is analyzed, and several tradeoffs among various sleeping strategies, node connectivity and power consumption, are evaluated. Motivated by the commonality encountered in the mobile sensor wireless networks, their self-organizing and random nature, and some concepts developed by the continuum theory, a model is introduced that gives a more realistic description of the various processes and their effects on a large-scale topology as the mobile wireless sensor network evolves. Furthermore, the issue of developing an energy-efficient organization and operation of a randomly deployed multi-hop sensor network, by extending the lifetime of the communication critical nodes and as a result the overall network\u27s operation, is considered and studied. Based on the data-centric characteristic of wireless sensor networks, an efficient Quality of Service (QoS)-constrained data aggregation and processing approach for distributed wireless sensor networks is investigated and analyzed. One of the key features of the proposed approach is that the task QoS requirements are taken into account to determine when and where to perform the aggregation in a distributed fashion, based on the availability of local only information. Data aggregation is performed on the fly at intermediate sensor nodes, while at the same time the end-to-end latency constraints are satisfied. An analytical model to represent the data aggregation and report delivery process in sensor networks, with specific delivery quality requirements in terms of the achievable end-to-end delay and the successful report delivery probability, is also presented. Based on this model, some insights about the impact on the achievable system performance, of the various designs parameters and the tradeoffs involved in the process of data aggregation and the proposed strategy, are gained. Furthermore, a localized adaptive data collection algorithm performed at the source nodes is developed that balances the design tradeoffs of delay, measurement accuracy and buffer overflow, for given QoS requirements. The performance of the proposed approach is analyzed and evaluated, through modeling and simulation, under different data aggregation scenarios and traffic loads. The impact of several design parameters and tradeoffs on various critical network and application related performance metrics, such as energy efficiency, network lifetime, end-to-end latency, and data loss are also evaluated and discussed

Decentralized mobility models for data collection in wireless sensor networks

Controlled mobility in wireless sensor networks provides many benefits towards enhancing the network performance and prolonging its lifetime. Mobile elements, acting as mechanical data carriers, traverse the network collecting data using single-hop communication, instead of the more energy demanding multi-hop routing to the sink. Scaling up from single to multiple mobiles is based more on the mobility models and the coordination methodology rather than increasing the number of mobile elements in the network. This work addresses the problem of designing and coordinating decentralized mobile elements for scheduling data collection in wireless sensor networks, while preserving some performance measures, such as latency and amount of data collected. We propose two mobility models governing the behaviour of the mobile element, where the incoming data collection requests are scheduled to service according to bidding strategies to determine the winner element. Simulations are run to measure the performance of the proposed mobility models subject to the network size and the number of mobile elements.<br /

An ant colony optimization approach for maximizing the lifetime of heterogeneous wireless sensor networks

Maximizing the lifetime of wireless sensor networks (WSNs) is a challenging problem. Although some methods exist to address the problem in homogeneous WSNs, research on this problem in heterogeneous WSNs have progressed at a slow pace. Inspired by the promising performance of ant colony optimization (ACO) to solve combinatorial problems, this paper proposes an ACO-based approach that can maximize the lifetime of heterogeneous WSNs. The methodology is based on finding the maximum number of disjoint connected covers that satisfy both sensing coverage and network connectivity. A construction graph is designed with each vertex denoting the assignment of a device in a subset. Based on pheromone and heuristic information, the ants seek an optimal path on the construction graph to maximize the number of connected covers. The pheromone serves as a metaphor for the search experiences in building connected covers. The heuristic information is used to reflect the desirability of device assignments. A local search procedure is designed to further improve the search efficiency. The proposed approach has been applied to a variety of heterogeneous WSNs. The results show that the approach is effective and efficient in finding high-quality solutions for maximizing the lifetime of heterogeneous WSNs