This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts

for publication in the WCNC 2009 proceedings.

A Novel Social Cluster-based P2P Framework for Integrating VANETs with the Internet
Sung-Han Lin , Junn-Yen Hu , Cheng-Fu Chou , Ing-Chau Chang and Chien-Chun Hung Dept. of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, R.O.C. Dept. of Computer Science and Information Engineering, National Changhua University of Education, Email:
{sunghlin,

Changhua, Taiwan, R.O.C. sysrq, ccf, shinglee}@cmlab.csie.ntu.edu.tw, icchang@cc.ncue.edu.tw

AbstractDue to the vehicles movement and inherent characteristics of wireless channel, how to discover and retrieve the required contents has become a challenging issue in a hybrid network including vehicular ad hoc networks (VANETs) and the Internet. In this paper, we propose a social cluster-based P2P framework that estimates similarity and connection condition among peers to provide mobile peers efcient resource discovery and retrieval. The idea of our framework is to consider a mobile peers preference and its connectivity such as the lifetime or the bandwidth for a wireless link. Specically, there are two major components in our framework. First, a social cluster-based overlay structure and lifetime-aware ooding scheme enable mobile peers to discover resource through the Internet and VANETs. Second, a connectivity-aware retrieval scheme considers connection lifetime and bandwidth schedules and determines how to retrieve resource from available peers. The simulation results show that, compared with other existing P2P schemes, our social cluster-based P2P framework is able to quickly locate more available peers holding the required contents and achieve a higher retrieval ratio. Index TermsVANETs, P2P, Integrated Network

Recall that Peer-to-Peer (P2P) approaches can be used to reduce the load of original content provider and distribute content effectively by leveraging each peers resource such as storage space, processing power, and network bandwidth. Through architecture of VII, peer in vehicles is able to perform P2P functionalities to communicate and share resources with other peers under a hybrid environment of VANETs and the Internet. In this work, peers in this hybrid network are classied into following two types: 1) Fixed Peer: The rst type of peer is the original peer in the Internet. These peers usually have quite stable connectivity except that they leave the Internet. 2) Mobile Peer: The second type of peer refers to the mobile vehicles. Thus, the connectivity in these mobile peers is dynamic and could be worst as vehicles are moving at the high speed. Since the positions of mobile peers change over time, the connections between peers are dynamic in such wirelessmobile environment. A nice P2P system is able to provide a resource discovery scheme for mobile peers to allocate other peers and a resource retrieving scheme for mobile peers to request resources according to peers connectivity and environment situation. We note that the interest of a mobile peer or xed peer is expected to last for a certain period of time. Thus, we use interest-based clustering to group similar peers into a cluster. That is, every cluster has at least one xed peer and multiple mobile peers, which share the same interest. Moreover, unlike intra-cluster construction that only uses interest-based construction to let cluster have more similar resources, we apply the concept of the smallworld into the inter-cluster structure, so a cluster could have certain probability to contact non-similar clusters to locate those contents belonging to other types of interest. Specically, our social cluster-based P2P framework includes: 1) a social cluster-based overlay structure for mobile peers to discover resource according to their interests and cooperate with xed peers; 2) a lifetime-aware ooding scheme for mobile peers to search close mobile peers according to the quality of connection; and 3) a connectivity-aware retrieval scheme for mobile peers to retrieve resource by taking network connectivity and bandwidth into consideration. This paper is organized as follows. Section 2 summarizes related works in performing P2P over ad hoc networks. Section 3 describes the system design and illustrates the basic operation of our Social Cluster-based P2P framework. In Section 4,

