Matches in SemOpenAlex for { <https://semopenalex.org/work/W2109673948> ?p ?o ?g. }
Showing items 1 to 73 of
73
with 100 items per page.
- W2109673948 abstract "Longevity is one the key design goals in the wireless sensor networks. In many applications, longevity of all the sensor nodes in the network is equally important. Therefore, it is imperative to design network protocols that would keep the maximum number of nodes alive for longest possible duration. Towards this goal we study the lexicographic maximum lifetime (Lex-max-life) routing scheme. The objective of Lex-max-life routing is to maximize the time until the lirst set of sensor nodes deplete their battery energies (among all the nodes), then maximize the depletion time for the second set of sensor nodes if the depletion time for the first set of nodes is as long as possible, and then maximize the depletion time for the third set of nodes if the depletion times for the first and second set of nodes are as long as possible and so on. In our previous work by M. Patel et al. (2006), we have shown that if sensor nodes are equipped with non-adaptive transmitters then the Lex-max-life routing problem can be reduced to a min-cost flow or a convex-cost flow problem using a novel cost scaling technique. Hence, we obtain an integral optimal solution in polynomial time. However, the cost scaling technique is not suitable for large problem instances because the cost numbers grow very fast. In this paper, we propose a novel vectorial representation of link costs. The Lex-max-life routing problem is solved by a vectorial version of min-cost flow or convex-cost flow algorithm which (i) Improves running time complexity and (ii) Circumvents the number explosion phenomenon. Thus, developed algorithm is computationally very efficient, scalable and easy to implement." @default.
- W2109673948 created "2016-06-24" @default.
- W2109673948 creator A5002390750 @default.
- W2109673948 creator A5019013203 @default.
- W2109673948 creator A5036983497 @default.
- W2109673948 date "2007-08-01" @default.
- W2109673948 modified "2023-09-25" @default.
- W2109673948 title "A Network-flow based Integral Optimal Algorithm for Lexicographic Maximum Lifetime Routing in Wireless Sensor Networks" @default.
- W2109673948 cites W2040423259 @default.
- W2109673948 cites W2062286747 @default.
- W2109673948 cites W2078625610 @default.
- W2109673948 cites W2108777122 @default.
- W2109673948 cites W2111072230 @default.
- W2109673948 cites W2132895032 @default.
- W2109673948 cites W2135536356 @default.
- W2109673948 cites W2156036190 @default.
- W2109673948 cites W2338905098 @default.
- W2109673948 cites W3123221209 @default.
- W2109673948 doi "https://doi.org/10.1109/icccn.2007.4317924" @default.
- W2109673948 hasPublicationYear "2007" @default.
- W2109673948 type Work @default.
- W2109673948 sameAs 2109673948 @default.
- W2109673948 citedByCount "12" @default.
- W2109673948 countsByYear W21096739482012 @default.
- W2109673948 countsByYear W21096739482013 @default.
- W2109673948 countsByYear W21096739482014 @default.
- W2109673948 crossrefType "proceedings-article" @default.
- W2109673948 hasAuthorship W2109673948A5002390750 @default.
- W2109673948 hasAuthorship W2109673948A5019013203 @default.
- W2109673948 hasAuthorship W2109673948A5036983497 @default.
- W2109673948 hasConcept C11413529 @default.
- W2109673948 hasConcept C114614502 @default.
- W2109673948 hasConcept C126255220 @default.
- W2109673948 hasConcept C159254197 @default.
- W2109673948 hasConcept C177264268 @default.
- W2109673948 hasConcept C184720557 @default.
- W2109673948 hasConcept C199360897 @default.
- W2109673948 hasConcept C24590314 @default.
- W2109673948 hasConcept C311688 @default.
- W2109673948 hasConcept C31258907 @default.
- W2109673948 hasConcept C33923547 @default.
- W2109673948 hasConcept C41008148 @default.
- W2109673948 hasConcept C74172769 @default.
- W2109673948 hasConceptScore W2109673948C11413529 @default.
- W2109673948 hasConceptScore W2109673948C114614502 @default.
- W2109673948 hasConceptScore W2109673948C126255220 @default.
- W2109673948 hasConceptScore W2109673948C159254197 @default.
- W2109673948 hasConceptScore W2109673948C177264268 @default.
- W2109673948 hasConceptScore W2109673948C184720557 @default.
- W2109673948 hasConceptScore W2109673948C199360897 @default.
- W2109673948 hasConceptScore W2109673948C24590314 @default.
- W2109673948 hasConceptScore W2109673948C311688 @default.
- W2109673948 hasConceptScore W2109673948C31258907 @default.
- W2109673948 hasConceptScore W2109673948C33923547 @default.
- W2109673948 hasConceptScore W2109673948C41008148 @default.
- W2109673948 hasConceptScore W2109673948C74172769 @default.
- W2109673948 hasLocation W21096739481 @default.
- W2109673948 hasOpenAccess W2109673948 @default.
- W2109673948 hasPrimaryLocation W21096739481 @default.
- W2109673948 hasRelatedWork W1988401512 @default.
- W2109673948 hasRelatedWork W2081336949 @default.
- W2109673948 hasRelatedWork W2094796996 @default.
- W2109673948 hasRelatedWork W2103735432 @default.
- W2109673948 hasRelatedWork W2130966263 @default.
- W2109673948 hasRelatedWork W2157920827 @default.
- W2109673948 hasRelatedWork W2176893360 @default.
- W2109673948 hasRelatedWork W2378314110 @default.
- W2109673948 hasRelatedWork W3046929440 @default.
- W2109673948 hasRelatedWork W2735735604 @default.
- W2109673948 isParatext "false" @default.
- W2109673948 isRetracted "false" @default.
- W2109673948 magId "2109673948" @default.
- W2109673948 workType "article" @default.