Zaloguj się

Gotowe bibliografie tematyczne / Data Node / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Data Node.

Artykuły w czasopismach na temat „Data Node”

Autor: Grafiati

Data publikacji: 3 czerwca 2025

Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Data Node”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Roby, M. Fadhli, Aryuanto Soetedjo, and Irmalia Suryani Faradisa. "Pengembangan Sistem Monitoring Kualitas Air pada IPAL Tirtarona Tlogomas Kota Malang menggunakan IoT Berbasis LoRa." Prosiding SENIATI 6, no. 1 (2022): 33–41. http://dx.doi.org/10.36040/seniati.v6i1.4839.

Pełny tekst źródła

Streszczenie:

IPAL (Instalasi pembuangan air limbah) merupakan sebuah struktur bangunan, yang bertujuan untuk mengurangi sebuah pencemaran yang terkandung pada air limbah, peneliti sebelumnya merancang alat monitoring dengan beberapa sensor yaitu diantaranya sensor pH, DO, Turbidity dan DS18B20 terhadap webserver menggunakan modem GSM pada setiap alat yang terdiri dari 4 (empat) node ,hal ini membuat kurangnya efisiensi penggunaan konsumsi daya yang tinggi serta stabilitas pengiriman data, oleh sebab itu dilakukan pengembangan alat monitoring sebelumnya dengan pemanfaatan modul LoRa SX1278, sistem ini memil

Style APA, Harvard, Vancouver, ISO itp.

2

Kanwal, Samira, Zeshan Iqbal, Aun Irtaza, Muhammad Sajid, Sohaib Manzoor, and Nouman Ali. "Head Node Selection Algorithm in Cloud Computing Data Center." Mathematical Problems in Engineering 2021 (July 24, 2021): 1–12. http://dx.doi.org/10.1155/2021/3418483.

Pełny tekst źródła

Streszczenie:

Cloud computing provides multiple services such as computational services, data processing, and resource sharing through multiple nodes. These nodes collaborate for all prementioned services in the data center through the head/leader node. This head node is responsible for reliability, higher performance, latency, and deadlock handling and enables the user to access cost-effective computational services. However, the optimal head nodes’ selection is a challenging problem due to consideration of resources such as memory, CPU-MIPS, and bandwidth. The existing methods are monolithic, as they sele

Style APA, Harvard, Vancouver, ISO itp.

3

Ganesh, P., G. B. S. R. Naidu, Korla Swaroopa, et al. "Implementation of Hidden Node Detection Scheme for Self-Organization of Data Packet." Wireless Communications and Mobile Computing 2022 (March 26, 2022): 1–9. http://dx.doi.org/10.1155/2022/1332373.

Pełny tekst źródła

Streszczenie:

The mobile nodes are infrequent movement in nature; therefore, its packet transmission is also infrequent. Packet overload occurred for routing process, and data are lossed by receiver node, since hackers hide the normal routing node. Basically, the hidden node problem is created based on the malicious nodes that are planned to hide the vital relay node in the specific routing path. The packet transmission loss occurred for routing; so, it minimizes the packet delivery ratio and network lifetime. Then, proposed enhanced self-organization of data packet (EAOD) mechanism is planned to aggregate

Style APA, Harvard, Vancouver, ISO itp.

4

Ali Ahammed G.F, Reshman Banu, Masthan Ali A. H,. "Energy Aware Hierarchal Data Aggregation and Trust Based Data Integrity Verification for WSN." Psychology and Education Journal 58, no. 1 (2021): 5637–43. http://dx.doi.org/10.17762/pae.v58i1.2185.

Pełny tekst źródła

Streszczenie:

Currently the demand of wireless sensor networks has gained huge attraction due to its wide range of applications. Generally, these nodes are equipped with limited power resource and deployed in harsh environment where replacing these resources is a tedious task. Due to these issues, minimizing the energy consumption is a prime task to prolong the network lifetime. To overcome the challenging issue of data aggregation we introduced a novel combined mechanism which performs clustering and trust computing process to improve the data aggregation. According to this scheme, we arrange the nodes as

Style APA, Harvard, Vancouver, ISO itp.

5

Zhou, Xin Lian, and Jian Bo Xu. "The Research of Data Gathering Protocol for Mobile Sensor Networks." Advanced Materials Research 216 (March 2011): 621–24. http://dx.doi.org/10.4028/www.scientific.net/amr.216.621.

Pełny tekst źródła

Streszczenie:

This paper first proposed an energy-efficient distributed clustering technology for mobile sensor nodes and sink node mobility, select the higher residual energy and the nearest node from fixed nodes as cluster heads responsible for collecting sensed data, and all the fixed nodes form routing backbone to forward data, both can save energy and avoid cluster head away. Then, proposed a cross-layer scheduling mechanism to avoid the impact of mobile node and meet expectations cluster coverage. With energy-efficient clustering technology, efficient network topology control technology and mobile sin

