نتایج جستجو برای: probabilistic routes

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

Journal: :CoRR 2010
Sharmila Sankar V. Sankaranarayanan

A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols which broadcasts control packets to discover routes to the destination nodes, generate a high number of broadcast packets in a larger networks causing contention and collision. We propose ...

2010
Xavier Vilajosana Jordi Llosa Jose Carlos Pacho Ignasi Vilajosana Angel A. Juan José López Vicario Antoni Morell

As Wireless Sensor Networks are being adopted by industry and agriculture for large-scale and unattended deployments, the need for reliable and energy-conservative protocols become critical. Physical and Link layer efforts for energy conservation are not mostly considered by routing protocols that put their efforts on maintaining reliability and throughput. Gradient-based routing protocols rout...

2009
Christoph Koch Dan Olteanu Lyublena Antova Jiewen Huang

2011
Gaurav Khandelwal Giridhar Prasanna Chittaranjan Hota

Mobile ad-hoc networks pose real difficulty in finding the multihop shortest paths because of continuous changing positions of the nodes. Traditional ad-hoc routing protocols are proposed to find multi-hop routes based on shortest path routing algorithms, which cannot effectively adapt to time-varying radio links and network topologies of Ad-hoc networks. In this paper we proposed an enhanced r...

2015
Reshef Meir David C. Parkes

We put forward a new model of congestion games where agents have uncertainty over the routes used by other agents. We take a non-probabilistic approach, assuming that each agent knows that the number of agents using an edge is within a certain range. Given this uncertainty, we model agents who either minimize their worst-case cost (WCC) or their worst-case regret (WCR), and study implications o...

2014
Jagdish Patil Deepak Singh Chouhan

Opportunistic networks are one of the most interesting evolutions of MANETs. In opportunistic networks, route connecting to the mobile nodes never exits, mobile nodes communicate with each other when they got opportunity to communicate. Furthermore, nodes are not supposed to possess or acquire any knowledge about the network topology. Routes are built dynamically, while messages are route betwe...

Journal: :bulletin of the iranian mathematical society 2011
m. alimohammady b. lafuerza–guillen r. saadati

Journal: :international journal of industrial engineering and productional research- 0
r. sadeghian g.r. jalali-naini j. sadjadi n. hamidi fard

in this paper semi-markov models are used to forecast the triple dimensions of next earthquake occurrences. each earthquake can be investigated in three dimensions including temporal, spatial and magnitude. semi-markov models can be used for earthquake forecasting in each arbitrary area and each area can be divided into several zones. in semi-markov models each zone can be considered as a state...

2014
Richa Sharma Maninder Singh Nehra

Mobile Ad Hoc Networks provides important control and route establishment functionality for a number of unicast and multicast protocols. To discover an effective and an efficient routing protocol for transmit information from source to destination across whole network topology. This is a main issue in networking research. Broadcasting is important in MANET for routing information discovery, pro...

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

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