Learn More
In this paper, we define multicast for an ad hoc network through nodes' mobility as MotionCast and study the delay and capacity tradeoffs for it. Assuming nodes move according to an independently and identically distributed (i.i.d.) pattern and each desires to send packets to <i>k</i> distinctive destinations, we compare the delay and capacity in two(More)
Caching plays an important role in reducing the backbone traffic when serving high-volume multimedia content. Recently, a new class of coded caching schemes have received significant interest because they can exploit coded multi-cast opportunities to further reduce backbone traffic. Without considering file popularity, prior works have characterized the(More)
Since wireless channel is vulnerable to eavesdroppers, the secrecy during message delivery is a major concern in many applications such as commercial, governmental, and military networks. This paper investigates information-theoretic secrecy in large-scale networks and studies how capacity is affected by the secrecy constraint where the locations and(More)
Coded caching can exploit new multicast opportunities even when multiple users request different pieces of content, and thus can significantly reduce the backhaul requirement for serving high-volume content. However, existing studies of coded caching have been limited to the scenarios where all files of interest are of a common size. This work studies the(More)
With the advent of smart portable devices and location-based applications, user's mobility pattern is found to be highly dependent on varying locations. In this paper, we analyze asymptotic throughput-delay performance of mobile ad hoc networks (MANETs) under a location popularity based scenario, where users are more likely to visit popular locations. This(More)
—Since wireless channel is vulnerable to eavesdrop-pers, the secrecy during message delivery is a major concern in many applications such as commercial, governmental and military networks. This paper investigates information-theoretic secrecy in large-scale networks and studies how capacity is affected by the secrecy constraint where the locations and(More)
—In this paper, we study the throughput and delay in wireless cognitive social networks. Specifically, we consider a common scenario for cognitive radio networks (CRN) where the primary and secondary networks operate at the same time, space and share the spectrum. On this basis, we integrate social relationship into CRN where each source node selects its(More)
This paper characterizes an evolving network with growing number of nodes, which are associated with each other through social relations but employ transmission via wireless communications. The network exhibits social relations between nodes by attaching a new arriving node to a sample node already existing as well as some nodes the sample directly links(More)