Style APA, Harvard, Vancouver, ISO itp.

6

Reddi, Sivaranjani. "Privacy Preserving Data Mining Using Time Series Data Aggregation." International Journal of Strategic Information Technology and Applications 8, no. 4 (2017): 1–15. http://dx.doi.org/10.4018/ijsita.2017100101.

Pełny tekst źródła

Streszczenie:

This article proposes a mechanism to provide privacy to mined results by assuming that the data is distributed across many nodes. The first objective includes mining the query results by the node in a cluster, communicating it to the cluster head, aggregating the data collected from all the cluster nodes and then communicating it to the group controller. The second objective is to incorporate privacy at each level of the clusters node: cluster head and the group controller level. The final objective is to provide a dynamic network feature, where the nodes can join or leave the distributed netw

Style APA, Harvard, Vancouver, ISO itp.

7

R, Jayamma. "Improving The Performances of WSN Using Data Scheduler and Hierarchical Tree." Journal of Computational Science and Intelligent Technologies 2, no. 2 (2021): 7–16. http://dx.doi.org/10.53409/mnaa/jcsit/2202.

Pełny tekst źródła

Streszczenie:

Users of data-intensive implementation needs intelligent services and schedulers that will provide models and strategies to optimize their data transfer jobs. Normally sensor nodes are connected to consecutive sensor nodes depending on frequent transmission. To enhance end-to-end data flow parallelism for throughput optimization in high speed WSNs. The major objective is to maximize the WSNs throughput, minimizing the model overhead, avoiding disputation among users and using minimum number of end-system resources. Data packets are broadcasted from sender node to target node. Though, all nodes

Style APA, Harvard, Vancouver, ISO itp.

8

Sujatha, J., and K. Meena. "A vibrant data placement approach for map reduce in diverse environments." International Journal of Engineering & Technology 7, no. 2.4 (2018): 20. http://dx.doi.org/10.14419/ijet.v7i2.4.10034.

Pełny tekst źródła

Streszczenie:

Map reduce assumes that the computing capacity is same for each node in a cluster. Each node is assigned to the same load in homogeneous environment, hence it fully use the resources in the cluster. In such a cluster, there is likely to be various speciﬁcations of PCs or servers, which causes the abilities of the nodes to differ. If such a heterogeneous environment still uses the original Hadoop strategy that distributes data blocks into each node equally and the load is also evenly distributed to each node, then the overall performance of Hadoop may be reduced. The majorreasonis thatdifferent

Style APA, Harvard, Vancouver, ISO itp.

9

Meghanathan, Natarajan. "A Generic Algorithm to Determine Maximum Bottleneck Node Weight-based Data Gathering Trees for Wireless Sensor Networks." Network Protocols and Algorithms 7, no. 3 (2015): 18. http://dx.doi.org/10.5296/npa.v7i3.7961.

Pełny tekst źródła

Streszczenie:

We propose a generic algorithm to determine maximum bottleneck node weight-based data gathering (MaxBNW-DG) trees for wireless sensor networks (WSNs) and compare the performance of the MaxBNW-DG trees with those of maximum and minimum link weight-based data gathering trees (MaxLW-DG and MinLW-DG trees). Assuming each node in a WSN graph has a weight, the bottleneck weight for the path from a node u to the root node of the DG tree is the minimum of the node weights on the path (inclusive of the weights of the end nodes). The MaxBNW-DG tree algorithm determines a DG tree such that each node has

Style APA, Harvard, Vancouver, ISO itp.

10

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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

11

Zhao, Zhiyong, Zhongyang Mao, Zhilin Zhang, Yaozong Pan, and Jianwu Xu. "Collaborative Channel Perception of UAV Data Link Network Based on Data Fusion." Electronics 13, no. 18 (2024): 3643. http://dx.doi.org/10.3390/electronics13183643.

Pełny tekst źródła

Streszczenie:

The existing collaborative channel perception suffers from unreasonable data fusion weight allocation, which mismatches the channel perception capability of the node devices. This often leads to significant deviations between the channel perception results and the actual channel state. To solve this issue, this paper integrates the data fusion algorithm from evidence fusion theory with data link channel state perception. It applies the data fusion advantages of evidence fusion theory to evaluate the traffic pulse statistical capability of network node devices. Specifically, the typical charact

Style APA, Harvard, Vancouver, ISO itp.

12

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.

Pełny tekst źródła

Streszczenie:

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 localizat

Style APA, Harvard, Vancouver, ISO itp.

13

