Delay Tolerant Networks (DTNs) are wireless networks in which at any given time instance, the probability of having a complete path from a source to destination is low due to the intermittent connectivity between node...
详细信息
In this paper, we propose an algorithm that solves the k-pariwise disjoint path problem in an n-burnt pancake graph where n ≥ 4 and k = [n/2] in polynomial-order time of n. We also give a proof of its correctness as ...
详细信息
The network topology and routing protocol have a great impact on the performance of wireless sensor networks (WSN). A clustering routing algorithm based on uneven node deployment (CRAUND) is presented. The sensing are...
详细信息
Structured P2P network is a hot spot in recent researches. Structured P2P network routing problem is the most important. In this paper, due to the structure of Cycloid Model of P2P network routing algorithm in the cub...
详细信息
An efficient K-shortest paths routing algorithm for computer networks is presented. The Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF, which is only focusing on findin...
详细信息
As a variation of the pancake graph interconnection network, the burnt pancake graph network has a merit that it can connect many nodes while retaining a low degree. With a degree of n, a burnt pancake graph Bn connec...
详细信息
In this paper, we evaluate how traffic-load dependent vehicle routing at intersections is able to improve the connectivity status of all streets. To this end, we consider a VANET scenario, comprised of several streets...
详细信息
According to increasing the network traffic in the IMS, the role of Network Management System (NMS) is very important because of limited network resources. It can perform two kinds of routing ways with the capability ...
详细信息
Due to the variability and dynamic in mobile P2P networks, routing information generated by mobile agents based on interaction is uncertainty, non real-time and fuzzy, this paper describes that establishing a robust r...
详细信息
To solve anycast routing problem with multiple QoS constraints, a improved anycast routing algorithm based on simplified particle swarm optimization algorithm and diversity strategy is presented. Firstly, the algorith...
详细信息
暂无评论