A Comparison of Mamdani and Sugeno Fuzzy Based Packet Scheduler for MANET with a Realistic Wireless Propagation Model

 The mobile nature of the nodes in a wireless mobile ad-hoc network (MANET) and the error prone link connectivity between nodes pose many challenges. These include frequent route changes, high packet loss, etc. Such problems increase the end-toend delay and decrease the throughput. This paper proposes two adaptive priority packet scheduling algorithms for MANET based on Mamdani and Sugeno fuzzy inference system. The fuzzy systems consist of three input variables: data rate, signal-to-noise ratio (SNR) and queue size. The fuzzy decision system has been optimised to improve its efficiency. Both fuzzy systems were verified using the Matlab fuzzy toolbox and the performance of both algorithms were evaluated using the riverbed modeler (formally known as OPNET modeler). The results were compared to an existing fuzzy scheduler under various network loads, for constant-bit-rate (CBR) and variable-bit-rate (VBR) traffic. The measuring metrics which form the basis for performance evaluation are end-to-end delay, throughput and packet delivery ratio. The proposed Mamdani and Sugeno scheduler perform better than the existing scheduler for CBR traffic. The end-to-end delay for Mamdani and Sugeno scheduler was reduced by an average of 52% and 54%, respectively. The performance of the throughput and packet delivery ratio for CBR traffic are very similar to the existing scheduler because of the characteristic of the traffic. The network was also at full capacity. The proposed schedulers also showed a better performance for VBR traffic. The end-to-end delay was reduced by an average of 38% and 52%, respectively. Both the throughput and packet delivery ratio (PDR) increased by an average of 53% and 47%, respectively. The Mamdani scheduler is more computationally complex than the Sugeno scheduler, even though they both showed similar network performance. Thus, the Sugeno scheduler is more suitable for real-time applications.     

A New Mobile Robot Toolbox for Matlab

In this study, a wheeled mobile robot navigation toolbox for Matlab is presented. The toolbox includes algorithms for 3D map design, static and dynamic path planning, point stabilization, localization, gap detection and collision avoidance. One can use the toolbox as a test platform for developing custom mobile robot navigation algorithms. The toolbox allows users to insert/remove obstacles to/from the robot’s workspace, upload/save a customized map and configure simulation parameters such as robot size, virtual sensor position, Kalman filter parameters for localization, speed controller and collision avoidance settings. It is possible to simulate data from a virtual laser imaging detection and ranging (LIDAR) sensor providing a map of the mobile robot’s immediate surroundings. Differential drive forward kinematic equations and extended Kalman filter (EKF) based localization scheme is used to determine where the robot will be located at each simulation step. The LIDAR data and the navigation process are visualized on the developed virtual reality interface. During the navigation of the robot, gap detection, dynamic path planning, collision avoidance and point stabilization procedures are implemented. Simulation results prove the efficacy of the algorithms implemented in the toolbox.     

MMSE estimator for speech enhancement considering the constructive and destructive interference of noise

A new minimum mean square error (MMSE) estimator for discrete cosine transform (DCT) domain speech enhancement considering the two state possibilities of signal and noise DCT coefficients, the constructive and destructive interference, is proposed. Given proper identification of these events are possible, an optimum non-linear MMSE estimator can be derived considering the conditional events. Compared to the previously reported dual-gain multiplicative filters, the proposed estimator demonstrates superior theoretical and experimental performance with respect to mean square error (MSE) improvement and other objective quality measures.     

Adaptive device-to-device communication using Wi-Fi Direct in smart cities

Wi-Fi Direct has become vastly popular in the last few years. Due to its fast network setup and the provision of high transmission rates, it is expected to be the piggyback technology for high speed device-to-device communications in smart cities. The increasing demand on Wi-Fi Direct networks and its co-location in the same band with other Wi-Fi ad-hoc and infrastructure networks have entailed the need for developing new adaptive techniques to utilize the wireless spectrum efficiently. In this paper, we introduce, analyze and implement a self-organizing algorithm designed specifically for pop-up Wi-Fi Direct networks. The algorithm dynamically changes the operating channels of pop-up Wi-Fi Direct networks according to their performance in a non-cooperative manner. It utilizes the spectrum efficiently, reduces congestion and enhances performance. Moreover, the modified Wi-Fi Direct network running the proposed algorithm is interoperable with all other Wi-Fi network modes and setups and does not affect their functionalities. On the contrary, it enhances their performance implicitly. We implement the algorithm using the driver of RTL8188CUS chipset in a Linux environment and conduct experiments to evaluate its performance. The obtained results illustrate the benefits of using the proposed algorithm.     