Muhendra, Rifki. "Metoda Sederhana Distribusi Node Jaringan Sensor Nirkabel untuk Mengatasi Kehilangan Data Pada Saat Pengiriman." Jurnal ULTIMA Computing 9, no. 2 (2018): 67–72. http://dx.doi.org/10.31937/sk.v9i2.657.

Pełny tekst źródła

Streszczenie:

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,

Style APA, Harvard, Vancouver, ISO itp.

14

Bharti, Rajendra Kumar, V. Bhoopathy, Parul Bhanarkar, et al. "Routing Path Selection and Data Transmission in Industry-Based Mobile Communications Using Optimization Technique." Wireless Communications and Mobile Computing 2022 (July 21, 2022): 1–9. http://dx.doi.org/10.1155/2022/5431413.

Pełny tekst źródła

Streszczenie:

In a mobile network, nodes are share data packets; sometimes, that packets are totally flooding. The packet dropping node does not easily detect for routing time instance. The node trust level is minimum causing the packet loss; it affects the entire network performance, and it reduces throughput and increases communication overhead. Proposed exhaustive routing path allocation (ERP) technique is applied to select the legitimate node for broadcasting the data packets completely. The attacker nodes of that flooding packets are detected by using the legitimate detector which are present in networ

Style APA, Harvard, Vancouver, ISO itp.

15

Meghanathan, Natarajan. "A Benchmarking Algorithm for Maximum Bottleneck Node Trust Score-based Data Gathering Trees in Wireless Sensor Networks." International Journal of Interdisciplinary Telecommunications and Networking 7, no. 3 (2015): 13–35. http://dx.doi.org/10.4018/ijitn.2015070102.

Pełny tekst źródła

Streszczenie:

The author proposes a benchmarking algorithm to determine maximum bottleneck node trust score-based data gathering trees (MaxBNT-DG trees) for wireless sensor networks (WSNs) wherein the bottleneck node trust score of a path (minimum trust score for any node on the path, including those of the end nodes) from any node to the root node of the DG tree is the maximum. He compares the performance of the MaxBNT-DG trees with that of the maximum bottleneck link weight-based data gathering trees (MaxBLT-DG trees) for which the bottleneck link trust score (minimum trust score for constituent links) of

Style APA, Harvard, Vancouver, ISO itp.

16

Latha, Suthanthira Raj Devi, Subramani Palani Niranjan, Sorin Vlase, and Maria Luminita Scutaru. "Enhancing Efficient Data Transmission in IBM WebSphere Using Relational Data eXchange (RDX) Mechanism and Tandem Queue." Axioms 14, no. 4 (2025): 320. https://doi.org/10.3390/axioms14040320.

Pełny tekst źródła

Streszczenie:

This study investigates tandem queues with two service nodes. The consumer needs to obtain services at the following two nodes in this system: the IBM online sphere for artificial intelligence (AI) and the complex RDX mechanism. Before the second essential service (SES), by utilizing AI to validate the data in IBM WebSphere and insight, the first essential service (FES) begins with the RDX mechanism. If there are fewer customers than “a” after a service at node 1 is finished, the server departs for a subsequent assignment. As soon as the vacation value reached the threshold, the service began.

Style APA, Harvard, Vancouver, ISO itp.

17

Li, Furong, and Duan Wang. "5G Network Data Migration Service Based on Edge Computing." Symmetry 13, no. 11 (2021): 2134. http://dx.doi.org/10.3390/sym13112134.

Pełny tekst źródła

Streszczenie:

With the development of mobile network technology, the continuous increase of mobile traffic has put forward higher requirements for quality of service (QoS) issues such as asymmetric transmission delay. The paper mainly studies the energy distribution problem on the migration data link from the terminal device to the edge node in the mobile edge network. Multiple data service packages are set up at each hop on the migration data link, and these data service packages compete with each other, and ultimately only one terminal provides and stores energy for this hop. The migration strategy of the

Style APA, Harvard, Vancouver, ISO itp.

18

Huang, Feng, Chun Jiang Zhao, Fei Fei Li, and Hua Rui Wu. "A WSN Routing and Sleeping Algorithm in Agriculture Intermittent Data Collection." Applied Mechanics and Materials 513-517 (February 2014): 606–11. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.606.

Pełny tekst źródła

Streszczenie:

Farmland environment is away from power facilities and its information collection lasts long time. These characteristics make the wireless sensor networks in agriculture face the problem of energy constraint. Efficient routing and sleeping algorithm can save energy. Considering the node residual energy and the collection cycle of the destination nodes, this paper improved a WSN routing and sleeping algorithm based on the AODV routing algorithm. This algorithm establishes routing path based on the node residual energy and the node collection cycle. Node sleeping cycle determined after the routi

