In this paper, we propose a new routing strategy on the basis of the so-called next-nearest-
neighbor search strategy by introducing a preferential delivering exponent α. It is found that …

The transport capacity of a network can be enhanced and the congestion can be controlled
by improving routing algorithms. Its upper limit is, however, unknown in detail. This study …

In wireless ad hoc networks, the ability to analytically characterize the spatial distribution of
terminals plays a key role in understanding fundamental network QoS measures such as …

An opportunistic network (OPPNET) is a wireless networks without an infrastructure. In
OPPNET, communication intermittently occurs when one node meets with another node …

We study information packet routing processes on scale-free networks by mimicking the
Internet traffic delivery strategies. We incorporate both the global network structure …

We investigate a new efficient packet routing strategy which mitigates traffic congestion on
complex networks. In order to avoid congestion, we minimize the maximum betweenness …

The efficiency of a routing strategy on complex networks can be reflected by two
measurements, ie the system capacity and the average data packets travel time. In this …

In this paper, we introduce a congestion-aware routing protocol that selects the paths
according to the congestion of nodes in the network. The aim is twofold: on one hand, and in …

This paper addresses mobility control routing in wireless networks. Given a data flow
request between a source-destination pair, the problem is to move nodes towards the best …

Classical routing strategies for mobile ad hoc networks operate in a hop by hop" push mode"
basis: packets are forwarded on pre-determined relay nodes, according to previously and …