Review on Analysis of Latency of Stateless Opportunistic Forwarding in Intermittently Connected Networks

International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056
Volume: 09 Issue: 08 | Aug 2022 www.irjet.net p-ISSN: 2395-0072
© 2022, IRJET | Impact Factor value: 7.529 | ISO 9001:2008 Certified Journal | Page 991
Review on Analysis of Latency of Stateless Opportunistic
Forwarding in Intermittently Connected Networks
Sarita Verma1, Dr. Rishi Asthana2
1M.Tech, Electronics & Communication Engineering, Goel Institute of Technology and Management, Lucknow,
India
2 Professor, Dept. of Electronics & Communication Engineering, Goel Institute of Technology and Management,
Lucknow, India
-------------------------------------------------------------------------***------------------------------------------------------------------------
Abstract—This research paper clarify about the we
show a stage progress peculiarity in arithmetical
availability of little world organizations. Logarithmic
availability of a chart is the second littlest eigenvalue of
its Laplacian lattice and a proportion of speed of taking
care of agreement issues in networks. We show that it
is feasible to drastically build the arithmetical
availability of a normal complex organization by
multiple times or more without adding new
connections or hubs to the organization. This infers
that an agreement issue can be addressed unbelievably
quick on specific little world organizations bringing
about an organization plan calculation for ultrafast
data organizations. Our review depends on a method
called "arbitrary revamping". Broad mathematical
outcomes are given to help our cases and guesses. We
demonstrate that the mean of the mass Laplacian range
of a perplexing organization stays invariant under
arbitrary reworking.
Keywords: Logarithmic, Laplacian lattice, perplexing,
network.
1. INTRODUCTION
Systems administration is at long last turning out to be
universally sent, to a great extent because of the
combination of portable communication and handheld
processing. Current cell phones ordinarily have at least one
remote interfaces.[1] The applications which are usually
sent on such gadgets, notwithstanding, are seldom ready to
completely take advantage of this neighborhood remote
availability, and on second thought use it just as a method
for getting worldwide network through passages[31][81].
Numerous prior late examination endeavors have raised
this vision by zeroing in basically on essential properties of
irregular strolls. For instance, in [4] the creators resolved
the issue of information gathering in huge scope WSNs with
static sensor hubs and one versatile authority hub that
plays out an arbitrary stroll on a square cross section[21].
At whatever point the gatherer hub enters the transmission
scope of a sensor hub, the information are collected[5]. In
this unique situation, the creators inferred logical limits for
the normal number of particular visited sensor hubs inside
a given time span[75]. To further develop this presentation
metric, they proposed a commonsense calculation that
compels the arbitrary walk and approved it by
reproductions. Compelled irregular walk methods,
currently recommended in [22] for multipath steering,
enjoy the benefit to accomplish load adjusting property in
uncontrolled elements portrayed by arbitrary ON-OFF
advances to save energy. Other than the heap adjusting
property, which is hard to accomplish for other directing
conventions, it is likewise demonstrated in [23] that an
irregular walkbased steering in customary designed WSNs
burns-through a similar measure of energy as the most
limited way steering given that messages are of little size,
which portrays numerous WSN applications[32]. Years and
years earlier, In most designing and organic complex
frameworks, the hubs have an elements—they are not
names or names of entertainers[24]. As such, "reality"
designing organizations are interdependence of dynamic
frameworks[33]. The equivalent addresses expansive
instances of natural organizations including quality
organizations and coupled neural oscillators[25][65].
According to the point of view of frameworks and control
hypothesis, the security properties of aggregate elements of
organizations of dynamic specialists is of interest[34]. This
inspires investigation of unearthly properties of
complicated organizations. Previously, the investigation of
otherworldly properties of arbitrary organizations has been
given little consideration[26]. This exploration paper is an
arrangements towards understanding the conduct of
spectra Laplacian of mind boggling organizations and its
application in plan of ultrafast data organizations[35].
Customary organizations with for the most part fixed
geography and bountiful transmission capacity, stockpiling,
and energy assets can bear a "proactive" steering way to
deal with monitor the topological changes and develop an
exact directing arrangement for the sending calculations
every now and then[27][85]. Notwithstanding, in the
arising correspondence and data organizations—alleged
discontinuously associated networks, for example, remote
sensor organizations, a specific class of portable specially
appointed organizations, and deferral lenient organizations,
there might be regular disturbances of organization

