Energy Aware, Scalable, K-Hop Based Cluster Formation In MANET

The study of Mobile Ad-hoc Network remains attractive due to the desire to achieve better performance and scalability. MANETs are distributed systems consisting of mobile hosts that are connected by multi-hop wireless links. Such systems are self organized and facilitate communication in the network without any centralized administration. MANETs exhibit battery power constraint and suffer scalability issues therefore cluster formation is expensive. This is due to the large number of messages passed during the process of cluster formation. Clustering has evolved as an imperative research domain that enhances system performance such as throughput and delay in Mobile Ad hoc Networks (MANETs) in the presence of both mobility and a large number of mobile terminals.In this thesis, we present a clustering scheme that minimizes message overhead and congestion for cluster formation and maintenance. The algorithm is devised to be independent of the MANET Routing algorithm. Depending upon the context, the clustering algorithm may be implemented in the routing or in higher layers. The dynamic formation of clusters helps reduce data packet overhead, node complexity and power consumption, The simulation has been performed in ns-2. The simulation shows that the number of clusters formed is in proportion with the number of nodes in MANET

Performance Evaluation of on demand and Table driven Protocol for Wireless Ad hoc Network

Mobile Adhoc Network is a wireless network without infrastructure.It is a kind of wireless adhoc network,and is a self configuring network of mobile routers connected by wireless links.The routers are free to move randomly and organize themselves arbitrarily,thus the network's wireless topology may change rapidly and unpredictably. Such a network may operate in a standalone fashion,or may be connected to the larger Internet.There are various routing protocols available for MANET.The most popular ones are DSR,AODV and DSDV.This paper examines two routing protocols for mobile ad hoc networks :the Destination Sequenced Distance Vector,the table driven protocol and the Ad hoc On Demand Distance Vector routing,an On Demand protocol and evaluates both protocols based on packet delivery fraction, average end to end delay,throughput and routing overhead while varying pause time.The performance evaluation has been done by using simulation tool NS2 which is the main simulator, NAM(Network Animator)and excel graph which is used for preparing the graphs from the trace files.Simulation revealed that although DSDV perfectly scales to small networks with low node speeds,AODV is preferred due to its more efficient use of bandwidth.Comment: 13 pages,4 figures,for international journal publications IJCE

Performance Analysis of Probabilistic Rebroadcasting in Grid FSR for MANET

Mobile Ad-hoc Network (MANET) is the self organizing collection of mobile nodes. The communication in MANET is done via a wireless media. Ad hoc wireless networks have massive commercial and military potential because of their mobility support. Due to demanding real time multimedia applications, Quality of Services (QoS) support in such infrastructure less networks have become essential. QoS routing in mobile Ad-Hoc networks is challenging due to rapid change in network topology. In this paper, we focused to reduce flooding performance of the Fisheye State Routing (FSR) protocol in Grid using ns-2 network simulator under different performance metrics scenario in respect to number of Nodes. For example, the connection establishment is costly in terms of time and resource where the network is mostly affected by connection request flooding. The proposed approach presents a way to reduce flooding in MANETs. Flooding is dictated by the propagation of connection-request packets from the source to its neighborhood nodes. The proposed architecture embarks on the concept of sharing neighborhood information. The proposed approach focuses on exposing its neighborhood peer to another node that is referred to as its friend-node, which had requested/forwarded connection request. If there is a high probability for the friend node to communicate through the exposed routes, this could improve the efficacy of bandwidth utilization by reducing flooding, as the routes have been acquired, without any broadcasts. Friendship between nodes is quantized based on empirical computations and heuristic algorithms. The nodes store the neighborhood information in their cache that is periodically verified for consistency. Simulation results show the performance of this proposed method.Comment: 8 pages, 15 figure

Survey of Important Issues in UAV Communication Networks

Unmanned Aerial Vehicles (UAVs) have enormous potential in the public and civil domains. These are particularly useful in applications where human lives would otherwise be endangered. Multi-UAV systems can collaboratively complete missions more efficiently and economically as compared to single UAV systems. However, there are many issues to be resolved before effective use of UAVs can be made to provide stable and reliable context-specific networks. Much of the work carried out in the areas of Mobile Ad Hoc Networks (MANETs), and Vehicular Ad Hoc Networks (VANETs) does not address the unique characteristics of the UAV networks. UAV networks may vary from slow dynamic to dynamic; have intermittent links and fluid topology. While it is believed that ad hoc mesh network would be most suitable for UAV networks yet the architecture of multi-UAV networks has been an understudied area. Software Defined Networking (SDN) could facilitate flexible deployment and management of new services and help reduce cost, increase security and availability in networks. Routing demands of UAV networks go beyond the needs of MANETS and VANETS. Protocols are required that would adapt to high mobility, dynamic topology, intermittent links, power constraints and changing link quality. UAVs may fail and the network may get partitioned making delay and disruption tolerance an important design consideration. Limited life of the node and dynamicity of the network leads to the requirement of seamless handovers where researchers are looking at the work done in the areas of MANETs and VANETs, but the jury is still out. As energy supply on UAVs is limited, protocols in various layers should contribute towards greening of the network. This article surveys the work done towards all of these outstanding issues, relating to this new class of networks, so as to spur further research in these areas.Comment: arXiv admin note: substantial text overlap with arXiv:1304.3904 by other author

