Browsing Conference Paper by Title
Now showing items 2-4 of 4
-
Low complexity routing algorithm for rearrangeable switching networks
(© 2013 IEEE, 2013-03)For a long time among the research community. Routing algorithms for this class of networks have attracted lots of researchers along with other related areas, such as modification of the networks structure, crosspoints ... -
A new routing algorithm for symmetric rearrangeable networks and emerging applications
(© 2012 IEEE, 2012)An excavation tele-robotic system is developed to excavate and collect lunar regolith. The excavator has been developed by the team BRACU ChondroBot consisting students from BRAC University for NASA's 2nd Annual Lunabotics ... -
PNGP : a social relationship based routing algorithm for pocket switched network
(© 2016 IEEE, 2016-12)Transferring messages or packets through a network using human mobility as a means, requires intelligent routing decisions. Throughout an opportunistic network, nodes travel with a few messages and searches for an opportunity ...