availability[28]. For example, the transferring handset hubs
in sensor organizations might be performing specially
appointed obligation cycling to save energy, though the
portable parcel transporters in delay-lenient
organizations[71] might be briefly too far[36]. Without a
trace of solid start to finish network, flooding or pestilence
spread to each accessible neighbor can absolutely
accomplish a decent parcel conveyance proportion[37].
Notwithstanding, these methodologies are additionally very
asset serious[29]. A less complex methodology is to utilize
stateless entrepreneurial sending to such an extent that the
bundle is sent to one of the following accessible neighbors
aimlessly,[63] as a "irregular stroll" on the basic
organization, paying little mind to the way went by the
parcel up to this point, until it either arrives at the ideal
objective or lapses[30].
In this paper area I consist of the introduction, section II
contains the related work details, section III introduced
about Manet, section IV explain about manet routing
protocol, section V provide details of manet network
security, section VI explains about attack in manet, section
VII provide conclusion of this paper.
2. RELATED WORK
Chi-Kin Chauet. al. (2011), [1] Stateless deft sending is a
straightforward issue open minded circulated conspire for
parcel conveyance, information social event, and data
questioning in discontinuously associated networks
through which bundles are sent to the following accessible
acquaintance in a "arbitrary walk" style until they arrive at
their planned objections or lapse. It has been utilized in
assorted circumstances, for example, when: 1) the
worldwide organization geography isn't known or is
exceptionally powerful; 2) the accessibility of the following
jump neighbors isn't effectively controllable; or 3) the
transferring hubs are computationally compelled.
Information conveyance in sensor organizations, specially
appointed organizations, and deferral lenient organizations
are notable applications other than looking in shared
organizations. A significant test for stateless shrewd
sending is the trouble to anticipate the start to finish
inactivity[43]. To work with inertness assessment, we
concentrate on an improved on model of stateless
pioneering sending, in particular a "weighted arbitrary
stroll" in a limited diagram. This paper makes a few
commitments toward the examination of this model.
Pan Hui,et.al.,2006, [2]The Internet is worked around the
supposition of contemporaneous start to finish network.
This is at chances with what normally occurs in portable
systems administration, where cell phones measure
enclosed by reef of availability, having freedom to
communicate bundles through their remote interface or
basically conveying the information toward a network
island. We come up with Pocket Switched Networking, a
correspondence worldview which mirrors the truth looked
by the portable client. Pocket Networking falls under DTN.
We portray the difficulties that this methodology involves
and furnish proof that it is possible with the present
innovation.
IssamMabrouki, et. al., 2019, [3], Lately, plan of remote
sensor networks utilizing philosophies and instruments
from different disciplines has acquired fame for tending to
many systems administration viewpoints and giving more
adaptable and strong calculations. We address in this paper
the issue of arbitrary stroll to show directing for
information gathering in remote sensor organizations.
While from the beginning, this methodology might appear
to be excessively shortsighted and profoundly wasteful,
many empowering results that demonstrate its equivalence
with different methodologies have been gotten throughout
the long term.[77] In this methodology, a bundle produced
from a given sensor hub plays out an irregular movement
until arriving at a sink hub where it is gathered[44]. The
target of this paper is to give a logical model to assess the
exhibition of the imagined directing plan with uncommon
consideration regarding two measurements: the mean
framework information gathering delay and the incited
spatial appropriation of energy utilization. The
fundamental outcome shows that this methodology
accomplishes satisfactory execution for applications
without too rigid QoS [68] necessities gave that the
proportion of sink hubs over the complete number of
sensor hubs is painstakingly tuned.
Vijay Erramilli, et. al., 2007,[4] We concentrate on the way
blast peculiarity both logically and experimentally. Our
outcomes feature the significance of inconsistent contact
collection across hubs for recognition the exhibition of
sending calculations. We additionally observe that an
assortment of notable sending calculations show shockingly
comparative execution in our setting and we decipher this
reality considering the way blast peculiarity.
Chen Avin, et. al., 2008, [5] Propelled by genuine
organizations and utilization of calculations dependent on
irregular strolls on these organizations we concentrate on
the basic arbitrary strolls on unique undirected charts, i.e.,
diagrams that are changed by embedding or erasing
perimeter at each progression about the walk. We are keen
on the normal pace expected to inspect every vertices of
suchlike a unique diagram, the cover time, under the
presumption that the chart is being adjusted by a neglectful
enemy. It is notable that on constant desultory charts the
overall delay is polynomial in the proportion of the
diagram, unexpectedly and fairly strangely, we focused a
light that there are enemy procedures that power the
normal cover season of compelling diagrams to be
outstanding, and detail this outcome to the cover season of

