Nonsinusoidal radar signal design for stealth targets

The detection of stealth point targets challenges the design of conventional radars using sinusoidal carriers since the objective of stealth technology is to reduce the radar cross section (RCS) of targets to a level where the radar receiver cannot detect the target. While there are a number of techniques employing different technologies to reduce the RCS of targets, shaping and coating the target with absorbing material are the most useful ones. The analysis and design of nonsinusoidal radar signals is based on modeling stealth point targets by a two-layer structure consisting of a metal surface covered with a coat of absorbing material. The design is presented for two classes of signals: uncoded signals and pulse compression signals using Barker codes. The relationship between target response, absorbing material time delay, time variation of transmitted pulses and coding features are determined and analyzed. While sliding correlators are used for detection and selection of various target responses, their output autocorrelation functions are determined analytically in terms of transmitted signal autocorrelation functions. Thumbtack range-velocity resolution functions are obtained for transmitted signal characters with a single pulse and characters with coded waveforms, for different pulse duration. It is shown that the range resolution can be improved by the proper choice of the transmitted signal duration relative to absorbing material time delay. Thumbtack range-velocity resolution functions similar to those of conventional point targets can also be realized     

A hybrid multiagent routing approach for wireless ad hoc networks

Wireless ad-hoc networks are infrastructureless networks that comprise wireless mobile nodes able to communicate each other outside wireless transmission range. Due to frequent network topology changes in one hand and the limited underlying bandwidth in the other hand, routing becomes a challenging task. In this paper we present a novel routing algorithm devoted for mobile ad hoc networks. It entails both reactive and proactive components. More precisely, the algorithm is based on ant general behavior, but differs from the classic ant methods inspired from Ant-Colony-Optimization algorithm [1]. We do not use, during the reactive phase, a broadcasting technique that exponentially increases the routing overhead, but we introduce a new reactive route discovery technique that considerably reduces the communication overhead. In the simulation results, we show that our protocol can outperform both Ad hoc On-demand Distance Vector (AODV) protocol [2], one of the most important current state-of-the-art algorithms, and AntHocNet protocol [5], one of the most important ant-based routing algorithms, in terms of end-to-end delay, packet delivery ratio and the communication overhead.     

2D and 3D image localization,compression and reconstruction using new hybrid moments

In this article, we will present a new set of hybrid polynomials and their corresponding moments, with a view to using them for the localization, compression and reconstruction of 2D and 3D images. These polynomials are formed from the Hahn and Krawtchouk polynomials. The process of calculating these is successfully stabilized using the modified recurrence relations with respect to the n order, the variable x and the symmetry property. The hybrid polynomial generation process is carried out in two forms: the first form contains the separable discrete orthogonal polynomials of Krawtchouk–Hahn (DKHP) and Hahn–Krawtchouk (DHKP). The latter are generated as the product of the discrete orthogonal Hahn and Krawtchouk polynomials, while the second form is the square equivalent of the first form, it consists of discrete squared Krawtchouk–Hahn polynomials (SKHP) and discrete polynomials of Hahn–Krawtchouk squared (SHKP). The experimental results clearly show the efficiency of hybrid moments based on hybrid polynomials in terms of localization property and computation time of 2D and 3D images compared to other types of moments; on the other hand, encouraging results have also been shown in terms of reconstruction quality and compression despite the superiority of classical polynomials.

     

Architectural Design,Improvement, and Challenges of Distributed Software-Defined Wireless Sensor Networks

Wireless Personal Communications - Software-defined networking (SDN) is widely perceived to simplify network management and monitoring. The introduction of the SDN model into wireless sensor...     

Semi-supervised superpixel classification for medical images segmentation: application to detection of glaucoma disease

Glaucoma is a disease characterized by damaging the optic nerve head, this can result in severe vision loss. An early detection and a good treatment provided by the ophthalmologist are the keys to preventing optic nerve damage and vision loss from glaucoma. Its screening is based on the manual optic cup and disc segmentation to measure the vertical cup to disc ratio (CDR). However, obtaining the regions of interest by the expert ophthalmologist can be difficult and is often a tedious task. In most cases, the unlabeled images are more numerous than the labeled ones.We propose an automatic glaucoma screening approach named Super Pixels for Semi-Supervised Segmentation “SP3S”, which is a semi-supervised superpixel-by-superpixel classification method, consisting of three main steps. The first step has to prepare the labeled and unlabeled data, applying the superpixel method and bringing in an expert for the labeling of superpixels. In the second step, We incorporate prior knowledge of the optic cup and disc by including color and spatial information. In the final step, semi-supervised learning by the Co-forest classifier is trained only with a few number of labeled superpixels and a large number of unlabeled superpixels to generate a robust classifier. For the estimation of the optic cup and disc regions, the active geometric shape model is used to smooth the disc and cup boundary for the calculation of the CDR. The obtained results for glaucoma detection, via an automatic cup and disc segmentation, established a potential solution for glaucoma screening. The SP3S performance shows quantitatively and qualitatively similar correspondence with the expert segmentation, providing an interesting tool for semi-automatic recognition of the optic cup and disc in order to achieve a medical progress of glaucoma disease.     

