Conference Paper

Permanent URI for this collectionhttps://hdl.handle.net/10361/7301

Browse

Now showing 1 - 4 of 4

PNGP : a social relationship based routing algorithm for pocket switched network
(© 2016 IEEE, 2016-12) Barua, Rupa; Shadman, Shauvik; Chakrabarty, Amitabha; Department of Computer Science and Engineering
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 to deliver the message. A good delivery rate of such messages in these sort of networks is a challenge which might require complex calculations and several intricate decision making processes. With a view to improve efficiency and to deliver a simpler way of routing, this paper will present a new routing algorithm called Popular Node Gateway Protocol(PNGP). This new algorithm is tested against 3 other algorithms using our own built simulator and proves to be better in terms of delivery ratio delay and transmission cost. Unlike other algorithms this algorithm provides a simpler way of routing thus making this faster and much more efficient.
A new routing algorithm for symmetric rearrangeable networks and emerging applications
(© 2012 IEEE, 2012) Chakrabarty, Amitabha; Collier, Martin J.; Department of Computer Science and Engineering
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 Mining Competition (LMC) 2011. Considering the requirement of NASA and calculating the load, friction and power the mechanical excavator was designed and built. The dimension of the excavator is 1.45m ×.74m × 1.48m and the weight is 80 kg. It consists of two excavation arm and one pulley system depositor bucket. Two conveyer belt type wheels are used to drive the robot. Efficient control and communication is always a big challenge for a Tele-robot. In our developed system hardware can be operated both manually and remotely through a web browser by logging in from any computer without direct visual and auditory access to the hardware. A unique control circuit, graphical user interface and communication module for two terminals are also developed for remote access.
Low complexity routing algorithm for rearrangeable switching networks
(© 2013 IEEE, 2013-03) Chakrabarty, Amitabha; Collier, Martin J.; Department of Computer Science and Engineering
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 reduction etc. In this paper a new routing algorithm is presented for symmetric rearrangeable networks built with 2 × 2 switching element. A new matrix based abstraction model is derived to determine conflict free routing paths for each input-output request. Each stage of a network is mapped into a set of sub-matrices and number of matrices in each stage correspond to number of subnetworks in that stage. Once the input permutation is given, matrix cells are populated with binary values depending on the position of the switching elements in the actual hardware and their mapped matrix cells. These binary values control the routing decision in the underlying hardware. This new routing algorithm is capable of connection setup for partial permutation, m = ρN, where N is the total input numbers and m is the number of active inputs. Overall the serial time complexity of this method is O(NlogN)1 and Ο(mlogN) where all N inputs are active and with m < N active inputs respectively. The time complexity of this routing algorithm in a parallel machine with N completely connected processors is Ο(log2N). With m active requests the time complexity goes down to Ο(logmlogN), which is better than the O(log2m + logN), reported in the literature for 21/2 [(log2N-4logN)1/2-logN] ≤ ρ ≤ 1. Later half of this paper demonstrates how this routing algorithm is applicable for crosstalk free routing in optical domain.
Automatic slice growing method based 3D reconstruction of liver with its vessels
(© 2014 Institute of Electrical and Electronics Engineers Inc., 2014) Alom, Md. Zahangir; Mostakim, Moin; Biswas, Rubel; Chakrabarty, Amitabha; Department of Computer Science and Engineering
In the recent years, reconstructing 3D liver and its vessels from abdominal CT volume images becomes an inevitable and necessary research field. In this paper, a method of 3D reconstruction of liver with its vessels has been implemented, which involves volume preprocessing, de-noising, segmentation, contouring, and combination of different modalities. An advanced liver segmentation algorithms have been proposed: The first one is a 2.5D method that utilizes automatic Slice Growing Method (SGM) to segment liver part of each slice of a data set. It takes advantage of curvature control of level set segmentation method to distinguish liver and adjacent organs. It is proved that the result of this proposed method is much better than simple 3D level set method in liver segmentation. In the case of liver vessel segmentation, we have proposed an improved smoothing method dedicate to 3D vascular volume which results from region growing segmentation method. The cooperation of region growing method and proposed smoothing method has been demonstrated the possibility of efficient vessel segmentation with very accurate results. And the results indicate that our method is suitable for anatomical studying and surgical planning.

Browse

Recent Submissions