Managing Congestion Control in Mobile AD-HOC Network Using Mobile Agents

In mobile adhoc networks, congestion occurs with limited resources. The standard TCP congestion control mechanism is not able to handle the special properties of a shared wireless channel. TCP congestion control works very well on the Internet. But mobile adhoc networks exhibit some unique properties that greatly affect the design of appropriate protocols and protocol stacks in general, and of congestion control mechanism in particular. As it turned out, the vastly differing environment in a mobile adhoc network is highly problematic for standard TCP. Many approaches have been proposed to overcome these difficulties. Mobile agent based congestion control Technique is proposed to avoid congestion in adhoc network. When mobile agent travels through the network, it can select a less-loaded neighbor node as its next hop and update the routing table according to the node congestion status. With the aid of mobile agents, the nodes can get the dynamic network topology in time. In this paper, a mobile agent based congestion control mechanism is presented.Comment: 9 Pages. IJCEA, 2014. arXiv admin note: substantial text overlap with arXiv:0907.5441 by other authors without attributio

Treatment of Reactive Routing Protocols Using Second Chance Based On Malicious Behavior of Nodes in MANETS

Mobile nodes of various routing protocols in Mobile Ad hoc Networks follow different strategies in transmission and receiving of data. Security, packet delivery and routing overhead are important concerns for any protocol during designing them. The presence and absence of malicious nodes in the network affect a lot on the performance of the protocol. This research is mainly focused on the study of the threats, attacks and reasons for malicious behavior of nodes in the network for reactive routing protocols in MANETS. DSR and AODV are the two reactive routing protocols that were considered for the study to propose a second chance strategy to be given to the nodes considering the reason for malicious behavior to improve the packet delivery ratio and reduce the routing overhead in the network. A simulative study has been conducted using Ad hoc Simulator (ASIM) considering the DSR and AODV routing protocols in the presence of malicious nodes and in the absence of malicious nodes which showed that the packet delivery ratio is low and routing overhead is high in the absence of malicious nodes. The second chance strategy proposed considers the reasons for malicious behavior and helps the node to get reintegrated in the network to improve the packet delivery ratio and reduce the routing overhead

Secured Approach Towards Reactive Routing Protocols Using Triple Factor in Mobile Adhoc Networks

Routing protocols are used to transmit the packets from the source to the destination node in mobile ad hoc networks. The intruders seek chance to pierce into the network and becomes a cause of malfunctioning in the network. These protocols are always prone to attacks. During the phases of routing in different types of protocols, each of the attack finds a way to degrade the performance of the routing protocols. The reactive routing protocols DSR and AODV have lot of similar features and so are considered in this study. In order to transmit the packets safely, a secured approach using triple factor has been proposed. This triple factor computes the trust by using the direct information then verifies the reputation by collecting the information from the neighbouring nodes called distributed factor and uses cryptographic algorithm to ensure security. And to ensure that there are routes available to perform the routing process, the reasons for such attacks are studied so as to re-integrate back the nodes in to the network, once it has repented for being malicious before. The availability of routes increases the throughputComment: arXiv admin note: text overlap with arXiv:1708.01639, arXiv:1710.1014

Mobile Ad Hoc Networks

Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms

SD-AODV: A Protocol for Secure and Dynamic Data Dissemination in Mobile Ad Hoc Network

Security remains as a major concern in the mobile ad hoc networks. This paper presents a new protocol SD-AODV, which is an extension of the exiting protocol AODV. The proposed protocol is made secure and dynamic against three main types of routing attacks- wormhole attack, byzantine attack and blackhole attack. SD-AODV protocol was evaluated through simulation experiments done on Glomosim and performance of the network was measured in terms of packet delivery fraction, average end-to-end delay, global throughput and route errors of a mobile ad hoc network where a defined percentage of nodes behave maliciously. Experimentally it was found that the performance of the network did not degrade in the presence of the above said attacks indicating that the proposed protocol was secure against these attacks.Comment: 8 pages, 11 figures, 1 table, IJCSI International Journal of Computer Science Issues, Vol. 7, Issue 6, November 201