Message-Based Routing in Mobile Networks

2011 ◽  
pp. 1-12
Author(s):  
Stefan Stieglitz ◽  
Christoph Fuchß
Keyword(s):  
Mobile Networks ◽  
Scenario Analysis ◽  
Message Passing ◽  
Ad Hoc ◽  
Mobile Nodes ◽  
Store And Forward ◽  
Application Specific

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.

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

2010 ◽  
pp. 1569-1580
Author(s):  
Stefan Stieglitz ◽  
Christoph Fuchß ◽  
Sascha Stöckel ◽  
Christoph Lattemann
Keyword(s):  
Message Passing ◽  
Ad Hoc ◽  
Communication Protocols ◽  
Innovative Approach ◽  
Mobile Nodes ◽  
Simulation Results ◽  
Mobile Ad Hoc ◽  
Store And Forward ◽  
Application Specific

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.

scholarly journals ANALYSIS AND CHOICE OF ROUTING PROTOCOLS IN WIRELESS AD HOC NETWORKS BASED ON THE USE THE NEURAL NETWORK

2019 ◽  
Vol 9 (1) ◽  
pp. 53-55 ◽  
Author(s):  
Oleksandr Oksiiuk ◽  
Vadym Krotov
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Mobile Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Local Area ◽  
Rapid Expansion ◽  
Mobile Nodes ◽  
Hoc Networks ◽  
Wireless Mobile

In the past few years, we have seen a rapid expansion in the field of mobile computing due to the proliferation of inexpensive, widely available wireless devices. However, current devices, applications and protocols are solely focused on cellular or wireless local area networks (WLANs), not taking into account the great potential offered by ad hoc networking. Ad hoc networks are wireless mobile networks that can operate without infrastructure and without centralized network management. In such networks, the wireless mobile nodes may dynamically enter the network as well as leave the network. Mobility and dynamic topology are the main characteristics of ad hoc networks. In the last years, the hundreds of new routing protocols were designed, that are used for the various scenarios of this design space. The routing features in wireless ad hoc networks are described. The corresponding routing protocols are reviewed. The paper proposes a method for selecting the preferred protocol wireless networks using the mathematical tools of neural networks.

Localization and Non-Localization Node Identification Using Dream in MANET

2016 ◽  
Vol 2 (2) ◽  
Author(s):  
Amit Singh ◽  
Nitin Mishra ◽  
Angad Singh
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Fundamental Problem ◽  
Identification Algorithm ◽  
Mobile Nodes ◽  
Position Information ◽  
Location Services ◽  
Wireless Router ◽  
Mobile Ad Hoc

 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.

Modification in Aodv Protocol for Prevention from Black Hole Attack in Manets

2016 ◽  
Vol 6 (1) ◽  
Author(s):  
Divya Singh ◽  
Sumit Jalan
Keyword(s):  
Black Hole ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Source Node ◽  
Destination Node ◽  
Mobile Nodes ◽  
Black Hole Attack ◽  
Extra Effort ◽  
Adjacent Node ◽  
Aodv Protocol

In Wireless ad-hoc network, the infrastructure of MANET's differ to each other due to the topology of MANETs changes time to time because the mobile nodes of MANET's are movable. In MANETs protocols, if any node wants to communicate with another node then they establish a path with the help of adjacent node due to this the security in MANETs protocol is vulnerable. Thus, there are various types of attacks are try to break the security of MANETs protocol. AODV is a popular and most usable protocol of MANET and Black Hole Attack is a severe attack that affects the functionality of AODV protocol. The malicious node treat to the source node which have freshest and nearest path for the destination. In this work, my prime focus specifically is on follow the security against Black Hole Attack. I proposed AODV protocol capture some extra effort for source node and destination node which based on best possible effort (heuristic) with appropriate simulation using ns-2.35.

scholarly journals Cooperative Localization for Mobile Networks: A Distributed Belief Propagation–Mean Field Message Passing Algorithm

