Multipath routing in mobile ad hoc network with probabilistic splitting of traffic

Multipath routing is a burning issue in mobile ad hoc network due to its various advantages over single path routing. Some of these advantages are load balancing, bandwidth aggregation, and fault tolerance. Multipath routing means multiple paths exist between source and destination pair. Many works discussed in section 2 addressed queuing delays, but none of them suggested queuing delay for multiple path deliveries of data in mobile ad hoc network context. In this paper, we have designed a mathematical model to compute delay and throughput for multipath. Our model follow the network of M/M/1 queues, and we have applied Burke’s theorem to calculate the queuing delay of the packet in mobile network scenario. This model can be used to estimate delay and throughput of an individual path. Further, through the analysis the best path for data delivery out of available multiple paths as well as the multipath path can be used simultaneously for data delivery to the destination. Simulation result shows that splitted traffic multiple paths outperform splitted traffic. Therefore, our model is useful for design and analysis of ad hoc network. The simulation work has been carried out in Qualnet simulator.     

Applying trust enhancements to reactive routing protocols in mobile ad hoc networks

Due to the characteristics of mobile ad hoc networks, such networks are more susceptible to the destruction of malicious attacks or denial of cooperation. It would be easy for an adversary or a malicious node to launch attacks on routing function, especially attacks on packet routing. In order to mitigate these hazards, we incorporate the concept of ‘trust’ into MANETs, and abstract a decentralized trust inference model. The core of this model is trust computation, which is divided into two parts: historical trust assessment and trust prediction. We can quantify a node’s historical trust based on its historical behaviors via introducing multiple trust attributes. The fuzzy AHP method based on entropy weights is used to calculate the weight of trust attributes. By making use of the obtained historical trust data sequence, we propose an improved dynamic grey-Markov chain prediction measure to effectively estimate node’s trust prediction. In order to verify the validity of our trust model, we propose a trust-enhanced unicast routing protocol and a trust-enhanced multicast routing protocol, respectively. Both of the two new protocols can provide a feasible approach to kick out the untrustworthy nodes and choose the optimal trusted routing path. Moreover, the new proposed data-driven route maintenance mechanisms can reduce the routing overhead. The persuasive experiments have been conducted to evaluate the effectiveness of the new proposed trust-enhanced routing protocols in the aspects of packets delivery ratio, end-to-end latency, malicious node detection and attack resistance.     

Capacity of large hybrid erasure networks with random node distribution

The Gupta–Kumar’s nearest-neighbor multihop routing with/without infrastructure support achieves the optimal capacity scaling in a large erasure network in which n wireless nodes and m relay stations are regularly placed. In this paper, a capacity scaling law is completely characterized for an infrastructure-supported erasure network where n wireless nodes are randomly distributed, which is a more feasible scenario. We use two fundamental path-loss attenuation models (i.e., exponential and polynomial power-laws) to suitably model an erasure probability. To show our achievability result, the multihop routing via percolation highway is used and the corresponding lower bounds on the total capacity scaling are derived. Cut-set upper bounds on the capacity scaling are also derived. Our result indicates that, under the random erasure network model with infrastructure support, the achievable scheme based on the percolation highway routing is order-optimal within a polylogarithmic factor of n for all values of m.     

Sharing spray and wait routing algorithm in opportunistic networks

Due to the instability and intermittent connectivity of links among the nodes and the lack of connectivity in opportunistic network, it is not feasible to use common routing for delivering messages. The only practical method for routing and delivering messages is to use the store-carry-forward routing method. As a case in point, spray and wait is considered to be one of the most appropriate routing methods. The efficiency of this method depends directly on the proper selection of the next hop and the number of copies when it encounters a node. In this paper, a method was proposed that constantly selects the next node and considers the number of copies a node can deliver. In the proposed method, the selection of the next node and the number of message copies to be transmitted by the next hop are based on message carrying time and the probability of message delivery. The network model, based on Markov chain, is extended for analysis. Simulation and analysis results showed that significant enhancement is obtained with the proposed method when measuring metrics such as delay, delivery ratio and copy do comparisons with similar methods.     

An analytical geometric range free localization scheme based on mobile beacon points in wireless sensor network

