Power Management Based Grid Routing Protocol for IEEE 802.11 Based MANET

MANET(Mobile Ad Hoc Network)is a collection of wireless mobile nodes forming a temporary communica-tion network without the aid of any established infrastructure or centralized administration.The lifetime of a MANETdepends on the battery resources of the mobile nodes.So energy consumption may one of important design criterions forMANET.With changing the idle model to sleep model in the grid environment,this paper proposes a new energy-awarerouting protocol.Performance simulation results show that the proposed strategy can dynamic balance the traffic load in-side the whole network,extend the lifetime of a MANET,and without decreasing the throughput ratio.     

Automata Based Hybrid PSO–GWO Algorithm for Secured Energy Efficient Optimal Routing in Wireless Sensor Network

The main objective in wireless sensor networks is to exploit efficiently the sensor nodes and to prolong the lifetime of the network. The discussion of energy is a significant concern to extend the lifetime of the network. Moreover, a nature inspired hybrid optimization approach called hybrid Particle Swarm Optimization–Grey Wolf Optimizer (PSO–GWO) is used in this work to efficiently utilize the energy and to transmit the data securely in an augmented path. A Learning Dynamic Deterministic Finite Automata (LD²FA) has been innovated and initiated to learn the dynamic role of the environment. LD²FA is mainly used to provide the learned and accepted string to hybrid PSO–GGWO so that the routes are optimized. Hybrid PSO–GWO is used to choose the optimal next node for each path to obtain the optimal route. The simulation results are obtained in MATLAB for 100–700 sensor nodes in a region of 500 × 500 m² which demonstrate that the proposed LD²FA based Hybrid PSO–GWO algorithm obtains better results when compared with existing algorithms. It is observed that LD²FA based Hybrid PSO–GWO has an increase of 18% and 48% betterment in lifetime of the network than PSO and GLBCA, nearly 57% and 75% increase in network lifetime when compared with GA and LDC respectively. It also shows an improvement of 24% increase compared to cluster-based IDS, nearly a rise of 90% throughput when compared with lightweight IDS. The consumption of energy is reduced by 13% and 15% than PSO and GA and an increase of 15% utilization of energy than LDC. Therefore, LD²FA based Hybrid PSO–GWO is been considered to efficiently utilize energy in an optimal route.

     

Routing Protocol with Optimal Location of Aggregation Point in Wireless Sensor Networks

1IntroductionAdvances in the miniaturization of MicroElectronicand Mechanical Structures(MEMS)haveledto batterypowered sensor nodes that have sensing,communica-tion,and processing capabilities[1~4].Sensor networkshave emerged as an indispensable and i mpo…     

A Novel Hybrid Optimization for Cluster‐Based Routing Protocol in Information-Centric Wireless Sensor Networks for IoT Based Mobile Edge Computing

Wireless Personal Communications - In present days, the utilization of mobile edge computing (MEC) and Internet of Things (IoT) in mobile networks offers a bottleneck in the evolving technological...     

Channel Adaptive Shortest Path Routing for Ad Hoc Networks

1　IntroductionAdhocnetworksareformedwithoutrequiringthepreexistinginfrastructureorcentralizedadminis tration ,incontrasttocellularnetworks.Asidefromtheoriginalmilitaryapplication ,ithasapplicationinpublicsafetyandcommercialareas,butadaptiveprotocolsarerequiredinorderforthemtodoso .Twoimportantcharacteristicsofacommunicationlinkinadhocnetworksareitsunreliabilityanditsvariability .Thelinksinsuchanetworkareunreli ablebecauseoffading ,interference,noise,andper hapsthefailureofthetransmittingorrec…     

Spatial–Temporal Fusion Based Path Planning for Source Seeking in Wireless Sensor Network

International Journal of Wireless Information Networks - Source seeking problem has been faced in many fields, especially in search and rescue applications. We proposed a virtual structure-based...     

Hybrid MANET–DTN and a New Algorithm for Relay Nodes Selection

