44759030
Media access using dynamic bandwidth system to improve satellite network uplink performance
The paper describes a media access system for satellite network uplinks. The media access protocol is designed to support a range of low-level protocols using a dual-framing system, that is, there is a synchronous traffic subframe in which registered station requests are assigned fixed blocks or slots and an asynchronous traffic subframe for unregistered station random access on a contention basis. Slots for the registered stations are assigned through request to the satellite; the remaining frame time is assigned to unregistered stations. Capacity waste through contention resulting in collisions is minimized. The system uses dynamic bandwidth (bit rate) allocation for each channel, that is, the base frequency and bandwidth are changed for each channel at frame boundaries. The total bandwidth for the sum of all uplink channels is fixed. Channels that have low load based upon their request in a prior uplink frame are assigned lower bandwidth, while those with higher loading are provided larger bandwidth. By sharing bandwidth over channels at frame boundaries, overall network efficiency and fairness are significantly enhanced. Bandwidth allocation is decided in the satellite. It allocates sufficient bandwidth for all synchronous traffic and then commits the remaining bandwidth to asynchronous traffic. Here, the allocation for asynchronous traffic provides each channel with sufficient slots so that equal probability of success for stations sharing the channel can be expected. The combination of traffic assignment and bandwidth allocation provides significant improvement in overall network efficiency and fairness for all traffic types. The hardware implementation of media access for variable bandwidth sharing between channels use the concepts of Digital Software Radio. Copyright © 2003 John Wiley & Sons, Ltd.
9333297
A two-zone hybrid routing protocol for mobile ad hoc networks
Recently, an elegant routing protocol, the zone routing protocol (ZRP), was proposed to provide a hybrid routing framework that is locally proactive and globally reactive, with the goal of minimizing the sum of the proactive and reactive control overhead. The key idea of ZRP is that each node proactively advertises its link state over a fixed number of hops, called the zone radius. These local advertisements provide each node with an updated view of its routing zone - the collection of all nodes and links that are reachable within the zone radius. The nodes on the boundary of the routing zone are called peripheral nodes and play an important role in the reactive zone-based route discovery. The main contribution of this work is to propose a novel hybrid routing protocol - the two-zone routing protocol (TZRP) - as a nontrivial extension of ZRP. In contrast with the original ZRP where a single zone serves a dual purpose, TZRP aims to decouple the protocol's ability to adapt to traffic characteristics from its ability to adapt to mobility. In support of this goal, in TZRP each node maintains two zones: a crisp zone and a fuzzy zone. By adjusting the sizes of these two zones independently, a lower total routing control overhead can be achieved. Extensive simulation results show that TZRP is a general MANET routing framework that can balance the trade offs between various routing control overheads more effectively than ZRP in a wide range of network conditions.
14933759
Classifying matrices separating rows and columns
The classification problem transforms a set of N numbers in such a way that none of the first N/2 numbers exceeds any of the last N/2 numbers. A comparator network that solves the classification problem on a set of r numbers is commonly called an r-classifier. We show how the well-known Leighton's Columnsort algorithm can be modified to solve the classification problem of N=rs numbers, with 1 /spl les/ s /spl les/ r, using an r-classifier instead of an r-sorting network. Overall, the r-classifier is used O(s) times, namely, the same number of times that Columnsort applies an r-sorter. A hardware implementation is proposed that runs in optimal O(s+logr) time and uses an O(rlogr(s + logr)) work. The implementation shows that, when N= rlogr, there is a classifier network solving the classification problem on N numbers in the same O(logr) time and using the same O(rlogr) comparators as an r-classifier, thus saying a logr factor in the number of comparators over an (rlogr)-classifier.
45508612
A unifying look at clustering in mobile ad hoc networks
In recent years, a significant number of clustering schemes have been proposed in the literature. Most of them treat cluster initialization and cluster maintenance differently as if they were two entirely different undertakings. The main contribution of this work is a unifying way of looking at clustering in MANET. We make an important point: there is no difference between cluster initialization and cluster maintenance, and one algorithm should gracefully blend into the other. To illustrate the feasibility of this concept, we propose a novel tree-based clustering algorithm for MANET based on a number of properties of diameter-2 graphs. The algorithm is cluster-centric and, unlike the vast majority of algorithms in the literature, works in the presence of node mobility. Extensive simulation results show the effectiveness of our algorithm when compared to other clustering schemes proposed in the recent literature. Copyright © 2004 John Wiley & Sons, Ltd.
11087297
Fairness in DQDB revisited: a new solution
The main contribution of this work is to a new way of looking at fairness in a DQDB system. Our scheme is very simple and efficient to implement and compares favorably with the leading rate-controlled schemes proposed in the literature. In addition, simulation results show that in the presence of non-uniform loads, such as a file server being brought up, our scheme converges rapidly to a fair steady state.<<ETX>>
31459718
Sequential and Parallel Meta-Heuristics for Solving the Single Row Routing Problem
The design of multi-layer printed circuit boards is vital in the construction of complex electronic systems. Wire routing is a crucial step in the overall design process, which can be decomposed into a number of single row routing (SRR) problems. This paper proposes an approach to solve the SRR problem based on parallel meta-heuristics. The development of this technique involves the design of an encoding strategy that allows all possible routings to be uniquely represented and the derivation of cost functions that maximizes the quality of the developed solutions. Further, parallelization of the proposed approach is attempted to improve the computational efficiency. The different stages of the development are backed by experiments to show the pros and cons of the sequential and parallel implementations.
29311207
All variations on perfectly orderable graphs
An ordered graph is a graph whose vertices are positive integers. Two ordered graphs are isomorphic if the order-preserving bijection between their sets of vertices is a graph isomorphism. We identify the family of all sets S of ordered graphs with the following properties: (1) Each member of S is a P4 (defined as a chordless path with four vertices and three edges). (2) If an ordered graph Z has no induced subgraph isomorphic (as an ordered graph) to a member of S, then Z is perfect. This work is related to Berge's Strong Perfect Graph Conjecture and was motivated by Chvatal's theorem on perfectly orderable graphs.
43705245
Welsh-Powell Opposition Graphs
Abstract We characterize a class of graphs for which the Welsh-Powell colouring heuristics results in an optimum colouring. We outline a polynomial-time recognition algorithm together with linear-time optimization algorithms for this class of graphs.
39112817
Asteroidal Triple-Free Graphs
An independent set of three vertices such that each pair is joined by a path that avoids the neighborhood of the third is called an asteroidal triple. A graph is asteroidal triple-free (AT-free) if it contains no asteroidal triples. The motivation for this investigation was provided, in part, by the fact that the AT-free graphs provide a common generalization of interval, permutation, trapezoid, and cocomparability graphs. The main contribution of this work is to investigate and reveal fundamental structural properties of AT-free graphs. Specifically, we show that every connected AT-free graph contains a dominating pair, that is, a pair of vertices such that every path joining them is a dominating set in the graph. We then provide characterizations of AT-free graphs in terms of dominating pairs and minimal triangulations. Subsequently, we state and prove a decomposition theorem for AT-free graphs. An assortment of other properties of AT-free graphs is also provided. These properties generalize known structural properties of interval, permutation, trapezoid, and cocomparability graphs.
11519290
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
An independent set of three vertices is called an asteroidal triple if between each pair in the triple there exists a path that avoids the neighborhood of the third. A graph is asteroidal triple-free (AT-free) if it contains no asteroidal triple. The motivation for this investigation is provided, in part, by the fact that AT-free graphs offer a common generalization of interval, permutation, trapezoid, and cocomparability graphs. 
Previously, the authors have given an existential proof of the fact that every connected AT-free graph contains a dominating pair, that is, a pair of vertices such that every path joining them is a dominating set in the graph. The main contribution of this paper is a constructive proof of the existence of dominating pairs in connected AT-free graphs. The resulting simple algorithm, based on the well-known lexicographic breadth-first search, can be implemented to run in time linear in the size of the input, whereas the best algorithm previously known for this problem has complexity O(|V|3) for input graph G=(V,E). In addition, we indicate how our algorithm can be extended to find, in time linear in the size of the input, all dominating pairs in a connected AT-free graph with diameter greater than 3. A remarkable feature of the extended algorithm is that, even though there may be O(|V|2) dominating pairs, the algorithm can compute and represent them in linear time.
32558867
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
An independent set of three of vertices is called an asteroidal triple if between each, pair in the triple there exists a path that avoids the neighbourhood of the third. A graph is asteroidal triple-free (AT-free, for short) if it contains no asteroidal triple. The motivation for this investigation is provided, in part, by the fact that AT-free graphs offer a common generalization of interval, permutation, trapezoid, and cocomparability graphs. Previously, the authors have given an existential proof of the fact that every connected AT-free graph contains a dominating pair, that is, a pair of vertices such that every path joining them is a dominating set in the graph. The main contribution of this paper is a constructive proof of the existence of dominating pairs in connected AT-free graphs. The resulting simple algorithm, based on the well-known Lexicographic Breadth-First Search, can be implemented to run in time linear in the size of the input, whereas the best algorithm previously known for this problem has complexity O(¦V¦3) for input graph G=(V, E). In addition, we indicate how our algorithm can be extended to find, in time linear in the size of the input, all dominating pairs in a connected AT-free graph with diameter greater than three. A remarkable feature of the extended algorithm is that, even though there may be O(¦V¦2) dominating pairs, the algorithm can compute and represent them in linear time.