Distributed Proxy-layer Scheduling in Heterogeneous Wireless Sensor Networks PDF Download

Author: Daeseob Lim
Publisher:
ISBN:
Category :
Languages : en
Pages : 162

View

Book Description

Author: Maciej Patan
Publisher: Springer
ISBN: 364228230X
Category : Technology & Engineering
Languages : en
Pages : 300

View

Book Description
Sensor networks have recently come into prominence because they hold the potential to revolutionize a wide spectrum of both civilian and military applications. An ingenious characteristic of sensor networks is the distributed nature of data acquisition. Therefore they seem to be ideally prepared for the task of monitoring processes with spatio-temporal dynamics which constitute one of most general and important classes of systems in modelling of the real-world phenomena. It is clear that careful deployment and activation of sensor nodes are critical for collecting the most valuable information from the observed environment. Optimal Sensor Network Scheduling in Identification of Distributed Parameter Systems discusses the characteristic features of the sensor scheduling problem, analyzes classical and recent approaches, and proposes a wide range of original solutions, especially dedicated for networks with mobile and scanning nodes. Both researchers and practitioners will find the case studies, the proposed algorithms, and the numerical examples to be invaluable.

Author: Kavin Rathinam Kasinathan
Publisher:
ISBN:
Category :
Languages : en
Pages : 72

View

Book Description

Author: Libin Jiang
Publisher: Morgan & Claypool Publishers
ISBN: 1608454614
Category : Computers
Languages : en
Pages : 144

View

Book Description
In this book, we consider the problem of achieving the maximum throughput and utility in a class of networks with resource-sharing constraints. This is a classical problem of great importance. In the context of wireless networks, we first propose a fully distributed scheduling algorithm that achieves the maximum throughput. Inspired by CSMA (Carrier Sense Multiple Access), which is widely deployed in today's wireless networks, our algorithm is simple, asynchronous, and easy to implement. Second, using a novel maximal-entropy technique, we combine the CSMA scheduling algorithm with congestion control to approach the maximum utility. Also, we further show that CSMA scheduling is a modular MAC-layer algorithm that can work with other protocols in the transport layer and network layer. Third, for wireless networks where packet collisions are unavoidable, we establish a general analytical model and extend the above algorithms to that case. Stochastic Processing Networks (SPNs) model manufacturing, communication, and service systems. In manufacturing networks, for example, tasks require parts and resources to produce other parts. SPNs are more general than queueing networks and pose novel challenges to throughput-optimum scheduling. We proposes a "deficit maximum weight" (DMW) algorithm to achieve throughput optimality and maximize the net utility of the production in SPNs. Table of Contents: Introduction / Overview / Scheduling in Wireless Networks / Utility Maximization in Wireless Networks / Distributed CSMA Scheduling with Collisions / Stochastic Processing networks

Author:
Publisher:
ISBN:
Category :
Languages : en
Pages :

View

Book Description
Wireless Sensor Networks (WSNs) are fast emerging as a new and ubiquitous networking arena which will enables many new applications and pervades many old ones. One of the motivations for the development of WSNs is their ability to be deployed in any environment in a comparatively ad-hoc manner. The most important challenge faced by WSNs is battery-limited lifetime of the network. Physically replacing batteries is infeasible in most real-life deployments of WSNs. It has been demonstrated both theoretically and practically that intelligent operation of WSN nodes can improve network lifetime. For example, turning off wireless transceivers at WSN nodes, minimizing idle listening, can increase battery lifetimes by large factors, especially in many passive data sensing applications where the sense-receive-transmit cycle of the sensors is periodic. In particular, we focus on some previous work in which an adaptive scheduling algorithm was proposed for this purpose, under unpredictable but small clock drift (so called quasi-periodic traffic). While this approach can adapt effectively to unknown transmission periods and unknown changes in transmission periods, the fundamental problem remains: a few nodes close to the base station deplete their batteries sooner than the rest resulting in early network death. Further, this phenomenon reduces the effectiveness of the method even more when (a) the periods of the various nodes are very disparate, and (b) when nodes artificially reduce their periods to maintain end-to-end delay bounds. In this thesis, we advance a new technique called "period inflation", by which the nodes of a WSN can cooperatively create a schedule in which nodes close to the base station have higher periods. We investigate the performance of the inflated and non-inflated cases for scenarios where all nodes have similar periods as well as when some nodes have very disparate periods, and also under bounded delay conditions. Numerical results show that the new tec.

Author: Rahul Chandrakant Shah
Publisher:
ISBN:
Category :
Languages : en
Pages : 324

View

Book Description

Author: Jun Zheng
Publisher: John Wiley & Sons
ISBN: 0470443510
Category : Technology & Engineering
Languages : en
Pages : 521

View

Book Description
Learn the fundamental concepts, major challenges, and effective solutions in wireless sensor networking This book provides a comprehensive and systematic introduction to the fundamental concepts, major challenges, and effective solutions in wireless sensor networking (WSN). Distinguished from other books, it focuses on the networking aspects of WSNs and covers the most important networking issues, including network architecture design, medium access control, routing and data dissemination, node clustering, node localization, query processing, data aggregation, transport and quality of service, time synchronization, network security, and sensor network standards. With contributions from internationally renowned researchers, Wireless Sensor Networks expertly strikes a balance between fundamental concepts and state-of-the-art technologies, providing readers with unprecedented insights into WSNs from a networking perspective. It is essential reading for a broad audience, including academic researchers, research engineers, and practitioners in industry. It is also suitable as a textbook or supplementary reading for electrical engineering, computer engineering, and computer science courses at the graduate level.