In this paper, a new way to a selection of the secure relay nodes in hybrid MANET–DTN networks based on the cooperation between routing, trust and game theory mechanisms is introduced. The hybrid MANET–DTN enables delivering the data or messages in the situation when communication paths are disconnected or broken and also in the emergency situations. We focus on the situations when MANET routing protocol cannot establish the end-to-end connection between source and destination nodes. In this situation, it is necessary to select relay nodes, that will be able to transport data or messages between isolated islands of mobile terminals with limited connectivity to other terminals. The proposed algorithm enables to select the relay nodes, that will come into contact with other mobile nodes located in different network areas with regards to trust and game theory. The parameter trust is computed for all mobile nodes and relies on a parameter obtained during routing and data transport processes. The game theory provides a powerful tool to select one candidate from a number of possible nodes with respect to confidence and security. Moreover, we propose a new mechanism to compute and select the trusted node, that can be used for transportation of the secure data in this hostile and disconnected environment. In order to verify the functionalities of this mechanism, we implement this mechanism into the OPNET modeler simulation environment and introduce performance analysis.     

Design Method Based on Routing Tree for Topology Update in Ad Hoc Network

Ad hoc network is a kind of infrastructureless and self-organized mobile network. The wireless communication range of mobile nodes is limited in ad hoc network. The nodes can’t communicate with each other directly, but resort to the other adjacent nodes to forward their packets and exchange information of nodes. Every node not only serves as the mobile terminal, but also is able to store and forward packets[1]. Therefore, the node can be regarded as a router in ad hoc network. It finds the p…     

Mobility-Aware and Load Balancing Based Clustering Algorithm for Energy Conservation in MANET

Mobile ad hoc network (MANET) is one of wireless communication network architecture that has received a lot of attention. MANET is characterized by dynamic network topology and limited energy. With mobility-aware and load balancing based clustering algorithm (MLCA), this paper proposes a new topology management strategy to conserve energy. Performance simulation results show that the proposed MLCA strategy can balances the traffic load inside the whole network, so as to prolong the network lifetime, meanly, at the same time, achieve higher throughput ratio and network stability.     

Automatic Parameters Selection for SVM Based on PSO

Motivated by the fact that automatic parameters selection for Support Vector Machine （SVM） is an important issue to make SVM practically useful and the common used Leave - One - Out （LO0） method is complex calculation and time consuming,an effective strategy for automatic parameters selection for SVM is proposed by using the Particle Swarm Optimization （PSO） in this paper. Simulation results of practice data model demonstrate the effectiveness and high efficiency of the proposed approach.     

Correction to: Attack Resilient and Efficient Protocol Based on Greedy Perimeter Coordinator Routing—Mobility Awareness for Preventing the Attack in the VANET

Wireless Personal Communications -     

CL-TAP： An Efficient Certificateless Based Trusted Access Protocol for WLAN

Based on the certificateless public key cryptography and the trusted computing technologies~ a certificateless based trusted access protocol for WLAN （Wireless local area networks） is proposed. Such proto- col realizes the mutual authentication and unicast session key agreement between STA and AP within 3 protocol rounds. In particular, the platform authentication and in- tegrity verification are achieved during the authentication procedure. The security properties of the new protocol are examined using the Extended Canetti-Krawczyk secu- rity model. The analytic comparisons show that the new protocol is very ei~icient in both computing and communi- cations.     

PFQ-OS： A Packet Fair Queueing Based Opportunistic Scheduler in Wireless Networks

In this paper, we investigate the issues of extending the Packet fair queueing （PFQ） algorithms into continuous channel model. We present a PFQ-based Opportunistic scheduler （PFQ-OS）, which can improve user throughput while satisfying strict short-term fairness. We decouple the conflicting design objectives of fairness and user throughput improvement by introducing a Search radius （SR） into the framework of PFQ. We develop an analytical model and derive the fairness properties of PFQ-OS, which are related to the SR. Thereby system operators can focus on opportunistic scheduling for the users within the SR without violating the fairness guarantee. We further investigate the designing of scheduling policy under the strict fairness constraints, and propose that in order to utilize the opportunistic scheduling all the time, the selection rule should provide all the users with equal chance in being scheduled at each selection. Accordingly, we present Maximum relative SNR （Max-rSNR） selection rule for PFQ-OS. We derive the bounds in terms of user throughput under Rayleigh fading channel. An extensive set of simulations testifies our derived theoretical properties that PFQ-OS can significantly improve user throughput while providing excellent short-term fairness guarantee.     

