—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
Abstract— Service placement is a key problem in communication networks as it determines how efficiently the user service demands are supported. This problem has been traditional...
We consider a team of mobile agents where a leader has to monitor battery levels of all other agents. Only the leader is capable to transmit information to other agents. Every now...
—Wireless sensor networks have been used to gather data and information in many diverse application settings. The capacity of such networks remains a fundamental obstacle toward ...
Emad Felemban, Serdar Vural, Robert Murawski, Eyle...
—To efficiently solve challenging motion-planning problems with dynamics, this paper proposes treating motion planning not just as a search problem in a continuous space but as ...