Search Results (30)

In the era of multi-core technology, efficient communication among numerous IP cores has become a critical challenge. Network-on-chip (NoC) technology provides a scalable and effective solution, attracting significant attention in academia and industry. This paper introduces a novel deterministic–adaptive hybrid routing (DAHR) algorithm designed to enhance performance while ensuring deadlock-free operation. The DAHR algorithm leverages pre-fetched deterministic information and real-time congestion feedback from neighboring nodes to make dynamic routing decisions. Before packet injection, the source–destination positional relationship and required hops are pre-calculated and encoded into the packet’s head flit. Routing decisions are then based on the availability of free virtual channels in the determined directions, eliminating the need for a complex routing calculation unit. Simulation results demonstrate that DAHR reduces average packet delay by at least 5.8% and improves saturation throughput by at least 9.0% compared to conventional routing schemes without introducing additional hardware overhead. Full article

Recently, there has been an explosive growth in wireless devices capable of connecting to the Internet and utilizing various services anytime, anywhere, often while on the move. In the realm of the Internet, such devices are called mobile nodes. When these devices are in motion or traverse different domains while communicating, effective mobility management becomes essential to ensure the continuity of their services. Software-defined networking (SDN), a new paradigm in networking, offers numerous possibilities for addressing the challenges of mobility management. By decoupling the control and data planes, SDN enables greater flexibility and adaptability, making them a powerful framework for solving mobility-related issues. However, communication can still be momentarily disrupted due to frequent changes in IP addresses, a drop in radio signals, or configuration issues associated with gateways. Therefore, this paper introduces Routage Inter-domains in SDN (RI-SDN), a novel anchor-based routing method designed for inter-domain mobility in SDN architectures. The method identifies a suitable anchor domain, a critical intermediary domain that contributes to reducing delays during data transfer because it is the closest domain (i.e., node) to the destination. Once the anchor domain is identified, the best routing path is determined as the route with the smallest metric, incorporating elements such as bandwidth, flow operations, and the number of domain hops. Simulation results demonstrate significant improvements in data transfer delay and handover latency compared to existing methods. By leveraging SDN’s potential, RI-SDN presents a robust and innovative solution for real-world scenarios requiring reliable mobility management. Full article

Opportunistic Networks (OppNets) are characterized by intermittently connected nodes with fluctuating performance. Their dynamic topology, caused by node movement, activation, and deactivation, often relies on controlled flooding for routing, leading to significant resource consumption and network congestion. To address this challenge, we propose the Adaptive Clustering-based Routing Protocol (ACRP). This ACRP protocol uses the common member-based adaptive dynamic clustering approach to produce optimal clusters, and the OppNet is converted into a TCP/IP network. This protocol adaptively creates dynamic clusters in order to facilitate the routing by converting the network from a disjointed to a connected network. This strategy creates a persistent connection between nodes, resulting in more effective routing and enhanced network performance. It should be noted that ACRP is scalable and applicable to a variety of applications and scenarios, including smart cities, disaster management, military networks, and distant places with inadequate infrastructure. Simulation findings demonstrate that the ACRP protocol outperforms alternative clustering approaches such as kRop, QoS-OLSR, LBC, and CBVRP. The analysis of the ACRP approach reveals that it can boost packet delivery by 28% and improve average end-to-end, throughput, hop count, and reachability metrics by 42%, 45%, 44%, and 80%, respectively. Full article

This paper studies the security and reliability of the power splitting (PS)-based relaying in the Internet of Things (IoT) networks with the help of a jammer. Based on the considered system model, we derive outage probability (OP) and intercept probability (IP) under two distinguished schemes, namely, the static PS relaying (SPSR) scheme and the dynamic PS relaying (DPSR) scheme. More precisely, the PS ratio of the former is a constant number, while the latter is optimally adjusted in order to minimize the OP and counts only on the channel gain of the second hop. Numerical results are provided to not only verify the accuracy of the proposed mathematical framework but also identify the trends of both OP and IP with respect to several important parameters. Our findings unveil that the OP and IP have contradictory behavior with respect to the transmit power and number of sources. Moreover, the performance of the DPSR scheme is superior to that of the SPSR scheme. Full article

