Filters








236 Hits in 5.2 sec

Dominating-Set-Index based Searching Algorithm in Mobile P2P Networks

Cheng Chang, Ye Wang, Jie Sun
2014 Journal of Communications  
Both theoretical analysis and experimental results show that DSI outperforms the existing searching algorithms in MANET, OLSR, local index tree (LIT) and pure flooding, in terms of network workload and  ...  Based on the connected dominating-set (CDS), which overlays the whole Mobile P2P ad hoc network, we propose a dominating-set-index based searching algorithm, named DSI, using dominating set indices to  ...  Local Index is a common technique among these algorithms in MANET.  ... 
doi:10.12720/jcm.9.4.332-342 fatcat:bmzn573f2bhrrdaiakv3nelm2i

WSN13-1: Position-based Routing using Virtual Small World in MANETs

Cong Liu, Jie Wu
2006 IEEE Global Communications Conference, Exhibition, & Industry Forum (GLOBECOM)  
We construct a virtual small world network by adding virtual long links to reduce the chance of a protocol encountering local minima in greedy mode, and thus decrease the chance to invoke inefficient methods  ...  Routing is the foremost issue in mobile ad hoc networks (MANETs), In a wireless environment characterized by small bandwidth and limited computation resources, positionbased routing is attractive because  ...  These algorithms include the Greedy algorithm (G), the Face algorithm (F), the connected dominate set (CDS) used in face mode [5] , the virtual long link (VLL) in Greedy mode, bound eclipse in GOAFR  ... 
doi:10.1109/glocom.2006.964 dblp:conf/globecom/LiuW06 fatcat:dtjpzphfazh2riuqhhqkrdbzhu

Forward-node-set-based broadcast in clustered mobile ad hoc networks

Jie Wu, Wei Lou
2003 Wireless Communications and Mobile Computing  
This is done by choosing a small forward node set that forms a connected dominating set (CDS) to carry out a broadcast process.  ...  In addition, this approach has a constant approximation ratio to the minimum connected dominating set (MCDS) and generates a small forward node set in the average case.  ...  connected dominant set (MCDS).  ... 
doi:10.1002/wcm.109 fatcat:ybwp2i5hobdhlok6bzhyxegl7u

SCALAR: Scalable data lookup and replication protocol for mobile ad hoc networks

Emre Atsan, Öznur Özkasap
2013 Computer Networks  
SCALAR is a virtual backbone based solution, in which the network nodes construct a connected dominating set based on network topology graph.  ...  Data replication, as an essential service for MANETs, is used to increase data availability by creating local or nearly located copies of frequently used items, reduce communication overhead, achieve fault-tolerance  ...  Acknowledgment This study is supported by TUBITAK (The Scientific and Technical Research Council of Turkey) under CAREER Award Grant 104E064. A preliminary version of this work appeared in [38] .  ... 
doi:10.1016/j.comnet.2013.08.012 fatcat:5gsvydcyp5ew5n3d6hdrc5h72m

Comparative Review of QoS-Aware On-Demand Routing in Ad Hoc Wireless Networks

Ning Zhang, Alagan Anpalagan
2010 Wireless Sensor Network  
Finally, a detailed and comprehensive comparison table is provided for better understanding of QoS provision in MANETs.  ...  In this paper, a representative set of QoS models and QoS-aware on-demand routing protocols are reviewed with emphasis on their ability to support QoS in mobile ad-hoc networks (MANETs) possibly used in  ...  The goal of setting up the core is to proactively create a core set such that every node is either a core node or a neighbor of a core node.  ... 
doi:10.4236/wsn.2010.24038 fatcat:hqrclrtza5f5hd67t6eq7x4que

Dynamic routing discovery scheme for high mobility in mobile ad hoc wireless networks

Haider Alani, Maha Abdelhaq, Raed Alsaqour
2020 International Journal of Electrical and Computer Engineering (IJECE)  
In this paper, we proposed a scheme called AODV-Velocity and Dynamic (AODV-VD) for effective broadcast control packets.  ...  An innovative technology that is widely used in many applications is the Mobile Ad-hoc Network (MANET). Discovery and maintenance of routes at MANET are important issues.  ...  ACKNOWLEDGMENT This research was funded by the Deanship of Scientific Research at Princess Nourah bint Abdulrahman University through the Fast-track Research Funding Program.  ... 
doi:10.11591/ijece.v10i4.pp3702-3714 fatcat:n2ile6dxnrdtfbmoeci24voqv4

A Comprehensive Classification of MANETs Routing Protocols