Style APA, Harvard, Vancouver, ISO itp.

19

Kaur, Ramandeep, and Dinesh Kumar. "REGION BASED CLUSTERING FOR DATA COLLECTION IN WSN." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 16, no. 5 (2017): 6913–19. http://dx.doi.org/10.24297/ijct.v16i5.6251.

Pełny tekst źródła

Streszczenie:

The lower cost and easier installation of the WSNs than the wired counterpart pushes industry and academia to pay more attention to this promising technology. Large scale networks of small energy-constrained sensor nodes require techniques and protocols which are scalable, robust, and energy-efficient. The most efficient approach provided by clustering the nodes is hierarchy. The one node will send the data to another node and the another node will send to its neightbouring node. In smart cities, wireless sensor networks (WSNs) act as a type of core infrastructure that collects data from the c

Style APA, Harvard, Vancouver, ISO itp.

20

Tang, Lin. "Integrity protection method for trusted data of IoT nodes based on transfer learning." Web Intelligence 19, no. 3 (2021): 203–13. http://dx.doi.org/10.3233/web-210467.

Pełny tekst źródła

Streszczenie:

In order to overcome the problems of high data storage occupancy and long encryption time in traditional integrity protection methods for trusted data of IoT node, this paper proposes an integrity protection method for trusted data of IoT node based on transfer learning. Through the transfer learning algorithm, the data characteristics of the IoT node is obtained, the feature mapping function in the common characteristics of the node data is set to complete the classification of the complete data and incomplete data in the IoT nodes. The data of the IoT nodes is input into the data processing

Style APA, Harvard, Vancouver, ISO itp.

21

Kumar, Kamlesh, and Bobby Sharma. "Multicasting Model for Efficient Data Transmission in VANET." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 7s (2023): 408–14. http://dx.doi.org/10.17762/ijritcc.v11i7s.7016.

Pełny tekst źródła

Streszczenie:

VANETs (Vehicle Ad hoc Networks) are networks made up of a number of vehicular nodes that are free to enter and leave the network. The Location Aided Routing (LAR) protocol is the one that is most frequently utilized among them. Here, the route request packets are flooded across many pathways to the source node using the broadcasting strategy. The vehicles that have a direct path to the destination send the route reply packets back to the source. The least number of hops and the sequence number are used to determine the route from source to destination. This research study has used the multica

Style APA, Harvard, Vancouver, ISO itp.

22

Wang, Zhenwen, Fengjing Yin, Wentang Tan, and Weidong Xiao. "Classification in Networked Data with Heterophily." Scientific World Journal 2013 (2013): 1–6. http://dx.doi.org/10.1155/2013/236769.

Pełny tekst źródła

Streszczenie:

In the real world, a large amount of data can be described by networks using relations between data. The data described by networks can be called networked data. Classification is one of the main tasks in analyzing networked data. Most of the previous methods find the class of the unlabeled node using the classes of its neighbor nodes. However, in the networks with heterophily, most of connected nodes belong to different classes. It is hard to get the correct class using the classes of neighbor nodes, so the previous methods have a low level of performance in the networks with heterophily. In

Style APA, Harvard, Vancouver, ISO itp.

23

Liu, Jing. "Sorting of Section Contour Data Based on Linear Quadtree." Applied Mechanics and Materials 215-216 (November 2012): 635–38. http://dx.doi.org/10.4028/www.scientific.net/amm.215-216.635.

Pełny tekst źródła

Streszczenie:

A method based on the linear quadtree is proposed to sort the discrete data of the section contour. Firstly the contour data are distributed to different nodes of the linear quadtree and the data in the same node are sorted. Then neighbor node search regulations are established to help sort data in different nodes counter-clockwise. Experiment shows that the presented method can sort the data effectively.

Style APA, Harvard, Vancouver, ISO itp.

24

Ghosh, Utpal, and Uttam K. Mondal. "Pilot Agent-Driven Wireless Acoustic Sensor Network for Uninterrupted Data Transmission." Journal of Telecommunications and Information Technology 4 (November 7, 2023): 53–60. http://dx.doi.org/10.26636/jtit.2023.4.1322.

Pełny tekst źródła

Streszczenie:

Wireless acoustic sensor networks (WASN) usually demand uninterrupted and reliable data transmissions and an efficient path from the source nodes to the destination nodes, thus ensuring reliable delivery of sensitive or critical data with the use of multipath routing protocols. This paper presents a novel agent-driven WASN relying on a set of static and mobile agents. In the proposed technique, the location address is functioned into the operating node and the destination node. Calculations of the midpoint between the operating and the destination nodes are followed by identifying the shortest

Style APA, Harvard, Vancouver, ISO itp.

25