passive coordinated diagrams. Moreover we give a
straightforward procedure, the languid irregular walk, that
ensures polynomial cover time paying little heed to the
progressions made by the foe.
J. Redi, et. al., 2008, [6] Remote organizations are frequently
daintily utilized. Some remote organizations, most
remarkably sensor organizations, are additionally energy
obliged that is, the timeframe during which the
organization is functional relies upon battery lifetime[45].
We have planned and reenacted a clever plan for a versatile
specially appointed organization with a low offered heap
(of around 1% normal stacking) that utilizes significantly
less (frequently multiple steps or 99.7% less) intensity than
manufactory accepted conventions but accomplishes higher
conveyance dependability, handles generously more
noteworthy hub densities, upholds portability, and can
achieve more considerably under strong provided energy. A
few developments were needed to accomplish this
productivity, most eminently the plan of a double radio
handset and cautious overhaul of the convention stack
(physical, media access, steering and transport
conventions) to utilize the force of the radio handsets.
Comparisons between different algorithms-:
When, Alpha= 1.5
Success
Rate
Routing
Overhead
Average End
to End Delay
Flooding 99.8 103 .74
Expanding
Ring
99.6 97 .92
Random Walk 99.8 52 .63
When, Alpha= 1.0
Success
Rate
Routing
Overhead
Average
End to End
Delay
Flooding 99.8 265 1.2
Expanding Ring 99.5 227 1.2
Random Walk 99.8 145 .80
Sl.
No
Authors Title Purpose Algorithm
1. Reza
Olfati-
Saber
Ultrafast
Consensus
in Small-
World
Networks
There is a
correlation
between
improving
the algebraic
connectednes
s of complex
networks and
enhancing
the network's
resilience to
link and node
failures.
Random
Rewiring
algorithm
2. Prithwis
h Basu,
Chi-Kin
Chau
Opportunist
ic
Forwarding
in Wireless
Networks
with Duty
Cycling
In the context
of duty
cycling,
reliable
estimate
methods for
the delay of
opportunistic
Random
walk,
pseudo-
random
duty
cycling
0
50
100
150
200
250
300
Success
Rate
Routing
Overhead
Average
End to
End Delay
Flooding
Expanding Ring
Random Walk
0
50
100
150
200
250
300
Success
Rate
Routing
Overhead
Average
End to
End Delay
Flooding
Expanding Ring
Random Walk

