On Modeling Geometric Joint Sink Mobility with Delay-Tolerant Cluster-less Wireless Sensor Networks

Moving Sink (MS) in Wireless Sensor Networks (WSNs) has appeared as a blessing because it collects data directly from the nodes where the concept of relay nodes is becomes obsolete. There are, however, a few challenges to be taken care of, like data delay tolerance and trajectory of MS which is NP-hard. In our proposed scheme, we divide the square field in small squares. Middle point of the partitioned area is the sojourn location of the sink, and nodes around MS are in its transmission range, which send directly the sensed data in a delay-tolerant fashion. Two sinks are moving simultaneously; one inside and having four sojourn locations and other in outer trajectory having twelve sojourn locations. Introduction of the joint mobility enhances network life and ultimately throughput. As the MS comes under the NP-hard problem, we convert it into a geometric problem and define it as, Geometric Sink Movement (GSM). A set of linear programming equations has also been given in support of GSM which prolongs network life time

Distance Aware Relaying Energy-efficient: DARE to Monitor Patients in Multi-hop Body Area Sensor Networks

In recent years, interests in the applications of Wireless Body Area Sensor Network (WBASN) is noticeably developed. WBASN is playing a significant role to get the real time and precise data with reduced level of energy consumption. It comprises of tiny, lightweight and energy restricted sensors, placed in/on the human body, to monitor any ambiguity in body organs and measure various biomedical parameters. In this study, a protocol named Distance Aware Relaying Energy-efficient (DARE) to monitor patients in multi-hop Body Area Sensor Networks (BASNs) is proposed. The protocol operates by investigating the ward of a hospital comprising of eight patients, under different topologies by positioning the sink at different locations or making it static or mobile. Seven sensors are attached to each patient, measuring different parameters of Electrocardiogram (ECG), pulse rate, heart rate, temperature level, glucose level, toxins level and motion. To reduce the energy consumption, these sensors communicate with the sink via an on-body relay, affixed on the chest of each patient. The body relay possesses higher energy resources as compared to the body sensors as, they perform aggregation and relaying of data to the sink node. A comparison is also conducted conducted with another protocol of BAN named, Mobility-supporting Adaptive Threshold-based Thermal-aware Energy-efficient Multi-hop ProTocol (M-ATTEMPT). The simulation results show that, the proposed protocol achieves increased network lifetime and efficiently reduces the energy consumption, in relative to M-ATTEMPT protocol.Comment: IEEE 8th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA'13), Compiegne, Franc

Energy efficient data collection with multiple mobile sink using artificial bee colony algorithm in large-scale WSN

In most wireless sensor networks (WSN), multi-hop routing algorithm is used to transmit the data collected by sensors to user. Multi-hop forwarding leads to energy hole problem and high transmission overhead in large scale WSN. In order to address these problems, this paper proposes multiple mobile sink based data collection algorithm, which introduces energy balanced clustering and Artificial Bee Colony based data collection. The cluster head election is based on the residual energy of the node. In this study, we focused on a large-scale and intensive WSN which allows a certain amount of data latency by investigating mobile Sink balance from three aspects: data collection maximization, mobile path length minimization, and network reliability optimization. Simulation results show that, in comparison with other algorithms such Random walk and Ant Colony Optimization, the proposed algorithm can effectively reduce data transmission, save energy, improve network data collection efficiency and reliability, and extend the network lifetime

Performance optimization of wireless sensor networks for remote monitoring

