Armughan Ali

Co-UWSN: cooperative energy-efficient protocol for underwater WSNs

Sensor networks feature low-cost sensor devices with wireless network capability, limited transmit power, resource constraints, and limited battery energy. Cooperative routing exploits the broadcast nature of wireless medium and transmits cooperatively using nearby sensor nodes as relays. It is a promising technique that utilizes cooperative communication to improve the communication quality of single-antenna sensor nodes. In this paper, we propose a cooperative transmission scheme for underwater sensor networks (UWSNs) to enhance the network performance. Cooperative diversity has been introduced to combat fading. Cooperative UWSN (Co-UWSN) is proposed, which is a reliable, energy-efficient, and high throughput routing protocol for UWSN. Destination and potential relays are selected that utilize distance and signal-to-noise ratio computation of the channel conditions as cost functions. This contributes to sufficient decrease in path losses occurring in the links and transferring of data with much reduced path loss. Simulation results show that Co-UWSN protocol performs better in terms of end-to-end delay, energy consumption, and network lifetime. Selected protocols for comparison are energy-efficient depth-based routing (EEDBR), improved adaptive mobility of courier nodes in threshold-optimized depth-based routing (iAMCTD), cooperative routing protocol for UWSN, and cooperative partner node selection criteria for cooperative routing Coop (Re and dth).

SPARCO: Stochastic Performance Analysis with Reliability and Cooperation for Underwater Wireless Sensor Networks

Reliability is a key factor for application-oriented Underwater Sensor Networks (UWSNs) which are utilized for gaining certain objectives and a demand always exists for efficient data routing mechanisms. Cooperative routing is a promising technique which utilizes the broadcast feature of wireless medium and forwards data with cooperation using sensor nodes as relays. Here, we present a cooperation-based routing protocol for underwater networks to enhance their performance called Stochastic Performance Analysis with Reliability and Cooperation (SPARCO). Cooperative communication is explored in order to design an energy-efficient routing scheme for UWSNs. Each node of the network is assumed to be consisting of a single omnidirectional antenna and multiple nodes cooperatively forward their transmissions taking advantage of spatial diversity to reduce energy consumption. Both multihop and single-hop schemes are exploited which contribute to lowering of path-losses present in the channels connecting nodes and forwarding of data. Simulations demonstrate that SPARCO protocol functions better regarding end-to-end delay, network lifetime, and energy consumption comparative to noncooperative routing protocol—improved Adaptive Mobility of Courier nodes in Threshold-optimized Depth-based routing (iAMCTD). The performance is also compared with three cooperation-based routing protocols for UWSN: Cognitive Cooperation (Cog-Coop), Cooperative Depth-Based Routing (CoDBR), and Cooperative Partner Node Selection Criteria for Cooperative Routing (Coop Re and dth).

Unordered rule discovery using Ant Colony Optimization

In this article, a novel unordered classification rule list discovery algorithm is presented based on Ant Colony Optimization (ACO). The proposed classifier is compared empirically with two other ACO-based classification techniques on 26 data sets, selected from miscellaneous domains, based on several performance measures. As opposed to its ancestors, our technique has the flexibility of generating a list of IF-THEN rules with unrestricted order. It makes the generated classification model more comprehensible and easily interpretable. The results indicate that the performance of the proposed method is statistically significantly better as compared with previous versions of AntMiner based on predictive accuracy and comprehensibility of the classification model.

VANSec: Attack-Resistant VANET Security Algorithm in Terms of Trust Computation Error and Normalized Routing Overhead

VANET is an application and subclass of MANETs, a quickly maturing, promising, and emerging technology these days. VANETs establish communication among vehicles (V2V) and roadside infrastructure (V2I). As vehicles move with high speed, hence environment and topology change with time. There is no optimum routing protocol which ensures full-pledge on-time delivery of data to destination nodes, and an absolutely optimum scheme design for flawless packet exchange is still a challenging task. In VANETs, accurate and on-time delivery of fundamental safety alert messages (FSAMs) is highly important to withstand against maliciously inserted security threats affectively. In this paper, we have presented a new security-aware routing technique called VANSec. The presented scheme is more immune and resistive against different kinds of attacks and thwarts malicious node penetration attempts to the entire network. It is basically based on trust management approach. The aim of the scheme is to identify malicious data and false nodes. The simulation results of VANSec are compared with already existing techniques called trust and LT in terms of trust computation error (TCE), end-to-end delay (EED), average link duration (ALD), and normalized routing overhead (NRO). In terms of TCE, VANSec is 11.6% and 7.3% efficient than LT and trust, respectively, while from EED comparison we found VANSec to be 57.6% more efficient than trust and 5.2% more efficient than LT. Similarly, in terms of ALD, VANSec provides 29.7% and 7.8% more stable link duration than trust and LT do, respectively, and in terms of NRO, VANSec protocol has 27.5% and 14% lesser load than that of trust and LT, respectively.