Distributed backtracking algorithm based on tree decomposition over wireless sensor networks

Concurrency and Computation: Practice and Experience

Volumn 25, Issue 5, 2013, Pages 728-742

  Fouchal, Hacène ^a   Habbas, Zineb ^b  

^a UNIVERSITÉ DE REIMS CHAMPAGNE ARDENNE   (France)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

constraint satisfaction problem (CSP); distributed backtracking; medical care; nonbinary CSP; sensor networks; tree decomposition of CSP

Indexed keywords

DISTRIBUTED DATABASE SYSTEMS; FORESTRY; HEALTH CARE; MULTI AGENT SYSTEMS; SENSOR NETWORKS; SOFTWARE AGENTS; TREES (MATHEMATICS); WIRELESS SENSOR NETWORKS;

BACKTRACKING ALGORITHM; COMMUNICATION BETWEEN AGENTS; DISTRIBUTED BACKTRACKING; METHODOLOGICAL APPROACH; NON-BINARY; NON-BINARY CONSTRAINTS; TREE DECOMPOSITION; WIRELESS SENSOR NETWORK (WSNS);

CONSTRAINT SATISFACTION PROBLEMS;

ALGORITHMS; NETWORKS; PROBLEM SOLVING;

EID: 84875226332     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1804     Document Type: Article

References (35)