forwarding in
wireless
networks are
presented.
3. Chih-fan
Hsin,
Mingyan
Liu
“Hitting
time
analysis for
a class of
random
packet
forwarding
schemes in
ad hoc
networks”
“Random
direction
forwarding
achieves
lower
mean hitting
time (order
wise) than
random walk
forwarding”
Random
direction
forwardin
g, Random
walk
forwardin
g, Random
direction
forwardin
g
4. Roberto
Beraldi
“Random
walk with
long jumps
for wireless
ad hoc
networks”
The number
of potential
nodes is
increased.
Such
variability is
a type of
heterogeneity
that is
achieved by
controlling
the
transmission
power and
tries to
reduce
correlation
among
selections of
nodes visited
by the walk.
Markov
chains,
Random
walk
5. Yibo
Zenga,
Zhongzh
i Zhang
“Spectra,
hitting
times, and
resistance
distances of
q-
subdivision
graphs”
“Produce
closed-form
solutions to
related
values for
iterated q-
subdivisions
of a graph G,
and extend
those results
to scale-free
fractal
hierarchical
lattices,
resulting in
explicit
formulas for
some
quantities”
Random
Walks,
Electrical
Networks,
Kemeny’s
Constant
6. Canh
Hao
Nguyen,
Hiroshi
Mamitsu
ka
“New
Resistance
Distances
with Global
Information
on Large
Graphs”
“If the
parameters
are
appropriately
adjusted in
the same way
as the p
resistance
distance, the
suggested
distances are
shown to
have global
information
“overwhelmi
ng local
information.”
Random
Geometric
Graph,
Global
Informatio
n Loss
problem
7. “Ulrike
von
Luxburg,
Agnes
Radl,
Matthias
Hein”
“Hitting and
commute
times in
large graphs
are often
misleading”
If the graph is
large enough,
the hitting
times and
commuting
distances
may be
calculated
with great
accuracy
using an
exceedingly
simple
formula in
many graphs.
Electrical
network,
Random
walk
3. MANET
Portable systems administration is one of the more
imaginative and testing areas of remote systems
administration, one which vows to turn out to be
progressively present in our lives. “Comprising of gadgets
that are independently self-sorting out in networks,
specially appointed networks offer an enormous level of
opportunity at a lower cost than other systems
administration arrangements. A MANET is an
independent assortment of portable clients that convey
over moderately "slow" remote connections. Since the
hubs are versatile, the organization geography might
change quickly and erratically over the long haul. An
important remote organization ought to have the option
to deal with the chance of having portable hubs, which
will no doubt build the rate at which the organization
geography changes. As needs be the organization must
have the option to adjust rapidly to changes in the
organization geography”. This suggests the utilization of
effective handover conventions and auto setup of showing
up hubs.