Fog computing is today considered a promising candidate to improve the user experience in dynamic on-demand computing services. However, its ubiquitous application would require support for this service in wireless multi-hop mesh systems, where the use of conventional IP-based solutions is challenging. As a complementary solution, in this paper, we consider a Named-Data Networking (NDN) approach to enable fog computing services in autonomous dynamic mesh formations. In particular, we jointly implement two critical mechanisms required to extend the NDN-based fog computing architecture to wireless mesh systems. These are (i) dynamic face management systems and (ii) a learning-based route discovery strategy. The former makes it possible to solve NDN issues related to an inability to operate over a broadcast medium. Also, it improves the data-link layer reliability by enabling unicast communications between mesh nodes. The learning-based forwarding strategy, on the other hand, efficiently reduces the amount of overhead needed to find routes in the dynamically changing mesh networks. Our numerical results show that, for static wireless meshes, our proposal makes it possible to fully benefit from the computing resources sporadically available up to several hops away from the consumer. Additionally, we investigate the impacts of various traffic types and NDN caching capabilities, revealing that the latter result in much better system performance while the popularity of the compute service contributes to additional performance gains. Full article

Traditional internet protocol (IP) networks, adhering to a “best-effort” service model, typically utilize shortest-path routing for data transmission. Nevertheless, this methodology encounters limitations, especially considering the increasing demands for both high reliability and high bandwidth. These demands reveal shortcomings in this routing strategy, notably its inefficient bandwidth utilization and fault recovery capabilities. The method of multipath transmission has been extensively researched as a solution to these challenges. With the emergence of innovative Internet architectures, notably information-centric networking (ICN), network nodes have gained enhanced capabilities, opening new avenues for multipath transmission design. This paper introduces a multipath scheduling approach for network nodes, capitalizing on the advanced features of these modern nodes. It reimagines the conventional next-hop node as a group of potential next-hop nodes based on both global and local routing strategies and assigns traffic shares to each node within this group for balanced traffic distribution. Network nodes are configured to periodically review and adjust traffic shares according to the link statuses. If scheduling cannot be completed within the set, feedback is sent to upstream nodes. Simulations demonstrate that this approach effectively leverages network path variety, improves bandwidth usage and throughput, and minimizes average data transmission time. Full article

In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node or link failure. He then showed that “whether there is a protection routing to the destination” is NP-complete. Tapolcai found that two completely independent spanning trees, abbreviated as CISTs, can be used to configure the protection routing. In this paper, we proposed dual protection routing trees, denoted as dual-PRTs to replace CISTs, which are less restrictive than CISTs. Next, we proposed a transformation algorithm that uses dual-PRTs to configure the protection routing. Taking complete graphs K_n, complete bipartite graphs K_m,n, hypercubes Q_n, and locally twisted cubes LTQ_n as examples, we provided a recursive method to construct dual-PRTs on them. This article showed that there are no two CISTs on K_3,3, Q₃, and LTQ₃, but there exist dual-PRTs that can be used to configure the protection routing. As shown in the performance evaluation of simulation results, for both Q_n and LTQ_n, we get the average path length of protection routing configured by dual-PRTs is shorter than that by two CISTs. Full article

The photocurrent for poly(4-(dimethylamino)benzyl acrylate) (PDAA) photorefractive composites with (4-(diphenylamino)phenyl)methanol (TPAOH) photoconductive plasticizers was measured to be two orders of magnitude higher than that obtained with (2,4,6-trimethylphenyl)diphenylamine (TAA) photoconductive plasticizers. In this study, to determine the reason for the large difference in the photocurrent measured for PDAA photorefractive composites containing two different photoconductive plasticizers of TPAOH and TAA, the highest occupied molecular orbital (HOMO) level identical to the ionization potential (I_p) and the width of the density of states (DOS) were evaluated using photoelectron yield spectroscopy, and the transient photocurrent was analyzed using a two-trap model. The estimated hole mobility was also rationalized using a Bässler formalism together with the energetic disorder of the width of the DOS and the positional disorder of the scattering situation for carrier hopping. Full article

