63 research outputs found

    A framework for IP and non-IP multicast services for vehicular networks

    Get PDF
    International audienceEnabling drivers to be connected to the Internet and/or Vehicular Ad-hoc networks, is one of the main challenges of the future networking. This enables drivers to benefit from the existing Internet services as well as emerging ITS applications based on IP or non-IP communications (e.g geonetworking). Many of ITS applications such as fleet management require multicast data delivery. Existing works on this subject tackle mainly the problems of IP multicasting inside the Internet or geocasting in VANETs. This paper presents a new framework that enables Internet-based multicast services on top of VANETs. We introduce a self-configuring multicast addressing scheme based on the geographic locations of the vehicles coupled with a simplified approach that locally manages the group membership to allow packet delivery from the Internet. Moreover, we propose an approach that selects the appropriate network-layer protocol for either geocasting or IP multicasting depending on the vehicles' context and the application requirements. Finally, we present the integration of the designed framework to the ITS reference architecture

    Vehicular networking in the recursive internetwork architecture

    Get PDF
    Vehicles such as cars are expected to use communication technologies for retrieving different kinds of information and exchanging information with other vehicles for safety and infotainment purposes. This results in vehicular networks, where vehicles can connect to other vehicles or communication infrastructures such as Road Side Units. The Recursive Inter- Network Architecture (RINA) has been proposed as a Future Internet architecture. This paper investigates and analyses how vehicular networks can be supported by RINA and how a RINA based vehicular network architecture can be designed to support efficient management of mobile vehicles.Peer ReviewedPostprint (author's final draft

    STCP: Receiver-agnostic Communication Enabled by Space-Time Cloud Pointers

    Get PDF
    Department of Electrical and Computer Engineering (Computer Engineering)During the last decade, mobile communication technologies have rapidly evolved and ubiquitous network connectivity is nearly achieved. However, we observe that there are critical situations where none of the existing mobile communication technologies is usable. Such situations are often found when messages need to be delivered to arbitrary persons or devices that are located in a specific space at a specific time. For instance at a disaster scene, current communication methods are incapable of delivering messages of a rescuer to the group of people at a specific area even when their cellular connections are alive because the rescuer cannot specify the receivers of the messages. We name this as receiver-unknown problem and propose a viable solution called SpaceMessaging. SpaceMessaging adopts the idea of Post-it by which we casually deliver our messages to a person who happens to visit a location at a random moment. To enable SpaceMessaging, we realize the concept of posting messages to a space by implementing cloud-pointers at a cloud server to which messages can be posted and from which messages can fetched by arbitrary mobile devices that are located at that space. Our Android-based prototype of SpaceMessaging, which particularly maps a cloud-pointer to a WiFi signal fingerprint captured from mobile devices, demonstrates that it first allows mobile devices to deliver messages to a specific space and to listen to the messages of a specific space in a highly accurate manner (with more than 90% of Recall)

    On the Throughput-Delay Trade-off in Georouting Networks

    Get PDF
    We study the scaling properties of a georouting scheme in a wireless multi-hop network of nn mobile nodes. Our aim is to increase the network capacity quasi linearly with nn while keeping the average delay bounded. In our model, mobile nodes move according to an i.i.d. random walk with velocity vv and transmit packets to randomly chosen destinations. The average packet delivery delay of our scheme is of order 1/v1/v and it achieves the network capacity of order nlognloglogn\frac{n}{\log n\log\log n}. This shows a practical throughput-delay trade-off, in particular when compared with the seminal result of Gupta and Kumar which shows network capacity of order n/logn\sqrt{n/\log n} and negligible delay and the groundbreaking result of Grossglausser and Tse which achieves network capacity of order nn but with an average delay of order n/v\sqrt{n}/v. We confirm the generality of our analytical results using simulations under various interference models.Comment: This work has been submitted to IEEE INFOCOM 201

    Obstacle-free geocasting protocol for ad hoc wireless networks

    Get PDF
    [[abstract]]Mobile ad hoc networks (MANET) comprise mobile hosts in a network bereft of base stations and characterized by a highly dynamic network topology. The MANET environment contains unpredictable obstacles, such as mountains, lakes, buildings, or regions without any hosts, impeding or blocking message relay. This study proposes geocasting protocol for sending short message from a source host to a geocasting region in ad hoc networks. The proposed protocol keeps messages away from unpredictable obstacles and creates a small flooding region. Experimental results show that a source host can send a short message to all hosts located in geographical area with a high success rate and low flooding overhead.[[conferencetype]]國際[[conferencedate]]20030320~20030320[[iscallforpapers]]Y[[conferencelocation]]New Orleans, LA, US

    A Distributed Routing Algorithm for Internet-wide Geocast

    Get PDF
    Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. To route geocast messages to their destination we need a geographic routing algorithm that can route packets efficiently to the devices inside the destination area. Our goal is to design an algorithm that can deliver shortest path tree like forwarding while relying purely on distributed data without central knowledge. In this paper, we present two algorithms for geographic routing. One based purely on distance vector data, and one more complicated algorithm based on path data. In our evaluation, we show that our purely distance vector based algorithm can come close to shortest path tree performance when a small number of routers are present in the destination area. We also show that our path based algorithm can come close to the performance of a shortest path tree in almost all geocast situations

    A Framework for IP and non-IP Multicast Services for Vehicular Networks

    Get PDF
    International audienceEnabling drivers to be connected to the Internet and/or Vehicular Ad-hoc networks, is one of the main challenges of the future networking. This enables drivers to benefit from the existing Internet services as well as emerging ITS applications based on IP or non-IP communications (e.g geonetworking). Many of ITS applications such as fleet management require multicast data delivery. Existing works on this subject tackle mainly the problems of IP multicasting inside the Internet or geocasting in VANETs. This paper presents a new framework that enables Internet-based multicast services on top of VANETs. We introduce a self-configuring multicast addressing scheme based on the geographic locations of the vehicles coupled with a simplified approach that locally manages the group membership to allow packet delivery from the Internet. Moreover, we propose an approach that selects the appropriate network-layer protocol for either geocasting or IP multicasting depending on the vehicles' context and the application requirements. Finally, we present the integration of the designed framework to the ITS reference architecture

    A Unified Specification Framework for Spatiotemporal Communication

    Get PDF
    Traditionally, network communication entailed the delivery of messages to specific network addresses. As computers acquired multimedia capabilities, new applications such as video broadcasting dictated the need for real-time quality of service guarantees and delivery to multiple recipients. In light of this, a subtle transition took place as a subset of IP addresses evolved into a group-naming scheme and best-effort delivery became subjugated to temporal constraints. With recent developments in mobile and sensor networks new applications are being considered in which physical locations and even temporal coordinates play a role in identifying the set of desired recipients. Other applications involved in the delivery of spatiotemporal services are pointing to increasingly sophisticated ways in which the name, time, and space dimensions can be engaged in specifying the recipients of a given message. In this paper we explore the extent to which these and other techniques for implicit and explicit specification of the recipient list can be brought under a single unified frame-work. The proposed framework is shown to be expressive enough so as to offer precise specifications for ex-isting communication mechanisms. More importantly, its analysis suggests novel forms of communication relevant to the emerging areas of spatiotemporal service provision in sensor and mobile networks

    Location Privacy in Spatial Crowdsourcing

    Full text link
    Spatial crowdsourcing (SC) is a new platform that engages individuals in collecting and analyzing environmental, social and other spatiotemporal information. With SC, requesters outsource their spatiotemporal tasks to a set of workers, who will perform the tasks by physically traveling to the tasks' locations. This chapter identifies privacy threats toward both workers and requesters during the two main phases of spatial crowdsourcing, tasking and reporting. Tasking is the process of identifying which tasks should be assigned to which workers. This process is handled by a spatial crowdsourcing server (SC-server). The latter phase is reporting, in which workers travel to the tasks' locations, complete the tasks and upload their reports to the SC-server. The challenge is to enable effective and efficient tasking as well as reporting in SC without disclosing the actual locations of workers (at least until they agree to perform a task) and the tasks themselves (at least to workers who are not assigned to those tasks). This chapter aims to provide an overview of the state-of-the-art in protecting users' location privacy in spatial crowdsourcing. We provide a comparative study of a diverse set of solutions in terms of task publishing modes (push vs. pull), problem focuses (tasking and reporting), threats (server, requester and worker), and underlying technical approaches (from pseudonymity, cloaking, and perturbation to exchange-based and encryption-based techniques). The strengths and drawbacks of the techniques are highlighted, leading to a discussion of open problems and future work

    Research on network anycast

    Full text link
    Anycast is defined as a service in IPv6, which provides stateless best effort delivery of an anycast datagram to at least one, and preferably only one host. It is a topic of increasing interest. This paper is an attempt to gather and report on the work done on anycast. There are two main categories at present: network-layer anycast and application-layer anycast. Both involve anycast architectures, routing algorithms, metrics, applications, etc. We also present an efficient algorithm for application-layer anycast, and point out possible research directions based on our research. <br /
    corecore