article

Free access

A new approach to the design and analysis of peer-to-peer mobile networks

Authors:

Imrich Chlamtac,

András FaragóAuthors Info & Claims

Wireless Networks, Volume 5, Issue 3

Pages 149 - 156

https://doi.org/10.1023/A:1019186624837

Published: 01 May 1999 Publication History

PDF eReader

Abstract

This paper introduces a new model and methodological approach for dealing with the probabilistic nature of mobile networks based on the theory of random graphs. Probabilistic dependence between the random links prevents the direct application of the theory of random graphs to communication networks. The new model, termed Random Network Model, generalizes conventional random graph models to allow for the inclusion of link dependencies in a mobile network. The new Random Network Model is obtained through the superposition of Kolmogorov complexity and random graph theory, making in this way random graph theory applicable to mobile networks. To the best of the authors' knowledge, it is the first application of random graphs to the field of mobile networks and a first general modeling framework for dealing with ad-hoc network mobility. The application of this methodology makes it possible to derive results with proven properties. The theory is demonstrated by addressing the issue of the establishment of a connected virtual backbone among mobile clusterheads in a peer-to-peer mobile wireless network. Using the Random Network Model, we show that it is possible to construct a randomized distributed algorithm which provides connectivity with high probability, requiring exponentially fewer connections (peer-to-peer logical links) per clusterhead than the number of connections needed for an algorithm with a worst case deterministic guarantee.

References

[1]

D.J. Baker, A. Ephremides and J.A. Flynn, The design and simulation of a mobile radio network with distributed control, IEEE Journal on Selected Areas in Communications (1984) 226-237.

Google Scholar

[2]

