Увійти

Готові списки джерел за темами / SENCER NETWORKS / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: SENCER NETWORKS.

Статті в журналах з теми "SENCER NETWORKS"

Автор: Grafiati

Опубліковано: 11 вересня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "SENCER NETWORKS".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

THATIPAMULA RAJU, THATIPAMULA RAJU, and D. DEEPIKA RANI D. DEEPIKA RANI. "Achieving Network Level Privacy in Wireless Sensor Networks." International Journal of Scientific Research 2, no. 8 (June 1, 2012): 183–87. http://dx.doi.org/10.15373/22778179/aug2013/61.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Hari, Parli Baijnath, and Shailendra Narayan Singh. "Security Attacks at MAC and Network Layer in Wireless Sensor Networks." Journal of Advanced Research in Dynamical and Control Systems 11, no. 12 (December 20, 2019): 82–89. http://dx.doi.org/10.5373/jardcs/v11i12/20193215.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Dan, Ngoc Pham Thi, Khuong Ho Van, Hanh Dang Ngoc, Thiem Do Dac, Phong Nguyen Huu, Son Vo Que, Son Pham Ngoc, and Lien Hong Pham. "SECURITY CAPABILITY ANALYSIS OF COGNITIVE RADIO NETWORK WITH SECONDARY USER CAPABLE OF JAMMING AND SELF-POWERING." Journal of Computer Science and Cybernetics 36, no. 3 (August 18, 2020): 205–31. http://dx.doi.org/10.15625/1813-9663/36/3/14987.

Повний текст джерела

Анотація:

This paper investigates a cognitive radio network where a secondary sender assists a primarytransmitter in relaying primary information to a primary receiver and also transmits its own information toa secondary recipient. This sender is capable of jamming to protect secondary and/or primary informationagainst an eavesdropper and self-powering by harvesting radio frequency energy of primary signals.Security capability of both secondary and primary networks are analyzed in terms of secrecy outageprobability. Numerous results corroborate the proposed analysis which serves as a design guidelineto quickly assess and optimize security performance. More importantly, security capability trade-offbetween secondary and primary networks can be totally controlled with appropriate selection of systemparameters.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Ghaffari, Fatemeh, Seyed Pooya Shariatpanahi, Mahdi Jafari Siavoshani, and Behnam Bahrak. "Multi-Sender Index Coding Over Linear Networks." IEEE Communications Letters 26, no. 2 (February 2022): 273–76. http://dx.doi.org/10.1109/lcomm.2021.3132988.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Et. al., Manoj Kumar,. "An Optimized Utilization of Battery Backup in MANET Using Modified Firefly Algorithm." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 2 (April 11, 2021): 2086–94. http://dx.doi.org/10.17762/turcomat.v12i2.1813.

Повний текст джерела

Анотація:

Temporary connection failures and route changes happen in a Mobile Ad Hoc Network (MANET). MANET enjoys extensive variety of applications like in tactical networks, Sensor networks. Much battery backup is required while tuning a node that is far from the sender node While compared to the node which is near in respect to sender, In this paper we are proposing an approach of optimized utilization of battery backup in MANET Battery Backup is a main constraint in mobile ad hoc networks Most of the battery is wasted in tuning to the networks repeatedly there by making the mobile node vulnerable to Jail. This paper emphasize on proper utilization of battery backup by varying the signal strength according the distance of the nodes. Modified FireFly Algorithm (MFFA) is greatly utilized in this research for boosting up of battery backup. The cluster head should maintain a table for battery backup and decision of task distribution will be based on this table.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Dalkılıç, Gökhan, and Devrim Sipahi. "Spam filtering with sender authentication network." Computer Communications 98 (January 2017): 72–79. http://dx.doi.org/10.1016/j.comcom.2016.12.008.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Nisar, Kashif, Angela Amphawan, and Suhaidi B. Hassan. "Comprehensive Structure of Novel Voice Priority Queue Scheduling System Model for VoIP Over WLANs." International Journal of Advanced Pervasive and Ubiquitous Computing 3, no. 4 (October 2011): 50–70. http://dx.doi.org/10.4018/japuc.2011100106.

Повний текст джерела

Анотація:

Voice over Internet Protocol (VoIP) has grown quickly in the world of telecommunication. Wireless Local Area Networks (WLANs) are the most performance assuring technology for wireless networks, and WLANs have facilitated high-rate voice services at low cost and good flexibility. In a voice conversation, each client works as a sender or a receiver depending on the direction of traffic flow over the network. A VoIP application requires high throughput, low packet loss, and a high fairness index over the network. The packets of VoIP streaming may experience drops because of the competition among the different kinds of traffic flow over the network. A VoIP application is also sensitive to delay and requires the voice packets to arrive on time from the sender to the receiver side without any delay over WLAN. The scheduling system model for VoIP traffic is an unresolved problem. The objectives of this paper are to identify scheduler issues. This comprehensive structure of Novel Voice Priority Queue (VPQ) scheduling system model for VoIP over WLAN discusses the essential background of the VPQ schedulers and algorithms. This paper also identifies the importance of the scheduling techniques over WLANs.

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Cepl, Miroslav, and Jiří Šťastný. "Progressive optimization methods for applied in computer network." Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis 57, no. 6 (2009): 45–50. http://dx.doi.org/10.11118/actaun200957060045.