1. Yokoo M, Durfee EH, Ishida T, Kuwabara K,. The distributed constraint satisfaction problem: formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering 1998; 10 (5): 673-685. (Pubitemid 128751995)
2. Béjar R, Domshlak C, Fernandez C, Gomes C, Krishnamachari B, Selman B, Valls M,. Sensor networks and distributed CSP: communication, computation and complexity. Journal of Artificial Intelligence 2005; 16: 117-147.
3. Hamadi Y, Bessière C, Quinqueton J,. Backtracking in distributed constraint networks. In Proceedings of the 13th European Conference on Artificial Intelligence ECAI '98), 1998; 219-223.
4. Abassi A, Younis M,. A survey on clustering algorithms for wireless sensor networks. Computers Communications 2007; 30: 2826-2841. (Pubitemid 47445736)
5. Basharu M, Arana I, Ahriz H,. Solving coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd. In Intelligent Agent Technology, 2007. IAT '07. IEEE/WIC/ACM International Conference on, Fremont, CA, 2007; 335-341. (Pubitemid 351715116)
6. Yahya B, Ben-Othman J,. Towards a classication of energy-aware MAC protocols for wireless sensor networks. Wireless Communications and Mobile Computing (WCMC) Feb 2009; 12 (3): 1572-1607.
7. Ben-Othman J, Yahya B,. Energy efficient and QoS based routing protocol for wireless sensor networks. Journal of Parallel and Distributed Computing (JPDC) Aug 2010; 70 (8): 849-857.
8. Akkaya K, Younis M,. A survey on routing protocols for wireless sensor networks. Ad Hoc Networks 2005; 3 (5): 325-349. Available from: http://www.sciencedirect.com/science/article/B7576-4B3JKH2-3/2/0baf704778ae8cf6 e3651eb9f329e4c0. (Pubitemid 40266054)
9. Gao J, Guibas L, Milosavljevic N, Hershberger J,. Sparse data aggregation in sensor networks. IPSN '07: Proceedings of the 6th international conference on Information processing in sensor networks, 2007; 430-439. (Pubitemid 47582173)
10. Phani Kumar AVU, Reddy VAM, Janakiram D,. Distributed collaboration for event detection in wireless sensor networks. MPAC '05: Proceedings of the 3rd international workshop on Middleware for pervasive and ad-hoc computing, 2005; 1-8.
11. Janakiram D, Venkateswarlu SNR,. Comis: Component oriented middleware for sensor networks. 14th IEEE Workshop on Local Area and Metropolitan Networks (LANMAN) Chania, Crete, Greece September, 2005.
12. Yang Y, Cardei M,. Sensor deployment for composite event detection in mobile wsns. WASA '08: Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications, 2008; 249-260.
13. Dziengel N, Wittenburg G aJS,. Towards distributed event detection in wireless sensor networks. In Proceedings DCOSS '08, June 2008.
14. Tinydb. Available at http://telegraph.cs.berkeley.edu/tinydb/.
15. Networks IS, Abadi DJ, Madden S, Lindner W,. Reed: Robust, efficient filtering and event detection, In VLDB, 2005; 769-780.
16. Herbold A, Lamarre T, Bulusu N, Jha S,. Resilient event detection in wireless sensor networks. In Proceedings of IEEE Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP 2004), December 2004.
17. Tavakoli A, Zhang J, Son SH,. Group-based event detection in underwater sensor networks. INSS '05, San Diego, California, 2005.
18. Shnayder V, Chen BR, Lorincz K, Fulford-Jones TRF, Welsh M,. Sensor networks for medical care. 2005; 314-314. doi: 10.1145/1098918.1098979 URL http://portal.acm.org/citation.cfm?id=1098918.1098979.
19. Al-Omari S, Shi W,. Toward highly-available wsns for assisted living. HealthNet '07: Proceedings of the 1st ACM SIGMOBILE international workshop on Systems and networking support for healthcare and assisted living environments, ACM Press, New York, NY, USA, 2007; 31-36. doi: http://doi.acm.org/10.1145/ 1248054.1248063. (Pubitemid 350003845)
20. Wood A, et al,. Alarm-net: Wireless sensor networks for assisted-living and residential monitoring. Technical Report, University of Virginia, 2006.
21. B MJV. Implementation of security policy for clinical information systems over wireless sensor networks. Ad Hoc Networks January 2007; 5 (1): 134-144. URL http://www.sciencedirect.com/science/article/B7576-4K7X875-2/2/ ad52d7bb64a3626589594f3573ba62aa.
22. Malasri K, Wang L,. Addressing security in medical sensor networks. HealthNet '07: Proceedings of the 1st ACM SIGMOBILE international workshop on Systems and networking support for healthcare and assisted living environments ACM Press: New York, NY, USA, 2007; 7-12. doi: http://doi.acm.org/10.1145/ 1248054.1248058. (Pubitemid 350003842)
23. Montanari U,. Networks of constraints: Fundamental properties and applications to pictures processing. Information Sciences 1974; 7: 95-132.
24. Jégou P, Terrioux C,. Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence, 2003; 146: 43-75.
25. Freuder EC,. A sufficient condition for backtrack-free search. Journal of the Association for Computing Machinery 1982; 29: 24-32.
26. Dechter R, Pearl J,. Tree clustering for constraint networks. Artificial Intelligence 1989; 38: 353-366.
27. Jeavons PG, A CD, Gyssens M,. A structural decomposition for hypergraphs. Contemporary Mathematics 1994; 178: 161-177.
28. Gyssens M, Jeavons PG, Cohen DA,. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence 1994; 66: 57-89.
29. Gottlob G, Leone N, Scarcello F,. A comparison of structural csp decomposition methods. Artificial Intelligence 2000; 124: 243-282. (Pubitemid 32029459)
30. Gottlob G, Crohe M, Musliu N,. Hypertree decomposition: structure, algorithms and applications. Proceedings of the 31st International workshop WG, Metz, 2005.
31. Gottlob G, Leone N, Scarcello F,. Hypertree decompositions: A survey. Proceedings of MFCS '01, 2001; 37-57. (Pubitemid 33322399)
32. Tarjan R MY,. Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs. SIAM 1984; 13 (3).
33. Freuder EC,. A sufficient condition for backtrack-bounded search. Journal of the Association for Computing Machinery 1985; 32: 755-761.
34. Grohe M, Marx D,. Constraint solving via fractional edge covers. ACM 2006; C-30 (2): 101-106.
35. Miklos Z,. Understanding tractable decompositions for constraint satisfaction. PhD Thesis, University of Oxford, 2008.