— 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....
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Abstract. We present an industrial project conducted at Ericsson Danmark A/S, Telebit where formal methods in the form of Coloured Petri Nets (CP-nets or CPNs) have been used for t...
Lars Michael Kristensen, Michael Westergaard, Pede...
A mobile ad hoc network (MANET) is a network without any predefined infrastructure in which every node not only enjoys the services from the network, but serves the network as a r...
Mahmood Hasanlou, Ebrahim Fazli, Ali Movaghar, Hos...