Talk More Listen Less: Energy-Efficient Neighbor Discovery in Wireless Sensor Networks

Neighbor discovery is a fundamental service for initialization and managing network dynamics in wireless sensor networks and mobile sensing applications. In this paper, we present a novel design principle named Talk More Listen Less (TMLL) to reduce idle-listening in neighbor discovery protocols by learning the fact that more beacons lead to fewer wakeups. We propose an extended neighbor discovery model for analyzing wakeup schedules in which beacons are not necessarily placed in the wakeup slots. Furthermore, we are the first to consider channel occupancy rate in discovery protocols by introducing a new metric to trade off among duty-cycle, latency and channel occupancy rate. Guided by the TMLL principle, we have designed Nihao, a family of energy-efficient asynchronous neighbor discovery protocols for symmetric and asymmetric cases. We compared Nihao with existing state of the art protocols via analysis and real-world testbed experiments. The result shows that Nihao significantly outperforms the others both in theory and practice.Comment: 9 pages, 14 figures, published in IEEE INFOCOM 201

Secure and Economical Cost Aware Routing Protocol in Wireless Sensor Networks

The main objective of the paper is to supply security and to expand the network lifetime The energy management domain is selected to reinforce the security system in wireless sensor networks A typical wireless sensor network consists of many trivial and low-power sensors that sense radio frequencies to perform disseminate sensing tasks These nodes typically have really restri cted and non-replenish prepared energy resources that produces energy and an important vogue issue for these networks Routing is another really troublesome vogue issue for WSNs Properly designed routing protocol not absolutely guarantees high message delivery relation and low energy consumption for message delivery but in addition it should balance the full sensor network energy consumption and thereby extend the sensor network fundamental measure Throughout this paper the tendency to confer Secure and Economical value Aware Secure Routing protocol for WSNs to balance the energy consumption and enhance the network fundamental measure Further the tendency to reinforce very cheap work to avoid the fake energy indicator nodes by victimizing the house parameter

Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey

Wireless sensor networks (WSNs) consist of autonomous and resource-limited devices. The devices cooperate to monitor one or more physical phenomena within an area of interest. WSNs operate as stochastic systems because of randomness in the monitored environments. For long service time and low maintenance cost, WSNs require adaptive and robust methods to address data exchange, topology formulation, resource and power optimization, sensing coverage and object detection, and security challenges. In these problems, sensor nodes are to make optimized decisions from a set of accessible strategies to achieve design goals. This survey reviews numerous applications of the Markov decision process (MDP) framework, a powerful decision-making tool to develop adaptive algorithms and protocols for WSNs. Furthermore, various solution methods are discussed and compared to serve as a guide for using MDPs in WSNs

NECESSITY TO SECURE WIRELESS SENSOR NETWORK

Wireless sensor networks are often deployed in hostile and unattended environments. The nodes will be failure by fault, intrusion and battery exhaustion. Node - failure tolerance is an acceptable method to improve the networks lifetime. In this paper, two key problems for topology control are presented: first, how to get a node - failure topology when there is intrusion from the nodes of hostile enemies? Secondly , how to sustain this node - failure topology with all deployed node s being exhausted ultimately? Here we suggest a novel approach for topology control and prove that it is node - failure tolerant. The approach contains three phases: topology discovery, topology update, and topology regeneration. A tricolor - based method is proposed to build architecture with high tolerance ability and some security protocols are employed to preclude the hostile nodes in discovery phase. In update and regeneration phases, the newly deployed nodes are regarded as renewable resource to fill in the consumed energy, enhance the debased node - failure tolerance ability, prolong network lifetime d . A security protocol with forward and backward secrecy is devised to adapt the topology changed by node failure and node joining. Some attributes of the presented method are shown by simulations, and differences a re given by comparison with related work

Channel Access Management in Data Intensive Sensor Networks

