An Adaptive Transmission Mode Selection Scheme for Cellular Underlaid D2D Communication

In this paper, we propose to use Artificial Bee Colony (ABC) optimization to solve the joint mode selection, channel assignment, and power allocation (JMSCPA) problem to maximize system throughput and spectral efficiency. JMSCPA is a problem where the allocation of channel and power depends on the mode selection. Such problems require two step solution and are called bi-level optimization problems. As bi-level optimization increases the complexity and computational time, we propose a modified version of single-level ABC algorithm aided with the adaptive transmission mode selection algorithm to allocate the cellular, reuse, and dedicated modes to the DUs along with channel and power allocation based on the network traffic load scenarios. A single variable, represented by the users (CUs and DUs) is used to allocate mode selection, and channel allocation to solve the JMSCPA problem, leading to a simpler solution with faster convergence, and significant reduction in the computational complexity which scales linearly with the number of users. Further, the proposed solution avoids premature stagnation of conventional ABC into local minima by incorporating a modification in its update procedure. The efficacy of the ABC-aided approach, as compared to the results reported in the literature, is validated by extensive numerical investigations under different simulation scenarios.

     

Flower‐shaped ultra‐wideband fractal antenna

A flower‐shaped ultra‐wideband fractal antenna is presented. It comprises a fourth iterative flower‐shaped radiator, asymmetrical stub‐loaded feeding line, and coplanar quarter elliptical ground planes. A wide operating band of 12.12 GHz (4.58‐16.7 GHz) for S ₁₁ ≤ ? 10 dB is achieved along with an overall antenna footprint of 15.7 × 11.4 mm². In addition, other desirable characteristics, that is, omnidirectional radiation patterns, peak gain upto 5 dB, and fidelity factor more than 75% are achieved. A good agreement exists between the simulation and measured results. The obtained results illustrate that this antenna has wide operating range and compact dimensions than available structures.     

DOA: DSR over AODV Routing for Mobile Ad Hoc Networks

We present a lightweight hierarchical routing model, Way Point Routing (WPR), in which a number of intermediate nodes on a route are selected as waypoints and the route is divided into segments by the waypoints. Waypoints, including the source and the destination, run a high-level intersegment routing protocol, while the nodes on each segment run a low-level intrasegment routing protocol. One distinct advantage of our model is that when a node on the route moves out or fails, instead of discarding the whole original route and discovering a new route from the source to the destination, only the two waypoint nodes of the broken segment have to find a new segment. In addition, our model is lightweight because it maintains a hierarchy only for nodes on active routes. On the other hand, existing hierarchical routing protocols such as CGSR and ZRP maintain hierarchies for the entire network. We present an instantiation of WPR, where we use DSR as the intersegment routing protocol and AODV as the intrasegment routing protocol. This instantiation is termed DSR over AODV (DOA) routing protocol. Thus, DSR and AODV—two well-known on-demand routing protocols for MANETs—are combined into one hierarchical routing protocol and become two special cases of our protocol. Furthermore, we present two novel techniques for DOA: one is an efficient loop detection method and the other is a multitarget route discovery. Simulation results show that DOA scales well for large networks with more than 1,000 nodes, incurring about 60 percent-80 percent less overhead than AODV, while other metrics are better than or comparable to AODV and DSR.     

Optical performance of a composite parabolic trough

The effects of receiver misplacement and the trough pointing towards the sun on the concentration characteristics of a composite parabolic trough are discussed. Results from some numerical calculations are presented graphically and discussed.     

Finding consistent global checkpoints in a distributed computation

Consistent global checkpoints have many uses in distributed computations. A central question in applications that use consistent global checkpoints is to determine whether a consistent global checkpoint that includes a given set of local checkpoints can exist. Netzer and Xu (1995) presented the necessary and sufficient conditions under which such a consistent global checkpoint can exist, but they did not explore what checkpoints could be constructed. In this paper, we prove exactly which local checkpoints can be used for constructing such consistent global checkpoints. We illustrate the use of our results with a simple and elegant algorithm to enumerate all such consistent global checkpoints     