Повний текст джерела

Анотація:

Standard core of communications’ networks is represent by active elements, which carries out the processing of transmitted data units. Based on the results of the processing the data are transmitted from sender to recipient. The hardest challenge of the active elements present to determine what the data processing unit and what time of the system to match the processing priority assigned to individual data units. Based on the analysis of the architecture and function of active network components and algorithms, artificial neural networks can be assumed to be effectively useable to manage network elements. This article focuses on the design and use of the selected type of artificial neural network (Hopfield neural network) for the optimal management of network switch.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Sheelavant, Kumaresh, and R. Sumathi. "Dynamic Compilation of Pattern based clustering and Volumetric Probabilistic Mining for Network Routing in Cognitive Radio Sensor Networks." Indian Journal of Science and Technology 14, no. 41 (November 3, 2021): 3093–106. http://dx.doi.org/10.17485/ijst/v14i41.1838.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Widyarto, Ervan Yudi, and Chairul Anwar. "Build Social Networks-Based Audio Engineering (Design And Build An Audio-Based Social Network)." Eduvest - Journal Of Universal Studies 2, no. 1 (January 20, 2022): 48–54. http://dx.doi.org/10.36418/edv.v2i1.330.

Повний текст джерела

Анотація:

Social networks or social media is structure social that builds from node to node which generally is individual or organization. That will bundle with one or more type relation specific like score, vision, idea, friends and posterity and others. Analysis social network look at social connection like node or tie This time is so many social networks that already operation but all of them still using based on text for send message, comment, and email so it will the problem that mostly happen by smart phone user is they have difficulties for typing and for PC user occasionally having mistake because miss understanding meaning from sender.

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Widyarto, Ervan Yudi, and Chairul Anwar. "Build Social Networks-Based Audio Engineering (Design And Build An Audio-Based Social Network)." Eduvest - Journal of Universal Studies 2, no. 1 (January 20, 2022): 48–54. http://dx.doi.org/10.59188/eduvest.v2i1.330.

Повний текст джерела

Анотація:

Social networks or social media is structure social that builds from node to node which generally is individual or organization. That will bundle with one or more type relation specific like score, vision, idea, friends and posterity and others. Analysis social network look at social connection like node or tie This time is so many social networks that already operation but all of them still using based on text for send message, comment, and email so it will the problem that mostly happen by smart phone user is they have difficulties for typing and for PC user occasionally having mistake because miss understanding meaning from sender.

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Kung, H. T., Koan-Sin Tan, and Pai-Hsiang Hsiao. "TCP with sender-based delay control." Computer Communications 26, no. 14 (September 2003): 1614–21. http://dx.doi.org/10.1016/s0140-3664(03)00110-5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Cha, Hyun Jong, Jin Mook Kim, and Hwang Bin Ryou. "A Route Selection Mechanism for Mobility of Node in Mobile Ad Hoc Network." Applied Mechanics and Materials 224 (November 2012): 520–23. http://dx.doi.org/10.4028/www.scientific.net/amm.224.520.

Повний текст джерела

Анотація:

A mobile ad-hoc network is a method of communication between different nodes (mobile devices) without the use of base stations, which are used in wired networks. In a Mobile ad-hoc network, nodes can play the role of a receiver, sender, or a relay. As movement is flexible in Mobile ad-hoc networks and nodes have limited resources, nodes may join the communication or exit it at any time. Therefore, for Mobile ad-hoc networks, routing techniques - selecting communication routes and maintaining them – is considered important in an environment of constantly changing network topology. To overcome this problem, this paper proposes a reliable routing protocol based on MP-AOMDV, which monitors changes in signal strength not only for GPS signals but reception signals as well. Although MP-AOMDV was researched under the assumption of fixed movement direction and speed, this paper proposes a routing technique that works with changing movement direction or speed of nodes.

Стилі APA, Harvard, Vancouver, ISO та ін.

14

S, Rakshana. "Wireless Sensor Network." International Journal of Research Publication and Reviews 4, no. 4 (April 8, 2023): 1729–31. http://dx.doi.org/10.55248/gengpi.2023.4.4.35444.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

K.P, Aravinth. "Comparison of Fuzzy-based Cluster Head Selection Algorithm with LEACH Algorithm in Wireless Sensor Networks to Maximize Network Lifetime." Revista Gestão Inovação e Tecnologias 11, no. 4 (July 10, 2021): 1277–88. http://dx.doi.org/10.47059/revistageintec.v11i4.2186.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Ashokkumar, Jobanputra Paresh, and Prof Arun Jhapate. "A Review of Sensor Node in Wireless Sensor Networks." International Journal of Trend in Scientific Research and Development Volume-3, Issue-4 (June 30, 2019): 124–27. http://dx.doi.org/10.31142/ijtsrd23620.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