Mathematical Analysis and Performance Evaluation of the Cell-Free mMIMO Networks Based on Cognitive Relays

Wireless Personal Communications - The cell-Free massive multiple input multiple output “mMIMO” networks can provide a satisfied performance for the fifth generation “5G”...     

Enhancing inter-PMIPv6-domain for superior handover performance across IP-based wireless domain networks

As a network-based localized mobility management protocol, Proxy Mobile IPv6 (PMIPv6) enables a Mobile Host (MH) to roam within a localized domain without MH intervention in the mobility-related signalling. However, the PMIPv6 maintains MH mobility support in a restriction domain. Therefore, whenever the MH roams away from the PMIPv6 domain, its reachability status will be broken-down causing high handover latency and inevitable traffic loss for its communication session. This article proposes a proactive mechanism to mange the MH handover and maintain its data session continually across inter-PMIPv6-domains. The proposed mechanism introduces an intermediate global mobility anchor entity, called, which is responsible to coordinate MH handover as well as redirect its traffic across inter-PMIPv6-domains. Through various simulation evaluations, via ns-2, several experiments were conducted, revealing numerous results that verify the proposed mechanism superior performance over the conventional inter-PMIPv6-domain handover schemes in terms of handover latency, achieved throughput, protocol signalling cost and end-to-end traffic delivery latency.     

An evolutionary bargaining‐based approach for incentivized cooperation in opportunistic networks

Opportunistic networking enables users to communicate in an environment where connectivity is intermittent or unstable. However, such networking scheme assumes that mobile nodes voluntary cooperate, which cannot be guaranteed. Some nodes can simply exhibit selfish behavior and thus diminish the effectiveness of the approach. In this paper, a game scenario is formulated in which the nodes try to convince each other to participate in packets forwarding. Each node is considered as a player in this game. When a node comes in the communication range of another, a bargaining game starts between them as part of the message forwarding process. Both players try to have a mutual agreement on a price for message forwarding. We present a new incentive mechanism called evolutionary bargaining‐based incentive scheme (EBIS) to motivate selfish nodes to cooperate in data forwarding. In EBIS, a node negotiates with other nodes to obtain an agreeable amount of credit for its forwarding service. Nodes apply a sequential bargaining game and then adapt their strategies using an evolutionary model to maximize the probability of reaching an agreement. Unlike classical bargaining games, nodes in our model are boundedly rational. In addition, we use the evolutionary stable strategy (ESS) concept to determine the adaptive strategies for the nodes. The comparison of EBIS with a benchmarked model demonstrates that EBIS performs better in terms of packet delivery ratio and average latency.     

An Enhanced A-MSDU Frame Aggregation Scheme for 802.11n Wireless Networks

The main goal of the IEEE 802.11n standard is to achieve a minimum throughput of 100 Mbps at the MAC service access point. This high throughput has been achieved via many enhancements in both the physical and MAC layers. A key enhancement at the MAC layer is frame aggregation in which the timing and headers overheads of the legacy MAC are reduced by aggregating multiple frames into a single large frame before being transmitted. Two aggregation schemes have been defined by the 802.11n standard, aggregate MAC service data unit (A-MSDU) and aggregate MAC protocol data unit (A-MPDU). As a consequence of the aggregation, new aggregation headers are introduced and become parts of the transmitted frame. Even though these headers are small compared to the legacy headers they still have a negative impact on the network performance, especially when aggregating frames of small payload. Moreover, the A-MSDU is highly influenced by the channel condition due mainly to lack of subframes sequence control and retransmission. In this paper, we have proposed an aggregation scheme (mA-MSDU) that reduces the aggregation headers and implements a retransmission control over the individual subframes at the MSDU level. The analysis and simulations results show the significance of the proposed scheme, specifically for applications that have a small frame size such as VoIP.     

Energy efficient scheduling in local area networks

Wireless Networks - In Wireless Local Area Networks (WLAN), portable devices such as notebooks, tabs, and smart phones are powered by batteries with limited energy. With the great increase of using...