MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS

By Konstantinos Kalpakis, Koustuv Dasgupta, Parag Namjoshi. 2002

405 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/6827cfac328cd9c4b9793eb091bcd616207dc294

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Mohamed F. Younis
2. Kemal Akkaya
3. Li-Minn Ang
4. Adamu Murtala Zungeru
5. Kah Phooi Seng
6. Sagar Naik
7. Jie Lian
8. Gordon B. Agnew

Citations in the corpus

• A survey on routing protocols for wireless sensor networks (2005, background): “Kalpakis et al. [46] models the data routes setup in sensor networks as the maximum lifetime data-gathering problem and presents a polynomial time algorithm.”
• Analytical modeling and mitigation techniques for the energy hole problem in sensor networks (2007, methodology): “done on data compression and aggregation in sensor networks (e.g., [8], [ 9 ]).”
• Power efficient data gathering and aggregation in wireless sensor networks (2003, background): “There are also different protocols proposed in the literature ([8], [9], [10]) to maximize the lifetime of the system under different circumstances.”
• Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks (2003, methodology): “4The mlda algorithm appears as an extended abstract in [12] 7”
• Data Capacity Improvement of Wireless Sensor Networks Using Non-Uniform Sensor Distribution (2006, methodology): “Unlike a mobile ad hoc network (MANET) where bandwidth efficiency and throughput are two important metrics, energy conservation is an important design consideration for WSNETs since sensors are constrained by battery power.”
• An efficient clustering-based heuristic for data gathering and aggregation in sensor networks (2003, methodology): “Kalpakis, Dasgupta and Namjoshi describe a polynomial–time approximation algorithm for data gathering and aggregation problem in [8].”
• A minimum cost heterogeneous sensor network with a lifetime constraint (2005, methodology): “We now describe the various models that we use in our analysis, and we then formulate the design problem.”
• Classical and swarm intelligence based routing protocols for wireless sensor networks: A survey and comparison (2012, background): “Such behavior is important when the sink node is able to move, since pheromone adaptation will be much quicker (Kalpakis et al., 2002).”