There are considerable challenges for channel access in Data Intensive Sensor Networks - DISN, supporting Data Intensive Applications like Structural Health Monitoring. As the data load increases, considerable degradation of the key performance parameters of such sensor networks is observed. Successful packet delivery ratio drops due to frequent collisions and retransmissions. The data glut results in increased latency and energy consumption overall. With the considerable limitations on sensor node resources like battery power, this implies that excessive transmissions in response to sensor queries can lead to premature network death. After a certain load threshold the performance characteristics of traditional WSNs become unacceptable. Research work indicates that successful packet delivery ratio in 802.15.4 networks can drop from 95% to 55% as the offered network load increases from 1 packet/sec to 10 packets/sec. This result in conjunction with the fact that it is common for sensors in an SHM system to generate 6-8 packets/sec of vibration data makes it important to design appropriate channel access schemes for such data intensive applications.In this work, we address the problem of significant performance degradation in a special-purpose DISN. Our specific focus is on the medium access control layer since it gives a fine-grained control on managing channel access and reducing energy waste. The goal of this dissertation is to design and evaluate a suite of channel access schemes that ensure graceful performance degradation in special-purpose DISNs as the network traffic load increases.First, we present a case study that investigates two distinct MAC proposals based on random access and scheduling access. The results of the case study provide the motivation to develop hybrid access schemes. Next, we introduce novel hybrid channel access protocols for DISNs ranging from a simple randomized transmission scheme that is robust under channel and topology dynamics to one that utilizes limited topological information about neighboring sensors to minimize collisions and energy waste. The protocols combine randomized transmission with heuristic scheduling to alleviate network performance degradation due to excessive collisions and retransmissions. We then propose a grid-based access scheduling protocol for a mobile DISN that is scalable and decentralized. The grid-based protocol efficiently handles sensor mobility with acceptable data loss and limited overhead. Finally, we extend the randomized transmission protocol from the hybrid approaches to develop an adaptable probability-based data transmission method. This work combines probabilistic transmission with heuristics, i.e., Latin Squares and a grid network, to tune transmission probabilities of sensors, thus meeting specific performance objectives in DISNs. We perform analytical evaluations and run simulation-based examinations to test all of the proposed protocols

Cross-layer aided energy-efficient routing design for ad hoc networks

In this treatise, we first review some basic routing protocols conceived for ad hoc networks, followed by some design examples of cross-layer operation aided routing protocols. Specifically, cross-layer operation across the PHYsical layer (PHY), the Data Link layer (DL) and even the NETwork layer (NET) is exemplified for improving the energy efficiency of the entire system. Moreover, the philosophy of Opportunistic Routing (OR) is reviewed for the sake of further reducing the system's energy dissipation with the aid of optimized Power Allocation (PA). The system's end-to-end throughput is also considered in the context of a design example

Energy Efficient and Reliable Wireless Sensor Networks - An Extension to IEEE 802.15.4e

Collecting sensor data in industrial environments from up to some tenth of battery powered sensor nodes with sampling rates up to 100Hz requires energy aware protocols, which avoid collisions and long listening phases. The IEEE 802.15.4 standard focuses on energy aware wireless sensor networks (WSNs) and the Task Group 4e has published an amendment to fulfill up to 100 sensor value transmissions per second per sensor node (Low Latency Deterministic Network (LLDN) mode) to satisfy demands of factory automation. To improve the reliability of the data collection in the star topology of the LLDN mode, we propose a relay strategy, which can be performed within the LLDN schedule. Furthermore we propose an extension of the star topology to collect data from two-hop sensor nodes. The proposed Retransmission Mode enables power savings in the sensor node of more than 33%, while reducing the packet loss by up to 50%. To reach this performance, an optimum spatial distribution is necessary, which is discussed in detail

Chapter Probabilistic Routing in Opportunistic Ad Hoc Networks

Ophthalmolog

Adaptive Square-Shaped Trajectory-Based Service Location Protocol in Wireless Sensor Networks

In this paper we propose an adaptive square-shaped trajectory (ASST)-based service location method to ensure load scalability in wireless sensor networks. This first establishes a square-shaped trajectory over the nodes that surround a target point computed by the hash function and any user can access it, using the hash. Both the width and the size of the trajectory are dynamically adjustable, depending on the number of queries made to the service information on the trajectory. The number of sensor nodes on the trajectory varies in proportion to the changing trajectory shape, allowing high loads to be distributed around the hot spot area

Probabilistic Routing in Opportunistic Ad Hoc Networks

Ophthalmolog