To see the other types of publications on this topic, follow the link: Node to Node Communication.
Journal articles on the topic 'Node to Node Communication'
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 to Node Communication.'
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
Cheng, Wei, and Zhen Hua Tan. "Correlation Trust Authentication Model for Peer-to-Peer Networks." Advanced Materials Research 756-759 (September 2013): 2237–42. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.2237.
Full textAbstract:
A requester node requesting a service in a peer to peer network transmits a request to a service provider node. The request may include a communication history of the requester node identifying other nodes with which the requester node has previously communicated. The service provider node authenticates the requester node based on the communication history. The service provider node may ask other nodes with which the requester node has communicated for evaluation of the requester node. The other nodes may calculate a trust metric of the requester node and provide this metric to the service provider node. The service provider node may use this trust metric in combination with a similarity calculation of the requester node and the service provider node to make a determination whether the requester node is to be authenticated. The service provider node may evaluate the requester node and store the evaluation in its communication history.
2
Zhang, Xiao Juan, Zu Lin Wang, and Zhi Xia Zhang. "Finding Most Vital Node in Satellite Communication Network." Applied Mechanics and Materials 635-637 (September 2014): 1136–39. http://dx.doi.org/10.4028/www.scientific.net/amm.635-637.1136.
Full textAbstract:
An improved node importance evaluation method is proposed. The importance of nodes are not only determined by its location in the network, but also limited by the contribution of its neighboring nodes. The location of the node is determined by its betweenness. The contribution of the node is impacted by the betweenness and closeness centrality of its neighboring nodes. Experiments show that this proposed method is suitable for satellite communication network applications, and obtains accurate evaluation results.
3
Kim, Kihyun, and Sunmyeng Kim. "Cross Layer Based Cooperative Communication Protocol for Improving Network Performance in Underwater Sensor Networks." International Journal of Engineering and Technology Innovation 10, no. 3 (July 1, 2020): 200–210. http://dx.doi.org/10.46604/ijeti.2020.5327.
Full textAbstract:
For underwater sensor networks (USNs), cooperative communications have been introduced to improve network performance with the help of relay nodes. The previous cooperative communications select the best relay node on a hop-by-hop basis. Therefore, they have limitations in improving performance. In order to get better performance, a cooperative communication protocol based on the cross layer is proposed in this paper. The proposed protocol uses the information provided by a routing protocol at the network layer for the erroneous data packet delivery. It selects one with the minimum routing cost among relay candidate nodes. The routing protocol in the selected relay node provides the MAC layer with the address of the next hop node on the path to the sink node. Then, the MAC layer in the selected relay node forwards the erroneous data packet to the next hop node rather than a receiver node. Performance studies are carried out through simulation. Simulation results show that the proposed protocol has about 21.8% lower average delay and about 14.4% lower average number of nodes passed than the previous protocol, regardless of the maximum transmission range.
4
Cynthia, Antony, and V. Saravanan. "Tango Binary Search Tree Based Asymmetric Cryptographic Sensor Node Authentication for Secured Communication in Wireless Sensor Networks." Sensor Letters 18, no. 1 (January 1, 2020): 55–63. http://dx.doi.org/10.1166/sl.2020.4189.
Full textAbstract:
Wireless sensor network (WSN) comprises the group of sensor nodes distributed to sense and monitor the environments and collects the data. Due to the distributed nature of the sensor nodes, security is a major role to access the confidential data and protect the unauthorized access. In order to improve the secure communication, authentication is essential process in WSN. A Tango Binary Search Tree based Schmidt Cryptographic Sensor Node Authentication (TBST-SCSNA) technique is introduced for secured data communication in WSN with higher authentication accuracy. Initially, the trust values for each sensor nodes are calculated for increasing the security in data communication. The sensor nodes in WSN are arranged in tango binary search tree based on the trust value. The nodes in tree are inserted or removed based on their deployment. After that, the Schmidt-Samoa cryptographic technique is applied for node authentication and secure data communication. The cryptographic technique comprises three processes key generation, encryption and decryption. In key generation phase, the public key (i. e., node_ID) are generated and distributed for the sensor nodes and private key is kept secret using Schmidt-Samoa algorithm. The root node is embedded with a key during the deployment and it is controlled the entire the sensor nodes in the path. A Parent node generates the keys for child node based on the ID of parent node. After the key generation, the sender node encrypts the data packet and transmits to receiver node in the tree with the receiver node ID. After that, the receiver node enters their private key and verifies it with already stored key at the time of key generation. If both keys are same, then the node is said to be authentic node. Otherwise, the sensor node is said to be a malicious node. The authentic node only receives the original data packets. This process gets repeated till all the nodes in the path verify their identities and performs the secure communication. Simulation is carried out with different parameters such as authentication accuracy, authentication time and security level with respect to a number of sensor nodes and a number of data packets. The results observed that the TBST-SCSNA technique efficiently improves the node authentication accuracy, security level with minimum time than the state-of-the-art-methods.
5
Shan, Axida, Xiumei Fan, Celimuge Wu, Xinghui Zhang, and Shujia Fan. "Quantitative Study on the Impact of Energy Consumption Based Dynamic Selfishness in MANETs." Sensors 21, no. 3 (January 21, 2021): 716. http://dx.doi.org/10.3390/s21030716.
Full textAbstract:
Cooperative communication and resource limitation are two main characteristics of mobile ad hoc networks (MANETs). On one hand, communication among the nodes in MANETs highly depends on the cooperation among nodes because of the limited transmission range of the nodes, and multi-hop communications are needed in most cases. On the other hand, every node in MANETs has stringent resource constraints on computations, communications, memory, and energy. These two characteristics lead to the existence of selfish nodes in MANETs, which affects the network performance in various aspects. In this paper, we quantitatively investigate the impacts of node selfishness caused by energy depletion in MANETs in terms of packet loss rate, round-trip delay, and throughput. We conducted extensive measurements on a proper simulation platform incorporating an OMNeT++ and INET Framework. Our experimental results quantitatively indicate the impact of node selfishness on the network performance in MANETs. The results also imply that it is important to evaluate the impact of node selfishness by jointly considering selfish nodes’ mobility models, densities, proportions, and combinations.
6
Zhao, Bo Wen. "Monitoring Technological Analysis of Communication Network Platform." Applied Mechanics and Materials 687-691 (November 2014): 2630–34. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.2630.
Full textAbstract:
Node virtual network platform is designed and realized in allusion to node administration application scenarios in cloud computing, and distributed database and virtual network model with dynamic network features are put forward; nodes build node network through self-discovery packet and provide ability of addressing capability through built-in database engine. In the environment of super-large scale, node degree influences the whole virtual network platform. Through test, this platform can meet the needs of dynamic condition of application node brought by the explosive application request.
7
Lu, Peng, Guang Wei Zhang, and Fang Chun Yang. "Node Capture Attack Detection in Dynamic WSNs Based on New Node Tracking." Advanced Materials Research 945-949 (June 2014): 2372–79. http://dx.doi.org/10.4028/www.scientific.net/amr.945-949.2372.
Full textAbstract:
Since the nodes of WSNs are always deployed on the outside, nodes are easy to be captured. The traditional detection approaches of capture attack can be categorized as approaches based on time of absence and approaches based on target tracking. The former only suitable in static WSNs and the latter usually requires a large communication cost. In this paper, a novel node capture attack detection approach is proposed in dynamic WSNs. Through this approach, every node record its neighbors and detect new nodes in real-time, if new nodes join in the network, a new node tracking algorithm is performed in WSNs and find out which of them are captured by adversaries. Simulation results show that, this method can greatly improve the detection accuracy in dynamic WSNs, and the communication cost is low.
8
Nugroho, Rino, Mahar Faiqurahman, and Zamah Sari. "Implementasi Push Message Dengan Menggunakan Restful Web Service Pada Komunikasi Wireless Sensor." Jurnal Repositor 2, no. 1 (January 4, 2020): 79. http://dx.doi.org/10.22219/repositor.v2i1.207.
Full textAbstract:
Wireless Sensor Network (WSN) is a wireless network consisting of one or more nodes even numbering thousands. The nodes in the wireless sensor network (WSN) consist of sensor nodes and sink nodes. The use of wireless sensors on the network can form a node that can communicate with each other. The communication process generally uses a pull mechanism that precedes the data query process from the node to node sensor that provides sensing data. In some wireless sensor node architecture, this pull mechanism is considered less effective because the node sink must first request data to the sensor node. Alternative, a push message mechanism can be used to transmit sensed data within specified or determined time intervals.In this research is implemented push message mechanism by using restful web service in wireless sensor communications. Test results on the delivery of data by push data transmission obtained to sink nodes alternately in accordance with the order of destination address listed or stored in memory sensor node. And in doing data delivery to be efficient in the absence of data requests at any time.
9
Wang, Zhi Gang. "A Wireless Mesh Network Node Query Method Research." Applied Mechanics and Materials 416-417 (September 2013): 1570–73. http://dx.doi.org/10.4028/www.scientific.net/amm.416-417.1570.
Full textAbstract:
In the wireless mesh networks, identification of nodes does not need to set the address, only take the manufacturing time of the node as the sequence to identify. Nodes in the query and data transmission adopt a master - slave mode. The center node initializes slave-node according to the node of the manufacturing time sequence, through the search command, search to find the slave-node. The newly found node recursive search is for the next batch of nodes. Eventually form a wireless mesh network. Center nodes and the nodes of data communication are made by mesh network.
10
Fanti, Giulia, Nina Holden, Yuval Peres, and Gireeja Ranade. "Communication cost of consensus for nodes with limited memory." Proceedings of the National Academy of Sciences 117, no. 11 (March 4, 2020): 5624–30. http://dx.doi.org/10.1073/pnas.1912980117.
Full textAbstract:
Motivated by applications in wireless networks and the Internet of Things, we consider a model of n nodes trying to reach consensus with high probability on their majority bit. Each node i is assigned a bit at time 0 and is a finite automaton with m bits of memory (i.e.,2mstates) and a Poisson clock. When the clock of i rings, i can choose to communicate and is then matched to a uniformly chosen node j. The nodes j and i may update their states based on the state of the other node. Previous work has focused on minimizing the time to consensus and the probability of error, while our goal is minimizing the number of communications. We show that, whenm>3logloglog(n), consensus can be reached with linear communication cost, but this is impossible ifm<logloglog(n). A key step is to distinguish when nodes can become aware of knowing the majority bit and stop communicating. We show that this is impossible if their memory is too low.
11
Bhardwaj, Indu, Sibaram Khara, and Priestly Shan. "A Framework to Systematically Analyse the Trustworthiness of Nodes for Securing IoV Interactions." Scalable Computing: Practice and Experience 21, no. 3 (August 1, 2020): 451–62. http://dx.doi.org/10.12694/scpe.v21i3.1743.
Full textAbstract:
Trust plays essential role in any securing communications between Vehicles in IOV. This motivated us to design a trust model for IoV communication. In this paper, we initially review literature on IoV and Trust and present a hybrid trust model that separates the malicious and trusted nodes to secure the interaction of vehicle in IOV. Node segregation is done using value of statistics (St). If St of each node lies in the range of mean (m) plus/minus 2 standard deviation (SD) of PDR then nodes behaviour is considered as normal otherwise malicious. The simulation is conducted for different threshold values. Result depicts that PDR of trusted node is 0.63 that is much higher than the PDR of malicious node that is 0.15. Similarly, the average no. of hops and trust dynamics of trusted nodes are higher than that of malicious node. So, on the basis of values of PDR, number of available hops and trust dynamics, the malicious nodes can be clearly identified and discarded.
12
Balamurali, R., K. Kathiravan, and T. Krishnan. "Mitigating Hotspot Issue in WSN Using Sensor Nodes with Varying Initial Energy Levels and Quantification Algorithm." Cybernetics and Information Technologies 19, no. 3 (September 1, 2019): 118–36. http://dx.doi.org/10.2478/cait-2019-0029.
Full textAbstract:
Abstract A typical Wireless Sensor Network (WSN) uses multihop communication rather than direct transmission. In a multi-hop communication, the sensor node communicates the sensed data to its neighbor node, which is comparatively closer to the sink and the receiving node will forward the data to its neighbor node. This process continues until the data reaches the sink. Due to the multihop communication, the nodes closer to the sink have to transmit and receive more data and control packets compared to other nodes. Hence, the nodes closer to sink may deplete their energy at a faster rate and may die soon. This may create network isolation. This issue is called as the Hotspot problem. In this paper, we are proposing a Quantification algorithm for Sensor Nodes with varying Initial Energy Level to mitigate the Hotspot effect.
13
Geng, Kun. "Design on the Sink Node for Wireless Network." Applied Mechanics and Materials 336-338 (July 2013): 2406–9. http://dx.doi.org/10.4028/www.scientific.net/amm.336-338.2406.
Full textAbstract:
With the rapid development of communication technology, embedded technology, sensor technology, and the constantly emerging of micro-sensor nodes performing perception, computation, communications. Design of sink node is reliable in monitoring environmental elements. A communicated architecture of Wireless Sensor Network is presented in this paper, and hardware design of sink node for transmission data is also discussed.
14
He, Ning. "Study on Sink Node Design for Wireless Network." Advanced Materials Research 671-674 (March 2013): 3212–15. http://dx.doi.org/10.4028/www.scientific.net/amr.671-674.3212.
Full textAbstract:
With the rapid development of communication technology, embedded technology, sensor technology, and the constantly emerging of micro-sensor nodes performing perception, computation, communications. Design of sink node is reliable in monitoring environmental elements. A communicated architecture of Wireless Sensor Network is presented in this paper, and hardware design of sink node for transmission data is also discussed.
15
S, Dhanabal, Dr Amudhavalli P, Dr Prasanna Venkatesan G. K. D, and Dr Prasanna Venkatesan G. K. D. "An energy efficient flexible delay tolerant network with adaptive secured framework (ASF-DTN)." International Journal of Engineering & Technology 7, no. 3 (July 4, 2018): 1299. http://dx.doi.org/10.14419/ijet.v7i3.12485.
Full textAbstract:
Delay tolerant networks are widely used in mobile communications because of network withstanding capability of delay. However, when the connectivity of nodes increases, data loss may occur while transmission. Due to the malicious behavior of nodes the data may get permanently lost, which is known as black hole attacks and there is a chance to partial data loss because of the lower energy level of a node, which is known as a gray hole attack. In existing work, the data capacity of a node is not limited, so most of the highly energy efficient node contains a huge amount of data, when compared to other nodes which may lead to random attack. To overcome this, we propose a subjective capability model (SCM) for each and every node to limit the capacity of each node. ASF-DTN prevents collision attack and injection attack by implementing Kalman filtering, which can statistically analyze the behavior of nodes while each and every transmission. Here, we propose an effective node optimization scheme using genetic algorithm with a fitness function to find out energy efficient nodes among the optimal path for effective communication and its performance.
16
Muruganandam, D., and J. Martin Leo Manickam. "Detection and Countermeasure of Packet Misrouting in Wireless Adhoc Networks." Sensor Letters 17, no. 9 (September 1, 2019): 696–700. http://dx.doi.org/10.1166/sl.2019.4127.
Full textAbstract:
A MANET is an infrastructure-less type network, which consists of number of mobile nodes connected through wireless network interfaces. The Communication among nodes is made successfully when the nodes dynamically set up route among one another. The open nature and infrastructureless type of such networks causes the attacker's interest to penetrate through the network and decrease the network performance. Thus Security becomes a major concern for protected communication between mobile nodes. Packet misrouting stops the packet from reaching the destination by a malicious intermediate node. But the malicious node makes the intuition to its neighbors that it has done the genuine packet forwarding action. Moreover the malicious node makes the neighbours to suspect the normal node as malicious one. The proposed work ensures the detection of malicious nodes and avoids suspecting the trustworthy.
17
John Paul Antony, T., and S. P. Victor. "Eslba Load Sharing Technique for Reputation Manager in Multiple Gateways." International Journal of Engineering & Technology 7, no. 3.34 (September 1, 2018): 24. http://dx.doi.org/10.14419/ijet.v7i3.34.18709.
Full textAbstract:
Every node has the states of its neighbors such as Selfish, Unselfish and No Information state. The selfish node free path is constructed by avoiding selfish node in the route discovery process. Watch Dog mechanism helps to avoid such issues. Price and Reputation system (P&RS) helps to diminish the selfish nodes in a successful manner. Trustable node with low portability will go about as a Notoriety Manager and it keeps every one of the records of every node in a record system. The overload of RA leads to various problem and makes the communication very slow. In this paper we discuss about the RA affiliation and request in various possible ways. RA sends the affiliation to the nearest relay node to act as a RA for few nodes. Moreover we discuss the RA communication with Internet through Gateways and the load balancing algorithm – Energy Share Load Balancing Algorithm (ESLBA). The heap adjusting algorithm shares the heap between the nodes and channelizes the ideal course smarterly.
18
Yuan, Lina, Huajun Chen, and Jing Gong. "Throughput optimization of multi-hop and multi-path cooperation in WPSNs with hardware noises." International Journal of Distributed Sensor Networks 17, no. 6 (June 2021): 155014772110248. http://dx.doi.org/10.1177/15501477211024838.
Full textAbstract:
This paper proposes a novel multi-path and multi-hop wireless powered sensor network in case of hardware impairment, constituting an energy node, one source node, single sink node, and a series of distributed relay sensor nodes, where the energy node transmits wireless energy to all terminals in the first stage, and the relay sensor nodes relay the information of the source node to the sink node in the second stage. There exists M available paths between the source node and sink node, one of which is chosen for serving source-sink communication. To enhance the minimum achievable data rate, we propose a multi-hop communication protocol based on time-division-multiple-access and an optimal throughput path algorithm. We formulate the time allocation optimization problem about energy and information transmission of the proposed multi-hop cooperation, and confirm through abundant simulation experiments that the proposed scheme can availably improve user unfairness and spectral efficiency, and thus enhance its throughput performance.
19
Mihnea, Amalya, and Mihaela Cardei. "Efficient Wireless Communication in Grid Networks." International Journal of Interdisciplinary Telecommunications and Networking 7, no. 3 (July 2015): 57–79. http://dx.doi.org/10.4018/ijitn.2015070105.
Full textAbstract:
The authors give lower and upper bounds for capacity in grid networks when using one channel and one radio per node. We also analyze the capacity for multiple channels and make connections to channel assignment algorithms that we introduced previously, which are robust to the presence of primary users. The bounds obtained depend on the range of communication, the distance between nodes and the size of the grid network. Using our communication pattern, node communication can be scheduled to ensure end-to-end communication between any two nodes in a grid network while maximizing capacity.
20
Shao, Qing, Jia Lin Ma, and Yun Wei. "Study of Fault Detection Based on Benzene Ring in Wireless Sensor Networks." Advanced Engineering Forum 6-7 (September 2012): 1167–72. http://dx.doi.org/10.4028/www.scientific.net/aef.6-7.1167.
Full textAbstract:
Large scale and limited resources of wireless sensor networks(WSNs) increase the need to cope with node failures. This paper proposes a novel mechanism for the detection of node failures in WSNs. We designed a structure of benzene ring with symmetry. A benzene ring consists of a center node and several child nodes. Reliable communication links among these nodes. Each node maintains a list of its neighbors. The center node delegates detection service and make decisions about faulty nodes based on its child nodes’ available resources. Compared with other solutions, our mechanism can reduce energy consumption, decrease the number of neighborhoods and extend network lifetime. Simulation experiments show the performance and viability of the mechanism.
21
Thomson, Craig, Isam Wadhaj, Zhiyuan Tan, and Ahmed Al-Dubai. "A mobility aware duty cycling and preambling solution for wireless sensor network with mobile sink node." Wireless Networks 27, no. 5 (March 20, 2021): 3423–39. http://dx.doi.org/10.1007/s11276-021-02580-8.
Full textAbstract:
AbstractUtilising the mobilisation of a sink node in a wireless sensor network to combat the energy hole, or hotspot issue, is well referenced. However, another issue, that of energy spikes may remain. With the mobile sink node potentially communicating with some nodes more than others. In this study we propose the Mobility Aware Duty Cycling and Dynamic Preambling Algorithm (MADCaDPAL). This algorithm utilises an existing solution where a communication threshold is built between a mobile sink node using predictable mobility and static nodes on its path. MADCaDPAL bases decisions relating to node sleep function, moving to clear channel assessment and the subsequent sending of preambles on the relation between the threshold built by the static node and the position of the mobile sink node. MADCaDPAL achieves a reduction in average energy consumption of up to 80%, this when used in conjunction with a lightweight carrier-sense multiple access based MAC implementation. Maximum energy consumption amongst individual nodes is also brought closer to the average, reducing energy spikes and subsequently improving network lifetime. Additionally, frame delivery to the sink is improved overall.
22
Haripriya, M. P., and P. Venkadesh. "Subtractive Gradient Boost Clustering for Mobile Node Authentication in Internet of Things Aware 5G Networks." Journal of Computational and Theoretical Nanoscience 18, no. 4 (April 1, 2021): 1287–93. http://dx.doi.org/10.1166/jctn.2021.9394.
Full textAbstract:
The 5G mobile wireless network systems faces a lot of security issues due to the opening of network and its insecurity. The insecure network prone to various attacks and it disrupts secure data communications between legitimate users. Many works have addressed the security problems in 3G and 4G networks in efficient way through authentication and cryptographic techniques. But, the security in 5G networks during data communication was not improved. Subtractive Gradient Boost Clustered Node Authentication (SGBCNA) Method is introduced to perform secure data communication. The subtractive gradient boost clustering technique is applied to authenticate the mobile node as normal nodes and malicious nodes based on the selected features. The designed ensemble clustering model combines the weak learners to make final strong clustering results with minimum loss. Finally, the malicious nodes are eliminated and normal mobile nodes are taken for performing the secured communication in 5G networks. Simulation is carried out on factors such as authentication accuracy, computation overhead and security level with respect to a number of mobile nodes and data packets. The observed outcomes clearly illustrate that the SGBCNA Method efficiently improves node authentication accuracy, security level with minimum overhead than the state-of-the-art-methods.
23
Wei, Dengfeng, and Qing-Ju Jiao. "A Novel Core-Peer Based Trust Model for Peer-to-Peer Networks." Journal of Computational and Theoretical Nanoscience 14, no. 1 (January 1, 2017): 114–18. http://dx.doi.org/10.1166/jctn.2017.6135.
Full textAbstract:
In this paper, the P2P network node trust relationships and transactions are less likely to feature on the P2P network trust model based on the core nodes. Network nodes in the network model to the public reputation and private credibility clustering rely on node reliability for core nodes and node points to discuss and give relevant solutions. Simulation results show that the trust model not only has a robust anti-malicious node attack has a lower assessment of the amount of computation and communication overhead, network resources search.
24
Wu, Xiaojun, Qiying Cao, Juan Jin, Yuanjie Li, and Hong Zhang. "Nodes Availability Analysis of NB-IoT Based Heterogeneous Wireless Sensor Networks under Malware Infection." Wireless Communications and Mobile Computing 2019 (January 3, 2019): 1–9. http://dx.doi.org/10.1155/2019/4392839.
Full textAbstract:
The Narrowband Internet of Things (NB-IoT) is a main stream technology based on mobile communication system. The combination of NB-IoT and WSNs can active the application of WSNs. In order to evaluate the influence of node heterogeneity on malware propagation in NB-IoT based Heterogeneous Wireless Sensor Networks, we propose a node heterogeneity model based on node distribution and vulnerability differences, which can be used to analyze the availability of nodes. We then establish the node state transition model by epidemic theory and Markov chain. Further, we obtain the dynamic equations of the transition between nodes and the calculation formula of node availability. The simulation result is that when the degree of node is small and the node vulnerability function is a power function, the node availability is the highest; when the degree of node is large and the node vulnerability function satisfies the exponential function and the power function, the node availability is high. Therefore, when constructing a NBIOT-HWSNs network, node protection is implemented according to the degree of node, so that when the node vulnerability function satisfies the power function, all nodes can maintain high availability, thus making the entire network more stable.
25
Peng, Si Wei, and Hui Liu. "Optimal Locating of Misbehavior Node in Wireless Sensor Network." Advanced Materials Research 787 (September 2013): 1062–65. http://dx.doi.org/10.4028/www.scientific.net/amr.787.1062.
Full textAbstract:
In the application scene of the wireless sensor network, the distribution of nodes in the ideal case should be symmetrical. Each beacon node can help unknown nodes to locate. However, in the actual application environment, uneven distribution of nodes and irregular radius of node communication exist which lead to some unknown nodes that can not be achieved positioning. Based on the above problems, such nodes will be positioning analyzed and solutions are proposed to improve the precision and coverage of the network node positioning.
26
Berberler, Zeynep Nihan, Halil İbrahim Yildirim, Tolga İltüzer, and İzzet Tunç. "Agglomeration-Based Node Importance Analysis in Wheel-Type Networks." International Journal of Foundations of Computer Science 32, no. 03 (January 13, 2021): 269–88. http://dx.doi.org/10.1142/s0129054121500210.
Full textAbstract:
Evaluating the importance of nodes for complex networks is an important part of invulnerability research. In this paper, node importance analysis is conducted in wheel-related networks by a method of evaluating node importance by node contraction based on network agglomeration in communication networks. Both degrees and positions of nodes are considered with this method. This method was also proved to be feasible and effective measure to identify influential nodes in a network.
27
Kong, Lingping, Jeng-Shyang Pan, Tien-Wen Sung, Pei-Wei Tsai, and Václav Snášel. "An Energy Balancing Strategy Based on Hilbert Curve and Genetic Algorithm for Wireless Sensor Networks." Wireless Communications and Mobile Computing 2017 (2017): 1–13. http://dx.doi.org/10.1155/2017/5720659.
Full textAbstract:
A wireless sensor network is a sensing system composed of a few or thousands of sensor nodes. These nodes, however, are powered by internal batteries, which cannot be recharged or replaced, and have a limited lifespan. Traditional two-tier networks with one sink node are thus vulnerable to communication gaps caused by nodes dying when their battery power is depleted. In such cases, some nodes are disconnected with the sink node because intermediary nodes on the transmission path are dead. Energy load balancing is a technique for extending the lifespan of node batteries, thus preventing communication gaps and extending the network lifespan. However, while energy conservation is important, strategies that make the best use of available energy are also important. To decrease transmission energy cost and prolong network lifespan, a three-tier wireless sensor network is proposed, in which the first level is the sink node and the third-level nodes communicate with the sink node via the service sites on the second level. Moreover, this study aims to minimize the number of service sites to decrease the construction cost. Statistical evaluation criteria are used as benchmarks to compare traditional methods and the proposed method in the simulations.
28
Kumar, Ganesh, and A. Arivazhagan. "Modeling Portable Manager Aiding in the MANET Communication." Indonesian Journal of Electrical Engineering and Computer Science 9, no. 3 (March 1, 2018): 572. http://dx.doi.org/10.11591/ijeecs.v9.i3.pp572-576.
Full textAbstract:
<p>The aim of this paper is to model the Portable Manager and allow it to aid in communication among Mobile Ad-hoc Networks (MANETs) carrying information across the mobile nodes in the network. In this article, Modeling Portable Manager aiding in the MANET Communication (MMAC) is proposed. The novelty is present in the use of node performance parameter called as α defined as the ratio of the packet received, packet loss and delay of the node which could be used for the next hop selection in the mobile ad hoc network. The Portable Manager (PM) is used to find out the relay node in the network. The working of the PM with a minimal number of nodes is analyzed and presented through the simulations in the network simulator.</p>
29
Mohd. Zaid Harith, Muhammad, Noorzaily Mohamed Noor, Mohd Idna Idris, and Emran Mohd. Tamil. "Intersection and Complement Set (IACS) Method to Reduce Redundant Node in Mobile WSN Localization." Sensors 18, no. 7 (July 19, 2018): 2344. http://dx.doi.org/10.3390/s18072344.
Full textAbstract:
The majority of the Wireless Sensor Network (WSN) localization methods utilize a large number of nodes to achieve high localization accuracy. However, there are many unnecessary data redundancies that contributes to high computation, communication, and energy cost between these nodes. Therefore, we propose the Intersection and Complement Set (IACS) method to reduce these redundant data by selecting the most significant neighbor nodes for the localization process. Through duplication cleaning and average filtering steps, the proposed IACS selects the normal nodes with unique intersection and complement sets in the first and second hop neighbors to localize the unknown node. If the intersection or complement sets of the normal nodes are duplicated, IACS only selects the node with the shortest distance to the blind node and nodes that have total elements larger than the average of the intersection or complement sets. The proposed IACS is tested in various simulation settings and compared with MSL* and LCC. The performance of all methods is investigated using the default settings and a different number of degree of irregularity, normal node density, maximum velocity of sensor node and number of samples. From the simulation, IACS successfully reduced 25% of computation cost, 25% of communication cost and 6% of energy consumption compared to MSL*, while 15% of computation cost, 13% of communication cost and 3% of energy consumption compared to LCC.
30
Muhendra, Rifki. "Metoda Sederhana Distribusi Node Jaringan Sensor Nirkabel untuk Mengatasi Kehilangan Data Pada Saat Pengiriman." Jurnal ULTIMA Computing 9, no. 2 (April 2, 2018): 67–72. http://dx.doi.org/10.31937/sk.v9i2.657.
Full textAbstract:
A simple method of wireless sensor network node distribution was developed to address data loss during transmission. A node consists of a microcontroller, radio frequency, and battery. The adjacent nodes are planted with programs that can build mesh networks. This network consists of multiple child networks and parent networks connected through a frequency router node. Communication between nodes in the network can take two ways. The average ping time measured for the node distribution model is small from 1 second and the bit error rate (BER) is 0%.
Index Terms—Wireless sensor networks, mesh, frequency router node
31
Chen, Xian Zhong, Ran Ran Li, and Qing Wen Hou. "Indoor Ultrasonic 3D Seamless Location and Wireless Communication of Metal Can." Applied Mechanics and Materials 157-158 (February 2012): 788–91. http://dx.doi.org/10.4028/www.scientific.net/amm.157-158.788.
Full textAbstract:
A system with low-cost, low power consumption and wide range of ultrasonic positioning was designed. The node layout is the ultrasonic transmitter vertically installed on the top of the metal can as unknown node, the ultrasonic receivers as beacon nodes, 4 nodes installed on the ceiling and 4 nodes installed on the floor fixed position to receive ultrasonic. Ultrasonic sensor was designed with low power consumption microcontroller Ti MSP430F1611 and RF transceiver chip CC2420. Effective range is 10m, accuracy ± 2cm, launch angle , the system power 200 ~ 400uA/MIPS, 5V lithium battery-powered, Zigbee wireless communication protocol for data transmission. A new algorithm of node location module and Matlab software simulation result were established to achieve 3D seamless positioning of metal can in 20m*2m*2m indoor space.
32
Li, Hong Sheng, and Ning Hui He. "Adjustment Mechanism of Node Transmission Power." Applied Mechanics and Materials 307 (February 2013): 62–65. http://dx.doi.org/10.4028/www.scientific.net/amm.307.62.
Full textAbstract:
As to the power control protocol, in the CPC protocol each node uses the maximum transmit power choosed by all network nodes; the communication consumption of IPC protocol is smaller, but each node is using its own definition of transmission power, two-way link between nodes in the network can not be guaranteed. The sent power control based on data transmission can resolve the defaults of CPC and IPC.
33
Wang, Yang. "Design and Implementation of a Wireless Sensor Network Node Based on Arduino." International Journal of Online Engineering (iJOE) 13, no. 11 (November 22, 2017): 128. http://dx.doi.org/10.3991/ijoe.v13i11.7749.
Full textAbstract:
<p><span style="font-family: 宋体; font-size: medium;">For dealing with the limitations and deficiencies of present wireless sensor network nodes, including poor flexibility, low degree of variability, low generality, Arduino development advantages are combined with ZigBee wireless communication technologies characteristics. The versatility and flexibility of wireless sensor network nodes and the cost and energy consumption of nodes are studied. First of all, ZigBee communication protocol and networking technology are studied, and based on this, communication protocols that the subjects need are designed. Secondly, the hardware system of ZigBee wireless sensor network node based on Arduino technology is discussed and designed. In addition, suitable Arduino development panel is selected in accordance with requirements of ZigBee wireless sensor network node. With the development panel as the design prototype, the circuit of functional module is designed. Thirdly, based on the wireless sensor network node communication protocol and hardware design, the software system of wireless sensor network node is designed and realized. The results showed that, through designing reasonable software working flow and compiling efficient information acquisition and wireless communication program, the intelligence orientation of node information acquisition and information transmission is achieved. In a word, it can be concluded that, combined with Arduino, a better function can be achieved.</span></p>
34
Ahmad, Awais, M. Mazhar Rathore, Anand Paul, and Bo-Wei Chen. "Data Transmission Scheme Using Mobile Sink in Static Wireless Sensor Network." Journal of Sensors 2015 (2015): 1–8. http://dx.doi.org/10.1155/2015/279304.
Full textAbstract:
Multihop communication in wireless sensor network (WSN) brings new challenges in reliable data transmission. Recent work shows that data collection from sensor nodes using mobile sink minimizes multihop data transmission and improves energy efficiency. However, due to continuous movements, mobile sink has limited communication time to collect data from sensor nodes, which results in rapid depletion of node’s energy. Therefore, we propose a data transmission scheme that addresses the aforementioned constraints. The proposed scheme first finds out the group based region on the basis of localization information of the sensor nodes and predefined trajectory information of a mobile sink. After determining the group region in the network, selection of master nodes is made. The master nodes directly transmit their data to the mobile sink upon its arrival at their group region through restricted flooding scheme. In addition, the agent node concept is introduced for swapping of the role of the master nodes in each group region. The master node when consuming energy up to a certain threshold, neighboring node with second highest residual energy is selected as an agent node. The mathematical analysis shows that the selection of agent node maximizes the throughput while minimizing transmission delay in the network.
35
Yanfei, Jia, Zhang Kexin, and Zhao Liquan. "Improved DV-Hop Location Algorithm Based on Mobile Anchor Node and Modified Hop Count for Wireless Sensor Network." Journal of Electrical and Computer Engineering 2020 (August 1, 2020): 1–9. http://dx.doi.org/10.1155/2020/9275603.
Full textAbstract:
To improve the performance of location accuracy for wireless sensor network, a new location algorithm based on mobile anchor node and modified hop count is proposed. Firstly, we set different communication powers for all nodes to make them have different communication ranges. This makes the relationship between the hop count and real distance more accurate. Secondly, the unknown node computes the mean distance per hop between it and the three anchor nodes that are the nearest to the unknown node and uses the mean value as the mean distance per hop. Finally, we suppose that some anchor nodes can move. Once the position of some anchor nodes changes, we recalculate the positions of unknown nodes and use the mean value of recorded positions as position of unknown nodes. Simulation results show that the proposed method has lower location error than other methods.
36
Junus, Mochammad. "ANALISA PERBANDINGAN METODE KOMUNIKASI MULTIHOP DAN ROUND ROBIN PADA WIRELESS SENSOR NETWORK MENGGUNAKAN NRF24L01." JURNAL ELTEK 17, no. 1 (June 4, 2019): 1. http://dx.doi.org/10.33795/eltek.v17i1.128.
Full textAbstract:
Wireless Sensor Network merupakan jaringan komputer terdistribusi yang memanfaatkan sejumlah node sensor berukuran kecil, dikembangkan dan dikonfigurasikan dalam sekala besar untuk membantu pemindaian terhadap lingkungan sekitar, memanfaatkan parameter pengukuran berupa temperatur, tekanan, suhu, gerakan atau entitas lainnya yang diketahui oleh manusia. Umumnya implementasi WSN di lapangan adalah masalah keterbatasan sumber daya untuk energi yang digunakan oleh setiap sensor node di dalamnya Hal ini menjadikan node-node sensor harus mampu bekerja dengan cepat dan maksimal, dengan sumber energi yang terbatas.Pada penelitian sebelumnya dengan melakukan penghematan daya menggunakan mekanisme sleep Namun pada penelitian tersebut masih terdapat kekurangan yakni kurang efektifnya penggunaan hanya satu modul sensor pada sebuah sensor node. Di sisi lain kebutuhan dalam pengaplikasian pada suatu wilayah tidak cukup hanya dengan menggunakan satu buah modul sensor. Akan tetapi dengan jumlah node yang banyak maka diperlukan metode komunikasi antar node agar data pengiriman tiap node tidak saling bertabrakan dan manajemen penggunaan energi yang lebih efisien. Adapun beberapa metode yangdapat diterapkan antara lain adalah metode Round Robin dan Multi-hop.Dengan membandingkan kedua metode tersebut dapat diketahui keunggulan dan kelemahan dari masing-masing metode. Hasil pengujian yang telah dilakukan dengan mengisi penuh baterai 9V untuk semua node dan digunakan sampai habis. Pada metode Multihop komunikasi antara master node dan semua sensor node berlangsung dengan jeda pengiriman tiap node satu detik berlangsung selama 9 menit 36 detik dengan packet loss 54% pada lokasi outdoor dan 7 menit 45 detik dengan packet loss 54,25% pada lokasi indoor. Lama proses komunikasi ditentukan oleh umur daya dari sensor node 1. Sedangkan dengan menggunakan metode RoundRobin komunikasi terus berlangsung hingga 27 menit 59 detik dengan packet loss 27,40% untuk lokasi outdoor dan25 menit 16 detik untuk lokasi indoor dengan packet loss 28,14%.
Wireless Sensor Network is a distributed computer network that utilizes a number of small sensor nodes, developed and configured in large scale to help scan the surrounding environment, utilizing measurement parameters in the form of temperature, pressure, temperature, movement or other entities known to humans. Generally WSN implementation in the field is a matter of limited resources for the energy used by each sensor node in it. This makes sensor nodes must be able to work quickly and maximally, with limited energy sources.In previous studies with power saving using sleep mechanism, in this study there were still deficiencies, namely the ineffectiveness of using only one sensor module on a sensor node. On the other hand, the need for application in an area is not enough using only one sensor module.However, with a large number of nodes, a method of communication between nodes is needed so that the sending data of each node does not collide with each other and more efficient energy use management. The several methods that can be applied include the Round Robin and Multihop methods. By comparing the two methods can be known the advantages and disadvantages of each method.The test results have been carried out by fully filling the 9V battery for all nodes and used up. In the Multihop method the communication between the master node and all sensor nodes takes place with each node sending a second delay lasting 9 minutes 36 seconds with 54% packet loss at the outdoor location and 7 minutes 45 seconds with 54.25% packet loss at the indoor location. The length of the communication process is determined by the power age from sensor node 1. While using RoundRobin method the communication continues up to 27 minutes 59 seconds with packet loss 27.40% for outdoor locations and 25 minutes 16 seconds for indoor locations with packet loss 28.14%.
37
Santhi Sri, T., J. Rajendra Prasad, and R. Kiran Kumar. "Distributed and Adaptive Efficient Energy Aware Routing Procedure for MANETs." International Journal of Engineering & Technology 7, no. 3.12 (July 20, 2018): 841. http://dx.doi.org/10.14419/ijet.v7i3.12.16514.
Full textAbstract:
In mobile ad hoc networks {MANET}, power or energy consumption is a complex representation to define extensive communication between different nodes. To define energy routing scenario with respect to efficient energy maintenance to decrease the over burden of the protocol hierarchy wireless communication. To achieve these goals, a Synchronization-based Efficient Energy (SEE) calculation is supported along with the position opportunistic routing protocol previously to reduce overhead burden of server to maintain efficient energy. It consists distributed and random nature in which node consists local communication by facilitate packet transmitting in between different intermediate nodes based on backward communication. Because of random routing scenario of ad hoc networks, maintenance of capacity of each node for relay configuration at each node is a complex task. Due to that further extension of SEE, we introduce Collaborative & Efficient Energy Aware Distributed (CEEAD) approach, which consists routing representation in energy awareness scenario for wireless networks and it also supports cluster head representation of each node based on its random changes of power consumption in network communication. Our proposed approach consists cluster connectivity at each node because random routing process for wireless ad hoc networks. Our experimental results show effective increasing of network life time with scalable data communication in wireless networks.
38
Jo, Youngtae. "Communication Availability-Based Scheduling for Fair Data Collection with Path-Constrained Mobile Sink in Wireless Sensor Networks." International Journal of Distributed Sensor Networks 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/287935.
Full textAbstract:
To effectively transfer sensing data to a sink node, system designers should consider the characteristic of wireless sensor networks in the way of data transmission. In particular, sensor nodes surrounding a fixed sink node have routinely suffered from concentrated network traffic so that their battery energy is rapidly exhausted. The lifetime of wireless sensor networks decreases due to the rapid power consumption of these sensor nodes. To address the problem, a mobile sink model has recently been chosen for traffic load distribution among sensor nodes. However, since a mobile sink continuously changes its location in sensor networks, it has a time limitation to communicate with each sensor node and unstable signal strength from each sensor node. Therefore, fair and stable data collection policy between a mobile sink and sensor nodes is necessary in this circumstance. In this paper, we propose a new scheduling policy to support fair and stable data collection for a mobile sink in wireless sensor networks. The proposed policy performs data collection scheduling based on the communication availability of data transmission between sensor nodes and a mobile sink.
39
Al Tahtawi, Adnan Rafi, Erick Andika, and Wildan Nurfauzan Harjanto. "Portable wireless node design for smart agricultural system based on Internet of Things." IAES International Journal of Robotics and Automation (IJRA) 10, no. 1 (March 1, 2021): 1. http://dx.doi.org/10.11591/ijra.v10i1.pp1-9.
Full textAbstract:
This paper presents a pair of portable wireless nodes for a smart agricultural system to control and monitor the agricultural parameters based on Internet of Things (IoT). This system utilizes low-cost wireless communication through an nRF24L01 module between the sensor node and the controller node. The sensor node is placed on the agricultural area with a Li-Ion battery as a power supply, while the controller node is placed at the control and monitoring station. On the sensor node, there is a YL-69 soil moisture sensor and DS18B20 temperature sensor, while in the controller node there is a relay that can set watering on/off condition. In the controller node, there is also an ESP8266 WiFi module that serves to send data to the internet cloud for user monitoring. Both hardware nodes are built in small and portable size. The experimental result shows that the sensor node can transmit soil moisture and temperature data via RF wireless communication to the controller node. Watering is done automatically based on the condition of sensor values. In addition, this system can also be monitored through a website interface, so the users can easily find out the condition of their plant as long as there is internet access.
40
Fan, Na, Zongtao Duan, and Guangyuan Zhu. "A data dissemination mechanism based on evaluating behavior for vehicular delay-tolerant networks." International Journal of Distributed Sensor Networks 15, no. 7 (July 2019): 155014771986550. http://dx.doi.org/10.1177/1550147719865509.
Full textAbstract:
Vehicular delay-tolerant networks are widely used in intelligent transport application. Vehicle nodes exchange and share various information in vehicular delay-tolerant networks. However, current delay-tolerant network routing algorithms do not take into account the dynamic characteristic of traffic flow, and they do not effectively resist cyber attacks, such as black hole attack. To address this issue, we propose a data dissemination mechanism for vehicular delay-tolerant networks. In this mechanism, we develop a combined model to estimate the real-time traffic density. Simultaneously, we propose the metrics which include node interaction dispersion, node interaction freshness, node interaction participation, and node interaction contribution to evaluate behavior of nodes. Based on these metrics, a routing method is constructed. In this routing method, a relay node is selected by evaluating communication interaction behaviors among vehicle nodes. Considering the factors of traffic flow density and communication behaviors of vehicle nodes, a message forwarding strategy scheme is built for different traffic density scenarios. Extensive simulations show that the proposed mechanism exhibits superior performance over existing methods in forwarding traffic information and alleviates negative effects from black hole attacks.
41
Wang, Zhihui, Zhang Ran, Xiangzhou Chen, Yundan Liang, Zhengdong Ren, and Yujun He. "Critical Node Identification for Electric Power Communication Network Based on Topology and Services Characteristics." MATEC Web of Conferences 246 (2018): 03023. http://dx.doi.org/10.1051/matecconf/201824603023.
Full textAbstract:
It has an important impact on the overall power communication network reliability to identify the location of critical nodes in the network and further develop protection methods. On the topology layer of power communication network, Node Topology Importance(NTI) is proposed based on calculating the rate of natural connectivity of power communication network after one node being destroyed; A calculation method of power business is presented by considering the power business requirements on the indexes, then taking into account the business layer and topology layer, weighted natural connectivity which fuses the node business information and topology information is defined, accordingly Node Combining Importance(NCI) is proposed to realize the excavation of key node. Finally, taking a real communication network as the simulating example, the simulation results by comparing with other methods show that the proposed method can improve the accuracy of recognition.
42
Shivappa, Nagesha, and Sunilkumar S. Manvi. "ANFIS-Based Resource Mapping for Query Processing in Wireless Multimedia Sensor Networks." Journal of Intelligent Systems 26, no. 3 (July 26, 2017): 505–22. http://dx.doi.org/10.1515/jisys-2015-0114.
Full textAbstract:
AbstractWireless multimedia sensor networks (WMSNs) are usually resource constrained, and where the sensor nodes have limited bandwidth, energy, processing power, and memory. Hence, resource mapping is required in a WMSN, which is based on user linguistic quality of service (QoS) requirements and available resources to offer better communication services. This paper proposes an adaptive neuro fuzzy inference system (ANFIS)-based resource mapping for video communications in WMSNs. Each sensor node is equipped with ANFIS, which employs three inputs (user QoS request, available node energy, and available node bandwidth) to predict the quality of the video output in terms of varying number of frames/second with either fixed or varying resolution. The sensor nodes periodically measure the available node energy and also the bandwidth. The spatial query processing in the proposed resource mapping works as follows. (i) The sink node receives the user query for some event. (ii) The sink node sends the query through an intermediate sensor node(s) and cluster head(s) in the path to an event node. A cluster head-based tree routing algorithm is used for routing. (iii) The query passes through ANFIS of intermediate sensor nodes and cluster heads, where each node predicts the quality of the video output. (iv) The event node chooses the minimum quality among all cluster heads and intermediate nodes in the path and transmits the video output. The work is simulated in different network scenarios to test the performance in terms of predicted frames/second and frame format. To the best of our knowledge, the proposed resource mapping is the first work in the area of sensor networks. The trained ANFIS predicts the output video quality in terms of number of frames/second (or H.264 video format) accurately for the given input.
43
Song, Lin, Liang Gao, Jian Jie Chen, and Yong Jing Hao. "Interactive Diagram Modeling of Current Differential Protection Based on IEC61850." Advanced Materials Research 805-806 (September 2013): 682–87. http://dx.doi.org/10.4028/www.scientific.net/amr.805-806.682.
Full textAbstract:
Introducing substation to substation communication interface, tunneling communication and gateway communication described in IEC61850-90-1. For current differential protection, by adopting the idea of object-oriented modeling, dividing functions into logical nodes, gives the protection logic node model, shows the function of logic nodes and the realization of function based on the protection principle; Using Unified Modeling Language (UML) technology of collaboration diagram and sequence diagram, describes the protection logic node interaction and communication process from the messaging level and time level, providing reference to the design and development of Intelligent Electronic Devices (IED).
44
Tiwari, Mahesh kumar, UDAI SHANKAR, and AJAY KUMAR. "EFFICIENT MANET- INTERNET INTEGRATION FOR MOBILE DEVICES." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 14, no. 1 (November 20, 2014): 5343–51. http://dx.doi.org/10.24297/ijct.v14i1.2130.
Full textAbstract:
A mobile ad hoc network (MANET) consists of wireless mobile nodes without having a fixed infrastructure support. The communication between these mobile nodes is carried out without any centralized control. The communication among the nodes within the infrastructure less networks is done through Ad-Hoc routing protocols, But whenever any mobile node want to communicate to a node in a network that is outside the ad hoc network such as internet, there should be an appropriate mechanism for establishing this connection with the internet node or host. Gateway discovery is a fundamental process in connecting MANET with the internet. A mobile node can connect to the internet by discovery of some specialized nodes called as gateway nodes. These Gateway nodes act as a bridge between the mobile ad hoc networks node and the internet. The basic aim of the gateway discovery approach is to modify the route discovery process so that it is not only used for discovery of destination mobile nodes but also the gateways. In this paper we are going to present a review of various gateway discovery approaches which are used for establishing the interconnection of mobile ad hoc networks and internet and going to propose a algorithm that reduce the discovery time of the gateway by selective forwarding and simultaneously also optimize the gateway discovery control overheads.
45
Wu, Jia, Zhigang Chen, and Ming Zhao. "Information Transmission Probability and Cache Management Method in Opportunistic Networks." Wireless Communications and Mobile Computing 2018 (2018): 1–9. http://dx.doi.org/10.1155/2018/1571974.
Full textAbstract:
In real network environment, nodes may acquire the communication destination during data transmission and find a suitable neighbor node to perform effective data classification transmission. This is similar to finding certain transmission targets during data transmission with mobile devices. However, the node cache space in networks is limited, and waiting for the destination node can also cause end-to-end delay. To improve the transmission environment, this study established Data Transmission Probability and Cache Management method. According to selection of high meeting probability node, cache space is reconstructed by node. It is good for nodes to improve delivery ratio and reduce delay. Through experiments and the comparison of opportunistic network algorithms, this method improves the cache utilization rate of nodes, reduces data transmission delay, and improves the overall network efficiency.
46
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.
47
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.
48
Alagiri, I., V. Madhuviswanatham, and P. VenkataKrishna. "Efficient Data Transfer by Mobility Adjustment Algorithm for Clustered Mobile Ad-Hoc Networks." Cybernetics and Information Technologies 14, no. 2 (July 15, 2014): 50–64. http://dx.doi.org/10.2478/cait-2014-0019.
Full textAbstract:
Abstract Mobile Ad-hoc NETwork (MANET) is a prevalent deployable network for easy plug-in and it is widely applied for many real time scenarios. Clustering is a well known solution for efficient communication among nodes with least control overheads. The communication link breaks between nodes when a node moves beyond the transmission range of another node because of mobility. Frequent link breaks happen because of nodes mobility which cannot be controlled without increasing the network control overheads. The authors propose an Mobility Adjustment Routing (MAR) routing algorithm for establishing a stable path between the source and the destination. In this approach the choice of cluster heads based on the smallest weight age, node mobility and remaining battery power are used as a metric for weight computation. The cluster head and the gate way nodes forward RREQ packets to set up a path between the source and the destination which proves efficient communication, before forwarding a RREQ packet cluster the head/gateway node compares its mobility value with RREQ and updates the least value in RREQ. The destination node advertises the least mobility value to the remaining nodes in the path with the help of RREP packet, therefore stable paths are found without increasing the network control overheads. The simulation results done with the help of network simulator 2 show that the algorithm proposed performs well even at higher traffic load compared to existing algorithms.
49
Huang, Sen Mao, Guang You Yang, Zhi Yan Ma, and Zheng Zhang. "Research and Implementation of Time Synchronization Protocol Based on the ZigBee." Advanced Materials Research 787 (September 2013): 978–81. http://dx.doi.org/10.4028/www.scientific.net/amr.787.978.
Full textAbstract:
ZigBee technology is more and more used in complex and bad industrial monitoring and control environment. At the same time, ZigBee nodes are usually powered by batteries, so prolonging the working time and reducing the power consumption of the nodes is very important. If the wireless nodes can turn into sleep mode in spare time of communication, it will further reduce the node power consumption. But in sleep period, the node can't communication with other node, we need to synchronous awaken and dormancy, so precise time synchronization for wireless sensor network application is particularly important. This paper will apply FTSP algorithm in the ZigBee network and realize the network time synchronization. At the same time, it doesn't increase power consumption of the network.
50
Song, Wenguang, Haiyu Chen, Qiujuan Zhang, Bingxin Zhang, Hao Wang, and Hao Xu. "On-Chip Embedded Debugging System Based on Leach Algorithm Parameter on Detection of Wireless Sensor Networks." Mathematical Problems in Engineering 2020 (September 7, 2020): 1–7. http://dx.doi.org/10.1155/2020/7249674.
Full textAbstract:
Leach (low energy adaptive clustering hierarchy) algorithm is a self-clustering topology algorithm. Its execution process is cyclical. Each cycle is divided into two phases: cluster building phase and stable data communication phase. In the stage of cluster building, the adjacent nodes cluster dynamically and randomly generate cluster heads. In the data communication phase, the nodes in the cluster send the data to the cluster head, and the cluster head performs data fusion and sends the results to the aggregation node. Because the cluster head needs to complete data fusion, communication with the convergence node and other works, the energy consumption is large. Leach algorithm can ensure that each node acts as cluster head with equal probability, so that the nodes in the network consume energy relatively evenly. The basic idea of Leach algorithm is to randomly select cluster head nodes in a circular way. It evenly distributes the energy load of the whole network to each sensor node in the network. It can reduce network energy consumption and improve network life cycle. Leach repeatedly performs cluster refactoring during its operation. This paper studies the parameter detection of wireless sensor network based on Leach algorithm on the on-chip embedded debugging system. Because the classical low-power adaptive clustering layered protocol (Leach) has the problem of energy imbalance and short node life cycle, this paper uses embedded debugging technology based on Leach algorithm and the residual energy and position of nodes in wireless sensor networks were tested for research. This Leach algorithm uses the concept of wheel. Each round consists of two phases: initialization and stabilization. In the initialization stage, each node generates a random number between 0 and 1. If the random number generated by a node is less than the set threshold T (n), the node publishes a message that it is a cluster head. Through the research on the parameter detection, the simulation results show that the research in this paper has good feasibility and rationality.