Filters








13,847 Hits in 6.2 sec

Analysis of DSR for Dynamic Topology Update Mechanism in LTRT based MANET's
IJARCCE - Computer and Communication Engineering

Nikhil Rathod, Sanghapal Salve, Vikas Suryawanshi, Yogesh Wagh
2015 IJARCCE  
A Wireless ad-hoc network is an autonomous, self-organize distributed, peer to peer network of fix, nomadic or mobile user that communicates over bandwidth constrained wireless links.  ...  By simulation results using network simulator (NS2) we achieve better dynamic topology update mechanism.  ...  Algorithm for DSR Fig. 1 . 1 Wireless ad-hoc network 1.  ... 
doi:10.17148/ijarcce.2015.43100 fatcat:ogg5sp2pffhd3np7dokt6fi3sa

Research on Routing Protocol of Mobile Ad Hoc Network

Ming Fu Tuo, Min Che, J.C.M. Kao, W.-P. Sung
2016 MATEC Web of Conferences  
Routing protocol is an important content of mobile Ad Hoc. The typical mobile Ad Hoc network routing protocols is introduced. The advantages and disadvantages of these routing protocols are analyzed.  ...  A hybrid routing protocol is put forward based on this.  ...  network make the traditional cable network technology can not be directly used in Ad Hoc network, which requires for Ad Hoc network many new protocols and technologies, such as channel access technology  ... 
doi:10.1051/matecconf/20166305022 fatcat:vj3w2dxxovghhjojfqcup6eroa

Routing Protocols in MANET: A Survey

Swati Puri, Vishal Arora
2014 International Journal of Computer Applications  
Some or all of the nodes in an ad hoc network may rely on batteries or other exhaustible means used for their energy.  ...  Mobile means moving and ad hoc means temporary with no any fixed infrastructure so mobile ad hoc networks are a class of temporary networks in which nodes are moving without any fixed infrastructure or  ...  Distributed Spanning Tree (DST) The nodes in the network are grouped into a number of trees. Each tree has two types of nodes; route node, and internal node.  ... 
doi:10.5120/16852-6718 fatcat:ia7dhhz2tjhvjdww44a7ncn4si

Minimum Energy Multicast Routing in Mobile Ad-hoc Network

Mrunali S.Sonwalkar, Ramanna S. Havinal
2013 International Journal of Computer Applications  
It first uses AODV as basic protocol, then we are designing a distributed algorithm for finding the approximate distance between nodes.  ...  A Mobile Ad-hoc Network (MANET) is a collection of mobile nodes. It can be constructed anywhere without any infrastructure. The mobile nodes are equipped with energylimited batteries.  ...  In ad-hoc network the nodes are mobile and their topologies are dynamically changing , therefore it becomes difficult to built a minimum spanning tree.  ... 
doi:10.5120/10781-5762 fatcat:kskmeer24rcotbd4o4dmmf57du

K-clustering in wireless ad hoc networks

Yaacov Fernandess, Dahlia Malkhi
2002 Proceedings of the second ACM international workshop on Principles of mobile computing - POMC '02  
For the special family of graphs that represent ad hoc wireless networks, modeled as unit disk graphs, we introduce a two phase distributed polynomial time and message complexity approximation solution  ...  The first phase constructs a spanning tree of the network and the second phase then partitions the spanning tree into subtrees with bounded diameters.  ...  By setting the weight function according to specified preferences, MST allows for the construction of a spanning tree with predefined attributes for a mobile ad hoc network.  ... 
doi:10.1145/584490.584497 dblp:conf/pomc/FernandessM02 fatcat:oma6qvh2krdbhb5bqipfeafygu

K-clustering in wireless ad hoc networks

Yaacov Fernandess, Dahlia Malkhi
2002 Proceedings of the second ACM international workshop on Principles of mobile computing - POMC '02  
For the special family of graphs that represent ad hoc wireless networks, modeled as unit disk graphs, we introduce a two phase distributed polynomial time and message complexity approximation solution  ...  The first phase constructs a spanning tree of the network and the second phase then partitions the spanning tree into subtrees with bounded diameters.  ...  By setting the weight function according to specified preferences, MST allows for the construction of a spanning tree with predefined attributes for a mobile ad hoc network.  ... 
doi:10.1145/584495.584497 fatcat:msxz7us2ufhgdkt7t4akqii3dq

A Mobile Ad Hoc Network Routing Protocols: A Comparative Study [chapter]

Alagan Ramasamy Rajeswari
2020 Recent Trends in Communication Networks [Working Title]  
Mobile Ad hoc NETworks (MANET), are complex and distributed networks that are dynamic. Which are infrastructure less and multi-hop in nature.  ...  One of the main features of routing protocols in ad hoc network is the routing metric, which is used to select the best route for forwarding packets.  ...  Greedy distributed spanning tree routing (GDSTR) [14] Hull tree approach is used 5.  ... 
doi:10.5772/intechopen.92550 fatcat:b34ndcwnlzgfhpeyydnywacadu

Subarea tree routing algorithm based infrastructure for mobile ad-hoc networks

