oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
A New Approach to the Data Aggregation in Wireless Sensor Networks
Chamran Asgari,Javad Akbari Torkestani
International Journal of Computer Science Issues , 2012,
Abstract: Several algorithms have been developed for problems of data aggregation in wireless sensor networks, all of which tried to increase networks lifetime. In this paper, we deal with this problem using a more efficient method, and offer a heuristic algorithm based on distributed learning automata to solve data aggregation problems within stochastic graphs. Given that data aggregating through creating backbones and making connected dominating sets (CDS) in networks lowers the ratio of responding hosts to the hosts existing in virtual backbones, we employed this idea to our algorithm, trying to increase networks lifetime considering such parameters as sensors lifetime, remaining and consumption energies in order to have an almost optimal data aggregation within networks. Finally, we assess our algorithm for make CDS lifetime given increased transmission range and increased sensors number.
A Cluster-based and Tree-based Power Efficient Data Collection and Aggregation Protocol for Wireless Sensor Networks  [PDF]
Wei Wang,Bingwen Wang,Zhuo Liu,Lejiang Guo
Information Technology Journal , 2011,
Abstract: In Wireless Sensor Networks (WSNs), since the network consists of low-cost sensor nodes with finite battery power, power efficient strategies must be applied for data transmission in order to prolong the network lifetime. It is important to minimize the total energy consumption in each round so that the network lifetime is maximized. In this study, we have proposed a new energy efficient protocol, named CTPEDCA (Cluster-Based and Tree-Based Power Efficient Data Collection and Aggregation Protocol for WSNs), which using the full distributed in hierarchical WSNs. CTPEDCA is based on clustering and Minimum Spanning Tree (MST) routing strategy for cluster heads. We use the MST to improve the transmission routing mechanism between the cluster heads so that let only one cluster head communicate directly with the faraway base station in each round. The simulation results show that CTPEDCA is better than LEACH; CTPEDCA can more balance the energy consumption of all nodes, particularly as the cluster head nodes in each round and prolong the lifetime of the networks. It is worth to note that our algorithm is very fast, its time complexity is O(ElogV), where V is the set of cluster heads, therefore, the time complexity is small.
Energy Efficient Correlated Data Aggregation for Wireless Sensor Networks  [PDF]
Seung-Jong Park,Raghupathy Sivakumar
International Journal of Distributed Sensor Networks , 2008, DOI: 10.1080/15501320701774592
Abstract: Data aggregations from Sensors to a sink in wireless sensor networks (WSNs) are typically characterized by correlation along the spatial, semantic, and temporal dimensions. Exploiting such correlation when performing data aggregation can result in considerable improvements in the bandwidth and energy performance of WSNs. For the sensors-to-sink data delivery, we first explore two theoretical solutions: the shortest path tree (SPT) and the minimum spanning tree (MST) approaches. To approximate the optimal solution (MST) in case of perfect correlation among data, we propose a new aggregation which combines the minimum dominating set (MDS) with the shortest path tree (SPT) in order to aggregate correlated data. To reduce the redundancy among correlated data and simplify the synchronization among transmission, the proposed aggregation takes two stages: local aggregation among sensors around a node in the MDS and global aggregation among sensors in the MDS. Finally, using discrete event simulations, we show that the proposed aggregation outperforms the SPT and closely approximates the centralized optimal solution, the MST, with less amount of overhead and in a decentralized fashion.
Minimum Spanning Tree on Spatio-Temporal Networks  [PDF]
Viswanath Gunturi,Shashi Shekhar,Arnab Bhattacharya
Computer Science , 2010,
Abstract: Given a spatio-temporal network (ST network) where edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of minimum spanning trees of the ST network, where each tree is associated with a time interval. During this time interval, the total cost of tree is least among all the spanning trees. The TSMST problem aims to identify a collection of distinct minimum spanning trees and their respective time-sub-intervals under the constraint that the edge weight functions are piecewise linear. This is an important problem in ST network application domains such as wireless sensor networks (e.g., energy efficient routing). Computing TSMST is challenging because the ranking of candidate spanning trees is non-stationary over a given time interval. Existing methods such as dynamic graph algorithms and kinetic data structures assume separable edge weight functions. In contrast, we propose novel algorithms to find TSMST for large ST networks by accounting for both separable and non-separable piecewise linear edge weight functions. The algorithms are based on the ordering of edges in edge-order-intervals and intersection points of edge weight functions.
Efficient Implementation of Data Aggregation in WSNs by Mobile Agent Paradigm
N.Sandhya rani,O. Srinivasa Rao,Dr MHM Krishna Prasad
International Journal on Computer Science and Engineering , 2011,
Abstract: In many sensor network applications viz., environmental monitoring, spatial exploration and battlefield surveillance, sensed data is aggregated and transmitted to the sinks for analysis. Thus, innetworkdata aggregation [2] becomes an important technique in wireless sensor networks and has been well studied in recent years. In general, any sensory network suffers with two problems i.e., i) the time latencies of the existing scheduling algorithms are still high, and ii) the other one is that all the existing algorithms are centralized, which are inherently inefficient. Hence, in this paper, we present a distributed scheduling algorithm generating collision-free schedules with latency bound, based on TBID, whichemploys multiple Mobile Agents (MAs) for completing the aggregation task on WSNs. The algorithm not only determines the proper number of MAs for minimizing the total aggregation cost but also constructslow-cost itineraries for each of them. In this paper, we adopt TBID that improves upon NOID by following a more direct approach to the problem of determining low-cost MA itineraries. Specifically,based on an accurate formula for the total energy expended during MA migration, we follow a greedylike approach for distributing SNs in multiple MA itineraries, and algorithm determines a spanning forest of trees in the network, calculates efficient tree traversal orders (itineraries), and eventually,assigns these itineraries to individual MAs.)
Tree Automata  [PDF]
Ferenc Gécseg,Magnus Steinby
Computer Science , 2015,
Abstract: This is a reissue of the book Tree Automata by F. G\'ecseg and M. Steinby originally published in 1984 by Akad\'emiai Kiad\'o, Budapest. Some mistakes have been corrected and a few obscure passages have been clarified. Moreover, some more recent contributions and current lines of research are reviewed in an appendix that also contains several new references.
Building Representative-Based Data Aggregation Tree in Wireless Sensor Networks
Yanfei Zheng,Kefei Chen,Weidong Qiu
Mathematical Problems in Engineering , 2010, DOI: 10.1155/2010/732892
Abstract: Data aggregation is an essential operation to reduce energy consumption in large-scale wireless sensor networks (WSNs). A compromised node may forge an aggregation result and mislead base station into trusting a false reading. Efficient and secure aggregation scheme is critical in WSN applications due to the stringent resource constraints. In this paper, we propose a method to build up the representative-based aggregation tree in the WSNs such that the sensing data are aggregated along the route from the leaf cell to the root of the tree. In the cinema of large-scale and high-density sensor nodes, representative-based aggregation tree can reduce the data transmission overhead greatly by directed aggregation and cell-by-cell communications. It also provides security services including the integrity, freshness, and authentication, via detection mechanism in the cells.
Study on Aggregation Tree Construction Based on Grid  [cached]
Jian Shu,Yebin Chen,Linlan Liu,Sheng Zhang
Journal of Computers , 2010, DOI: 10.4304/jcp.5.6.852-860
Abstract: Data fusion is one of the key techniques in Wireless sensor network (WSN). Data fusion can reduce quantity of data transmission in the network, extend network lifetime by reducing energy consumption, and improve efficiency of bandwidth utilization. At present, researches on data fusion in WSN mainly fall into the following aspects: aggregation tree construction and data processing. This paper proposes an aggregation tree construction method based on grid named ATCBG which makes some improvements over GROUP. The results of simulation experiment show that the average energy consumption of ATCBG is evidently lower than GROUP, and the lifetime of the network is much longer than GROUP before the emergence of node death.
Reconstruction of Aggregation Tree in spite of Faulty Nodes in Wireless Sensor Networks  [PDF]
Punit Sharma,Partha Sarathi Mandal
Computer Science , 2010,
Abstract: Recent advances in wireless sensor networks (WSNs) have led to many new promissing applications. However data communication between nodes consumes a large portion of the total energy of WSNs. Consequently efficient data aggregation technique can help greatly to reduce power consumption. Data aggregation has emerged as a basic approach in WSNs in order to reduce the number of transmissions of sensor nodes over {\it aggregation tree} and hence minimizing the overall power consumption in the network. If a sensor node fails during data aggregation then the aggregation tree is disconnected. Hence the WSNs rely on in-network aggregation for efficiency but a single faulty node can severely influence the outcome by contributing an arbitrary partial aggregate value. In this paper we have presented a distributed algorithm that reconstruct the aggregation tree from the initial aggregation tree excluding the faulty sensor node. This is a synchronous model that is completed in several rounds. Our proposed scheme can handle multiple number of faulty nodes as well.
Minimum Diameter Spanning Tree  [PDF]
V. T. Chandrasekaran, N. Rajasri
American Journal of Computational Mathematics (AJCM) , 2018, DOI: 10.4236/ajcm.2018.83016
Abstract: In this paper, we discuss the simple connected graphs which have a minimum diameter spanning tree such that both have same domination number.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.