Aggregation in sensor networks with a user-provided quality of service goal

He, Zhen; Lee, Byung Suk; Wang, X. Sean

doi:10.1016/j.ins.2008.01.003

Cited by 37 publications

(32 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…WSN lifetime problem include network structure [1], sensor activity scheduling [2,3] data aggregation [4,5,6], data compression [7], and routing protocol [8,9,10].Wireless Sensor Network (WSN) comprises of tiny sensor nodes with very limited initial energy and are deployed in sensing area of particular intersect to fetch necessary environment data and sending it back to end user via base station. One of the major issues in WSN is energy efficient coverage in which any loss of data due to lack of energy or power in sensor node.…”

Section: Related Workmentioning

confidence: 99%

Implementation of an efficient algorithm to enhance connectivity and lifetime in wireless sensor networks

krishnaraju¹,

Siddappa²

2016

IOSR

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Implementation of an efficient algorithm to enhance connectivity and lifetime in wireless sensor networks

krishnaraju¹,

Siddappa²

2016

IOSR

View full text Add to dashboard Cite

“…Dorigo et al [1,[4][5][6][7]12] proposed ACO in 1997, which imitates the behavior of ant colonies as ants search for the shortest path from their nest to the food source. The method was developed to solve the traveling salesman problem (TSP).…”

Section: Ladder Diffusion Ant-colony Optimizationmentioning

confidence: 99%

Survey on Faulty Node Detection and Recovery Algorithm for WSN

Kishor¹

2015

IJRITCC

View full text Add to dashboard Cite

Abstract-In Faulty Node Detection and Recovery Algorithm for WNS critical problems like fault tolerance created. Earlier fault toleran ce mechanism consume significant extra energy to detect and recover from the failure or having additional hardware and software resources. .Lifetime of sensor node is enhanced because of using diffusion algorithm combined with the genetic algorithm. When some node get faulty in network then this algorithm is useful to avoid performance related data transfer. Wireless sensor networks are having tendency to fail of sensor, due to the energy depletion, failure of hardware's, conditions of network environment. We sure that that type of algorithm used then result is replacements of sensor nodes and more reused routing paths. Time for data transfer is depend on active nodes that's why we detect a routing path with faulty node. Power consumption is affect the hierarchy of active nodes that's why data is not transferred surely. In this proposed algorithm reduces the rate of data loss by approximately 98.8%, and reduces the rate of energy consumption by approximately 31.1%.

show abstract

“…The convergecast problem proposed by Chlamtac and Kutten [6] has been studied from the point of view of collision detection [1,11,33], latency (total steps needed to collect the data) [32,12,8], and network lifetime (the time interval until the first node depletes its battery) [10]. For wireless sensor networks, Huang and Zhang [11] proposed a coordinated convergecast protocol to solve the collision problem.…”

Section: Related Workmentioning

confidence: 99%

“…They proposed distributed convergecast scheduling algorithms as well as randomized distributed algorithms for the TDMA problem. He et al [10] presented an aggregation protocol with the objective of maximizing the network lifetime and minimizing the error of sensed data. The authors proposed to periodically modify a filter threshold for each sensor in a way that is optimal, by translating the problem into a mathematical programming formulation with constraints.…”

Section: Related Workmentioning

confidence: 99%