In this paper, we propose an effective routing protocol that can be particularly applied to SDDC (Sangmyung Direct Digital Controller) BAS. We have used NS (Network Simulator)-2 to simulate the real building for SDDC ...
详细信息
This article proposed one kind based on the ant colony algorithm routing algorithm in wireless sensor networks. According to the election of cluster head node energy, and the use of ant colony algorithm is simple and ...
详细信息
DHT (Distributed Hash Tables) has been applied to the structured P2P system to achieve information retrieval and positioning efficiently. KAD is a large-scale network protocol based on the XOR metric in practice, whic...
详细信息
Aiming at the instability and uncertainty of mobile nodes and low-power wireless communications links in Ad hoc networks, a parallel disjointed multi-path routing algorithm called DMP_EOLSR is proposed in the paper. I...
详细信息
Single next hop routing algorithm which widely used centralize the transmission paths and leads to a waste of network resources and transmission congestion. For better performance, recently researches focus on multi n...
详细信息
Many localization algorithms require that at least some nodes in a network know their correct real position. Anchor-free localization algorithms manage to assign to all nodes virtual coordinates (VC) without knowledge...
详细信息
Joint routing and compression has been the research hotspot in practical sensor networks. Compressed sensing provides a radically different view of the structure of data and a promising new approach for jointly acquir...
详细信息
ISBN:
(纸本)9781467301732
Joint routing and compression has been the research hotspot in practical sensor networks. Compressed sensing provides a radically different view of the structure of data and a promising new approach for jointly acquiring and aggregating data from distributed data sources. Therefore, the random routing algorithm is proposed combined with compressive sensing for energy efficient data gathering in rhombic-deployed sensor networks, which satisfies the basic principles of compressed sensing, and can effective reconstruct the original signal. The performance of reconstruction on the basis of reconstruction error, energy consumption, and running time of data reconstruction is analyzed. The experiment results validate its rationality and efficiency.
Modern data center networks (DCNs) often use multi-rooted topologies, which offer multipath capability, for increased bandwidth and fault tolerance. However, traditional routing algorithms for the Internet have no or ...
详细信息
ISBN:
(纸本)9781467309202
Modern data center networks (DCNs) often use multi-rooted topologies, which offer multipath capability, for increased bandwidth and fault tolerance. However, traditional routing algorithms for the Internet have no or limited support for multipath routing, and cannot fully utilize available bandwidth in such DCNs. In this paper, we study the multipath routing problem for DCNs. We first formulate the problem as an integer linear program, but it is not suitable for fast on-the-fly route calculation. For a practical solution, we propose the Depth-First Worst-Fit Search based multipath routing algorithm. The main idea is to use depth-first search to find a sequence of worst-fit links to connect the source and destination of a flow. Since DCN topologies are usually hierarchical, our algorithm uses depth-first search to quickly traverse between hierarchical layers to find a path. When there are multiple links to a neighboring layer, the worst-fit link selection criterion enables the algorithm to make the selection decision with constant time complexity by leveraging the max-heap data structure, and use a small number of selections to find all the links of a path. Further, worst-fit also achieves load balancing, and thus generates low queueing delay, which is a major component of the end-to-end delay. We have evaluated the proposed algorithm by extensive simulations, and compared its average number of link selections and average end-to-end delay with competing solutions. The simulation results fully demonstrate the superiority of our algorithm and validate the effectiveness of our designs.
ACO algorithms for datagram networks was given by Di Caro & Dorigo, in year 1996. Basic mechanisms in typical ACO routing algorithms is Ant-like agents are proactively generated at the nodes to find/check paths to...
详细信息
This paper belongs to the field of communication and computer networks. Networks of low earth orbiting satellites are able to provide wireless connectivity to any part of the world while ensuring timely and better per...
详细信息
ISBN:
(纸本)9781467317139
This paper belongs to the field of communication and computer networks. Networks of low earth orbiting satellites are able to provide wireless connectivity to any part of the world while ensuring timely and better performance lower bit error rate. This type of technology has been growing interest towards the development of small satellites. Especially, when we talk about the execution of the service quality system, we must use some optimization techniques. However, these systems have the drawback of energy management which is the biggest problem to worry about. Therefore, optimization of the processing time and the effective implementation of information flow and storage on board must be discussed with respect to topology changes fast. In this paper we will discuss various routing algorithms of data used in small satellites and terrestrial networks. As a multiobjective problem, we try to solve the problem of routing data with multiobjective particle swarm optimization (MOPSO).
暂无评论