Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Wireless Personal Communications
Erschienen in: Wireless Personal Communications 4/2015

01.10.2015

Opportunistic Content Sharing Scheme for Distributed Network in City Environments

verfasst von: Gwo-Jiun Horng

Erschienen in: Wireless Personal Communications | Ausgabe 4/2015

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This paper proposes a novel adaptive cellular automaton co-occurrence (CACO) approach to forming information societies in smart cities. It develops an interest ontology of cellular automaton (CA) clustering using a zone of community in an urban environment. The key to the proposed method is to integrate CA clustering with the ontology of user interests. We also adopt an interest ontology and a co-occurrence mechanism to calculate the relation between time and the popularity of the information. In addition, we take advantage of the pheromone mechanism to determine if the data transferred to the destination are popular and to analyze if there exists any duplication. The simulation results reveal the strengths of the proposed “adaptive CACO mechanism” model in terms of decreased delay rate, next hop probability, and service time.
Vorheriger Artikel Fuzzy-Based Routing Protocol to Increase Throughput in Mobile Ad Hoc Networks
Nächster Artikel An Improved Anonymous Multi-Server Authenticated Key Agreement Scheme Using Smart Cards and Biometrics

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Literatur
1.
Conti, M., Giordano, S., May, M., & Passarella, A. (2010). From opportunistic networks to opportunistic computing. IEEE Communications Magazine, 48(9), 126–139.CrossRef
2.
Pelusi, L., Passarella, A., & Conti, M. (2006). Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Communications Magazine, 44(11), 134–141.CrossRef
3.
Haitao, L., Baoxian, Z., Mouftah, H., Xiaojun, S., & Jian, M. (2009). Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions. IEEE Communications Magazine, 47(12), 103–109.
4.
Conti, M., Delmastro, F., & Passarella, A. (2009). Social-aware content sharing in opportunistic networks. 6th Annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks workshops, pp. 1–3.
5.
Karamshuk, D., Boldrini, C., Conti, M., & Passarella, A. (2011). Human mobility models for opportunistic networks. IEEE Communications Magazine, 49(12), 157–165.CrossRef
6.
Perkins, C. E. (2001). Ad Hoc networking. New Jersey: Addison-Wesley.
7.
Fall, K. (2003). A delay-tolerant network architecture for challenged internets. Proceedings of the ACM SIGCOMM’03.
8.
Musolesi, M., & Mascolo, C. (2009). CAR: Context-aware adaptive routing for delay-tolerant mobile networks. IEEE Transactions on Mobile Computing, 8(2), 246–260.
9.
Jain, S., Fall, K., & Patra, R. (2004). Routing in a delay tolerant network. Proceedings of the ACM SIGCOMM’04.
10.
Zhao, V., Ammar, M., & Zegura, E. (2004). A message ferrying approach for data delivery in sparse mobile ad hoc networks. Proceedings of the ACM MobiHoc’04.
11.
Sarafijanovic-Djukic, M. P. N., & Grossglauser, M. (2006). Island hopping: Efficient mobility assisted forwarding in partitioned networks. Proceedings of the 3rd annual IEEE conference sensor and ad hoc communications and networks (SECON’06).
12.
Boldrini, C., Conti, M., & Passarella, A. (2008). Exploiting users’ social relations to forward data in opportunistic networks: The HiBOp solution. Pervasive and Mobile Computing, 4(5), 633–657.CrossRef
13.
Hui, P., Crowcroft, J., & Yoneki, E. (2011). BUBBLE rap: Social-based forwarding in delay tolerant networks. IEEE Transactions on Mobile Computing, 10(11), 1576–1589.CrossRef
14.
Ding, G., & Bhargava, B. (2004). Peer-to-peer file-sharing over mobile ad hoc networks. Proceedings of the IEEE PerComW’ 04, Orlando, FL, pp. 104–108.
15.
Daly, E., & Haahr, M. (2007). Social network analysis for routing in disconnected delay-tolerant MANETs. In Proceedings of the ACM MobiHoc, pp. 32–40.
16.
Hui, P., Crowcroft, J., & Yoneki, E. (2008). Bubble rap: Social-based forwarding in delay tolerant networks. In Proceedings of the ACM MobiHoc, pp. 241–250.
17.
Motani, M., Srinivasan, V., & Nuggehalli, P. (2005). Peoplenet: Engineering a wireless virtual social network. In Proceedings of the ACM MobiCom, pp. 243–257.
18.
Srinivasan, V., Motani, M., & Ooi, W. (2006). Analysis and implications of student contact patterns derived from campus schedules. In Proceedings of the ACM MobiCom, pp. 86–97.
19.
Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Duke University, Durham, NC, Technical Report CS-200006.
20.
Watts, D., & Strogatz, S. (1998). Collective dynamics of small-world networks. Nature, 393, 440–442.CrossRef
21.
Lindgren, A., Doria, A., & Schelen, O. (2003). Probabilistic routing in intermittently connected networks. Computing and Communications Review, 7(3), 19–20.CrossRef
22.
Zhao, W., Ammar, M., & Zegura, E. (2004). A message ferrying approach for data delivery in sparse mobile ad hoc networks. In Proceedings of the ACM MobiHoc, pp. 187–198.
23.
Gao, Wei., Li, Qinghua., Zhao, Bo., & Cao, Guohong. (2012). Social-aware multicast in disruption-tolerant networks. IEEE/ACM Transactions on Networking, 20(5), 1553–1566.CrossRef
24.
Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In Proceedings of the ACM SIGCOMM, pp. 27–34.
25.
Pentland, A., Fletcher, R., & Hasson, A. (2004). DakNet: Rethinking connectivity in developing nations. IEEE Computer, 37(1), 78–83.CrossRef
26.
Sushant, J., Fall, K., & Patra, R. (2004). Routing in a delay tolerant network. In Proceedings of the SIGCOMM’04.
27.
Pasarella, A., Kumar, M., Conti, M., & Borgia, E. (2011). Minimum-delay service provisioning in opportunistic networks. IEEE Transactions on Parallel and Distributed Systems, 22(8), 1267–1275.CrossRef
28.
Boldrini, C., Conti, M., & Passarella, A. (2008). Exploiting users’ social relations to forward data in opportunistic networks: The HiBOp solution. Pervasive and Mobile Computing, 4(5), 633–657.CrossRef
29.
Spyropoulos, T., Psounis, K., & Raghavendra, C. (2008). Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE Transactions Networking, 16(1), 63–76.CrossRef
30.
Chaintreau, A., Hui, P., Diot, C., Gass, R., & Scott, J. (2007). Impact of human mobility on opportunistic forwarding algorithms. IEEE Transactions on Mobile Computing, 6(6), 606–620.CrossRef
31.
Boldrini, C., Conti, M., & Passarella, A. (2009). Design and performance evaluation of content place, a social-aware data dissemination system for opportunistic networks. Computer Networks, 54(5), 589–604.
32.
Missoum, S., Gürdal, Z., & Setoodeh, S. (2005). Study of a new local update scheme for cellular automata in structural design. Structural and Multidisciplinary Optimization, 29(2). doi:10.​1007/​s00158-004-0464-2
33.
Chen, H., Finin, T., Joshi, A., Kagal, L., Perich, F., & Chakraborty, D. (2004). Intelligent agents meet the semantic web in smart spaces. IEEE Internet Computing, 8(6), 69–79.CrossRef
34.
35.
Silva, J., & Willett, R. (2009). Hypergraph-based anomaly detection of high-dimensional co-occurrences. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(3), 563–569.CrossRef
36.
37.
Li, M., Dias, B., El-Deredy, W., & Lisboa, P. J. G. (2007). A probabilistic model for item-based recommender systems. In Proceedings of the ACM international conference on recommender systems.
38.
Li, H., & Abe, N. (2002). Word clustering and disambiguation based on co-occurrence data. In Proceedings of the 19th international conference on computational linguistics.
39.
Globerson, A., Chechik, G., Pereira, F., & Tishby, N. (2007). Euclidean embedding of co-occurrence data. Journal of Machine Learning Research, 8, 2265–2295.MATHMathSciNet
40.
Jhanwar, N., Chaudhuri, S., Seetharaman, G., & Zavidovique, B. (2004). Content based image retrieval using motif cooccurrence matrix. In Proceedings of the 4th Indian conference computer vision, graphics and image processing, Vol. 22, no. 14, pp. 1211–1220.
41.
Hofmann, T., & Puzicha, J. (1998). Statistical models for co-occurrence data. Technical report AIM-1625, Massachusetts Institute of Technology, citeseer.ist.psu.edu/article/hofmann98statistical.html.
42.
Rabbat, M. G., Figueiredo, M. A. T., & Nowak, R. D. (2008). Network inference from co-occurrences. IEEE Transactions on Information Theory, 54(9), 4053–4068.MathSciNetCrossRef
43.
Kubica, J., Moore, A., Cohn, D., & Schneider, J. (2003). cGraph: A fast graphbased method for link analysis and queries. In Proceedings of the IJCAI text-mining link-anal. workshop, Acapulco, Mexico, pp. 22–31.
44.
Pham, H., Hu, L., & Shahabi, C. (2011). A geo-social model: From real-world co-occurrences to social connections. IN Proceedings of the 7th international conference on databases in networked information systems, pp. 203–222.
45.
Maihöfer, C. (2004). A survey of geocast routing protocols. IEEE Communications Surveys & Tutorials, 6(2), 32–42.CrossRef
46.
Heissenbüttel, M., & Braun, T. (2003). Ants-based routing in large scale mobile ad-hoc networks, Kommunikation in Verteilten Systemen (KiVS).
47.
Günes, M., Sorges, U., & Bouazizi, I. (2002). ARA—The ant-colony based routing algorithm for MANETs proceedings of the ICPP workshop on ad hoc networks (IWAHN 2002), IEEE Computer Society Press, pp. 79–85.
48.
Günes, M., Kähmer, M., & Bouazizi, I. (2003). Ant routing algorithm (ARA) for mobile multi-hop ad-hoc networks—New features and results, the second mediterranean workshop on ad-hoc networks.
49.
Roth, M., & Wicker, S. (2003). Termite: Ad-hoc networking with stigmergy. IEEE Global Telecommunications Conference, 5, 2937–2941.
50.
Bonabeau, E., Dorigo, M., & Theraulaz, G. (1999). Swarm intelligence: From natural to artificial systems. Oxford: Oxford University Press.
51.
Ross, S. (1996). Stochastic processes, 2nd Edn. New York: Wiley.
52.
Kelly, F. P. (1979). Reversibility and stochastic networks. New York: Wiley.MATH
Metadaten
Titel
Opportunistic Content Sharing Scheme for Distributed Network in City Environments
verfasst von
Gwo-Jiun Horng
Publikationsdatum
01.10.2015
Verlag
Springer US
Erschienen in
Wireless Personal Communications / Ausgabe 4/2015
Print ISSN: 0929-6212
Elektronische ISSN: 1572-834X
DOI
https://doi.org/10.1007/s11277-015-2707-5

Weitere Artikel der Ausgabe 4/2015

Wireless Personal Communications 4/2015 Zur Ausgabe

OriginalPaper

Eliminating the State of Ping-Pong for Mobile IP Optimization

OriginalPaper

Performance Evaluation of Call Admission Control Schemes with New Call Reattempts in Wireless Cellular Networks

OriginalPaper

Adaptive NLOS Mitigation Location Algorithm in Wireless Cellular Network

OriginalPaper

High Resolution TOA Estimation Based on Compressed Sensing

OriginalPaper

Handover Performance of Unstable-Yaw Stratospheric High-Altitude Stations

OriginalPaper

Cascaded Energy Detector and Matched Filter-Clear Channel Assessment for Wireless Network

Neuer Inhalt

    Bildnachweise