A Concept for Mobile Ad-Hoc Messaging Networks (AMNet)

2010 ◽  
pp. 1569-1580
Author(s):  
Stefan Stieglitz ◽  
Christoph Fuchß ◽  
Sascha Stöckel ◽  
Christoph Lattemann

This article shows an innovative approach for an ad-hoc messaging network (AMNET) which uses simple store-and-forward message passing to spread data asynchronously. This approach primarily focuses on application specific needs that can be covered by simple message passing mechanisms. In this paper we will describe a powerful network by using simple devices and communication protocols on the basis of AMNETs. Simulation results of our AMNET approach provide insights into speeding up the network setup process and enable the use of AMNETs even with few participants by introducing a hybrid infrastructure and mobile nodes.

Author(s):  
Stefan Stieglitz ◽  
Christoph Fuchß

This contribution provides an approach for an ad-hoc messaging network (AMNET), which uses simple store-and-forward message passing to spread data asynchronously. This approach focuses primarily on application-specific needs that can be covered by simple message passing mechanisms. In this paper, we will describe a network based on the AMNET approach. Results are derived by scenario analysis to provide insights into speeding up the network setup process and enable the use of AMNETs - even with a limited number of participants - by introducing a hybrid infrastructure and by adding mobile nodes.


2016 ◽  
Vol 2 (2) ◽  
Author(s):  
Amit Singh ◽  
Nitin Mishra ◽  
Angad Singh

 A Wireless Mobile Ad-hoc Network consists of variety of mobile nodes that temporally kind a dynamic infrastructure less network. To modify communication between nodes that don’t have direct radio contact, every node should operate as a wireless router and potential forward knowledge traffic of behalf of the opposite node. In MANET Localization is a fundamental problem. Current localization algorithm mainly focuses on checking the localizability of a network and/or how to localize as many nodes as possible. It could provide accurate position information foe kind of expanding application. Localization provide information about coverage, deployment, routing, location, services, target tracking and rescue If high mobility among the mobile nodes occurs path failure breaks. Hence the location information cannot be predicted. Here we have proposed a localization based algorithm which will help to provide information about the localized and non-localized nodes in a network. In the proposed approach DREAM protocol and AODV protocol are used to find the localizability of a node in a network. DREAM protocol is a location protocol which helps to find the location of a node in a network whereas AODV is a routing protocol it discover route as and when necessary it does not maintain route from every node to every other. To locate the mobile nodes in a n/w an node identification algorithm is used. With the help of this algorithm localized and non-localized node can be easily detected in respect of radio range. This method helps to improve the performance of a module and minimize the location error and achieves improved performance in the form of UDP packet loss, received packet and transmitted packets, throughput, routing overhead, packet delivery fraction. All the simulation done through the NS-2 module and tested the mobile ad-hoc network.


2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
B. Sivakumar ◽  
N. Bhalaji ◽  
D. Sivakumar

In mobile ad hoc networks connectivity is always an issue of concern. Due to dynamism in the behavior of mobile nodes, efficiency shall be achieved only with the assumption of good network infrastructure. Presence of critical links results in deterioration which should be detected in advance to retain the prevailing communication setup. This paper discusses a short survey on the specialized algorithms and protocols related to energy efficient load balancing for critical link detection in the recent literature. This paper also suggests a machine learning based hybrid power-aware approach for handling critical nodes via load balancing.


Author(s):  
DWEEPNA GARG ◽  
PARTH GOHIL

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using centralized access points, infrastructure, or centralized administration. Routing means the act of moving information across an internet work from a source to a destination. The biggest challenge in this kind of networks is to find a path between the communication end points, what is aggravated through the node mobility. In this paper we present a new routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence. Ant colony algorithms are a subset of swarm intelligence and consider the ability of simple ants to solve complex problems by cooperation. The introduced routing protocol is well adaptive, efficient and scalable. The main goal in the design of the protocol is to reduce the overhead for routing. We refer to the protocol as the Ant Colony Optimization Routing (ACOR).


2021 ◽  
Author(s):  
Rajakumar.R ◽  
PandianR ◽  
PremJacob.T ◽  
Pravin.A ◽  
Indumathi.P

The primaryaim of an ad-hoc network routing protocol is accurate and efficient route creation between node pairs so that messages may be delivered promptly. Route creation need to be done with reduced overhead and bandwidth. This paper presents a scheme to reduce bandwidth and power by the hibernation of nodes for a limited time. The effect of our proposal is then studied by simulation under various conditions and the analysis of the simulation results is done to comprehend the working of our protocol in various areas and how it fares in an application specific scenario.


Author(s):  
Sunil Kumar ◽  
Kamlesh Dutta

