716 research outputs found
An efficient partial coverage algorithm for wireless sensor networks
No full textWireless sensor networks (WSNs) are currently adopted in a vast variety of domains. Due to practical energy constraints, in this field minimizing sensor energy consumption is a critical challenge. Sleep scheduling approaches give the opportunity of turning off a subset of the nodes of a network- without suspending the monitoring activities performed by the WSN-in order to save energy and increase the lifetime of the sensing system. Our study focuses on partial coverage, targeting scenarios in which the continuous monitoring of a limited portion of the area of interest is enough. In this paper, we present PCLA, an efficient algorithm based on Learning Automata that aims at minimizing the number of sensors to activate, such that a given portion of the area of interest is covered and connectivity among sensors is preserved. Simulation results show how PCLA can select sensors in an efficient way to satisfy the imposed constraints, thus guaranteeing better performance in terms of both working-node ratio and WSN lifetime. Also, we show how PCLA outperforms state-of-the-art partial-coverage algorithms
A sleep scheduling approach based on learning automata for WSN partialcoverage
No full textWireless sensor networks (WSNs) are currently adopted in a vast variety of domains where sensor energy consumption is a critical challenge because of the existing power constraints. Sleep scheduling approaches have recently attracted the interest of the scientific community, as they give the opportunity of turning off the redundant nodes of a network to save energy and prolong the lifetime of the network without suspending the monitoring activities performed by the WSN.
Our study focuses on the problem of partial coverage, targeting scenarios in which the continuous monitoring of a limited portion of the area of interest is enough. In this paper we present PCLA, a novel algorithm that relies on Learning Automata to implement sleep scheduling approaches. It aims at minimizing the number of sensors to activate for covering a desired portion of the region of interest preserving the connectivity among sensors. Simulation results show how PCLA can select sensors in an efficient way to satisfy the imposed constraints, thus guaranteeing good performance in terms of time complexity, working-node ratio, scalability, and WSN lifetime. Moreover, compared to the state of the art, PCLA is able to guarantee better performance
Improving Channel Assignment in Multi-radio Wireless Mesh Networks with Learning Automata
No full textDeSI: A decentralized software-defined network architecture for internet eXchange points
Get PDFApplications of Software-Defined Networking (SDN) to the Internet Routing hold great promises for supporting the ever-growing performance requirements of Internet applications. The inherent centralization of these SDN approaches on the Internet routing comes with the following concerns: 1) privacy, the operators are reluctant to share private routing information, 2) separation of responsibilities, the Internet eXchange Point (IXP) running the centralized controller is involved in the routing and forwarding at too many levels, and 3) scalability, the growing number of IP prefixes routed on the Internet (i.e., hundreds of thousands) pose extremely high requirements at both the control and data-planes, e.g., several minutes for policy compilations and a large number of forwarding rules, in SDN. In this paper, we propose DESI to apply SDN at IXPs by considering the above concerns. We break this centralization by devising an SDN-enabled IXP architecture in which each member connects to an SDN-enabled IXP through its SDN controller and SDN switches, thus tackling privacy, scalability, and separation of concerns issues. To spur adoption, we introduce an expressive, yet simple, language to configure the routing policies of the members. Our evaluation shows that DESI needs n times fewer forwarding table entries for an IXP in which n is the number of IXP members. DESI also gives the possibility of slowly migrating to the SDN-enabled IXPs.BMBF, 01IS18025A, Verbundprojekt BIFOLD-BBDC: Berlin Institute for the Foundations of Learning and DataBMBF, 01IS18037A, Verbundprojekt BIFOLD-BZML: Berlin Institute for the Foundations of Learning and Dat
TEL: Low-Latency Failover Traffic Engineering in Data Plane
No full textModern network applications demand low-latency traffic engineering in the presence of network failure, while preserving the quality of service constraints like delay and capacity. Fast Re-Route (FRR) mechanisms are widely used for traffic re-routing purposes in failure scenarios. Control plane FRR typically computes the backup forwarding rules to detour the traffic in the data plane when the failure occurs. This mechanism could be computed in the data plane with the emergence of programmable data planes. In this paper, we propose a system (called TEL) that contains two FRR mechanisms, namely, and . The first one computes backup forwarding rules in the control plane, satisfying max-min fair allocation. The second mechanism provides FRR in the data plane. Both algorithms require minimal memory on programmable data planes and are well-suited with modern line rate match-action forwarding architectures (e.g., PISA). We implement both mechanisms on P4 programmable software switches (e.g., BMv2 and Tofino) and measure their performance on various topologies. The obtained results from a datacenter topology show that our FRR mechanism can improve the flow completion time up to 4.6xb–7.3x (i.e., small flows) and 3.1x–12x (i.e., large flows) compared to recirculation-based mechanisms, such as F10, respectively
P-SEP: a prolong stable election routing algorithm for energy-limited heterogeneous fog-supported wireless sensor networks
No full textEnergy efficiency is one of the main issues that will drive the design of fog-supported wireless sensor networks (WSNs). Indeed, the behavior of such networks becomes very unstable in node’s heterogeneity and/or node’s failure. In WSNs, clusters are dynamically built up by neighbor nodes, to save energy and prolong the network lifetime. One of the nodes plays the role of Cluster Head (CH) that is responsible for transferring data among the neighboring sensors. Due to pervasive use of WSNs, finding an energy-efficient policy to opt CHs in the WSNs has become increasingly important. Due to this motivations, in this paper, a modified Stable Election Protocol (SEP), named Prolong-SEP (P-SEP) is presented to prolong the stable period of Fog-supported sensor networks by maintaining balanced energy consumption. P-SEP enables uniform nodes distribution, new CH selecting policy, and prolong the time interval of the system, especially before the failure of the first node. P-SEP considers two-level nodes’ heterogeneities: advanced and normal nodes. In P-SEP, the advanced and normal nodes have the opportunity to become CHs. The performance of the proposed approach is evaluated by varying the various parameters of the network in comparison with other state-of-the-art cluster-based routing protocols. The simulation results point out that, by varying the initial energy and node heterogeneity parameters, the network lifetime of P-SEP improved by 31, 29, 20 and 40 % in comparison with SEP, Low-Energy Adaptive Clustering Hierarchy with Deterministic Cluster-Head Selection (LEACH-DCHS), Modified SEP (M-SEP) and an efficient modified SEP (EM-SEP), respectively
Effects of Blood Conservation on Perioperative CABG Outcomes
No full text[No abstract available]Habib RH, 2003, J THORAC CARDIOV SUR, V125, P1438, DOI 10.1016-S0022-5223(02)125:1438-50; Habib RH, 2005, CRIT CARE MED, V33, P1749, DOI 10.1097-01.CCM.0000171531.06133.B0; Moskowitz DM, 2010, ANN THORAC SURG, V90, P451, DOI 10.1016-j.athoracsur.2010.04.089; Ranucci M, 2010, ANN THORAC SURG, V89, P11, DOI 10.1016-j.athoracsur.2009.07.07811
ANALISIS PESAN DAKWAH BUKU HABIB UMAR BIN HAFIDZ BERCERITA
Get PDFM. Iqbal: Analysis of The Message of Da'wah habib umar bin hafidz tells the
story, Thesis Department of Communication and Islamic
Broadcasting, Faculty of Da'wah and Communication Sciences. UIN
Antasari Banjarmasin, 2021.
Guide (I): Drs. Ahmad Rijali, M. Pd., Mentor (II): Hj. Mariyatul NR,
S.Ag., M. Si.
Keywords: Analysis, Habib Umar, Habib Umar Book
This research is to answer questions about the message of da'wah in habib Umar
Bin Hafizh's book tells the story of Muhammad. Which includes any message that
can be taken from the book by the reader.
Content analysis is a research method used to examine the content of messages in
a communication process. Content analysis is research that is an in-depth
discussion of the content of written or printed information in the mass media.
Content analysis is generally defined as a method that includes all analysis of the
content of the text. Content analysis can also be said to be a study of the content
or meaning of communication messages based on the data available to be made
conclusions. Content analysis is a research technique to obtain an overview of the
contents of time communication messages that are carried out objectively,
systematically, and sociologically relevant, the description and analysis can use
qualitative and quantitative measurement procedures or both.
The results of the research of Habib Umar Bin Hafizh's book Tell Stories, there
are messages of da'wah that make someone have to read the book. The book
contains a lecture of Habib Umar which was booked by someone. So the groups of
habib umar's lectures or tausiyah are in the book. But it's unfortunate that
researchers couldn't find someone who compiled the book. Researchers searching
the internet even asked the bookseller. But they also could not answer who exactly
the constituents on behalf of Muhammad were. Although the author does not know
who Muhammad compiled the book, the author can practice and get the reward
after reading and understanding the book. The impression of the reader of Habib
Umar bin Hafizh's book is someone who is forgiving
- …