Omeed Kamal Khorsheed, Prof Dr Abdul Hanan Abdullah
2019 Journal of Advanced Computer Science & Technology  
The main objective of this paper is creating a dynamic sub-area tree infrastructure for Mobile Ad hoc Networks (MANET).  ...  Ad hoc networks are self-organizing and multi-hop networks for data communication. Subarea Tree Routing (STR) has used for multi-hop networks for network division into various subareas.  ...  [8] was proposed a Subarea Tree Routing for Multi-hop Ad-hoc Networks.  ... 
doi:10.14419/jacst.v8i1.19003 fatcat:5asesoljxffynmljgymoi5jily

A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad Hoc Networks

Busola S. Olagbegi, Natarajan Meghanathan
2010 International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks  
This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs).  ...  There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks.  ...  Secure Ad hoc On-Demand Distance Vector (SAODV) Routing Protocol The Secure Ad hoc On-Demand Distance Vector (SAODV) [55] routing protocol is an efficient secure routing protocol for mobile ad hoc networks  ... 
doi:10.5121/jgraphoc.2010.2201 fatcat:iuvltpmdh5ek5n2trvwwudqa2y

A Clustering-based Group Key Agreement Protocol for Ad-Hoc Networks

Maarit Hietalahti
2008 Electronical Notes in Theoretical Computer Science  
Efficient authenticated group key establishment is the pre-requirement for having group-wide encrypted communications in wireless ad hoc networks.  ...  In this paper, several solutions for authenticated key establishment in clustered ad hoc networks are surveyed and a new efficient solution for clustered group key establishment is presented.  ...  In connection with the key agreement protocols, they use auxiliary protocols in order to generate efficient embeddings of logical networks over arbitrary ad hoc networks.  ... 
doi:10.1016/j.entcs.2008.05.005 fatcat:fxtce24ib5dszcztb5rrngwmxu

Self-Stabilization in Dynamic Networks

Toshimitsu MASUZAWA
2009 IEICE transactions on information and systems  
This advantage makes self-stabilizing protocols extremely attractive for designing highly dependable distributed systems on dynamic networks.  ...  in dynamic networks with frequent topology changes.  ...  Because of a rapid increase in the size of distributed systems and development of dynamic distributed systems such as P2P systems and mobile ad hoc systems, self-stabilizing protocols that can tolerate  ... 
doi:10.1587/transinf.e92.d.108 fatcat:aon2azp2kzcipas64piezqp6ui

Multicast overlay spanning trees in ad hoc networks: Capacity bounds, protocol design and performance evaluation

Georgios Rodolakis, Anis Laouiti, Philippe Jacquet, Amina Meraihi Naimi
2008 Computer Communications  
We discuss how these information theoretic results can be taken into consideration in the operation of a multicast protocol for wireless mesh networks using Multicast Overlay Spanning Trees (MOST).  ...  We study the benefits of multicast routing in the performance of wireless ad hoc networks.  ...  As discussed earlier, multicast protocols proposed for wired networks are not adapted to ad hoc networks, because of the frequent changes in tree structure due to the dynamic network topology, in addition  ... 
doi:10.1016/j.comcom.2008.01.019 fatcat:b5ljfkq2qrdqfikm4n4gjyr4di

Survey and New Security methodology of Routing Protocol in AD-Hoc Network

Shahab Wahhab Kareem, Yahya Tareq Hussein
2017 Qalaai Zanist Scientific Journal  
Finally, the proposed algorithm depended on the Dynamic Source Routing (DSR) to remove malicious nodes, minimum spanning tree for routing path plus coding-encryption technique of a chaos-based adaptive  ...  Because of many reasons routing is the complex task in ad hoc sensor network.  ...  minimum span tree for routing path are used.  ... 
doi:10.25212/lfu.qzj.2.2.43 fatcat:g76jf4oz3rc5rks3ou7jecerke

Localized Communication and Topology Protocols for Ad Hoc Networks: A Preface to the Special Section

S. Olariu, D. Simplot-Ryl, I. Stojmenovic
2006 IEEE Transactions on Parallel and Distributed Systems  
hoc network.  ...  Papers were sought to cover comprehensively the algorithmic issues in the "hot" area of ad hoc and sensor networking.  ...  In "Efficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas," Fei Dai and Jie Wu propose a novel broadcast protocol called directional self-pruning (DSP) for ad hoc wireless networks  ... 
doi:10.1109/tpds.2006.50 fatcat:bh3iqmqijfhcjen57zftlwf3se

Distributed Algorithm for Constructing Efficient Tree Topology for Message Dissemination in Vehicular Networks

S. Kamakshi, Sairam Natarajan
2014 International Journal of Vehicular Technology  
In this paper, we propose a new distributed algorithm for constructing an arbitrary spanning tree based on Dynamicity Aware Graph Relabeling System model, which develops a maximum leaf spanning tree in  ...  Dynamicity Aware Graph Relabeling System model provides a framework to construct spanning tree in mobile wireless network.  ...  [7, 8] used the DA-GRS model for constructing the spanning tree and established that the tree topology constructed in Mobile Ad hoc Networks (MANET) and the VANETs have same link characteristics and  ... 
doi:10.1155/2014/903895 fatcat:q4doqqfyvvfshlbuvsujmt73w4
« Previous Showing results 1 — 15 out of 13,847 results