Making transmission schedules immune to topology changes inmulti-hop packet radio networks

Transmissions scheduling is a key design problem in packet radio networks, relevant to TDMA and CDMA systems. A large number of topology-dependent scheduling algorithms are available, in which changes of topology inevitably require recomputation of transmission schedules. The need for constant adaptation of schedules to mobile topologies entails significant, sometime insurmountable, problems. These are the protocol overhead due to schedule recomputation, performance penalty due to suspension of transmissions during schedule reorganization, exchange of control message and new schedule broadcast. Furthermore, if topology changes faster than the rate at which new schedules can be recomputed and distributed, the network can suffer a catastrophic failure. The authors propose a robust scheduling protocol which is unique in providing a topology transparent solution to scheduled access in multi-hop mobile radio networks. The proposed solution adds the main advantages of random access protocols to scheduled access. Similarly to random access it is robust in the presence of mobile nodes. Unlike random access, however, it does not suffer from inherent instability, and performance deterioration due to packet collisions. Unlike current scheduled access protocols, the transmission schedules of the proposed solution are independent of topology changes, and channel access is inherently fair and traffic adaptive     

QoS-aware adaptation for satellite multimedia broadcasting via hierarchical packet scheduling

With the unique broadcast nature and ubiquitous coverage of satellite networks, the synergy between satellite and terrestrial networks provides opportunities for delivering wideband services to a wide range of audiences over extensive geographical areas. This article concerns the optimization techniques pertinent to packet scheduling to facilitate multimedia content delivery over the satellite with a return channel via a terrestrial network. We propose a novel hierarchical packet scheduling scheme that allocates the resources at different parts of the network in response to network dynamics and link variations while under the system power/resource constraints. Simulations prove that the HPS scheme can effectively improve the end-to-end performance and resource utilization with desirable scalability and fairness features.     

NZ‐flows in strong products of graphs

We prove that the strong product G₁? G₂ of G₁ and G₂ is ?₃‐flow contractible if and only if G₁? G₂ is not T? K₂, where T is a tree (we call T? K₂ a K₄‐tree). It follows that G₁? G₂ admits an NZ 3 ‐flow unless G₁? G₂ is a K₄ ‐tree. We also give a constructive proof that yields a polynomial algorithm whose output is an NZ 3‐flow if G₁? G₂ is not a K₄ ‐tree, and an NZ 4‐flow otherwise. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 267–276, 2010     

Mobile ad hoc networking: imperatives and challenges

Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary, “ad-hoc” network topologies, allowing people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. Ad hoc networking concept is not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad hoc paradigm. Recently, the introduction of new technologies such as the Bluetooth, IEEE 802.11 and Hyperlan are helping enable eventual commercial MANET deployments outside the military domain. These recent evolutions have been generating a renewed and growing interest in the research and development of MANET. This paper attempts to provide a comprehensive overview of this dynamic field. It first explains the important role that mobile ad hoc networks play in the evolution of future wireless technologies. Then, it reviews the latest research activities in these areas, including a summary of MANET’s characteristics, capabilities, applications, and design constraints. The paper concludes by presenting a set of challenges and problems requiring further research in the future.     

Slot Routing as a Solution for Optically Transparent Scalable WDM Wide Area Networks*

All-optical Wavelength Division Multiplexing (WDM) backbones are believed to be a fundamental component in future high speed networks. Currently, the most pursued approach for Wide Area Networks (WANs) is wavelength routing, in which communication circuits are established between node pairs by means of lightpaths (paths of light) spanning one or more fiber-optic links. This approach has, however, two drawbacks. Since the number of wavelengths and links in a network is finite, not all node pairs can be connected via a dedicated lightpath directly. Consequently, some node pairs will communicate using a concatenation of lightpaths, which requires electronic switching of in transit information, loosing the advantages of optical transparency. Secondly, typically some form of (electronic) traffic grooming will be necessary to make efficient use of the fixed lightpath capacity. This paper proposes to design all-optical WANs using a novel approach, called photonic slot routing. With photonic slot routing, entire slots, each carrying multiple packets on distinct wavelengths, are switched transparently and individually, using available fast and wavelength non-sensitive devices. The advantage of using photonic slot routing is threefold. All node pairs in the network communicate all-optically. Traffic aggregation necessary to efficiently use the capacity of the wavelength channels is optically achieved. The solution is practical as it is based on proven optical technologies. In addition, through the use of wavelength non-sensitive devices the proposed WAN design yields intrinsic scalability in the number of wavelengths.     

Antibandwidth and cyclic antibandwidth of meshes and hypercubes

The antibandwidth problem consists of placing the vertices of a graph on a line in consecutive integer points in such a way that the minimum difference of adjacent vertices is maximised. The problem was originally introduced in [J.Y.-T. Leung, O. Vornberger, J.D. Witthoff, On some variants of the bandwidth minimisation problem, SIAM Journal of Computing 13 (1984) 650-667] in connection with the multiprocessor scheduling problems and can also be understood as a dual problem to the well-known bandwidth problem, as a special radiocolouring problem or as a variant of obnoxious facility location problems. The antibandwidth problem is NP-hard, there are a few classes of graphs with polynomial time complexities. Exact results for nontrivial graphs are very rare. Miller and Pritikin [Z. Miller, D. Pritikin, On the separation number of a graph, Networks 19 (1989) 651-666] showed tight bounds for the two-dimensional meshes and hypercubes. We solve the antibandwidth problem precisely for two-dimensional meshes, tori and estimate the antibandwidth value for hypercubes up to the third-order term. The cyclic antibandwidth problem is to embed an n-vertex graph into the cycle C_n, such that the minimum distance (measured in the cycle) of adjacent vertices is maximised. This is a natural extension of the antibandwidth problem or a dual problem to the cyclic bandwidth problem. We start investigating this invariant for typical graphs and prove basic facts and exact results for the same product graphs as for the antibandwidth.     

Tautomerism,regioisomerism, and cyclization reactions of acridinyl thiosemicarbazides

The regioselectivities of methyl‐ and phenylhydrazine with acridin‐9‐yl isothiocyanate (thus yielding thiosemicarbazides with acridine substituted on the urea‐type side) were examined. Methylhydrazine regioselectivity was high with the α‐nitrogen atom overwhelmingly more nucleophilic than the β‐nitrogen atom; phenylhydrazine regioselectivity was poor but varied with the solvent and only in the case of ethanol was nucleophilic predominance of the α‐nitrogen atom pronounced. Of note, whilst both phenyl thiosemicarbazides were present in solution only as spiro forms, the methyl product was present as an equilibrium mixture of open‐chain and spiro thiosemicarbazides. Reactions on the NH₂ blocked analogue of methyl acridin‐9‐ylthiosemicarbazide (1‐isopropylidene‐2‐methylthiosemicarbazide) were also examined. Interestingly, present in the starting material itself was a structural motif of novelty wherein a triazolethione represented the major species of an equilibrium between cyclic and open‐chain forms.     

Unusual structures derived from N‐acridin‐9‐yl methyl N′‐acridin‐9‐yl thiourea based on the propensity of N‐10 to retain H

N‐Acridin‐9‐yl methyl N′‐acridin‐9‐yl thiourea spontaneously spiro cyclises via nucleophilic attack of the methylene carbon onto the C‐9 of the other acridine moiety. The thiourea, upon reaction with bromoacetonitrile, provided a spiro fused‐bicyclic product displaying unusual dynamic behavior.