The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Wireless sensor networks suffer from the secure threat, which leads to excessive energy consumption and the expense of increased transmission delay. In this paper, a secure routing algorithm is proposed. The node evaluates the neighbor node by the trust value. The trust value of node is calculated by the accuracy rate of messages exchanging between two nodes. The trusted neighbor nodes set of the...
The performance of a cognitive radio network (CRN) is strongly affected by the radio activities of the primary users (PUs). Since these activities arbitrarily vary in time, frequency, and space domains, some diversity techniques have been introduced to reach a desired performance. In this paper, we propose a new AODV-based routing protocol for cognitive radio Ad Hoc networks (CRAHN) that exploits...
With the extensive use of sensor-embedded smart phones, Location-Based Social Networks (LBSN) become more and more popular among online social networks in recent years. In social networks, constructing the shortest path with minimum cost between any two nodes efficiently is vital for both graph analysis and implementation of applications. This is well known as the routing problem in social networks...
Previous research of ant-based routing algorithms mainly focused on energy efficiency. However, how ant-based routing algorithms perform in other metrics has been neglected. In this research, we compare the packet delivery ratio, the end-to-end delay and the first packet arrival time of an ant colony optimization (ACO) routing algorithm with three routing protocols commonly used in MANET, namely,...
Vehicular Ad Hoc Network (VANET) is considered as a special application of Mobile Ad Hoc Networks (MANETs) in road traffic, which can autonomously organize networks without infrastructure. VANETs enable vehicles on the road to communicate with each other and with road infrastructure using wireless capabilities. In the last few years, extensive research has been performed to extend Internet connectivity...
Torus topology is one of the most common topologies used in the current largest supercomputers. Although 3D torus is widely used, recently some supercomputers in the Top500 list have been built using networks with topologies of five or six dimensions. To obtain an nD torus, 2n ports per node are needed. These ports can be offered by a single or several cards per node. In the second case, there are...
A major challenge in data center networks is to provide enough network capacity to meet the ever increasing demand of large-scale distributed computing. While existing proposals focus on adding more switches and links, which cost extra hardware and energy, we explore another dimension in which spare disk space at servers is used for caching data, so as to increase network throughput without additional...
Based on the certainty and predictability of deep space network topology and link status, in this paper, we propose a multi-path routing algorithm taking both communication latency and communication capacity into consideration. After the simulation, the proposed algorithm can achieve many goals including shortening the data transmission time and communication latency, prolonging the link available...
Network-on-chip (NoC) has recently emerged as a primary paradigm for interconnecting ever increasing number of on-chip cores in future chip-multiprocessors (CMPs). As the advent of big data era, high volume of traffic injection, combined with the ever-changing patterns will exert severe pressure on some hotspots, leading to serious traffic congestion. These hot nodes will exhaust up the communication...
3-Dimensional Networks-on-Chips (3D NoCs) are proposed as the next generation interconnect infrastructure for multi/many core embedded systems due to the high performance characteristics and scalability. However the heat and thermal issues in 3D NoCs are critical. Reducing the vertical links between dies becomes can be one of the proper solutions, but the 3D NoC system performance can be harmed due...
In this paper compared the algorithms proposed in the method in wireless sensor network. Energy consumption is very important for self-powered radio nodes. But in some applications energy balancing is more important. Wireless sensor networks used in large areas like farmland or warehouses consist of hundreds of nodes. In classic method routing is directed to short time of transmission or low energy...
In typical NoC systems, most Routing Algorithms (RAs) abandon the interconnection between two adjacent routers if one traffic direction is broken, despite whether the other one is still functional or not. In this paper, we propose a distributed logic based RA, which can efficiently utilize the UnPaired Functional (UPF) links in such partially defected interconnects. The basic fault pattern tolerated...
Wireless Sensor Network (WSN) is multiple hops network. Nodes near sink are required to transmit a large amount of data and expend energy rapidly. These nodes die early and outer nodes can not send data to sink. Therefore the network dies early with much unused energy. This phenomenon is called energy hole. Aiming at energy hole problem of WSN, a novel solution is proposed in this paper. According...
Compared with IP multicast, overlay multicast has obvious advantages in terms of deployment, but usually consumes more underlying network resources. In this paper, we present a comparative study on some existing typical overlay multicast routing algorithms. According to the graph models of basic overlay networks that overlay multicast delivery structures are constructed from these routing algorithms...
As the routing protocol can greatly influence the energy consumption of the sensor nodes in research field of wireless sensor networks. In this paper, we present a novel distributed hash table based routing algorithm for wireless sensor networks. Distributed hash table is a kind of distributed memory approach, of which the single node can be expanded to the whole Internet. Particularly, each node...
The communication efficiency represents one of the key aspects in the future smart grid. Indeed, as the power distribution grid is being extended to fulfill increasing power demand population, recent advanced wireless communication standards and updates in the architecture of the distribution network have been introduced to upgrade the efficiency of data transmission and quality of service, enabling...
Delay Tolerant Networks (DTNs) are intermittently connected mobile networks, in which a fully connected path from source to destination does not exist. Therefore in these networks, message delivery relies on opportunistic routing where nodes use store-carry-and-forward paradigm to route the messages. However, effective forwarding based on a limited knowledge of contact behavior of nodes is challenging...
Fat-tree topology is very popular for constructing interconnect network for data centers. Routing is one of the most important design issues of data center networks. Several routing algorithms have been proposed for fat-tree topology, but they all ignore the fault diagnosis problem. In order to facilitate the diagnosis of link-fault in fat-tree based networks, in this paper we propose the FT-BTR,...
The node energy consumption is not balanced inexisting clustering routing protocol of wireless sensor network (WSN).A clustering routing algorithm based on distance probability (CRABDP) is proposed to improve this problem. It is calculated probability selected into head according to the distance with sink and the residual energy of nodes. Cluster heads distribution near sink is more than its distribution...
Modern battlefield communications environment is very complex, the sensor network is extremely prone to splitting, in this situation the traditional routing protocols will fail, and opportunistic routing is regarded as the most promising techniques. While there have been some routing protocols such as Epidemic, Prophet Router, First Contact Router to use, none of these protocol allows multiple sending...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.