A Mobile Ad hoc NETwork (MANET) is a self-organizing, infrastructure-less network of mobile nodes connecting by wireless links. In operation, the nodes of MANETs do not have a central control mechanism. It is known for its properties of routable network, where each node acts as a router to forward packets to other specific nodes in the network. The unique properties of MANET have made it useful for large number of applications and led to a number of security challenges. Security in the mobile ad hoc network is a very critical job and requires the consideration of different security issues on all the layers of communication. The countermeasures are the functions that reduce or eliminate security vulnerabilities and attacks. This chapter provides a comprehensive study of all prominent attacks in Mobile Ad Hoc Networks described in the literature. It also provides various proactive and reactive approaches proposed to secure the MANETs. Moreover, it also points to areas of research that need to be investigated in the future.


Author(s):  
Mamata Rath

Mobile ad-hoc network (MANET) has always been a challenging and pioneering wireless network providing magnificent technology support starting from everyday life to disaster and critical environment. In industrial applications and most of the real-world solicitations, the MANET technology greatly suffers due to practical challenges faced by the network, power deficiency, and dynamic topology change being the prominent factors. Many cross-layer platforms supporting real-time applications have been developed by many researchers with the basic intention being maximum utilization of resources in the resource constrained environment of MANET, minimum power consumption using limited residual battery power of the highly transferable mobile nodes. This chapter presents the design of an optimized network layer protocol with delay management and power efficiency.


Author(s):  
J. Kaur ◽  
S. Kaur

Mobile Ad Hoc Networks (MANETs) are comprised of an arrangement of self-sorting mobile hosts furnished with wireless interaction devices gathered in groups without the need of any settled framework as well as centralized organization to maintain a system over radio connections. Every mobile node can react as a host and also, the router freely utilizes the wireless medium inside the correspondence range to deal with the interaction between huge quantities of individual mobile nodes by framing a correspondence system and trading the information among them without using any described group of the base station. A trust-based model in MANET estimates and sets up trust relationship among objectives. Trust-based routing is utilized to keep away data from different attackers like a wormhole, DOS, black-hole, selfish attack and so forth. Trust can be executed in different steps like reputation, subjective rationale and from the supposition of the neighboring node. A trust estimation approach not just watches the behavior of neighbor nodes, additionally it screens the transmission of the information packet in the identification of the route for exact estimation of trust value. A survey is carried out to find some of the limitations behind the existing works which has been done by the researchers to implement various approaches thus to build the trust management framework. Through the survey, it is observed that existing works focused only on the authenticated transmission of the message, how it transmits packets to the destination node securely using a trust-based scheme. And also, it is observed that the routing approach only focused on the key management issues. Certain limitation observed in the implemented approaches of existing work loses the reliability of framework. Thus, to withstand these issues it is necessary to establish a reliable security framework that protects the information exchanged among the users in a network while detecting various misbehaving attacks among the users. Confidentiality, as well as the integrity of information, can be secured by combining context-aware access control with trust management. The performance parameters should be evaluated with the previous works packet delivery ratio, packet drop, detection accuracy, number of false positives, and overhead.


Author(s):  
Hussein Al-Bahadili ◽  
Ali Maqousi ◽  
Reyadh S. Naoum

The location-aided routing scheme 1 (LAR-1) and probabilistic algorithms are combined together into a new algorithm for route discovery in mobile ad hoc networks (MANETs) called LAR-1P. Simulation results demonstrated that the LAR-1P algorithm reduces the number of retransmissions as compared to LAR-1 without sacrificing network reachability. Furthermore, on a sub-network (zone) scale, the algorithm provides an excellent performance in high-density zones, while in low-density zones; it preserves the performance of LAR-1. This paper provides a detailed analysis of the performance of the LAR-1P algorithm through various simulations, where the actual numerical values for the number of retransmissions and reachability in high- and low-density zones were computed to demonstrate the effectiveness and significance of the algorithm and how it provides better performance than LAR-1 in high-density zones. In addition, the effect of the total number of nodes on the average network performance is also investigated.


Author(s):  
Reshmi. T.R ◽  
Shymala L ◽  
Sandhya. M.K

Mobile ad-hoc networks (MANETs) are composed of mobile nodes connected by wireless links without using any pre-existent infrastructure. Hence the assigning of unique IP address to the incoming node becomes difficult. There are various dynamic auto configuration protocols available to assign IP address to the incoming nodes including grid based protocol which assigns IP address with less delay and low protocol overhead. Such protocols get affected by presence of either selfish nodes or malicious nodes. Moreover there is no centralized approach to defend against these threats like in wired network such as firewall, intrusion detection system, proxy etc. The selfish nodes are the nodes which receive packet destined to it and drop packet destined to other nodes in order to save its energy and resources. This behavior of nodes affects normal functioning of auto configuration protocol. Many algorithms are available to isolate selfish nodes but they do not deal with presence of false alarm and protocol overhead. And also there are certain algorithms which use complex formulae and tedious mathematical calculations. The proposed algorithm in this paper helps to overcome the attack of selfish nodes effect in an efficient and scalable address auto configuration protocol that automatically configures a network by assigning unique IP addresses to all nodes with a very low protocol overhead, minimal address acquisition delay and computational overhead.


Sign in / Sign up

Export Citation Format

Share Document