I. I NTRODUCTION Non-safety related applications, which are able to improve driving comfort of transportation system and provide interesting entertainment services, in VANETs (Vehicular Adhoc NETworks) has become an emerging research. Hence, Inter-Vehicle Communications (IVC) and Roadside-to-Vehicle Communications (RVC) based on IEEE 802.11 are getting much more attention now. The rst draft of Vehicle Infrastructure Integration (VII [1]) denes the architecture and functional requirements for communications between individual vehicles as well as between vehicles and the infrastructure, where 5.9 GHz Dedicated Short Range Communication (DSRC [2]) is used as the transmission medium. We note that there are two important elements in VII and they are RoadSide Units (RSUs) and On-Board Units (OBUs). RSUs are mounted along side of roads and provide wireless communication to vehicles within their radio coverage. In addition, RSUs connect with each other and backbone by wired links. OBUs are mounted on vehicles to provide wireless communication capability for vehicles and access the Internet via RSUs. Hence, vehicles are able to form an ad hoc network through OBUs, and access to the infrastructure networks through communication of OBUs or RSUs. On the other hand, peerto-peer (P2P) systems have become one of the most popular distributed applications on the Internet today, largely due to their ability to efciently access different types of data, such as audio and video les. Hence, the focus of this paper is how to design an efcient P2P framework for a hybrid environment of VANETs and the Internet.

978-1-4244-2948-6/09/$25.00 2009 IEEE

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the WCNC 2009 proceedings.

we present an in-depth performance study demonstrating the applicability through a simulation study. Finally, concluding remarks are given. II. R ELATED W ORKS In this section, we give a brief literature survey on recent research works on VANETs and le sharing systems as follows. 7DS [3] uses broadcasting to share web content. Users without Internet connectivity can pull and carry content of interest from their neighbors, and diffuse content into this network. PDI [4] uses local broadcasting transmission and caches query results to eliminate the need of ooding the whole network with query messages. ORION [5] constructs and maintains an application-layer overlay network to operate a P2P le sharing system in MANET. It combines query processing and overlay network construction in search algorithm, and enables efcient le transfers on top of the overlay connections that are established by search algorithm. [6][8] consider physical locality in the construction of their Distributed Hash Table (DHT) and integrate the functionality of a DHT and Ad Hoc routing protocol. CarTorrent [9] proposes a cooperative strategy for content sharing which uses a gossip mechanism that leverages broadcast in VANET. Each peer in CarTorrent uses gossip to let other peer know it exists. Mobile peer can communicate with xed peer through RSU, and nd other peer that interests the same le from gossip messages. Network-aware P2P scheme [10], proposes a architecture that divides a P2P le sharing network into multiple network-aware clusters in which peers, not only mobile nodes in wireless environment but also xed nodes in the Internet, are assigned to a network-aware cluster using a network prex division. Network-aware P2P scheme provides continuous resource retrieval and discovery for mobile peers to nd new resource providing peers and obtain fresh status of peers. It also proposes a resource provider selection algorithm for selecting a new resource provider when mobile peers encounter broken connections. Opposed to the P2P systems mentioned above, our work proposes a framework to perform P2P system for integrating VANETs and and the Internet. The framework presented in this paper uses cluster to group similar mobile peers and take dynamically changing topology and intermittent connectivity due to high mobility in VANET into consideration. III. S OCIAL C LUSTER -BASED P2P F RAMEWORK In this section, we describe the social cluster-based P2P framework in detail for a mobile peer to discover and retrieve les from other peers effectively under a hybrid network of VANETs and the Internet. A. Social Cluster-based Overlay Structure Due to high velocity, a mobile peer is required to use more control messages to nd out where other peers are. To eliminate the overhead of discovering mobile peers, we group mobile peers and xed peers into multiple clusters and use these clusters to build overlay networks to help the resources discovery in peers, as shown in Fig.1. Instead of

Fig. 1.

Social Cluster-based Overlay Network

using mobility information to construct clusters, we adopt users preference to group similar peers together. In order to measure whether two peers are similar, we categorize les into many types and construct a prole of peer by which types of les it has. That is, each peer i maintains a preference vector = (w , w , . . . , w , . . .) of each type of le, where w i i,k1 i,k2 i,kl wi,kn denotes the ratio of different types of les k n it has. The ratio of le type kn in peer i is shown as: wi,kn = |Oi,kn | |Oi | (1)

We use cosine similarity measure to quantify the similarity of peer i and j as follows: | | | | w w i j , w (2) Similarity (pi , pj ) = cos ( i wj ) = w w
i j