There are contexts where TCP/IP is not suitable for performing data transmission due to long delays, timeouts, network partitioning, and interruptions. In these scenarios, mobile opportunistic networks (MONs) are a valid option, providing asynchronous transmissions in dynamic topologies. These architectures exploit physical encounters and persistent storage to communicate nodes that lack a continuous end-to-end path. In recent years, many routing algorithms have been based on social interactions. Smartphones and wearables are in vogue, applying social information to optimize paths between nodes. This work proposes Refine Social Broadcast (RSB), a social routing algorithm. RSB uses social behavior and node interests to refine the message broadcast in the network, improving the delivery probability while reducing redundant data duplication. The proposal combines the identification of the most influential nodes to carry the information toward the destination with interest-based routing. To evaluate the performance, RSB is applied to a simulated case of use based on a realistic loneliness detection methodology in elderly adults. The obtained delivery probability, latency, overhead, and hops are compared with the most popular social-based routers, namely, EpSoc, SimBet, and BubbleRap. RSB manifests a successful delivery probability, exceeding the second-best result (SimBet) by 17% and reducing the highest overhead (EpSoc) by 97%. Full article

The Routing Protocol for Low-power and Lossy Networks (RPL) is a popular routing layer protocol for multi-hop Wireless Sensor Networks (WSNs). However, typical RPL configurations are based on decade-old assumptions, leading to a mismatch with: (1) advances in wireless hardware; and (2) growing wireless contention. To soften the impact of external stressors (i.e., jamming and interference), we extended RPL to exploit the capabilities of modern multi-interfaced wireless devices. More specifically, our main contribution is the design, development, and evaluation of a novel RPL Objective Function (OF) which, through simulations, is compared to traditional single-interface approaches and a state-of-the-art multi-interface approach. We examine two scenarios, with and without the injection of jamming, respectively. Our proposed OF is shown to outperform, or otherwise perform similar to, all alternatives considered. In normal conditions, it auto-selects the best interface whilst incurring negligible protocol overhead. In our jamming simulations, it provides stable end-to-end delivery ratios exceeding 90%, whereas the closest alternative averages 65% and is considerably less stable. Given we have open-sourced our development codebase, our solution is an ideal candidate for adoption by RPL deployments that expect to suffer interference from competing technologies or are unable to select the best radio technology a priori. Full article

The domain of information-centric networking (ICN) is expanding as more devices are becoming a part of connected technologies. New methods for serving content from a producer to a consumer are being explored, and Named Data Networking (NDN) is one of them. The NDN protocol routes the content from a producer to a consumer in a network using content names, instead of IP addresses. This facility, combined with content caching, efficiently serves content for very large networks consisting of a hybrid and ad hoc topology with both wired and wireless media. This paper addresses the issue of the quality-of-service (QoS) dimension for content delivery in NDN-based networks. The Internet Engineering Task Force (IETF) classifies QoS traffic as (prompt, reliable), prompt, reliable, and regular, and assigns corresponding priorities for managing the content. QoS-linked privileged content caching (QLPCC) proposes strategies for Pending Interest Table (PIT) and content store (CS) management in dedicated QoS nodes for handling priority content. QoS nodes are intermediately resourceful NDN nodes between content producers and consumers which specifically manage QoS traffic. The results of this study are compared with EQPR, PRR probability cache, and Least Frequently Used (LFU) and Least Fresh First (LFF) schemes, and QLPCC outperformed the latter-mentioned schemes in terms of QoS-node CS size vs. hit rate (6% to 47%), response time vs, QoS-node CS size (65% to 90%), and hop count vs. QoS-node CS size (60% to 84%) from the perspectives of priority traffic and overall traffic. QLPCC performed predictably when the NDN node count was increased from 500 to 1000, showing that the strategy is scalable. Full article

In this paper, we present and evaluate an ultra-wideband (UWB) indoor processing architecture that allows the performing of simultaneous localizations of mobile tags. This architecture relies on a network of low-power fixed anchors that provide forward-ranging measurements to a localization engine responsible for performing trilateration. The communications within this network are orchestrated by UWB-TSCH, an adaptation to the ultra-wideband (UWB) wireless technology of the time-slotted channel-hopping (TSCH) mode of IEEE 802.15.4. As a result of global synchronization, the architecture allows deterministic channel access and low power consumption. Moreover, it makes it possible to communicate concurrently over multiple frequency channels or using orthogonal preamble codes. To schedule communications in such a network, we designed a dedicated centralized scheduler inspired from the traffic aware scheduling algorithm (TASA). By organizing the anchors in multiple cells, the scheduler is able to perform simultaneous localizations and transmissions as long as the corresponding anchors are sufficiently far away to not interfere with each other. In our indoor positioning system (IPS), this is combined with dynamic registration of mobile tags to anchors, easing mobility, as no rescheduling is required. This approach makes our ultra-wideband (UWB) indoor positioning system (IPS) more scalable and reduces deployment costs since it does not require separate networks to perform ranging measurements and to forward them to the localization engine. We further improved our scheduling algorithm with support for multiple sinks and in-network data aggregation. We show, through simulations over large networks containing hundreds of cells, that high positioning rates can be achieved. Notably, we were able to fully schedule a 400-cell/400-tag network in less than 11 s in the worst case, and to create compact schedules which were up to 11 times shorter than otherwise with the use of aggregation, while also bounding queue sizes on anchors to support realistic use situations. Full article

