Relevant bibliographies by topics / Node Redundancy

Academic literature on the topic 'Node Redundancy'

Author: Grafiati
Published: 4 June 2021
Last updated: 19 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Node Redundancy.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Node Redundancy"

1

Wang, Hai Tao, Jian Zhou Li, Yan Li, Xue Ping Zhang, and Hui Chen. "A Probabilistic Based Redundancy Control Algorithm for Wireless Sensor Network." Applied Mechanics and Materials 347-350 (August 2013): 718–23. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.718.

Full text
Abstract:
Existing redundancy control algorithms in WSN often have some evident shortcomings such as hypothesis is too much, application backgrounds are not clear, the precision of redundancy control is low and computing complexity is high. In this paper a probabilistic based redundancy control algorithm (PBRCA) is proposed. Aiming at specific application scenarios, PBRCA introduces the probabilistic estimation theory, taking uncertainty in reasonable range as cost to determine redundant nodes in network and allow as many redundant nodes as possible to sleep. This algorithm requires fewer assumed conditions and less computational complexity as well as high flexibility. In addition, it can adapt to various redundancy control requirements of WSN with different network scales and node densities. Simulation results show that, PBRCA can control network topology node redundancy effectively with little cost and improve network efficiency.
APA, Harvard, Vancouver, ISO, and other styles
2

Aikebaier, Ailixier, Tomoya Enokido, and Makoto Takizawa. "Design and Evaluation of Reliable Data Transmission Protocol in Wireless Sensor Networks." Mobile Information Systems 4, no. 3 (2008): 237–52. http://dx.doi.org/10.1155/2008/791720.

Full text
Abstract:
A wireless sensor-actuator network (WSAN) is composed of sensor modes and actuator modes which are interconnected in wireless networks. A sensor node collects information on the physical world and sends a sensed value in a wireless network. Another sensor node forwards the sensed value to deliver to an actuator node. A sensor node can deliver messages with sensed values to only nearby nodes due to weak radio. Messages are forwarded by sensor nodes to an actuator node by a type of flooding protocol. A sensor mode senses an event and sends a message with the sensed value. In addition, on receipt of a message with a sensed value from another sensor mode, a sensor node forwards the sensed value. Messages transmitted by sensor nodes might be lost due to noise and collisions. In this paper, we discuss a redundant data transmission (RT) protocol to reliably and efficiently deliver sensed values sensed by sensor nodes to an actuator node. Here, a sensor node sends a message with not only its sensed value but also sensed values received from other sensor nodes. The more number of sensed values are included in a message, the more frequently the message is lost. Each message carries so many number of sensed values that the message loss ratio is not increased. Even if a message with a sensed value v is lost in the wireless network, an actuator node can receive the sensed value v from a message sent by another sensor node. Thus, each sensed value is redundantly carried in multiple messages. The redundancy of a sensed value is in nature increased since the sensed value is broadcast. In order to reduce the redundancy of sensed value, we take a strategy that the farther sensor nodes from an actuator node forward the fewer number of sensed values. We evaluate the RT protocol in terms of loss ratio, redundancy, and delay time of a sensed value. We show that about 80% of sensed values can be delivered to an actuator node even if 95% of messages are lost due to noise and collision.
APA, Harvard, Vancouver, ISO, and other styles
3

Ni, Ming, Kai Guo Qian, Yong Gang Xie, and Zu Cheng Dai. "A Sensor Network Routing Protocol Based on Node Residual Energy." Advanced Materials Research 816-817 (September 2013): 1081–84. http://dx.doi.org/10.4028/www.scientific.net/amr.816-817.1081.

Full text
Abstract:
This paper mainly discusses the problem of wireless sensor network routing protocols. The flooding routing protocol has disadvantages of hidden terminal, information implosion and emerging redundant packet copies which consume more node energy. A sensor network routing protocol based on node residual energy (RPBEN) is proposed and evaluated. The new protocol choices a small number of nodes that have maximum remaining energy as next hop routing nodes. It saves the energy by avoiding redundancy packet copies produced and improve the disadvantages of flooding routing protocol. Performance analysis and simulation experiment show that the new protocol effectively reduces the data redundancy, reduces the energy consumption and prolongs the network lifetime.
APA, Harvard, Vancouver, ISO, and other styles
4

