Abstract: This paper presents the performance of Integrated
Bacterial Foraging Optimization and Particle Swarm Optimization
(IBFO_PSO) technique in MANET routing. The BFO is a bio-inspired
algorithm, which simulates the foraging behavior of bacteria.
It is effectively applied in improving the routing performance in
MANET. In results, it is proved that the PSO integrated with BFO
reduces routing delay, energy consumption and communication
overhead.
Abstract: Nature is the immense gifted source for solving
complex problems. It always helps to find the optimal solution to
solve the problem. Mobile Ad Hoc NETwork (MANET) is a wide
research area of networks which has set of independent nodes. The
characteristics involved in MANET’s are Dynamic, does not depend
on any fixed infrastructure or centralized networks, High mobility.
The Bio-Inspired algorithms are mimics the nature for solving
optimization problems opening a new era in MANET. The typical
Swarm Intelligence (SI) algorithms are Ant Colony Optimization
(ACO), Artificial Bee Colony (ABC), Particle Swarm Optimization
(PSO), Modified Termite Algorithm, Bat Algorithm (BA), Wolf
Search Algorithm (WSA) and so on. This work mainly concentrated
on nature of MANET and behavior of nodes. Also it analyses various
performance metrics such as throughput, QoS and End-to-End delay
etc.
Abstract: The wide use of the Internet-based applications bring many challenges to the researchers to guarantee the continuity of the connections needed by the mobile hosts and provide reliable Internet access for them. One of proposed solutions by Internet Engineering Task Force (IETF) is to connect the local, multi-hop, and infrastructure-less Mobile Ad hoc Network (MANET) with Internet structure. This connection is done through multi-interface devices known as Internet Gateways. Many issues are related to this connection like gateway discovery, handoff, address auto-configuration and selecting the optimum gateway when multiple gateways exist. Many studies were done proposing gateway selection schemes with a single selection criterion or weighted multiple criteria. In this research, a review of some of these schemes is done showing the differences, the features, the challenges and the drawbacks of each of them.
Abstract: Nature is a great source of inspiration for solving
complex problems in networks. It helps to find the optimal solution.
Metaheuristic algorithm is one of the nature-inspired algorithm which
helps in solving routing problem in networks. The dynamic features,
changing of topology frequently and limited bandwidth make the
routing, challenging in MANET. Implementation of appropriate
routing algorithms leads to the efficient transmission of data in
mobile ad hoc networks. The algorithms that are inspired by the
principles of naturally-distributed/collective behavior of social
colonies have shown excellence in dealing with complex
optimization problems. Thus some of the bio-inspired metaheuristic
algorithms help to increase the efficiency of routing in ad hoc
networks. This survey work presents the overview of bio-inspired
metaheuristic algorithms which support the efficiency of routing in
mobile ad hoc networks.
Abstract: The demand of high quality services has fueled
dimensional research and development in wireless communications
and networking. As a result, different wireless technologies like
Wireless LAN, CDMA, GSM, UMTS, MANET, Bluetooth and
satellite networks etc. have emerged in the last two decades. Future
networks capable of carrying multimedia traffic need IP convergence,
portability, seamless roaming and scalability among the existing
networking technologies without changing the core part of the
existing communications networks. To fulfill these goals, the present
networking systems are required to work in cooperation to ensure
technological independence, seamless roaming, high security and
authentication, guaranteed Quality of Services (QoS). In this paper, a
conceptual framework for a cooperative network (CN) is proposed
for integration of heterogeneous existing networks to meet out the
requirements of the next generation wireless networks.
Abstract: The aim of this paper is to propose a novel technique
to guarantee Quality of Service (QoS) in a highly dynamic
environment. The MANET changes its topology dynamically as the
nodes are moved frequently. This will cause link failure between
mobile nodes. MANET cannot ensure reliability without delay. The
relay node is selected based on achieving QoS in previous
transmission. It considers one more factor Connection Existence
Period (CEP) to ensure reliability. CEP is to find out the period
during that connection exists between the nodes. The node with
highest CEP becomes a next relay node. The relay node is selected
dynamically to avoid frequent failure. The bandwidth of each link
changed dynamically based on service rate and request rate. This
paper proposes Active bandwidth setting up algorithm to guarantee
the QoS. The series of results obtained by using the Network
Simulator (NS-2) demonstrate the viability of our proposed
techniques.
Abstract: In MANET, mobile nodes communicate with each
other using the wireless channel where transmission takes place with
significant interference. The wireless medium used in MANET is a
shared resource used by all the nodes available in MANET. Packet
reserving is one important resource management scheme which
controls the allocation of bandwidth among multiple flows through
node cooperation in MANET. This paper proposes packet reserving
and clogging control via Routing Aware Packet Reserving (RAPR)
framework in MANET. It mainly focuses the end-to-end routing
condition with maximal throughput. RAPR is complimentary system
where the packet reserving utilizes local routing information
available in each node. Path setup in RAPR estimates the security
level of the system, and symbolizes the end-to-end routing by
controlling the clogging. RAPR reaches the packet to the destination
with high probability ratio and minimal delay count. The standard
performance measures such as network security level,
communication overhead, end-to-end throughput, resource utilization
efficiency and delay measure are considered in this work. The results
reveals that the proposed packet reservation and clogging control via
Routing Aware Packet Reserving (RAPR) framework performs well
for the above said performance measures compare to the existing
methods.
Abstract: Opportunistic routing is used, where the network has
the features like dynamic topology changes and intermittent network
connectivity. In Delay tolerant network or Disruption tolerant
network opportunistic forwarding technique is widely used. The key
idea of opportunistic routing is selecting forwarding nodes to forward
data packets and coordination among these nodes to avoid duplicate
transmissions. This paper gives the analysis of pros and cons of
various opportunistic routing techniques used in MANET.
Abstract: Vehicular Ad hoc Network (VANET) is a special case of Mobile Ad hoc Network (MANET) used to establish communications and exchange information among nearby vehicles and between vehicles and nearby fixed infrastructure. VANET is seen as a promising technology used to provide safety, efficiency, assistance and comfort to the road users. Routing is an important issue in Vehicular Ad Hoc Network to find and maintain communication between vehicles due to the highly dynamic topology, frequently disconnected network and mobility constraints.
This paper evaluates the performance of two most popular proactive routing protocols OLSR and DSDV in real city traffic scenario on the basis of three metrics namely Packet delivery ratio, throughput and average end to end delay by varying vehicles density and transmission range.
Abstract: A Vehicular Ad-Hoc Network (VANET) is a mobile Ad-Hoc Network that provides connectivity moving device to fixed equipments. Such type of device is equipped with vehicle provides safety for the passengers. In the recent research areas of traffic management there observed the wide scope of design of new methodology of extension of wireless sensor networks and ad-hoc network principal for development of VANET technology. This paper provides the wide research view of the VANET and MANET concept for the researchers to contribute the better optimization technique for the development of effective and fast atomization technique for the large size of data exchange in this complex networks.
Abstract: Mobile Ad-Hoc Network (MANET) is a network without infrastructure dynamically formed by autonomous system of mobile nodes that are connected via wireless links. Mobile nodes communicate with each other on the fly. In this network each node also acts as a router. The battery power and the bandwidth are very scarce resources in this network. The network lifetime and connectivity of nodes depend on battery power. Therefore, energy is a valuable constraint which should be efficiently used. In this paper we survey various energy efficient routing protocols. The energy efficient routing protocols are classified on the basis of approaches they use to minimize the energy consumption. The purpose of this paper is to facilitate the research work and combine the existing solution and to develop a more energy efficient routing mechanism.
Abstract: The quality of video transmitted by mobile ad hoc networks (MANETs) can be influenced by several factors, including protocol layers; parameter settings of each protocol. In this paper, we are concerned with understanding the functional relationship between these influential factors and objective video quality in MANETs. We illustrate a systematic statistical design of experiments (DOE) strategy can be used to analyze MANET parameters and performance. Using a 2k factorial design, we quantify the main and interactive effects of 7 factors on a response metric (i.e., mean opinion score (MOS) calculated by PSNR with Evalvid package) we then develop a first-order linear regression model between the influential factors and the performance metric.
Abstract: The conventional routing protocol designed for MANET fail to handle dynamic movement and self-starting behavior of the node effectively. Every node in MANET is considered as forward as well receiver node and all of them participate in routing the packet from source to the destination. While the interconnection topology is highly dynamic, the performance of the most of the routing protocol is not encouraging. In this paper, a reliable broadcast approach for MANET is proposed for improving the transmission rate. The MANET is considered with asymmetric characteristics and the properties of the source and destination nodes are different. The non-forwarding node list is generated with a downstream node and they do not participate in the routing. While the forwarding and non-forwarding node is constructed in a conventional way, the number of nodes in non-forwarding list is more and increases the load. In this work, we construct the forwarding and non-forwarding node optimally so that the flooding and broadcasting is reduced to certain extent. The forwarded packet is considered as acknowledgements and the non-forwarding nodes explicitly send the acknowledgements to the source. The performance of the proposed approach is evaluated in NS2 environment. Since the proposed approach reduces the flooding, we have considered functionality of the proposed approach with AODV variants. The effect of network density on the overhead and collision rate is considered for performance evaluation. The performance is compared with the AODV variants found that the proposed approach outperforms all the variants.
Abstract: A Mobile Ad-hoc Network (MANET) is a self managing network consists of versatile nodes that are capable of communicating with each other without having any fixed infrastructure. These nodes may be routers and/or hosts. Due to this dynamic nature of the network, routing protocols are vulnerable to various kinds of attacks. The black hole attack is one of the conspicuous security threats in MANETs. As the route discovery process is obligatory and customary, attackers make use of this loophole to get success in their motives to destruct the network. In Black hole attack the packet is redirected to a node that actually does not exist in the network. Many researchers have proposed different techniques to detect and prevent this type of attack. In this paper, we have analyzed various routing protocols in this context. Further we have shown a critical comparison among various protocols. We have shown various routing metrics are required proper and significant analysis of the protocol.
Abstract: As a node monitoring protocol, which is a part of network management, operates in distributed manner, conformance testing of such protocols is more tedious than testing a peer-to-peer protocol. Various works carried out to give the methodology to do conformance testing of distributed protocol. In this paper, we have presented a formal approach for conformance testing of a Node Monitoring Protocol, which uses both static and mobile agents, for MANETs. First, we use SDL to obtain MSCs, which represent the scenario descriptions by sequence diagrams, which in turn generate test sequences and test cases. Later, Testing and Test Control Notation Version-3 (TTCN-3) is used to execute test cases with respect to generated test sequences to know the conformance of protocol against the given specification. This approach shows, the effective conformance testing of the distributed protocols for the network with varying node density and complex behavior. Experimental results for the protocol scenario represent the effectiveness of the method used.
Abstract: Privacy and Security have emerged as an important research issue in Mobile Ad Hoc Networks (MANET) due to its unique nature such as scarce of resources and absence of centralized authority. There are number of protocols have been proposed to provide privacy and security for data communication in an adverse environment, but those protocols are compromised in many ways by the attackers. The concept of anonymity (in terms of unlinkability and unobservability) and pseudonymity has been introduced in this paper to ensure privacy and security. In this paper, a Secure Onion Throat (SOT) protocol is proposed to provide complete anonymity in an adverse environment. The SOT protocol is designed based on the combination of group signature and onion routing with ID-based encryption for route discovery. The security analysis demonstrates the performance of SOT protocol against all categories of attacks. The simulation results ensure the necessity and importance of the proposed SOT protocol in achieving such anonymity.
Abstract: In this paper, the problem of heat and mass transfer in unsteady MHD boundary-layer flow of nanofluids over stretching sheet with a non uniform heat source/sink is considered. The unsteadiness in the flow and temperature is caused by the time-dependent stretching velocity and surface temperature. The unsteady boundary layer equations are transformed to a system of non-linear ordinary differential equations and solved numerically using Keller box method. The velocity, temperature, and concentration profiles were obtained and utilized to compute the skin-friction coefficient, local Nusselt number, and local Sherwood number for different values of the governing parameters viz. solid volume fraction parameter, unsteadiness parameter, magnetic field parameter, Schmidt number, space-dependent and temperature-dependent parameters for heat source/sink. A comparison of the numerical results of the present study with previously published data revealed an excellent agreement.
Abstract: An aggregate signature scheme can aggregate n signatures on n distinct messages from n distinct signers into a single signature. Thus, n verification equations can be reduced to one. So the aggregate signature adapts to Mobile Ad hoc Network (MANET). In this paper, we propose an efficient ID-based aggregate signature scheme with constant pairing computations. Compared with the existing ID-based aggregate signature scheme, this scheme greatly improves the efficiency of signature communication and verification. In addition, in this work, we apply our ID-based aggregate sig- nature to authenticated routing protocol to present a secure routing scheme. Our scheme not only provides sound authentication and a secure routing protocol in ad hoc networks, but also meets the nature of MANET.
Abstract: A mobile ad hoc network (MANET) is a self configuring network, without any centralized control. The topology of this network is not always defined. The main objective of this paper is to introduce the fundamental concepts of MANETs to the researchers and practitioners, who are involved in the work in the area of modeling and simulation of MANETs. This paper begins with an overview of mobile ad hoc networks. Then it proceeds with the overview of routing protocols used in the MANETS, their properties and simulation methods. A brief tabular comparison between the routing protocols is also given in this paper considering different routing protocol parameters. This paper introduces a new routing scheme developed by the use of evolutionary algorithms (EA) and analytical hierarchy process (AHP) which will be used for getting the optimized output of MANET. In this paper cryptographic technique, ceaser cipher is also employed for making the optimized route secure.
Abstract: A novel idea presented in this paper is to combine
multihop routing with single-frequency networks (SFNs) for a
broadcasting scenario. An SFN is a set of multiple nodes that transmit
the same data simultaneously, resulting in transmitter macrodiversity.
Two of the most important performance factors of multihop
networks, node reachability and routing robustness, are analyzed.
Simulation results show that our proposed SFN-D routing algorithm
improves the node reachability by 37 percentage points as compared
to non-SFN multihop routing. It shows a diversity gain of 3.7 dB,
meaning that 3.7 dB lower transmission powers are required for the
same reachability. Even better results are possible for larger
networks. If an important node becomes inactive, this algorithm can
find new routes that a non-SFN scheme would not be able to find.
Thus, two of the major problems in multihopping are addressed;
achieving robust routing as well as improving node reachability or
reducing transmission power.