Liu, Shihu, and Haiyan Gao. "The Structure Entropy-Based Node Importance Ranking Method for Graph Data." Entropy 25, no. 6 (2023): 941. http://dx.doi.org/10.3390/e25060941.

Pełny tekst źródła

Streszczenie:

Due to its wide application across many disciplines, how to make an efficient ranking for nodes in graph data has become an urgent topic. It is well-known that most classical methods only consider the local structure information of nodes, but ignore the global structure information of graph data. In order to further explore the influence of structure information on node importance, this paper designs a structure entropy-based node importance ranking method. Firstly, the target node and its associated edges are removed from the initial graph data. Next, the structure entropy of graph data can b

Style APA, Harvard, Vancouver, ISO itp.

26

Akbar, Muhammad, ‪Prihadi Murdiyat, and Marson Ady Putra. "Rancang Bangun Peringatan Banjir Di Jalan Cipto Mangun Kusumo Berbasis Arduino." PoliGrid 3, no. 2 (2022): 41. http://dx.doi.org/10.46964/poligrid.v3i2.1710.

Pełny tekst źródła

Streszczenie:

Jika terjadi hujan deras, banjir sering terjadi di satu area di Jalan Cipto Mangun Kusumo, yang merupakan jalan utama di Kota Samarinda. Banjir yang umumnya terjadi di sore hari ini menyebabkan masyarakat terjebak berjam-jam di jalan tersebut saat pulang kerja atau kuliah karena di sekitar area ini terdapat banyak perusahaan dan kampus perguruan tinggi. Sebenarnya terdapat jalan alternative lain, tetapi Jalan Dr. Ciptomangunkusumo merupakan jalan terpendek. Agar masyarakat dapat mengetahui situasi terkini di area rawan banjir untuk menentukan saat masyarakat pulang dari kerja sering terjadi ba

Style APA, Harvard, Vancouver, ISO itp.

27

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 (2019): 155014771986550. http://dx.doi.org/10.1177/1550147719865509.

Pełny tekst źródła

Streszczenie:

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 pro

Style APA, Harvard, Vancouver, ISO itp.

28

Okuri, Masahiro, and Hiroaki Higaki. "Concurrent Data Message Transmissions for Interference of Illegal Overhearing in Wireless Sensor Networks." MATEC Web of Conferences 210 (2018): 03011. http://dx.doi.org/10.1051/matecconf/201821003011.

Pełny tekst źródła

Streszczenie:

In wireless sensor networks, data messages containing sensor data achieved by a sensor module in a wireless sensor node is transmitted to a stationary wireless sink node along a wireless multihop transmission route in which wireless sensor nodes themselves forward the data messages. Each intermediate wireless sensor node broadcast data messages in its wireless transmission range to forward them to its next-hop intermediate wireless sensor node. Hence, eavesdropper wireless nodes within the wireless transmission range easily overhear the data messages. In order to interfere with the eavesdroppe

Style APA, Harvard, Vancouver, ISO itp.

29

Haw, Su-Cheng, and Emyliana Song. "Transforming data-centric eXtensible markup language into relational databases using hybrid approach." Bulletin of Electrical Engineering and Informatics 10, no. 6 (2021): 3256–64. http://dx.doi.org/10.11591/eei.v10i6.2865.

Pełny tekst źródła

Streszczenie:

eXtensible markup language (XML) appeared internationally as the format for data representation over the web. Yet, most organizations are still utilising relational databases as their database solutions. As such, it is crucial to provide seamless integration via effective transformation between these database infrastructures. In this paper, we propose XML-REG to bridge these two technologies based on node-based and path-based approaches. The node-based approach is good to annotate each positional node uniquely, while the path-based approach provides summarised path information to join the node

Style APA, Harvard, Vancouver, ISO itp.

30

Cao, Keyan, Haoli Liu, Yefan Liu, Gongjie Meng, Si Ji, and Gui Li. "Efficient Data Collection Method in Sensor Networks." Complexity 2020 (April 10, 2020): 1–17. http://dx.doi.org/10.1155/2020/6467891.

Pełny tekst źródła

Streszczenie:

Wireless sensor networks are widely used in many fields, such as medical and health care, military monitoring, target tracking, and people’s life, because of their advantages of convenient deployment, low cost, and good concealment. However, due to the low battery capacity of sensor nodes and environmental changes, the energy consumption of nodes is serious and the accuracy of data collection is low. In the data collection method of multiple random paths, due to the uneven geographical distribution between nodes and the influence of the environment, it is easy to cause the communication betwee

Style APA, Harvard, Vancouver, ISO itp.

31

Jiang, Jingjing, Yao Li, Wenwu Yu, Nan Li, and Xiaoxia Tao. "Audience Dissemination Response Law and Action Mechanism Based on Internet Rumor Computer Big Data." Security and Communication Networks 2022 (July 14, 2022): 1–9. http://dx.doi.org/10.1155/2022/3737527.

Pełny tekst źródła

Streszczenie:

Various novel Internet rumors have also emerged. This article mainly researches the audience dissemination response law and the mechanism of action. This paper constructs a model of network rumor spreading. In the homogeneous network, we know that for the rumors that the initial infection rate is large, the increase caused by the herd phenomenon is not very large. For heterogeneous networks, we need to separately examine the increase of nodes and sparse nodes in the network under different initial infection rates. With the change of time, the number of nodes in each state will change due to in

Style APA, Harvard, Vancouver, ISO itp.

32

Zhang, Jun Hu, and Feng Jing Shao. "Ladder Routing: a Reactive Source Routing Protocol for Multi-Hop Data Transmission in Mobile Wireless Sensor Networks." Applied Mechanics and Materials 65 (June 2011): 455–60. http://dx.doi.org/10.4028/www.scientific.net/amm.65.455.

Pełny tekst źródła

Streszczenie:

Applications built upon mobile wireless sensor networks demand multi-hop data transmission between the sink node and any other far-away nodes. It's always not a good idea to broadcast the whole network for finding the best path to a specified far-away node because the broadcasting for route discovery consume too much amount of message exchanging between adjacent nodes in the network. In this paper, we propose a reactive source routing protocol, ladder routing, for finding the best path between the sink node and a specified node through a unicast kind of message exchanging. Ladder routing is im

Style APA, Harvard, Vancouver, ISO itp.

33

Manzali, Youness, Mohamed El Far, Mohamed Chahhou, and Mohammed Elmohajir. "Enhancing Weak Nodes in Decision Tree Algorithm Using Data Augmentation." Cybernetics and Information Technologies 22, no. 2 (2022): 50–65. http://dx.doi.org/10.2478/cait-2022-0016.

Pełny tekst źródła

Streszczenie:

Abstract Decision trees are among the most popular classifiers in machine learning, artificial intelligence, and pattern recognition because they are accurate and easy to interpret. During the tree construction, a node containing too few observations (weak node) could still get split, and then the resulted split is unreliable and statistically has no value. Many existing machine-learning methods can resolve this issue, such as pruning, which removes the tree’s non-meaningful parts. This paper deals with the weak nodes differently; we introduce a new algorithm Enhancing Weak Nodes in Decision T

Style APA, Harvard, Vancouver, ISO itp.

34

Cao, Li, Yinggao Yue, and Yong Zhang. "A Data Collection Strategy for Heterogeneous Wireless Sensor Networks Based on Energy Efficiency and Collaborative Optimization." Computational Intelligence and Neuroscience 2021 (September 29, 2021): 1–13. http://dx.doi.org/10.1155/2021/9808449.

Pełny tekst źródła

Streszczenie:

In the clustering routing protocol, prolonging the lifetime of the sensor network depends to a large extent on the rationality of the cluster head node selection. The selection of cluster heads for heterogeneous wireless sensor networks (HWSNs) does not consider the remaining energy of the current nodes and the distribution of nodes, which leads to an imbalance of network energy consumption. A strategy for selecting cluster heads of HWSNs based on the improved sparrow search algorithm- (ISSA-) optimized self-organizing maps (SOM) is proposed. In the stage of cluster head selection, the propose

Style APA, Harvard, Vancouver, ISO itp.

35

Kim, Seong Cheol. "A MAC Protocol for Critical Data Transmission in Wireless Sensor Networks." Applied Mechanics and Materials 303-306 (February 2013): 206–9. http://dx.doi.org/10.4028/www.scientific.net/amm.303-306.206.

Pełny tekst źródła

Streszczenie:

In this paper we present a low-power, low-latency MAC protocol adequate for critical data transmission. For support critical data packet transmission the proposed MAC protocol uses the modified IEEE 802.15.4 beacon frames including priority bit, sender node address, and NAV value fields. A receiver node periodically wakes up, receives sender beacon frames from its neighbor nodes, selects a data sending node, and broadcasts a beacon frame containing the selected sender’s address. Based on the sender’s data transmission urgency, a receiver node selects a data packet sending node. So critical dat

Style APA, Harvard, Vancouver, ISO itp.

36

Nugroho, Rino, Mahar Faiqurahman, and Zamah Sari. "Implementasi Push Message Dengan Menggunakan Restful Web Service Pada Komunikasi Wireless Sensor." Jurnal Repositor 2, no. 1 (2020): 79. http://dx.doi.org/10.22219/repositor.v2i1.207.

Pełny tekst źródła

Streszczenie:

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 no

Style APA, Harvard, Vancouver, ISO itp.

37

Widiono, Suyud. "Experiments and Descriptive Analysis in The MariaDB Database Cluster System to Prepare Data Availability." International Journal of Engineering Technology and Natural Sciences 1, no. 1 (2019): 42–48. http://dx.doi.org/10.46923/ijets.v1i1.24.

Pełny tekst źródła

Streszczenie:

A database server called the Database Management System (DBMS) that relates tables in a database is called the Relational Database Management System (RDBMS). DBMS/RDBMS is a computer program that provides data services for computers or other computer programs. One of the RDBMS type database server (hereinafter referred to as a database server) is MariaDB. The database server is in charge of managing and providing data, so data must always be ready, fast presented, accurate, and safe, it cannot be damaged or even lost. One way to provide this data is to install several database servers using th

Style APA, Harvard, Vancouver, ISO itp.

38

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.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

39

Yang, Guisong, Zhiwei Peng, and Xingyu He. "Data Collection Based on Opportunistic Node Connections in Wireless Sensor Networks." Sensors 18, no. 11 (2018): 3697. http://dx.doi.org/10.3390/s18113697.

Pełny tekst źródła

Streszczenie:

The working–sleeping cycle strategy used for sensor nodes with limited power supply in wireless sensor networks can effectively save their energy, but also causes opportunistic node connections due to the intermittent communication mode, which can affect the reliability of data transmission. To address this problem, a data collection scheme based on opportunistic node connections is proposed to achieve efficient data collection in a network with a mobile sink. In this scheme, the mobile sink first broadcasts a tag message to start a data collection period, and all nodes that receive this messa

Style APA, Harvard, Vancouver, ISO itp.

40

Zhou, Yuwen, Yuhan Hu, Jing Sun, Rui He, and Wenjie Kang. "A Semi-Federated Active Learning Framework for Unlabeled Online Network Data." Mathematics 11, no. 8 (2023): 1972. http://dx.doi.org/10.3390/math11081972.

Pełny tekst źródła

Streszczenie:

Federated Learning (FL) is a newly emerged federated optimization technique for distributed data in a federated network. The participants in FL that train the model locally are classified into client nodes. The server node assumes the responsibility to aggregate local models from client nodes without data moving. In this regard, FL is an ideal solution to protect data privacy at each node of the network. However, the raw data generated on each node are unlabeled, making it impossible for FL to apply these data directly to train a model. The large volume of data annotating work prevents FL from

Style APA, Harvard, Vancouver, ISO itp.

41

Matko, Vojko, Barbara Brezovec, and Miro Milanovič. "Intelligent Monitoring of Data Center Physical Infrastructure." Applied Sciences 9, no. 23 (2019): 4998. http://dx.doi.org/10.3390/app9234998.

Pełny tekst źródła

Streszczenie:

This paper presents a new intelligent monitoring and event management method for data center physical infrastructure based on multilayer node event processing. The priorities of highly classified data centers are not only the maintenance of the highest level of reliability and availability of the operation, but also fast, specific event identification and energy consumption monitoring, which altogether improve the level of energy efficiency. The new method, using a tree node for each device, improves information about the events in a specific node. Its major advantage is that in the case of a

Style APA, Harvard, Vancouver, ISO itp.

42

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 (2014): 50–64. http://dx.doi.org/10.2478/cait-2014-0019.

Pełny tekst źródła

Streszczenie:

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 establishi

Style APA, Harvard, Vancouver, ISO itp.

43

Holtorf, Lucas, Igor Titov, Frank Daschner, and Martina Gerken. "UAV-Based Wireless Data Collection from Underground Sensor Nodes for Precision Agriculture." AgriEngineering 5, no. 1 (2023): 338–54. http://dx.doi.org/10.3390/agriengineering5010022.

Pełny tekst źródła

Streszczenie:

In precision agriculture, information technology is used to improve farm management practices. Thereby, productivity can be increased and challenges with overfertilization and water consumption can be addressed. This requires low-power and wireless underground sensor nodes for monitoring the physical, chemical and biological soil parameters at the position of the plant roots. Three ESP32-based nodes with these capabilities have been designed to measure soil moisture and temperature. A system has been developed to collect the measurement data from the sensor nodes with a drone and forward the d

Style APA, Harvard, Vancouver, ISO itp.

44

Barkhordari, Mohammadhossein, and Mahdi Niamanesh. "Aras." International Journal of Distributed Systems and Technologies 8, no. 2 (2017): 47–60. http://dx.doi.org/10.4018/ijdst.2017040104.

Pełny tekst źródła

Streszczenie:

Because of to the high rate of data growth and the need for data analysis, data warehouse management for big data is an important issue. Single node solutions cannot manage the large amount of information. Information must be distributed over multiple hardware nodes. Nevertheless, data distribution over nodes causes each node to need data from other nodes to execute a query. Data exchange among nodes creates problems, such as the joins between data segments that exist on different nodes, network congestion, and hardware node wait for data reception. In this paper, the Aras method is proposed.

Style APA, Harvard, Vancouver, ISO itp.

45

Nyoman Putri Utami, Ni, Heri Wijayanto, and I. Gede Putu Wirarama. "Top-K Query for Large Dataset of Restaurant Review Based-on Hadoop MapReduce Framework." E3S Web of Conferences 465 (2023): 02033. http://dx.doi.org/10.1051/e3sconf/202346502033.

Pełny tekst źródła

Streszczenie:

In order to develop post-COVID-19 culinary tourism, high-quality facilities and services are essential. Information technology can contribute through a top-k query-based decision-making system. This study implements top-k queries on a distributed Hadoop MapReduce system to evaluate its capability in managing data and selecting culinary tourism potential. Research findings indicate that for the European restaurant data from TripAdvisor with 5 dimensions, both single-node and multi-node (3 nodes) executions exhibit comparable execution times across various data quantities. Conversely, for the Eu

Style APA, Harvard, Vancouver, ISO itp.

46

Jianming, Zhou, Liu Fan, and Lu Qiuyuan. "Data Fusion Based on Node Trust Evaluation in Wireless Sensor Networks." Journal of Sensors 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/391401.

Pełny tekst źródła

Streszczenie:

Abnormal behavior detection and trust evaluation mode of traditional sensor node have a single function without considering all the factors, and the trust value algorithm is relatively complicated. To avoid these above disadvantages, a trust evaluation model based on the autonomous behavior of sensor node is proposed in this paper. Each sensor node has the monitoring privilege and obligation. Neighboring sensor nodes can monitor each other. Their direct and indirect trust values can be achieved by using a relatively simple calculation method, the synthesis trust value of which could be got acc

Style APA, Harvard, Vancouver, ISO itp.

47

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 (2020): 55–63. http://dx.doi.org/10.1166/sl.2020.4189.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

48

Thahniyath, Gousia, Priti Mishra, and Sundar Raj Moorthy. "Two phase secure data collection technique for wireless sensor networks." Indonesian Journal of Electrical Engineering and Computer Science 26, no. 1 (2022): 512–20. https://doi.org/10.11591/ijeecs.v26.i1.pp512-520.

Pełny tekst źródła

Streszczenie:

Wireless sensor networks (WSNs) are the sensors that are dispersed in a different location that can sense the accumulated data in real-time and send it to the central location for the process of data aggregation. During the transfer of the information using the data nodes from the WSNs to the central location, there may be chances that the data node could be compromised by sensor failure or by an attack from a malicious user. To overcome this problem, we propose a two-phase secure data collection (TPSDC) technique for wireless sensor networks which provides confidentiality and integrity for th

Style APA, Harvard, Vancouver, ISO itp.

49

Dai, Hong, and Heng Hui Ge. "Improved LEACH Routing Protocol Through Selecting Cluster Head Node and Data Transmission Algorithm." Journal of Computational and Theoretical Nanoscience 13, no. 10 (2016): 7184–88. http://dx.doi.org/10.1166/jctn.2016.5690.

Pełny tekst źródła

Streszczenie:

For LEACH routing protocol in the clustering routing protocol of wireless sensors, the network energy consumption inequality, node energy inequality and deficiency of cluster head election, this paper proposes the method of improving the cluster head election through node residual energy and the distance between the nodes. To balance the network energy consumption, improves the algorithm of stable data transmission phase. The simulation experiment results prove the fact that the improved algorithm is better than the original algorithm through comparing the node mortality, receiving data amount

Style APA, Harvard, Vancouver, ISO itp.

50

Wang, Ruihong, Wuyungerile Li, Fei Gao, and Taofeng Jiao. "The PSL MAC Protocol for Accumulated Data Processing in the Energy-Harvesting Wireless Sensor Network." Wireless Communications and Mobile Computing 2022 (July 6, 2022): 1–10. http://dx.doi.org/10.1155/2022/6852822.

Pełny tekst źródła

Streszczenie:

In the energy-harvesting wireless sensor network (EH-WSN), the actual energy-harvesting rate of each node varies due to the difference in node deployment or a sudden change in the environment. Therefore, when a node with a low energy-harvesting rate is used as a relay node, its energy is depleted at an accelerated rate. This reduces connectivity and network life, thus causing data accumulation on the node and the neighboring nodes. This study proposes a medium access control (MAC) protocol to avoid data accumulation in nodes; the proposed algorithm comprises the following: (1) a data transmiss

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!