Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...
Javad Kazemitabar, Vahid Tabatabaee, Hamid Jafarkh...
In this paper an improved version of the graded precision localization algorithm GRADELOC, called IGRADELOC is proposed. The performance of GRADELOC is dependent on the regions fo...
— We study the problem of integrated topology control and routing in Free Space Optical (FSO) mesh backbone networks. FSO links are high-bandwidth, low interference links that ca...
Abhishek Kashyap, Kwangil Lee, Mehdi Kalantari, Sa...