Qian, Kai Guo, Ming Li, and Zu Cheng Dai. "A Sensor Network Flooding Routing Algorithm Based on Sector Area Nodes Selection." Advanced Materials Research 765-767 (September 2013): 1766–69. http://dx.doi.org/10.4028/www.scientific.net/amr.765-767.1766.

Full text
Abstract:
A sensor network flooding routing algorithm based on sector area nodes selection (RABSA) is proposed and evaluated to improve shortcoming hidden terminal, information implosion and emerging redundant packet copies which consume more node energy in the flooding algorithm. Source node selects the nodes located in the sector area of arc angle for ɑ and radius for node communication distance as next hop routing nodes. Performance analysis and simulation experiment shows that the new protocol effectively reduces the data redundancy, reduce the energy consumption and prolong the network lifetime.
APA, Harvard, Vancouver, ISO, and other styles
5

Gandino, Filippo, Bartolomeo Montrucchio, and Maurizio Rebaudengo. "Redundancy in Key Management for WSNs." Cryptography 2, no. 4 (December 8, 2018): 40. http://dx.doi.org/10.3390/cryptography2040040.

Full text
Abstract:
Security in wireless sensor networks is commonly based on symmetric encryption and requires key-management systems to establish and exchange secret keys. A constraint that is common to many key-management approaches is an upper bound to the total number of nodes in the network. An example is represented by the schemes based on combinatorial design. These schemes use specific rules for the generation of sets of keys that are distributed to the nodes before deploying the network. The aim of these approaches is to improve the resilience of the network. However, the quantity of data that must be stored by each node is proportional to the number of nodes of the network, so the available memory affects the applicability of these schemes. This paper investigates the opportunity of reducing the storage overhead by distributing the same set of keys to more than one node. In addition, the presence of redundant sets of keys affects the resilience and the security of the network. A careful analysis is conducted to evaluate benefits and drawbacks of redundant key distribution approaches. The results show that the use of redundancy decreases the level of resilience, but it scales well on very large networks.
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Xingjun, Cuiping Jing, Feilong Tang, Scott Fowler, Huali Cui, and Xiaoshe Dong. "Joint Redundant and Random Network Coding for Robust Video Transmission over Lossy Networks." Mobile Information Systems 8, no. 3 (2012): 213–30. http://dx.doi.org/10.1155/2012/931965.

Full text
Abstract:
In this paper a novel unequal packet loss protection scheme R2NC based on low-triangular global coding matrix with ladder-shaped partition is presented, which combines redundant and random network coding for robust H.264/SVC video transmission. Firstly, the error-correcting capabilities of redundant network coding make our scheme resilient to loss. Secondly, the implementation of random network coding at the intermediate nodes with multiple input links can reduce the cost of network bandwidth, thus reducing the end-to-end delay for video transmission. Thirdly, the low-triangular global coding matrix with ladder-shaped partition is maintained throughout the R2NC processes to reduce the impact of global coding matrix's rank deficiency on video transmission and provide unequal erasure protection for H.264/SVC priority layers. The redundant network coding avoids the retransmission of lost packets and improves error-correcting capabilities of lost packets. Based only on the knowledge of the packet loss rates on the output links, the source node and intermediate nodes can make decisions for redundant network coding and random network coding (i.e., how much redundancy to add at this node). However, the redundancy caused by redundant network coding makes the network load increases. In order to improve network throughput, we performed random network coding at the intermediate nodes. Our approach is grounded on the overall distortion of reconstructed video minimization by optimizing the amount of redundancy assigned to each layer. The convex optimization model is constructed under the constraint of network coding and scalable video coding. Experimental results are shown to demonstrate the significant improvement of H.264/SVC video reconstruction quality with R2NC over packet lossy networks.
APA, Harvard, Vancouver, ISO, and other styles
7

Sun, Li Hui. "Design Method of Redundant Node in Zigbee Wireless Sensor Network." Applied Mechanics and Materials 568-570 (June 2014): 604–7. http://dx.doi.org/10.4028/www.scientific.net/amm.568-570.604.

