Contenuto
Ti trovi in: HOME »Programmi, progetti e risultati »I progetti »PRIN - Programmi di ricerca di Rilevante Interesse Nazionale»Programma di ricercaINIZIO_TESTO_DA_INDICIZZARE
RESEARCH PROGRAM
italiano - inglese
Research Units
Similar research programs:
- 1 - SESAME (Scalable Efficient Secure Autonomic MEsh networks)
- 2 - Situation and location aware design solutions over heterogeneous wireless networks
- 3 - Peer to peeR beyOnd FILE Sharing (PROFILES)
- 4 - Wireless 8O2.16 Multi-antenna mEsh Networks (WOMEN)
- 5 - Quality and Controllability of Communication Services over Heterogeneous Networks (QuaSAR)
- 6 - flexible SOftware Router PlAtform for Secure Service-specific Overlay networks (SORPASSO)
- 7 - Models and algorithms for robust network optimization
- 8 - Satellite-Assisted LocalIzation and Communication systems for Emergency services (SALICE)
- 9 - Wireless multiplatfOrm mimo active access netwoRks for QoS-demanding muLtimedia Delivery (WORLD)
- 10 - NADIR: Design and assessment of protocols and distributed algorithms for quality of service mesh networks
Scientific and education field classification
International Patent Classification
- ELECTRICITY
- ELECTRIC COMMUNICATION TECHNIQUE
- TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (typewriters B41J; order telegraphs, fire or police telegraphs G08B; visual telegraphy G08B, C; teleautographic systems G08C; ciphering or deciphering apparatus per se G09C; coding, decoding or code conversion, in general H03M; arrangements common to telegraphic and telephonic communication H04M; selecting H04Q)
- ELECTRIC COMMUNICATION TECHNIQUE
Geographical classification
- Region: Lombardia
Bibliografia
[A+04] A. Agostini, C. Bettini, N. Cesa-Bianchi, D. Maggiorini, D. Riboni, M. Ruberl, C. Sala, D. Vitali, "Towards Highly Adaptive Services for Mobile Computing". Mobile Information Systems, pp. 121-134, Springer, 2004.[B+98] S. Basagni, I. Chlamtac, V.R. Syrotiuk, B.A. Woodward, "A distance routing effect algorithm for mobility (DREAM)". Proc. 4th Intl. Conf. on Mobile Computing and Networking, pp. 76-84, 1998.
[BE02] D. Braginsky, D. Estrin, "Rumor routing algorithm for sensor networks". Proc. 1st ACM Intl Workshop on Wireless Sensor Networks and Applications, pp. 22-31, 2002.
[BM05] S. Biswas and R. Morris, "ExOR: Opportunistic MultiHop Routing for Wireless Networks". Proc. of ACM SIGCOM 2005.
[C03] T. Camp, "Location Information Services in Mobile Ad Hoc Networks". Technical Report MCS-03-15, The Colorado School of Mines, October 2003. http://toilers.mines.edu/Public/PublicationList
[C+03] J.-H. Cui, M. Faloutsos, D. Maggiorini, M. Gerla, K. Boussetta, "Measuring and Modelling the Group Membership in the Internet". Proc. Internet Measurement Conference, Oct. 2003.
[C+05] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, J. Scott, "Pocket Switched Networks: Real-World Mobility and its Consequences for Opportunistic Forwarding". Technical Report UCAM-CL-TR-617, University of Cambridge, Computer Laboratory, Feb. 2005.
[C+06] V. Cerf, S. Burleighm, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, H. Weiss, "Delay-Tolerant Network Architecture". Internet Draft draft-irtf-dtnrg-arch-05, March 2005. Work in progress.
[CBD02] T. Camp, J. Boleng, V. Davies, "A Survey of Mobility Models for Ad Hoc Network Research". Wireless Communication & Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications, Vol.2, N.5, pp. 483-502, 2002.
[CFFP06] A. Capone, I. Filippini, L. Fratta, L. Pizziniaco, "Receiver Oriented Trajectory Based Forwarding". Springer Lecture Notes in Computer Science, Volume 3383, 2006.
[CG05] G.Carofiglio, R.Gaeta, M.Garetto, P.Giaccone, E.Leonardi, M.Sereno, "A Statistical Physics Approach for Modelling P2P Systems". ACM Performance Evaluation Review, Vol. 33, No. 2, September 2005.
[D+04] S. Das, A. Nandan, G. Pau, M.Y. Sanadidi, M. Gerla, "SPAWN: A Swarming Protocol for Vehicular Ad Hoc Networks". Proc. 1st ACM VANET, Oct. 2004.
[D+87] A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, D. Terry, "Epidemic algorithms for replicated database maintenance". Proc. 6th Annual ACM Symposium on Principles of Distributed Computing, pp. 1-12, 1987.
[EG+04] A. El Gamal, J. Mammen, B. Prabhakar, D. Shah, "Throughput-Delay Trade-Off in Wireless Networks". IEEE Infocom'04, March 2004.
[G+05] O. Goussevskaia, M.D.V. Machado, R.A.F. Mini et al., "Data dissemination based on the energy map". IEEE Communications Magazine, Vol.43, N.7, 2005, pp. 134-143.
[GSB04] S. Giordano, I. Stojmenovic, L. Blazevie, "Position based routing algorithms for ad hoc networks: a taxonomy". Ad Hoc Wireless Networking, Kluwer, pp. 103-136, 2004.
[GT02] M. Grossglauser, D.N.C. Tse, "Mobility increases the capacity of ad hoc wireless networks". IEEE/ACM Transactions on Networking, Vol.10, N.4, pp. 477-486, 2002.
[H+03] N.J.A. Harvey, M.B. Jones, S. Saroiu, M. Theimer, A. Wolman, "SkipNet: A Scalable Overlay Network with Practical Locality Properties". Proc. 4th USENIX Symposium on Internet Technologies and Systems, March 2003.
[H+05] P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, C. Diot, "Pocket Switched Networks and the Consequences of Human Mobility in Conference Environments". Proc. SIGCOMM 2005 Workshop on Delay Tolerant Networking, August 2005.
[J+02] P. Juang, H. Oki, Y. Wang, M. Martonosi, L.S. Peh, D. Rubenstein, "Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet". Proc. 10th Intl Conf. Architectural Support for Programming Languages and Operating Systems, pp. 96-107, 2002.
[JFP04] S. Jain, K. Fall, R. Patra, "Routing in a delay tolerant network". Proc. Conf. SIGCOMM'04, pp. 145-158, 2004.
[JMW03] S. Jain, R. Mahajan, D. Wetherall, "A Study of the Performance Potential of DHT-based Overlays". Proc. 4th USENIX Symposium on Internet, 2003.
[KK00] B. Karp, H. T. Kung, "GPSR: greedy perimeter stateless routing for wireless networks". Proc. 6th Intl. Conf. MobiCom'00, pp. 243-254, 2000.
[KSU99] E. Kranakis, H. Singh, J. Urrutia, "Compass routing on geometric networks". Proc. 11th Canadian Conference on Computational Geometry, Vancouver, Aug. 1999.
[KV00] Y.B. Ko, N.H. Vaidya, "Location-aided routing (LAR) in mobile ad hoc networks". Proc. 4th Intl. Conf. MobiCom'98, pp. 66-75, 1998.
[KV00b] Y. Ko and N. H. Vaidya, "GeoTORA: A Protocol for Geocasting in Mobile Ad-Hoc Networks". Proc. of IEEE ICNP 2000.
[LS04] X. Lin, N.B. Shroff, "The Fundamental Capacity-Delay Tradeoff in Large Mobile Ad Hoc Networks". Third Annual Mediterranean Ad Hoc Networking Workshop, 2004.
[LTLS00] W.H. Liao, Y.C. Tseng, K.L. Lo, and J.P. Sheu, "GeoGRID: A Geocasting Protocol for Mobile Ad-Hoc Networks based on GRID". Journal of Internet Technology, Vol. 1, No. 2, pp. 23-32. December 2000.
[LW05] C. Lindemann, O.P. Waldhorst, "Modeling epidemic information dissemination on mobile devices with finite buffers". Proc. ACM SIGMETRICS'05, pp. 121-132, 2005.
[M+06] U. Monaco, F. Cuomo, T.Melodia, F. Ricciato, M. Listanti, "Data Gathering in Wireless Sensor Networks: Insights into Energy-oriented Approaches". Proc. 3rd Networking Workshop, Jan. 2006. http://www.telematica.polito.it/courmayeur06/-papers/12-A.3.2.pdf .
[MJB05] A. Montresor, M. Jelasity, O. Babaoglu, "Gossip-based Aggregation in Large Dynamic Networks". ACM Transactions on Computer Systems, Vol.23, N.3, pp. 219-252, August 2005.
[MM05] M. Meo, F. Milan, "Content Management Policies in Peer-to-Peer File Sharing Networks". IEEE Globecom 2005, St. Louis, MO, USA
[NN03] D. Niculescu, B. Nath, "Trajectory Based Forwarding and Its Application". Proc. of ACM Mobicom 2003.
[N+06] A, Nandan, S. Tewari, S. Das, M. Gerla, L. Kleinrock, "AdTorrent: Delivering Location Cognizant Advertisements to Car Networks". Proc. 3rd Annual IFIP Conference on Wireless
On-demand Network Systems and Services, pp. 203-212, Jan. 2006.
[RJH02] G.-C. Roman, C. Julien, Q. Huang, "Network abstractions for context-aware mobile computing". Proc. ICSE'02, pp. 363-373, 2002.
[RKV04] A. Rodriguez, D. Kostic, A. Vahdat, "Scalability in Adaptive Multi-Metric Overlays". Proc. Intl Conf. ICDCS, March 2004.
[RT99] E.M. Royer, C.-K. Toh, "A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks". IEEE Personal Communications, pp. 46-55, Apr. 1999.
[S+04] J. Su, A. Chin, A. Popivanova, A. Goel, E. de Lara, "User Mobility for Opportunistic Ad-Hoc Networking". Proc. IEEE WMCSA, 2004.
[SM04] G. Sharma, R. Mazumdar, "On Achievable Delay/Capacity Trade-offs in Mobile Ad Hoc Networks". Proc. WiOpt 2004, Cambridge, UK, March 2004.
[T+03] J. Tian, L. Han, K. Rothermel, C. Cseh, "Spatially Aware Packet Routing for Mobile Ad Hoc Inter-Vehicle Radio Networks". Proc. 6th IEEE ITSC, pp. 1546-1552, Oct. 2003.
[VB00] A. Vahdat, D. Becker, "Epidemic Routing for Partially-connected Ad hoc Networks". Technical Report CS-2000-06, Duke University, July 2000.
[W+05] Y. Wang, S. Jain, M. Martonosi, K. Fall, "Erasure-coding based routing for opportunistic networks". Proc. 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN'05), pp. 229-236, 2005.
[YLZ04] Y. Yu, G.-H. Lu, Z.-L. Zhang, "Enhancing Location Service Scalability With HIGH-GRADE". Proc. IEEE MASS 2004, Oct 2004.
[ZR03] M. Zorzi, R. R. Rao, "Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks". IEEE Transactions on Mobile Computing, vol. 2, no. 4, pp 337-365, Oct-Dec 2003.
Keywords
DELAY TOLERANT NETWORKS, GEOGRAPHIC ROUTING, GOSSIPING ALGORITHMS, OVERLAY NETWORKS, ROUTING PROTOCOLS, CONTENT DELIVERYCARTOON - Context Aware RouTing Over Opportunistic Networks
Università degli Studi di MilanoAbstract
In the everyday life of people moving within an urban area, a campus or a building, there are several applications, ranging from ambient intelligence to entertainment, group coordination and information sharing. For these applications the availability of a low cost, scalable meshed radio infrastructure would more efficiently support the interaction with other mobile devices than the classical one hop radio access to global networks. Recent studies on the human mobility and aggregation behaviors, together with in-field experiences, have shown that such an ad hoc infrastructure could be easily deployed by simply enabling vehicles and human-carried radio devices to act as switching nodes of a meshed network, in addition to their ability to provide one hop connectivity to InfoSpots and Access Points. The term Opportunistic networks is often adopted to identify this type of mobile networks that provide short range radio connectivity within a localized area (e.g. a city’s zone, campus or mall).
Opportunistic networks are delay tolerant networks in which nodes establish extemporaneous wireless connections for packet forwarding by exploiting the relay opportunity of another radio device in range. If devices are not available in the neighborhood, the packet is cached locally waiting for a new possibility of forwarding that mobility will eventually offer.
This is an emerging research area and a very >>>
Principal Investigator
Gian Paolo Rossi Università degli Studi di MILANOResearch Objectives
2.1.1 ROUTING OVER OPPORTUNISTIC NETWORKS
Opportunistic networks identify mobile networks that provide ad hoc connectivity through short range radio links within a localized area (e.g. a city’s zone, campus or mall). They are delay tolerant networks in which nodes establish extemporaneous wireless connections for packet forwarding by exploiting the relay opportunity of another radio device in range. If the proper contact is not available, the packet is cached locally waiting for a new possibility of forwarding that mobility will eventually offer.
This is an emerging research area and a very promising technology to support ubiquitous computing. However, to make this happen, a great research effort is still required to design flexible, robust and efficient inter-node communication mechanisms. It is worth to observe that, in an opportunistic environment, mobility dynamics, network partitions and energy constraints impose a departure from a rigid layered architecture and from IP-style communications. Novel architecture and protocols are required to satisfy the requirements of a radically new networking environment. On one hand, flexible routing policies are needed to quickly adapt to the dynamics of the connectivity conditions that alternate highly crowded zones to others where the lack of devices in range leads to network partitions. Protocols must be optimized to ensure the efficient use of constrained >>>
Timescale
24 monthsNational and international background
CARTOON considers an urban opportunistic environment where vehicles, end-user terminals, personal appliances and pocket devices play a threefold role in a mobile network that provides short range radio connectivity within a localized area (e.g. a city’s neighbor, campus or mall).
They can in fact act as: (i) end system of one-to-one or one-to-many communications, (ii) packet forwarding node, when another device is available in range, (iii) packet carrier, or transporter of cached packets, when the network is partitioned and no neighbor devices are available.
This type of networks is considered to be Delay Tolerant Networks (DTNs) because, as the consequence of mobility and network partitions, they can introduce long latencies in the delivery of packets and are capable to provide a simple 'eventual delivery' service. The Internet Research Task Force (IRTF) has only recently started to formalize DTNs [C+06]. CARTOON activities are inside this main research stream, although they consider a limited networking framework; in fact, the project focus is centered on mobile networks that provide short range radio connectivity within a localized area such as those considered, for instance, in [C+05,H+05,S+04] or applied in ZebraNet [J+02], where network partitions are frequently experienced, and SPAWN [D+04].
This is a recent research area that is rapidly attracting scientific interests >>>
