Fast Approximation Algorithm for Maximum Lifetime Aggregation Trees in Wireless Sensor Networks

References

• Alfieri A, Bianco A, Brandimarte P, Chiasserini C-F (2007) Maximizing system lifetime in wireless sensor networks. Eur. J. Oper. Res. 181(1):390–402.Crossref, Google Scholar
• Basagni S, Carosi A, Petrioli C (2009) Heuristics for lifetime maximization in wireless sensor networks with multiple mobile sinks. Proc. ICC’09 (IEEE, New York), 1–6.Crossref, Google Scholar
• Buragohain C, Agrawal D, Suri S (2005) Power aware routing for sensor databases. Proc. INFOCOM’05 (IEEE, New York),1747–1757.Crossref, Google Scholar
• Challen GW, Waterman J, Welsh M (2010) Idea: Integrated distributed energy awareness for wireless sensor networks. Proc. MobiSys’10 (ACM, New York), 35–48.Crossref, Google Scholar
• Cormen TH, Stein C, Rivest RL, Leiserson CE (2001) Introduction to Algorithms, 2nd ed. (McGraw-Hill Higher Education, Columbus, OH).Google Scholar
• Dyo V, Ellwood SA, Macdonald DW, Markham A, Trigoni N, Wohlers R, Mascolo C, Pásztor B, Scellato S, Yousef K (2012) Wildsensing: Design and deployment of a sustainable sensor network for wildlife monitoring. ACM Trans. Sensor Networks 8(4):Article no. 29.Crossref, Google Scholar
• Fasolo E, Rossi M, Widmer J, Zorzi M (2007) In-network aggregation techniques for wireless sensor networks: A survey. IEEE Wireless Comm. 14(2):70–87.Crossref, Google Scholar
• Fürer M, Raghavachari B (1994) Approximating the minimum-degree steiner tree to within one of optimal. J. Algorithms 17(3):409–423.Crossref, Google Scholar
• GreenOrbs (2014) Accessed December 1, 2014, http://www.greenorbs.org.Google Scholar
• Heinzelman WB, Chandrakasan AP, Balakrishnan H (2002) An application-specific protocol architecture for wireless microsensor networks. IEEE Trans. Wireless Comm. 1(4):660–670.Crossref, Google Scholar
• Jia L, Noubir G, Rajaraman R, Sundaram R (2006) Gist: Group-independent spanning tree for data aggregation in dense sensor networks. Proc. DCOSS’06 (Springer, Berlin), 282–304.Crossref, Google Scholar
• Kuo T-W, Tsai M-J (2012) On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approximation algorithms. Proc. INFOCOM’12 (IEEE, New York), 2591–2595.Crossref, Google Scholar
• Lee WM, Wong VWS (2006) E-span and lpt for data aggregation in wireless sensor networks. Comput. Comm. 29(13–14):2506–2520.Crossref, Google Scholar
• Li Y, Qi X, Keally M, Ren Z, Zhou G, Xiao D, Deng S (2013) Communication energy modeling and optimization through joint packet size analysis of bsn and wifi networks. IEEE Trans. Parallel Distributed Systems 24(9):1741–1751.Crossref, Google Scholar
• Liang J, Wang J, Cao J, Chen J, Lu M (2010) An efficient algorithm for constructing maximum lifetime tree for data gathering without aggregation in wireless sensor networks. Proc. INFOCOM’10 (IEEE, New York), 1–5.Crossref, Google Scholar
• Liu C, Cao G (2010) Distributed monitoring and aggregation in wireless sensor networks. Proc. INFOCOM’10 (IEEE, New York), 1–9.Crossref, Google Scholar
• Luo D, Zhu X, Wu X, Chen G (2011) Maximizing lifetime for the shortest path aggregation tree in wireless sensor networks. Proc. INFOCOM’11 (IEEE, New York), 1566–1574.Crossref, Google Scholar
• Noyes J, Weisstein EW (2014) Linear programming. Accessed January 1, 2015, http://mathworld.wolfram.com/LinearProgramming.html.Google Scholar
• Peng Y, Li Z, Qiao D, Zhang W (2013) I2c: A holistic approach to prolong the sensor network lifetime. Proc. INFOCOM’13 (IEEE, New York), 2670–2678.Google Scholar
• Qi X, Keally M, Zhou G, Li Y, Ren Z (2013) AdaSense: Adapting sampling rates for activity recognition in body sensor networks. Proc. RTAS’13 (IEEE, New York), 163–172.Google Scholar
• Raghavachari B (2013) Personal communication via email, November 19.Google Scholar
• Santi P (2010) On the data gathering capacity and latency in wireless sensor networks. IEEE J. Selected Areas in Comm. 28(7):1211–1221.Crossref, Google Scholar
• Shan M, Chen G, Luo D, Zhu X, Wu X (2014) Building optimal shortest path data aggregation trees in wireless sensor networks. ACM Trans. Sensor Networks 11(1):Article no. 11.Crossref, Google Scholar
• Singh M, Lau LC (2007) Approximating minimum bounded degree spanning trees to within one of optimal. Proc. STOC’07 (ACM, New York), 661–670.Crossref, Google Scholar
• Tan HO, Korpeoğlu I, Stojmenović I (2011) Computing localized power-efficient data aggregation trees for sensor networks. IEEE Trans. Parallel Distributed Systems 22(3):489–500.Crossref, Google Scholar
• Tarjan RE, Van Leeuwen J (1984) Worst-case analysis of set union algorithms. J. ACM 31(2):245–281.Crossref, Google Scholar
• Wu X, Chen G, Das SK (2008) Avoiding energy holes in wireless sensor networks with nonuniform node distribution. IEEE Trans. Parallel Distributed Systems 19(5):710–720.Crossref, Google Scholar
• Wu Y, Mao Z, Fahmy S, Shroff NB (2010) Constructing maximum-lifetime data-gathering forests in sensor networks. IEEE/ACM Trans. Networking 18(5):1571–1584.Crossref, Google Scholar
• Xiang L, Luo J, Rosenberg C (2013) Compressed data aggregation: Energy efficient and high fidelity data collection. IEEE/ACM Trans. Networking 21(6):1722–1735.Crossref, Google Scholar
• Zhu X, Wu X, Chen G (2015) An exact algorithm for maximum lifetime data gathering tree without aggregation in wireless sensor networks. Wireless Networks 21(1):281–295.Crossref, Google Scholar