CARD: A Contact-based Architecture for Resource Discovery in Wireless Ad Hoc Networks

Traditional protocols for routing in ad hoc networks attempt to obtain optimal or shortest paths, and in doing so may incur significant route discovery overhead. Such approaches may be appropriate for routing long-lived transfers where the initial cost of route discovery may be amortized over the life of the connection. For short-lived connections, however, such as resource discovery and small transfers, traditional shortest path approaches may be quite inefficient. In this paper we propose a novel architecture, CARD, for resource discovery in large-scale wireless ad hoc networks. Our mechanism is suitable for resource discovery as well as routing very small data transfers or transactions in which the cost of data transfer is much smaller than the cost of route discovery. Our architecture avoids expensive mechanisms such as global flooding and complex hierarchy formation and does not require any location information. In CARD resources within the vicinity of a node, up to a limited number of hops, are discovered using a proactive scheme. For resources beyond the vicinity, each node maintains a few distant nodes called contacts. Contacts help in creating a small world in the network and provide an efficient way to query for distant resources. Using contacts, the network view (or reachability) of the nodes increases, reducing the discovery overhead and increasing the success rate. On the other hand, increasing the number of contacts also increases control overhead. We study such trade-off in depth and present mechanisms for contact selection and maintenance that attempt to increase reachability with reduced overhead. Our schemes adapt gracefully to network dynamics and mobility using soft-state periodic mechanisms to validate and recover paths to contacts. Our simulation results show that CARD is scalable and can be configured to provide desirable performance for various network sizes. Comparisons with other schemes show overhead savings reaching over 93% (vs. flooding) and 80% (vs. bordercasting or zone routing) for high query rates in large-scale networks.     

Stepwise-Graded Si3N4–SiC Ceramics with Improved Wear Properties

The processing of stepwise graded Si₃N₄/SiC ceramics by pressureless co-sintering is described. Here, SiC (high elastic modulus, high thermal expansion coefficient) forms the substrate and Si₃N₄ (low elastic modulus, low thermal expansion coefficient) forms the top contact surface, with a stepwise gradient in composition existing between the two over a depth of ∼1.7 mm. The resulting Si₃N₄ contact surface is fine-grained and dense, and it contains only 2 vol% yttrium aluminum garnet (YAG) additive. This graded ceramic shows resistance to cone-crack formation under Hertzian indentation, which is attributed to a combined effect of the elastic-modulus gradient and the compressive thermal-expansion-mismatch residual stress present at the contact surface. The presence of the residual stress is corroborated and quantified using Vickers indentation tests. The graded ceramic also possesses wear properties that are significantly improved compared with dense, monolithic Si₃N₄ containing 2 vol% YAG additive. The improved wear resistance is attributed solely to the large compressive stress present at the contact surface. A modification of the simple wear model by Lawn and co-workers is used to rationalize the wear results. Results from this work clearly show that the introduction of surface compressive residual stresses can significantly improve the wear resistance of polycrystalline ceramics, which may have important implications for the design of contact-damage-resistant ceramics.     

Priority-based joint EDF–RM scheduling algorithm for individual real-time task on distributed systems

The Journal of Supercomputing - Multiple tasks arrive in the distributed systems that can be executed in either parallel or sequential manner. Before the execution, tasks are scheduled prioritywise...     

High power and low cross‐polarization microstrip patch array antenna at S‐band

This article reports the design and development of high power, low cross‐polarization, and high efficiency circularly polarized microstrip patch array antenna at S‐band, proposed for Indian Regional Navigation Satellite System payload. A novel feeding mechanism for truncated corner square patch based on square coaxial line for broadband impedance matching is discussed. Sequential rotation scheme for axial ratio improvement in an array is implemented. High power handling margins in critical regions of square coaxial line for multipaction breakdown is brought out. Measured 19 dB return loss bandwidth of array antenna is 15.6%. Axial ratio of 0.78 dB over global coverage is achieved in the desired frequency band of operation. © 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2012.