4. MANET Routing Protocols
The hub finds out about new close to hubs and ways of
contacting them, and reports that it can likewise arrive at
that routng hub. An Ad hoc steering convention is a show or
standard that controls how hubs come to concur what
direction to course parcels between processing gadgets in a
MANET. In specially appointed networks, hubs don't have
deduced information on geography of organization around
them, they need to find it. The essential thought is that
another hub reports its presence and pays attention to
communicate declarations from its neighbors”. The hub
finds out about new close to hubs and ways of contacting
them, and reports that it can likewise arrive at those hubs.
Steering conventions may commonly be arranged as:
(a) Table-driven OR Proactive steering conventions.
(b) On-request OR Reactive steering conventions.
5. CONCLUSION
The We showed that the logarithmic availability of a
standard organization can be impressively expanded by an
element of 1000 through irregular overhauling that turns a
neighborhood connect to a nonlocal interface (no new
connections are added)[38]. This strategy was initially
presented by Watts. This stage progress in mathematical
availability of little world organizations makes them ideal
contender for plan of ultrafast data organizations[39].
Laplacian range of little world organizations is invariant
and doesn't change by means of overhauling[40]. This
property just holds asymptotically for without scale
organizations[41]. A connection between expanding the
logarithmic availability of complicated organizations and
organization power to connection and hub disappointments
was additionally illustrated[42].
REFERENCES
[1] Chi-Kin Chau, PrithwishBasu, “Analysis of Latency of
Stateless OpportunisticForwarding in Intermittently
Connected Networks” IEEE/ACM TRANSACTIONS ON
NETWORKING, VOL. 19, NO. 4, AUGUST 2011.
[2] Pan Hui, AugustinChaintreau, Richard Gass, “Pocket
Switched Networking: Challenges, Feasibility and
Implementation Issues”, Springer-Verlag Berlin Heidelberg,
DOI: 10.1007/978-3-540-32993-0 29, 2006,
[3] IssamMabrouki, Xavier Lagrange, GwillermFroc,
“Random Walk Based Routing Protocol for Wireless Sensor
Networks”, Inter-Perf’07, October 26, 2019, Nantes,
FranceCopyright 2019, ICST 978-963-9799-00-4.
[4] Vijay Erramilli, AugustinChaintreau, “Diversity of
Forwarding Paths in Pocket Switched Networks”, IMC’07,
October 24–26, 2007, San Diego, USA.Copyright 2007 ACM
978-1-59593-908-1/07/0010.
[5] Chen Avin, Michal Kouck´y, and ZviLotker, “How to
Explore a Fast-Changing World”, Preprint, Institute of
Mathematics, AS CR, Prague.2008-2-10.
[6] J. Redi *, S. Kolek, K. Manning, C. Partridge, R. Rosales-
Hain,” JAVeLEN – An ultra-low energy ad hoc wireless
network”, Ad Hoc Networks 6 (2008) 108–126.
[7] SumanNath, Phillip B. Gibbons, “Communicating via
Fireflies: Geographic Routing on Duty-Cycled Sensors”,
“IPSN’07, April 25-27, 2007, Cambridge, Massachusetts,
USA.Copyright 2007 ACM 978-1-59593-638-7/07/0004.
[8] Reza Olfati-Saber, “Ultrafast Consensus in Small-World
Networks”, 2005 American Control Conference June 8-10,
2005. Portland, OR, USA
[9] Prithwish Basu, Chi-Kin Chau, “Opportunistic
Forwarding in Wireless Networks with Duty Cycling”,
September 15, 2008, San Francisco, California, USA.
Copyright 2008 ACM 978-1-60558-186-6/08/09
[10] Chih-fan Hsin, Mingyan Liu, “Hitting time analysis for a
class of random packet forwarding schemes in ad hoc
networks”, 11 July 2008, 2008 Elsevier B.V. All rights
reserved.
[11] Roberto Beraldi, “Random walk with long jumps for
wireless ad hoc networks”, 26 March 2008, 2008 Elsevier
B.V. All rights reserved.
[12] Peter Lynn, “Design Effects for Multiple Design
Samples Article”, June, 2006, Statistics Canada, Catalouge
No. 1201XIE,
[13] Yibo Zenga, Zhongzhi Zhang, “Spectra, hitting times,
and resistance distances of q-subdivision graphs”, 29, July,
2018, Preprint submitted to Theoretical Computer Science
August 2, 2018.
[14] Canh Hao Nguyen, Hiroshi Mamitsuka, “New
Resistance Distances with Global Information on Large
Graphs”, 2016, 19th International Conference on Artificial
Intelligence and Statistics (AISTATS) 2016, Cadiz, Spain.
JMLR: W&CP volume 51. Copyright 2016 by the authors.
[15] Gabor Lugosi, “Hitting and Commute Times in Large
Random Neighborhood Graphs”, 2014, Journal of Machine
Learning Research 15 (2014) 1751-1798 Submitted 1/13;
Revised 3/14; Published 5/14