Full text
Abstract:
Redundancy technology is an important measure to enhance the reliability of computer control system. Two types of node redundancy architectures of wireless sensor network are analyzed. The design and implementing method of node redundancy in Zigbee network is presented. The node, which acts as master, is determined through competition after the system is powered up. The logical structure of the system is presented too. The switch protocol between master computer and backup computer and the method of competing for master among all the nodes are described in detail. The system can achieve that backup computer switches to master computer without disturbance. Because Zigbee network is adopted to achieve switching between Master and Backup, the reliability of the whole system is enhanced. The novel redundancy system is of low-cost, openness and good maintainability.
APA, Harvard, Vancouver, ISO, and other styles
8

Nehra, Vibha, and Ajay K. Sharma. "Topology Controlled Energy Proficient Protocol for Wireless Sensor Networks." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 11, no. 8 (November 27, 2013): 2895–902. http://dx.doi.org/10.24297/ijct.v11i8.3008.

Full text
Abstract:
Random deployment in Wireless sensor networks lead to spatial node redundancy in close knit sensor networks. In this paper, an improved energy proficient PEGASIS based protocol (PEGASIS-TC) has been proposed. PEGASIS-TC exploits this spatial node redundancy by finding optimal subset of nodes that guarantee connectivity and turns off the remaining nodes based on CTR (Critical transmission range) to conserve energy which can be used in later stages to extend the network lifetime. The simulation results obtained show that PEGASIS-TC gives an increase in network lifetime as compared to PEGASIS.
APA, Harvard, Vancouver, ISO, and other styles
9

Yoo, Dae-Seung, Van Khoe Ta, Byung-Tae Jang, and Hoon Oh. "An Energy-Efficien Slotted Sense Multiple Access Broadcast Protocol for Reliable Command Delivery in Dynamic Wireless Sensor Networks." Sensors 19, no. 5 (March 11, 2019): 1236. http://dx.doi.org/10.3390/s19051236.

Full text
Abstract:
In industrial monitoring and control applications, a server often has to send a command to a node or group of nodes in wireless sensor networks. Flooding achieves high reliability of message delivery by allowing nodes to take the redundancy of receiving the identical message multiple times. However, nodes consume much energy due to this redundancy and the long duty cycle. A reliable slotted broadcast protocol (RSBP) tackles this problem by allocating a distinct broadcast slot (BS) to every node using a tree topology. Not only does it remove collision, but it also minimizes energy consumption such that every node remains active only during its parent’s broadcast slot and its own broadcast slot to receive and rebroadcast a message, respectively. However, it suffers from low reliability in harsh environments due to the compete removal of redundancy and low responsiveness to the changes in network topology due to the global scheduling of slots. Our approach allocates one distinct broadcast sharable slot (BSS) to each tree level, thus making a BSS schedule topology-independent. Then, nodes at the same level compete to rebroadcast a message to nodes at one level higher within the BSS, thus allowing the redundancy. In addition, it uses a slot-scheduled transmission within BSS that can further improve reliability by reducing message collisions and also enables the precise management of energy. According to simulations and experiments, the proposed approach can achieve high reliability comparable to flooding and low-energy consumption comparable to RSBP.
APA, Harvard, Vancouver, ISO, and other styles
10

Bukov, V. N., V. A. Shurman, I. F. Gamayunov, and A. M. Ageev. "Redundant Computing Resources Management of Integrated Modular Avionics." Mekhatronika, Avtomatizatsiya, Upravlenie 20, no. 6 (June 6, 2019): 376–84. http://dx.doi.org/10.17587/mau.20.376-384.