P., Renuka Devi. "Underwater Communication Using Wireless Sensor Networks." International Journal of Psychosocial Rehabilitation 24, no. 5 (April 20, 2020): 2264–75. http://dx.doi.org/10.37200/ijpr/v24i5/pr201925.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Shokrzadeh, Hamid, M. R. Majma, A. Movassagh, and M. Saheb. "Routing Security in Wireless Sensor Networks." Lecture Notes on Software Engineering 3, no. 4 (2015): 303–7. http://dx.doi.org/10.7763/lnse.2015.v3.209.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Bein, Adrian Sean, and Alexander Williams. "Networking IP Restriction filtering and network address." IAIC Transactions on Sustainable Digital Innovation (ITSDI) 1, no. 2 (April 30, 2020): 172–77. http://dx.doi.org/10.34306/itsdi.v1i2.149.

Повний текст джерела

Анотація:

Permissions setting on a computer is necessary. This is an effort that is not easy to change the system configuration or settings changed by the user. With a network of computers, of course, permissions settings do not need to be done one by one manually. Because in a computer network course there are many collections of computers connected together. Permissions setting so that the system can use the client-server applications that access restrictions can be done effectively. As the implementation of client-server applications can be created using Visual Basic 6.0. This language has been able to access the socket on the Windows operating system, named Winsock API that supports TCP / IP. This protocol is widely used because of the reliability of client-server application programming. The application is divided into two main applications, namely the client and server program name with the name of the Receiver Sender program. Receiver function receives instructions restriction of access rights Sender and sends reports to the Sender process execution. While Sender functions to send instructions restrictions permissions via the Registry to the Receiver. And after the test, the application can block important features available in the Windows operating system. So it is expected that these applications can help in permissions setting on a computer network.

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Kumarganesh, S., S. Anthoniraj, T. Senthil Kumar, P. Elayaraja, A. Christina Josephine Malathi, M. Somaskandan, and Gashaw Bekele. "A Novel Analytical Framework Is Developed for Wireless Heterogeneous Networks for Video Streaming Applications." Journal of Mathematics 2022 (September 13, 2022): 1–7. http://dx.doi.org/10.1155/2022/2100883.

Повний текст джерела

Анотація:

Due to bandwidth and time limits, delivering high-quality video streaming facility offers real-time wireless networks, but assuring quality of experience (QoE) is rather difficult. A network host can deliver its data stream via numerous different network pathways. At the same time, using multipath data transmission, where video streaming may be supplied through Internet protocols (IPs) as well as broadband with bidirectional communication between video sources and consumers, is one way to address this difficult problem. In this work, a novel framework is developed for wireless heterogeneous networks for video streaming applications using concurrent multipath transfer (CMT). The performance of frame-level delay can be enhanced for better video quality using this proposed method. The network congestion on end-to-end path utilised in CMT is not dependent of one another, and we operate under prior assumption that receiver’s announced window does not limit the sender. The analytical results show that the proposed framework outperforms existing methods in terms of performance with minimum retransmission delay.

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Olanrewaju, Oyenike Mary, Adebayo Abdulhafeez Abdulwasiu, and Nuhu Abdulhafiz. "Enhanced On-demand Distance Vector Routing Protocol to prevent Blackhole Attack in MANET." International Journal of Software Engineering and Computer Systems 9, no. 1 (January 24, 2023): 68–75. http://dx.doi.org/10.15282/ijsecs.9.1.2023.7.0111.

Повний текст джерела

Анотація:

Wireless networks are becoming increasingly popular. Mobile ad hoc networks are one category among the different types of wireless networks that transmit packets from the sender node to the receiver node without the use of abase station or infrastructure, as the nodes serve as both hosts and routers. These networks are referred to as mobile because they are movable. MANET is an ad-hoc network that can change positions at any time, and nodes can join or leave at any moment, making it vulnerable to attacks such as Blackhole. Existing solutions, in some ways, led to more memory space consumption, while others led to an overhead. This research proposes an Enhanced On-demand Distance Vector (AODV) routing protocol to prevent Blackhole attacks on MANETs using Diffie Hellman and Message Digest 5 (DHMD), implemented using Network Simulator 2 (NS2). The performance of the proposed protocol was evaluated using the following parameters: Packet Delivery Ratio, throughput, End to End (E2E)Delay, and routing overhead. It was concluded that DHMD has reduced network over head as it resulted to 23% while AODV resulted at 38%and memory consumption for DHMD gave 0.52ms compared to AODV that gave 0.81msdue to Blackhole prevention. This research will help to mitigate the effect of blackhole attacks in a network and increase network performance by reducing overhead and memory consumption.

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Ajmal, Mian M., and Yohanes Kristianto. "Knowledge Sharing in Supply Chain." International Journal of Strategic Decision Sciences 1, no. 4 (October 2010): 44–55. http://dx.doi.org/10.4018/jsds.2010100103.

Повний текст джерела

Анотація:

