— In the standard approach to studying connectivity, a physical layer is assumed that allows direct transmission between neighbors within some fixed distance. The graph resultin...
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
— In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flo...
Umut Akyol, Matthew Andrews, Piyush Gupta, John D....
In this paper, we introduce two protocols - a routing and a broadcasting protocol - for ad-hoc networks which are based on a new paradigm enabled by the broadcast property of the w...
—The terrorist attacks on September 11, 2001 have drawn attention to the use of wireless technology in order to locate survivors of structural collapse. We propose to construct a...