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 devices such as sensors have increasingly more processing, storage, and networking capabilities, making wireless sensor networks (WSNs) get lots of attentions in recent years. In addition, the cost of sensors is constantly decreasing making it possible to use large quantities of these sensors in a wide variety of important applications in environmental, military, commercial, health care,...
Trajectories contain considerable routing information, and trajectory-based routing gains the attention of researchers recently. This paper argues the problem of searching time period Longest Frequent Path(TPLFP). The TPLFP, as one of the reasonable alternative Most Frequent Path (MFP), is close to MFP enough and maximizes the number of frequent route segments. First, we define TPLFP formally. To...
We focus on designing efficient flow monitoring algorithms in SDN/OpenFlow by fully exploiting all three polling mechanisms, poll-single, poll-some and poll-all. Notably, the poll-some mechanism has not been adopted by any existing flow monitoring algorithm due to the inflexible match structure standardized in the early version of the OpenFlow specification. To enable the poll-some mechanism, we need...
Interconnects play a critical role in various networking environments including data center networks, high performance computing systems, networks-on-chip, etc. An important design concern of interconnects is the hardware cost, especially when the scale increases. In order to achieve lower hardware cost, a lot of previous work leverages a tradeoff between the cost and the performance. In this paper,...
Delay Tolerant Networks(DTNs) is network architecture designed to enable communication even in an unstable network connectivity between end. Nodes can't be pre-selected for a route because they can't know the information of the entire network. Therefore, the relay node should be selected effective to improve network performance. So the movement prediction scheme of the node is needed for this. In...
The existing works on analyzing/utilizing spectrum whitespace in Cognitive Radio Networks (CRNs) are either empirical studies lacking of theoretical guarantee, or local primary network information based inducing inaccurate analysis and estimation, or overlooking the spectrum whitespace details. Therefore, we propose to systematically analyze the spectrum whitespace in CRNs from a social network perspective...
Modern society is becoming increasingly dependent on various communication networks such as the Internet and the sensor networks. These networks need strong security measures to keep the traffic secure. If the security fails, many aspects of the society may suffer. In this paper, we address the network security challenge by focusing on one integral part of the network functionality: routing. Using...
Placement is the one of the important step in the Field Programmable Gate Array (FPGA) design flow. A successful placement provides complete and optimal routing for the circuit that is to be configured on the FPGA. In this paper an efficient placement algorithm based on Particle Swarm Optimization (PSO), PSO_Placer, is proposed. The proposed PSO based Placement algorithm focuses on minimizing the...
In Delay Tolerant Networks (DTNs), the connections between mobile nodes are intermittent and constant end-to-end paths rarely exist. In recent years, social-based approaches, which attempt to exploit social behaviors of DTN nodes to make better routing decision, have drawn tremendous interests in DTN routing design. However, most of these algorithms always select the same next hop as relay under the...
Static evacuation plans for buildings are generally designed to perform optimally when the building is at full capacity. We present a dynamic evacuation guidance system which does this regardless of the number of evacuees, by tailoring a flow-optimal evacuation plan to the current situation. The system assigns routes using a capacity-constrained routing algorithm which anticipates evolutions in path...
We have solved a problem of finding the shortest node-disjoint pair of paths that can share resilient arcs. It is assumed that a network consists of a set of nodes and a set of arcs. Moreover, a number of available arcs are resilient. Our goal is to find the shortest pair of paths such that they share only those nodes that are incident to shared resilient arcs. Furthermore, we assume that the resulting...
This paper investigates the survivability of multicast requests in mixed-graph optical networks, where only a fraction of the nodes have optical splitting capabilities (sparse-splitting optical networks). Mixed-graph networks have both bidirectional and unidirectional connections between their nodes, and they result due to resource holding of the already established requests. A new multicast protection...
Device-to-device networks (D2D) underlaying cellular networks have been widely recognized as one of the major approaches for ubiquitous information exchange featuring future Internet of things (IoT). In this paper, we propose an interference-aware routing for wireless D2D networks. Our objective for routing is to minimize the hop-count, which can decrease not only the delay for D2D connections, but...
To bridge the gap between limited energy supplies of the sensor nodes and the system lifetime, duty-cycle Wireless Sensor Networks (WSNs) with data aggregation are studied in this paper. We proposed a load-balanced and latency-efficient data aggregation scheduling for duty-cycled WSNs. A shortest path tree (SPT) is used as the routing structure for data aggregation scheduling. In SPT, parent-children...
In Chord protocol of P2P network, distances between entries in routing table are too long and only half of the identifier space can be covered. To solve this problem, a higher order Chord routing algorithm is proposed. The algorithm presents a new structure formula for routing table, increases distribution density of routing table entries, and extends routing searching coverage areas to the entire...
This paper propose a novel, induction based replicative patterns algorithm towards searching all routes in a unidirectional flow network. The fundamental approach is to generate all paths from a source node to sink node (destination node), represented in a two-dimensional matrix applying the proposed induction based on replicative patterns of matrix cells. It is found that, by starting a network with...
The growth of wireless devices with short-range communications capabilities is making research into Pocket Switched Networks (PSN)s more appealing. While some recent research has investigated the role of location in predicting the mobility patterns of autonomous agents within PSNs, little attention has been paid to the location as a resource itself. In this paper we investigate the potential for stationary...
Since one single node in a wireless sensor network (WSN) is quite power-limited, many of existing researches focus on abating the redundancy of transmission to achieve the goal of energy saving. However, they are mostly highly dependent on physical networks and routing, which will result in the excessive rawness of data, the great imbalance of energy consumption among nodes and the poor scalability...
In this 21st century people are looking for faster and efficient actions in each and every activities they involved. In this modern world, shopping is an inseparable & essential activity. But in reality it creates lot of stress and utilizes not only our time but also energy. Nowadays all kind of shops are available together in a location, but still confusion and unnecessary wandering are unavoidable...
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.