Diaa Eldein Mustafa Ahmed, Othman O. Khalifa
2017 International Journal of Computer Applications Technology and Research  
of the proactive and reactive).However this classification hide other types of MANETs routing protocols play a significant roles nowadays such as(Multicast , Energy and Power-aware, Geographical routing  ...  This paper provides a comprehensive study of MANETs basic taxonomy of routing protocols.  ...  CLASSIFICATION MANETs ROUTING PROTOCOLS Routing is a core problem in networks for sending data from one node to another.  ... 
doi:10.7753/ijcatr0603.1004 fatcat:74in24po4nczrilpb3hvfym4je

Intelligent Broadcasting in Mobile Ad Hoc Networks: Three Classes of Adaptive Protocols

Michael D. Colagrosso
2007 EURASIP Journal on Wireless Communications and Networking  
In the pure machine learning approach, we exhibit a new approach to the design of a broadcast protocol: the decision of whether to rebroadcast a packet is cast as a classification problem.  ...  For each class of learning method, we create a prototypical protocol and examine its performance in simulation.  ...  A theoretical "best-case" bound for choosing which nodes to rebroadcast is called the minimum connected dominating set (MCDS).  ... 
doi:10.1155/2007/10216 fatcat:j6odh6zmg5egvm63op462p3ree

SWING: Small World Iterative Navigation Greedy Routing Protocol in MANETs

Cong Liu, Jie Wu
2006 Computer Communications and Networks  
GFG, forward a message in greedy mode until the message is forwarded to a node that has no neighbor closer to the destination, which is called a local minimum.  ...  First, we construct a virtual small world network by adding virtual long links to the network to reduce the chance of a protocol encountering local minima in greedy mode, and thus decrease the chance to  ...  The algorithms used include the Greedy algorithm (G), the Face algorithm (F), using connected dominate set (CDS) for face mode [4] , using virtual long link (VLL) in Greedy mode, using bound ellipse (  ... 
doi:10.1109/icccn.2006.286299 dblp:conf/icccn/Liu006 fatcat:ljgrmi76h5fkrlfso3b264xgoq

Routing in Mobile Ad Hoc Networks [chapter]

Al-Sakib Khan Pathan, Choong Seon Hong
2009 Computer Communications and Networks  
In this chapter we will learn about the following things: The preliminaries of mobile ad hoc network The challenges for routing in MANET Expected properties of a MANET routing protocol Categories of routing  ...  Because of the movements of nodes, there is a constant possibility of topology change in MANET. Considering this unique aspect of MANET, a number of routing protocols have been proposed so far.  ...  But, OLSR is an optimized version of a pure link state protocol designed for MANET.  ... 
doi:10.1007/978-1-84800-328-6_4 dblp:series/ccn/PathanH09 fatcat:5ssltxsuf5df7crfq25jv5l4ii

Mobile Ad Hoc Networks: A detailed Survey of QoS Routing Protocols

Sanjeev Gangwar, Krishan Kumar
2011 International Journal of Distributed and Parallel systems  
This Article presents a thorough overview of QoS routing metrics, resources and factors affecting performance of QoS routing protocols.  ...  QoS routing protocols are classified according to the QoS metrics used type of QoS guarantee assured.  ...  The core nodes are elected by approximating a minimum dominating set1 of the ad hoc network.  ... 
doi:10.5121/ijdps.2011.2626 fatcat:k5y6y5jw6zeatntvvc32u7ls3a

Virtual-Force-Based Geometric Routing Protocol in MANETs

Cong Liu, Jie Wu
2009 IEEE Transactions on Parallel and Distributed Systems  
First, we construct a virtual small-world network by adding virtual long links to the network to reduce the number of local minima.  ...  Routing is the foremost issue in mobile ad hoc networks (manets).  ...  ACKNOWLEDGMENTS This work was supported in part by US National Science Foundation (NSF) Grants ANI 0073736, EIA 0130806, CCR 0329741, CNS 0422762, CNS 0434533, CNS 0531410, and CNS 0626240.  ... 
doi:10.1109/tpds.2008.103 fatcat:mht236dns5f33ivmnvy7t3z3wq

A Strategic Review of Routing Protocols for Mobile Ad Hoc Networks
English

A. Samuel Chellathurai, E.George Dharma Prakash Raj
2014 International Journal of Engineering Trends and Technoloy  
This has led to the development of many different routing protocols for MANET.  ...  In recent years, a rapid growth of research interests in mobile ad hoc networking has been see.  ...  A Dominator set (DS) of a graph is defined as a set of nodes in the graph such that every node is either present in DS or is a neighbor of some node present in DS.  ... 
doi:10.14445/22315381/ijett-v10p274 fatcat:swqbaycjv5ckzk5ikbftg3spbe

Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks [chapter]

Frederick Ducatelle, Luca Maria Gambardella, Maciej Kurant, Hung X. Nguyen, Patrick Thiran
2006 Lecture Notes in Computer Science  
The second algorithm is a heuristic search that takes capacity constraints in account. Both algorithms are shown to be faster by orders of magnitude than existing solutions.  ...  Next, we present two efficient algorithms for mapping an IP network on an optical network in such a way that it is protected against failures at the optical layer.  ...  The complexity of one iteration of SMART is dominated by the DisjointMap function in Step 2 of the algorithm.  ... 
doi:10.1007/11808107_11 fatcat:jg2dvmfeefdmlndev2fu4gciai

Locating cache proxies in manets

Roy Friedman, Maria Gradinariu, Gwendal Simon
2004 Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '04  
These are superimposed on a Maximal Independent Set (MIS), a Connected Dominating Set (DS), and a novel adaptation of BFS-tree based overlays, where each of these overlays is maintained in a self stabilizing  ...  This paper considers the problem of locating cache proxies in MANETs using several search techniques.  ...  Connected Dominating Set (DS) Based Overlay We start this section by giving a formal definition of a Connected Dominating Set (DS), and then discuss how to obtain a DS based overlay.  ... 
doi:10.1145/989459.989482 dblp:conf/mobihoc/FriedmanGS04 fatcat:yplyh2hnpfe7ribsep4olhmjpa
« Previous Showing results 1 — 15 out of 236 results