Optimal path discovery for two moving sinks with a common junction in a wireless sensor network

Abstract

A new algorithm is described for determining the optimal round-trip paths for two moving sinks in a wireless sensor network. The algorithm uses binary integer programming to select two non-overlapping shortest paths except having a common junction node to cover all the sensor nodes. The two paths are balanced as nearly equal as possible. That is the sensor nodes along each path are equal or differ by just one depending on whether the total number of sensor nodes excluding the junction node is even or odd. In this method, both the path lengths are made equal or very nearly equal while the total length is minimized. This integrated approach is a novel and unique solution to solve the dual moving sink path problem in a wireless sensor network.

Review of random early detection optimization for congestion control in vehicular ad hoc networks

“…In this, three legs of the problem are addressedrouting where demand is generated; feedback mechanisms to help balance the demand supply for resources and the early detection of congestion to prevent the losses. Tunga et al [29] in this, the problem formulation, potentially multiobjective optimization problem, could be challenging, but still interesting to solve. These are addressed in terms of routing optimization, packet losscongestion control -RED optimization and formulation with feedback responses.…”