Full text
Abstract:
In article the structure and the control algorithm are considered by diverse redundancy of the computing system of the perspective integrated modular avionics. Computing resources of the integrated modular avionics system are generally represented by heterogeneous computing systems used for information processing as part of the onboard integrated computing environment. The basis of heterogeneous computing systems are processor nodes, redundancy of computing systems is that the number of processor nodes is greater than one. The task is to synthesize such a computer system in which the automatic control of redundant computational resources would be carried out by using the own capabilities of the processor nodes and without the use of additional hardware resources. It is considered that the redundant computer system performs meaningful calculations of the problem solved by several processor nodes in parallel. All meaningful calculations for any signs initially divided into relatively short stages, providing an opportunity to assess the effectiveness of the completion of each of them. The computational system redundancy management is based on the periodic calculation and comparison of the success indicators of the stage. Pairwise arbitration of processor nodes is carried out according to a hierarchical scheme by comparing the values of the success indicators of the stages of the same name. Subsequent reconfiguration of the computer system allocates passive and leading processor nodes in pairs at all levels of the hierarchical scheme. The failure of the passive processor node does not affect the execution of the main cycle. The failure of the host processor node does not cause interruptions in the output of the results of calculations, but destroys the structure of reserves, which is restored after arbitration in the next cycle. Failure of the lead CPU top node leads to the failure output in the current cycle, the computational process is restored along with the new hierarchy of the computing system in the next cycle. The proposed solution is aimed at parrying both hardware failures and software malfunction. The methodical example based on the computer system of the modern onboard equipment complex of the transports category aircraft is resulted.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Node Redundancy"

1

Sakib, Kazi Muheymin-Us, and s3091580@rmit edu au. "Energy Balanced Sensor Node Organisation For Maximising Network Lifetime." RMIT University. Computer Science and Information Technology, 2008. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080805.135709.

Full text
Abstract:
Recent advances in Micro-Electro-Mechanical Systems (MEMS) and low-power short-range radios have enabled rapid development of wireless sensor networks. Future sensor networks are anticipated to include hundreds or thousands of these devices in many applications, such as capturing multimedia content for surveillance, structural health monitoring, tracking of accidental chemical leaks, machine failures, earthquakes and intrusion detection. With the increase of sensor applications, a number of challenging problems related to the network protocol design has emerged - the most important ones relating to energy efficiency and lifetime maximisation. Techniques devised for sensor networks should deal with a large number of sensors distributed in the field. Wireless sensor nodes are deployed with limited energy reserves, so the networks should operate with minimum energy overhead. In fact, the network should take into account not only individual node's energy efficiency but also consider the global picture, because surviving nodes' energy reserves in a failed network are wasted energy. This thesis examines a node organisation technique to deal with the above challenges. The focus is on improving network lifetime via organising the nodes in a distributed and energy efficient manner. The main goal is lowering wasted energy via energy balancing and exploiting node redundancy in case of node failure. In particular, this thesis proposes Energy Balanced Clustering (EBC) method for node self-organisation where network tasks (such as data aggregation and data forwarding) are shifted to high-energy neighbours to reduce the energy consumption of low energy nodes. After showing how to extend network lifetime by energy balanced node organisation, the effect of redundant node deployments on network lifetime is addressed. Redundant nodes consume energy by performing unnecessary tasks so a method called Self-Calculated Redundancy Check (SCRC) is proposed to deactivate redundant nodes. A deactivated redundant node can be used as a replacement for a failed node. The Asynchronous Failed Sensor node Detection (AFSD) proposed in this thesis uses the data packets exchanged between neighbours to identify failed neighbours. To restore coverage for network holes caused by failed nodes, policies are given for re-activating redundant nodes. Detailed analytical analysis and simulation of the proposed methods demonstrate that by taking into account energy balancing, eliminating redundant tasks and replacing failed nodes sensor network lifetime can significantly be improved.
APA, Harvard, Vancouver, ISO, and other styles
2

Konietschke, Rainer Christian. "Planning of workplaces with multiple kinematically redundant robots." kostenfrei, 2008. http://mediatum2.ub.tum.de/node?id=622197.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Meidell, Arve. "Menneskelig svikt vs. systemfeil : - eller noe midt i mellom?" Thesis, Karlstad University, Faculty of Social and Life Sciences, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-5328.

Full text
Abstract:

I ulykkessammenheng går to av de vanligste undersøkelsesmetodene ut på henholdsvis å kartlegge det juridiske ansvaret for ulykken og å klarlegge årsaksforholdene. I media får vi stort sett bare høre om førstnevnte i form av oppslag om at ulykken skyldes menneskelig svikt. Årsaksforholdene tar gjerne lengre tid å kartlegge og har heller ikke elementer av helt eller syndebukk i seg, og er således mindre interessante å skrive om. I forebyggende sammenheng er det likevel gjerne her det er mest å hente. I erkjennelsen av at mennesket er og blir feilbarlig, bør man nettopp gripe tak i disse bakenforliggende årsakene, gjerne kalt latente feil, som også kan medvirke til å avverge at et tilløp får lov å utvikle seg til en ulykke. I denne oppgaven blir det gjort rede for bakenforliggende årsaker til en alvorlig samferdselsulykke på Vestlandet i 1999, nemlig hurtigbåten MS Sleipners forlis. Det blir også vist hvordan ulykken kunne vært unngått, eller i det minste at skadeomfanget kunne vært vesentlig redusert, dersom det hadde vært større fokus på å avdekke slike latente forhold. For å få offentligheten til å forstå viktigheten av slik årsakskartlegging, og ikke minst at ansvarlige instanser følger opp funnene i ettertid, er det viktig at media griper fatt i problemstillingen og setter den på dagsorden.


Two of the most common forms of investigations after accidents are the search for the judicial aspects of guilt on the one hand and the investigation to find the causes of the accident on the other hand. Media mainly tell us the result of the first one, namely that “the cause of the accident was human error”. Usually it takes more time to establish an understanding of the underlying causes. This investigation does not point out a hero, neither a scapegoat. Therefore the real causes are less interesting to the media. Still, when it comes to accident prevention, this is where one should make an effort. By recognizing the fact that humans are eligible to fail, it is here one should try to take preventive measures. By recognizing these latent conditions one may succeed to avoid potentially dangerous situations from developing to serious accidents. In this paper the underlying causes related to a serious accident that struck public transportation in Western Norway will be presented. The accident is the shipwreck of the high speed craft MS Sleipner in 1999. It will also be shown how this accident could have been prevented, or at least how the extent of the damage could have been substantially reduced, if only latent conditions had been paid a little more attention to. To make the general public understand the importance of uncovering such latent conditions, not to say make sure that they who are responsible take action to remove these conditions, it is vital that the media put these questions on the agenda.

APA, Harvard, Vancouver, ISO, and other styles
4

Cerovic, Stefan. "Cooperative wireless communications in the presence of limited feedback." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLC079/document.

