Optimizing performance of ad-hoc networks under energy and scheduling constraints

WiOpt 2010 - 8th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks

Volumn , Issue , 2010, Pages 11-20

  Levin, Liron ^a   Segal, Michael ^a   Shpungin, Hanan ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COST; CONGESTED NODES; DATA GATHERING; DATA GATHERING TREES; ENERGY EFFICIENT; ENERGY MODEL; GATHERING PROBLEM; INAPPROXIMATION BOUNDS; LIMITED CAPACITY; MAKESPAN; NETWORK SURVIVABILITY; OPTIMIZING PERFORMANCE; POWER EFFICIENT; SCHEDULING CONSTRAINTS; SCHEDULING MODELS;

APPROXIMATION ALGORITHMS; OPTIMIZATION; SCHEDULING ALGORITHMS; TREES (MATHEMATICS); WIRELESS AD HOC NETWORKS;

AD HOC NETWORKS;

EID: 77955887280     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. A. Mainwaring, D. Culler, J. Polastre, R. Szewczyk, and J. Anderson, "Wireless sensor networks for habitat monitoring," in WSNA '02: Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications. ACM, 2002, pp. 88-97.
2. A. Chehri, P. Fortier, and P.-M. Tardif, "Security monitoring using wireless sensor networks," in CNSR 2007. IEEE Computer Society, 2007, pp. 13-17.
3. K. Chintalapudi, T. Fu, J. Paek, N. Kothari, S. Rangwala, J. Caffrey, R. Govindan, E. Johnson, and S. Masri, "Monitoring civil structures with a wireless sensor network," IEEE Internet Computing, vol. 10, no. 2, pp. 26-34, 2006.
4. J. Gehrke and S. Madden, "Query processing in sensor networks," IEEE Pervasive Computing, vol. 3, no. 1, pp. 46-55, 2004.
5. Y. Wu, S. Fahmy, and N. B. Shroff, "On the construction of a maximum-lifetime data gathering tree in sensor networks: Np-completeness and approximation algorithm." in INFOCOM 2008, The 27th Conference On Computer Communication. IEEE, 2008, pp. 356-360.
6. A. Woo, T. Tong, and D. Culler, "Taming the underlying challenges of reliable multihop routing in sensor networks," in SenSys '03: Proceedings of the 1st international conference on Embedded networked sensor systems. ACM, 2003, pp. 14-27.
7. T. Chen, H. Tsai, and C. Chu, "Gathering-load-balanced tree protocol for wireless sensor networks," in SUTC '06. IEEE Computer Society, 2006, pp. 8-13.
8. K. Kalpakis, K. Dasgupta, and P. Namjoshi, "Maximum lifetime data gathering and aggregation in wireless sensor networks," in ICN'02, 2002, pp. 685-696.
9. C. Buragohain, D. Agrawal, and S. Suri, "Power aware routing for sensor databases," in INFOCOM 2005. IEEE, 2005, pp. 1747-1757.
10. W. Liang and Y. Liu, "Online data gathering for maximizing network lifetime in sensor networks," IEEE Transactions on Mobile Computing, vol. 6, no. 1, pp. 2-11, 2007.
11. K. Pahlavan and A. H. Levesque, "Wireless information networks," 1995.
12. Z. A. Eu, H. P. Tan, and W. K. Seah, "Routing and relay node placement in wireless sensor networks powered by ambient energy harvesting," accepted for publication in IEEE WCNC, April 2009.
13. R. Hui and Han., "A node-centric load balancing algorithm for," in Proceedings of the IEEE Global Communications Conference, vol. 1, 2003, pp. 548-552.
14. Hung-yu Wei and R. D. Gitlin, "Two-hop-relay architecture for next generation wwan/wlan integration," IEEE Wireless Communications (Special Issue on 4G Mobile Communications - Towards Open Wireless Architecture),, vol. 11, pp. 24-30, April 2004.
15. K. Sundaresan and S. Rangarajan, "On exploiting diversity and spatial reuse in relay-enabled wireless networks," in MobiHoc '08. ACM, 2008, pp. 13-22.
16. M. Gairing, B. Monien, and A. Woclaw, "A faster combinatorial approximation algorithm for scheduling unrelated parallel machines," Theor. Comput. Sci., vol. 380, no. 1-2, pp. 87-99, 2007.
17. J. K. Lenstra, D. B. Shmoys, and É. Tardos, "Approximation algorithms for scheduling unrelated parallel machines," Math. Program., vol. 46, no. 3, pp. 259-271, 1990.
18. N. Bansal and M. Sviridenko, "The santa claus problem," in STOC '06. ACM, 2006, pp. 31-40.
19. I. Bezáková and V. Dani, "Allocating indivisible goods," SIGe-com Exch., vol. 5, no. 3, pp. 11-18, 2005.
20. J. Chen, R. D. Kleinberg, L. Lovasz, R. Rajaraman, R. Sundaram, and A. Vetta, "(almost) tight bounds and existence theorems for confluent flows," Theor. Comput. Sci., 2004.
21. P. M. Camerini, G. Galbiati, and F. Maffioli, "The complexity of weighted multi-constrained spanning tree," in Proc. Colloq. On Theory of Alg., 1984, pp. 53-101.
22. J. Pan, Y. T. Hou, L. Cai, Y. Shi, and S. X. Shen, "Topology control for wireless sensor networks," in MobiCom '03. ACM, 2003, pp. 286-299.
23. X. Wang, Q. Zhang, W. Sun, W. Wang, and B. Shi, "A coverage-based maximum lifetime data gathering algorithm in sensor networks," in MDM '06. IEEE Computer Society, 2006, p. 33.
24. V. King, S. Rao, and R. Tarjan, "A faster deterministic maximum flow algorithm," in SODA '92. Society for Industrial and Applied Mathematics, 1992, pp. 157-164.
25. J. A. Storer, An Introduction to Data Structures and Algorithms. Birkhauser Boston, 2001, p. 316.
26. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis, "Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems," J. Comput. Syst. Sci., vol. 67, no. 3, pp. 473-496, 2003.
27. Fortune, S. Hopcroft, J. E., Wyllie, and J. C., "The directed subgraph homeomorphism problem," Theoret. Comput. Sci., vol. 10, pp. 111-121, 1980.
28. M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1990.
29. S. Panichpapiboon, G. Ferrari, and O. K. Tonguz, "Sensor network with random versus uniform topology : Mac and interference," in International Confrence on Communication Software and Networks. IEEE Computer Society, 2009, pp. 604-606.
30. H. Shpungin and M. Segal, "Near optimal multicriteria spanner constructions in wireless ad-hoc networks," in INFOCOM 2009. IEEE, 2009, pp. 163-171.