Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
In (2n)1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n2 ) compared to its propagation delay O(n) only. Here, we attempt to identify the sets...
A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many ...
Energy consumption and delay incurred in packet delivery are the two important metrics for measuring the performance of geographic routing protocols for Wireless Adhoc and Sensor ...
Swarm Intelligence (SI) inspired routing algorithms have become a research focus in recent years due to their self-organizing nature, which is very suitable to the routing problems...