D.J. Baker, J. Wieselthier and A. Ephremides, A distributed algorithm or scheduling the activation of links in a self-organizing, mobile radio network, in: Proc. IEEE International Conference on Communications (ICC '82), Philadelphia (1982) pp. 2F.6/1-5.

Google Scholar

[3]

B. Bollob~s, Random Graphs (Academic Press, London, 1985).

Google Scholar

[4]

H. Buhrman, J.-H. Hoepman and P. Vitanyi, Optimal routing tables, in: Proc. 15th Annual ACM Symp. on Principles of Distributed Computing, Philadelphia (1996) pp. 134-142.

Crossref

Google Scholar

[5]

A. Ephremides, J.E. Wieselthier and D.J. Baker, A design concept for reliable mobile radio networks with frequency hopping signaling, Proceedings of the IEEE 75(1) (1987) 56-73.

Google Scholar

[6]

P. Erdos and A. Renyi, On the evolution of random graphs, Proceedings of Hungarian Academy of Sciences 5 (1960) 17-61.

Google Scholar

[7]

M. Gerla and J.T.Z. Tsai, Multicluster, mobile, multimedia radio network, Wireless Networks 1(3) (1995) 255-265.

Digital Library

Google Scholar

[8]

A.N. Kolmogorov, Three approaches to the quantitative definition of information, Problems of Information Transmission 1 (1965) 1-7.

Google Scholar

[9]

M. Li and P.M.B. Vit~nyi, An Introduction to Kolmogorov Complexity and its Applications (Springer, New York, 1993).

Crossref

Google Scholar

[10]

C.R. Lin and M. Gerla, A distributed architecture for multimedia in dynamic wireless networks, in: Proc. IEEE GLOBECOM,New York (1995) pp. 1468-1472.

Google Scholar

[11]

C. Lin and M. Gerla, A distributed control scheme in multihop packet radio networks for voice/data traffic support in: Proc. IEEE International Conference on Communications (ICC '95), Seattle (1995) pp. 1238-1242.

Crossref

Google Scholar

[12]

E. Palmer, Graphical Evolution (Wiley, New York, 1985).

Google Scholar

Cited By

View all

Haddar M(2022)SEALEA: Scalable and Energy Aware k-Leaders Election Algorithm in IoT Wireless Sensor NetworksWireless Personal Communications: An International Journal10.1007/s11277-022-09547-8125:1(209-229)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1007/s11277-022-09547-8
Batabyal SBhaumik P(2015)Mobility Models, Traces and Impact of Mobility on Opportunistic Routing Algorithms: A SurveyIEEE Communications Surveys & Tutorials10.1109/COMST.2015.241981917:3(1679-1707)Online publication date: 20-Aug-2015
https://dl.acm.org/doi/10.1109/COMST.2015.2419819
Zuo KWang HWu QHu D(2011)Connectivity model of wireless networks via dependency links random graphsThe Journal of Supercomputing10.1007/s11227-010-0529-558:1(122-141)Online publication date: 1-Oct-2011
https://dl.acm.org/doi/10.1007/s11227-010-0529-5
Show More Cited By

Index Terms

A new approach to the design and analysis of peer-to-peer mobile networks
1. Networks
  1. Network types
    1. Mobile networks
    2. Wireless access networks

Recommendations

Peer-to-peer File-sharing over Mobile Ad hoc Networks
PERCOMW '04: Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops

Current peer-to-peer file-sharing systems mostlywork on wired networks. Mobile ad hoc network ischaracterized as multi-hop wireless communicationsbetween mobile devices. In this paper, five routingapproaches with different complexity are proposed ...
Fully self-organized peer-to-peer key management for mobile ad hoc networks
WiSe '05: Proceedings of the 4th ACM workshop on Wireless security

Mobile ad hoc networks (MANETs) offer communication over a shared wireless channel without any pre-existing infrastructure. Forming peer-to-peer security associations in MANETs is more challenging than in conventional networks due to the lack of central ...
Network design and routing in peer-to-peer networks and mobile ad hoc networks

Comments

Information & Contributors

Information

Published In

Wireless Networks Volume 5, Issue 3

May 1999

79 pages

ISSN:1022-0038

Editor:
Imrich Chlamtac
Univ. of Texas at Dallas, Richardson

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 May 1999

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

32
Total Citations
View Citations
868
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)9

Reflects downloads up to 11 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Haddar M(2022)SEALEA: Scalable and Energy Aware k-Leaders Election Algorithm in IoT Wireless Sensor NetworksWireless Personal Communications: An International Journal10.1007/s11277-022-09547-8125:1(209-229)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1007/s11277-022-09547-8
Batabyal SBhaumik P(2015)Mobility Models, Traces and Impact of Mobility on Opportunistic Routing Algorithms: A SurveyIEEE Communications Surveys & Tutorials10.1109/COMST.2015.241981917:3(1679-1707)Online publication date: 20-Aug-2015
https://dl.acm.org/doi/10.1109/COMST.2015.2419819
Zuo KWang HWu QHu D(2011)Connectivity model of wireless networks via dependency links random graphsThe Journal of Supercomputing10.1007/s11227-010-0529-558:1(122-141)Online publication date: 1-Oct-2011
https://dl.acm.org/doi/10.1007/s11227-010-0529-5
Barta JLeggieri VMontemanni RNobili PTriki C(2011)Minimum power multicasting in wireless networks under probabilistic node failuresComputational Optimization and Applications10.1007/s10589-009-9281-249:1(193-212)Online publication date: 1-May-2011
https://dl.acm.org/doi/10.1007/s10589-009-9281-2
Nanni MBasagni S(2010)Mobile ad hoc backbonesProceedings of the 2010 IEEE conference on Radio and wireless symposium10.5555/1824406.1824579(613-616)Online publication date: 10-Jan-2010
https://dl.acm.org/doi/10.5555/1824406.1824579
Song WWang YRen CWu CLi X(2009)Multi-hop scatternet formation and routing for large scale Bluetooth networksInternational Journal of Ad Hoc and Ubiquitous Computing10.1504/IJAHUC.2009.0274764:5(251-268)Online publication date: 1-Jul-2009
https://dl.acm.org/doi/10.1504/IJAHUC.2009.027476
Egeland GEngelstad PGuizani MMueller PFähnrich KVasilakos AZhang YZhang J(2009)Energy penalties for non-shortest paths in wireless sensor networks with link failuresProceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly10.1145/1582379.1582441(279-285)Online publication date: 21-Jun-2009
https://dl.acm.org/doi/10.1145/1582379.1582441
Egeland GEngelstad P(2009)The availability and reliability of wireless multi-hop networks with stochastic link failuresIEEE Journal on Selected Areas in Communications10.1109/JSAC.2009.09091027:7(1132-1146)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1109/JSAC.2009.090910
Chinara SRath S(2009)A Survey on One-Hop Clustering Algorithms in Mobile Ad Hoc NetworksJournal of Network and Systems Management10.1007/s10922-009-9123-717:1-2(183-207)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.1007/s10922-009-9123-7
Dubhashi DHäggström OMambrini GPanconesi APetrioli C(2007)Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop bluetooth networksWireless Networks10.1007/s11276-006-1304-713:1(107-125)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1007/s11276-006-1304-7
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Peer-to-peer File-sharing over Mobile Ad hoc Networks

Fully self-organized peer-to-peer key management for mobile ad hoc networks

Network design and routing in peer-to-peer networks and mobile ad hoc networks

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations