An efficient heuristic for placement, scheduling and routing in wireless sensor networks

Ad Hoc Networks

Volumn 8, Issue 6, 2010, Pages 654-667

  Türkoǧullari, Yavuz Boǧaç ^a   Aras, Necati ^a   Kuban Altinel, I ^a   Ersoy, Cem ^a  

^a BOGAZICI UNIVERSITY   (Turkey)

Author keywords

Connected sensor set; Coverage; Heuristic; Integer programming; Sensor networks

Indexed keywords

AUTONOMOUS ELECTRONICS; BUDGET CONSTRAINT; COMPUTATIONAL EXPERIMENT; CONNECTED SENSOR SET; COVERAGE; DATA FLOW; ENERGY CONSUMPTION; EXACT SOLUTION; FINITE PLANNING HORIZON; FLOW CONSERVATION; GATEWAY NODES; HEURISTIC; MINIMUM COST; MIXED INTEGER LINEAR PROGRAMMING; NETWORK LIFETIME; OPTIMAL FLOWS; OPTIMAL SENSOR; PROBLEM INSTANCES; SCHEDULING AND ROUTING; SENSOR SETS; TEST INSTANCES;

DATA FLOW ANALYSIS; DATA PROCESSING; DYNAMIC PROGRAMMING; ENERGY RESOURCES; GATEWAYS (COMPUTER NETWORKS); HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; LINEARIZATION; OPTIMIZATION; SENSOR NETWORKS; TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 77950021659     PISSN: 15708705     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.adhoc.2010.01.005     Document Type: Article

References (45)

