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.
A new energy efficient routing algorithm for wireless sensor networks is proposed. The new routing algorithm (Resistance Distance Routing algorithm, RDR algorithm) optimizes the routing path based on the theory of resistance distance in electricity. This paper describes the whole process of RDR algorithm in detail, and simulates it with MATLAB. Simulation results show that RDR algorithm is superior...
Orthogonal Frequency Division Multiplexing (OFDM) has recently been proposed as a modulation technique for optical networks due to its higher spectral efficiency and superior impairment tolerance. There have been extensive studies on routing and spectrum assignment (RSA) of the OFDM-based elastic optical network, of which most focus on a single route for each lightpath service. In this paper, we study...
It has been observed that opportunistic networks exhibit a highly unbalanced traffic load distribution, mainly because of the heterogeneity in mobility and the greedy routing decisions, leading to packet drops due to storage constraints. The existing strategies rely either on fairness techniques or on diverting traffic to alternative routes in order to control congestion. The result is a dilemma between...
Mobile Ad-hoc networks (MANETs) are self organizing, infrastructure-less and multi-hop packet forwarding networks. Apart from the normal responsibility, each node has the additional responsibility that it also acts as a router. The dynamic behavior, distributed control and scarcity of resources makes routing in ad hoc networks, a tricky task. Several studies proclaim the benefits accrued from multi...
Wireless mesh network (WMN) is a promising technology for building cost-effective and easy-deployable wireless home networking infrastructure. To efficiently utilize limited radio resources in WMNs, packet transmissions (especially, redundant packet transmissions) should be carefully managed. To this end, we introduce a software-defined WMN architecture where the data plane and control plane are separated...
Vehicular Ad hoc Network (VANET) is a special kind of Mobile Ad hoc Network. VANETs are becoming a technology for connecting vehicle to computer networks. VANETs consist of dynamic nodes in the form of fast moving vehicles whose movements are restricted to road layouts and static nodes in the form of Road Side Units (RSU). Frequent communication disconnections between vehicles are happening due to...
In collective intelligent robots, communication capability is considered as a key feature to decide how to design the collaboration policy. A cooperative routing robot system is suggested to maintain the communication capability in between human and a robot and an algorithm to establish a seamless global communication is proposed. Generating the radio signal map is suggested to estimate an area where...
The resource location of traditional structured P2P Networks is usually with high efficiency, but do not support the retrieval of semantic correlation. Therefore, this paper on the basis of studying structured P2P Networksdeeply, combines with the advantages of search-engine technology, then proposesa layered P2P network retrieval model of semantics based on VS-KAD protocol (KSL-P2P). This model uses...
A large organization can generate over ten billion network flow records per day, a high-velocity data source. Finding useful, security-related anomalies in this volume of data is challenging. Most large network flow tools sample the data to make the problem manageable, but sampling unacceptably reduces the fidelity of analytic conclusions. In this paper we discuss SiLK, a tool suite created to analyze...
This paper studies online shortest path routing over dynamic multi-hop networks. Link costs or delays are time-varying and modelled by independent and identically distributed random processes, whose parameters are initially unknown. The parameters, and hence the optimal path, can only be estimated by routing packets through the network and observing the realized delays. Our aim is to find a routing...
In recent years, a notable progress has been observed in the field of Wireless Sensor Networks (WSNs) due to their enormous number of applications. In this paper, a routing problem has been considered in a static WSN. Traditionally, routing mechanisms are based on a single objective optimisation function, e.g., the cost in terms of distance to find the shortest End-to-End (ETE) path from a source...
We consider the problem of routing multiple robots to service spatially distributed requests at specified time instants, where each robot, as well as each request, is associated with one or more skills. A request can be serviced by a robot as long as the robot has at least one skill in common with the skill set of that request. We characterize the feasibility aspects of such a heterogeneous routing...
In this paper, we study the routing problem in multi-hop cognitive radio networks (CRNs). We observe that Primary Users (PUs) in CRNs exhibit unevenly geographic distribution due to their social behaviors. In the area with densely-distributed PUs, the low spectrum availability will severely decrease the Secondary Users (SUs) communication reliability. We are motivated to exploit Primary User (PU)...
Recent studies based on the mobility traces taken from real delay tolerant networks show that in these networks a node movement does not occur in a totally random way. During movement, there is a greater likelihood that nodes meet again some of their past neighbors. But traditional spraying heuristics of Spray and Wait naively split copies between encountered nodes (for example, binary Spray and Wait...
Localized Quality of Service (QoS) routing has recently been proposed as a promising alternative to the currently deployed global routing algorithms. In localized routing schemes, routing decisions are taken solely based on locally collected statistical information rather than global state information [1]. This approach significantly reduces the overheads associated with maintaining global state information...
Event matching is the process of checking high volumes of events against large numbers of subscriptions and is a fundamental issue for the overall performance of a large-scale distributed publish/subscribe system. Most existing algorithms are based on counting satisfied component constraints in each subscription. As the scale of a system grows, these algorithms inevitably suffer from performance degradation...
As a space-efficient approach to data archive and backup, data deduplication is becoming increasingly popular in storage systems. However, as the data growing rapidly in data centers, single-node storage node is no longer be able to provide the corresponding throughput and capacities as expected. Building deduplication clusters is considered as a promising strategy to leverage such bottle-neck on...
With increasing demands for more flexible services, the routing policies in enterprise network becomes much richer. This has placed a heavy burden to the current router forwarding plane to support the increasing number of policies, primarily due to the limited capacity in TCAM. This hinders the development of new network services. In this paper, we present the design and implementation of a new forwarding...
Delay-Tolerant Networks (DTNs) refer to mobile wireless networks that lack continuous network connectivity among the nodes. To deal with such intermittent characteristics, DTNs use store-carry-and-forward based routing protocols instead of instantaneous end-to-end path transmissions. Many reallife applications of such networks have been identified and some of them pose complex computational challenges...
This paper presents a system for the purpose of field deployment of nodes in wireless sensor networks. We propose a mobile phone based deployment adviser tool which is robust as well as practically implementable. The tool advises a layman deployer to create a optimized wireless sensor network by placing of the nodes according to application requirements. The tool is presented here as logically linked...
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.