Amorphous Placement and Retrieval of Sensory Data in Sparse Mobile Ad-Hoc Networks

Abstract—Personal communication devices are increasingly being equipped with sensors that are able to passively collect information from their surroundings – information that could be stored in fairly small local caches. We envision a system in which users of such devices use their collective sensing, storage, and communication resources to query the state of (possibly remote) neighborhoods. The goal of such a system is to achieve the highest query success ratio using the least communication overhead (power). We show that the use of Data Centric Storage (DCS), or directed placement, is a viable approach for achieving this goal, but only when the underlying network is well connected. Alternatively, we propose, amorphous placement, in which sensory samples are cached locally and informed exchanges of cached samples is used to diffuse the sensory data throughout the whole network. In handling queries, the local cache is searched first for potential answers. If unsuccessful, the query is forwarded to one or more direct neighbors for answers. This technique leverages node mobility and caching capabilities to avoid the multi-hop communication overhead of directed placement. Using a simplified mobility model, we provide analytical lower and upper bounds on the ability of amorphous placement to achieve uniform field coverage in one and two dimensions. We show that combining informed shuffling of cached samples upon an encounter between two nodes, with the querying of direct neighbors could lead to significant performance improvements. For instance, under realistic mobility models, our simulation experiments show that amorphous placement achieves 10% to 40% better query answering ratio at a 25% to 35% savings in consumed power over directed placement.National Science Foundation (CNS Cybertrust 0524477, CNS NeTS 0520166, CNS ITR 0205294, EIA RI 0202067

Enhanced group-based wireless ad-hoc sensor network protocol

[EN] Communication is the major energy consumption source in wireless ad-hoc sensor networks. Thus, an efficient tradeoff between the energy cost of the communication and network's performance is a key challenge in conceiving a wireless ad-hoc sensor network. In this article, we propose an improved group-based architecture for wireless ad-hoc sensor networks. An optimized group forming procedure and an efficient communication operation are introduced. In order to validate the proposed approach, we suggest a group-based strategy to monitor pharmaceutical drugs during transportation. Real measurements of temperature and vibration were performed to validate the effectiveness of our approach.Khedher, M.; Lloret, J.; Douik, A. (2016). Enhanced group-based wireless ad-hoc sensor network protocol. International Journal of Distributed Sensor Networks. 12(7):1-18. https://doi.org/10.1177/1550147716659427S118127Dargie, W., & Poellabauer, C. (2010). Fundamentals of Wireless Sensor Networks. doi:10.1002/9780470666388Singh, S. P., & Sharma, S. C. (2015). A Survey on Cluster Based Routing Protocols in Wireless Sensor Networks. Procedia Computer Science, 45, 687-695. doi:10.1016/j.procs.2015.03.133Liao, Y., Qi, H., & Li, W. (2013). Load-Balanced Clustering Algorithm With Distributed Self-Organization for Wireless Sensor Networks. IEEE Sensors Journal, 13(5), 1498-1506. doi:10.1109/jsen.2012.2227704Peng, I.-H., & Chen, Y.-W. (2013). Energy consumption bounds analysis and its applications for grid based wireless sensor networks. Journal of Network and Computer Applications, 36(1), 444-451. doi:10.1016/j.jnca.2012.04.014Lloret, J., Garcia, M., Tomás, J., & Boronat, F. (2008). GBP-WAHSN: A Group-Based Protocol for Large Wireless Ad Hoc and Sensor Networks. Journal of Computer Science and Technology, 23(3), 461-480. doi:10.1007/s11390-008-9147-6Lloret, J., García, M., Boronat, F., & Tomás, J. (s. f.). MANET Protocols Performance in Group-based Networks. IFIP International Federation for Information Processing, 161-172. doi:10.1007/978-0-387-84839-6_13Lloret, J., Garcia, M., & Tomas, J. (s. f.). Improving Mobile and Ad-hoc Networks performance using Group-Based Topologies. Wireless Sensor and Actor Networks II, 209-220. doi:10.1007/978-0-387-09441-0_18Lloret, J., Palau, C., Boronat, F., & Tomas, J. (2008). Improving networks using group-based topologies. Computer Communications, 31(14), 3438-3450. doi:10.1016/j.comcom.2008.05.030Garcia, M., Sendra, S., Lloret, J., & Canovas, A. (2011). Saving energy and improving communications using cooperative group-based Wireless Sensor Networks. Telecommunication Systems, 52(4), 2489-2502. doi:10.1007/s11235-011-9568-3Garcia, M., & Lloret, J. (2009). A Cooperative Group-Based Sensor Network for Environmental Monitoring. Cooperative Design, Visualization, and Engineering, 276-279. doi:10.1007/978-3-642-04265-2_41Shaikh, R. A., Jameel, H., d’ Auriol, B. J., Heejo Lee, Sungyoung Lee, & Young-Jae Song. (2009). Group-Based Trust Management Scheme for Clustered Wireless Sensor Networks. IEEE Transactions on Parallel and Distributed Systems, 20(11), 1698-1712. doi:10.1109/tpds.2008.258Chen, Y.-S., Hsu, C.-S., & Lee, H.-K. (2014). An Enhanced Group Mobility Protocol for 6LoWPAN-Based Wireless Body Area Networks. IEEE Sensors Journal, 14(3), 797-807. doi:10.1109/jsen.2013.2287895Yao-Chung Chang, Zhi-Sheng Lin, & Jiann-Liang Chen. (2006). Cluster based self-organization management protocols for wireless sensor networks. IEEE Transactions on Consumer Electronics, 52(1), 75-80. doi:10.1109/tce.2006.1605028Fazio, P., De Rango, F., Sottile, C., & Santamaria, A. F. (2013). Routing Optimization in Vehicular Networks: A New Approach Based on Multiobjective Metrics and Minimum Spanning Tree. International Journal of Distributed Sensor Networks, 9(11), 598675. doi:10.1155/2013/598675Saravanan, M., & Madheswaran, M. (2014). A Hybrid Optimized Weighted Minimum Spanning Tree for the Shortest Intrapath Selection in Wireless Sensor Network. Mathematical Problems in Engineering, 2014, 1-8. doi:10.1155/2014/71342

Geographic Gossip: Efficient Averaging for Sensor Networks

Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standard gossip algorithms can lead to a significant waste in energy by repeatedly recirculating redundant information. For realistic sensor network model topologies like grids and random geometric graphs, the inefficiency of gossip schemes is related to the slow mixing times of random walks on the communication graph. We propose and analyze an alternative gossiping scheme that exploits geographic information. By utilizing geographic routing combined with a simple resampling method, we demonstrate substantial gains over previously proposed gossip protocols. For regular graphs such as the ring or grid, our algorithm improves standard gossip by factors of $n$ and $\sqrt{n}$ respectively. For the more challenging case of random geometric graphs, our algorithm computes the true average to accuracy $\epsilon$ using $O(\frac{n^{1.5}}{\sqrt{\log n}} \log \epsilon^{-1})$ radio transmissions, which yields a $\sqrt{\frac{n}{\log n}}$ factor improvement over standard gossip algorithms. We illustrate these theoretical results with experimental comparisons between our algorithm and standard methods as applied to various classes of random fields.Comment: To appear, IEEE Transactions on Signal Processin

A critical analysis of research potential, challenges and future directives in industrial wireless sensor networks

In recent years, Industrial Wireless Sensor Networks (IWSNs) have emerged as an important research theme with applications spanning a wide range of industries including automation, monitoring, process control, feedback systems and automotive. Wide scope of IWSNs applications ranging from small production units, large oil and gas industries to nuclear fission control, enables a fast-paced research in this field. Though IWSNs offer advantages of low cost, flexibility, scalability, self-healing, easy deployment and reformation, yet they pose certain limitations on available potential and introduce challenges on multiple fronts due to their susceptibility to highly complex and uncertain industrial environments. In this paper a detailed discussion on design objectives, challenges and solutions, for IWSNs, are presented. A careful evaluation of industrial systems, deadlines and possible hazards in industrial atmosphere are discussed. The paper also presents a thorough review of the existing standards and industrial protocols and gives a critical evaluation of potential of these standards and protocols along with a detailed discussion on available hardware platforms, specific industrial energy harvesting techniques and their capabilities. The paper lists main service providers for IWSNs solutions and gives insight of future trends and research gaps in the field of IWSNs

A Scale-Free Topology Construction Model for Wireless Sensor Networks

A local-area and energy-efficient (LAEE) evolution model for wireless sensor networks is proposed. The process of topology evolution is divided into two phases. In the first phase, nodes are distributed randomly in a fixed region. In the second phase, according to the spatial structure of wireless sensor networks, topology evolution starts from the sink, grows with an energy-efficient preferential attachment rule in the new node's local-area, and stops until all nodes are connected into network. Both analysis and simulation results show that the degree distribution of LAEE follows the power law. This topology construction model has better tolerance against energy depletion or random failure than other non-scale-free WSN topologies.Comment: 13pages, 3 figure