نتایج جستجو برای: packet fake routing

تعداد نتایج: 94560  

2014
Marwan Aziz Mohammed

Mobile Ad hoc Networks (MANET’s) have become increasingly popular in infrastructure-less mobile wireless communication system. Nodes of these kinds of networks function as a router which discovers and maintains the route to the other nodes in the networks. Route discovery and packet forwarding operations need an efficient routing protocol. Ad-Hoc on Demand Distance Vector Routing Protocol (AODV...

Journal: :IJWMC 2014
Raed A. Alsaqour Maha S. Abdelhaq Rashid A. Saeed Mohammed Al-Hubaishi Ola Alsaqour Mueen Uddin Tariq Alahdal

Position-based routing protocols have become increasingly popular in mobile ad-hoc networks because they can use geographical node position information to route data packets to their destinations. Each node periodically sends its geographical position information to its neighbours by using beacon packets. Data packet routing in position-based routing protocols uses the neighbours’ position info...

2012
Jimin Lee Hoon-gyu Choi Yanghee Choi

In Content Centric Network, name-based routing may not scale because the number of content names will be orders of magnitude higher than IP prefixes. To address the scalability problem, we propose routing schemes that exploits the autonomous system numbers and domain names. For intradomain routing, routers use the splitted routing table by using hashed value of domain names. For inter-domain ro...

Journal: :TIIS 2014
HyungJune Lee

We present joint radio selection and relay scheme that delivers data from a source to a sink in heterogeneous stationary sensor networks consisting of various radio interfaces. The proposed scheme finds the optimal relay nodes and their corresponding radio interfaces that minimize energy consumption throughout the network while satisfying the end-to-end packet deadline requirement. We formulate...

2003
Rahul Ratan A. Y. Oruç

In this paper we characterize the features of good packet routing schemes for input queued sparse crossbar based packet concentrators and propose a polling based routing algorithm which achieves near optimal performance. It has been shown by the authors of this paper that the performance of an input queued packet concentrator with different input and output packet rates can be modeled by a GI/D...

2004
YueQuan Chen Xiaofeng Guo QingKai Zeng Guihai Chen

The dynamic changes of the topology caused by the movement of nodes makes routing become one of the key problems in the mobile Ad Hoc Networks (MANET). So how to optimize routing becomes a hot and difficult topic, among which optimizing routing cache is one of the key techniques. In this paper, we propose an adaptive dynamic cache routing (DCR) strategy based on DSR (Dynamic Source Routing), wh...

2015
Satveer Kaur Jagpal Singh Ubhi

The fundamental characteristic which differentiates MANETs from other wireless or wired network is mobility and node density. Mobile Wireless Ad Hoc Networks (MANET) is a network without infrastructure, where every node functions as transmitter, router and data sink. Therefore, MANET routing protocols are designed to adaptively cater for dynamic changes in topology while maximizing throughput a...

Journal: :J. Parallel Distrib. Comput. 1991
Sanguthevar Rajasekaran Richard Overholt

Packet routing is an important problem in parallel computation since a single step of inter-processor communication can be thought of as a packet routing task. In this paper we present an optimal algorithm for packet routing on a mesh-connected computer. Two important criteria for judging a routing algorithm will be 1) its run time, i.e., the number of parallel steps it takes for the last packe...

1992
Sanguthevar Rajasekaran Richard Overholt

Packet routing is an important problem in parallel computation since a single step of inter-processor communication can be thought of as a packet routing task. In this paper we present an optimal algorithm for packet routing on a mesh-connected computer. Two important criteria for judging a routing algorithm will be 1) its run time, i.e., the number of parallel steps it takes for the last packe...

2015
Ying-Chiang Cho

Original scientific paper Under the delay tolerant network, high mobility of the node and the transmission distance make it impossible to keep a durable and regular data routing path between two nodes. As a result, such failure affects the function of packet routing mechanism. Therefore, in order to improve the efficacy of data transmission, conventional delay tolerant routing adopts more packe...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید