Journal articles on the topic 'Node Redundancy'
To see the other types of publications on this topic, follow the link: Node Redundancy.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research 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.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
11
NAYAK, AMIYA, and NICOLA SANTORO. "ON RELIABILITY ANALYSIS OF CHORDAL RINGS." Journal of Circuits, Systems and Computers 05, no. 02 (June 1995): 199–213. http://dx.doi.org/10.1142/s0218126695000151.
Full textAbstract:
A common technique to improve the reliability of loop (or ring) networks is by introducing link redundancy; that is, by providing several alternative paths for communication between pairs of nodes. With alternate paths between nodes, the network can now sustain several node and link failures by bypassing the faulty components. However, faults occurring at strategic locations in a ring can prevent the computation by disrupting I/O operations, blocking the flow of information, or even segmenting the structure into pieces which can no longer be suitable for any practical purpose. An extensive characterization of fault-tolerance in ring topologies is given in this paper. This characterization augments the results known in the literature to date. The characterization has revealed several properties which describe the problem of constructing subrings and linear arrays in the presence of node failures in the original ring for a specified link configuration. Also in this paper, bounds are established on the degree of fault tolerance achievable in a redundant loop network, with a given degree of redundancy, when performing a computation that requires a minimal number of operational nodes. Also the bounds on the size of the problems guaranteed to be solved in the presence of a given number of faults in the network are derived.
12
Zhu, Li, Chunxiao Fan, Huarui Wu, and Zhigang Wen. "A Coverage Algorithm based on Key Node Scheduling." International Journal of Online Engineering (iJOE) 11, no. 9 (October 29, 2015): 67. http://dx.doi.org/10.3991/ijoe.v11i9.5068.
Full textAbstract:
Network coverage rate is a key standard of measuring the quality of network coverage. This thesis aims at solving the differences between node energy and task, which causes coverage holes and blind spots of Wireless Sensor Network, and proposes a coverage algorithm, based on key node scheduling, divides node subsets, and adjusts the states of individual nodes according to node energy and coverage rate. This algorithm ensures network connectivity while reducing coverage holes and redundancy. Simulation results show that, the proposed algorithm can effectively reduce failure nodes, energy consumption, improve network coverage rate, and demonstrates network convergence and stability.
13
Zou, Yi, and Krishnendu Chakrabarty. "Redundancy Analysis and a Distributed Self-Organization Protocol for Fault-Tolerant Wireless Sensor Networks." International Journal of Distributed Sensor Networks 3, no. 3 (July 2007): 243–72. http://dx.doi.org/10.1080/15501320600781078.
Full textAbstract:
Sensor nodes in a distributed sensor network can fail due to a variety of reasons, e.g., harsh environmental conditions, sabotage, battery failure, and component wear-out. Since many wireless sensor networks are intended to operate in an unattended manner after deployment, failing nodes cannot be replaced or repaired during field operation. Therefore, by designing the network to be fault-tolerant, we can ensure that a wireless sensor network can perform its surveillance and tracking tasks even when some nodes in the network fail. In this paper, we describe a fault-tolerant self-organization scheme that designates a set of backup nodes to replace failed nodes and maintain a backbone for coverage and communication. The proposed scheme does not require a centralized server for monitoring node failures and for designating backup nodes to replace failed nodes. It operates in a fully distributed manner and it requires only localized communication. This scheme has been implemented on top of an energy-efficient self-organization technique for sensor networks. The proposed fault-tolerance-node selection procedure can tolerate a large number of node failures using only localized communication, without losing either sensing coverage or communication connectivity.
14
G. Murugan, Dr. "Improve secure based multi-path routing to mitigate the intrusion endurance in heterogeneous wireless sensor networks." International Journal of Engineering & Technology 7, no. 4 (September 26, 2018): 2746. http://dx.doi.org/10.14419/ijet.v7i4.17957.
Full textAbstract:
Wireless Sensor Networks (WSNs) have many potential applications. Multi-path routing is widely used in WSN to achieve reliability and perform Fault Tolerance. Multi-path routing determines and assigns multiple routes from a given sensor node to the sink. The transmission of data among the multi-path brings path redundancy, which increases the reliability and reduces the network congestion. In this research work, a dynamic redundancy management algorithm is proposed. To exploit multi-path routing in order to process the user request with existence of defective and malicious nodes. The objective of this work is to analyze the trade-off between energy consumption and Quality of Service (QoS) gain in security and reliability in order to increase the lifetime. The optimized redundancy level of multipath routing is determined dynamically which is used to improve the query response while extending the network lifetime and also for detecting intrusions and send alert to the system through Intrusion Detection System (IDS). Then, a voting-based distributed Intrusion Detection (ID) algorithm is proposed to detect and remove malicious nodes in a sensor network. The malicious node has been determined through number of voters using voting-based distributed ID algorithm. The efficient redundancy management of a clustered Heterogeneous Wireless Sensor Network (HWSN) is to increase the network lifetime in the presence of unreliable and malicious nodes. Therefore, the reliability improved dramatically.
15
Ling, Yang, Cai Xucan, and Wu Chunlin. "An Optimal Method to Design Wireless Sensor Network Structures." International Journal of Online Engineering (iJOE) 14, no. 01 (January 25, 2018): 40. http://dx.doi.org/10.3991/ijoe.v14i01.8062.
Full textAbstract:
In order to optimize the structure of wireless sensor network, an improved wireless sensor network sleep mechanism is proposed. First, some nodes in the area with too high redundancy are dormant by density control, so that the active nodes are even more distributed. Then, the active node is subjected to circular coverage redundancy decision. Different circumferential coverage decision methods are used for network boundary nodes and non-boundary nodes. As a result, the boundary nodes and non-boundary nodes are well dormant, and the network redundancy is reduced. The simulation results show that the improved dormancy mechanism makes the number of active nodes in the network smaller and more evenly, and the network lifetime is extended on the basis of maintaining the original coverage of the network. Therefore, the proposed method can achieve optimal coverage in wireless sensor networks. The network prolongs network lifetime while ensuring reliable monitoring performance.
16
Gao, Yuan, Husheng Liao, and Hongyu Gao. "Twig Pattern Minimization Based on XML Schema Constraints." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 15, no. 3 (January 19, 2016): 6608–12. http://dx.doi.org/10.24297/ijct.v15i3.1683.
Full textAbstract:
Twig pattern is one of the core components of XQuery. Twig usually includes redundancy nodes which can be optimized. Schema feature is used to judge whether the node of Twig pattern is redundancy. In this paper, we propose sufficient Schema constraints and specific rules. In this paper, we have designed more determination conditions to optimize, then we will get the most efficient results. By a large number of test case, we finally get the practical limits of minimization.
17
Wang, Jun Ping, Pan Ning, Ruo Yu Pang, and Jian Ping Fang. "COE Based on Redundancy Material Defect." Advanced Materials Research 472-475 (February 2012): 1792–95. http://dx.doi.org/10.4028/www.scientific.net/amr.472-475.1792.
Full textAbstract:
In the nanometer technology node, the contradiction between high investment and low yield has got more and more prominent, so it plays a very significant role in improving the yield to optimize layout. The COE, Critical area On Edge network, which is a kind of network based on the redundancy material defect with edges expressing critical areas, is constructed in this paper. Vertexes stand for nets of the layout, and edges do short circuit areas existing in nets. By studying the applications of COE in DFM, it is indicated that the COE provides a new way to the research of nanometer node in DFM.
18
Liu, Songhua, Caiying Ding, Yao Ma, Zepeng Li, and Jie Xiang. "Redundancy reduction based node classification with attribute augmentation." Knowledge-Based Systems 188 (January 2020): 105080. http://dx.doi.org/10.1016/j.knosys.2019.105080.
Full text
19
DE VICO FALLANI, FABRIZIO, JLENIA TOPPI, CLAUDIA DI LANZO, GIOVANNI VECCHIATO, LAURA ASTOLFI, GIANLUCA BORGHINI, DONATELLA MATTIA, FEBO CINCOTTI, and FABIO BABILONI. "REDUNDANCY IN FUNCTIONAL BRAIN CONNECTIVITY FROM EEG RECORDINGS." International Journal of Bifurcation and Chaos 22, no. 07 (July 2012): 1250158. http://dx.doi.org/10.1142/s0218127412501581.
Full textAbstract:
The concept of redundancy is a critical resource of the brain enhancing the resilience to neural damages and dysfunctions. In the present work, we propose a graph-based methodology to investigate the connectivity redundancy in brain networks. By taking into account all the possible paths between pairs of nodes, we considered three complementary indexes, characterizing the network redundancy (i) at the global level, i.e. the scalar redundancy (ii) across different path lengths, i.e. the vectorial redundancy (iii) between node pairs, i.e. the matricial redundancy. We used this procedure to investigate the functional connectivity estimated from a dataset of high-density EEG signals in a group of healthy subjects during a no-task resting state. The statistical comparison with a benchmark dataset of random networks, having the same number of nodes and links of the EEG nets, revealed a significant (p < 0.05) difference for all the three indexes. In particular, the redundancy in the EEG networks, for each frequency band, appears radically higher than random graphs, thus revealing a natural tendency of the brain to present multiple parallel interactions between different specialized areas. Notably, the matricial redundancy showed a high (p < 0.05) redundancy between the scalp sensors over the parieto-occipital areas in the Alpha range of EEG oscillations (7.5–12.5 Hz), which is known to be the most responsive channel during resting state conditions.
20
Song, Liu, He, and Jiang. "Research on Data Fusion Scheme for Wireless Sensor Networks with Combined Improved LEACH and Compressed Sensing." Sensors 19, no. 21 (October 29, 2019): 4704. http://dx.doi.org/10.3390/s19214704.
Full textAbstract:
There are a lot of redundant data in wireless sensor networks (WSNs). If these redundant data are processed and transmitted, the node energy consumption will be too fast and will affect the overall lifetime of the network. Data fusion technology compresses the sampled data to eliminate redundancy, which can effectively reduce the amount of data sent by the node and prolong the lifetime of the network. Due to the dynamic nature of WSNs, traditional data fusion techniques still have many problems. Compressed sensing (CS) theory has introduced new ideas to solve these problems for WSNs. Therefore, in this study we analyze the data fusion scheme and propose an algorithm that combines improved clustered (ICL) algorithm low energy adaptive clustering hierarchy (LEACH) and CS (ICL-LEACH-CS). First, we consider the factors of residual energy, distance, and compression ratio and use the improved clustered LEACH algorithm (ICL-LEACH) to elect the cluster head (CH) nodes. Second, the CH uses a Gaussian random observation matrix to perform linear compressed projection (LCP) on the cluster common (CM) node signal and compresses the N-dimensional signal into M-dimensional information. Then, the CH node compresses the data by using a CS algorithm to obtain a measured value and sends the measured value to the sink node. Finally, the sink node reconstructs the signal using a convex optimization method and uses a least squares algorithm to fuse the signal. The signal reconstruction optimization problem is modeled as an equivalent l1-norm problem. The simulation results show that, compared with other data fusion algorithms, the ICL-LEACH-CS algorithm effectively reduces the node’s transmission while balancing the load between the nodes.
21
Wang, Tingting, Yanjing Sun, Zhao Xu, Wenyan Zhai, and Ran Zhuo. "Node Placement for Long Bounded Belt Complete 2-Coverage in Wireless Sensor Networks." Mathematical Problems in Engineering 2015 (2015): 1–13. http://dx.doi.org/10.1155/2015/672768.
Full textAbstract:
Based on Isosceles Triangle (Iso-Tri) placement and the extended Equalization Strip theory, we propose an Isosceles Trapezoid complete 2-coverage (Iso-TraC2) placement method for completely covering a long bounded belt area, which requires that any point within the belt is covered by at least two nodes. Coverage density and coverage efficiency are calculated to evaluate the degree of complete coverage, which can reflect the number of nodes needed and the degree of redundancy, respectively. The extreme ratio of sensing radius to belt width is deduced when the coverage density reaches the minimal value. Results demonstrate that when a belt with widthwis given, the node sensing radiusrhad better satisfiedw<r<2wto guarantee a higher coverage efficiency and lower coverage density for bounded belt compete coverage. Mathematical analysis shows that the proposed method performs better than the existing ones with smaller nodes number and less coverage redundancy.
22
Manman, Zhang, Zhang Wu, Miao Benben, Feng Jinlei, Rao Yuan, and Jin Xiu. "Optimized Layout of Tea Plantation Sensors Based on Improved Ant Colony Optimization." Applied Engineering in Agriculture 37, no. 3 (2021): 547–54. http://dx.doi.org/10.13031/aea.13871.
Full textAbstract:
HighlightsIn this article, an improved ant colony algorithm is proposed for optimizing the sensor placement path.The experimental data derived from field measurements.The method in this article reduces the number of sensors and the investment cost.The test results show that data redundancy, data transmission distance, and network energy consumption are reduced.Abstract. In the optimized layout of tea plantation sensors, the number and location of sensors, energy consumption of sensors, and data redundancy are all important factors that affect the layout. To reduce data redundancy, network energy loss, and the cost of sensors, an improved ant colony is proposed. The algorithm optimizes the sensor layout of the tea plantation. Introduce data redundancy and network energy consumption models into the heuristic function to guide the ants to choose the path with less data redundancy and less energy loss; add the path trend guide G to the probability transfer formula to guide the ants from the source node to the sink node Search the path, reduce the path length and the number of sensors. A tea plantation in the National High-tech Agricultural Park of Anhui Agricultural University was selected as the test area, and 25 sensor nodes were randomly arranged to collect soil moisture data for the experiment. The improved ant colony algorithm optimized the path data with less redundancy, less network energy consumption and short distance. Only 6 sensors are needed, reducing the sensor from the initial 25 to 6, which reduces the cost. In order to eliminate the accidental problem of the research results, the soil moisture data collected on 29 August 2019 was selected for the verification test, and the test results were good. Keywords: Data redundancy, Energy consumption, Improved ant colony algorithm, Soil moisture, Tea plantation.
23
Wang, Jian Jun, Zhi Feng Liu, and Ji Kai Ma. "The Study of the Managing Node Redundancy of Real-Time Industrial Ethernet POWERLINK." Applied Mechanics and Materials 336-338 (July 2013): 2388–91. http://dx.doi.org/10.4028/www.scientific.net/amm.336-338.2388.
Full textAbstract:
This paper analyses the master station redundancy technology in the POWERLINK network. Through the monitoring network and data refresh to achieve the master station redundancy function. The Managing Node redundancy ensures the POWERLINK cycle production continuance after the failure of the current master station, the switch-over time (recovery time) of the POWERLINK system is in the two POWERLINK cycle time at least. That ensures a very fast restoring of normal operation without any downtime for the control system.
24
Kim, Dae-Ub, Byung Chul Kim, and Jae Young Lee. "Dual Process Linear Protection Switching Method Supporting Node Redundancy." Journal of the Institute of Electronics and Information Engineers 53, no. 9 (September 25, 2016): 26–37. http://dx.doi.org/10.5573/ieie.2016.53.9.026.
Full text
25
Rezaei, Arash, Frank Mueller, Paul Hargrove, and Eric Roman. "DINO: Divergent node cloning for sustained redundancy in HPC." Journal of Parallel and Distributed Computing 109 (November 2017): 350–62. http://dx.doi.org/10.1016/j.jpdc.2017.06.010.
Full text
26
Wang, Hui, Youming Li, Tingcheng Chang, and Shengming Chang. "An Effective Scheduling Algorithm for Coverage Control in Underwater Acoustic Sensor Network." Sensors 18, no. 8 (August 1, 2018): 2512. http://dx.doi.org/10.3390/s18082512.
Full textAbstract:
Coverage maintenance is a bottleneck restricting the development of underwater acoustic sensor networks (UASNs). Since the energy of the nodes is limited, the coverage of UASNs may gradually decrease as the network operates. Thus, energy-saving coverage control is crucial for UASNs. To solve the above problems, this paper proposes a coverage-control strategy (referred to as ESACC) that establishes a sleep–wake scheduling mechanism based on the redundancy of deployment nodes. The strategy has two main parts: (1) Node sleep scheduling based on a memetic algorithm. To ensure network monitoring performance, only some nodes are scheduled to work, with redundant nodes in a low-power hibernation state, reducing energy consumption and prolonging the network lifetime. The goal of node scheduling is to find a minimum set of nodes that can cover the monitoring area, and a memetic algorithm can solve this problem. (2) Wake-up scheme. During network operation, sleeping nodes are woken to cover the dead nodes and maintain high coverage. This scheme not only reduces the network energy consumption but takes into account the monitoring coverage of the network. The experimental data show that ESACC performs better than current algorithms, and can improve the network life cycle while ensuring high coverage.
27
Zhang, Quanwei, Dazhong Li, Yue Fei, Jiakang Zhang, Yu Chen, and Fei Tong. "RDCPF: A Redundancy-Based Duty-Cycling Pipelined-Forwarding MAC for Linear Sensor Networks." Sensors 20, no. 19 (September 30, 2020): 5608. http://dx.doi.org/10.3390/s20195608.
Full textAbstract:
Existing duty-cycling and pipelined-forwarding (DCPF) protocols applied in battery-powered wireless sensor networks can significantly alleviate the sleep latency issue and save the energy of networks. However, when a DCPF protocol applies to a linear sensor network (LSN), it lacks the ability to handle the bottleneck issue called the energy-hole problem, which is mainly manifested due to the excessive energy consumption of nodes near the sink node. Without overcoming this issue, the lifespan of the network could be greatly reduced. To that end, this paper proposes a method of deploying redundant nodes in LSN, and a corresponding enhanced DCPF protocol called redundancy-based DCPF (RDCPF) to support the new topology of LSN. In RDCPF, the distribution of energy consumption of the whole network becomes much more even. RDCPF also brings improvements to the network in terms of network survival time, packet delivery latency, and energy efficiency, which have been shown through the extensive simulations in comparison with existing DCPF protocols.
28
SUN, ZHONGYAO, and RÉKA ALBERT. "Node-independent elementary signaling modes: A measure of redundancy in Boolean signaling transduction networks." Network Science 4, no. 3 (April 21, 2016): 273–92. http://dx.doi.org/10.1017/nws.2016.4.
Full textAbstract:
AbstractThe redundancy of a system denotes the amount of duplicate components or mechanisms in it. For a network, especially one in which mass or information is being transferred from an origin to a destination, redundancy is related to the robustness of the system. Existing network measures of redundancy rely on local connectivity (e.g. clustering coefficients) or the existence of multiple paths. As in many systems there are functional dependencies between components and paths, a measure that not only characterizes the topology of a network, but also takes into account these functional dependencies, becomes most desirable.We propose a network redundancy measure in a prototypical model that contains functionally dependent directed paths: a Boolean model of a signal transduction network. The functional dependencies are made explicit by using an expanded network and the concept of elementary signaling modes (ESMs). We define the redundancy of a Boolean signal transduction network as the maximum number of node-independent ESMs and develop a methodology for identifying all maximal node-independent ESM combinations. We apply our measure to a number of signal transduction network models and show that it successfully distills known properties of the systems and offers new functional insights. The concept can be easily extended to similar related forms, e.g. edge-independent ESMs.
29
Zheng, Lei, Xin Chen, and Xun Hong Lv. "Research on Internal Communication of Redundant Flight Control Computer for UAV." Advanced Materials Research 383-390 (November 2011): 1578–83. http://dx.doi.org/10.4028/www.scientific.net/amr.383-390.1578.
Full textAbstract:
Regarding the characteristic of the architecture of the sample redundant flight control computer based on CAN (control area network) bus, a bus protocol of internal communication based on time-triggered is presented. The protocol-frame, data-frame, synchronization arithmetic of internal communication are designed. According to the protocol, the communication between the CPU (central processing unit) and each other function unit can be reliable. At the same time, if some node of the network were failure, CPU can check it reliably and then carry through relevant switch logic to realize the redundancy management. The results of the experimentation show that according to the bus protocol designed in this paper, the internal communication of the FCC (flight control computer) was reliable, at the same time, the fault-detect and redundancy management can be realized.
30
Ravindra, Padmashree, and Kemafor Anyanwu. "Nesting Strategies for Enabling Nimble MapReduce Dataflows for Large RDF Data." International Journal on Semantic Web and Information Systems 10, no. 1 (January 2014): 1–26. http://dx.doi.org/10.4018/ijswis.2014010101.
Full textAbstract:
Graph and semi-structured data are usually modeled in relational processing frameworks as “thin” relations (node, edge, node) and processing such data involves a lot of join operations. Intermediate results of joins with multi-valued attributes or relationships, contain redundant subtuples due to repetition of single-valued attributes. The amount of redundant content is high for real-world multi-valued relationships in social network (millions of Twitter followers of popular celebrities) or biological (multiple references to related proteins) datasets. In MapReduce-based platforms such as Apache Hive and Pig, redundancy in intermediate results contributes avoidable costs to the overall I/O, sorting, and network transfer overhead of join-intensive workloads due to longer workflows. Consequently, providing techniques for dealing with such redundancy will enable more nimble execution of such workflows. This paper argues for the use of a nested data model for representing intermediate data concisely using nesting-aware dataflow operators that allow for lazy and partial unnesting strategies. This approach reduces the overall I/O and network footprint of a workflow by concisely representing intermediate results during most of a workflow's execution, until complete unnesting is absolutely necessary. The proposed strategies are integrated into Apache Pig and experimental evaluation over real-world and synthetic benchmark datasets confirms their superiority over relational-style MapReduce systems such as Apache Pig and Hive.
31
Ma, Chang Wei. "Coverage Optimization Mechanism Based on Weighted Genetic Algorithm and Constrained Genetic Algorithm." Applied Mechanics and Materials 416-417 (September 2013): 1574–79. http://dx.doi.org/10.4028/www.scientific.net/amm.416-417.1574.
Full textAbstract:
As a basic problem of wireless sensor in network applications, coverage reflects the quality effect of monitoring and tracking of the network. In view of the high density of sensor nodes deployment, this article works on the node set selection problem, puts forward two kinds of coverage optimization mechanisms based on weighted genetic algorithm and constrained genetic algorithm according to the genetic algorithm operation of the fitness function generation, and calculates approximately optimal working nodes required in the sensor network fully covering area. The simulation results show that the algorithm can quickly converge to the optimal solution and complete the optimization of node set selection, thereby reducing network redundancy and prolonging the survival time of the network.
32
Yao, Yu Kun, Zhi Hu Liu, Zhi Ren, and Ya Di Wen. "An Efficient Routing Algorithm for Opportunistic Networks Based on Network Coding." Advanced Materials Research 756-759 (September 2013): 2214–19. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.2214.
Full textAbstract:
To address the problems in Opportunistic Networks that nodes employing routing algorithms based on epidemic mechanism cant sense their neighboring nodes timely and many redundant data packets permeate through the network, an efficient routing algorithm based on XOR network coding was proposed (Xor Network Coding based Epidemic Routing, XNCER). When a node gets a Hello message, it broadcasts, instead of unicasting, a SV(Summary Vector) packet, in return, to all its neighboring nodes. Therefore, the data transmission can be initiated immediately, and the XOR network coding can also be leveraged so as to enhance the efficiency of data transmission. Moreover, the packets destined to the one hop neighboring nodes obtain the priority in transmission, and are determined whether to be deleted based on the ACK mechanism running in the MAC layer in order to cut down the memory overhead and restrain redundant packets from dissemination. Theoretical analysis and extensive simulation results show that the new algorithm obtains an overall improvement in terms of network overhead, average end-to-end delay as well as delivery rate. The novel algorithm can effectively solve the problems of sensing neighboring nodes and data redundancy.
33
Kanta, Priya, A. M. Prasad A.M.Prasad, and Suma V. Suma.V. "Area Coverage Redundancy and Node Positioning in Wireless Sensor Networks." International Journal of Computer Applications 111, no. 5 (February 18, 2015): 1–3. http://dx.doi.org/10.5120/19531-1173.
Full text
34
Dheenathayalan, S., and B. Paramasivan. "A comprehensive approach to avoid node selfishness and data redundancy." Journal of Intelligent & Fuzzy Systems 39, no. 1 (July 17, 2020): 407–19. http://dx.doi.org/10.3233/jifs-191409.
Full text
35
Streichert, Thilo, Christian Strengert, Dirk Koch, Christian Haubelt, and Jürgen Teich. "Communication Aware Optimization of the Task Binding in Hardware/Software Reconfigurable Networks." Journal of Integrated Circuits and Systems 2, no. 1 (September 9, 2007): 29–36. http://dx.doi.org/10.29292/jics.v2i1.233.
Full textAbstract:
In this paper, a new methodology for tolerating link as well as node defects in self-adaptive reconfigurable networks will be presented. Currently, networked embedded systems need a certain level of redundancy for each node and link in order to tolerate defects and failures in a network. Due to monetary constraints as well as space and power limitations, the replication of each node and link is not an option in most embedded systems. Therefore, we will present a hardware/software partitioning algorithm for reconfigurable networks that optimizes the task binding onto resources at runtime such that node/link defects can be handled and data traffic on links between computational nodes will be minimized. This paper presents a new hardware/software partitioning algorithm, an experimental evaluation and for demonstrating the applicability, an implementation on a network of FPGA-based boards.
36
P. H., Sharanappa, and Mahabaleshwar S. Kakkasageri. "An Efficient Information Aggregation Scheme in Internet of Things: Multi Agent based Approach." International Journal of Soft Computing and Engineering 11, no. 1 (September 30, 2021): 23–31. http://dx.doi.org/10.35940/ijsce.a3525.0911121.
Full textAbstract:
The use of wireless sensor technology in various Internet of Things (IoT) applications is growing rapidly. With the exponential increase of smart devices and their applications, collecting and analyzing data is gradually becoming one of the most difficult tasks. As sensor nodes are powered by batteries, energy efficiency is essential. To that intention, before passing the final data to the central station, a sensor node should reduce redundancies in the received data from neighbor nodes. There will be some redundancy in the data because different sensor nodes typically notice the same phenomenon. Data aggregation is one of the most important approaches for eliminating data redundancy and improving energy efficiency, as well as extending the life time of wireless sensor networks. Furthermore, the effective data aggregation technique might help to reduce network traffic. In this paper we have proposed cluster based data aggregation using intelligent agents. The performance of the proposed scheme is compared with Centralized Data Aggregation (CDA) mechanism in IoT.
37
Fedukhin, O. V. "R-effect of decomposition of duplicate systems into equiprobable functional nodes." Mathematical machines and systems 2 (2020): 117–23. http://dx.doi.org/10.34121/1028-9763-2020-2-117-123.
Full textAbstract:
The work is devoted to the reliability of non-recoverable two-channel automation systems and computer equipment. As alternative options, a system with block duplication (SBD) and a system with a quasi-bridge structure (QBS) are considered. SBD in general is a two-channel system consisting of a series connection of duplicated nodes of different reliability. In case of failure of one of the functional subunits (FSU) of the duplicated node using the control and reconfiguration (SCR) scheme, it is masked, withdrawn from the computational process, and reconfigured the system structure in the “Non Stop” operating mode. A QBS system also represents a two-channel structure, but consisting of a serial connection of duplicated nodes of equal reliability, while the technical element intensity (redundancy level) and the functionality of this system are identical to SPD. The QBS system is also a fail-safe system that provides the “Non Stop” mode of operation. The probabilistic-physical calculation method (WF-method) is used as a tool for studying the reliability of systems, which is based on the diffusion distribution of mean-time-to-failure (DN-distribution), specially formalized for assessing the reliability of electronic, electrical and electromechanical elements and systems. While maintaining the redundancy level of the considered two-channel redundant systems, decomposing the channels into equally reliable duplicated nodes leads to the R-effect – an increase in the likelihood of system uptime with an increase in the number of nodes. The presence of the R-effect was established by other methods of calculation and by statistical modeling for both non-restored and restored systems.
38
Noh, Wonjong. "Distributed and Localized Hub-Based Hierarchical Information Transmission Control in Large-Scale Wireless Cloud Networks." Applied Sciences 9, no. 24 (December 4, 2019): 5283. http://dx.doi.org/10.3390/app9245283.
Full textAbstract:
This paper proposes a virtual infrastructure-based hierarchical information transmission scheme consisting of two phases, macroscopic transmission and local transmission controls. The macroscopic transmission control builds a hub-node-based virtual infrastructure and then finds the optimal hub route that satisfies the stochastic end-to-end delay constraint. Each node determines whether it belongs to a hub node by itself in a distributed manner. The local transmission control builds a robust local path between hub nodes by using the synchronized redundancy concept; this minimizes the effects of transmission failure by reducing the control traffic overhead and time to reconfigure transmission paths without rediscovery of the transmission path from the source node. Simulations confirmed that, as the network size increased, the performance of the proposed transmission scheme increased in terms of packet delivery ratio and control packet overhead. The scheme can be applied to mobile ad hoc cloud computing systems based on self-organizing vehicular networks or drone networks as a key control.
39
Sun, Zeyu, Chuanfeng Li, Xiaofei Xing, Huihui Wang, Ben Yan, and Xuelun Li. "k-degree coverage algorithm based on optimization nodes deployment in wireless sensor networks." International Journal of Distributed Sensor Networks 13, no. 2 (February 2017): 155014771769324. http://dx.doi.org/10.1177/1550147717693242.
Full textAbstract:
In the process of the wireless sensor network research, the issue on the energy consumption and coverage is an essential and critical one. According to the characteristic of the sensor nodes, it is homogeneous, and we proposed the k-degree coverage algorithm based on optimization nodes deployment. First, the algorithm gives the solving procedure of the maximum seamless coverage ratio, when the three-node joint coverage has been provided. Second, when the sensor nodes are covering the monitoring area, the algorithm gives the solving procedure of the expected coverage quality and the judgment methods of the coverage ratio, when the nodes are compared with the nearby ones. And when there is redundancy coverage in the given monitoring area, we have given the solving procedure of any sensor nodes that exist in the redundant nodes coverage. Finally, using the simulation experiment, the results of the coverage algorithm based on optimization nodes deployment are compared with other algorithms in terms of the coverage quality and the network lifetime, the performance indexes have enhanced to 13.36% and 12.92% on average. Thus, the effectiveness and viability of the coverage algorithm based on optimization nodes deployment have been proved.
40
Machdi, Agustini Rodiah. "ANALYZING MIKROTIK BASED VRRP (VIRTUAL ROUTER REDUNDANCY PROTOCOL) IMPLEMENTATION ON HOMEGRID NETWORKS." Journal of Science Innovare 2, no. 01 (December 5, 2019): 13–18. http://dx.doi.org/10.33751/jsi.v2i01.1524.
Full textAbstract:
Virtual Router Redundancy Protocol (VRRP) was developed to eliminate internal failures a single node gateway system, causing a network link to be disconnected. VRRP is capable provide redundant routing path link access. This time the research applied technology This VRRP is on a home network or building that utilizes the electricity installation network as LAN (Local Area Network) commonly called HomeGrid, and test it by doing QoS metric measurement. The QoS values obtained are then compared to the QoS standard on TIPHON as proof that network conditions are still in normal limits. The system is tested using 3 (three) schemes to get maximum results. Condition network using this VRRP system only requires very short downtime, when viewed from packet capture monitoring takes only 3 to 4 seconds in all schemes. Thus the technological capabilities of the VRRP system have been tested and are capable provide high availability linksVirtual Router Redundancy Protocol (VRRP) was developed to eliminate internal failures a single node gateway system, causing a network link to be disconnected. VRRP is capable provide redundant routing path link access. This time the research applied technology This VRRP is on a home network or building that utilizes the electricity installation network as LAN (Local Area Network) commonly called HomeGrid, and test it by doing QoS metric measurement. The QoS values obtained are then compared to the QoS standard on TIPHON as proof that network conditions are still in normal limits. The system is tested using 3 (three) schemes to get maximum results. Condition network using this VRRP system only requires very short downtime, when viewed from packet capture monitoring takes only 3 to 4 seconds in all schemes. Thus the technological capabilities of the VRRP system have been tested and are capable provide high availability linksJournal of Science Innovare is licensed under Keywords: VRRP;Mikrotik;Router;JPerf;QoS;jitter
41
Yong, Jin, Zhou Lin, Wei Qian, Bai Ke, Wang Chen, and Li Ji-fang. "Tree-Based Multihop Routing Method for Energy Efficiency of Wireless Sensor Networks." Journal of Sensors 2021 (April 28, 2021): 1–14. http://dx.doi.org/10.1155/2021/6671978.
Full textAbstract:
In wireless sensor networks (WSNs), due to the limited energy of sensor nodes, how to design efficient hierarchical routing algorithms to balance network resources and extend network life is an important problem to be solved. Aiming at the problems such as random selection of cluster head, redundancy of working node, and construction of cluster head transmission path, which affect network energy consumption, this paper proposes a multihop routing algorithm based on path tree (MHRA-PT) to optimize the network energy. Firstly, some nodes are those close to the base station and have large remaining energy which are selected to construct a cluster head set. Then, after clustering, each cluster is divided into different regions, and in each region, nodes with residual energy greater than the average residual energy of the cluster are selected as a working node. Finally, the cluster heads are sorted according to their distance from base station, and the next hop node is selected for each cluster head in turn until a path tree rooted at base station is formed completely, leading to data transmission from working node to base station. Simulation results show that the proposed algorithm can effectively reduce network energy consumption, balance network resources, and prolong network life cycle.
42
Modekurthy, Venkata P., Abusayeed Saifullah, and Sanjay Madria. "A Distributed Real-time Scheduling System for Industrial Wireless Networks." ACM Transactions on Embedded Computing Systems 20, no. 5 (July 2021): 1–28. http://dx.doi.org/10.1145/3464429.
Full textAbstract:
The concept of Industry 4.0 introduces the unification of industrial Internet-of-Things (IoT), cyber physical systems, and data-driven business modeling to improve production efficiency of the factories. To ensure high production efficiency, Industry 4.0 requires industrial IoT to be adaptable, scalable, real-time, and reliable. Recent successful industrial wireless standards such as WirelessHART appeared as a feasible approach for such industrial IoT. For reliable and real-time communication in highly unreliable environments, they adopt a high degree of redundancy. While a high degree of redundancy is crucial to real-time control, it causes a huge waste of energy, bandwidth, and time under a centralized approach and are therefore less suitable for scalability and handling network dynamics. To address these challenges, we propose DistributedHART—a distributed real-time scheduling system for WirelessHART networks. The essence of our approach is to adopt local (node-level) scheduling through a time window allocation among the nodes that allows each node to schedule its transmissions using a real-time scheduling policy locally and online. DistributedHART obviates the need of creating and disseminating a central global schedule in our approach, thereby significantly reducing resource usage and enhancing the scalability. To our knowledge, it is the first distributed real-time multi-channel scheduler for WirelessHART. We have implemented DistributedHART and experimented on a 130-node testbed. Our testbed experiments as well as simulations show at least 85% less energy consumption in DistributedHART compared to existing centralized approach while ensuring similar schedulability.
43
Martínez, D. A., E. Mojica-Nava, K. Watson, and T. Usländer. "MULTI-AGENT LEARNING FRAMEWORK FOR ENVIRONMENT REDUNDANCY IDENTIFICATION FOR MOBILE SENSORS IN AN IOT CONTEXT." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-4/W11 (September 20, 2018): 33–41. http://dx.doi.org/10.5194/isprs-archives-xlii-4-w11-33-2018.
Full textAbstract:
<p><strong>Abstract.</strong> From an IoT point of view, the continuous growth of cheap and versatile sensor technologies has generated a massive data flow in communication networks, which most of the time carries unnecessary or redundant information that requires larger storage centers and more time to process and analyze data. Most of this redundancy is due to fact that network nodes are unable to identify environmental cues showing measurement changes to be considered and instead remain at a static location getting the same data. In this work we propose a multi-agent learning framework based on two theoretical tools. Firstly, we use Gaussian Process Regression (GPR) to make each node capable of getting information from the environment based on its current measurement and the measurements taken by its neighbors. Secondly, we use the rate distortion function to define a boundary where the information coming from the environment is neither redundant nor misunderstood. Finally, we show how the framework is applied in a mobile sensor network in which sensors decide to be more or less exploratory by means of the parameter s of the Blahut-Arimoto algorithm, and how it affects the measurement coverage in a spatial area being sensed.</p>
44
Di Lanzo, Claudia, Laura Marzetti, Filippo Zappasodi, Fabrizio De Vico Fallani, and Vittorio Pizzella. "Redundancy as a Graph-Based Index of Frequency Specific MEG Functional Connectivity." Computational and Mathematical Methods in Medicine 2012 (2012): 1–9. http://dx.doi.org/10.1155/2012/207305.
Full textAbstract:
We used a recently proposed graph index to investigate connectivity redundancy in resting state MEG recordings. Usually, brain network analyses consider indexes linked to the shortest paths between cerebral regions. However, important information might be lost about alternative trails by neglecting longer pathways. We measured the redundancy of the connectivity by considering the multiple paths at the global level (i.e., scalar redundancy), across different path lengths (i.e., vector redundancy), and between node pairs (i.e., matrix redundancy). We applied this approach to a robust frequency domain functional connectivity measure, the corrected imaginary part of coherence. The redundancy in the MEG networks, for each frequency band, was significantly (P<0.05) higher than in the random graphs, thus, confirming a natural tendency of the brain to present multiple interaction pathways between different specialized areas. Notably, this difference was more evident and localized among the channels covering the parietooccipital areas in the alpha range of MEG oscillations (7.5–13 Hz), as expected in the resting state conditions. Interestingly enough, the results obtained with the redundancy indexes were poorly correlated with those obtained using shortest paths only, and more sensitive with respect to those obtained by considering walk-based indexes.
45
Gu, Musong, Chaobang Gao, Jingjing Lyu, Wenjie Fan, and Lei You. "Study of Node Distribution and Density Optimization in Mobile Sensor Network 3D Space." Wireless Communications and Mobile Computing 2021 (August 19, 2021): 1–7. http://dx.doi.org/10.1155/2021/6978812.
Full textAbstract:
Mobile sensor network is applied in information collection in emergencies. As the mobile sensor network in real environment is widely deployed with different height and the redundancy of the sensor node needs to be as low as possible, therefore, it is necessary to effectively deploy mobile sensor nodes in the 3D space to have reasonable layout and optimized density. To this end, we established the optimization model of mobile sensor network deployment and solved the model with chemical reaction optimization (CRO). The experimental results have shown that compared with traditional particle swarm optimization (PSO), CRO algorithm can achieve reasonable deployment more rapidly and enhance the network performance evaluation value effectively. The reasonable deployment of mobile sensor network node is very significant to information collecting, postperiod decision-making, and rapid rescuing work in emergencies.
46
Peng, Song, and Yonghua Xiong. "An Area Coverage and Energy Consumption Optimization Approach Based on Improved Adaptive Particle Swarm Optimization for Directional Sensor Networks." Sensors 19, no. 5 (March 8, 2019): 1192. http://dx.doi.org/10.3390/s19051192.
Full textAbstract:
Coverage is a vital indicator which reflects the performance of directional sensor networks (DSNs). The random deployment of directional sensor nodes will lead to many covergae blind areas and overlapping areas. Besides, the premature death of nodes will also directly affect the service quality of network due to limited energy. To address these problems, this paper proposes a new area coverage and energy consumption optimization approach based on improved adaptive particle swarm optimization (IAPSO). For area coverage problem, we set up a multi-objective optimization model in order to improve coverage ratio and reduce redundancy ratio by sensing direction rotation. For energy consumption optimization, we make energy consumption evenly distribute on each sensor node by clustering network. We set up a cluster head selection optimization model which considers the total residual energy ratio and energy consumption balance degree of cluster head candidates. We also propose a cluster formation algorithm in which member nodes choose their cluster heads by weight function. We next utilize an IAPSO to solve two optimization models to achieve high coverage ratio, low redundancy ratio and energy consumption balance. Extensive simulation results demonstrate the our proposed approach performs better than other ones.
47
Man, Dapeng, Yao Wang, Hanbo Wang, Jiafei Guo, Jiguang Lv, Shichang Xuan, and Wu Yang. "Information-Centric Networking Cache Placement Method Based on Cache Node Status and Location." Wireless Communications and Mobile Computing 2021 (September 14, 2021): 1–13. http://dx.doi.org/10.1155/2021/5648765.
Full textAbstract:
Information-Centric Networking with caching is a very promising future network architecture. The research on its cache deployment strategy is divided into three categories, namely, noncooperative cache, explicit collaboration cache, and implicit collaboration cache. Noncooperative caching can cause problems such as high content repetition rate in the web cache space. Explicit collaboration caching generally reflects the best caching effect but requires a lot of communication to satisfy the exchange of cache node information and depends on the controller to perform the calculation. On this basis, implicit cooperative caching can reduce the information exchange and calculation between cache nodes while maintaining a good caching effect. Therefore, this paper proposes an on-path implicit cooperative cache deployment method based on the dynamic LRU-K cache replacement strategy. This method evaluates the cache nodes based on their network location and state and selects the node with the best state value on the transmission path for caching. Each request will only select one or two nodes for caching on the request path to reduce the redundancy of the data. Simulation experiments show that the cache deployment method based on the state and location of the cache node can improve the hit rate and reduce the average request length.
48
Liu, Yao, Hongjing Zhou, and Jiawei Huang. "OCA-MAC: A Cooperative TDMA-Based MAC Protocol for Vehicular Ad Hoc Networks." Sensors 19, no. 12 (June 14, 2019): 2691. http://dx.doi.org/10.3390/s19122691.
Full textAbstract:
Cooperative communication is an effective method of improving the transmission performance for vehicular ad hoc networks. However, the rapid movement of vehicles leads to frequent changes in network topology and reduces the probability of successful data transmission on the medium access control (MAC) layer. In this paper, we propose an Optimal Cooperative Ad hoc MAC protocol (OCA-MAC) based on time division multiple access (TDMA). OCA-MAC utilizes multiple cooperative nodes to forward data, so as to improve the probability of successful data transmission. It chooses cooperative nodes according to direct successful transmission probability, communication range between potential helper node and destination node, and available time slot. Meanwhile, in order to avoid excessive transmission redundancy caused by multiple cooperative forwarding, the optimal number of cooperative forwarding nodes is obtained through analysis of a probabilistic model. Simulation results show that OCA-MAC improves the successful data transmission rate and reduces the number of transmission times and transmission delay compared to the multichannel TDMA MAC protocol (VeMAC) and the cooperative ad hoc MAC protocol (CAH-MAC).
49
Qadir, Reshi Isfaq, and Anuradha Saini. "Optimization of WMN Performance for Different Propagation Environment." International Journal of Advanced Research in Computer Science and Software Engineering 8, no. 4 (April 30, 2018): 76. http://dx.doi.org/10.23956/ijarcsse.v8i4.635.
Full textAbstract:
Wireless mesh networks are multihop systems in which contrivances avail each other in transmitting packets through the network, especially in arduous conditions. We can drop these ad hoc networks into place with minimal preparation, and they provide a reliable, flexible system that can be elongated to thousands of contrivances. The wireless mesh network topology developed is a point-to-point-to-point, or peer-to-peer, system called an ad hoc, multi-hop network. A node can send and receive messages, and in a mesh network, a node withal functions as a router and can relay messages to its neighbours. A mesh network offers multiple redundant communications paths throughout the network. If one link fails for any reason, the network automatically routes messages through alternate paths. In a mesh network, we can abbreviate the distance between nodes, which dramatically increases the link quality. If we reduce the distance by a factor of two, the resulting signal is at least four times more puissant at the receiver. This makes links more reliable without incrementing transmitter power in individual nodes. In a mesh network, we can elongate the reach, integrate redundancy, and amend the general reliability of the network simply by integrating more nodes. One of the most astronomically immense issues in routing is to providing copacetic performance while scaling the wireless mesh network. It is fascinating, however, to investigate what transpires when routing nodes are expanded in different propagation environment and how that affects routing metrics. In this thesis, we examine the utilization of different proactive, reactive and hybrid protocols in such a way so that we may be able to build a cost function which avails in culling the finest grouping of routing protocols for a particular urban wireless mesh network. The key parameters are network throughput and average end to culminate delay. The performance of Bellman ford, DYMO, STAR and ZRP protocols have been examined with different node densities. A non-linear cost function equation has been proposed corresponding to each routing parameter taken. Bitrate is taken as constant (CBR).
50
Li, Yujiang, and Jinghua Cao. "WSN Node Optimal Deployment Algorithm Based on Adaptive Binary Particle Swarm Optimization." ASP Transactions on Internet of Things 1, no. 1 (May 17, 2021): 1–8. http://dx.doi.org/10.52810/tiot.2021.100026.
Full textAbstract:
In order to optimize the deployment of wireless sensor network nodes, and avoid network energy consumption increase due to node redundancy and uneven coverage, the multi-objective mathematical optimization problem of area coverage is transformed into a function problem. Aiming at network coverage rate, node dormancy rate and network coverage uniformity, the idea of genetic algorithm mutation is introduced based on the discrete binary particle swarm optimization and the global optimal speed is mutated to avoid the algorithm falling into the local optimal solution. In order to further improve the optimization ability of the algorithm, the adaptive learning factor and inertia weight are introduced to obtain the optimal deployment algorithm of wireless sensor network nodes. The experimental results show that the algorithm can reduce the number of active nodes efficiently, improve coverage uniformity, reduce network energy consumption and prolong network lifetime under the premise that the coverage rate is greater than 90%, and compared with an algorithm called coverage configuration protocol, an algorithm called finding the minimum working sets in wireless sensor networks, and an algorithm called binary particle swarm optimization-g in literature, the number of active nodes in this algorithm is reduced by about 36%, 30% and 23% respectively.