In multi-hop question answering (MH-QA), the machine needs to infer the answer to a given question from multiple documents. Existing models usually apply entities as basic units in the reasoning path. Then they use relevant entities (in the same sentence or document) to expand the path and update the information of these entities to finish the QA. The process might add an entity irrelevant to the answer to the graph and then lead to incorrect predictions. It is further observed that state-of-the-art methods are susceptible to reasoning chains that pivot on compound entities. To make up the deficiency, we present a viable solution, i.e., incorporate phrases in the latent query reformulation method (IP-LQR), which incorporates phrases in the latent query reformulation to improve the cognitive ability of the proposed method for multi-hop question answering. Specifically, IP-LQR utilizes information from relevant contexts to reformulate the question in the semantic space. Then the updated query representations interact with contexts within which the answer is hidden. We also design a semantic-augmented fusion method based on the phrase graph, which is then used to propagate the information. IP-LQR is empirically evaluated on a popular MH-QA benchmark, HotpotQA, and the results of IP-LQR consistently outperform those of the state of the art, verifying its superiority. In summary, by incorporating phrases in the latent query reformulation and employing semantic-augmented embedding fusion, our proposed model can lead to better performance on MH-QA. Full article

In this work, we report the effect of the addition of modifiers and network formers on the polaronic transport in iron phosphate glasses (IPG) in two systems of HfO₂–B₂O₃–Fe₂O₃–P₂O₅, to which up to 8 mol% boron and hafnium are added. The addition of oxides significantly changes the Fe²⁺/Fe_total ratio, thus directly affecting the polaron number density and consequently controlling DC conductivity trends for both series studied by impedance spectroscopy. Moreover, we found that short-range polaron dynamics are also under the influence of structural changes. Therefore, we have studied them in detail using model-free scaling procedures, Summerfield and Sidebottom scaling. An attempt to construct a super-master curve revealed that in addition to change in polaron number density, also the polaron hopping lengths change, and Sidebottom scaling yields a super-master curve. The spatial extent of the localized motion of polarons is correlated with polaron number density and two distinct regions are observed. A strong increase in the spatial extent of the polaron hopping jump could be related either to the structural changes due to the addition of HfO₂ and B₂O₃ and their effects on the formation of polarons or to an inherent property of polaron transport in IP glasses with low polaron number density. Full article

Concepts such as Industry 4.0 and Cyber-Physical Systems may bring forward a new industrial revolution. These concepts require extensive connectivity far beyond what is provided by traditional industrial networks. The Industrial Internet of Things (IIoT) bridges this gap by employing wireless connectivity and IP networking. In order for wireless networks to meet the strict requirements of the industrial domain, the Time Slotted Channel Hopping (TSCH) MAC is often employed. The properties of a TSCH network are defined by the schedule, which dictates transmission opportunities for all nodes. We survey the literature for these schedulers, describe and organize them according to their operation: Centralized, Collaborative, Autonomous, Hybrid, and Static. For each category and the field as a whole, we provide a holistic view and describe historical trends, highlight key developments, and identify trends, such as the attention towards autonomous mechanisms. Each of the 76 schedulers is analyzed into their common components to allow for comparison between schedulers and a deeper understanding of functionality and key properties. This reveals trends such as increasing complexity and the utilization of centralized principles in several collaborative schedulers. Further, each scheduler is evaluated qualitatively to identify its objectives. Altogether this allows us to point out challenges in existing work and identify areas for future research, including fault tolerance, scalability, non-convergecast traffic patterns, and hybrid scheduling strategies. Full article