Offloading Content with Self-organizing Mobile Fogs

Mobile users in an urban environment access content on the internet from different locations. It is challenging for the current service providers to cope with the increasing content demand from a large number of collocated mobile users. In-network caching to offload content at nodes closer to users alleviate the issue, though efficient cache management is required to find out who should cache what, when and where in an urban environment, given nodes limited computing, communication and caching resources. To address this, we first define a novel relation between content popularity and availability in the network and investigate a node's eligibility to cache content based on its urban reachability. We then allow nodes to self-organize into mobile fogs to increase the distributed cache and maximize content availability in a cost-effective manner. However, to cater rational nodes, we propose a coalition game for the nodes to offer a maximum "virtual cache" assuming a monetary reward is paid to them by the service/content provider. Nodes are allowed to merge into different spatio-temporal coalitions in order to increase the distributed cache size at the network edge. Results obtained through simulations using realistic urban mobility trace validate the performance of our caching system showing a ratio of 60-85% of cache hits compared to the 30-40% obtained by the existing schemes and 10% in case of no coalition

Effect of Location Accuracy and Shadowing on the Probability of Non-Interfering Concurrent Transmissions in Cognitive Ad Hoc Networks

Cognitive radio ad hoc systems can coexist with a primary network in a scanning-free region, which can be dimensioned by location awareness. This coexistence of networks improves system throughput and increases the efficiency of radio spectrum utilization. However, the location accuracy of real positioning systems affects the right dimensioning of the concurrent transmission region. Moreover, an ad hoc connection may not be able to coexist with the primary link due to the shadowing effect. In this paper we investigate the impact of location accuracy on the concurrent transmission probability and analyze the reliability of concurrent transmissions when shadowing is taken into account. A new analytical model is proposed, which allows to estimate the resulting secure region when the localization uncertainty range is known. Computer simulations show the dependency between the location accuracy and the performance of the proposed topology, as well as the reliability of the resulting secure region

Fast Cell Discovery in mm-wave 5G Networks with Context Information

The exploitation of mm-wave bands is one of the key-enabler for 5G mobile radio networks. However, the introduction of mm-wave technologies in cellular networks is not straightforward due to harsh propagation conditions that limit the mm-wave access availability. Mm-wave technologies require high-gain antenna systems to compensate for high path loss and limited power. As a consequence, directional transmissions must be used for cell discovery and synchronization processes: this can lead to a non-negligible access delay caused by the exploration of the cell area with multiple transmissions along different directions. The integration of mm-wave technologies and conventional wireless access networks with the objective of speeding up the cell search process requires new 5G network architectural solutions. Such architectures introduce a functional split between C-plane and U-plane, thereby guaranteeing the availability of a reliable signaling channel through conventional wireless technologies that provides the opportunity to collect useful context information from the network edge. In this article, we leverage the context information related to user positions to improve the directional cell discovery process. We investigate fundamental trade-offs of this process and the effects of the context information accuracy on the overall system performance. We also cope with obstacle obstructions in the cell area and propose an approach based on a geo-located context database where information gathered over time is stored to guide future searches. Analytic models and numerical results are provided to validate proposed strategies.Comment: 14 pages, submitted to IEEE Transaction on Mobile Computin

Mobile ad hoc networks for intelligent systems

Advances in wireless technology and portable computing along with demands for high user mobility have provided a major promotion toward the development of ad hoc networks. Mobile ad hoc networks feature dynamic topology, self-organization, limited bandwidth and battery power of a node. They do not rely on specialized routers for path discovery and traffic routing. Research on ad hoc networks has been extensively investigated in the past few years and related work has focused on many of the layers of the communications architecture. This research intends to investigate applications of MANET for intelligent systems, including intelligent transportation system (ITS), sensor network and mobile intelligent robot network, and propose some approaches to topology management, link layer multiple access and routing algorithms. Their performance is evaluated by theoretical analysis and off-the-shelf simulation tools. Most current research on ad hoc networks assumes the availability of IEEE 802.11. However, the RTS/CTS protocol of 802.11 still leads to packet collision which in turn decreases the network throughput and lifetime. For sensor networks, sensors are mostly battery operated. Hence, resolving packet collision may improve network lifetime by saving valuable power. Using space and network diversity combination, this work proposes a new packet separation approach to packet collision caused by masked nodes. Inter-vehicle communication is a key component of ITS and it is also called vehicular ad hoc network. VANET has many features different from regular MANETs in terms of mobility, network size and connectivity. Given rapid topology changes and network partitioning, this work studies how to organize the numerous vehicular nodes and establish message paths between any pair of vehicular nodes if they are not apart too far away. In urban areas, the inter-vehicle communication has different requirements and constraints than highway environments. The proposed position-based routing strategy for VANETs utilizes the traffic pattern in city environments. Packets are forwarded based on traffic lights timing sequence and the moving direction of relaying vehicles. A multicast protocol is also introduced to visualize the real time road traffic with customized scale. Only vehicles related to a source node\u27s planned trajectory will reply the query packet. The visualized real time traffic information therefore helps the driver make better decision in route planning when traffic congestion happens. Nowadays robots become more and more powerful and intelligent. They can take part in operations in a cooperative manner which makes distributed control necessary. Ad hoc robot communication network is still fresh field for researchers working on networking technology. This work investigates some key issues in robot ad hoc network and evaluate the challenges while establishing robot ad hoc networks

Energy Efficient Multicast Routing in Mobile Ad Hoc Networks: Contemporary Affirmation of Benchmarking Models in Recent Literature

The Mobile Ad hoc Networks playing critical role in network aided communication requirements The features such as ad hoc and open architecture based connectivity and node mobility are elevating the mobile ad hoc networks as much as feasible to deploy and use The direct communication between any of two nodes in this network is possible if target node is in the range of source node If not the indirect communication took place which is usually referred as multi hop routing The multi hop routing occurs as either a unicast model one source node to one destination node multicast model one source node to multiple destination nodes or multiple casting manifold unicast routing In these routing strategies provision of service quality in multi hop routing is a challenging task The optimal quality of service in routing magnifies the delivery ratio transmission rate network life span and other expected characteristics of the ad hoc routing Among the quality service provision factors minimal energy conservation is prime factor which is since the nodes involved in routing are self-energized and if discharged early then the route will be destructed that causes discontinued routing The energy consumption is more specific in multicast routing hence it is grabbing the more attention of the current research contribution