This paper examines knowledge sharing in supply chain by developing analytical models to minimize knowledge sharing uncertainty. Analogies from thermodynamics are used to describe the phenomenon in supply chain knowledge sharing. The study finds that distance and sender capacity are important to reduce knowledge sharing uncertainty. Furthermore, higher contact frequency between the sender and the receiver without considering sender capacity is proven to be insignificant to reduce uncertainty. This mechanism provides a new approach to explicate knowledge sharing in supply networks. It also serves as a deep-rooted opening point for supplementary empirical assessment. The mechanism facilitates managers to expand their understanding of composite circumstances embedded into global supply networks to share their knowledge. With enhanced understanding, managers can spotlight their actions, increasing their firms’ competitiveness. This study provides a deeper theoretical understanding of knowledge sharing in supply networks with a practical approach.

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Li, Tao Tao, Feng Yang, and Ming Chu Liu. "Data Transmission of Ground Penetrating Radar over Wireless Network." Applied Mechanics and Materials 701-702 (December 2014): 961–64. http://dx.doi.org/10.4028/www.scientific.net/amm.701-702.961.

Повний текст джерела

Анотація:

A wireless data transmission system used to realize data transmission of ground penetrating radar (GPR) is designed. It including data receiver and sender overcomes the disadvantages of traditional GPR cable transmission system. STM32F407 chip and ATK-RM04 are core components of data sender. PC with a wireless network card is data receiver. System is designed with reference to C/S network model. Data receiver and sender are respectively developed with VC++ socket and RAW API of Lwip TCP/IP protocol stack. CP protocol is chosen as network transport protocol. Practical applications show that system can stably transmit data within 0m-20m and maximum loss rate is 0.005%. It is reliable and convenient for GPR’s application.

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Gemmill, Jill. "Network basics for telemedicine." Journal of Telemedicine and Telecare 11, no. 2 (March 1, 2005): 71–76. http://dx.doi.org/10.1258/1357633053499822.

Повний текст джерела

Анотація:

Early telemedicine networks employed dedicated telecommunications circuits (e.g. leased digital lines) in which the sender and receiver were connected by a private circuit. More recently, the Internet has become widely available for general use, including telemedicine. The Internet was engineered to permit network paths to be shared by all users, so data transmission is fundamentally different from traditional, circuit-switched networks. Early telemedicine applications demonstrated the feasibility of Internet Protocol transmission. The basic performance criteria to use in evaluating newer digital communications technologies that carry both voice and data are: (1) bandwidth; (2) packet loss; (3) end-to-end delay; (4) jitter; (5) privacy and security. Network engineering involves performance trade-offs between the hardware, architecture, security and the budget available. A telemedicine application may be running over a network whose design is entirely under the user's control, or the application may employ some part of the Internet whose design is unknown to the user. If an application is not running to satisfaction, then a network engineer should be consulted.

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Li, Feng Yun, Fu Xiang Gao, Lan Yao, and Gui Ran Chang. "A Game Theory Based Approach for Routing in Wireless Sensor Networks." Advanced Engineering Forum 2-3 (December 2011): 599–603. http://dx.doi.org/10.4028/www.scientific.net/aef.2-3.599.

Повний текст джерела

Анотація:

Aiming at the limited resources and the security issues in wireless sensor networks, a routing approach is proposed. In this approach, the factors of reputation, remaining energy, and the distance to the destination are taken into considered while searching a routing path from an original sender node to the destination. A reputation-based mechanism is also proposed, and a node’s reputation depends on its behaviors. The malicious behaviors nodes will be punished and isolated, and the cooperative ones will be rewarded. Simulation results show that our proposed routing scheme can prolong the lifetime of the network and can offers a relatively high throughput than other routing protocols even when there are malicious nodes in the networks.

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Qin, Yu Jue, and Zhi Hui Ge. "Area Partition-Based Suppression Algorithm for Contention-Based Forwarding in Mobile Ad-Hoc Networks." Applied Mechanics and Materials 239-240 (December 2012): 1360–67. http://dx.doi.org/10.4028/www.scientific.net/amm.239-240.1360.

Повний текст джерела

Анотація:

Contention-Based Forward (CBF) has proven to achieve a very good performance in mobile ad-hoc networks. Compare with other greedy forward algorithm, CBF is much more robust and have low maintenance network overheads. On the other hand, the main issue of CBF is to avoid packet duplication. Duplication is very easy to occur due to the hidden nodes problem. In this paper we introduce an area partition-based suppression algorithm for CBF in mobile ad-hoc networks. This algorithm sets the transmission area of a node into two areas: suppression area and none-suppression area. In the none-suppression area, the algorithm still use the SS-CBF (Sender Suppression-CBF) algorithm, in the suppression area, this paper will use a new equation to avoid packet duplication. The result shows that the new protocol could reduce the network overheads and do not cost extra transmission time.

Стилі APA, Harvard, Vancouver, ISO та ін.

27