2016 ◽  
Vol 23 (6) ◽  
pp. 828-832 ◽  
Author(s):  
Burak Cakmak ◽  
Daniel N. Urup ◽  
Florian Meyer ◽  
Troels Pedersen ◽  
Bernard H. Fleury ◽  
...  
Keyword(s):  
Mobile Networks ◽  
Message Passing ◽  
Belief Propagation ◽  
Mean Field ◽  
Cooperative Localization ◽  
Message Passing Algorithm

scholarly journals Mobility-Assisted on-Demand Routing Algorithm for MANETs in the Presence of Location Errors

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Trung Kien Vu ◽  
Sungoh Kwon
Keyword(s):  
Ad Hoc ◽  
Routing Algorithm ◽  
Mobility Prediction ◽  
Location Awareness ◽  
Mobile Nodes ◽  
Location Errors ◽  
On Demand ◽  
Demand Routing ◽  
Hoc Networks ◽  
The Impact

We propose a mobility-assisted on-demand routing algorithm for mobile ad hoc networks in the presence of location errors. Location awareness enables mobile nodes to predict their mobility and enhances routing performance by estimating link duration and selecting reliable routes. However, measured locations intrinsically include errors in measurement. Such errors degrade mobility prediction and have been ignored in previous work. To mitigate the impact of location errors on routing, we propose an on-demand routing algorithm taking into account location errors. To that end, we adopt the Kalman filter to estimate accurate locations and consider route confidence in discovering routes. Via simulations, we compare our algorithm and previous algorithms in various environments. Our proposed mobility prediction is robust to the location errors.

scholarly journals Energy Efficient and robust routing with RPAR Protocol in Ad Hoc Networks

2017 ◽  
Vol 7 (1.1) ◽  
pp. 477
Author(s):  
Joshua Reginald Pullagura ◽  
D Venkata Rao
Keyword(s):  
Ad Hoc Networks ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Life Time ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Energy Efficient Routing ◽  
Hop Count ◽  
Routing Mechanism ◽  
Hoc Networks

In ad hoc network, the topology of network changes frequently due to the mobile nature of nodes where the communication is possible without any fixed network infrastructure. Mobile nodes are battery operated and so energy efficient routing should be provided which increases the network life time. The existing routing mechanisms do not consider both hop count and energy of nodes for data transmission. In this paper we propose a routing mechanism where data transfer from source to destination is based on the minimum hop count and residual energy of mobile nodes. The proposed RPAR protocol shows better performance when compared to existing Energy power aware routing  protocol .The analysis is carried out by using network simulator (NS-2), the simulation results shows that the proposed routing mechanism provides energy efficient and reliable  routing in ad hoc networks.

scholarly journals A proposed routing scheme for power reduction in wireless networks

2013 ◽  
Vol 3 (1) ◽  
pp. 20 ◽  
Author(s):  
Dalia Elewely ◽  
Marwa Areed ◽  
Hesham Ali
Keyword(s):  
Wireless Networks ◽  
Ad Hoc ◽  
Power Saving ◽  
Ad Hoc Wireless Networks ◽  
Mobile Nodes ◽  
Routing Scheme ◽  
Routing Strategy ◽  
Network Operation ◽  
Dynamic Source ◽  
Hoc Networks

Ad-hoc networks consist of a set of mobile nodes with a restricted power supply resources that can communicate with each other without any established infrastructure or centralized administration. The loss of some nodes may cause significant topological changes, undermine the network operation, and affect the lifetime of the network. This paper discusses the energy consumption problem and summaries the existing power saving techniques in ad-hoc wireless networks. The main objective of this paper is to introduce a new power aware multi-path node disjoint routing scheme based on the Dynamic Source Routing protocol (DSR), which can prolong MANETs lifetime, reduce routing delay and increase the reliability of the packets reaching its destination. Therefore, a comprehensive study of DSR protocol has been drawn using NS-2 simulator, to evaluate the performance of DSR as a routing strategy and investigate its efficiency in saving wireless networks resources, as a prelude to avoid its performance shortcomings in our proposed routing scheme. Keywords: Power aware protocol, node disjoint, network simulation 2, multipath routing, Dsr protocol, ad-hoc network.

Sign in / Sign up

Export Citation Format

Share Document