delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. in this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several produ...

In this paper focus on sleep scheduling for geographic routing in duty cycled WSNs with mobile sensors and proposes two geographic-distance-based connected-k neighbourhood (GCKN) sleep scheduling algorithms. The first one is the geographic-distance-based connected-k neighbourhood for first path (GCKNF) sleep scheduling algorithm. The second one is the geographic-distance-based connected-k neigh...

A new approach for routing protocols operating in MANETs is presented in which flooding is not required to establish paths from sources to destinations on demand in MANETs of moderate size. The concept of ordered walk is introduced as a depth-first search (DFS) that does not rely on geographical or virtual coordinate information and is much more efficient than mere random walks. The benefits of...

Routing and wavelength assignment (RWA) is a widely discussed design problem in the optical networks literature. Physical layer impairments (PLI) degrade the quality of transmission (QOT) of a propagating optical signal inside the optical fiber and they have a significant impact on the RWA process. 3R regeneration, which is based on the expensive optical-to-electronic-to-optical (OEO) conversio...

A deadlock-free fully adaptive minimal routing algorithm for meshes that is optimal in the number of virtual channels required and in the number of restrictions placed on the use of these virtual channels is presented. It is also proved that, ignoring symmetry, this routing algorithm is the only fully adaptive routing algorithm with uniform routers that achieves both of these goals. This new al...

A deadlock-free fully adaptive minimal routing algorithm for meshes that is optimal in the number of virtual channels required and in the number of restrictions placed on the use of these virtual channels is presented. It is also proved that, ignoring symmetry, this routing algorithm is the only fully adaptive routing algorithm with uniform routers that achieves both of these goals. This new al...