Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Abstract— We propose the first practical solution to the longstanding problem of secure wireless routing in the presence of colluding attackers. Our secure routing protocol, Spr...
Jakob Eriksson, Michalis Faloutsos, Srikanth V. Kr...
We consider the problem of automatically generating viewpoint motions for a virtual camera tracking a moving target. Given the target's trajectory, we plan the motion of a ca...
— Network dimensioning for wavelength-routed WDM networks has been extensively studied to maximize connection acceptance rate while minimizing the total cost. However, Internet s...