Optimal coverage multi-path scheduling scheme with multiple mobile sinks for WSNs

Wireless Sensor Networks (WSNs) are usually formed with many tiny sensors which are randomly deployed within sensing field for target monitoring. These sensors can transmit their monitored data to the sink in a multi-hop communication manner. However, the ‘hot spots’ problem will be caused since nodes near sink will consume more energy during forwarding. Recently, mobile sink based technology provides an alternative solution for the long-distance communication and sensor nodes only need to use single hop communication to the mobile sink during data transmission. Even though it is difficult to consider many network metrics such as sensor position, residual energy and coverage rate etc., it is still very important to schedule a reasonable moving trajectory for the mobile sink. In this paper, a novel trajectory scheduling method based on coverage rate for multiple mobile sinks (TSCR-M) is presented especially for large-scale WSNs. An improved particle swarm optimization (PSO) combined with mutation operator is introduced to search the parking positions with optimal coverage rate. Then the genetic algorithm (GA) is adopted to schedule the moving trajectory for multiple mobile sinks. Extensive simulations are performed to validate the performance of our proposed method

Energy-Delay Tradeoff and Dynamic Sleep Switching for Bluetooth-Like Body-Area Sensor Networks

Wireless technology enables novel approaches to healthcare, in particular the remote monitoring of vital signs and other parameters indicative of people's health. This paper considers a system scenario relevant to such applications, where a smart-phone acts as a data-collecting hub, gathering data from a number of wireless-capable body sensors, and relaying them to a healthcare provider host through standard existing cellular networks. Delay of critical data and sensors' energy efficiency are both relevant and conflicting issues. Therefore, it is important to operate the wireless body-area sensor network at some desired point close to the optimal energy-delay tradeoff curve. This tradeoff curve is a function of the employed physical-layer protocol: in particular, it depends on the multiple-access scheme and on the coding and modulation schemes available. In this work, we consider a protocol closely inspired by the widely-used Bluetooth standard. First, we consider the calculation of the minimum energy function, i.e., the minimum sum energy per symbol that guarantees the stability of all transmission queues in the network. Then, we apply the general theory developed by Neely to develop a dynamic scheduling policy that approaches the optimal energy-delay tradeoff for the network at hand. Finally, we examine the queue dynamics and propose a novel policy that adaptively switches between connected and disconnected (sleeping) modes. We demonstrate that the proposed policy can achieve significant gains in the realistic case where the control "NULL" packets necessary to maintain the connection alive, have a non-zero energy cost, and the data arrival statistics corresponding to the sensed physical process are bursty.Comment: Extended version (with proofs details in the Appendix) of a paper accepted for publication on the IEEE Transactions on Communication

Unified clustering and communication protocol for wireless sensor networks

In this paper we present an energy-efficient cross layer protocol for providing application specific reservations in wireless senor networks called the “Unified Clustering and Communication Protocol ” (UCCP). Our modular cross layered framework satisfies three wireless sensor network requirements, namely, the QoS requirement of heterogeneous applications, energy aware clustering and data forwarding by relay sensor nodes. Our unified design approach is motivated by providing an integrated and viable solution for self organization and end-to-end communication is wireless sensor networks. Dynamic QoS based reservation guarantees are provided using a reservation-based TDMA approach. Our novel energy-efficient clustering approach employs a multi-objective optimization technique based on OR (operations research) practices. We adopt a simple hierarchy in which relay nodes forward data messages from cluster head to the sink, thus eliminating the overheads needed to maintain a routing protocol. Simulation results demonstrate that UCCP provides an energy-efficient and scalable solution to meet the application specific QoS demands in resource constrained sensor nodes. Index Terms — wireless sensor networks, unified communication, optimization, clustering and quality of service

Comparison of CSMA based MAC protocols of wireless sensor networks

Energy conservation has been an important area of interest in Wireless Sensor networks (WSNs). Medium Access Control (MAC) protocols play an important role in energy conservation. In this paper, we describe CSMA based MAC protocols for WSN and analyze the simulation results of these protocols. We implemented S-MAC, T-MAC, B-MAC, B-MAC+, X-MAC, DMAC and Wise-MAC in TOSSIM, a simulator which unlike other simulators simulates the same code running on real hardware. Previous surveys mainly focused on the classification of MAC protocols according to the techniques being used or problem dealt with and presented a theoretical evaluation of protocols. This paper presents the comparative study of CSMA based protocols for WSNs, showing which MAC protocol is suitable in a particular environment and supports the arguments with the simulation results. The comparative study can be used to find the best suited MAC protocol for wireless sensor networks in different environments.Comment: International Journal of AdHoc Network Systems, Volume 2, Number 2, April 201

Multihop clustering algorithm for load balancing in wireless sensor networks

The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach

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

An efficient scalable scheduling mac protocol for underwater sensor networks

Underwater Sensor Networks (UWSNs) utilise acoustic waves with comparatively lower loss and longer range than those of electromagnetic waves. However, energy remains a challenging issue in addition to long latency, high bit error rate, and limited bandwidth. Thus, collision and retransmission should be efficiently handled at Medium Access Control (MAC) layer in order to reduce the energy cost and also to improve the throughput and fairness across the network. In this paper, we propose a new reservation-based distributed MAC protocol called ED-MAC, which employs a duty cycle mechanism to address the spatial-temporal uncertainty and the hidden node problem to effectively avoid collisions and retransmissions. ED-MAC is a conflict-free protocol, where each sensor schedules itself independently using local information. Hence, ED-MAC can guarantee conflict-free transmissions and receptions of data packets. Compared with other conflict-free MAC protocols, ED-MAC is distributed and more reliable, i.e., it schedules according to the priority of sensor nodes which based on their depth in the network. We then evaluate design choices and protocol performance through extensive simulation to study the load effects and network scalability in each protocol. The results show that ED-MAC outperforms the contention-based MAC protocols and achieves a significant improvement in terms of successful delivery ratio, throughput, energy consumption, and fairness under varying offered traffic and number of nodes