[16] Ulrike von Luxburg, Agnes Radl, Matthias Hein,
“Hitting and commute times in large graphs are often
misleading”, May 27, 2011, Preprint submitted to
Theoretical Computer Science.
[17] Yuko Hatano andMehran Mesbahi, “Agreement Over
Random Networks”, IEEE TRANSACTIONS ON AUTOMATIC
CONTROL, VOL. 50, NO. 11, NOVEMBER 2005
[18] Luc Moreau, “Leaderless coordination via bidirectional
and unidirectional time-dependent communication”,
Proceedings of the 42nd IEEE Conference on Decision and
Control Maui, Hawaii USA, December 2003
[19] Chi-Kin Chau, Prithwish Basu, “Analysis of Latency of
Stateless Opportunistic Forwarding in Intermittently
Connected Networks”, IEEE/ACM TRANSACTIONS ON
NETWORKING, VOL. 19, NO. 4, AUGUST 2011
[20] Yibo Zeng and Zhongzhi Zhang, “Hitting times and
resistance distances of q-triangulation graphs: Accurate
results and applications”, 29, July, 2018, IEEE
TRANSACTIONS ON NETWORK SCIENCE AND
ENGINEERING
[21] Y. Hatano and M. Mesbahi. Agreement over random
networks. Submitted to the IEEE Conf. on Decision and
Control, 2004
[22] Y. Kuramoto. Chemical oscillators, waves, and
turbulance. Springer, Berlin, 1984.
[23] G.D. Caro, M. Dorigo, Antnet: Distributed stigmergetic
control for communications networks, Journal of Artificial
Intelligence Research 9 (1998).
[24] Sheldon M. Ross, Introduction to Probability Models,
Academic Press Inc., 1993
[25] ] M. Gerla, C. Lindemann, A. Rowstron, Perspectives
workshop: peer-topeer mobile ad hoc networks – new
research issues, in: Dagstuhl Seminar Proceedings, 2005
[26] Lohr, S.L. (1999). Sampling: Design and Analysis.
Pacific Grove: Duxbury Press.
[27] Lynn, P., and Gabler, S. (2005). Approximations to b* in
the prediction of design effects due to clustering.
Survey Methodology, 31, 101104.
[28] M. Levene, G. Loizou, Kemeny’s constant and the
random surfer, Am. Math. Mon. 109 (2002) 741–745.
[29] H. Chen, F. Zhang, Resistance distance and the
normalized Laplacian spectrum, Discrete Appl. Math. 155
(2007) 654–661.
[30] Zenger. A Comparison of Some Bounds for the
Nontrivial Eigenvalues of Stochastic Matrices. Numer. Math.,
9:209 – 22, 1972.
[31] C. M. Topaz and A. L. Bertozzi. Swarming patterns in a
twodimensional kinematic model for biological groups.
SIAM J. Appl. Math., May 2004.
[32] M. L. Mehta. Random Matrices. Academic Press, New
York, 2nd edition, 1991
[33] S. Milgram. The small world problem. Psychology
Today, 2:60–67, 1967.
[34] A. Soshnikov. A note on universality of the distribution
of the largest eigenvalues in certain sample covariance
matrices. J. Statistical Physics, 108:1033–1055, Sep. 2002.
[35] A. T. Winfree. Biological rythms and the behavior of
populations of coupled oscillators. J. Theoretical Biology,
16:15–42, 1967
[36] E. W. Montroll and G. H. Weiss. Random walks on
lattices. II. Journal of Mathematical Physics, 6(2):167–181,
February 1965.
[37] L. H. Liyanage, C. M. Gulati, and J. M. Hill. A
bibliography on applications of random-walks in
theoretical chemistry and physics. Advances in Molecular
Relaxation and Interaction Processes, 22:53–72, 1982.
[38] Vahdat, A., and Becker, D. Epidemic routing for
partially connected ad hoc networks. Tech. Rep. CS-200006,
Duke University, 2000.
[39] Spyropoulos, T., Psounis, K., and Raghavendra, C.
Single-copy routing in intermittently connected mobile
networks. In IEEE SECON ’04 (San Jose, CA, USA, 2004),
IEEE, pp. 145–158.
[40] Musolesi, M., and Mascolo, C. A community based
mobility model for ad hoc network research. In
REALMAN ’06 (New York, NY, USA, 2006), ACM Press, pp.
31–38.
[41] Kurtz, T. G. Limit theorems for sequence of jump
markov processes approximating ordinary differential
processes. Journal of Applied Probability (1971), 344–356.
[42] ZORZI, M., AND RAO, R. R. Geographic random
forwarding (GeRaF) for ad hoc and sensor networks:
Energy and latency performance. IEEE Trans. on Mobile
Computing 2, 4 (2003), 349–365.
[43] ZHAO, J., AND GOVINDAN, R. Understanding packet
delivery performance in dense wireless sensor networks. In
ACM SenSys (2003).

