Issue No. 08 - August (2009 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2009.41
Roy D. Yates , Rutgers University, North Brunswick
Wing Ho Yuen , Telcordia Technologies, Piscataway
Siun-Chuon Mau , Telcordia Technologies, Piscataway
The capacity of mobile Infostation network can be greatly increased, if, in addition to direct short-range communications between mobile nodes and fixed infostations, nodes also communicate amongst themselves whenever they meet. However, this requires cooperation among mobile nodes that are not necessarily spontaneous for commercial applications. We propose means to create opportunistic cooperation in the context of contention distribution in selfish mobile infostation networks. First, we assume that all nodes have a common interest in all files. We stipulate a social contract such that a bilateral file exchange takes place only when either node obtains something it wants from the exchange. Resulting capacity depends on mobility, the number of files being disseminated, and node density. In addition to the existence of multiuser diversity, our results indicate the existence of data diversity—throughput increases as the number of files of interest to all nodes increases. We also consider the case where nodes have dissimilar interests. Results show that as the level of interest overlap decreases, network performance degrades dramatically. We propose an alternate user strategy in the partially overlapping-interests case and show that network throughput is significantly improved by allowing better use of multiuser diversity. We conclude that through opportunistic cooperation, both data and multiuser diversities exist in noncooperative mobile infostation networks.
Mobile infostation networks, ad hoc networks, noncooperative networks, cooperation, content distribution, multiuser diversity, data diversity.
Roy D. Yates, Wing Ho Yuen, Siun-Chuon Mau, "Existence of Data and Multiuser Diversities in Noncooperative Mobile Infostation Networks", IEEE Transactions on Mobile Computing, vol. 8, no. , pp. 1117-1131, August 2009, doi:10.1109/TMC.2009.41