Bio-cellular processes modeling on silicon substrate: receptor–ligand binding and Michaelis Menten reaction

Reducing transmit power is the most straightforward way towards more energy-efficient communications, but it results in lower SNRs at the receiver which can add a performance and/or complexity cost. At low SNRs, synchronization and channel estimation errors erode much of the gains achieved through powerful turbo and LDPC codes. Further expanding the turbo concept through an iterative receiver—which brings synchronization and equalization modules inside the loop—can help, but this solution is prohibitively complex and it is not clear what can and what cannot be a part of the iterative structure. This paper fills two important gaps in this field: (1) as compared to previous research which either focuses on a subset of the problem assuming perfect remaining parameters or is computationally too complex, we propose a proper partitioning of algorithm blocks in the iterative receiver for manageable delay and complexity, and (2) to the best of our knowledge, this is the first physical demonstration of an iterative receiver based on experimental radio hardware. We have found that for such a receiver to work, (1) iterative timing synchronization is impractical, iterative carrier synchronization can be avoided by using our proposed approach, while iterative channel estimation is essential, and (2) the SNR gains claimed in previous publications are validated in indoor channels. Finally, we propose a heuristic algorithm for simplifying the carrier phase synchronization in an iterative receiver such that computations of the log likelihood ratios of the parity bits can be avoided to strike a tradeoff between complexity and performance.     

A group theoretic approach to construct cryptographically strong substitution boxes

In this paper, we present a method to construct a substitution box used in encryption applications. The proposed algorithm for the construction of substitution box relies on the linear fractional transform method. The design methodology is simple, while the confusion-creating ability of the new substitution box is complex. The strength of the proposed substitution box is evaluated, and an insight is provided to quantify the confusion-creating ability. In addition, tests are performed to assess the vulnerability of the encrypted data to algebraic and statistical attacks. The substitution box is critically analyzed by strict avalanche criterion, bit independent criterion, differential approximation probability test, linear approximation probability test, non-linearity test, and majority logic criterion. The performance of the proposed substitution box is also compared with those of some of the well-known counterparts including AES, APA, Gray, S₈, Skipjack, Xyi, and prime of residue substitution boxes. It is apparent that the performance, in terms of confusion-creating ability, of the new substitution box is better than those of some of the existing non-linear components used in encryption systems. The majority logic criterion is applied to these substitution boxes to further evaluate the strength and usefulness.     

Influence of the harvesting year and fertilizer on the fatty acid composition and some physicochemical properties of linseed (Linum usitatissimum L.)

Sar? 85 (Linum usitatissimum L.) linseed variety was used in this study. Linseed was cultivated at 2008 (LS-08) and 2009 (LS-09) without fertilizer. In addition, at 2009 diammonium phosphate [(NH₄)₂HPO₄] and ammonium nitrate (NH₄NO₃) were applied (LSF-09). The linseeds were analyzed for protein, ash and oil contents and fatty acid compositions. There were differences among harvesting years for oil, protein and ash contents of the seeds. The greater oil and protein contents were obtained during LS-08 compared with LS-09. There were no significant difference in protein and ash content between LS-09 and LSF-09 while a significant difference was observed in oil content. Seed protein, oil and ash contents were significantly affected by the harvesting year, but only oil content was affected by the fertilizer treatment. There are significant differences in palmitic, stearic, oleic, ??-linolenic and arachidic acid between LS-08 and LS-09. While palmitic, stearic, oleic acid decreased, ??-linolenic and arachidic acid increased during 2009 harvesting year. LSF-09 has the highest amount of ??-linolenic acid. The fertilizing treatment seems to have an increasing effect on the amount of ??-linolenic acid, while it has a decreasing effect on the oleic acid content.     

Two new Protecting Groups for the Guanidino Function of arginine

Two new synthons, Fmoc-L-Arg(biphenyl-4-sulphonyl)-OH ( 8 ) and Fmoc-Arg(4-methoxy-3-t-butylbenzenesulphonyl)-OH ( 14 ), are prepared for the synthesis of arginine-containing peptides. These groups are cleaved by commonly employed trifluoroacetic acid and methanesulphonic acid. Kinetic studies reveal that extended bicyclic aromatic conjugation, as in biphenyl, slightly improves the acid lability compared to the electron-donating t-butyl group.