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.
We suggested a joint algorithm for opportunistic spectrum and time sharing in cognitive radio (CR) wireless mesh networks (WMNs) in this paper. The problem was formulated using linear programming and solved by the simplex-II method. The flow optimization problem was first developed for grid topology of CR WMNs. Results showed optimized flow of the CR WMNs with ideal interference free link scheduling...
This paper presents an algorithm that allows one to create a static schedule of the Profinet IO IRT communication, which is an industrial Ethernet protocol standardised in IEC 61158. This algorithm offers an alternative to the available commercial tool, providing comparable results regarding the resulting time schedule length. Furthermore, we extend the problem by useful time constraints providing...
This paper addresses offline virtual topology design in transparent optical networks under given periodic traffic. We call this planning problem ldquoScheduled Virtual Topology Designrdquo. Two problem variants are considered: for a network based on non-reconfigurable equipment and for a network based on reconfigurable equipment. Two MILP (Mixed Integer Linear Program) formulations are proposed, one...
In this paper, we study QoS routing in wireless mesh networks with cognitive radios, which involves route selection, channel allocation and scheduling. It turns out to be a hard problem because of the impact of interference and channel heterogeneity. We formally model it as an optimization problem and present an integer linear programming (ILP) formulation to provide optimal solutions. We then present...
The optimization problem of maximizing the throughput of a regular multi-radio, multi-channel wireless mesh network is addressed in this paper. Given certain network topology and traffic demands, by jointly considering power control, channel assignment and scheduling, we study how to maximize the network throughput under fairness constraint. Based on graph theory, the problem is divided into several...
Wireless Mesh Networks (WMNs) have recently emerged as a technology for next-generation wireless networking. WMNs partially replace wired backbone networks, and it is therefore reasonable to plan carefully radio resource assignment to provide quality guarantees to traffic flows. Directional transmissions allow to reduce radio interference, thus exploiting spatial reuse. Therefore, as a main contribution,...
One of the challenge in developing smart sensor networks is the minimization of network delay or at the very least be able to have upper and lower boundaries of network delay when sensor nodes respond to higher level applications. In this paper, we present a highly efficient task scheduling method based on linear programming that integrates both sensing and networking communication delay. The objective...
The problem of multi-rate power-controlled collision-free scheduling in spatial time division multiple access (STDMA) wireless mesh networks is formulated as a mathematical program utilising cross layer information. As these mixed integer linear programs are intractable (NP-hard problems), optimal collision-free schedules can be found only for topologies consisting of a few nodes. To this end, approximation...
We study the optimal survivability design problem under a scheduled traffic model in wavelength convertible WDM optical mesh networks. In this model, a set of demands is given, and the setup time and teardown time of a demand are known in advance. We formulate the joint routing and wavelength assignment problems as integer linear programs that maximally exploit network resource reuse in both space...
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.