FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W609529146> ?p ?o ?g. }

• W609529146 abstract "With the fast development of wireless sensor network (WSN) technologies, WSNs have widely shifted from a specialized platform for a single application to an integrated infrastructure supporting multiple applications. It is hence a critical problem to allocate multiple applications to multiple sensors in order to maximize user utility subject to various resource constraints. The resulting constrained optimization problem is difficult since it is discrete, nonlinear, and not in closed-form. In this report, we develop an efficient optimization algorithm with rigorous approximation bounds for submodular monotonic optimization with multiple knapsack constraints. Based on a variance reduction formulation, we prove several important theoretical properties, including the monotonicity and submodularity of functions and the multiple knapsack structure of constraints. Then, by exploiting these properties, we propose a local search algorithm with fractional relaxation of constraints and prove the approximation bound that is better than any known results. Experimentally, we verify the theoretical properties on a large dataset from the Intel Berkeley Lab. Comparison against other constrained search algorithms show that our algorithm is superior in both solution time and quality, making it a practical choice for WSN design. Type of Report: Other Department of Computer Science & Engineering Washington University in St. Louis Campus Box 1045 St. Louis, MO 63130 ph: (314) 935-6160 Optimizing Quality of Sensing in Shared Sensor Networks with Resource Constraints You Xu, Abusayeed Saifullah, Yixin Chen, Sangeeta Bhattacharya, and Chenyang Lu Department of Computer Science and Engineering Washington University in St. Louis Abstract. With the fast development of wireless sensor network (WSN) technologies, WSNs have widely shifted from a specialized platform for a single application to an integrated infrastructure supporting multiple applications. It is hence a critical problem to allocate multiple applications to multiple sensors in order to maximize user utility subject to various resource constraints. The resulting constrained optimization problem is difficult since it is discrete, nonlinear, and not in closed-form. In this paper, we develop an efficient optimization algorithm with rigorWith the fast development of wireless sensor network (WSN) technologies, WSNs have widely shifted from a specialized platform for a single application to an integrated infrastructure supporting multiple applications. It is hence a critical problem to allocate multiple applications to multiple sensors in order to maximize user utility subject to various resource constraints. The resulting constrained optimization problem is difficult since it is discrete, nonlinear, and not in closed-form. In this paper, we develop an efficient optimization algorithm with rigorous approximation bounds for submodular monotonic optimization with multiple knapsack constraints. Based on a variance reduction formulation, we prove several important theoretical properties, including the monotonicity and submodularity of functions and the multiple knapsack structure of constraints. Then, by exploiting these properties, we propose a local search algorithm with fractional relaxation of constraints and prove the approximation bound that is better than any known results. Experimentally, we verify the theoretical properties on a large dataset from the Intel Berkeley Lab. Comparison against other constrained search algorithms show that our algorithm is superior in both solution time and quality, making it a practical choice for WSN design." @default.
• W609529146 created "2016-06-24" @default.
• W609529146 creator A5021424158 @default.
• W609529146 creator A5034805517 @default.
• W609529146 creator A5036126864 @default.
• W609529146 creator A5047318884 @default.
• W609529146 creator A5057138482 @default.
• W609529146 date "2009-01-01" @default.
• W609529146 modified "2023-09-23" @default.
• W609529146 title "Submodular utility optimization in sensor networks for capacity constraints" @default.
• W609529146 cites W1680189815 @default.
• W609529146 cites W2011193572 @default.
• W609529146 cites W2026338082 @default.
• W609529146 cites W2033885045 @default.
• W609529146 cites W2122410182 @default.
• W609529146 cites W2131824593 @default.
• W609529146 cites W2143996311 @default.
• W609529146 cites W2157104853 @default.
• W609529146 cites W2159416808 @default.
• W609529146 cites W3118655244 @default.
• W609529146 doi "https://doi.org/10.7936/k7154f96" @default.
• W609529146 hasPublicationYear "2009" @default.
• W609529146 type Work @default.
• W609529146 sameAs 609529146 @default.
• W609529146 citedByCount "0" @default.
• W609529146 crossrefType "journal-article" @default.
• W609529146 hasAuthorship W609529146A5021424158 @default.
• W609529146 hasAuthorship W609529146A5034805517 @default.
• W609529146 hasAuthorship W609529146A5036126864 @default.
• W609529146 hasAuthorship W609529146A5047318884 @default.
• W609529146 hasAuthorship W609529146A5057138482 @default.
• W609529146 hasConcept C113138325 @default.
• W609529146 hasConcept C11413529 @default.
• W609529146 hasConcept C126255220 @default.
• W609529146 hasConcept C137836250 @default.
• W609529146 hasConcept C148764684 @default.
• W609529146 hasConcept C15744967 @default.
• W609529146 hasConcept C178621042 @default.
• W609529146 hasConcept C24590314 @default.
• W609529146 hasConcept C2776029896 @default.
• W609529146 hasConcept C31258907 @default.
• W609529146 hasConcept C33923547 @default.
• W609529146 hasConcept C41008148 @default.
• W609529146 hasConcept C77805123 @default.
• W609529146 hasConceptScore W609529146C113138325 @default.
• W609529146 hasConceptScore W609529146C11413529 @default.
• W609529146 hasConceptScore W609529146C126255220 @default.
• W609529146 hasConceptScore W609529146C137836250 @default.
• W609529146 hasConceptScore W609529146C148764684 @default.
• W609529146 hasConceptScore W609529146C15744967 @default.
• W609529146 hasConceptScore W609529146C178621042 @default.
• W609529146 hasConceptScore W609529146C24590314 @default.
• W609529146 hasConceptScore W609529146C2776029896 @default.
• W609529146 hasConceptScore W609529146C31258907 @default.
• W609529146 hasConceptScore W609529146C33923547 @default.
• W609529146 hasConceptScore W609529146C41008148 @default.
• W609529146 hasConceptScore W609529146C77805123 @default.
• W609529146 hasLocation W6095291461 @default.
• W609529146 hasOpenAccess W609529146 @default.
• W609529146 hasPrimaryLocation W6095291461 @default.
• W609529146 hasRelatedWork W1535156767 @default.
• W609529146 hasRelatedWork W1575713165 @default.
• W609529146 hasRelatedWork W1723186713 @default.
• W609529146 hasRelatedWork W1977498105 @default.
• W609529146 hasRelatedWork W1997199334 @default.
• W609529146 hasRelatedWork W2022028215 @default.
• W609529146 hasRelatedWork W2052457058 @default.
• W609529146 hasRelatedWork W2075685401 @default.
• W609529146 hasRelatedWork W2102593277 @default.
• W609529146 hasRelatedWork W2115056380 @default.
• W609529146 hasRelatedWork W2140234885 @default.
• W609529146 hasRelatedWork W2285624957 @default.
• W609529146 hasRelatedWork W2747172586 @default.
• W609529146 hasRelatedWork W2810942778 @default.
• W609529146 hasRelatedWork W2919501976 @default.
• W609529146 hasRelatedWork W2949723220 @default.
• W609529146 hasRelatedWork W2963935045 @default.
• W609529146 hasRelatedWork W3011193967 @default.
• W609529146 hasRelatedWork W3082472256 @default.
• W609529146 hasRelatedWork W2426786974 @default.
• W609529146 isParatext "false" @default.
• W609529146 isRetracted "false" @default.
• W609529146 magId "609529146" @default.
• W609529146 workType "article" @default.