Message delivery in opportunistic mobile networks is a challenging task since the network topology constantly changes and end-to-end paths can hardly be sustained. Epidemic routing forwards a copy message to each contacted node to achieve a high network delivery performance; this however easily burdens the network nodes with high traffic load, quickly depleting the node’s resources, e.g. power and storage, and finally degrading the network delivery performance. This paper proposes an interest-based Epidemic that improves Epidemic to be a content-aware forwarding by taking message content, node interest, and node community into consideration. Using simulation, driven by real human contact datasets, we investigate the performance of the proposed algorithm compared with Epidemic (content-oblivious) and Direct Transmission (content-aware), in terms of total delivered messages, average convergence time, and total relayed messages. Simulation results show that Epidemic-Interest outperforms Direct Transmission in terms of total delivered message and average convergence time. Moreover, compared with Epidemic, it can reduces the transmission cost while keeping the total delivered messages as high as Epidemic’s; however, it increases the convergence time beyond that of Epidemic.
Mobile social networks suffer from an unbalanced traffic load distribution due to the heterogeneity in mobility of nodes (humans) in the network. A few nodes in these networks are highly mobile, and the proposed social-based routing algorithms are likely to choose these most “social” nodes as the best message relays. Finally, this could lead to inequitable traffic load distribution and resource utilisation, such as faster battery drain and/or storage consumption of the most (socially) popular nodes. We propose a framework called Traffic Load Distribution Aware (TraLDA) to improve traffic load balancing across network nodes. We present a novel method for calculating node popularity which takes into account both node inherent and social-relations popularity. The former is purely determined by the node’s sociability level in the network, and in TraLDA is computed using the Kalman prediction which considers the node’s periodicity behaviour. However, the latter takes the benefit of interactions with more popular neighbours (acquaintances) to boost the popularity of lower (social) level nodes. Using extensive simulations in the Opportunistic Network Environment (ONE) driven by real human mobility scenarios, we show that our proposed strategy enhances the traffic load distribution fairness of the classical, yet popular social-aware routing algorithms BubbleRap and SimBet without negatively impacting the overall delivery performance.
27 August 2022 in Indonesian Journal of Information Systems
As an instance of a distributed computing system, opportunistic networks facilitate message dissemination in a store-carry-forward manner. In this setting, the mobile devices are communicating in opportunistic contacts as they move across the network areas. However, the movement of these mobile devices is exclusively reliant on the mobility of their human owner, thereby limiting the likelihood of contact. The current state of the art typically simulates human movement based on randomness, which is unsuitable for representing how people move in groups. Therefore, this paper proposes an implementation of a group-based human mobility model to simulate device-to-device communication in opportunistic networks. In this model, individuals are able to move as a set within a group and have the ability to join and leave the group dynamically We built the model in BonnMotion and subsequently implemented it in an opportunistic environment simulator, ONE Simulator. To evaluate the proposed model, we compared them to the random-based model as a benchmark. Subsequently, we assess the impact of the movement model on two major areas of network performance: message delivery performance and resource utilization, such as nodes’ energy consumption. We are concerned about these aspects since the mobile agents have limited resources yet are expected to achieve a high rate of message delivery as well. The simulation results show that our model outperformed the random-based model in terms of the number of successfully delivered messages and average delay. However, the number of message replications and the energy consumption is fairly higher than those of the benchmarks.
Although flooding-based message dissemination in opportunistic mobile networks yields high delivery performance, the nodes' resources, such as energy and buffer, are rapidly depleted due to the enormous quantity of message replicas dispersed over the networks. This study aims to reduce the number of message replicas in the networks while maintaining an acceptable delivery rate. Inspired by Conway's Game of Life, which uses cellular automaton-based neighbor conditions to regulate the total population, we propose RiGoL, a replication control-based technique for determining how many neighbors hold the same messages. We utilize a counter to keep track of the number of neighbors and two thresholds, namely forward and drop thresholds. Our strategy works as follows: when a pair of nodes meet, the node checks to see if the peer has the same message. The counter is increased by one if the peer does not hold the same message. On the other hand, if the peer already has the message, the counter is decremented by one. Only when the counter exceeds the forward threshold, then the message forwarded to another node. In contrast, the message is deleted from the node's buffer if the counter value is less than the drop threshold. We conduct extensive simulations using ONE Simulator to evaluate our proposed strategy. The simulation results show that although RiGoL yields higher latency than Epidemic, RiGoL successfully reduces the message replication in the network and prolongs the hub node's lifetime.
1 April 2022 in ABDIMAS ALTRUIS: Jurnal Pengabdian Kepada Masyarakat
Indonesia is a country of vast geographical and cultural diversity, hosting numerous cultural festivals annually, such as Sekaten, Labuhan, and the Lembah Baliem Festival. However, as the world’s largest archipelago country, Indonesia faces geographical challenges in terms of ensuring the reliability of communication networks, particularly in maintaining user experience in high-density, short-duration traffic burst environments, such as festivals. The nation’s network connectivity relies heavily on satellite networks and Palapa Ring, a national fibre-optic backbone network that comprises a combination of inland and underwater networks, connecting major and remote islands to the global internet. Although this solution can provide a baseline for broadband connectivity, an adaptive intelligent mobile edge-based solution is needed to complement the existing network infrastructure in order to meet the dynamic demands of localised and transient traffic surges across multiple temporary, geographically dispersed festival sites in both urban and rural areas. In this paper, we present a multimodal study that combines network connectivity measurements during a festival with an extensive user analysis of festival participants and organisers to investigate reliability gaps in user experience regarding network connectivity. Our findings show that internet connectivity was intermittently disrupted during the festival, and our user analysis revealed a gap between customer expectations and perceptions of network service quality and the provision of application services in a heterogeneous festival environment. To address this challenge, we propose a novel next-generation intelligent festival mobile edge framework, MobiFest, which integrates the multi-layer Cognitive Cache which has geospatial–temporal edge intelligence for localised service provisioning to improve the delivery of application services in both urban and rural festival environments. In our extensive experiments, we employ smart garbage as our use case and demonstrate how our complex, multimodal intelligent network protocol SmartGarbiC, designed based on MobiFest for garbage management services, outperforms state-of-the-art and benchmark protocols.