A greedy drawing is a straight-line drawing that contains a distance-decreasing path for every pair of nodes. A path (v0, v1, . . . , vm) is distance-decreasing if d(vi, vm) < d(vi−1, vm), for i = 1, . . . ,m. Greedy drawings easily support geographic greedy routing. Hence, a natural and practical problem is the one of constructing greedy drawings in the plane, using few bits for representing v...

We study the performance of a simple greedy on-line algorithm for routing large file transfers in a network. The goal of the algorithm is to minimize network congestion. We show that the competitive ratio of the greedy algorithm is O (

Routing in Mobile Ad Hoc Networks (MANETs) has always remained a challenging task due to its dynamic topology and lack of centralized control. Several routing protocols have been proposed over these years starting with the traditional topology based protocols to the geographic routing protocols. The research over these years shows that the geographic routing protocols like Greedy Perimeter Stat...

More than 70 percent of Earth is covered with water, while human knowledge of the underwater environment is negligible compared to the land. Underwater wireless acoustic sensor network (UWASN) is one of the newest technology to investigate the underwater. UWASNS is a subdivisions of WSNs in which a variable number of autonomous and self-organize sensor nodes and vehicles are deployed manually o...

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, w...

Geographic wireless sensor networks use position information for greedy routing. Greedy routing works well in dense networks, whereas in sparse networks it may fail and require a recovery algorithm. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costly for resource constrained position-based wireless sensor networks (WSNs). In t...

The performance of geographic routing protocols is impacted by physical voids and localization errors. Traversing voids is carried out by a complimentary algorithm, which requires high overhead and results in lower quality paths. Furthermore, localization errors lead to inefficient routes or even misrouting of packets. Accordingly, virtual coordinate systems (VCS) were proposed to be an alterna...

Produk segar yang mudah rusak (perishable) ialah produk mengalami penurunan nilai seiring dengan waktu sehingga dibutuhkan strategi pendistribusian dan penyimpanan tepat agar dapat terjual sebelum menurun secara signifikan. Pada riset ini dikembangkan suatu metode solusi heuristik bagi masalah inventory routing berkala untuk pengelolaan persediaan tujuan memaksimalkan pendapatan total dihasilka...