Payment Channel Networks (PCNs) are an alternative to improve the scalability of a blockchain network. The network size of Bitcoin PCN is increasing rapidly;in the past three months, the number of nodes has more than ...
详细信息
ISBN:
(纸本)9798350322880
Payment Channel Networks (PCNs) are an alternative to improve the scalability of a blockchain network. The network size of Bitcoin PCN is increasing rapidly;in the past three months, the number of nodes has more than doubled. With the increase in the network size, transactions on the network will also increase. However, the existing distributed routing algorithms cannot efficiently schedule concurrent transactions due to their static nature. We propose two algorithms, maxECW and maxSCL, which can handle concurrent transactions more efficiently. Our algorithms consider channel weights and introduce the concept of rebalancing to avoid the saturation of the directional capacity of a channel. We have also developed a simulator, DRLNsim, to compare our proposed algorithms with the existing ones. The routing algorithms are evaluated on the simulator by varying relevant parameters. On average, our proposed algorithms performed 50% more efficiently than existing algorithms in handling concurrent transactions.
Data gathering is an important research area in wireless sensor networks (WSNs), where network lifetime is an important factor affecting data gathering in WSNs. In recent years, a type of WSNs with a special structure...
详细信息
With the development of smart homes, more and more smart home devices are equipped with networking features, and networking technology has been widely applied in smart *** order to meet the networking requirements of ...
详细信息
ISBN:
(纸本)9781510664791
With the development of smart homes, more and more smart home devices are equipped with networking features, and networking technology has been widely applied in smart *** order to meet the networking requirements of small, low power consumption, low cost and short distance portable terminal equipment, the short distance wireless technology has been developed rapidly[1]. Currently, the short distance wireless networking technologies used in smart homes in the field of whole-house intelligence mainly include star wireless network technologies, represented by WiFi and bluetooth, and wireless mesh network technologies, represented by Bluetooth (BLE) mesh and ZigBee[2]. Compared to the star wireless network technologies such as WiFi and Bluetooth, the wireless mesh network technologies have the advantage that the device itself can act as a route node for other devices,the communication range is extended by means of multiple hops[3] , then all the nodes can constitute a mesh so that the communication signals can well cover the entire house, avoiding the problem of weak signals or connection failures incurred by the fact that the WiFi device is located in remote corners. However, the BLE mesh and ZigBee wireless mesh network technologies still have limitations. BLE mesh networks use the flooding algorithm to transmit data from the source node to the destination node from near to far layer by layer, which is like flooding. But due to the use of the flooding routing algorithm, all devices need to perform broadcast forwarding in each communication process, resulting in low communication efficiency and high wireless bandwidth occupancy. ZigBee uses a wireless routing algorithm based on an Ad hoc On-Demand Distance Vector (AODV) standard, which is more efficient than BLE mesh, but it is still a bit inadequate in the case of multi-node networks, reflected in not ideal stability and communication delay. In this paper, the O-Mesh mesh routing algorithm with low network ove
routing algorithms play a crucial role in the efficient transmission of data within computer networks by determining the optimal paths for packet forwarding. This paper presents a comprehensive exploration of routing ...
详细信息
The expansion of the Internet and technological innovations have revolutionized the world. This digital effervescence has fostered in its path an increased connectivity of services and applications. Optimal use of the...
详细信息
Adaptive routing algorithms have been widely utilized in Network-on-Chip (NoC) architectures and have shown to enhance overall throughput in numerous studies. The adaptive routing algorithms can effectively detect net...
详细信息
Adaptive routing algorithms have been widely utilized in Network-on-Chip (NoC) architectures and have shown to enhance overall throughput in numerous studies. The adaptive routing algorithms can effectively detect network congestion. On the one hand, one-hop awareness or local awareness can easily detect network congestion but may also result in local greed. On the other hand, global awareness is better for load balancing, but it is difficult to be aware of the network congestion status. This article proposes a lightweight adaptive on-chip routing algorithm based on the concentric circles theory and prior knowledge derived from real-life observations. The algorithm, named the Priori-Knowledge and Congestion-Awareness method (PKCA), aims to optimize the routing efficiency within the chip. PKCA is designed to be not only simple but also to have low time complexity, allowing it to calculate paths to destinations without local greed. We performed evaluations, and the results demonstrated that our design surpasses one-hop awareness, two-hop awareness, and global awareness by 31%, 25%, and 20%, respectively, in terms of latency, and by 22%, 14%, and 22%, respectively, in terms of throughput. Furthermore, the time complexity is only O(N)$$ O(N) $$ in an NxN$$ N\times N $$ 2D mesh. This article proposes a lightweight adaptive on-chip routing algorithm NoC based on the concentric circles theory and prior knowledge derived from real-life observations. The algorithm, named the Priori-Knowledge and Congestion-Awareness method (PKCA), aims to optimize the routing efficiency within the chip. image
Opportunistic Mobile Ad Hoc Networks (MANETs) offer versatile solutions in contexts where the Internet is unavailable. These networks facilitate the transmission between endpoints using a store-carry-forward strategy,...
详细信息
Opportunistic Mobile Ad Hoc Networks (MANETs) offer versatile solutions in contexts where the Internet is unavailable. These networks facilitate the transmission between endpoints using a store-carry-forward strategy, thereby allowing information to be stored during periods of disconnection. Consequently, selecting the next hop in the routing process becomes a significant challenge for nodes, particularly because of its impact on Quality of Service (QoS). Therefore, routing strategies are crucial in opportunistic MANETs;however, their deployment and evaluation in real scenarios can be challenging. In response to this context, this paper introduces a monitoring software-driven tool designed to evaluate the QoS of routing algorithms in physical opportunistic MANETs. The implementation and its components are detailed, along with a case study and the outcomes provided by an implementation of the proposed solution. The results demonstrate the effectiveness of the implementation in enabling the analysis of routing protocols in real scenarios, highlighting significant differences with simulation results: mobility patterns in simulations tend to be inaccurate and overly optimistic, leading to a higher delivery probability and lower latency than what is observed in the real testbed.
Given a set of n points in the plane, we present two constructions of geometric r-spanners with r >= 1 based on a hierarchical decomposition. These graphs have O(n) edges and diameter O(log n). We then design onlin...
详细信息
ISBN:
(纸本)9783031206238;9783031206245
Given a set of n points in the plane, we present two constructions of geometric r-spanners with r >= 1 based on a hierarchical decomposition. These graphs have O(n) edges and diameter O(log n). We then design online routing algorithms on these graphs. The first construction is based on Theta(k)-graphs (with k > 6 and k = 2 mod 4). The routing algorithm is memoryless and local (i.e. it uses information about the closed neighborhood of the current vertex and the destination). It has routing ratio 1/(1 - 2 sin(pi/k)) and finds a path with O(log(2) n) edges. The second construction uses a TD-Delaunay triangulation, which is a Delaunay triangulation where the empty regions are homothets of an equilateral triangle. The associated routing algorithm is local and memoryless, has a routing ratio of 5/root 3, finds a path consisting of O(log(2) n) edges and requires the pre-computation of vertex labels of O(log(2) n) bits (assuming the nodes are placed on a grid of polynomial size). We have examples that show when using either of our routing algorithms, in the worst case, the paths returned by the algorithm can consist of Omega(log(2) n) edges.
The prominent criteria for the Wireless Sensor Network are a lifetime of the network, stability, and the energy parameter. To enhance these crucial parameters, the paper introduces routing algorithms for hybrid nodes ...
详细信息
Opportunistic Mobile Social Networks(OMSNs)are kind of Delay Tolerant Networks(DTNs)that leverage characteristics of Mobile Ad Hoc Networks(MANETs)and Social Networks,particularly the social features,to boost performa...
详细信息
Opportunistic Mobile Social Networks(OMSNs)are kind of Delay Tolerant Networks(DTNs)that leverage characteristics of Mobile Ad Hoc Networks(MANETs)and Social Networks,particularly the social features,to boost performance of routing *** in OMSNs communicate to share and disseminate data to meet needs for variety of *** networks have attracted tremendous attention lately due to the data transmission requirement from emerging applications such as IoT and smart city *** carried by human is the carrier of message transmission,so the social features of human can be used to improve the ability of data *** this paper,we conduct a comparative survey on routing algorithms in *** first analyze routing algorithms based on three social *** node selfishness is not really considered previously in aforementioned routing algorithms,but has significant impact on network performance,we treat node selfishness as another social feature,classify and elaborate routing algorithms based on incentive *** assess the impact of social features on routing algorithms,we conducted simulation for six routing algorithms and analyzed the simulation ***,we conclude the paper with challenges on design of routing in OMSNs and point out some future research directions.
暂无评论