[44] TOUSSAINT, G. T. The relative neighbourhood graph of
a finite planar set. Pattern Recognition 12 (1980), 261–268.
[45] M.F. Shlesinger, G.M. Zaslavsky, J. Klafter, Lévy flights
and related topics in physics, Nature 363 (31) (1993).
[47] B. Hajek, Minimum mean hitting times of Brownian
motion with constrained drift, in: 27th Conference on
Stochastic Processes and their Applications (SPA), 2001.
[48] Santpal S. Dhillon, P. Van Mieghem, Comparison of
random walk strategies for ad hoc networks, in: The Sixth
Annual Mediterranean Ad Hoc Networking WorkShop,
Corfu, Greece, June 12–15, 2007.
[49] D. J. Klein and M. Randić. Resistance distance. Journal
of Mathematical Chemistry, 12(1):81–95, December 1993.
[50] D. Zhou and B. Sch¨olkopf. Learning from labeled and
unlabeled data using random walks. In Pattern Recognition,
Proceedings of the 26th DAGM Symposium, pages 237 –
244, 2004.
[51] P. Hui, A. Chaintreau, R. Gass, J. Scott, J. Crowcroft, and
C. Diot, “Pocket switched networking: Challenges,
feasibility, and implementation issues,” in Proc. WAC,
Greece, Oct. 2005, pp. 1–12.
[52] S. Dolev, E. Schiller, and J. L. Welch, “Random walk for
self-stabilizing group communication in ad hoc networks,”
IEEE Trans. Mobile Comput., vol. 5, no. 7, pp. 893–905, Jul.
2006.
[53] C. Gkantsidis, M. Mihail, and A. Saberi, “Random walks
in peer-topeer networks: Algorithms and evaluation,”
Perform. Eval., vol. 63, no. 3, pp. 241–263, Mar. 2006.
[54] I. Mabrouki, X. Lagrange, and G. Froc, “Random walk
based routing protocol for wireless sensor networks,” in
Proc. ValueTools, 2007, Article no. 71.
[55] V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot,
“Diversity of forwarding paths in pocket switched
networks,” in Proc. ACM IMC, 2007, pp. 161–174.
[56] C. Avin, M. Koucky, and Z. Lotker, “How to explore a
fast-changing world (cover time of a simple random walk
on evolving graphs),” in Proc. ACM ICALP, 2008, pp. 121–
132.
[57] J. Redi, S. Kolek, K. Manning, C. Partridge, R. Rosales-
Hain, R. Ramanathan, and I. Castineyra, “Javelen: An ultra-
low energy ad hoc wireless network,” Ad Hoc Netw. J., vol. 5,
pp. 108–126, Jan. 2008.
[58] S. Nath and P. B. Gibbons, “Communicating via fireflies:
Geographic routing on duty-cycled sensors,” in Proc. IPSN,
Cambridge, MA, Apr. 2007, pp. 440–449.
[59] P. Basu and C.-K. Chau, “Opportunistic forwarding in
wireless networks with duty cycling,” in Proc. ACM CHANTS,
Sep. 2008, pp. 19–26.
[60] C.-F. Hsin and M. Liu, “Hitting time analysis for a class
of random packet forwarding schemes in ad hoc networks,”
Ad Hoc Netw., vol. 7, no. 3, pp. 500–515, May 2008.
[61] R. Beraldi, “Random walk with long jumps for wireless
ad hoc networks,” Ad Hoc Netw., vol. 7, no. 2, pp. 294–306,
Mar. 2009.
[62] E. Gelenbe, “A diffusion model for packet travel time in
a random multihop medium,” Trans. Sensor Netw., vol. 3, no.
2, pp. 1550–4859, Jun. 2007.
[63] L. Lovasz, “Random walk on graphs: A survey,” in
Combinatorics, Paul Erdos Is Eighty. Budapest, Hungary:
János Bolyai Math. Soc., 1993, vol. 2, pp. 1–46.
[64] D. Aldous and J. A. Fill, “Reversible Markov chains and
random alks on graphs,” 1999 [Online]. Available:
http://www.stat.berkeley. edu/~aldous/RWG/book.html
[65] D. A. Levin, Y. Peres, and E. L. Wilmer, Markov Chains
and Mixing Times. Providence, RI: Amer. Math. Soc., 2009.
[66] P. G. Doyle and J. L. Snell, Random Walks and Electrical
Networks. Washington, DC: Math. Assoc. Amer., 1984.
[67] P. Tetali, “Random walks and the effective resistance of
networks,” J. Theor. Probab., vol. 4, no. 1, pp. 1–46, 1991.
[68] A. K. Chandra, P. Raghavan, R. Smolensky, and P.
Tiwari, “The electrical resistance of a graph captures its
commute and cover times,” Comput. Complexity, vol. 6, no. 4,
pp. 312–340, 1996.
[69] F. Chung and S.-Y. Yau, “Discrete Green’s functions,” J.
Combin. Theor. Ser., vol. 91, no. 1-2, pp. 191–214, Jul. 2000.
[70] R. B. Ellis, “Discrete Green’s functions for products of
regular graphs,” 2003 [Online]. Available:
http://arxiv.org/abs/math/0309080
[71] P. Basu and C.-K. Chau, “Latency of opportunistic
forwarding in finite regular wireless networks,” in Proc.
ACM DIAL M-POMC, Aug. 2008, pp. 55–64.
[72] C. Avin and G. Ercal, “On the cover time and mixing
time of random geometric graphs,” Theor. Comput. Sci., vol.
380, pp. 2–22, Jun. 2007.
[73] I. Mabrouki, X. Lagrange, and G. Froc, “Analytical
evaluation of unbiased random walks in wireless sensor
networks,” in Proc. Autonom. Spontaneous Netw. Symp.,
2008.