Author: Xiaojiang Ren
Publisher:
ISBN:
Category :
Languages : en
Pages : 0

View

Book Description
Wireless sensor network has emerged as a key technology for various applications such as environmental sensing, structural health monitoring, and area surveillance. Energy is by far one of the most critical design hurdles that hinders the deployment of wireless sensor networks. The lifetime of traditional battery-powered sensor networks is limited by the capacities of batteries. Even many energy conservation schemes were proposed to address this constraint, the network lifetime is still inherently restrained, as the consumed energy cannot be replenished easily. Fully addressing this issue requires energy to be replenished quite often in sensor networks (renewable sensor networks). One viable solution to energy shortages is enabling each sensor to harvest renewable energy from its surroundings such as solar energy, wind energy, and so on. In comparison with their conventional counterparts, the network lifetime in renewable sensor networks is no longer a main issue, since sensors can be recharged repeatedly. This results in a research focus shift from the network lifetime maximization in traditional sensor networks to the network performance optimization (e.g., monitoring quality). This thesis focuses on these issues and tackles important problems in renewable sensor networks as follows. We first study the target coverage optimization in renewable sensor networks via sensor duty cycle scheduling, where a renewable sensor network consisting of a set of heterogeneous sensors and a stationary base station need to be scheduled to monitor a set of targets in a monitoring area (e.g., some critical facilities) for a specified period, by transmitting their sensing data to the base station through multihop relays in a real-time manner. We formulate a coverage maximization problem in a renewable sensor network which is to schedule sensor activities such that the monitoring quality is maximized, subject to that the communication network induced by the activated sensors and the base station at each time moment is connected. We approach the problem for a given monitoring period by adopting a general strategy. That is, we divide the entire monitoring period into equal numbers of time slots and perform sensor activation or inactivation scheduling in the beginning of each time slot. As the problem is NP-hard, we devise efficient offline centralized and distributed algorithms for it, provided that the amount of harvested energy of each sensor for a given monitoring period can be predicted accurately. Otherwise, we propose an online adaptive framework to handle energy prediction fluctuation for this monitoring period. We conduct extensive experiments, and the experimental results show that the proposed solutions are very promising. We then investigate the data collection optimization in renewable sensor networks by exploiting sink mobility, where a mobile sink travels around the sensing field to collect data from sensors through one-hop transmission. With one-hop transmission, each sensor could send data directly to the mobile sink without any relay, and thus no energy are consumed on forwarding packets for others which is more energy efficient in comparison with multi-hop relays. Moreover, one-hop transmission particularly is very useful for a disconnected network, which may be due to the error-prone nature of wireless communication or the physical limit (e.g., some sensors are physically isolated), while multi-hop transmission is not applicable. In particular, we investigate two different kinds of mobile sinks, and formulate optimization problems under different scenarios, for which both centralized and distributed solutions are proposed accordingly. We study the performance of the proposed solutions and validate their effectiveness in improving the data quality. Since the energy harvested often varies over time, we also consider the scenario of renewable sensor networks by utilizing wireless energy transfer technology, where a mobile charging vehicle periodically travels inside the sensing field and charges sensors without any plugs or wires. Specifically, we propose a novel charging paradigm and formulate an optimization problem with an objective of maximizing the number of sensors charged per tour. We devise an offline approximation algorithm which runs in quasi-polynomial time and develop efficient online sensor charging algorithms, by considering the dynamic behaviors of sensors' various sensing and transmission activities. To study the efficiency of the proposed algorithms, we conduct extensive experiments and the experimental results demonstrate that the proposed algorithms are very efficient. We finally conclude our work and discuss potential research topics which derive from the studies of this thesis.

Author: Aung Aung
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages :

View

Book Description
Wireless sensor networks are made up of a large number of sensors deployed randomly in an ad-hoc manner in the area/target to be monitored. Due to their weight and size limitations, the energy conservation is the most critical issue. Energy saving in a wireless sensor network can be achieved by scheduling a subset of sensor nodes to activate and allowing others to go into low power sleep mode, or adjusting the transmission or sensing range of wireless sensor nodes. In this thesis, we focus on improving the lifetime of wireless sensor networks using both smart scheduling and adjusting sensing ranges. Firstly, we conduct a survey on existing works in literature and then we define the sensor network lifetime problem with range assignment. We then propose two completely localized and distributed scheduling algorithms with adjustable sensing range. These algorithms are the enhancement of distributed algorithms for fixed sensing range proposed in the literature. The simulation results show that there is almost 20 percent improvement of network lifetime when compare with the previous approaches.

Author: Fei Hu
Publisher: CRC Press
ISBN: 1439882665
Category : Computers
Languages : en
Pages : 531

View

Book Description
Written by award-winning engineers whose research has been sponsored by the U.S. National Science Foundation (NSF), IBM, and Cisco's University Research Program, Wireless Sensor Networks: Principles and Practice addresses everything product developers and technicians need to know to navigate the field. It provides an all-inclusive examina