This paper formulates an analytical model of energy dissipation in cluster-based wireless sensor networks for network connectivity. The proposed model constructs the analytic expression for the optimal cluster size fo...
详细信息
This paper formulates an analytical model of energy dissipation in cluster-based wireless sensor networks for network connectivity. The proposed model constructs the analytic expression for the optimal cluster size for minimum energy dissipation. The same model is then applied to control the cluster size which is defined as number of nodes connected to a node (node degree) through transmission power control. The proposed approach constrains the cluster size through node's degree so that all cluster heads maintain a minimum node degree for network connectivity. The simulation results show the total energy dissipation in the network with respect to node's degree, and when cluster heads' degree is above a certain value (threshold), the network remains connected at many more rounds during the network operation.
Current deterministic sensor deploying methods always include the uncovered space greedily to reduce the number of deployed sensors. Because the sensing area of each sensor is circle-like, these greedily methods often...
详细信息
Current deterministic sensor deploying methods always include the uncovered space greedily to reduce the number of deployed sensors. Because the sensing area of each sensor is circle-like, these greedily methods often divide the region of interest to multiple tiny and scattered regions. Therefore, many additional sensors are deployed to cover these scattered regions. This paper proposes a Jigsaw-based sensor placement (JSP) algorithm for deploying sensors deterministically. Sensors are placed at the periphery of the region of interest to prevent separating the region of interest to isolated regions. An enhanced mechanism is also proposed to improve the time complexity of the proposed method. The scenarios with and without obstacles are evaluated. The simulation results show that the proposed method can cover the whole region of interest with fewer deployed sensors. The effective coverage ratio of JSP method is less than 2. It is better than the maximum coverage method and the Delaunay triangulation method. The deploying sensors have more efficient coverage area, and the distribution of the incremental covered area is close to normal distribution.
A directional sensor network is different from conventional wireless sensor networks. It uses directional sensors instead of omnidirectional ones in the network for different applications, and the effective sensing ra...
详细信息
A directional sensor network is different from conventional wireless sensor networks. It uses directional sensors instead of omnidirectional ones in the network for different applications, and the effective sensing range is characterized by directionality and size-specific sensing angle. Therefore, conditions of directional sensor networks are dissimilar to those of generic wireless sensor networks for researches, especially on the sensing coverage. This study proposed a distributed approach to enhance the overall field coverage by utilizing mobile and direction-rotatable sensors in a directional sensor network. The algorithm makes sensors self-redeploy to the new location and new direction without global information by utilizing the features of geometrical Voronoi cells. Simulations were used to evaluate and prove the effectiveness of the proposed algorithm. The results show that the approach contributes to significant field coverage improvement in directional sensor networks.
This work presents an approach to evaluate the exact value of the fractal dimension of the cutting path dfCP on hierarchical structures with finite order of ramification. Our approach is based on a renormalization gro...
详细信息
This work presents an approach to evaluate the exact value of the fractal dimension of the cutting path dfCP on hierarchical structures with finite order of ramification. Our approach is based on a renormalization group treatment of the universality class of watersheds. By making use of the self-similar property, we show that dfCP depends only on the average cutting path (CP) of the first generation of the structure. For the simplest Wheastone hierarchical lattice (WHL), we present a mathematical proof. For a larger WHL structure, the exact value of dfCP is derived based on a computer algorithm that identifies the length of all possible CP's of the first generation.
Wireless sensor network has been applied to many areas for a long time. A new kind of wireless sensors equipped with a camera and a microphone has been emerging recently. This kind of sensor is called wireless multime...
详细信息
Wireless sensor network has been applied to many areas for a long time. A new kind of wireless sensors equipped with a camera and a microphone has been emerging recently. This kind of sensor is called wireless multimedia sensor (WMS) because it can capture and process multimedia data such as image, sound, and video. The visual monitoring network is a typical scenario of WMS application. Massive data would be produced in a short time because of the intensive WMS deployment. Many data aggregation and compression technologies have been proposed for addressing how to transfer data efficiently. However, data aggregation technologies need highly efficient router algorithm, and compression algorithms might consume more computation time and memory because of the high complexity. This paper applies data deduplication technology to this scenario. It can eliminate the redundant data from raw data to exploit the network bandwidth efficiently. Moreover, a chunking algorithm with low computation complexity is presented in this paper, and its efficiency has been proved through the experiments.
Wireless sensor networks (WSNs) consist of multiple, distributed nodes each with limited resources. With their strict resource constraints and application-specific characteristics, WSNs contain many challenging tradeo...
详细信息
Wireless sensor networks (WSNs) consist of multiple, distributed nodes each with limited resources. With their strict resource constraints and application-specific characteristics, WSNs contain many challenging tradeoffs. This paper proposes a bioinspired load balancing approach, based on pheromone signalling mechanisms, to solve the tradeoff between service availability and energy consumption. We explore the performance consequences of the pheromone-based load balancing approach using (1) a system-level simulator, (2) deployment of real sensor testbeds to provide a competitive analysis of these evaluation methodologies. The effectiveness of the proposed algorithm is evaluated with different scenario parameters and the required performance evaluation techniques are investigated on case studies based on sound sensors.
The zeroth and first laws of thermodynamics define the concepts of thermal equilibrium and thermal energy. The second law of thermodynamics determines whether a particular transfer of thermal energy can occur. Collect...
详细信息
The zeroth and first laws of thermodynamics define the concepts of thermal equilibrium and thermal energy. The second law of thermodynamics determines whether a particular transfer of thermal energy can occur. Collectively, these fundamental laws of nature imply that a closed collection of thermodynamic subsystems will tend to thermal equilibrium. This paper generalizes the concepts of energy, entropy, and temperature to undirected and directed networks of single integrators, and demonstrates how thermodynamic principles can be applied to the design of distributed consensus control algorithms for networked dynamical systems.
In self-organized wireless sensor networks (WSNs), any two sensor nodes can connect if they are placed in each other's communication range. Therefore, the physical topology of WSNs is usually a strongly connected ...
详细信息
In self-organized wireless sensor networks (WSNs), any two sensor nodes can connect if they are placed in each other's communication range. Therefore, the physical topology of WSNs is usually a strongly connected topology. Sensor nodes should frequently receive and process data from their large number of neighbors, which will consume great amounts of energy. Shocking wireless channel collision also causes low throughput and high loss packets ratio during data transmission. To improve the transmission performance and save scarce energy, a logical topology generating from the physical one is necessary for the self-organized WSNs. Based on the complex network theory, this paper proposed a novel betweenness addition edges expansion algorithm (BAEE). With betweenness calibration, BAEE algorithm expanded the minimum-cost edges to optimize the network topology. Two performance metrics-connectivity functions, robustness function R(G) and efficiency function E(G), were utilized to evaluate the network capability of the robustness and invulnerability. R(G) is the parameter to measure the topology connectivity, and E(G) is the parameter to evaluate the network exchanging information capability. Based on the simulation under various random failures and intentional attack scenarios, BAEE can effectively optimize WSNs' topology and improve the network's robust connectivity and extremely efficient exchanging information capability.
Big data and distributed computing are of great importance in wireless sensor networks (WSNs). They are always bonded together, and the latter one upholds the former one. In distributed computing, mobile agent model i...
详细信息
Big data and distributed computing are of great importance in wireless sensor networks (WSNs). They are always bonded together, and the latter one upholds the former one. In distributed computing, mobile agent model is the mainstream technology. With autonomy, communicativeness, mobility, and role, mobile agent model is more suitable for large-scale, resources-restrained WSN to deal with big data. This paper mainly studies migration schemes for mobile agents, determines core factors of migration strategy, and proposes SMLA and DMLA algorithms. And aiming at revealing the characteristics of target tracking, this paper puts forward pid-DMLA algorithm;and considering multiple agents' cooperation, it presents Mpid-DMLA algorithm. Moreover, this paper evaluates and analyzes the advantages and disadvantages of the above-mentioned four algorithms by simulations.
The drive-thru Internet is an effective mean to provide Internet access service for wireless sensor networks deployed on vehicles. In these networks, vehicles often experience different link qualities due to different...
详细信息
The drive-thru Internet is an effective mean to provide Internet access service for wireless sensor networks deployed on vehicles. In these networks, vehicles often experience different link qualities due to different relative positions to the access point. This makes fair and efficient system design a very challenging task. In traditional approaches, the network efficiency has to be greatly sacrificed to provide the fair share for vehicles with low link quality. To address this issue, we propose a novel amortized fairness MAC protocol. The basic idea is that vehicles with lower link quality can defer their fairness requests and let the lost fairness be "amortized" in the future when their links become the high quality. The amortized fairness MAC requires predictions of future link quality. For this, we fully exploit the inner and inter-AP correlations revealed from our extensive field studies and design a link quality prediction algorithm. Based on the predicted link quality, we formulate the optimal amortized fairness MAC as a convex programming problem, which can be solved with the desired precision in polynomial time. Extensive simulation on real traces shows that the amortized fairness MAC scheme is more efficient than the existing fairness schemes in terms of efficiency and fairness.
暂无评论