Wireless Communication

E. Mohanraj ¹, K. Duraiswamy ²

Affiliations
1 Department of Computer Science and Engineering, K. S. Rangasamy College of Technology, Tiruchengode, Tamilnadu, IN
2 K. S. Rangasamy College of Technology, Tiruchengode, Tamilnadu

Abstract

To provide an efficient QoS routing communication in MANET in a secure way, we implement an enhancing security and QoS routing in MANET by adapting optimization technique of Ant Colony Optimization with Fairness Index and the security of MANET for data communication is achieved by using Group Key management with self assessment key. This stimulates us to consider both security and QoS routing together in ad hoc scenario for both routing and message/data communication. To improve the secure data communication in MANET, we present a routing based data security using group key management based on self assessment key. The nodes in the network will creates its own key (self assessment key) based on the group which has maintains its unique key before it has been joined into the network for data communication security to recover the node reputation on receiving the data or sending the data to and from other mobile nodes. An experimental evaluation is done to estimate the performance of the proposed enhancing security and QoS routing using group self assessment key [ESQR] in MANET in terms of energy, throughput, and network lifetime.

Keywords

MANET, Security, QoS Routing, Group Self Assessment Key, Fairness Index, Data Communication.

Full Text

     

p. Sivakumar ¹, K. Duraiswamy ²

Affiliations
1 Manakula Vinayagar Institute of Technology, Pondicherry, IN
2 K. S. Rangasamy College of Technology, Tiruchengode, Tamilnadu, IN

Abstract

Mobile ad hoc network (MANET) is a collection of wireless mobile nodes or routers dynamically forming a temporary network without the use of any existing infrastructure or centralized administration and it has to face many challenges in real time multimedia communication. The quality of service (QoS) Constraints such as bandwidth and delay make the routing of MANET for real time traffic is a tedious task. This paper proposes to develop a QoS routing discovery protocol for real time traffic in mobile ad hoc network. This technique involves construction of bandwidth and delay aware paths between a source-destination pair. Initially the bandwidth availability and expected delay are estimated for each path and the source selects the best path with maximum bandwidth and minimal delay. We use the NS2 simulator on Linux operating system to showsthe performance based on the throughput, packet delivery ratio and average end-to-end delay metrics.

Keywords

Mobile Ad Hoc Network, Quality of Service, Real Time Traffic, Routing Discovery Protocol, Source-Destination Pair.

Full Text

     

V. Thilagavathe ¹, K. Duraiswamy ²

Affiliations
1 Institute of Road and Transport Technology, Erode, Tamilnadu, IN
2 Department of CSE, K.S.Rangasamy College of Technology, Tiruchengode, Tamilnadu, IN

Abstract

Mobile ad hoc network (MANET) is a collection of wireless nodes and they communicate using radio devices without any pre-existing infrastructure. A major issue in MANET route selection is node mobility disrupting link reliability. It consequences the dynamic generation of the less reliable paths in adhoc routing protocols. In order to address this problem, the link availability prediction technique is used to find the reliable link which in turn finds the reliable path. This paper aims to study about the existing link availability prediction techniques to predict the link availability in MANET.

Keywords

Link Availability, Mobile Adhoc Network, Node Mobility, Routing, Stability.

Full Text

     

A. Suresh ¹, K. Duraiswamy ¹

Affiliations
1 Department of MCA in K.S.Rangasamy College of Technology, Tiruchengode, IN

Abstract

High speed satellite networks are emerging fast in the communication domain. Bandwidth Delay Products (BDP) plays an important role in the design of a congestion control algorithm for the effective usage of network resources. Bandwidth delay products (BDPs) are referred as the maximum amount of unacknowledged data that allowed in flight at any moment in the network. TCP is originally designed for a general wired network. In case of BDP, packet losses rarely occur. TCP can no longer guarantee good bandwidth utilization.