De Caro, Angelo, Vincenzo Iovino, and Adam O'Neill. "Receiver- and sender-deniable functional encryption." IET Information Security 12, no. 3 (May 1, 2018): 207–16. http://dx.doi.org/10.1049/iet-ifs.2017.0040.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Et. al., Ramadevi Chappala. "A Cached Based Multipath Load Balancing Technique for Internet of Things Sensor Networks." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 3 (April 11, 2021): 5399–405. http://dx.doi.org/10.17762/turcomat.v12i3.2186.

Повний текст джерела

Анотація:

By providing intelligent capabilities to objects the physical objects communicate each other without human intervention in Internet of Things (IoT) environment. And these devices generate enormous traffic as the sum of IoT gadgets is increased. As the network traffic is irregular it is most important to obtain an optimal load balance among all the nodes. In this paper, we propose to develop a cache based multipath load balancing protocol for IoT sensor networks. In this protocol multiple paths are established between each IoT sender and the server such that each sender has multiple next-hop delivering IoT data. Whenever, the load of the server becomes greater than a threshold, the server transmits the overloaded high priority data to these cache points and the IoT clients can fetch the data from the nearby CPs rather than the server. The outcome of simulation had proved that CBMLB mechanism attains maximum ratio of packet delivery with reduced overhead and delay.

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Ahmad, Amal, and Shereen Ismail. "User Selective Encryption Method for Securing MANETs." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 5 (October 1, 2018): 3103. http://dx.doi.org/10.11591/ijece.v8i5.pp3103-3111.

Повний текст джерела

Анотація:

<span>Security issue is getting important day by day. At present, there are a variety of methodologies to provide protection for data confidentiality. MANETs have lots of security challenges than traditional networks like infrastructureless and self-organizing requirements. As the MANETs are dynamic networks that’s make every transmission in such networks vulnerable to many attacks and improving security level becomes a main issue. This paper introduces a user selective encryption method by operating Data Encryption Standard (DES), Triple DES (3DES), Advanced Encryption Standard (AES) and the Diffie-Hellman Key Exchange (DHKE) protocol for key management in order to improve MANET security. Through the Network Simulator-2 (NS-2), the we investigate the performance of the proposed method in terms of data transfer time and network throughput for different data sizes and different sender-to-receiver number of hops. The results show the superiority of AES over other encryption algorithms. Furthermore, the effectiveness of our proposed method is verified through comparing our results with those obtained from previous studies.</span>

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Wang, Lili, Yajuan Qin, Huachun Zhou, Jianfeng Guan, and Hongke Zhang. "Design, Implementation, and Performance Evaluation of Efficient PMIPv6 Based Mobile Multicast Sender Support Schemes." Mobile Information Systems 2015 (2015): 1–17. http://dx.doi.org/10.1155/2015/741460.

Повний текст джерела

Анотація:

Proxy Mobile IPv6 (PMIPv6) is proposed as a promising network-based mobility management protocol, which does not need any participation of mobile nodes. PMIPv6 does not support the multicast well and most of the current research concentrates on the mobile multicast receiver. However, the mobile multicast sender is also very important and challenging, which has not been addressed well. Therefore, in this paper we propose two efficient PMIPv6 based mobile multicast sender support schemes which are PMIP bidirectional tunneling (PMIP-BT) and PMIP direct routing (PMIP-DR). In the PMIP-BT, the multicast traffic can be delivered through the PMIPv6 bidirectional tunnel, while, in the PMIP-DR, the multicast data can be transmitted via an optimized direct multicast routing. Both of them can support the multicast sender mobility transparently enabled in the PMIPv6 networks. We evaluate the performance of the proposed schemes by theoretical analysis, and the numerical results show that the proposed schemes have a better performance in terms of the signaling cost than the current schemes. Meanwhile, the proposed schemes are also implemented on the test bed, and the experimental results not only verify the validity and feasibility of our proposed schemes, but also conclude the different scenarios to which they are applicable.

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Ku, Jun Hua, Zhi Hua Cai, Ye Tong Wang, and Bing Zheng. "One-Pass Authenticated Key Establishment Protocol on Optimal Eta Pairings for Wireless Sensor Networks." Applied Mechanics and Materials 556-562 (May 2014): 4482–86. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.4482.

Повний текст джерела

Анотація:

The article proposed one-pass authenticated key establishment protocol from optimal eta pairings in random oracle for Wireless Sensor Networks. Security of the protocol relies on Computational Diffie-Hellman Problem on Optimal Eta Pairings. In one-pass key establishment protocol, the initiator computes a session key and a re1ated message. The key token is to be sent to the intended receiver using receiver's public key and sender secret key. From the received key token the receiver compute the session key, which is the same as the one computed by the sender,using sender public key and receiver's secret key. Because of low communication overhead, the scheme is better suited for Wireless Sensor Networks (WSNs) than the traditional key establishment protocol to establish the session key between two adjacent nodes.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Sharma, Ishu, and K. R. Ramkumar. "A survey on ACO based multipath routing algorithms for ad hoc networks." International Journal of Pervasive Computing and Communications 13, no. 4 (November 6, 2017): 370–85. http://dx.doi.org/10.1108/ijpcc-d-17-00015.

