Mobile Ad-hoc Networks Research Papers (original) (raw)

Power Control in Mobile Ad Hoc networks is a critical issue, since nodes are powered by batteries.The main idea of power control schemes is to use different power levels for RTS/CTS and DATA/ACK. These schemes may degrade network throughput and reduce energy efficiency of the network. In this paper we have evaluated the performance of Improved Autonomous Power Control MAC Protocol (IAPCMP),that allows nodes to dynamically adjust power levels for transmission of DATA/ACK according to the distance between the transmitter and its neighbors.In IAPCMP power level for transmission of RTS/CTS is also adjustable. This also used maximum power level for transmitting DATA/ACK periodically to make neighboring nodes aware about ongoing transmission. The performance of IAPCMP is evaluated through the metrics namely, packet delivery ratio and rate of energy efficiency.The simulation results show significant improvement in protocol.

- by
- •
- Social Networks, Mobile Ad Hoc Networks, Wireless Communications, Social Networking
- by Kashif Laeeq
- •
- Information Security, Computer Security, Cryptography, Security Issues

Mobile Ad Hoc Networks (MANETs) are more vulnerable to different attacks. Prevention methods as
cryptographic techniques alone are not sufficient to make them secure; therefore, efficient intrusion
detection must be deployed and elaborated to facilitate the identification of attacks. An Intrusion Detection
System (IDS) aims to detect malicious and selfish nodes in a network. The intrusion detection methods used
normally for wired networks can no longer adequate when adapted directly to a wireless ad-hoc network,
so existing techniques of intrusion detection have to be changed and new techniques have to be determined
to work efficiency and effectively in this new network architecture of MANETs. In this paper we give a
survey of different architectures and methods of intrusion detection systems (IDSs) for MANETs
accordingly to the recent literature.

From the radar and military research world's, the Ultra-WideBand Impulse Radio (UWB-IR) was adopted in the telecommunications world in the 1990'. Currently, the UWB-IR technology is an interesting candidate for close range Wireless Sensors Networks (WSNs). It is particularly attractive for industrial sensor networks due to its resilience to multipath interference, simple transceiver circuitry, accurate ranging ability, and low transmission power. In order to secure data and communications in the Ad-Hoc UWB-IR networks, UWB-IR requires suitable encryption protocols. In this paper, we review and summarize the IEEE 802.15.4 security sub-layer protocol of UWB-IR based Symmetric Key Cryptography scheme. Then, we highlight the different vulnerabilities and weaknesses present in this type of scheme. Finally, we prove, after a deep examination of multiple Public Key Cryptography (PKC) schemes, that the certificateless one is the most suitable for Ad-Hoc UWB-IR networks characterized by nodes mobility. Indeed, we have also evaluated and analyzed the different public key cryptosystems (PKCS) and concluded that NTRU is the most optimum public key cryptosystem to be used with the certificateless scheme in order to secure data and communications in Ad-Hoc UWB-IR Networks. This is due to the fact that it is the fastest PKCS to provide different security levels at a high speed with very constrained resources.

Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multipath protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.

Cooperative communication uses other communication devices to relay transmission. Relay selection plays a vital in improving the performance of cooperative communication. Some works have been done on relay selection in cooperative communications. This research proposes a new practice for selecting the optimal relay in cooperative communication. The proposed work considers RSSI, residual energy and the distance factors i.e., the "suitability" score is based on the above three measures, which can be used to determine the relay node. Since when the potential relay say x is closer to the destination, the channel quality between them is better, moreover fewer collisions would occur as there are less
number of potential relays closer to the destination than x and selecting the node with sufficient residual energy as relay would withstand throughout the duration of retransmission.

- by Muralidhar Kurni
- •
- Wireless Communications, RSSI, Distance, Relay Selection

The use of social networks is still confined to infrastructure-based networks such as the Internet. However, many situations (conferences, fairs, etc.) may require the implementation and rapid deployment of an ad-hoc application for disseminating information: we call this type of application, Ad-hoc Social Network. These applications are necessarily distributed, deployable on mobile units, etc. They therefore inevitably share the same characteristics as those inherent in ad-hoc mobile networks and make them good candidates for their deployment. In this paper, by using techniques from the field of generative programming, we propose an approach to produce environments for generating such applications from their specifications in a domain-specific language. By applying this approach, we have developed SMGenerator, an environment for generating mobile ad-hoc social network applications for Android devices. Moreover by using SMGenerator, we easily generated the ConfInfo application: an ad-hoc social network application for disseminating information to participants in a scientific manifestation.