[74] I. Mabrouki, X. Lagrange, and G. Froc, “Design and
performance of wireless data gathering networks based on
unicast random walk routing,” IEEE/ACM Trans. Netw., vol.
17, no. 4, pp. 1214–1227, Aug. 2009.
[75] T. Spyropoulos, K. Psounis, and C. S. Raghavendra,
“Efficient routing in intermittently connected mobile
networks: The single-copy case,” IEEE/ACM Trans. Netw.,
vol. 16, no. 1, pp. 63–76, Feb. 2008.
[76] T. Spyropoulos, K. Psounis, and C. S. Raghavendra,
“Efficient routing in intermittently connected mobile
networks: The multiple-copy case,” IEEE/ACM Trans. Netw.,
vol. 16, no. 1, pp. 77–90, Feb. 2008.
[77] M. Sigelle, I. H. Jermyn, S. Perreau, and A. Jayasuriya,
“Lattice Green functions and diffusion for modelling traffic
routing in ad hoc networks,” in Proc. PHYSCOMNET, 2009.
[78] C.-K. Chau and P. Basu, “Analysis of latency of stateless
opportunistic forwarding in intermittently connected
networks,” Comput. Lab., Univ. Cambridge, Cambridge, U.K.,
Tech. Rep., 2010.
[79] Y. Li and Z.-L. Zhang, “Random walks on digraphs: A
theoretical framework for estimating transmission costs in
wireless routing,” in Proc. IEEE INFOCOM, Mar. 2010, pp. 1–
9.
[80] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah,
“Randomized gossip algorithms,” IEEE Trans. Inf. Theory,
vol. 52, no. 6, pp. 2508–2530, Jun. 2006.
[81] C. Santivanez and R. Ramanathan, “Hazy sighted link
state (HSLS) routing: A scalable link state algorithm,” BBN
Technologies, Cambridge, MA, Tech. Rep. BBN-TM-1301,
2001.
[82] N. Alon, C. Avin, M. Koucky, G. Kozma, Z. Lotker, and M.
Tuttle, “Many random walks are faster than one,” in Proc.
ACM SPAA, 2008, pp. 119–128.
[83] C. Cooper, A. Frieze, and T. Radzik, “Multiple random
walks in random regular graphs,” SIAM J. Discrete Math., vol.
380, no. 4, pp. 1738–1761, 2009.
[84] D. Geller, I. Kra, S. Popescu, and S. Simanca, “On
circulant matrices,” 2006 [Online]. Available:
http://www.math.sunysb.edu/~sorin/
[85] “List of trigonometric identities,” Wikipedia 2010
[Online]. Available:
http://en.wikipedia.org/wiki/Trigonometric_identity

Review on Analysis of Latency of Stateless Opportunistic Forwarding in Intermittently Connected Networks

Recommended

Recommended

More Related Content

Similar to Review on Analysis of Latency of Stateless Opportunistic Forwarding in Intermittently Connected Networks

Similar to Review on Analysis of Latency of Stateless Opportunistic Forwarding in Intermittently Connected Networks (20)

More from IRJET Journal

More from IRJET Journal (20)

Recently uploaded

Recently uploaded (20)

Review on Analysis of Latency of Stateless Opportunistic Forwarding in Intermittently Connected Networks