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.
Judiciously assigning channels to a wireless mesh network can substantially enhance capacity of the network. One particular flavor of mesh network is that with a tree topology, which has the property that all traffic passes through one central point. Usually the allocation problem is linked to problems of routing, load, and measurements of interference. In this paper we take advantage of the restrictions...
Advance reservation of connection requests is a growing focus area and a range of solutions have been proposed. However, most efforts here have focused on scheduling algorithm design and have not addressed related implementation concerns in distributed settings. As a result, most schemes imply the use of a centralized controller, posing many scalability and reliability challenges. In order to address...
In original Chord model,the semantic property of the content in the model is not taken into account. Besides,a node's logical ID is independent of its physical location,bringing tremendous delay to network routing.Aiming at the system instability of structured P2P model which is caused by the heterogeneity of nodes in model,this paper proposes a Structure P2P network based on the Chord (TI-CHORD)...
In multi-hop wireless networks, the way the network topology is defined has a strong impact on routing. This paper deals with topology control in cellular networks with relays. Several topology control algorithms taken from ad-hoc networks are adapted to cellular networks. Most of the algorithms considered here are based on proximity graphs. Performance analysis is carried out in a realistic scenario...
Cognitive Radio Networks (CRNs) are emerging as a viable solution for exploiting the available spectrum and solving overcrowding in the operating bands. Several dimensions in the process of identification, management and routing need to be handled to overcome the challenges associated with the management of CRNs. A very important topic in achieving an effective and flexible management solution is...
Wireless Mesh Networks represent a promising technology to provide wireless Internet connectivity over a large community. This new technology not only allows a fast, easy and inexpensive network deployment, but also enables many new applications including community-scale peer-based communication or sharing of network resources and services. In this work, we propose an effective publish/subscribe communication...
Much work has been done on routing in Ad-Hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an...
The concept of Ad-hoc mobile networks that support multi-hopping has been around for some time now. However, making sure that such decentralized networks are completely self-organizing is not a trivial task and raises various issues relating to network management, routing, interference, etc. We have built a software SONIR (Self-Organizing Network with Intelligent Relaying), in MATLAB, which implements...
Cooperation enforcement in Mobile Ad Hoc Networks (MANET) and Wireless Sensor Networks (WSN) typically relies on separate detection and punishment schemes that isolate selfish nodes from routing and receiving network services. However, cooperative nodes then have to carry all the traffic. We propose a system that enforces cooperation smoothly and assures a fair distribution of bandwidth, as well as...
Wireless mesh networks (WMNs) have emerged to support applications on various domains, such as military, financial and healthcare, that claim for high level of both security and performance. Since WMNs are susceptible to security issues, and their devices own limitations that can compromise network performance, this paper presents SECOM, a framework for self-configuration of WMNs to provide simultaneously...
Since the pioneering research work of Ahlswede et al. in 2000, Network Coding (NC) has rapidly emerged as a major research area in electrical engineering and computer science due to its wide applicability to communication through real networks. The many contributions available in the literature to date, ranging from pure theoretical studies on fundamental limits to practical experimentations in real-world...
We consider the delay of network coding compared to routing for a family of simple networks with parallel links. We investigate the sub-linear term in the block delay required for unicasting n packets and show that there is an unbounded gap between network coding and routing. In particular, we show that delay benefit of network coding is scaling at least as fast as √n. The main technical contribution...
In this paper, we consider the problem of minimum cost joint compression and routing for networks with multiple-sinks and correlated sources. We introduce a routing paradigm, called dispersive information routing, wherein the intermediate nodes are allowed to forward a subset of the received bits on subsequent paths. This paradigm opens up a rich class of research problems which focus on the interplay...
The routing in communication networks is typically a multicriteria decision making (MCDM) problem. However, setting the parameters of most used MCDM methods to fit the preferences of a decision maker is often a difficult task. A Russian doll method able to choose the best multicriteria solution according to a context defined beforehand is proposed. This context is given by a set of nested boxes in...
Mapping and dynamic routing in a wireless network are essential and basic operations that are the prerequisites for all higher order interactions between nodes on that network. The Intent of network mapping by multi mobile software agents is to obtain the topology of network in a distributed manner. In this paper we examine how software agents can wander in an unknown Ad hoc network with cooperation...
Quality of service should be maintained in the next generation network for real time communication and multimedia transmission. There is no unified quality of service scheme. The framework and routing scheme are the basis of such network and the performance of quality of service are mainly determined by the framework and routing scheme. In this paper, a novel network framework composed of general...
Energy conservation is drawing increasing attention in data networking. One school of thought believes that a dominant amount of energy saving comes from turning off network elements. The difficulty is that transitioning between the active and sleeping modes consumes considerable energy and time. This results in an obvious trade-off between saving energy and provisioning performance guarantees such...
Providing quality of service (QoS) guarantees in networks gives rise to several challenging issues. One of them is how to determine a feasible path that satisfies a set of constraints while maintaining high utilization of network resources. Multi-constrained QoS routing algorithm finds a feasible route in network that satisfies multiple independent constraints. In general, multi-constrained path selection...
As an infrastructure for data distribution, overlay networks have to feature efficient routing and adequate robustness to achieve fast and accurate data distribution in the environment with node churn. Considering that the existing overlay networks mostly focus on single optimization objective and fail to ensure routing efficiency and robustness simultaneously, a hybrid overlay network for content-based...
Mobile ad hoc networks do not have any fixed topology. Routing in such network is very challenging and difficult due to the mobility of the nodes. Ant colony optimization is an efficient optimization technique used to find the optimum shortest route in the adhoc network. This paper describes a new routing algorithm for MANETs using Ant Colony Optimization technique. Special attention has been given...
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.