Numerous studies have analyzed the performances of routing protocols in mobile Ad-hoc networks (MANETs); most of these studies vary at most one or two parameters in experiments and do not study the interactions among these parameters. Furthermore, efficient mathematical modeling of the performances has not been investigated; such models can be useful for performance analysis, optimization, and prediction. This study aims to show the effectiveness of the response surface methodology (RSM) on the performance analysis of routing protocols in MANETs and establish a relationship between the influential parameters and these performances through mathematical modeling. Given that routing performances usually do not follow a linear pattern according to the parameters; mathematical models of factorial designs are not suitable for establishing a valid and reliable relationship between performances and parameters. Therefore, a Box–Behnken design, which is an RSM technique and provides quadratic mathematical models, is used in this study to establish a relationship. The obtained models are statistically analyzed; the models show that the studied performances accurately follow a quadratic evolution. These models provide invaluable information and can be useful in analyzing, optimizing, and predicting performances for mobile Ad-hoc routing protocols.

Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR.

In this paper, a dynamic K-means algorithm to improve the routing process in Mobile Ad-Hoc networks (MANETs) is presented. Mobile ad-hoc networks are a collocation of mobile wireless nodes that can operate without using focal access points, pre-existing infrastructures, or a centralized management point. In MANETs, the quick motion of nodes modifies the topology of network. This feature of MANETS is lead to various problems in the routing process such as increase of the overhead massages and inefficient routing between nodes of network. A large variety of clustering methods have been developed for establishing an efficient routing process in MANETs. Routing is one of the crucial topics which are having significant impact on MANETs performance. The K-means algorithm is one of the effective clustering methods aimed to reduce routing difficulties related to bandwidth, throughput and power consumption. This paper proposed a new K-means clustering algorithm to find out optimal path from source node to destinations node in MANETs. The main goal of proposed approach which is called the dynamic K-means clustering methods is to solve the limitation of basic K-means method like permanent cluster head and fixed cluster members. The experimental results demonstrate that using dynamic K-means scheme enhance the performance of routing process in Mobile ad-hoc networks.

— A Mobile Ad-hoc Networks (MANETs) which is composed of a group of mobile and wireless nodes and completely infrastructure less. There are several issues needed to be addressed for smooth and effective functioning of MANET e.g. security, energy conservation, quality of service etc. One such issue for almost all kinds of mobile nodes supported by battery powers is energy conservation. Energy is a limited resource; hence, how to extend the lifetime of batteries is an important issue, particularly for MANET, Which is completely supported by batteries. This paper focuses on the extension of network lifetime. We propose a novel energy efficient DSR (Dynamic Source Routing) routing protocol which will be modified to improve the networks lifetime in MANET.

Deterministic channel models have been widely used in simulation and modeling of ad hoc network for a long time. But, deterministic channel models are too simple to represent a real-world ad hoc network scenario. Recently, random channel models have drawn considerable attention of the researchers in this field. The results presented in the literature show that random channel models have a grave impact on the performance of an ad hoc network. A comprehensive investigation on this issue is yet to be available in the literature. In this investigation, we consider both deterministic and random channel models to investigate their effects on ad hoc networks. We consider two different types of routing protocols namely single path and multipath routing protocols. We choose Destination Sequence Distance Vector (DSDV), Dynamic Source Routing Protocol (DSR), and Ad-hoc On-Demand Distance Vector (AODV) as the single path routing protocols. On the other hand, we choose Ad-hoc On-Demand Multiple Path Distance Vector (AOMDV) as the multipath routing protocol. The results show that some single path routing protocol can outperform multipath routing protocol under both deterministic and random channel conditions. These results surprisingly contradict the popular claim that multipath routing protocol always outperforms single path routing protocol. A guideline for choosing an appropriate routing protocol for adhoc network has also been provided in this work.