Повний текст джерела

Анотація:

Purpose The purpose of this paper is to review the existing routing algorithms for wireless ad hoc networks to evaluate the methods according to the current requirements. Wireless ad hoc network can provide communication in emergency situations. Active nodes in ad hoc network work as sender, receiver and router at the same time. Nodes are equipped with limited bandwidth and energy. Optimal routing method can help in “smart use” of available resources. Evolvement of routing method based on need is a continuous process. Numerous applications of ad hoc network motivates researcher for further development to fulfill the need of society. Design/methodology/approach In this paper, routing algorithms for ad hoc network based on ant colony optimization, multipath routing and with multiple input multiple output (MIMO) antenna support have been discussed. Findings Comparative analysis has been drawn among existing algorithms of different categories. Transmitting message packets parallel through multiple paths in the network can save overall resource usage in the network. Originality/value The authors have discussed the future area of development for optimal routing in ad hoc networks. Considering signal noise ratio and congestion status while selecting path can provide better energy use in the network. Rather than leaving less prioritized route paths, multiple paths can be used for sending data packets parallel.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Bae, Shi Kyu. "Enhanced Timing-Sync Protocol for Sensor Networks." International Journal of Future Computer and Communication 4, no. 3 (2015): 179–83. http://dx.doi.org/10.7763/ijfcc.2015.v4.380.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Prathap, Jomma, and Ramavath Janu. "All Data Aggregation in Wireless Sensor Networks." International Journal of Innovative Research in Engineering & Management 4, no. 6 (November 2017): 757–60. http://dx.doi.org/10.21276/ijirem.2017.4.6.2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Shevchuk, Y. V., E. V. Shevchuk, A. Y. Ponomarev, I. A. Vogt, A. V. Elistratov, A. Y. Vakhrin, and R. E. Yarovicyn. "Etherbox: a protocol for modular sensor networks." Program Systems: Theory and Applications 8, no. 4 (2017): 285–303. http://dx.doi.org/10.25209/2079-3316-2017-8-4-285-303.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Kori, Kaveri, and Prof Patil Yogita Dattatraya. "Efficient Routing Technique for Wireless Sensor Networks." International Journal of Trend in Scientific Research and Development Volume-2, Issue-5 (August 31, 2018): 2399–403. http://dx.doi.org/10.31142/ijtsrd18321.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Hiremath, Veeresh M., and Dr G. A. Bidkar. "Power Optimization Techniques in Wireless Sensor Networks." Bonfring International Journal of Research in Communication Engineering 6, Special Issue (November 30, 2016): 83–84. http://dx.doi.org/10.9756/bijrce.8207.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

38

S, Pothumani, and Srividhya R. "Improvisation of Sensor Networks - A New Technique." Journal of Advanced Research in Dynamical and Control Systems 11, no. 09-SPECIAL ISSUE (September 25, 2019): 62–67. http://dx.doi.org/10.5373/jardcs/v11/20192536.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Alrashed, Ebrahim A., and Mehmet Hakan Karaata. "Imposter Detection in Mobile Wireless Sensor Networks." International Journal of Computer and Communication Engineering 3, no. 6 (2014): 434–41. http://dx.doi.org/10.7763/ijcce.2014.v3.364.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Kurdi, Shivan Fazil. "Mobility-Based Routing in Opportunistic Networks." International Journal of Technology Diffusion 3, no. 2 (April 2012): 28–35. http://dx.doi.org/10.4018/jtd.2012040103.

Повний текст джерела

Анотація:

In Opportunistic Networks (OppNets) nodes are only intermittently connected. A complete path from the sender node to the receiver does not exist. Mobile objects exploit direct contact for message transmission without relying on an existing end to end infrastructure. In such networks, routing is a challenging issue. Nevertheless, routing protocols in the mobility-based class of OppNets exploit some context information such as node mobility information and patterns to make forwarding decision, since the effectiveness of routing depends on node mobility. The aim of this research is to identify, evaluate, and compare the mobility-based routing algorithms of OppNets based on the simulation results obtained from published literature. The research findings indicate that mobility-based algorithms are suitable for conditions where network bandwidth and devices are considered significant constraints. They provide average delivery ratio with less resource consumption. In brief, they are ideal when network traffic and resource consumption are taken into consideration.

Стилі APA, Harvard, Vancouver, ISO та ін.

41

DuBois, Christopher, James Foulds, and Padhraic Smyth. "Latent Set Models for Two-Mode Network Data." Proceedings of the International AAAI Conference on Web and Social Media 5, no. 1 (August 3, 2021): 137–44. http://dx.doi.org/10.1609/icwsm.v5i1.14131.

Повний текст джерела

Анотація:

Two-mode networks are a natural representation for many kinds of relational data. These networks are bipartite graphs consisting of two distinct sets ("modes") of entities. For example, one can model multiple recipient email data as a two-mode network of (a) individuals and (b) the emails that they send or receive. In this work we present a statistical model for two-mode network data which posits that individuals belong to latent sets and that the members of a particular set tend to co-appear. We show how to infer these latent sets from observed data using a Markov chain Monte Carlo inference algorithm. We apply the model to the Enron email corpus, using it to discover interpretable latent structure as well as evaluating its predictive accuracy on a missing data task. Extensions to the model are discussed that incorporate additional side information such as the email's sender or text content, further improving the accuracy of the model.