In many applications of wireless sensor network, the position of the sensor node is useful to identify the actuating response of the environment. The main idea of the proposed localization scheme is similar with most of the existing localization schemes, where a mobile beacon with global positioning system broadcast its current location coordinate periodically. The received information of the coordinates help other unknown nodes to localize themselves. In this paper, we proposed a localization scheme using mobile beacon points based on analytical geometry. Sensor node initially choose two distant beacon points, in-order to minimize its residence area. Later using the residence area, sensor node approximate the radius and half length of the chord with reference to one of the distant beacon point. Then the radius and half length of the chord are used to estimate the sagitta of an arc. Later, sensor node estimate its position using radius, half length of the chord, and sagitta of an arc. Simulation result shows the performance evaluation of our proposed scheme on various trajectories of mobile beacon such as CIRCLE, SPIRAL, S-CURVE, and HILBERT.     

A universal two-way approach for estimating unknown frequencies for unknown number of sinusoids in a signal based on eigenspace analysis of Hankel matrix

We develop a novel approach to estimate the \(n\) unknown constituent frequencies of a noiseless signal that comprises of unknown number, \(n\), of sinusoids of unknown phases and unknown amplitudes. The new two-way approach uses two constraints to accurately estimate the unknown frequencies of the sinusoidal components in a signal. The new approach serves as a verification test for the estimated unknown frequencies through the estimated count of the unknown number of frequencies. The Hankel matrix, of the time domain samples of the signal, is used as a basis for further analysis in the Pisarenko harmonic decomposition. The new constraints, the existence factor and the component factor, have been introduced in the methodology based on the relationships between the components of the sinusoidal signal and the eigenspace of the Hankel matrix. The performance of the developed approach has been tested to correctly estimate any number of frequencies within a signal with or without a fixed unknown bias. The method has also been tested to accurately estimate the very closely spaced low frequencies.     

On an algorithm for Vision-based hand gesture recognition

A vision-based static hand gesture recognition method which consists of preprocessing, feature extraction, feature selection and classification stages is presented in this work. The preprocessing stage involves image enhancement, segmentation, rotation and filtering. This work proposes an image rotation technique that makes segmented image rotation invariant and explores a combined feature set, using localized contour sequences and block-based features for better representation of static hand gesture. Genetic algorithm is used here to select optimized feature subset from the combined feature set. This work also proposes an improved version of radial basis function (RBF) neural network to classify hand gesture images using selected combined features. In the proposed RBF neural network, the centers are automatically selected using k-means algorithm and estimated weight matrix is recursively updated, utilizing least-mean-square algorithm for better recognition of hand gesture images. The comparative performances are tested on two indigenously developed databases of 24 American sign language hand alphabet.     

Nonlocal PDE morphology: a generalized shock operator on graph

This paper presents an adaptation and extension of the shock filters on weighted graphs using the formalism of partial difference equations. This adaptation leads to new morphological operators that alternate between nonlocal dilation and nonlocal erosion filter type on graphs. Furthermore, this adaptation extends the shock filter applications to any data that can be represented by graphs. This approach is illustrated through image, data defined on region maps, and 3D point cloud processing.     

The influence of packaging materials on RF performance

At frequencies beyond 1 GHz, every component of the IC package contributes to the RF performance, whether required or not. In this work, we study the effects of packaging materials namely, the substrate and the globtop/underfill material on RF performance. We have measured interconnects on two area-array CSPs, the ball grid array and the polymer stud grid array using IMEC’s MCM-D technology. The measurements on the package interconnect show that the losses in the package substrate material account for about 50% of the total losses at 1.8 GHz and this drops to less than 20% at 5.2 GHz. The losses due to impedance mismatch dominate the losses especially below 10 GHz and considerable improvement in performance cannot be obtained by using an improved/expensive substrate. The other study is about the influence of globtop/underfill materials on wirebonds (through 3D EM simulations) as well as on standard 50 Ω MCM-D transmission lines (through experiments). While a higher value of dielectric constant of the globtop/underfill material is better on wirebonds, the influence of loss tangent is felt only above values of 0.1. The influence of seven different globtop/undefill materials on 50 Ω transmission lines has been used to extract their dielectric constant and loss tangent values at 30 GHz. These results are very valuable since one can hardly find the properties of globtop/underfill materials beyond 1 GHz.