Next, we describe how to construct the relationship of clusters and build this overlay structure by using similarity measure function as following. 1) Interest-based Intra-Cluster Construction: We apply the concept of the interest-based clustering to group similarinterest peers into a cluster. Every cluster has at least one xed peer and multiple mobile peers. A xed peer acts as cluster head and maintains information of all members within the cluster. A mobile peer that starts to perform P2P picks one more similar xed peer in the Internet by using similarity measure function to join its cluster. Mobile peers that have the similar interests may choose the same cluster head, so a Interest-based cluster is constructed. Each mobile peer registers its information, like registered RSU and le indexes, to its cluster head, and cluster head maintains that information to its cache. Mobile peer updates its le indexes and location information when it downloads a new le completely or changes RSU that it connects. Therefore, by requesting to cluster, each peer could have higher probability to discover the resources from mobile peers that belong to the maintained interests of the cluster. Also, each peer can use cluster head to locate the mobile peers easily. 2) Small-World-based Inter-Cluster Overlay Construction: We use a Small-world-based overlay construction to establish the relationship among the interest-based clusters that have some specic interests. Each cluster head has other mobile peers le indexes, so it can be treated like that cluster head has those les because it can inform other peers of where to retrieve those les. To construct overlay structure, a cluster head uses those cached les to measure similarity

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the WCNC 2009 proceedings.

with other cluster heads. Unlike intra-cluster construction that only uses interest-based construction to let cluster have more similar resources, a inter-cluster structure is expected to let cluster have certain probability to contact non-similar cluster to increase the ratio of resources that can be found. Therefore, we use small-world-based inter-cluster overlay construction to build overlay network. Cluster head will choose other more similar cluster heads to establish relationship at rst. Then, cluster head tries to choose some its similar neighbors with a probability to replace with random peers that are found from the random walks. Random walk is a method to get a peer that is not so similar with cluster head. When a cluster head picks up a neighbor to do random walk, it will send a request to that peer. A xed peer receiving this request will use a probability to pick up one of its neighbors to deliver this request or do nothing. When this request stops or reaches to its TTL, the peer where this request stops at is used to replace the original similar peer. After the overlay structure is constructed, peer can use this overlay network to discover resources. A mobile peer sends query message to its cluster head when it requires a resource. A cluster head that hears query message searches its cached le indexes to see if it has any information of this resource. Then, it replies a list of peers that have resource to requesting peer if it has cached le indexes in its buffer. Otherwise, it forwards this query message to other clusters with constraint TTL.

between two nodes is calculated as follows: LET = (a2 + c2 )r2 (ad bc)2 (ab + cd) a2 + c2 (3) b = xi xj d = yi y j

where a = vi cos i vj cos j c = vi sin i vj sin j

Fig. 2.

Mobility information of the mobile peers i and j

Since every vehicle in VANET periodically broadcasts beacon that contains its mobility information such as GPS location and moving velocity. Thus, every mobile peer has knowledge about that how many mobile peers around it, and can compute connection lifetime with those mobile peers using (3). Therefore, in lifetime-aware ooding scheme, only a mobile peer that has longer connection lifetime with query sender than nearby mobile peers will forward the query.

B. Lifetime-aware Flooding Scheme Using social cluster-based overlay structure let a mobile peer search its required contents from xed peers or mobile peers by communicating through RSUs. However, in a VANET environment, mobile peer can get les from other mobile peers around it directly without any help from a cluster head. A simple way is to ood the query to nearby mobile peers, but it might cause serious broadcast storm problem. Therefore, we propose our lifetime-aware ooding scheme that uses connection lifetime to control broadcasting query. The connections between mobile peers are intermittent. A mobile peer is not useful if the lifetime of the connection is too short, even if that peer has rich les. Therefore, if a mobile peer wants to retrieve les from other mobile peers, it needs to take connection lifetime between two mobile peers into consideration. Previous works uses connection lifetime (or Link Expiration Time, LET) to estimate routing path lifetime. [11][13] use LET to choose a longer lifetime path and predict a possible link breakage event prior to its occurrence. The connection lifetime can also be used at application layer to let peer have capability to choose peers in accordance with the lifetime that two peers can communicate. Connection lifetime between mobile peers is the time that two vehicles can maintain routing path with each other. From [11], in a general case, if we consider two nodes i and j with transmission range r and coordinates (xi , y i ) and (xj , y j ). Let v i and v j as speeds, i and j are moving direction of nodes i and j , respectively in Fig.2. The predicted connection lifetime