Full text
Abstract:
Dans cette thèse, les techniques de coopération ont été étudiées pour un canal multi-accès multi-relais composé d'au moins deux sources qui communiquent avec une seule destination à l'aide d'au moins deux nœuds de relayage en mode semi-duplex. Le multiplexage par répartition dans le temps est supposé. Tout d'abord, l’algorithme d’adaptation de lien est exécuté par l'ordonnanceur centralisé. Durant la première phase de transmission, les sources transmettent chacune à leur tour leur message respectif pendant des intervalles de temps consécutifs. Dans chaque intervalle de temps dans la deuxième phase, la destination planifie un nœud pour transmettre les redondances, mettant en œuvre un protocole coopératif d'Hybrid Automatic Repeat reQuest (HARQ), où les canaux de contrôle limités bidirectionnels sont disponibles depuis les sources et les relais vers la destination. Dans la première partie de la thèse, les stratégies de sélection des nœuds centralisé sont proposées pour la deuxième phase de transmission. Les décisions d’ordonnancement sont prises en fonction de la connaissance des ensembles de sources correctement décodées par chaque noeud et ayant comme objectif de maximiser l’efficacité spectrale moyenne. L'analyse de la probabilité de coupure de l'information ainsi que les simulations Monte-Carlo (MC) sont effectués afin de valider ces stratégies. Dans la seconde partie, un algorithme d’adaptation de lien lent est proposé afin de maximiser l’efficacité spectrale moyenne sous contrainte de vérification d'une qualité de service individuelle cible pour une famille donnée de schémas de modulation et de codage, réposant sur l'information sur la distribution des canaux signalée. Les débits des sources discrets sont déterminés en utilisant l’approche "Genie-Aided" suivie d’un algorithme itératif de correction de débit. Les simulations MC montrent que l’algorithme d’adaptation de lien proposé offre des performances proches de celles de la recherche exhaustive. Dans la troisième partie, les performances de protocole HARQ à redondance incrémentale (IR) avec codage mono et multi-utilisateur, ainsi que l'HARQ de type Chase Combining avec codage mono-utilisateur sont comparées. Les simulations MC montrent que l'IR-HARQ avec codage mono-utilisateur offre le meilleur compromis entre performance et complexité pour le scénario de petit nombre de sources. Un schéma de codage pratique est proposé et validé à l'aide de simulations MC
In this thesis, cooperation techniques have been studied for Multiple Access Multiple Relay Channel, consisted of at least two sources which communicate with a single destination with the help of at least two half-duplex relaying nodes. Time Division Multiplexing is assumed. First, the link adaptation algorithm is performed at the centralised scheduler. Sources transmit in turns in consecutive time slots during the first transmission phase. In each time slot of the second phase, the destination schedules a node to transmit redundancies, implementing a cooperative Hybrid Automatic Repeat reQuest (HARQ) protocol, where bidirectional limited control channels are available from sources and relays towards the destination. In the first part of the thesis, centralized node selection strategies are proposed for the second phase. The scheduling decisions are made based on the knowledge of the correctly decoded source sets of each node, with the goal to maximize the average spectral efficiency. An information outage analysis is conducted and Monte-Carlo (MC) simulations are performed to evaluate their performance. In the second part, a slow-link adaptation algorithm is proposed which aims at maximizing the average spectral efficiency under individual QoS targets for a given modulation and coding scheme family relying on the reported Channel Distribution Information of all channels. Discrete source rates are first determined using the "Genie-Aided" assumption, which is followed by an iterative rate correction algorithm. The resulting link adaptation algorithm yields performance close to the exhaustive search approach as demonstrated by MC simulations. In the third part, performances of Incremental Redundancy (IR) HARQ with Single and Multi User encoding, as well as the Chase Combining HARQ with Single User encoding are compared. MC simulations demonstrate that IR-HARQ with Single User encoding offers the best trade-off between performance and complexity for a small number of sources in our setting. Practical coding scheme is proposed and validated using MC simulations
APA, Harvard, Vancouver, ISO, and other styles
5

"Redundant Skewed Clocking of Pulse-Clocked Latches for Low Power Soft-Error Mitigation." Master's thesis, 2015. http://hdl.handle.net/2286/R.I.36471.

Full text
Abstract:
abstract: An integrated methodology combining redundant clock tree synthesis and pulse clocked latches mitigates both single event upsets (SEU) and single event transients (SET) with reduced power consumption. This methodology helps to change the hardness of the design on the fly. This approach, with minimal additional overhead circuitry, has the ability to work in three different modes of operation depending on the speed, hardness and power consumption required by design. This was designed on 90nm low-standby power (LSP) process and utilized commercial CAD tools for testing. Spatial separation of critical nodes in the physical design of this approach mitigates multi-node charge collection (MNCC) upsets. An advanced encryption system implemented with the proposed design, compared to a previous design with non-redundant clock trees and local delay generation. The proposed approach reduces energy per operation up to 18% over an improved version of the prior approach, with negligible area impact. It can save up to 2/3rd of the power consumption and reach maximum possible frequency, when used in non-redundant mode of operation.
Dissertation/Thesis
Masters Thesis Electrical Engineering 2015
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, San-Hao, and 陳叁豪. "A Cluster-based Algorithm for Redundant Nodes Discovery in Dense Sensor Networks." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/05980917020589867995.