Стилі APA, Harvard, Vancouver, ISO та ін.

42

MANASA I P, MANASA I. P., and BALASUBRAMANI R. BALASUBRAMANI R. "Multi-Level Network Scheduling Scheme for Wireless Sensor Network." International Journal of Scientific Research 3, no. 5 (June 1, 2012): 282–87. http://dx.doi.org/10.15373/22778179/may2014/87.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Ravindranath, P. V., and Dr D. Maheswari. "Optimal Energy and Network Lifetime Maximization using a Modified Bat Optimization Algorithm MBAT under Coverage Constrained Problems over Heterogeneous Wireless Sensor Networks." International Journal of Trend in Scientific Research and Development Volume-1, Issue-6 (October 31, 2017): 1027–36. http://dx.doi.org/10.31142/ijtsrd4731.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Javaid, Nadeem, Abdul Majid, Arshad Sher, Wazir Khan, and Mohammed Aalsalem. "Avoiding Void Holes and Collisions with Reliable and Interference-Aware Routing in Underwater WSNs." Sensors 18, no. 9 (September 11, 2018): 3038. http://dx.doi.org/10.3390/s18093038.

Повний текст джерела

Анотація:

Sparse node deployment and dynamic network topology in underwater wireless sensor networks (UWSNs) result in void hole problem. In this paper, we present two interference-aware routing protocols for UWSNs (Intar: interference-aware routing; and Re-Intar: reliable and interference-aware routing). In proposed protocols, we use sender based approach to avoid the void hole. The beauty of the proposed schemes is that they not only avoid void hole but also reduce the probability of collision. The proposed Re-Intar also uses one-hop backward transmission at the source node to further improve the packet delivery ratio of the network. Simulation results verify the effectiveness of the proposed schemes in terms of end-to-end delay, packet delivery ratio and energy consumption.

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Knieps, Günter. "Internet of Things, future networks, and the economics of virtual networks." Competition and Regulation in Network Industries 18, no. 3-4 (September 2017): 240–55. http://dx.doi.org/10.1177/1783591718784398.

Повний текст джерела

Анотація:

The Internet of Things (IoT) gains momentum. Developments regarding smart grids, intelligent transportation systems, and low-power networks for smart cities constitute significant drivers in the evolution of network industries. IoT creates an array of new requirements for information and communications technology (ICT) data transmission: In addition to real-time and data geopositioning, new service characteristics result from the change of the traditional sender–receiver perspective of Transmission Control Protocol/Internet Protocol (TCP/IP) to content relevancy for many users (e.g. cloud computing) and dynamic changes of the state of devices. The future development and success of IoT hinges critically on the provision of heterogeneous quality of service (QoS) requirements which cannot be provided by best-effort TCP/IP Internet. It is thus not surprising that both in the US and the EU network neutrality regulations are currently being reconsidered. Alternative network logistics (virtual networks) dealing with heterogeneous QoS requirements of network traffic may require fundamental deviations from traditional Internet architectures. Corresponding logistics operating over joint physical infrastructures gain increasing attention under the heading of future networks (FNs). The goal of this article is to focus on the economic mechanisms of how the potentials of QoS differentiation in the context of FNs can be fully exploited and incentivized within innovative all-IP-based QoS traffic architectures.

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Ahmed, Ayam Tawfeek, Ahmed Noori Rashid, and Khalid Shaker. "Localization in Wireless Sensor Network." Webology 19, no. 1 (January 20, 2022): 692–704. http://dx.doi.org/10.14704/web/v19i1/web19049.

Повний текст джерела

Анотація:

The major problems in a Wireless Sensor Networks (WSNs) is the localization problem, that relates to how an area covers by the sensor nodes. In this study, the problem formulates as the decision problem, that takes the best location for all sensors in the sensor field. Butterfly Optimization Algorithm (BOA), proposes to calculate the estimate locations for all sensors. Simulating the BOA with using number of sensors from 25 to 150 sensors and number of the anchor nodes. The distance between sensors and anchors measures by Received Signal Strength (RSS) so, this strategy is known as RSS-BOA. The obtained results shed that, the performance of the proposed algorithm is more accurate in comparing with BOA approach in the term sensor's location and the average error.

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Nurfitriana, Tyas, Jafaruddin Gusti Amri Ginting, and Kukuh Nugroho. "Energy consumption analysis of DSR reactive routing protocol on mobile ad-hoc network." JURNAL INFOTEL 15, no. 1 (February 1, 2023): 89–96. http://dx.doi.org/10.20895/infotel.v15i1.817.

Повний текст джерела

Анотація:

Mobile ad-hoc network is a connection between mobile devices that uses wireless media. Mobile devices on the network hereinafter referred to a nodes. This network does not have an administrative center so each node on the network in addition to functioning as a sender and receiver of data information also functions as a router that will look for route information from the sender to the receiver. The topology of an ad-hoc network is always changing because the nodes move dynamically. The topology changes resulted in the repetition of route information searches. The process of finding route information requires a routing protocol. The routing protocol-enabled nodes must maintain the energy usage in the route-finding mechanism. Choosing the right routing protocol can be a solution to make energy use by nodes more efficient, especially in ad-hoc networks. In this study, a routing protocol in the reactive category is used, namely DSR (Dynamic Source Routing). This study aims to determine the performance of energy consumption, remaining energy, and PDR with scenarios of increasing node movement speed and network area. Based on the research results, it is known that the DSR routing protocol can handle changes in the speed of node movement and network area related to energy consumption and remaining energy. This is evidenced by the results of research showing that with faster node movements and wider areas, less energy is required. Meanwhile, regarding the success of packet delivery, the DSR routing protocol cannot handle changes in the speed of node movement and network area. This is evidenced by the results of the packet delivery ratio measurement which shows that with faster node movements and wider areas, many packets are not successfully received.

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Kumar, Vikash, Shivam Kumar Gupta, Harsh Sharma, Uchit Bhadauriya, and Chandra Prakash Varma. "A Review Paper on Voice Isolation Using Artificial Neural Network." International Journal for Research in Applied Science and Engineering Technology 10, no. 3 (March 31, 2022): 781–84. http://dx.doi.org/10.22214/ijraset.2022.40745.

Повний текст джерела

Анотація:

Abstract: Verbal communication been the most versatile and easiest way of communication since ages and nowadays also, it is used by today's machines also but every entity has its complications. Since, the commencement of 4G, hackneyed the verbal communication via mobiles. Thus, experiencing distortion in the message travelling between sender and receiver. So, the concerned paper shows how a new classification method tackles this problem by using Artificial Neural Networks(ANN) with the help of machine learning algorithms. The scope of artificial neural network is very vast it can be used in various fields such as speech enhancement, speech identification and many more. By using artificial neural network with machine learning algorithms, isolation will be done from the noise which got superimposed while travelling through the channel. Keywords: Artificial Neural Network, Voice Isolation, Independent Component Analysis, Neurons

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Afianti, Farah, Wirawan, and Titiek Suryani. "Dynamic Cipher Puzzle for Efficient Broadcast Authentication in Wireless Sensor Networks." Sensors 18, no. 11 (November 18, 2018): 4021. http://dx.doi.org/10.3390/s18114021.

Повний текст джерела

Анотація:

The use of signature-based broadcast authentication for code and data dissemination in wireless sensor networks (WSNs) cannot be avoided. It increases security but requires high computation. Adversaries can exploit the latter condition as an opportunity to send many false signatures. Filtering methods can overcome this vulnerability. Cipher Puzzle is a filtering method that has low storage overhead along with high security, especially against denial of service (DoS) attacks. However, its number of hash iterations cannot be bounded, which causes sender-side delay. This paper proposes a Dynamic Cipher Puzzle (DCP), which uses a threshold function to limit the number of hash iterations. Hence, time at the sender-side can be used more efficiently. Besides, its dynamic puzzle-strength increases the obscurity of the transmitted packet. Simulation and experimental results were analyzed with Arduino 2560. The theoretical results show that the quadratic function outperformed the compared methods. The scheme decreased sender-side delay by 94.6% with a guarantee of zero solution probability in 1.728 × 10 − 13 . The experimental results show that the consumption of resources at the sensor node increases with an acceptable value. Moreover, DCP increases the complexity for the attacker to implement probability and signature-based DoS attacks.

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Nguyen, Dung T., Duc-Tai Le, Moonseong Kim, and Hyunseung Choo. "Delay-Aware Reverse Approach for Data Aggregation Scheduling in Wireless Sensor Networks." Sensors 19, no. 20 (October 17, 2019): 4511. http://dx.doi.org/10.3390/s19204511.

Повний текст джерела

Анотація:

Many time-sensitive applications require data to be aggregated from wireless sensor networks with minimum latency. However, the minimum latency aggregation scheduling problem has not been optimally solved due to its NP-hardness. Most existing ideas rely on local information (e.g., node degree, number of children) to organize the schedule order, hence results in solutions that might be far from optimal. In this work, we propose RADAS: a delay-aware Reverse Approach for Data Aggregation Scheduling that determines the transmissions sequence of sensors in a reverse order. Specifically, RADAS iteratively finds the transmissions starting from the last time slot, in which the last sender delivers data to the sink, down to the first time slot, when the data aggregation begins. In each time slot, RADAS intends to maximize the number of concurrent transmissions, while giving higher priority to the sender with potentially higher aggregation delay. Scheduling such high-priority sender first would benefit the maximum selections in subsequent time slots and eventually shorten the schedule length. Simulation results show that our proposed algorithm dominates the existing state-of-the-art schemes, especially in large and dense networks, and offers up to 30% delay reduction.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!