Wireless sensor networks have attracted much attention because of many applications in the fields of industry, military, medicine, agriculture, and education. In addition, the vast majority of researches has been done to expand its applications and improve its efficiency. However, there are still many challenges for increasing the efficiency in different parts of this network. One of the most important parts is to improve the network lifetime in the wireless sensor network. Since the sensor nodes are generally powered by batteries, the most important issue to consider in these types of networks is to reduce the power consumption of the nodes in such a way as to increase the network lifetime to an acceptable level. The contribution of this paper is using topology control, the threshold for the remaining energy in nodes, and two of the meta-algorithms include SA (Simulated annealing) and VNS (Variable Neighbourhood Search) to increase the energy remaining in the sensors. Moreover, using a low-cost spanning tree, an appropriate connectivity control among nodes is created in the network in order to increase the network lifetime. The results of simulations show that the proposed method improves the sensor lifetime and reduces the energy consumed.
In this paper a scheme for handoff and connectivity, based on wireless sensor nodetechniques is proposed. Scenes are created in Qualnet and simulated for a simple case. Results are discussed.
In this paper, performance evaluation of Newton-Raphson and Conjugate Gradient method has been studied in comparison to Steepest Decent method for coverage and connectivity control in backbone based wireless networks. In order to design such wireless networks, the main challenge is to ensure network requirements such as network coverage and connectivity. To optimize coverage and connectivity, backbone nodes will be repositioned by the use of mobility control based on above mentioned methods. Thus the network get self organized which autonomously achieve energy minimizing configuration. Further…
Battery is a major hardware component of wireless sensor networks. Most of them have no power supply and are generally deployed for a long time. Researches have been done on battery physical model and their adaptation for sensors. We present an implementation on a real sensor operating system and how architectural constraints have been assumed. Experiments have been made in order to test the impact of some parameter, as the application throughput, on the battery lifetime.
Clustering in wireless sensor networks (WSNs) is an important technique to ease topology management and routing. Clustering provides an effective method for prolonging lifetime of a WSN. This paper proposes energy efficient multi-level clustering schemes for wireless sensor networks. Wireless sensor nodes are extremely energy constrained with a limited transmission range. Due to large area of deployment, the network needs to have a multi-level clustering protocol that will enable far-off nodes to communicate with the base station. Simulation is used to analyze the proposed protocols and compar…
Wireless sensor networks have significant potential to increase our ability to view and control the physical environment, but the issue of power consumption in these networks has become an important parameter in their reliability and since in many applications of networks. Wireless sensor needs to guarantee end-to-end quality parameters, support for quality of service in these networks is of utmost importance. In wireless sensor networks, one of the most important issues is the lifetime of each network, which is directly related to the energy consumption of the network sensors. Increasing netw…
Considering a wireless sensor network whose nodes are distributed randomly over a given area, a probability model for the network lifetime is provided. Using this model and assuming that packet generation follows a Poisson distribution, an analytical expression for the complementary cumulative density function (ccdf) of the lifetime is obtained. Using this ccdf, one can accurately find the probability that the network achieves a given lifetime. It is also shown that when the number of sensors, $N$, is large, with an error exponentially decaying with $N$, one can predict whether or not a certai…
In this paper we present a model for the lifetime of wireless sensor networks. The model takes into consideration several parameters such as the total number of sensors, network size, percentage of sink nodes, location of sensors, the mobility of sensors, and power consumption. A definition of the life time of the network based on three different criteria is introduced; percentage of available power to total power, percentage of alive sensors to total sensors, and percentage of alive sink sensors to total sink sensors. A Matlab based simulator is developed for the introduced model. A number of…
Enabling ultra-reliable low latency communications (uRLLC) over 5G wireless networks creates challenging design requirements, particularly on the air-interface. The stringent latency and reliability targets require enhancements at different layers of the protocol stack. On the other hand, the parallel redundancy protocol (PRP), wherein each data packet is duplicated and transmitted concurrently over two independent networks, provides a simple solution for improving reliability and reducing latency in wireless networks. PRP can be realized in cellular networks through the dual connectivity (DC)…
Recently, many researchers have studied efficiently gathering data in wireless sensor networks to minimize the total energy consumption when a fixed number of data are allowed to be aggregated into one packet. However, minimizing the total energy consumption does not imply the network lifetime is maximized. In this paper, we study the problem of scheduling data aggregation trees working for different time periods to maximize the network lifetime when a fixed number of data are allowed to be aggregated into one packet. In addition, we propose a heuristic to balance the lifetime of nodes in data…
Wireless connectivity is rapidly becoming ubiquitous and affordable. As a consequence, most wireless devices are nowadays equipped with multi-connectivity, that is, availability of multiple radio access technologies (RATs). Each of these RATs has different characteristics that can be suitably utilized for different connectivity tasks. For example, a long-range low-rate RAT can be used for topology management and coordination, whereas a short-range high-rate RAT for data transmission. In this paper, we introduce a distributed consensus protocol for the hierarchical organization of Wireless Mesh…
The transmission rate, delivery reliability and network lifetime are three fundamental but conflicting design objectives in energy-constrained wireless sensor networks. In this paper, we address the optimal rate-reliability-lifetime tradeoff with link capacity constraint, reliability constraint and energy constraint. By introducing the weight parameters, we combine the objectives at rate, reliability, and lifetime into a single objective to characterize the tradeoff among them. However, the optimization formulation of the rate-reliability-reliability tradeoff is neither separable nor convex. T…
Underwater optical wireless links have limited range and intermittent connectivity due to the hostile aquatic channel impairments and misalignment between the optical transceivers. Therefore, multi-hop communication can expand the communication range, enhance network connectivity, and provide a more precise network localization scheme. In this regard, this paper investigates the connectivity of underwater optical wireless sensor networks (UOWSNs) and its impacts on the network localization performance. Firstly, we model UOWSNs as randomly scaled sector graphs where the connection between senso…
The traditional role of a communication engineer is to address the technical problem of transporting bits reliably over a noisy channel. With the emergence of 5G, and the availability of a variety of competing and coexisting wireless systems, wireless connectivity is becoming a commodity. This article argues that communication engineers in the post-5G era should extend the scope of their activity in terms of design objectives and constraints beyond connectivity to encompass the semantics of the transferred bits within the given applications and use cases. To provide a platform for semantic-awa…
In recent years, significant attention has been directed toward the fifth generation of wireless broadband connectivity known as `5G`, currently being deployed by Mobile Network Operators. Surprisingly, there has been considerably less attention paid to `Wi-Fi 6`, the new IEEE 802.1ax standard in the family of Wireless Local Area Network technologies with features targeting private, edge-networks. This paper revisits the suitability of cellular and Wi-Fi in delivering high-speed wireless Internet connectivity. Both technologies aspire to deliver significantly enhanced performance, enabling eac…
In this paper we present a new model for the lifetime of wireless sensor networks used for sea water communications. The new model for power communications takes into consideration parameters such as power consumption for the active mode, power consumption for the sleep mode, power consumption for the transient mode, transmission period, transient mode duration, sleep mode duration, and active mode duration. The power communications model is incorporated in the life time model of wireless sensor networks. The life time model takes into consideration several parameters such as the total number …
One of the most important issues in Wireless Sensor Networks (WSNs) is severe energy restrictions. As the performance of Sensor Networks is strongly dependence to the network lifetime, researchers seek a way to use node energy supply effectively and increasing network lifetime. As a consequence, it is crucial to use routing algorithms result in decrease energy consumption and better bandwidth utilization. The purpose of this paper is to increase Wireless Sensor Networks lifetime using LEACH-algorithm. So before clustering Network environment, it is divided into two virtual layers (using distan…
In telecommunications, network service accessibility as a requirement is closely related to equitably serving the population residing at locations that can most appropriately be described as remote. Remote connectivity, however, would have benefited from a more inclusive consideration in the existing generations of mobile communications. To remedy this, sustainability and its social impact are being positioned as key drivers of sixth generation's (6G) research and standardization activities. In particular, there has been a conscious attempt to understand the demands of remote wireless connecti…
Due to the limited energy of sensor nodes in wireless sensor networks, extending the networks lifetime is a major challenge that can be formulated as an optimization problem. In this paper, we propose a distributed iterative algorithm based on Alternating Direction Method of Multipliers (ADMM) with the aim of maximizing sensor network lifetime. The features of this algorithm are use of local information, low overhead of message passing, low computational complexity, fast convergence, and consequently reduced energy consumption. In this study, we present the convergence results and the number o…
Wireless Sensor Networks need to be organized for efficient data collection and lifetime maximization. In this paper, we propose a novel routing structure, namely k-DAG, to balance the load of the base station's neighbours while providing the worst-case latency guarantee for data collection, and a distributed algorithm for construction a k-DAG based on a SPD (Shortest Path DAG). In a k-DAG, the lengths of the longest path and the shortest path of each sensor node to the base station differ by at most k. By adding sibling edges to a SPD, our distributed algorithm allows critical nodes to have m…
A wireless sensor network has a wide application domain which is expanding everyday and they have been deployed pertaining to their application area. An application independent approach is yet to come to terms with the ongoing exploitation of the WSNs. In this paper we propose a decentralized lifetime maximizing tree for application independent data aggregation scheme using the clustering for data delivery in WSNs. The proposed tree will minimize the energy consumption which has been a resisting factor in the smooth working of WSNs as well as minimize the distance between the communicating nod…
Energy efficiency is the most important issue in all facets of wireless sensor networks (WSNs) operations because of the limited and non-replenish able energy supply. Data aggregation mechanism is one of the possible solutions to prolong the life time of sensor nodes and on the other hand it also helps in eliminating the data redundancy and improving the accuracy of information gathering, is essential for WSNs. In this paper we propose a Clustering based lifetime maximizing aggregation tree (CLMAT) in which we create aggregation tree which aim to reduce energy consumption, minimizing the dista…
In this paper we present new optimization formulations for maximizing the network lifetime in wireless mesh networks performing data aggregation and dissemination for machine-to-machine communication in the Internet of Things. We focus on heterogeneous networks in which multiple applications co-exist and nodes may take on different roles for different applications. Moreover, we address network reconfiguration as a means to increase the network lifetime, in keeping with the current trend towards software defined networks and network function virtualization. To test our optimization formulations…
To enable data aggregation among the event sources in wireless sensor networks and to reduce the communication cost there is a need to establish a coveraged tree structure inside any given event region to allow data reports to be aggregated at a single processing point prior to transmission to the network. In this paper we propose a novel technique to create one such tree which maximizes the lifetime of the event sources while they are constantly transmitting for data aggregation. We use the term Centralized Lifetime Maximizing Tree (CLMT) to denote this tree. CLMT features with identification…
We address the connectivity of large-scale ad hoc heterogeneous wireless networks, where secondary users exploit channels temporarily unused by primary users and the existence of a communication link between two secondary users depends on not only the distance between them but also the transmitting and receiving activities of nearby primary users. We introduce the concept of connectivity region defined as the set of density pairs -- the density of secondary users and the density of primary transmitters -- under which the secondary network is connected. Using theories and techniques from contin…
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and …
The issue of optimizing the limited and often non-renewable energy of sensor nodes due to its direct impact on network lifetime dominates every aspect of wireless sensor networks. Existing techniques for optimizing energy consumption are based on exploiting node redundancy, adaptive radio transmission power and topology control. Topology control protocols have a significant impact on network lifetime, available energy and connectivity. In this paper we classify sensor nodes as strong and weak nodes based on their residual energy as well as operational lifetime and propose a Clustering based to…
In this paper we estimate lifetime bounds of a network of motes which communicate with each other using IEEE 802.15.4 standard. Different frame structures of IEEE 802.15.4 along with CSMA/CA medium access mechanism are investigated to discover the overhead of channel acquisition, header and footer of data frame, and transfer reliability during packet transmission. This overhead makes the fixed component, and the data payload makes the incremental component of a linear equation to estimate the power consumed during every packet transmission. Finally we input this per-packet power consumption in…
To meet the demands of wireless sensor networks (WSNs) where data are usually aggregated at a single source prior to transmitting to any distant user, there is a need to establish a tree structure inside any given event region. In this paper, we propose a novel technique to create one such tree, which preserves the energy and minimizes the lifetime of event sources while they are constantly transmitting for data aggregation in future WSNs. We use the term Decentralized Lifetime-Minimizing Tree (DLMT) to denote this tree. DLMT features in nodes with higher energy tend to be chosen as data aggre…
The growing presence of UAVs has led operators to explore the issue of how to provide wireless service to UAVs. The achieveable service quality will be affected by a number of factors, including the type of antenna that the UAVs are equipped with and whether to use existing cellular infrastructure or deploy dedicated ground stations to service these new user devices. In this paper we employ stochastic geometry to carry out an analysis of the UAV coverage probability that can be achieved with a network of dedicated ground stations using a sub-6GHz technology such as LTE under different deployme…
Connectivity and coverage are two crucial problems for wireless sensor networks. Several studies have focused on proposing solutions for improving and adjusting the initial deployment of a wireless sensor network to meet these two criteria. In our work, we propose a new hierarchical architecture for sensor networks that facilitates the gathering of redundancy information of the topology. Several mobile robots must then relocate, in an optimized way, redundant sensors to achieve optimal connectivity and coverage of the network. Mobile robots have to cooperate and coordinate their movement. A pe…
Heterogeneous wireless sensor network consists of wireless sensor nodes with different abilities, such as different computing power and different initial energy. We present in this paper a new scheme for maximizing heterogeneous WSN lifetime. The proposed scheme employs two types of sensor nodes that are named (consistent with IEEE 802.15.4 standard) Full Function Device (FFD) and Reduced Function Device (RFD). The FFDs are the expensive sensor nodes with high power and computational capabilities compared to the RFDs which are cheap sensors with a limited power supply. The scheme divides the n…
In two-tiered Wireless Sensor Networks (WSNs) relay node placement is one of the key factors impacting the network energy consumption and the system overhead. In this paper, a novel connectivity-aware approximation algorithm for relay node placement in WSNs is proposed to offer a major step forward in saving system overhead. Specifically, a unique Local Search Approximation Algorithm (LSAA) is introduced to solve the Relay Node Single Cover (RNSC) problem. In this proposed LSAA approach, the sensor nodes are allocated into groups and then a local Set Cover (SC) for each group is achieved by a …
Wireless sensor networks (WSNs) suffers from the hot spot problem where the sensor nodes closest to the base station are need to relay more packet than the nodes farther away from the base station. Thus, lifetime of sensory network depends on these closest nodes. Clustering methods are used to extend the lifetime of a wireless sensor network. However, current clustering algorithms usually utilize two techniques; selecting cluster heads with more residual energy, and rotating cluster heads periodically to distribute the energy consumption among nodes in each cluster and lengthen the network lif…
In this paper a packet level simulator is used to explore the performance of the proposed DLMT and CLMT algorithms under various traffic conditions. Performance of the proposed algorithms is compared with already existing E-Span tree structure. These proposed algorithms tend to extend the node lifetime in order to increase the amount of information gathered by the tree root. Decentralized lifetime maximizing tree (DLMT) features in nodes with higher energy to be chosen as data aggregating parents while Centralized Lifetime Maximizing Tree (CLMT) features with the identification of the bottlene…
Our contribution in this paper is e3D, a diffusion based routing protocol that prolongs the system lifetime, evenly distributes the power dissipation throughout the network, and incurs minimal overhead for synchronizing communication. We compare e3D with other algorithms in terms of system lifetime, power dissipation distribution, cost of synchronization, and simplicity of the algorithm.
Topology control algorithms allow each node in a wireless multi-hop network to adjust the power at which it makes its transmissions and choose the set of neighbors with which it communicates directly, while preserving global goals such as connectivity or coverage. This allows each node to conserve energy and contribute to increasing the lifetime of the network. In this paper, in contrast to most previous work, we consider (i) both the energy costs of communication as well as the amount of available energy at each node, (ii) the realistic situation of varying rates of energy consumption at diff…
Ad hoc networks are wireless mobile networks that can operate without infrastructure and without centralized network management. Traditional techniques of routing are not well adapted. Indeed, their lack of reactivity with respect to the variability of network changes makes them difficult to use. Moreover, conserving energy is a critical concern in the design of routing protocols for ad hoc networks, because most mobile nodes operate with limited battery capacity, and the energy depletion of a node affects not only the node itself but also the overall network lifetime. In all proposed single-p…
Despite intensive research in the area of network connectivity, there is an important category of problems that remain unsolved: how to measure the quality of connectivity of a wireless multi-hop network which has a realistic number of nodes, not necessarily large enough to warrant the use of asymptotic analysis, and has unreliable connections, reflecting the inherent unreliable characteristics of wireless communications? The quality of connectivity measures how easily and reliably a packet sent by a node can reach another node. It complements the use of \emph{capacity} to measure the quality …
Achieving end-to-end ultra-reliability and resiliency in mission critical communications is a major challenge for future wireless networks. Dual connectivity has been proposed by 3GPP as one of the viable solutions to fulfill the reliability requirements. However, the potential correlation in failures occurring over different wireless links is commonly neglected in current network design approaches. In this paper, we investigate the impact of realistic correlation among different wireless links on end-to-end reliability for two selected architectures from 3GPP. In ultra-reliable use-cases, we …
We solve the maximum lifetime problem for a one-dimensional, regular ad-hoc wireless network with one data collector $L_N$ for any data transmission cost energy matrix which elements $E_{i,j}$ are superadditive functions, i.e., satisfy the inequality $\forall_{i\leq j\leq k}\;E_{i,j}+E_{j,k}\leq E_{i,k}$. We analyze stability of the solution under modification of two sets of parameters, the amount of data $Q_i$, $i\in [1,N]$ generated by each node and location of the nodes $x_i$ in the network. We assume, that the data transmission cost energy matrix $E_{i,j}$ is a function of a distance betwe…
Wireless power transfer (WPT) technology provides a cost-effective solution to achieve sustainable energy supply in wireless networks, where WPT-enabled energy nodes (ENs) can charge wireless devices (WDs) remotely without interruption to the use. However, in a heterogeneous WPT network with distributed ENs and WDs, some WDs may quickly deplete their batteries due to the lack of timely wireless power supply by the ENs, thus resulting in short network operating lifetime. In this paper, we exploit frequency diversity in a broadband WPT network and study the distributed charging control by ENs to…
Wireless sensor networks are composed of low cost and extremely power constrained sensor nodes which are scattered over a region forming self organized networks, making energy consumption a crucial design issue. Thus, finite network lifetime is widely regarded as a fundamental performance bottleneck. These networks are used for various applications such as field monitoring, home automation, medical data collection or surveillance. Research has shown that clustering sensor nodes is an efficient method to manage energy consumption for prolonging the network lifetime. Presence of heterogeneity en…
This paper shows that, when considering outdoor scenarios and wireless communications using the IEEE 802.11 protocol with dipole antennas, the ground reflection is a significant propagation mechanism. This way, the Two-Ray model for this environment allows predicting, with some accuracy, the received signal power. This study is relevant for the application in the communication between overflying Unmanned Aerial Vehicles (UAVs) and ground sensors. In the proposed Wireless Sensor Network (WSN) scenario, the UAVs must receive information from the environment, which is collected by sensors positio…
Ad-hoc wireless networks are of increasing importance in communication and are frequently constrained by energy use. Here we propose a distributed, non-hierarchical adaptive method using preferential detachment for adjusting node transmission power to reduce overall power consumption without violating network load limitations. We derive a cost and path length trade-off diagram that establishes the bounds of effectiveness of the adaptive strategy and compare it with uniform node transmission strategy for several node topologies. We achieve cost savings as high as 90% for specific topologies.
In designing wireless sensor networks, it is important to reduce energy dissipation and prolong network lifetime. In this paper, a new model with energy and monitored objects heterogeneity is proposed for heterogeneous wireless sensor networks. We put forward an energy-efficient prediction clustering algorithm, which is adaptive to the heterogeneous model. This algorithm enables the nodes to select the cluster head according to factors such as energy and communication cost, thus the nodes with higher residual energy have higher probability to become a cluster head than those with lower residua…
Topology control, including topology construction and maintenance phases, is a vital conception for wireless ad-hoc networks of any kind, expressly the wireless sensor networks (WSN). Topology maintenance, the latter phase, concerns several problems, such as optimizing the energy consumption, increasing the data rate, making clusters, and sustaining the connectivity. A disconnected network, among other strategies, can efficiently be connected again using a Movement-based Connectivity Restoration (MCR) method, where a commensurate number of nodes move (or are moved) to the desired positions. Ho…
We present scaling laws that dictate both local and global connectivity properties of bounded wireless networks. These laws are defined with respect to the key system parameters of per-node transmit power and the number of antennas exploited for diversity coding and/or beamforming at each node. We demonstrate that the local probability of connectivity scales like $\mathcal{O}(z^\mathcal C)$ in these parameters, where $\mathcal C$ is the ratio of the dimension of the network domain to the path loss exponent, thus enabling efficient boundary effect mitigation and network topology control.
This paper suggests a system architecture for wireless widearea- networking access using adhoc networking between a mobile Client node without direct connectivity to a wirelesswide- area-network and a mobile Service Provider node with connectivity to a wireless-wide-area-network. It provides a means for securely providing such adhoc wireless networking services using a Server for tunneling and routing, registration and authentication. The architecture also provides support for handoff of a Client node from one Service Provider to another with persistence of a tunnel between the Client and the …
We propose a localization algorithm for wireless sensor networks, which is simple in design, does not involve significant overhead and yet provides acceptable position estimates of sensor nodes. The algorithm uses settled nodes as beacon nodes so as to increase the number of beacon nodes. The algorithm is range free and does not need any additional piece of hardware for ranging. It also does not involve any significant communication overhead for localization. The simulation and results show that good localization accuracy is achieved for outdoor environments.
Communication for control-centric industrial applications is characterized by the requirements of very high reliability, very low and deterministic latency and high scalability. Typically, IEEE 802.11-based wireless local area networks (WLANs), also known as Wi-Fi networks, are deemed ineligible for industrial control applications owing to insufficient reliability and non-deterministic latency. This paper proposes a novel solution for providing reliable and deterministic communication, through Wi-Fi, in industrial environments. The proposed solution, termed as \textsf{HAR\(^\text{2}\)D-Fi} (\u…
We consider wireless sensor networks secured by the heterogeneous random key predistribution scheme under an on/off channel model. The heterogeneous random key predistribution scheme considers the case when the network includes sensor nodes with varying levels of resources, features, or connectivity requirements; e.g., regular nodes vs. cluster heads, but does not incorporate the fact that wireless channel are unreliable. To capture the unreliability of the wireless medium, we use an on/off channel model; wherein, each wireless channel is either on (with probability $α$) or off (with probabili…
We study the problem of routing in sensor networks where the goal is to maximize the network's lifetime. Previous work has considered this problem for fixed-topology networks. Here, we add mobility to the source node, which requires a new definition of the network lifetime. In particular, we redefine lifetime to be the time until the source node depletes its energy. When the mobile node's trajectory is unknown in advance, we formulate three versions of an optimal control problem aiming at this lifetime maximization. We show that in all cases, the solution can be reduced to a sequence of Non- L…
Bristol Research and Innovation Laboratory, Toshiba Europe Ltd.（东芝欧洲有限公司布里斯托尔研究与创新实验室）
Mobile robots have disrupted the material handling industry which is witnessing radical changes. The requirement for enhanced automation across various industry segments often entails mobile robotic systems operating in logistics facilities with little/no infrastructure. In such environments, out-of-box low-cost robotic solutions are desirable. Wireless connectivity plays a crucial role in successful operation of such mobile robotic systems. A wireless mesh network of mobile robots is an attractive solution; however, a number of system-level challenges create unique and stringent service requi…
Project Loon is a Google initiated research project from the Google X Lab. The project focuses on providing remote internet access and network connectivity. The connectivity is established in vertical and horizontal space; vertical connectivity between Google Access Point (GAP) and the balloons, and between balloons and antennas installed at land; horizontal connectivity is between the balloons. This research focuses on the connectivity between the balloons in a mesh network. The proposal focuses on implementing graphical methods like convex hull with adhoc communication protocols. The propose…
Blockchain is considered the critical backbone technology for secure and trusted Internet of Things (IoT) in the future 6G network. However, deploying a blockchain system in a complex wireless IoT network is challenging due to the limited resources, complex wireless environment, and the property of self-interested IoT devices. The existing incentive mechanism of blockchain is not compatible with the wireless IoT network. In this paper, to incentivize IoT devices to join the construction of the wireless blockchain network, we propose a multi-dimensional contract to optimize the blockchain utili…
Adapting applications' data rates in multi-hop wireless ad-hoc networks is inherently challenging. Packet collision, channel contention, and queue buildup contribute to packet loss but are difficult to manage in conventional TCP/IP architecture. This work explores a data-centric approach based on Name Data Networking (NDN) architecture, which is considered more suitable for wireless ad-hoc networks. We show that the default NDN transport offers better performance in linear topologies but struggles in more extensive networks due to high collision and contention caused by excessive Interests fro…
