Browsing by Subject "Routing algorithms"

Filter results by typing the first few letters
Now showing 1 - 4 of 4
  • Thumbnail Image
    ItemOpen Access
    Adaptive routing framework for network on chip architectures
    (ACM, 2016-01) Mustafa, Naveed Ul; Öztürk, Özcan; Niar, S.
    In this paper we suggest and demonstrate the idea of applying multiple routing algorithms during the execution of a real application mapped on a Network-on-Chip (NoC). Traffic pattern of a real application may change during its execution. As performance of an algorithm depends on the traffic pattern, using the same routing algorithm for the entire span of execution may be inefficient. We study the feasibility of this idea for applications such as SPARSE and MPEG-4 decoder, by applying different routing algorithms. By applying more than one routing algorithms, throughput improves up to 17.37% and 6.74% in the case of SPARSE and MPEG-4 decoder applications, respectively, as compared to the application of single routing algorithm. © 2016 ACM.
  • Thumbnail Image
    ItemOpen Access
    A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations
    (Elsevier Ltd, 2017) Ozbaygin G.; Ekin Karasan O.; Savelsbergh M.; Yaman, H.
    We study the vehicle routing problem with roaming delivery locations in which the goal is to find a least-cost set of delivery routes for a fleet of capacitated vehicles and in which a customer order has to be delivered to the trunk of the customer's car during the time that the car is parked at one of the locations in the (known) customer's travel itinerary. We formulate the problem as a set-covering problem and develop a branch-and-price algorithm for its solution. The algorithm can also be used for solving a more general variant in which a hybrid delivery strategy is considered that allows a delivery to either a customer's home or to the trunk of the customer's car. We evaluate the effectiveness of the many algorithmic features incorporated in the algorithm in an extensive computational study and analyze the benefits of these innovative delivery strategies. The computational results show that employing the hybrid delivery strategy results in average cost savings of nearly 20% for the instances in our test set. © 2017 Elsevier Ltd
  • Thumbnail Image
    ItemOpen Access
    Distributed and location-based multicast routing algorithms for wireless sensor networks
    (SpringerOpen, 2009-01) Korpeoglu, I.; Bagci, H.
    Multicast routing protocols in wireless sensor networks are required for sending the same message to multiple different destinations. In this paper, we propose two different distributed algorithms for multicast routing in wireless sensor networks which make use of location information of sensor nodes. Our first algorithm groups the destination nodes according to their angular positions and forwards the multicast message toward each group in order to reduce the number of total branches in multicast tree which also reduces the number of messages transmitted. Our second algorithm calculates an Euclidean minimum spanning tree at the source node by using the positions of the destination nodes. The multicast message is forwarded to destination nodes according to the calculated MST. This helps in reducing the total energy consumed for delivering the message to all destinations by decreasing the number of total transmissions. Evaluation results show that the algorithms we propose are scalable and energy efficient, so they are good candidates to be used for multicasting in wireless sensor networks. Copyright © 2009 H. Bagci and I. Korpeoglu.
  • Thumbnail Image
    ItemOpen Access
    A performance comparison of zone-based multicast protocols for mobile ad hoc networks
    (IEEE, 2003) Zhang, Y.; Rangnekar, A.; Selçuk, Ali A.; Bicak, A.; Sidhu, D.
    With the current trend toward ubiquitous computing come wireless devices capable of forming the nodes of mobile ad hoc networks. Such networks typically rely on routing protocols in order to communicate messages from a source node to a destination node through a set of intermediary nodes. In a typical ad hoc environment, mobile nodes mostly work as a group and are involved in collaborative computing. Multicast communication is more effective in these scenarios. This paper presents the comparison of the performance of two zone-based multicast routing protocols. Shared-tree MZR is a shared tree variant of the Multicast Routing Protocol based on Zone Routing (MZR). We compare the two variants and analyze their performance under various network conditions. The test results show that Shared-tree MZR protocol performs well and has significantly low overhead in scenarios with multiple sources. ©2003 IEEE.