A Dempster–Shafer Based Tit-for-Tat Strategy to Regulate the Cooperation in VANET Using QoS-OLSR Protocol

In this paper, we address the problem of cooperation among vehicles in VANET using QoS-OLSR protocol in the presence of selfish nodes. QoS-OLSR is a proactive protocol that considers the Quality of Service (QoS) of the nodes while electing the cluster-heads and selecting the Multi-Point Relay (MPRs) nodes. Cluster-heads and MPRs might misbehave on the roads by over-speeding or under-speeding. Classical and generous Tit-for-Tats are proposed to analyze the interaction among vehicles. However, both strategies are not able to enforce the cooperation due the fact that they (1) count on individual watchdogs monitoring, (2) rely on the node-to-node cooperation decision, (3) and ignore the high mobility and packet collisions. Therefore, we propose a Dempster–Shafer based Tit-for-Tat strategy that is able to improve the decision and regulate the cooperation in the vehicular network. This is done by (1) launching a cooperative watchdogs monitoring, (2) correlating the observations of the different watchdogs using Dempster–Shafer theory, and (3) propagating the decisions among clusters. Thereafter, we compare the Dempster–Shafer based strategy with several strategies derived from the original Tit-for-Tat. Simulation results prove that the Dempster–Shafer based strategy is able to maintain the survivability of the vehicular network in the presence of high mobility and packet collisions with minimal time and overhead.     

Outage Performance of Hybrid Decode–Amplify–Forward Protocol with the nth Best Relay Selection

In this paper, we consider the Hybrid Decode–Amplify–Forward protocol with the \(n\) th best-relay selection scheme. In the best-relay selection scheme, the best relay only forwards the source signal to the destination, regardless of working in the Amplify-and-Forward mode or the Decode-and-Forward mode. However, the best relay might be unavailable due to some reasons; hence we might bring into play the second, third or generally the \(n\) th best relay. We derive closed-form expression for the outage probability using the probability density function and moment generating function of the signal-to-noise ratio of the relayed signal at the destination node. Results show that with the \(n\) th best relay the diversity order is equal to \((m-n+2)\) where \(m\) is the number of relays. Simulation results are also given to verify the analytical results.     

Antenna Selection for MIMO–OFDM WLAN Systems

This paper discusses the packet error rate (PER) performance of multiple-input multiple-output (MIMO) wireless systems. We focus our discussion on communication systems based on the IEEE 802.11a/g standard. In particular, we study the performance of spatial multiplexing systems with joint encoding at the transmitter and linear detection at the receiver. We show that spatial multiplexing systems based on minimum mean square error (MMSE) or zero forcing (ZF) demultiplexing benefit greatly from antenna subset selection. These results agree with recent analytical results showing the equivalence in diversity order between a full system (all receive antennas) and a system with antenna selection.     

A One Round Protocol for Tripartite Diffie–Hellman

In this paper we propose a three participants variation of the Diffie--Hellman protocol. This variation is based on the Weil and Tate pairings on elliptic curves, which were first used in cryptography as cryptanalytic tools for reducing the discrete logarithm problem on some elliptic curves to the discrete logarithm problem in a finite field.     

Attack Resilient and Efficient Protocol based on Greedy Perimeter Coordinator Routing—Mobility Awareness for Preventing the Attack in the VANET

Wireless Personal Communications - A Greedy Perimeter Coordinator Routing and Mobility Awareness (GPCR-MA) vehicular routing is a widely accepted routing protocol for VANET (Vehicular Ad hoc...     

A Limited Deflection Routing Algorithm Based on Burst Loss Threshold in OBS Networks

1 Introduction The increase in the demand of transport capacity duetothe explosive growth of the Internet IP-based traffichas fueled the development of high-speed transmissionsystems andthe emergence of Wavelength Division Mul-tiplexing ( WDM) technology[1].Soin the near future ,it will be possible to support hundreds of wavelengths ofseveral Gigabit/s each. A new approach called OpticalBurst Switching (OBS)[2]that combines the best of op-tical circuit switching and optical packet switch…