Full text
Abstract:
碩士
國立臺灣科技大學
電子工程系
93
A major challenge in constructing dense sensor networks is to prolong network lifetime as well as to keep low sensing coverage loss ratio. To prolong network lifetime, it is necessary to turn off redundant nodes to save energy. Moreover, to obtain low sensing coverage loss ratio is an important issue in dense sensor networks. Many off-duty eligibility rules that sensor nodes have expensive GPS (Global Positioning System) and directional antennas support have been proposed to determine redundant nodes. However, the system has high cost in deployment. In addition, some literature presented to sacrifice the sensing area to retrieve better network lifetime. However, this may not acquire completed and important information. Hence, how to reduce sensing coverage loss ratio and cost in deployment becomes an important and critical issue. We propose a cluster-based algorithm that can present a flexible, adjustable and energy-efficient scheme to identify redundant nodes for different requirements of network lifetime and low sensing coverage loss ratio. This algorithm needs without additional GPS and directional antennas support to identify redundant nodes. Our simulation results show that the cluster-based algorithm could save energy consumption under the process of determining redundant nodes for prolonging network lifetime, and achieve low sensing coverage loss ratio.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Node Redundancy"

1

Bianconi, Ginestra. Interdependent Multilayer Networks. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198753919.003.0011.

Full text
Abstract:
This chapter characterizes interdependent multilayer networks and their increased fragility. Interdependent networks are stylized models that can represent different complex systems, ranging from global infrastructures to molecular networks in the cell. When a fraction of nodes is initially damaged, interdependent networks are affected by dramatic cascades of failures that suddenly dismantle the multilayer network. The theory beyond this phenomenology is discussed in a pedagogical way by characterizing the percolation, discontinuous and hybrid transitions. The interplay between structure and function is studied in this context by considering multiplex networks without and with link overlap, and the effect of built-in correlations in the multilayer network structure. Finally, partial interdependencies and redundant interdependencies are discussed as major strategies to reduce the fragility of interdependent networks.
APA, Harvard, Vancouver, ISO, and other styles
2

Archard, David. Family and Family Law. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198786429.003.0003.

Full text
Abstract:
Much contemporary writing on ‘family’ and ’family law’ cites extensive changes to the family as evidence that the very concept of the ‘family’ is redundant, or that the family has disappeared. Conceptual questions (What counts as a family?) should be distinguished from normative ones (Is the family a good thing? Are some families better than others?). The use of the term ‘the family’ can be normatively innocent such that there are different family forms none of which should be privileged. Having distinguished ‘the family’ as an extra-legal concept and as a legal construct, I defend a functional definition of the family. This value-free definition can serve as the basis of evaluative judgments about the family. There are good reasons why law might recognize the family, consistent with law also recognizing non-familial personal relations. Nevertheless we need not accord familial status to such relations, or abandon the term ‘family’.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Node Redundancy"

1

Oh, Sang-Hoon. "Hidden Node Pruning of Multilayer Perceptrons Based on Redundancy Reduction." In Convergence and Hybrid Information Technology, 245–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24082-9_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Xu, Ying, and ZengRi Zeng. "A Low Redundancy and High Coverage Node Scheduling Algorithm for Wireless Sensor Networks." In Communications in Computer and Information Science, 42–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-46981-1_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Stój, Jacek. "State Machine of a Redundant Computing Unit Operating as a Cyber-Physical System Control Node with Hot-Standby Redundancy." In Advances in Intelligent Systems and Computing, 74–85. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-30604-5_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bohec, Olivier Le, and Eric Jamet. "Levels of Verbal Redundancy, Note-Taking and Multimedia Learning." In Understanding Multimedia Documents, 79–101. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-73337-1_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gewali, Laxmi, and Umang Amatya. "Identification of Redundant Node-Clusters for Improved Face Routing." In Progress in Systems Engineering, 443–47. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-08422-0_65.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Huang, Shouzhi, and Xuezeng Zhao. "Redundant Nodes Elimination in Wireless Sensor Networks." In Communications in Computer and Information Science, 48–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-53932-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Schadeberg, Thilo C. "A Note on Segment Inventories, Redundancy Conditions and A-Rules." In The Phonological Representation of Suprasegmentals, edited by Koen Bogers, Harry van der Hulst, and Marten Mous, 307–16. Berlin, Boston: De Gruyter, 1986. http://dx.doi.org/10.1515/9783110866292-016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Noh, Wonjong, Yunkuk Kim, and Sunshin An. "Node Synchronization Based Redundant Routing for Mobile Ad-Hoc Networks." In Wireless On-Demand Network Systems, 365–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24614-5_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Brand, Sebastian. "A Note on Redundant Rules in Rule-Based Constraint Programming." In Lecture Notes in Computer Science, 109–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-36607-5_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Noh, Wonjong, Kyungsoo Lim, Jihoon Lee, and Sunshin An. "Time-Synchronized Neighbor Nodes Based Redundant Robust Routing (TSN2R3) for Mobile Sensor Networks." In Lecture Notes in Computer Science, 250–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24606-0_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Node Redundancy"

