Extending the Lifetime of Wireless Sensor Networks with Spatial Data Aggregation
Author | : Shoudong Zou |
Publisher | : |
Total Pages | : |
Release | : 2009 |
Genre | : Wireless sensor networks |
ISBN | : |
Download Extending The Lifetime Of Wireless Sensor Networks With Spatial Data Aggregation full books in PDF, epub, and Kindle. Read online free Extending The Lifetime Of Wireless Sensor Networks With Spatial Data Aggregation ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
Author | : Shoudong Zou |
Publisher | : |
Total Pages | : |
Release | : 2009 |
Genre | : Wireless sensor networks |
ISBN | : |
Author | : Zhihong Qian |
Publisher | : Springer Nature |
Total Pages | : 849 |
Release | : 2023-07-26 |
Genre | : Technology & Engineering |
ISBN | : 9819939518 |
This proceedings includes original, unpublished, peer-reviewed research papers from the International Conference on Wireless Communications, Networking and Applications (WCNA2022), held in Wuhan, Hubei, China, from December 16 to 18, 2022. The topics covered include but are not limited to wireless communications, networking and applications. The papers showcased here share the latest findings on methodologies, algorithms and applications in communication and network, making the book a valuable asset for professors, researchers, engineers, and university students alike.
Author | : Torsha Banerjee |
Publisher | : |
Total Pages | : 161 |
Release | : 2007 |
Genre | : |
ISBN | : |
Unlike conventional networks, wireless sensor networks (WSNs) are limited in power, have much smaller memory buffers, and possess relatively slower processing speeds. These characteristics necessitate minimum transfer and storage of information in order to prolong the network lifetime. In this dissertation, we exploit the spatio-temporal nature of sensor data to approximate the current values of the sensors based on readings obtained from neighboring sensors and itself. We propose a Tree based polynomial REGression algorithm, (TREG) that addresses the problem of data compression in wireless sensor networks. Instead of aggregated data, a polynomial function (P) is computed by the regression function, TREG. The coefficients of P are then passed to achieve the following goals: (i) The sink can get attribute values in the regions devoid of sensor nodes, and (ii) Readings over any portion of the region can be obtained at one time by querying the root of the tree. As the size of the data packet from each tree node to its parent remains constant, the proposed scheme scales very well with growing network density or increased coverage area. Since physical attributes exhibit a gradual change over time, we propose an iterative scheme, UPDATE_COEFF, which obviates the need to perform the regression function repeatedly and uses approximations based on previous readings. Extensive simulations are performed on real world data to demonstrate the effectiveness of our proposed aggregation algorithm, TREG. Results reveal that for a network density of 0.0025 nodes/m2, a complete binary tree of depth 4 could provide the absolute error to be less than 6%. A data compression ratio of about 0.02 is achieved using our proposed algorithm, which is almost independent of the tree depth. In addition, our proposed updating scheme makes the aggregation process faster while maintaining the desired error bounds. We also propose a Polynomial-based scheme that addresses the problem of Event Region Detection (PERD) for WSNs. When a single event occurs, a child of the tree sends a Flagged Polynomial (FP) to its parent, if the readings approximated by it falls outside the data range defining the existing phenomenon. After the aggregation process is over, the root having the two polynomials, P and FP can be queried for FP (approximating the new event region) instead of flooding the whole network. For multiple such events, instead of computing a polynomial corresponding to each new event, areas with same data range are combined by the corresponding tree nodes and the aggregated coefficients are passed on. Results reveal that a new event can be detected by PERD while error in detection remains constant and is less than a threshold of 10%. As the node density increases, accuracy and delay for event detection are found to remain almost constant, making PERD highly scalable. Whenever an event occurs in a WSN, data is generated by closeby sensors and relaying the data to the base station (BS) make sensors closer to the BS run out of energy at a much faster rate than sensors in other parts of the network. This gives rise to an unequal distribution of residual energy in the network and makes those sensors with lower remaining energy level die at much faster rate than others. We propose a scheme for enhancing network Lifetime using mobile cluster heads (CH) in a WSN. To maintain remaining energy more evenly, some energy-rich nodes are designated as CHs which move in a controlled manner towards sensors rich in energy and data. This eliminates multihop transmission required by the static sensors and thus increases the overall lifetime of the WSN. We combine the idea of clustering and mobile CH to first form clusters of static sensor nodes. A collaborative strategy among the CHs further increases the lifetime of the network. Time taken for transmitting data to the BS is reduced further by making the CHs follow a connectivity strategy that always maintain a connected path to the BS. Spatial correlation of sensor data can be further exploited for dynamic channel selection in Cellular Communication. In such a scenario within a licensed band, wireless sensors can be deployed (each sensor tuned to a frequency of the channel at a particular time) to sense the interference power of the frequency band. In an ideal channel, interference temperature (IT) which is directly proportional to the interference power, can be assumed to vary spatially with the frequency of the sub channel. We propose a scheme for fitting the sub channel frequencies and corresponding ITs to a regression model for calculating the IT of a random sub channel for further analysis of the channel interference at the base station. Our scheme, based on the readings reported by Sensors helps in Dynamic Channel Selection (S-DCS) in extended C-band for assignment to unlicensed secondary users. S-DCS proves to be economic from energy consumption point of view and it also achieves accuracy with error bound within 6.8%. Again, users are assigned empty sub channels without actually probing them, incurring minimum delay in the process. The overall channel throughput is maximized along with fairness to individual users.
Author | : Nitin Afzalpulkar |
Publisher | : Springer |
Total Pages | : 964 |
Release | : 2016-04-28 |
Genre | : Technology & Engineering |
ISBN | : 8132226380 |
This volume comprises the proceedings of the International Conference on Recent Cognizance in Wireless Communication & Image Processing. It brings together content from academicians, researchers, and industry experts in areas of Wireless Communication and Image Processing. The volume provides a snapshot of current progress in computational creativity and a glimpse of future possibilities. The proceedings include two kinds of paper submissions: (i) regular papers addressing foundation issues, describing original research on creative systems development and modeling; and (ii) position papers describing work-in-progress or research directions for computational creativity. This work will be useful to professionals and researchers working in the core areas of wireless communications and image processing.
Author | : Benny Bing |
Publisher | : World Scientific |
Total Pages | : 804 |
Release | : 2002 |
Genre | : Computers |
ISBN | : 9789812776730 |
The joint conference, ICWLHN 2002 and ICN 2002, covers a wide variety of technical sessions covering all aspects of networking technology. It features some of the world''s most dynamic presenters, including leading experts such as Norman Abramson (inventor of the first access protocol OCo the ALOHA protocol) and Daniel Awduche (pioneer of the MPLambdaS concept, now referred to as GMPLS). The proceedings for this joint conference is accessible to engineers, practitioners, scientists, as well as industry professionals from manufacturers to service providers."
Author | : Suraiya Tarannum |
Publisher | : BoD – Books on Demand |
Total Pages | : 352 |
Release | : 2011-06-30 |
Genre | : Technology & Engineering |
ISBN | : 953307325X |
The importance and ubiquity of wireless networks in the modern age justifies the depth and scope of the chapters included in this book, with its special focus on sensors. Topics covered include MAC protocols, with one contribution offering a literature review on them. Energy efficiency is also important, with several chapters addressing cooperative beamforming, modern spatial-diversity techniques and MEMS. Hardware issues are addressed by a batch of chapters, on extending network coverage areas, CMOS RF transceivers, the use of an accelerometer sensor module and a fall-detection monitoring system and a couple of contributions on hierarchical paradigms in wireless sensor networks. More mathematical approaches are also included, with chapters on data aggregation tree construction and distributed localization algorithms.
Author | : Yan Zhang |
Publisher | : CRC Press |
Total Pages | : 552 |
Release | : 2008-08-21 |
Genre | : Computers |
ISBN | : 0849382548 |
Wireless mesh networks (WMN) encompass a new area of technology set to play an important role in the next generation wireless mobile networks. WMN is characterized by dynamic self-organization, self-configuration, and self-healing to enable flexible integration, quick deployment, easy maintenance, low costs, high scalability, and reliable services.
Author | : YoungSang Yun |
Publisher | : |
Total Pages | : |
Release | : 2010 |
Genre | : |
ISBN | : |
ABSTRACT: We study various problems efficient energy management for wireless sensor networks. First, we research the energy efficient deployment of wireless sensor nodes so that energy consumption rates of all nodes are equal during the lifetime of the wireless sensor network. If the sensors are deployed uniformly across the network, they experience different traffic intensities and energy depletion rates depending on their locations. Usually, the sensors near the sink tend to deplete their energy sooner; when enough of them exhaust their energy, they leave holes in the network, causing the remaining nodes to be disconnected from the sink. One of the solutions to this energy-hole problem is to deploy the sensors non-uniformly. Moreover, we describe a method for deciding the sensor deployment densities so as to equalize the energy consumption rates of all nodes. The method is general and can be applied to other objectives and constraints. Second, we propose a framework to maximize the lifetime of the wireless sensor networks by using a mobile sink when the underlying applications tolerate delayed information delivery to the sink. Within a prescribed delay tolerance level, each node does not need to send the data immediately as it becomes available. Instead, the node can store the data temporarily and transmit it when the mobile sink is at the most favorable location for achieving the longest WSN lifetime. We call the proposed framework as Delay-Tolerant Mobile Sink Wireless Sensor Network.
Author | : Kian Lee Tan |
Publisher | : Springer Science & Business Media |
Total Pages | : 940 |
Release | : 2006-04-05 |
Genre | : Computers |
ISBN | : 3540333371 |
This book constitutes the refereed proceedings of the 11th International Conference on Database Systems for Advanced Applications, DASFAA 2006, held in Singapore in April 2006. 46 revised full papers and 16 revised short papers presented were carefully reviewed and selected from 188 submissions. Topics include sensor networks, subsequence matching and repeating patterns, spatial-temporal databases, data mining, XML compression and indexing, xpath query evaluation, uncertainty and streams, peer-to-peer and distributed networks and more.