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.
In this paper we devise efficient optimization techniques to find optimal routing and scheduling policies for wireless ad hoc networks in the presence of multi-user interference and cooperative transmissions. Our focus is to assess the impact of interference among distinct data flows on optimal routing paths and related transmission schedules. In our reference scenario, all nodes have a single antenna...
In sparse mobile sensor networks, nodes have a small number of neighbors with intermittent connectivity. This paper presents a new networking protocol for this type of network, aimed at maximizing system performance in terms of both delay and reliability. The system is motivated by the observation that many applications on this type of network have two kinds of co-existing data packets: those with...
The study of the multicast routing protocol of multi-constrained is important for the development of the high performance network. The aims are the multi-constrained network model and the definition of the formula of every constrained characteristic measurement. However, it is a NP-complete problem. In order to gain the approximative solution, many heuristic algorithms have been designed by filling...
Network mobility (NEMO) supports the movement of some part of the network that a group of the mobile nodes (MNs) or the mobile routers (MRs) moves together. To support NEMO, the NEMO basic support protocol (NBSP) was proposed. In the nested mobile network, however, the NBSP exhibits pinball routing problem. As the degree of nesting increase, the problem becomes more serious. In this paper, we propose...
Localized mobility protocols are designed to address many of the drawbacks such as additional signaling and over-the-air tunnel overhead associated with global mobility protocols like Mobile IPv4 and Mobile IPv6. Proxy Mobile IPv6 is one such network controlled localized protocol defined in the IETF Although Proxy Mobile IPv6 can resolve longer binding update and tunnel overhead related issues when...
A number of prefix delegation-based schemes have been proposed in the literature to solve the route optimization problem in mobile networks. The route optimization solutions generate overheads and affect the performance of mobile networks. However, currently there is no tool available to aid in the selection of an appropriate scheme for a given mobility scenario. The objective of this paper is to...
In this paper, we study the optimal design of a linear wireless multihop network that employs Hybrid Automatic Repeat reQuest (HARQ) protocols in a quasi-static fading environment. Data transmission is assumed to be delay-tolerant up to a certain predefined maximum delay (in transmission slots) that is larger or equal to the number of hops. Multihop routing is implemented through a time-division scheduling...
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging...
This paper describes a new path computation model in Multi-protocol Label Switching (MPLS) and Generalized MPLS (GMPLS) networks. It introduces a path computation element (PCE), which is functionally separate from label switching routers (LSRs). The Path Computation Element (PCE) is an entity that is capable of computing a network path or route based on a network graph, and applying computational...
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.