1

Gulrajani, Kabir, and Michael S. Hsiao. "Multi-node static logic implications for redundancy identification." In the conference. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/343647.344102.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rezaei, Arash, and Frank Mueller. "DINO: Divergent Node Cloning for Sustained Redundancy in HPC." In 2015 IEEE International Conference on Cluster Computing (CLUSTER). IEEE, 2015. http://dx.doi.org/10.1109/cluster.2015.36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zebbane, Bahia, Manel Chenait, and Nadjib Badache. "Exploiting node redundancy for maximizing wireless sensor network lifetime." In 2013 IFIP Wireless Days (WD). IEEE, 2013. http://dx.doi.org/10.1109/wd.2013.6686446.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kimsas, A., S. Bjornstad, H. Overby, and N. Stol. "Protection Using Redundancy in a Hybrid Circuit/Packet Node Design." In 2006 32nd European Conference on Optical Communications - (ECOC 2006). IEEE, 2006. http://dx.doi.org/10.1109/ecoc.2006.4801336.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hussain, Zaeem, Taieb Znati, and Rami Melhem. "Partial Redundancy in HPC Systems with Non-Uniform Node Reliabilities." In SC18: International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, 2018. http://dx.doi.org/10.1109/sc.2018.00047.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fei, Xin, Azzedine Boukerche, and Jing Feng. "Low Information Redundancy Based Node Partition Protocols for Wireless Sensor Networks." In IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference. IEEE, 2008. http://dx.doi.org/10.1109/glocom.2008.ecp.1046.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Selvaradjou, Ka, M. Dhanaraj, B. Goutham, and C. Siva Ram Murthy. "A new battery and redundancy aware node scheduling protocol for Wireless Sensor Networks." In Middleware and Workshops (COMSWARE '08). IEEE, 2008. http://dx.doi.org/10.1109/comswa.2008.4554518.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Raymond, R., B. Linston Joe Savio, R. M. Gomathi, and K. Priya. "A survey on data redundancy and node charge preserved underwater acoustic sensor network." In 2017 International Conference on Communication and Signal Processing (ICCSP). IEEE, 2017. http://dx.doi.org/10.1109/iccsp.2017.8286591.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Yang, Hong, Shirui Pan, Ling Chen, Chuan Zhou, and Peng Zhang. "Low-Bit Quantization for Attributed Network Representation Learning." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/562.

Full text
Abstract:
Attributed network embedding plays an important role in transferring network data into compact vectors for effective network analysis. Existing attributed network embedding models are designed either in continuous Euclidean spaces which introduce data redundancy or in binary coding spaces which incur significant loss of representation accuracy. To this end, we present a new Low-Bit Quantization for Attributed Network Representation Learning model (LQANR for short) that can learn compact node representations with low bitwidth values while preserving high representation accuracy. Specifically, we formulate a new representation learning function based on matrix factorization that can jointly learn the low-bit node representations and the layer aggregation weights under the low-bit quantization constraint. Because the new learning function falls into the category of mixed integer optimization, we propose an efficient mixed-integer based alternating direction method of multipliers (ADMM) algorithm as the solution. Experiments on real-world node classification and link prediction tasks validate the promising results of the proposed LQANR model.
APA, Harvard, Vancouver, ISO, and other styles
10

Derasevic, Sinisa, Manuel Barranco, and Julian Proenza. "Designing fault-diagnosis and reintegration to prevent node redundancy attrition in highly reliable control systems based on FTT-Ethernet." In 2016 IEEE World Conference on Factory Communication Systems (WFCS). IEEE, 2016. http://dx.doi.org/10.1109/wfcs.2016.7496526.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Node Redundancy' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography