Geographic routing provides for network scalability through routing decisions made from local position information. This feature is essentially at the cost of routing path stretch particularly in networks having sparse nodes or holes. To mitigate the unappealing factor, we exploit information on the maximum angle between successive edges from a node, defined as the representative angle of a nod...

 For the FPGA Greedy Routing Architectures (GRAs), the optimal mapping problem of the entire chip can be decomposed into a sequence of three kinds of optimal mside predetermined 4-way FPGA mapping problems, where m could be 1, 2, or 3. In this paper, we formulate the graph models of such sub-routing problems and investigate their minimum structures. The results give the lower bounds of routing...

The algorithmic small-world phenomenon, empirically established by Milgram’s letter forwarding experiments from the 60s [47], was theoretically explained by Kleinberg in 2000 [36]. However, from today’s perspective his model has several severe shortcomings that limit the applicability to real-world networks. In order to give a more convincing explanation of the algorithmic small-world phenomeno...

We study the eeect of varying the multithreading level of processors in work-optimal PRAM simulation algorithms on coated meshes. A coated mesh consists of a mesh connected routing machinery and P pro-cessor&memory pairs that form a coat on the routing machinery. The algorithms studied are based on greedy routing, sorting, improved virtual leveled network technique, combining queues method, and...

A routing scheme that uses a neural network has been developed that can aid in establishing point-to-point communication routes through multistage interconnection networks (MINs). The neural network is a network of the type that was examined by Hopfield (Hopfield, 1984 and 1985). In this work, the problem of establishing routes through random MINs (RMINs) in a shared-memory, distributed computi...

This paper presents a new non-greedy routing and admission control algorithm for the dynamic routing of bandwidth-guaranteed tunnels. The algorithm operates online that is handling requests which arrive one at a time without prior knowledge of the traf®c pattern. It combines the key concepts in the minimum interference routing algorithm and the algorithms developed based on theoretic competitiv...

Existing geographic routing algorithms face serious challenges due to location errors, nonplanarity issues and overhead of location service. To solve these issues, we propose Topological Cluster Based Geographic Routing that combines topology-based routing and geographic routing. It is a localized routing scheme where the geographic routing is performed on an overlay network of topological clus...

Routing packets along a specified curve is a new approach to forwarding packets in large-scale dense sensor networks. Forwarding packets along trajectories can be very effective in implementing many networking functions when standard bootstrapping or configuration services are not available, as will be the case in sensor networks where nodes are thrown or dropped to form a one-time use network....

Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community. However, existing beaconless geographic routing protocols are likely to generate duplicated data packets when multiple winners in the greedy area are selected. Furthermore, these protocols are designed for a uniform ...