(a) Mobile peer A broadcasts query message to mobile peers around it

(b) Mobile peer C and E hear this query and broadcasts it for mobile peer A Fig. 3. Operation of Flooding-based Search Scheme

Fig.3 illustrates the operation of lifetime-aware ooding. When a mobile peer A wants to search near mobile peers, it oods its query message to all mobile peers around it, as illustrated in Fig.3(a). Mobile peer hears this query message will decide whether it needs to forward query message for mobile peer A. Because mobile peer has knowledge of around mobile peers, it can measure connection time with mobile peer where it gets query message from. It also uses information to measure connection lifetime of all peers that receive the same query message with the mobile peer A. If a mobile peer nds it has the longer connection lifetime than other mobile peers around it, it will act as a query message forwarder to re-ood this query message, otherwise it only check whether it has

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the WCNC 2009 proceedings.

the le for this query. As Fig.3(b) illustrates, mobile peer C nds its connection lifetime is larger than mobile peers B and D, mobile peer E nds its connection lifetime is larger than mobile peers F and G, so mobile peers C and E will re-ood the query message. Therefore, using lifetime-aware ooding scheme can discover peers that have longer connection lifetime and eliminate the broadcast storm. C. Connectivity-aware Retrieval Scheme Unlike stable connection in wired Internet, connections in VANET are intermittent, and thus the path between two peers may be broken and cannot be constructed anymore. If a peer requests too many blocks at once without considering path quality, it might waste network bandwidth. Too many packets that cannot be transmitted to destination are redundant and cause packet collisions. Therefore, we need to consider the quality of the path between two peers to decide how to retrieve resources. Here, we propose our connectivity-aware retrieval scheme that takes path lifetime and bandwidth into consideration. In order to obtain path lifetime and bandwidth of peers, peer that requires resource periodically sends query message to other peers by using above two search methods (Social Cluterbased Overlay Search Scheme and Lifetime-aware Flooding Scheme). This query message can replace the procedures of exchanging bitmaps and sending I am alive message frequently. Every peer that hears query message and has the requested resource will reply bitmap to the sender. This reply message updates not only the peers le information but also the peers status. A peer that does not reply can be treated as not available. This reply message can be used to compute connection lifetime of each link among mobile peers and RSUs that are not within one-hop range. Connection lifetime of a link is computed when a mobile peer receives a reply message, and the peer records the minimum connection lifetime along this path into the packet header of the reply message. Therefore, a requesting peer that receives reply message can obtain the path lifetime that routing path can be established. The transmission bandwidth also can be computed by the round-trip time of the query and reply messages. After getting path lifetime and bandwidth, we can use them to estimate how many packets can be transmitted within the path lifetime. We also use peer information to check how many blocks that each peer can provide. We choose available peer(s) at one time, and request those peer(s) with as many as blocks that can be provided. We use an example to illustrate the procedure of connectivity-aware retrieval scheme. We assume a mobile peer S nds a set of N available peers which can provide resource. REQ and Ai denotes the set of blocks to be retrieved by peer S and the set of blocks available from peer i, respectively. T i;S and T B i denotes the path lifetime between peer S and peer i and the transmission bandwidth that peer S gets packets from peer i last time, respectively. P denotes the block size. Therefore, B i that denotes the set of blocks volume available transmitting from peer i in the path lifetime between peer S and i can be calculated as follows: T i;S T B i , 1) (4) B i = max( P

We let Gi be the predicted block number that peer S can get from peer i in the path lifetime, that is: Gi = REQ Ai B i (5)

After mobile peer S estimates the block number that all discovered peers can provide, it decides to retrieve resource through either pure ad hoc routing or RSU. If mobile peer S retrieves le through pure ad hoc routing, it only pick one mobile peer to retrieve les from it. Since we do not use multi-channel, retrieving le from multiple mobile peers simultaneously may cause serious packet collision. Therefore, it picks one mobile peer that can provide the most blocks from all available mobile peers: Gk Gi where k, i N adhoc (6)

If mobile peer S decides to retrieve le through RSU, it can retrieve resource from mobile or xed peers that are discovered with the help from cluster head. It can use multiple mobile and xed peers to retrieve resource simultaneously because the connection is only between mobile peer S and RSU. Mobile peer can schedule how to download blocks from those peers to achieve the highest performance. Therefore, when mobile peer S tries to retrieve les, it will measure whether retrieve les through RSU or pure ad hoc routing has the highest performance and chooses one to retrieve les. IV. P ERFORMANCE A NALYSIS To evaluate the performance of our proposed social clusterbased P2P framework and other existing schemes, we use the Network Simulator NS-2 with the wired-cum-wireless scenario to represent the wireless-mobile environment. The mobility patterns of vehicles are based on GIS-based mobility model, which uses detailed street maps from the Swiss geographic information system (GIS) [14] to generate mobility traces. There are 200 xed peers in a geographical area of 3, 000meters by 3, 000meters grid, as shown in Fig.4. Both mobile node and RSU are congured with the 802.11n standard MAC protocol that has the transmission range of approximately 250meters and transmission rate of 27M bits/sec. As for the underlying routing protocol, we use AODV+ [15], which a modied version of Ad-hoc On-demand Distance Vector routing to perform gateway discovery. More detailed parameters are given in Table I.

Fig. 4.

3,000 meters by 3,000 meters Urban scenario

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the WCNC 2009 proceedings.

TABLE I S IMULATION S ETTING Factor Broadcast TTL Packet Size Packet Per Block Block Per File Overlay Neighbor
0.6 Social Cluster-based P2P Framework Network-Aware P2P Scheme CarTorrent Gnutella Interest-based P2P Scheme

0.5 Social Cluster-based P2P Framework Network-Aware P2P Scheme CarTorrent Gnutella Interest-based P2P Scheme 0.4

Retrieve File Ratio

Range of Value 3 hops 500 Bytes 32 48 3

0.3

0.2

0.1

0.5

0 0.4 Query Hit Ratio 2 6 12 18 RSU Number 24 30 36

0.3

Fig. 6. The ratio of queried les that are been retrieved completely under scenarios of various RSU numbers
Social Cluster-based P2P Framework Network-Aware P2P Scheme CarTorrent Gnutella Interest-based P2P Scheme

0.2

0.1 Message Overhead (Message/Retrieve File)

10000

0 2 6 12 18 RSU Number 24 30 36

1000

Fig. 5. The ratio of queried les that are been found under scenarios of various RSU numbers

100

To emulate the access patterns of each nodes and make it more realistic, we use log-based user proles collected from AudioScrobbler [16], which is a database that tracks listening habits by collecting the play-lists of users media players. We collect proles for 1355 fans that had listen to some popular styles of music. The proles that we collect have 31005 distinct les, and can be categorized into 83 kinds of music types. Here, we treat each music type as one kind of le types. We use each prole we collect to setup up the le cache in peers buffer, and let each mobile peer request one le in simulation time. There are four schemes that are used to compare with our proposed framework in this paper. The rst work we compare is CarTorrent [9]. Block availability gossiping is carried out for every 5 seconds. We limit the scope of the gossip to 3 hops as proposed in the original design. Peer uses a probabilistic gossiping: uninterested and interested nodes forward the gossip message with probability 0.1 and 0.8 respectively. Since CarTorrent does not mention the relationship of xed peers and mobile peers, we let a mobile peer randomly ask some xed peers to discover resource in the Internet. The second one is the Network-aware P2P scheme [10]. We divide networkaware clusters into 36 clusters, the maximum RSU number can be in our simulation, and all RSUs belong to different clusters. Mobile peers and xed peers may belong to the same cluster if they have the same network prexes. The receiver-driven discovery control (RDC) is used to discover and update peers information. The third one is pure Gnutella P2P system [17] that is designed for the wired Internet. The last one is Interestbased P2P scheme that each peer uses similarity to construct relationship with other peers. In this experiment, we would like to investigate the query hit ratio of different P2P schemes under scenarios of various RSU numbers. In this case, there are 200 mobile peers, and each

10

1 2 6 12 18 RSU Number 24 30 36

Fig. 7. Message overhead which is used to retrieve a resource completely under scenarios of various RSU numbers

peer has 50 cached les. As shown in Fig.5, we can see our proposed framework outperforms other works. This is because Gnutella and Interest-based P2P scheme randomly pick peers as their neighbors and does not consider the properties of wireless mobile networks. Therefore, they cannot have good query hit ratio. We note that Network-Aware P2P scheme uses network prexes to group peers so mobile peer has capability to search more mobile and xed peers when RSU number increases. However, members in cluster do not share the same interest so it cannot achieve as efcient search as our proposed framework does. Beside, Network-aware P2P scheme requires re-sending query message when it changes IP or resource provider changes its cluster. Thus, it is hard to adapt the change of network topology when mobile peers change IP frequently. CarTorrent only use gossip to discover mobile peers, so mobile peers cannot discover efciently from other mobile peers. Also, CarTorrent randomly searches xed peers, it cannot get good query hit ratio. Next, we want to see the impact of various number of RSUs on the retrieve le ratio of different P2P schemes and the results are illustrated in Fig.6. Due to the nature of wireless transmission, there is an upper bound of transmission bandwidth in wireless environment so all the retrievals is limited to this bound even when the number of RSU increases. Our proposed framework is able to outperform other schemes because it can utilize all potential bandwidth to deliver the

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the WCNC 2009 proceedings.

0.6 Social Cluster-based P2P Framework Network-Aware P2P Scheme CarTorrent Gnutella Interest-based P2P Scheme

0.5

0.4 Query Hit Ratio

0.3

framework, which considers the similarity and connectivity between peers, including (a) a social cluster-based overlay structure, (b) a lifetime-aware ooding scheme, and (c) a connectivity-aware retrieval scheme. The simulation results shows that our proposed framework is able to achieve higher discovering rate and retrieving speed than existing schemes do. VI. ACKNOWLEDGEMENTS

0.2

0.1

0 10 20 30 40 Inital Cache File Number 50 60

Fig. 8. les

Performance of resource discovery with various numbers of cached

This work was partially supported by the National Science Council and the Ministry of Education of R.O.C. under the Contract No. NSC97-2221-E-018-013, NSC97-2221-E-002139-MY2, NSC97-2219-E-002-026, NSC97-2221-E-002-135MY2 and NSC97-2622-E-002-010-CC2. R EFERENCES

required contents to the user. On the contrary, other four schemes only can use partial of wireless bandwidth. This is why their performance could still obtain little or some improvement when the number of RSU increases. Fig.7 illustrates results of the message overhead, which is used to retrieve a resource completely, for different P2P schemes. Our proposed scheme might use little more bandwidth when the number of RSU increases because it has higher probability to search in the Internet. Note that the overhead of our framework does not increase much because our scheme can use fewer hops to discover the resource provider. Network-aware P2P scheme uses fewer messages overhead at the beginning because its search method needs to go through RSUs. When the number of RSU increases, it also increases the overhead that is used to search through cluster head. CarTorrent costs fewer messages overhead when RSU number increases because it tries to search the Internet rst and does not ood gossiping message around near mobile peers. We note that since Gnutella and Interest-based P2P scheme cannot discover enough available resource providers, they have to spend much bandwidth to retrieve the required contents. The motivation for this experiment is that we investigate the performance of resource discovery for different P2P schemes under scenarios of various numbers of initial cached les. In this case, there are 200 mobile peers, and there are 24 RSUs in this grid. The reason for this simulation settings is that we can see that Query Hit Ratio increases slowly after RSU number reaches 24 in Fig.5. As shown in Fig.8, when number of cached les in peers buffer increases, peer is easier to discover its required contents. Since our proposed framework applies preference relationship to construct overlay structure, more cached les in peers buffer can be used to estimate correctly similarity for each peer. Therefore, when the number of cached les increases, the improvement among ours and other scheme becomes larger. V. C ONCLUSION In this paper, we aim to design a P2P system that can perform well in integrated network of VANET and the Internet. Our Objective is to nd available peers and effectively use those peers. Therefore, we propose a social cluster-based P2P

[1] P. Farradyne, Vehicle infrastructure integration (VII)-architecture and functional requirements, Draft Version, vol. 1. [2] C. Cseh, Architecture of the dedicated short-range communications (DSRC) protocol, Vehicular Technology Conference, 1998. VTC 98. 48th IEEE, vol. 3, 1998. [3] M. Papadopouli and H. Schulzrinne, Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices, Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, pp. 117127, 2001. [4] C. Lindemann and O. Waldhorst, A distributed search service for peerto-peer le sharing in mobile applications, Peer-to-Peer Computing, 2002.(P2P 2002). Proceedings. Second International Conference on, pp. 7380, 2002. [5] A. Klemm, C. Lindemann, and O. Waldhorst, A special-purpose peerto-peer le sharing system for mobile ad hoc networks, Vehicular Technology Conference, 2003. VTC 2003-Fall. 2003 IEEE 58th, vol. 4, 2003. [6] M. Caesar, M. Castro, E. Nightingale, G. OShea, and A. Rowstron, Virtual ring routing: network routing inspired by DHTs, Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 351362, 2006. [7] H. Pucha, S. Das, and Y. Hu, Ekta: an efcient DHT substrate for distributed applications in mobile ad hoc networks, Mobile Computing Systems and Applications, 2004. WMCSA 2004. Sixth IEEE Workshop on, pp. 163173, 2004. [8] T. Zahn and J. Schiller, MADPastry: A DHT Substrate for Practicably Sized MANETs, 5th Workshop on Applications and Services in Wireless Networks (ASWN 2005). [9] A. Nandan, S. Das, G. Pau, M. Gerla, and M. Sanadidi, Cooperative Downloading in Vehicular Ad-hoc Wireless Networks, Proc. of IEEE/IFIP International Conference on Wireless On demand Network Systems and Services, St. Moritz, Switzerland, pp. 3241, 2005. [10] C. Huang, T. Hsu, and M. Hsu, Network-Aware P2P File Sharing over the Wireless Mobile Networks, IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, vol. 25, no. 1, p. 204, 2007. [11] W. Su, S. Lee, and M. Gerla, Mobility prediction and routing in ad hoc wireless networks, Int. J. Network Mgmt, vol. 11, pp. 330, 2001. [12] T. Taleb, E. Sakhaee, A. Jamalipour, K. Hashimoto, N. Kato, and Y. Nemoto, A Stable Routing Protocol to Support ITS Services in VANET Networks, Vehicular Technology, IEEE Transactions on, vol. 56, no. 6 Part 1, pp. 33373347, 2007. [13] V. Namboodiri and L. Gao, Prediction Based Routing for Vehicular Ad Hoc Networks, IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, vol. 56, no. 4, p. 2332, 2007. [14] T. S. F. O. of Topography swisstopo, VECTOR 25 - Landscape model of Switzerland. [15] A. Hamidian, U. K orner, and A. Nilsson, Performance of Internet Access Solutions in Mobile Ad Hoc Networks, Dagstuhl-Workshop Mobility and Wireless in Euro-NGI, pp. 189201, 2005. [16] AudioScrobbler. [Online]. Available: http://www.audioscrobbler.net [17] D. Clip, Gnutella Protocol Specication v0. 4. [Online]. Available: http//www.clip2.com/GnutellaProtocol04.pdf