Wireless sensor networks (WSNs) have gained worldwide attention in recent years because of their great potential for a variety of applications such as hazardous environment exploration, military surveillance, habitat monitoring, seismic sensing, and so on. In this thesis we study the use of WSNs for remote monitoring, where a wireless sensor network is deployed in a remote region for sensing phenomena of interest while its data monitoring center is located in a metropolitan area that is geographically distant from the monitored region. This application scenario poses great challenges since such kind of monitoring is typically large scale and expected to be operational for a prolonged period without human involvement. Also, the long distance between the monitored region and the data monitoring center requires that the sensed data must be transferred by the employment of a third-party communication service, which incurs service costs. Existing methodologies for performance optimization of WSNs base on that both the sensor network and its data monitoring center are co-located, and therefore are no longer applicable to the remote monitoring scenario. Thus, developing new techniques and approaches for severely resource-constrained WSNs is desperately needed to maintain sustainable, unattended remote monitoring with low cost. Specifically, this thesis addresses the key issues and tackles problems in the deployment of WSNs for remote monitoring from the following aspects. To maximize the lifetime of large-scale monitoring, we deal with the energy consumption imbalance issue by exploring multiple sinks. We develop scalable algorithms which determine the optimal number of sinks needed and their locations, thereby dynamically identifying the energy bottlenecks and balancing the data relay workload throughout the network. We conduct experiments and the experimental results demonstrate that the proposed algorithms significantly prolong the network lifetime. To eliminate imbalance of energy consumption among sensor nodes, a complementary strategy is to introduce a mobile sink for data gathering. However, the limited communication time between the mobile sink and nodes results in that only part of sensed data will be collected and the rest will be lost, for which we propose the concept of monitoring quality with the exploration of sensed data correlation among nodes. We devise a heuristic for monitoring quality maximization, which schedules the sink to collect data from selected nodes, and uses the collected data to recover the missing ones. We study the performance of the proposed heuristic and validate its effectiveness in improving the monitoring quality. To strive for the fine trade-off between two performance metrics: throughput and cost, we investigate novel problems of minimizing cost with guaranteed throughput, and maximizing throughput with minimal cost. We develop approximation algorithms which find reliable data routing in the WSN and strategically balance workload on the sinks. We prove that the delivered solutions are fractional of the optimum. We finally conclude our work and discuss potential research topics which derive from the studies of this thesis

On Mobility Management in Multi-Sink Sensor Networks for Geocasting of Queries

In order to efficiently deal with location dependent messages in multi-sink wireless sensor networks (WSNs), it is key that the network informs sinks what geographical area is covered by which sink. The sinks are then able to efficiently route messages which are only valid in particular regions of the deployment. In our previous work (see the 5th and 6th cited documents), we proposed a combined coverage area reporting and geographical routing protocol for location dependent messages, for example, queries that are injected by sinks. In this paper, we study the case where we have static sinks and mobile sensor nodes in the network. To provide up-to-date coverage areas to sinks, we focus on handling node mobility in the network. We discuss what is a better method for updating the routing structure (i.e., routing trees and coverage areas) to handle mobility efficiently: periodic global updates initiated from sinks or local updates triggered by mobile sensors. Simulation results show that local updating perform very well in terms of query delivery ratio. Local updating has a better scalability to increasing network size. It is also more energy efficient than ourpreviously proposed approach, where global updating in networks have medium mobility rate and speed

Zone-Based Energy Aware Data Collection Protocol for WSNs

In this paper we propose the Zone-based Energy Aware data coLlection (ZEAL) protocol. ZEAL is designed to be used in agricultural applications for wireless sensor networks. In these type of applications, all data is often routed to a single point (named “sink” in sensor networks). The overuse of the same routes quickly depletes the energy of the nodes closer to the sink. In order to minimize this problem, ZEAL automatically creates zones (groups of nodes) independent from each other based on the trajectory of one or more mobile sinks. In this approach the sinks collects data queued in sub-sinks in each zone. Unlike existing protocols, ZEAL accomplish its routing tasks without using GPS modules for location awareness or synchronization mechanisms. Additionally, ZEAL provides an energy saving mechanism on the network layer that puts zones to sleep when there are no mobile sinks nearby. To evaluate ZEAL, it is compared with the Maximum Amount Shortest Path (MASP) protocol. Our simulations using the ns-3 network simulator show that ZEAL is able to collect a larger number of packets with significantly less energy in the same amount of time