Human-mobility-based sensor context-aware routing protocol for delay-tolerant data gathering in multi-sink cell-phone-based sensor networks

Ubiquitous use of cell phones encourages development of novel applications with sensors embedded in cell phones. The collection of information generated by these devices is a challenging task considering volatile topologies and energy-based scarce resources. Further, the data delivery to the sink is delay tolerant. Mobility of cell phones is opportunistically exploited for forwarding sensor generated data towards the sink. Human mobility model shows truncated power law distribution of flight length, pause time, and intercontact time. The power law behavior of inter-contact time often discourages routing of data using naive forwarding schemes. This work exploits the flight length and the pause time distributions of human mobility to design a better and efficient routing strategy. We propose a Human-Mobility-based Sensor Context-Aware Routing protocol (HMSCAR), which exploits human mobility patterns to smartly forward data towards the sink basically comprised of wi-fi hot spots or cellular base stations. The simulation results show that HMSCAR significantly outperforms the SCAR, SFR, and GRAD-MOB on the aspects of delivery ratio and time delay. A multi-sink scenario and single-copy replication scheme is assumed

A comprehensive review of wireless body area network

Recent development and advancement of information and communication technologies facilitate people in different dimensions of life. Most importantly, in the healthcare industry, this has become more and more involved with the information and communication technology-based services. One of the most important services is monitoring of remote patients, that enables the healthcare providers to observe, diagnose and prescribe the patients without being physically present. The advantage of miniaturization of sensor technologies gives the flexibility of installing in, on or off the body of patients, which is capable of forwarding physiological data wirelessly to remote servers. Such technology is named as Wireless Body Area Network (WBAN). In this paper, WBAN architecture, communication technologies for WBAN, challenges and different aspects of WBAN are illustrated. This paper also describes the architectural limitations of existing WBAN communication frameworks. blueFurthermore, implementation requirements are presented based on IEEE 802.15.6 standard. Finally, as a source of motivation towards future development of research incorporating Software Defined Networking (SDN), Energy Harvesting (EH) and Blockchain technology into WBAN are also provided

Energy efficient and secure wireless communications for wireless sensor networks

This dissertation considers wireless sensor networks (WSNs) operating in severe environments where energy efficiency and security are important factors. This main aim of this research is to improve routing protocols in WSNs to ensure efficient energy usage and protect against attacks (especially energy draining attacks) targeting WSNs. An enhancement of the existing AODV (Ad hoc On-Demand Distance Vector) routing protocol for energy efficiency, called AODV-Energy Harvesting Aware (AODVEHA), is proposed and evaluated. It not only inherits the advantages of AODV which are well suited to ad hoc networks, but also makes use of the energy harvesting capability of sensor nodes in the network. In addition to the investigation of energy efficiency, another routing protocol called Secure and Energy Aware Routing Protocol (ETARP) designed for energy efficiency and security of WSNs is presented. The key part of the ETARP is route selection based on utility theory, which is a novel approach to simultaneously factor energy efficiency and trustworthiness of routes in the routing protocol. Finally, this dissertation proposes a routing protocol to protect against a specific type of resource depletion attack called Vampire attacks. The proposed resource-conserving protection against energy draining (RCPED) protocol is independent of cryptographic methods, which brings advantage of less energy cost and hardware requirement. RCPED collaborates with existing routing protocols, detects abnormal sign of Vampire attacks and determines the possible attackers. Then routes are discovered and selected on the basis of maximum priority, where the priority that reflects the energy efficiency and safety level of route is calculated by means of Analytic Hierarchy Process (AHP). The proposed analytic model for the aforementioned routing solutions are verified by simulations. Simulations results validate the improvements of proposed routing approaches in terms of better energy efficiency and guarantee of security

Human mobility based stable clustering for data aggregation in singlehop cell phone based wireless sensor network

Advances in 3G and 4G technology have offered many possibilities for developing novel applications using sensors embedded in hand held devices like cell phones. Mobility of cell phone based wireless sensor network has a critical issue of gathering sensed information in an energy efficient and delay sensitive manner. In this paper we provide a human mobility based stable clustering algorithm for data aggregation in single hop cell phone based sensor network incorporating mobility of cell phone users. We present a human mobility aware weighted clustering algorithm for data aggregation under Truncated Levy Walk (TLW) mobility model. Our approach is to select stable Cluster Heads (CH) to save the energy expenditure of network back bone formation. We have compared our algorithm with WCA [9] of mobile adhoc network and with MRECA [6] algorithm of mobile adhoc sensor network which we consider to be closely related with our work. WCA algorithm's mobility parameter is not effectively capturing mobility of human walk. Our Human mobility aware Weighted Cluster based Data Aggregation algorithm (Hm-WCDA) effectively captures human walk characteristics and thereby stabilizes the back bone network. We have evaluated performance of our algorithm primarily with stability related parameters such as number of dominant set (DS) updates, number of reaffiliations and number of cluster heads; which directly effects the energy consumption of the algorithm. The simulation results show that our algorithm is more energy-efficient and reduces the energy consumption by 18 percent as compared to MRECA and by 9 percent as compared to WCA for cluster radius of 400m