اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدIn-network Aggregation using Efficient Routing Techniques for Event Driven Sensor Network
95
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Sensors used in applications such as agriculture, weather, etc., monitoring physical parameters like soil moisture, temperature, humidity, will have to sustain their battery power for long intervals of time. In order to accomplish this, parameter which assists in reducing the consumption of power from battery need to be attended to. One of the factors affecting the consumption of energy is transmit and receive power. This energy consumption can be reduced by avoiding unnecessary transmission and reception. Efficient routing techniques and incorporating aggregation whenever possible can save considerable amount of energy. Aggregation reduces repeated transmission of relative values and also reduces lot of computation at the base station. In this paper, the benefits of aggregation over direct transmission in saving the amount of energy consumed is discussed. Routing techniques which assist aggregation are incorporated. Aspects like transmission of average value of sensed data around an area of the network, minimum value in the whole of the network, triggering of event when there is low battery are assimilated.
قيم البحث
اقرأ أيضاً
One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the energy dissipated throughout the wireless sensor network in order to min
imize maintenance and maximize overall system performance. Any communication protocol that involves synchronization of peer nodes incurs some overhead for setting up the communication. We introduce a new algorithm, e3D (energy-efficient Distributed Dynamic Diffusion routing algorithm), and compare it to two other algorithms, namely directed, and random clustering communication. We take into account the setup costs and analyze the energy-efficiency and the useful lifetime of the system. In order to better understand the characteristics of each algorithm and how well e3D really performs, we also compare e3D with its optimum counterpart and an optimum clustering algorithm. The benefit of introducing these ideal algorithms is to show the upper bound on performance at the cost of an astronomical prohibitive synchronization costs. We compare the algorithms in terms of system lifetime, power dissipation distribution, cost of synchronization, and simplicity of the algorithm. Our simulation results show that e3D performs comparable to its optimal counterpart while having significantly less overhead.
To minimize enormous havoc from disasters, permanent environment monitoring is necessarily required. Thus we propose a novel energy management protocol for energy harvesting wireless sensor networks (EH-WSNs), named the adaptive sensor node managemen
t protocol (ASMP). The proposed protocol makes system components to systematically control their performance to conserve the energy. Through this protocol, sensor nodes autonomously activate an additional energy conservation algorithm. ASMP embeds three sampling algorithms. For the optimized environment sampling, we proposed the adaptive sampling algorithm for monitoring (ASA-m). ASA-m estimates the expected time period to occur meaningful change. The meaningful change refers to the distance between two target data for the monitoring QoS. Therefore, ASA-m merely gathers the data the system demands. The continuous adaptive sampling algorithm (CASA) solves the problem to be continuously decreasing energy despite of ASA-m. When the monitored environment shows a linear trend property, the sensor node in CASA rests a sampling process, and the server generates predicted data at the estimated time slot. For guaranteeing the self-sustainability, ASMP uses the recoverable adaptive sampling algorithm (RASA). RASA makes consumed energy smaller than harvested energy by utilizing the predicted data. RASA recharges the energy of the sensor node. Through this method, ASMP achieves both energy conservation and service quality.
A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be sent over
direct physical links connecting nearby quantum nodes, or by means of teleportation over pre-established entanglement amongst distant network nodes. Such pre-shared entanglement effectively forms a shortcut - a virtual quantum link - which can be used exactly once. Here, we present an abstraction of a quantum network that allows ideas from computer science to be applied to the problem of routing qubits, and manage entanglement in the network. Specifically, we consider a scenario in which each quantum network node can create EPR pairs with its immediate neighbours over a physical connection, and perform entanglement swapping operations in order to create long distance virtual quantum links. We proceed to discuss the features unique to quantum networks, which call for the development of new routing techniques. As an example, we present two simple hierarchical routing schemes for a quantum network of N nodes for a ring and sphere topology. For these topologies we present efficient routing algorithms requiring O(log N) qubits to be stored at each network node, O(polylog N) time and space to perform routing decisions, and O(log N) timesteps to replenish the virtual quantum links in a model of entanglement generation.
In past years there has been increasing interest in field of Wireless Sensor Networks (WSNs). One of the major issue of WSNs is development of energy efficient routing protocols. Clustering is an effective way to increase energy efficiency. Mostly, h
eterogenous protocols consider two or three energy level of nodes. In reality, heterogonous WSNs contain large range of energy levels. By analyzing communication energy consumption of the clusters and large range of energy levels in heterogenous WSN, we propose BEENISH (Balanced Energy Efficient Network Integrated Super Heterogenous) Protocol. It assumes WSN containing four energy levels of nodes. Here, Cluster Heads (CHs) are elected on the bases of residual energy level of nodes. Simulation results show that it performs better than existing clustering protocols in heterogeneous WSNs. Our protocol achieve longer stability, lifetime and more effective messages than Distributed Energy Efficient Clustering (DEEC), Developed DEEC (DDEEC) and Enhanced DEEC (EDEEC).
We study a problem of fundamental importance to ICNs, namely, minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. We consider both source routing and hop-by-hop routing settings. The respec
tive offline problems are NP-hard. Nevertheless, we show that there exist polynomial time approximation algorithms producing solutions within a constant approximation from the optimal. We also produce distributed, adaptive algorithms with the same approximation guarantees. We simulate our adaptive algorithms over a broad array of different topologies. Our algorithms reduce routing costs by several orders of magnitude compared to prior art, including algorithms optimizing caching under fixed routing.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