1. Akyi{dotless}ldi{dotless}z I.F., Melodia T., and Chowdhury K.R. A survey on wireless multimedia sensor networks. Comput. Netw. 51 4 (2007) 921-960
2. Kuorilehto M., Hannikainen M., and Hamalainen T.D. A survey of application distribution in wireless sensor networks. EURASIP J. Wirel. Commun. Netw. 5 5 (2005) 774-788
3. Oliveira C.A.S., and Pardalos P.M. A survey of combinatorial optimization problems in multicast routing. Comput. Oper. Res. 32 8 (2005) 1953-1981
4. A. Bogdanov, E. Maneva, S. Riesenfeld, Power-aware base station positioning for sensor networks, in: Proc. of the IEEE Computer and Communications Conference, 2004, pp. 575-585.
5. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company
6. Bulusu N., Heidemann J., and Estrin D. GPS-less low-outdoor localization for very small devices. IEEE Pers. Commun. 7 5 (2000) 28-34
7. S.S. Dhillon, K. Chakrabarty, Sensor placement for effective coverage and surveillance in distributed sensor networks, in: Proc. of 2003 IEEE WCNC, pp. 1609-1614.
8. Chakrabarty K., Iyengar S.S., Qi H., and Cho E. Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans. Comput. 51 12 (2002) 1448-1453
9. S. Meguerdichian, M. Potkonjak, Low Power 0/1 Coverage and Scheduling Techniques in Sensor Networks, Technical Report, Computer Science Department, University of California, Los Angeles, 2003.
10. Yang S., Dai F., Cardei M., Wu J., and Patterson F. On connected multiple point coverage in wireless sensor networks. Int. J. Wirel. Inform. Netw. 13 4 (2006) 289-301
11. İ.K. Alti{dotless}nel, N. Aras, E. Güney, C. Ersoy, Effective coverage in sensor networks: binary integer programming formulations and heuristics, in: Proc. of IEEE ICC 2006, pp. 4014-4019.
12. Wang J., and Zhong N. Efficient point coverage in wireless sensor networks. J. Comb. Optim. 11 3 (2006) 291-304
13. Alti{dotless}nel I.K., Aras N., Güney E., and Ersoy C. Binary integer programming formulations and heuristics for differentiated coverage in heterogeneous sensor networks. Comput. Netw. 52 (2008) 2419-2431
14. M. Cardei, J. Wu, Coverage in Wireless Sensor Networks, Technical Report, Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, Fl, 2006.
15. M. Patel, R. Chandrasekaran, S. Venkatesan, Energy efficient sensor, relay and base station placements for coverage, connectivity and routing, in: Proc. of IEEE IPCCC 2005, 581-586.
16. Hou Y.T., Shi Y., Sherali H.D., and Midkiff S.F. On energy provisioning and relay node placement for wireless sensor networks. IEEE Trans. Wirel. Commun. 4 5 (2005) 2579-2590
17. Nakamura F.G., Quintao F.P., Menezes G.C., and Mateus G.R. An optimal node scheduling for flat wireless sensor networks. Lect. Notes Comput. Sci. 3420 (2005) 475-482
18. M. Cardei, M.T. Thai, Y. Li, W. Wu, Energy-efficient target coverage in wireless sensor networks, in: Proc. of IEEE INFOCOM 2005, pp. 1976-1984.
19. Alfieri A., Bianco A., Brandimarte P., and Chiasserini C.F. Maximizing system lifetime in wireless sensor networks. Eur. J. Oper. Res. 181 (2007) 390-402
20. Ha R.W., Ho P., Shen X.S., and Zhang J. Sleep scheduling for wireless sensor networks via network flow model. Comput. Commun. 29 13-14 (2006) 2469-2481
21. Liu H., Wan P., and Jia X. Maximal lifetime scheduling for K to 1 sensor-target surveillance networks. Comput. Netw. 50 15 (2006) 2839-2854
22. Y.B. Türkoǧullari{dotless}, N. Aras,İ.K. Alti{dotless}nel, C. Ersoy, Optimal placement and activity scheduling to maximize coverage lifetime in wireless sensor networks, in: Proc. ISCIS 2007, pp. 1-6.
23. Akkaya K., and Younis M. A survey on routing protocols for wireless sensor networks. Ad Hoc Netw. 3 3 (2005) 325-349
24. M. Younis, M. Youssef, K. Arisha, Energy-aware routing in cluster-based sensor networks, in: Proc. of MASCOTS 2002, pp. 129-136.
25. A. Sankar, Z. Liu, Maximum lifetime routing in wireless ad-hoc networks, in: Proc. of IEEE INFOCOM 2004, pp. 1089-1097.
26. Kim H., Seok Y., Choi N., Choi Y., and Kwon T. Optimal multi-sink positioning and energy-efficient routing in wireless sensor networks. Lect. Notes Comput. Sci. 3391 (2005) 264-274
27. Zhao Q., and Gurusamy M. Connected K-target coverage problem in wireless sensor networks. Comput. Netw. 52 11 (2008) 2205-2220
28. Chang J.-H., and Tassiulas L. Maximum lifetime routing in wireless sensor networks. IEEE Trans. Netw. 12 (2004) 609-619
29. Xue Y., Cui Y., and Nahrstedt K. Maximizing lifetime for data aggregation in wireless sensor networks. Mobile Netw. Appl. 10 6 (2005) 853-864
30. Hua C., and Yum T.P. Maximum lifetime routing and data aggregation for wireless sensor networks. Lect. Notes Comput. Sci. 3976 (2006) 840-855
31. Ergen S.C., and Varaiya P. Energy efficient routing with delay guarantee for sensor networks. Wirel. Netw. 13 5 (2007) 679-690
32. Pham M., Kim D., Kim T., and Yoo S. Maximize the coverage lifetime of sensor networks. Lect. Notes Comput. Sci. 4097 (2006) 475-484
33. Ciciriello P., Mottola L., and Picco G.P. Efficient routing from multiple sources to multiple sinks in wireless sensor networks. Lect. Notes Comput. Sci. 4373 (2007) 35-40
34. Z. Vincze, R. Vida, A. Vidacs, Deploying multiple sinks in multi-hop wireless sensor networks, in: Proc. of IEEE International Conference on Pervasive Services, 2007, pp. 55-63.
35. Basagni S., Carosi A., Melachrinoudis E., Petrioli C., and Wang Z.M. Controlled sink mobility for prolonging wireless sensor networks lifetime. Wirel. Netw. 14 (2008) 831-858
36. Papadimitriou I., and Georgiadis L. Energy-aware routing to maximize lifetime in wireless sensor networks with mobile sink. J. Commun. Softw Syst. 2 (2006) 141-151
37. Gatzianas M., and Georgiadis L. A distributed algorithm for maximum lifetime routing in sensor networks with mobile sink. IEEE Trans. Wirel. Commun. 7 (2008) 984-994
38. A. Efrat, S. Har-Peled, J. Mitchell, Approximation algorithms for location problems in sensor networks, in: Proc. of the IEEE/Creat-Net BROADNETS-Wireless Networking Symposium, 2005, pp. 767-776.
39. Y. Shi, Y.T. Hou, Approximation algorithm for base station placement in wireless sensor networks, in: Proc. of the 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2007, pp. 512-519.
40. Shi Y., Hou Y.T., and Efrat A. Algorithm design for a class of base station location problems in sensor networks. Wirel. Netw. 15 (2009) 21-28
41. Xbow, .
42. Zhang H., and Hou J. Maintaining sensing coverage and connectivity in large sensor networks. Int. J. Wirel. Ad Hoc Sensor Netw. 1 1-2 (2005) 89-124
43. Karmarkar N. A new polynomial-time algorithm for linear programming. Combinatorica 4 4 (1984) 373-395
44. M.G.C. Torres, J. Kabara, Measuring energy consumption in wireless sensor networks using GSP, in: Proc. of Int. Symphosium on Personal, Indoor and Mobile Radio Communications, 2006.
45. ILOG, .