Sciweavers

1815 search results - page 262 / 363
» Path Planning for Network Performance
Sort
View
AMCS
2010
146views Mathematics» more  AMCS 2010»
13 years 8 months ago
Sensor network design for the estimation of spatially distributed processes
satisfactory network connectivity have dominated this line of research and abstracted away from the mathematical description of the physical processes underlying the observed pheno...
Dariusz Ucinski, Maciej Patan
CN
2006
166views more  CN 2006»
13 years 8 months ago
GLR: A novel geographic routing scheme for large wireless ad hoc networks
Wireless ad hoc routing has been extensively studied and many clever schemes have been proposed over the last several years. One class of ad hoc routing is geographic routing wher...
Jongkeun Na, Chong-kwon Kim
ADHOC
2005
122views more  ADHOC 2005»
13 years 7 months ago
Bandwidth guaranteed call admission in TDMA/CDMA ad hoc wireless networks
This paper first studied the timeslot assignment problem in time division multiple access/code division multiple access (TDMA/CDMA) wireless ad hoc networks. Given a path P, we pr...
Hai Liu, Xiaohua Jia, Deying Li, Chan-Hee Lee
COMCOM
2007
123views more  COMCOM 2007»
13 years 7 months ago
Heuristic and optimal techniques for light-trail assignment in optical ring WDM networks
In this paper we address the problem of constrained optimization (ILP formulation) and propose a set of heuristic algorithms for assigning light-trails [1–4,7,10] to WDM ring ne...
Ashwin Gumaste, Paparao Palacharla
GLOBECOM
2010
IEEE
13 years 5 months ago
Throughput and Energy Efficiency of Opportunistic Routing with Type-I HARQ in Linear Multihop Networks
Opportunistic routing is a well-known technique that exploits the broadcast nature of wireless transmissions and path diversity to form the route in an adaptive manner based on cur...
Davide Chiarotto, Osvaldo Simeone, Michele Zorzi