Related papers: PAR: Petal ant routing algorithm for mobile ad hoc…
This paper addresses the path selection problem from a known sender to the receiver. The proposed work shows path selection using genetic algorithm(GA)and simulated annealing (SA) approaches. In genetic algorithm approach, the multi point…
Mobile Ad-hoc Network (MANET) is one of the promising wireless networking approaches where a group of wireless devices can establish communication among themselves without any infrastructure. MANET has successfully been implemented in the…
Recent advances in wireless technologies have given rise to the emergence of vehicular ad hoc networks (VANETs). In such networks, the limited coverage of WiFi and the high mobility of the nodes generate frequent topology changes and…
We consider an optimal flow distribution problem in which the goal is to find a radial configuration that minimizes resistance-induced quadratic distribution costs while ensuring delivery of inputs from multiple sources to all sinks to meet…
The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. In the dynamic traveling salesman problem the distances between cities as travel times are no longer fixed. The…
Paths generated by A* and other graph-search-based planners are widely used in the robotic field. Due to the restricted node-expansion directions, the resulting paths are usually not the shortest. Besides, unnecessary heading changes, or…
SMART NoC, which transmits unconflicted flits to distant processing elements (PEs) in one cycle through the express bypass, is a high-performance NoC design proposed recently. However, if contention occurs, flits with low priority would not…
Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number of transmissions having low Signal to Interference and Noise…
A weakness of next-hop routing is that following a link or router failure there may be no routes between some source-destination pairs, or packets may get stuck in a routing loop as the protocol operates to establish new routes. In this…
Data-intensive scientific and commercial applications increasingly require frequent movement of large datasets from one site to the other(s). Despite growing network capacities, these data movements rarely achieve the promised data transfer…
Adapting models pre-trained on large-scale datasets is a proven way to reach strong performance quickly for down-stream tasks. However, the growth of state-of-the-art mod-els makes traditional full fine-tuning unsuitable and difficult,…
We consider the problem of constructing efficient P2P overlays for sensornets providing "Energy-Level Application and Services". The method presented in \cite{SOPXM09} presents a novel P2P overlay for Energy Level discovery in a sensornet.…
Cognitive radio technology offers an important function in the efficient utilization of the radio spectrum. Besides, it is expected that CR-enabled vehicular ad-hoc networks (CR-VANETs) enrich the communication performance of the existing…
Overheads incurred by routing protocols diminish the capacity available for relaying useful data in a mobile wireless ad hoc network. Discovering lower bounds on the amount of protocol overhead incurred for routing data packets is important…
Routing represents a pivotal concern in the context of Wireless Sensor Networks (WSN) owing to its divergence from traditional network routing paradigms. The inherent dynamism of the WSN environment, coupled with the scarcity of available…
With the evolution of wireless technology and use of mobile devices, Mobile Ad-hoc Network has become popular among researchers to explore. A mobile ad-hoc network (MANET) is a self-configuring network of mobile routers (and associated…
Enhancing the routing efficacy of Flying AdHoc Networks (FANETs), a network of numerous Unmanned Aerial Vehicles (UAVs), in which various challenges may arise as a result of the varied mobility, speed, direction, and rapid topology changes.…
We study the problem of power-efficient routing for multihop wireless ad hoc sensor networks. The guiding insight of our work is that unlike an ad hoc wireless network, a wireless ad hoc sensor network does not require full connectivity…
In this paper we present some new complexity results on the routing time of a graph under the \textit{routing via matching} model. This is a parallel routing model which was introduced by Alon et al\cite{alon1994routing}. The model can be…
A sequence number checking technique is proposed to improve the performance of TCP connections in mobile ad hoc networks. While a TCP connection is initialized, a routing protocol takes the responsibility for checking the hop count between…