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 mobile ad hoc network (MANET) consists of a group of communicating hosts that form an arbitrary network topology by means of any of several wireless communication media. MANET communications represent a diversification in communication technology necessary to solve the stringent end-to-end requirements of QoS-based communication networks. Of the many challenges in this complex distributed system,...
Routing delivery is one of the key techniques in mobile ad hoc network, which involves many aspects such as topology update, routing exchange and so on. In this paper, we firstly apply routing tree to describe the complete topology of ad hoc network, and then store the information of routing tree into every node's routing table. Sparse routing tree, as a pruned tree, is used to exchange topology information,...
To improve the adaptability and stability of Dijkstra algorithm for solving routing problem of service composition, a method to solve routing problem of service composition based on an improved ant colony algorithm is proposed. Firstly, based on the traditional ant colony algorithm, the constraints of it are improved. Secondly, a problem solving model for improved ant colony algorithm is established,...
Ultra-Wide Band (UWB) wireless communication is a promising spread-spectrum technology with features of low cost, low power and high time resolution has potentially important applications in wireless ad hoc networks. This paper presents a novel quality of service (QoS) routing scheme for wireless multimedia ad hoc networks. Besides applying neighbor detection method in route discovery procedure, the...
Quality of Service (QoS) routing is known to be an NP-hard problem in case of two or more additive constraints and several exact algorithms and heuristics have been proposed to address this issue. In this work, we consider a particular two-Constrained Quality of Service Routing Problem where one constraint is superlative and the other is comparative. We consider the superlative constraint to represent...
Quality of service (QoS) provisioning generally assumes more than one QoS measure which implies that QoS routing can be categorized as an instance of routing subject to multiple constraints: delay-jitter, bandwidth, cost, etc. We study the problem of constructing multicast trees to meet the QoS requirements of real-time interactive applications where it is necessary to provide bounded delays and bounded...
There are certain aspects in the field of networking that needs to be accomplished, yet it is very difficult to achieve. One such concept is Optimization. Achieving a high degree of reliability will eventually lead us to Optimization. But, achieving high degree of reliability?? This indeed is a very big problem that needs a solution. There have been many solutions before that solves the problem in...
In order to achieve the best performance of a Wireless Sensor Network (WSN), it is a must to provide a challengeable routing algorithm , which consumes less power and allows more data collection. In this paper we have considered a WSN with mobile sinks and it is considered that the router follows the basic location update algorithm with traffic awareness. We show the performances of a router under...
The focus of this work is to adaptively optimize continuous queries in a wireless sensor network. Therefore, we analyze and categorize the different types of queries used by wireless sensor applications. We present a short survey on the existing algorithms that can be adapted and used to optimize the different types of queries. We present their strengths and their drawbacks and identify that continuous...
Take a research in depth on the modeling problem of service path selection based on SON. Firstly, the optimal model is built with the optimal goal of balanced loading and with the functional constraints of users for composed service and multi-QoS constraints. Then the layered method and improved Ant algorithm are adopted to solve this problem. Finally, a simulated emulation is made to the algorithm,...
In this paper, we investigate the use of explicit disjoint for the multipath routing to achieve cost-efficient operation of wireless sensor networks. The focus is on constructing completely disjointed multiple paths between the source of sensing stimulus and the destination of gathered sensor data. We propose simple schemes for multipath construction based on explicit multiple anchor nodes. For the...
In this study we propose two novel ABR extended Long Life Routing Methods called Alternative enhancement for Enhanced Associativity Based Routing (AEABR) and Associativity Tick Averaged ABR (ATAABR) methods which are also modifications of Associativity Based Routing (ABR). Comparison of these associativity based long Life routing algorithms in Mobile Networks are done for route speeds, life times...
Opportunistic routing has gained much attention in recent years as a means of leveraging the broadcast nature of wireless medium. Most of the previous studies focused only on improving throughput, assuming that Best Effort traffic which is delay insensitive is delivered through opportunistic routing. However, when the delay sensitive traffic is involved, it is necessary to consider both the opportunistic...
Wireless sensor networks may be utilized for various application areas such as health, military, home, and so on. In the wireless sensor networks, data transmission typically relies on multi-hop communication with high packet loss rates on wireless links so that reliable end-to-end data transmission is desirable. Recently, in order to achieve desired Communication Reliability (CR) levels of the various...
Indoor Wireless sensor networks require a highly dynamic, adaptive routing scheme to deal with the high rate of topology changes due to fading of indoor wireless channels. Besides that, energy consumption rate needs to be consistently distributed among sensor nodes and efficient utilization of battery power is essential. If only the link reliability metric is considered in the routing scheme, it may...
In wireless mesh networks, scheduling is the bottleneck of the cross-layer design approach. Thus, it is surprising that CSMA is utility-optimal if it is used traffic-adaptive. However, the price to pay is short-term fairness and thus end-to-end delay. In this paper, we propose a step size adaptation algorithm that combines the advantages of small and large step sizes in a way that the convergence...
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...
Wireless mesh networks (WMNs) are comprised of nodes with multiple radio interfaces and provide broadband residential internet access or connectivity to temporal events. Our goal is to simplify the network deployment of such a mesh network, and towards that we are presenting procedures for automatic configuration and optimisation of the network. We first present an architecture framework that supports...
In wireless sensor networks, with respect to a desired time deadline real-time data dissemination schemes achieve that by a spatiotemporal communication approach forwarding data from a source to a destination with a delivery speed. The delivery speed is typically obtained from both the static distance from the source to the destination and the interval of the time deadline. However, in case of real-time...
The design of telecommunication network concerns the selection of arcs in a graph with involved cost as low as possible, but satisfies constraints such as point-to-point demands routed across the network, arc capacity, hop constraints and so on. Such a design must allocate enough flows and diverse routing paths through the network to ensure that feasible information flows continue to exist, even when...
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.