Fog Computing Based Radio Access Networks: Issues and Challenges

The fog computing based radio access networks work at the same time as capable worldview commencing to 5G remote transmitting framework give elevated unearthly along with vitality effectiveness. In center thought obtain complete points to interest of neighborhood radio flag preparing, consistent on radio asset administration and disseminated putting away abilities in edge gadgets, which can diminish the substantial weight on front haul. In light of fog computing, the cooperation radio flag handling (CRSP) cannot exclusively accomplish during the unified baseband unit into cloud radio access networks. Unfasten concern into the condition of software defined networking, network function virtualization and edge caching recognized. This paper attempts to minimize the security issues in the performance of edge cashing by using Markov chain model. Simulation results are able to reduce the bandwidth consumption of F_RAN through edge caching in between remote radio heads and user equipments

Social-Aware Edge Caching in Fog Radio Access Networks

Fog radio access networks (F-RANs) are becoming an emerging and promising paradigm for fifth generation cellular communication systems. In F-RANs, distributed edge caching techniques among remote radio heads (RRHs) and user equipment (UE) can effectively alleviate the burdens on the fronthaul toward the base band unit pool and the bandwidth of the RANs. However, it is still not clear as to how social relationships affect the performance of edge caching schemes. This paper attempts to analyze the impact of mobile social networks (MSNs) on the performance of edge caching in F-RANs. We propose a Markov-chain-based model to analyze edge caching among edge nodes (i.e., RRHs and MSNs), as well as data sharing among the potential MSNs from the viewpoint of content diffusion in the F-RANs. Moreover, we analyze the edge caching schemes among UE to minimize the bandwidth consumption in the RANs. Finally, the optimal edge caching strategies among RRHs in terms of caching locations and time are introduced to minimize the bandwidth consumption of fronthaul and storage costs in the F-RANs. Simulation results show that the proposed edge caching schemes among UE and RRHs are able to reduce the bandwidth consumption of RANs and fronthaul effectively

Decentralized content sharing among tourists in visiting hotspots

Content sharing with smart mobile devices using decentralized approach enables users to share contents without the use of any fixed infrastructure, and thereby offers a free-of-cost platform that does not add to Internet traffic which, in its current state, is approaching bottleneck in its capacity. Most of the existing decentralized approaches in the literature consider spatio-temporal regularity in human movement patterns and pre-existing social relationship for the sharing scheme to work. However, such predictable movement patterns and social relationship information are not available in places like tourist spots where people visit only for a short period of time and usually meet strangers. No works exist in literature that deals with content sharing in such environment. In this work, we propose a content sharing approach for such environments. The group formation mechanism is based on users' interest score and stay probability in the individual region of interest (ROI) as well as on the availability and delivery probabilities of contents in the group. The administrator of each group is selected by taking into account its probability of stay in the ROI, connectivity with other nodes, its trustworthiness and computing and energy resources to serve the group. We have also adopted an incentive mechanism as encouragement that awards nodes for sharing and forwarding contents. We have used network simulator NS3 to perform extensive simulation on a popular tourist spot in Australia which facilitates a number of activities. The proposed approach shows promising results in sharing contents among tourists, measured in terms of content hit, delivery success rate and latency

Towards Efficient File Sharing and Packet Routing in Mobile Opportunistic Networks

With the increasing popularity of portable digital devices (e.g., smartphones, laptops, and tablets), mobile opportunistic networks (MONs) [40, 90] consisting of portable devices have attracted much attention recently. MONs are also known as pocket switched networks (PSNs) [52]. MONs can be regarded as a special form of mobile ad hoc networks (MANETs) [7] or delay tolerant networks (DTNs) [35, 56]. In such networks, mobile nodes (devices) move continuously and meet opportunistically. Two mobile nodes can communicate with each other only when they are within the communication range of each other in a peer-to-peer (P2P) manner (i.e., without the need of infrastructures). Therefore, such a network structure can potentially provide file sharing or packet routing services among portable devices without the support of network infrastructures. On the other hand, mobile opportunistic networks often experience frequent network partition, and no end-to-end contemporaneous path can be ensured in the network. These distinctive properties make traditional file sharing or packet routing algorithms in Internet or mobile networks a formidable challenge in MONs. In summary, it is essential and important to achieve efficient file sharing and packet routing algorithms in MONs, which are the key for providing practical and novel services and applications over such networks. In this Dissertation, we develop several methods to resolve the aforementioned challenges. Firstly, we propose two methods to enhance file sharing efficiency in MONs by creating replicas and by leveraging social network properties, respectively. In the first method, we investigate how to create file replicas to optimize file availability for file sharing in MONs. We introduce a new concept of resource for file replication, which considers both node storage and meeting frequency with other nodes. We theoretically study the influence of resource allocation on the average file access delay and derive a resource allocation rule to minimize the average file access delay. We also propose a distributed file replication protocol to realize the deduced optimal file replication rule. In the second method, we leverage social network properties to improve the file searching efficiency in MONs. This method groups common-interest nodes that frequently meet with each other into a community. It takes advantage of node mobility by designating stable nodes, which have the most frequent contact with community members, as community coordinators for intra-community file request forwarding, and highly-mobile nodes that visit other communities frequently as community ambassadors for inter-community file request forwarding. Based on such a community structure, an interest-oriented file searching scheme is proposed to first search local community and then search the community that is most likely to contain the requested file, leading to highly efficient file sharing in MONs. Secondly, we propose two methods to realize efficient packet routing among mobile nodes and among different landmarks in MONs, respectively. The first method utilizes distributed social map to route packets to mobile nodes efficiently with a low-cost in MONs. Each node builds its own social map consisting of nodes it has met and their frequently encountered nodes in a distributed manner. Based on both encountering frequency and social closeness of two linked nodes in the social map, we decide the weight of each link to reflect the packet delivery ability between the two nodes. The social map enables more accurate forwarder selection through a broader view and reduces the cost on information exchange. The second method realizes high-throughput packet routing among different landmarks in MONs. It selects popular places that nodes visit frequently as landmarks and divides the entire MON area into sub-areas represented by landmarks. Nodes transiting between two landmarks relay packets between the two landmarks. The frequency of node transits between two landmarks is measured to represent the forwarding capacity between them, based on which routing tables are built on each landmark to guide packet routing. Finally, packets are routed landmark by landmark to reach their destination landmarks. Extensive analysis and real-trace based experiments are conducted to support the designs in this Dissertation and demonstrate the effectiveness of the proposed methods in comparison with the state-of-art methods. In the future, we plan to further enhance the file sharing and packet routing efficiency by considering more realistic scenarios or including more useful information. We will also investigate the security and privacy issues in the proposed methods