Solutions proposed to provide reliable packet delivery in MANETs are non TCP variants and TCP variants. Non TCP variants focus on the modification of congestion control algorithms in the transport protocol. It requires complicated mathematical computation and incur excessive network overhead. Although relatively accurate congestion information obtained, it cannot retain the end-to-end semantics of a transport protocol.

 The work presented in this paper extends the Datagram Transport Protocol over Ad Hoc Networks (DTPA) for efficient adaptable MANETs in the changing network scenario. The extension is carried out by achieving fairness in the TCP flow of the MANET with adaptive Max-Min Fairness algorithm. The extended work incorporates a fixed size window based flow control algorithm and a cumulative bit vector based SACK (selective ACK) strategy. Simulation carried out guarantees reliable transmission and recovering packet losses. It improves the network performance in terms of throughput, round trip time, number of retransmissions, and IP queue size demonstrated by simulation conducted using NS2.

Keywords

MANET, DTPA, SACK, TCP and Bandwidth Delay Products (BDP).

Full Text

     

K. Prasanth ¹, K. Duraiswamy ²

Affiliations
1 Department of Information Technology, K.S. Rangasamy College of Technology, Tamilnadu, IN
2 K.S. Rangasamy College of Technology, Tamilnadu, IN

Abstract

VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Potential Edge Node Based Greedy Routing), a greedy position based routing approach which uses potential score based strategy to forward packets to the node present in the edge of the transmission range of source/forwarding node as most suitable next hop. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results using ns 2.33 shows that routing overhead is reduced considerably compared to other routing techniques of VANET.

Keywords

Vehicular Ad hoc Networks, Greedy Position Based Routing, EBGR, Revival Mobility Model, Routing Overhead.

Full Text

     

A. Sabari ¹, K. Duraiswamy ²

Affiliations
1 K S. Rangasamy College of Technology, Tiruchengode – 637215, IN
2 K. S. Rangasamy College of Technology, Tiruchengode – 637 215, IN

Abstract

Mobile Ad Hoc Networks (MANET) is an infrastructureless network with a set of dynamic, mobile and self-organizing nodes. Several methods have been proposed as solutions to the challenges associated with MANETs inspired by the Ant Colony Optimization (ACO) algorithm. ACO is a nature inspired algorithm based on the foraging behavior of ants. Ants have been found to discover the shortest path from their nest to food over time using very adaptive means. Multicast provides an efficient way of dissemination of data from a sender to a group of receivers. One interesting research area in MANET is multicast routing. Due to the adaptive and dynamic nature, ant based multicast routing algorithms are gaining more importance in routing. This has led to development of many different ant based multicast routing protocols for MANETs. It is quite difficult to determine which protocols may perform best under frequent node mobility, varying number of nodes, dynamic topology, diverse link capacities, various group and packet size, limited practical bandwidth of the shared wireless channel and the battery power availability. Consequently, it becomes necessary for MANETs to have an efficient multicast routing based on ACO and a Quality of Service (QoS) mechanism. In this paper, we have provided an overview of a wide range of ant based multicast routing protocols proposed in the literature.

Keywords

Ant Colony Optimization, Mobile Ad Hoc Network, Swarm Intelligence.

Full Text

     

R. Nallusamy ¹, K. Duraiswamy ²

Affiliations
1 Computer Science and Engineering Department, KS Rangasamy College of Technology, Tiruchengode-637215, IN
2 KS Rangasamy College of Technology, Tiruchengode-637215, IN

Abstract

This paper proposes a new Genetic algorithm with shrink wrap algorithm based initial population selection for the dynamic shortest path routing. Shortest path routing is the basic problem for number of real life problems. Different shortest path optimization problems can be solved by using various approximation algorithms due its computational complexity. The routing in packet switched multi-hop networks can be described as a classical combinatorial optimization problem i.e. a shortest path routing problem in graphs. The proposed algorithm shows that the GA and shrink wrap algorithms are best candidates for the optimization of dynamic shortest path routing problems due to their fastness in computation comparing to other soft computing and met heuristics algorithms.

Keywords

Combinatorial Optimization, Dynamic Shortest Path Routing Problem, Genetic Algorithm, Shrink Wrap Algorithm.

Full Text