Статті в журналах з теми "Energy Packet"
Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Energy Packet.
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Energy Packet".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
1
Aguilar, Sergio, Antonis Platis, Rafael Vidal, and Carles Gomez. "Energy Consumption Model of SCHC Packet Fragmentation over Sigfox LPWAN." Sensors 22, no. 6 (March 9, 2022): 2120. http://dx.doi.org/10.3390/s22062120.
Повний текст джерелаАнотація:
The Internet Engineering Task Force (IETF) has standardized a new framework, called Static Context Header Compression and fragmentation (SCHC), which offers adaptation layer functionality designed to support IPv6 over Low Power Wide Area Networks (LPWANs). The IETF is currently profiling SCHC, and in particular its packet fragmentation and reassembly functionality, for its optimal use over certain LPWAN technologies. Considering the energy constraints of LPWAN devices, it is crucial to determine the energy performance of SCHC packet transfer. In this paper, we present a current and energy consumption model of SCHC packet transfer over Sigfox, a flagship LPWAN technology. The model, which is based on real hardware measurements, allows to determine the impact of several parameters and fragment transmission strategies on the energy performance of SCHC packet transfer over Sigfox. Among other results, we have found that the lifetime of a device powered by a 2000 mAh battery, transmitting packets every 5 days, is 168 days for 2250-byte packets, while it increases to 1464 days for 77-byte packets.
2
Doncel, Josu. "Age of information of a server with energy requirements." PeerJ Computer Science 7 (March 1, 2021): e354. http://dx.doi.org/10.7717/peerj-cs.354.
Повний текст джерелаАнотація:
We investigate a system with Poisson arrivals to two queues. One queue stores the status updates of the process of interest (or data packets) and the other handles the energy that is required to deliver the updates to the monitor. We consider that the energy is represented by packets of discrete unit. When an update ends service, it is sent to the energy queue and, if the energy queue has one packet, the update is delivered successfully and the energy packet disappears; however, in case the energy queue is empty, the update is lost. Both queues can handle, at most, one packet and the service time of updates is exponentially distributed. Using the Stochastic Hybrid System method, we characterize the average Age of Information of this system. Due to the difficulty of the derived expression, we also explore approximations of the average Age of Information of this system.
3
Hanji, Bhagyashri R., and Rajashree Shettar. "Cross Layer Solution for Energy and Delay Optimization in MANETs." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 6 (December 1, 2018): 4745. http://dx.doi.org/10.11591/ijece.v8i6.pp4745-4754.
Повний текст джерелаАнотація:
A novel method for packet forwarding in MANETs has been proposed in this paper. A node in the network acts as both host and router. Energy utilization of the node increases as all nodes in MANET operate as source, destination, and router to forward packets to the next hop ultimately to reach destination. Routers execute a variety of functions from simple packet classification for forwarding to complex payload revision. As the number of tasks and complexity increases, processing time required also increases resulting in significant processing delay in routers. The proposed work optimizes packet header at transport and network layer by calculating Unique Identifier using pairing function for the fields which do not change for a source–destination pair. This technique optimizes the processing cost of each packet header thereby conserving energy and reducing delay. It also simplifies the task of system administration. This paper elucidates an extension to basic AODV protocol, allowing routing of most packets without an explicit header, reducing the overhead of the protocol while still conserving its basic properties. The proposed method improves the network performance significantly compared to AODV, MTPR, and S-AODV protocol.
4
Liang, Guangjun, Qi Zhu, Jianfang Xin, Jiashan Tang, and Tianjiao Zhang. "Performance Analysis of Buffer-Aided Relaying System Based on Data and Energy Coupling Queuing Model for Cooperative Communication Networks." Wireless Communications and Mobile Computing 2017 (2017): 1–14. http://dx.doi.org/10.1155/2017/9287489.
Повний текст джерелаАнотація:
We focus on the performance analysis of the buffer-aided relaying system which allows data and energy packets to arrive independently and depart interactively. First, we profile the cooperative relaying system model as a data arrival and energy arrival coupling queuing model. Considering the influence of channel condition on the data departure rate, a new relay transmit protocol which permits exhausting more energy packet to send one data packet in the bad channel environment is proposed. Second, the joint data packet and energy packet handling problem is ascribed to a Coupled Processor Queuing Model which could achieve its steady state transition probability by Quasi-Birth and Death method. Third, the expressions of throughput, delay, and packet drop rate for both data queue and energy queue are also derived. Simulations are demonstrated to verify the analytical results under different data arrival rate, energy arrival rate, and relaying strategy.
5
Akbar, Shuja, Muhammad Mohsin Mehdi, M. Hasan Jamal, Imran Raza, Syed Asad Hussain, Jose Breñosa, Julio César Martínez Espinosa, Alina Eugenia Pascual Barrera, and Imran Ashraf. "Multipath Routing in Wireless Body Area Sensor Network for Healthcare Monitoring." Healthcare 10, no. 11 (November 17, 2022): 2297. http://dx.doi.org/10.3390/healthcare10112297.
Повний текст джерелаАнотація:
Mobility and low energy consumption are considered the main requirements for wireless body area sensor networks (WBASN) used in healthcare monitoring systems (HMS). In HMS, battery-powered sensor nodes with limited energy are used to obtain vital statistics about the body. Hence, energy-efficient schemes are desired to maintain long-term and steady connectivity of the sensor nodes. A sheer amount of energy is consumed in activities such as idle listening, excessive transmission and reception of control messages, packet collisions and retransmission of packets, and poor path selection, that may lead to more energy consumption. A combination of adaptive scheduling with an energy-efficient protocol can help select an appropriate path at a suitable time to minimize the control overhead, energy consumption, packet collision, and excessive idle listening. This paper proposes a region-based energy-efficient multipath routing (REMR) approach that divides the entire sensor network into clusters with preferably multiple candidates to represent each cluster. The cluster representatives (CRs) route packets through various clusters. For routing, the energy requirement of each route is considered, and the path with minimum energy requirements is selected. Similarly, end-to-end delay, higher throughput, and packet-delivery ratio are considered for packet routing.
6
Sabbineni, Harshavardhan, and Krishnendu Chakrabarty. "An Energy-Efficient Data Delivery Scheme for Delay-Sensitive Traffic in Wireless Sensor Networks." International Journal of Distributed Sensor Networks 6, no. 1 (January 1, 2010): 792068. http://dx.doi.org/10.1155/2010/792068.
Повний текст джерелаАнотація:
We propose a novel data-delivery method for delay-sensitive traffic that significantly reduces the energy consumption in wireless sensor networks without reducing the number of packets that meet end-to-end real-time deadlines. The proposed method, referred to as SensiQoS, leverages the spatial and temporal correlation between the data generated by events in a sensor network and realizes energy savings through application-specific in-network aggregation of the data. SensiQoS maximizes energy savings by adaptively waiting for packets from upstream nodes to perform in-network processing without missing the real-time deadline for the data packets. SensiQoS is a distributed packet scheduling scheme, where nodes make localized decisions on when to schedule a packet for transmission to meet its end-to-end real-time deadline and to which neighbor they should forward the packet to save energy. We also present a localized algorithm for nodes to adapt to network traffic to maximize energy savings in the network. Simulation results show that SensiQoS improves the energy savings in sensor networks where events are sensed by multiple nodes, and spatial and/or temporal correlation exists among the data packets. Energy savings due to SensiQoS increase with increase in the density of the sensor nodes and the size of the sensed events.
7
Hossain, Md Shakhawat, and M. Tariq Iqbal. "Wind Energy Based Packet Energy System." International Journal of Energy Science 4, no. 4 (2014): 123. http://dx.doi.org/10.14355/ijes.2014.0404.02.
Повний текст джерела
8
Gelenbe, Erol, and Elif Tugce Ceran. "Energy Packet Networks With Energy Harvesting." IEEE Access 4 (2016): 1321–31. http://dx.doi.org/10.1109/access.2016.2545340.
Повний текст джерела
9
Yin, Yonghua. "OPTIMUM ENERGY FOR ENERGY PACKET NETWORKS." Probability in the Engineering and Informational Sciences 31, no. 4 (April 9, 2017): 516–39. http://dx.doi.org/10.1017/s0269964817000067.
Повний текст джерелаАнотація:
The concept of Energy Packet Network (EPN) proposed by Gelenbe, is a new framework for modeling power grids that takes distributed energy generation such as renewable energy sources into consideration, and which contributes to modeling the smart grid. Based on G-network theory, this paper presents a simplified model of EPN and formulates energy-distribution as an optimization problem. We analyze it theoretically, and detail its optimal solutions. In addition to using existing optimization algorithms, a heuristic algorithm is proposed to solve for EPN optimization. The optimal solutions and efficacy of the algorithm are illustrated with numerical experiments. Further, we present an EPN with disconnections and a similar optimization problem is investigated. Optimal solutions are presented, and numerical results using the analytic optimal solutions, random solutions, a cooperative particle swarm optimizer and a heuristic algorithm illustrate the power of different approaches for solving energy-distribution problems using the EPN formalism.
10
Guo, Qingjie, Fengxu Yang, and Jianming Wei. "Experimental Evaluation of the Packet Reception Performance of LoRa." Sensors 21, no. 4 (February 4, 2021): 1071. http://dx.doi.org/10.3390/s21041071.
Повний текст джерелаАнотація:
LoRa technology is currently one of the most popular Internet of Things (IoT) technologies. A substantial number of LoRa devices have been applied in a wide variety of real-world scenarios, and developers can adjust the packet reception performance of LoRa through physical layer parameter configuration to meet the requirements. However, since the important details of the relationship between the physical layer parameters and the packet reception performance of LoRa remain unknown, it is a challenge to choose the appropriate parameter configuration to meet the requirements of the scenarios. Moreover, with the increase in application scenarios, the requirements for energy consumption become increasingly high. Therefore, it is also a challenge to know how to configure the parameters to maximize the energy efficiency while maintaining a high data rate. In this work, a complex evaluation experiment on the communication capability under a negative Signal to Noise Ratio is presented, and the specific details of the relationship between physical layer parameters and the packet reception performance of LoRa are clarified. Furthermore, we study the impact of the packet length on the packet reception performance of LoRa, and the experimental results show that when there is a large amount of data to be transmitted, it is better to choose long packets instead of short packets. Finally, considering the influence of physical layer parameters and the packet length on the packet reception performance of LoRa, the optimal parameter combination is explored, so as to propose a transmission scheme with a balanced reliability, delay, and energy consumption. This scheme is the first to consider the physical layer parameters and packet length together to study the communication transmission scheme, which reduces the communication time by 50% compared with the traditional transmission scheme and greatly reduces the energy consumption.
11
Peng, Mengyu, Wei Liu, Tian Wang, and Zhiwen Zeng. "Relay Selection Joint Consecutive Packet Routing Scheme to Improve Performance for Wake-Up Radio-Enabled WSNs." Wireless Communications and Mobile Computing 2020 (January 4, 2020): 1–32. http://dx.doi.org/10.1155/2020/7230565.
Повний текст джерелаАнотація:
Reducing energy consumption, increasing network throughput, and reducing delay are the pivot issues for wake-up radio- (WuR-) enabled wireless sensor networks (WSNs). In this paper, a relay selection joint consecutive packet routing (RS-CPR) scheme is proposed to reduce channel competition conflicts and energy consumption, increase network throughput, and then reduce end-to-end delay in data transmission for WuR-enabled WSNs. The main innovations of the RS-CPR scheme are as follows: (1) Relay selection: when selecting a relay node for routing, the sender will select the node with the highest evaluation weight from its forwarding node set (FNS). The weight of the node is weighted by the distance from the node to sink, the number of packets in the queue, and the residual energy of the node. (2) The node sends consecutive packets once it accesses the channel successfully, and it gives up the channel after sending all packets. Nodes that fail the competition sleep during the consecutive packet transmission of the winner to reduce collisions and energy consumption. (3) Every node sets two thresholds: the packet queue length threshold Nt and the packet maximum waiting time threshold Tt. When the corresponding value of the node is greater than the threshold, the node begins to contend for the channel. Besides, to make full use of energy and reduce delay, the threshold of nodes which are far from sink is small while that of nodes which are close to sink is large. In such a way, nodes in RS-CPR scheme will select those with much residual energy, a large number of packets, and a short distance from sink as relay nodes. As a result, the probability that a node with no packets to transmit becomes a relay is very small, and the probability that a node with many data packets in the queue becomes a relay is large. In this strategy, only a few nodes in routing need to contend for the channel to send packets, thereby reducing channel contention conflicts. Since the relay node has a large number of data packets, it can send many packets continuously after a successful competition. It also reduces the spending of channel competition and improves the network throughput. In summary, RS-CPR scheme combines the selection of relay nodes with consecutive packet routing strategy, which greatly improves the performance of the network. As is shown in our theoretical analysis and experimental results, compared with the receiver-initiated consecutive packet transmission WuR (RI-CPT-WuR) scheme and RI-WuR protocol, the RS-CPR scheme reduces end-to-end delay by 45.92% and 65.99%, respectively, and reduces channel collisions by 51.92% and 76.41%. Besides, it reduces energy consumption by 61.24% and 70.40%. At the same time, RS-CPR scheme improves network throughput by 47.37% and 75.02%.
12
Dudin, Sergey A., and Moon Ho Lee. "Analysis of Single-Server Queue with Phase-Type Service and Energy Harvesting." Mathematical Problems in Engineering 2016 (2016): 1–16. http://dx.doi.org/10.1155/2016/8142743.
Повний текст джерелаАнотація:
We propose a queueing model suitable, for example, for modelling operation of nodes of sensor networks. The sensor node senses a random field and generates packets to be transmitted to the central node. The sensor node has a battery of a finite capacity and harvests energy during its operation from outside (using solar cells, wind turbines, piezoelectric cells, etc.). We assume that, generally speaking, service (transmission) of a packet consists of a random number of phases and implementation of each phase requires a unit of energy. If the battery becomes empty, transmission is failed. To reduce the probability of forced transmission termination, we suggest that the packet can be accepted for transmission only when the number of energy units is greater than or equal to some threshold. Under quite general assumptions about the pattern of the arrival processes of packets and energy, we compute the stationary distributions of the system states and the waiting time of a packet in the system and numerically analyze performance measures of the system as functions of the threshold. Validity of Little’s formula and its counterpart is verified.
13
Jegadeesan, R., A. Beno, S. P. Manikandan, D. S. Naga Malleswara Rao, Bharath Kumar Narukullapati, T. Rajesh Kumar, Batyrkhan Omarov, and Areda Batu. "Stable Route Selection for Adaptive Packet Transmission in 5G-Based Mobile Communications." Wireless Communications and Mobile Computing 2022 (August 26, 2022): 1–10. http://dx.doi.org/10.1155/2022/8009105.
Повний текст джерелаАнотація:
In mobile nodes in the network, they are unstable, so single-path communication does not provide sufficient results. In the alternative single path, communication is very difficult to handle the heavy load. The poor connectivity among the mobile node makes the uncertainty of packet loss; the path link is not measured in this network. The communication cost is also focused to achieve valid packet transmission. Because the high distance path selected for packet transmission causes a high cost for communication. It increases energy consumption and packet loss rate. So, the proposed dispersed path selection for communication (DPAC) method is constructed to obtain the best minimum distance routing path, this path operates with the help of queue variation that handled the data packet’s maintenance, and the time slot exceeds its limit. Packets are kept waiting, to increase the packet broadcasting efficiency. The multipath jamming detection algorithm is constructed to provide link-based path packet overload detection scheme to identify the packet overload. Also, separate the path based on its characteristics, to control overload. It reduces energy consumption and packet loss rate.
14
Bharti, Rajendra Kumar, V. Bhoopathy, Parul Bhanarkar, Kanahaiya Lal Ambashtha, K. Priya, C. Anand Deva Durai, Manam Vamsi Krishna, P. Joel Josephson, and Kibebe Sahile. "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.
Повний текст джерелаАнотація:
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 network environment. The node credence level evaluation algorithm is planned to estimating each and every node authority range, whether the nodes have higher credence level basis efficient packet transmission in wireless nodes; otherwise, nodes have lesser credence level basis in effective packet broadcasting. These higher credence level nodes are assigned for communication process in movable network. It improves the throughput and minimizes the communication overhead. The performance metrics of the parameters are delay, communication overhead, throughput, network lifetime, energy consumption, and packet loss.
15
Uddin, Md Ashraf, and Mamun-or-Rashid. "Link Expiration Time-Aware Routing Protocol for UWSNs." Journal of Sensors 2013 (2013): 1–9. http://dx.doi.org/10.1155/2013/625274.
Повний текст джерелаАнотація:
We propose a link expiration time-aware routing protocol for UWSNs. In this protocol, a sending node forwards a data packet after being sure that the packet reaches the forwarding node, and acknowledgment is returned to the sending node after receiving the data packet. Node mobility is handled in the protocol through the calculation of the link expiration time and sending the packet based on the link expiration time. Although the protocol employs two types of control packet, it provides less energy consumption and at the same time is providing better reliability of packets reaching to the destination because of using acknowledgement packet. The forwarding decision of node is taken by applying Bayes’ uncertainty theorem. We use depth, residual energy, and distance from the forwarding node to the sending node as evidence in Bayes’ theorem. In this protocol, we use the concept of expert systems ranking potentially true hypothesis. Extensive simulation has been executed to endorse better performance of the proposed protocol.
16
AOUIZ, Amir Abdelkader, Sofiane BOUKLI HACENE, Pascal Lorenz, and Marc GILG. "Network Life Time maximization of the AOMDV Protocol Using Nodes Energy Variation." Network Protocols and Algorithms 10, no. 2 (June 28, 2018): 73. http://dx.doi.org/10.5296/npa.v10i2.13322.
Повний текст джерелаАнотація:
Mobile ad hoc network presents generally several challenges such as high dynamic topology, packet loss and frequent routes discovering that result in low throughput and reduced packet delivery ratio. To reduce the number of route discovering process, multipath routing protocols makes use of alternate paths to continue packets transmission. Ad Hoc On-demand, multipath distance vector routing protocol or AOMDV, is one of the well-known multipath protocols that relays on the hop count metric to route packets. However maintaining disjoint active routes can reduce nodes life time and lead to more control messages like error and discovering packets. In this paper, a pre-emptive approach is proposed based on the historical values of nodes energy. Nodes that excessively consume energy in time are considered overloaded and are excluded from route discovering, hence nodes with reduced energy variation are selected to route packets. Simulation results show reduced number of dead nodes by 30 %, overhead by 16%.
17
Mutalemwa, Lilian C., and Seokjoo Shin. "Secure Routing Protocols for Source Node Privacy Protection in Multi-Hop Communication Wireless Networks." Energies 13, no. 2 (January 7, 2020): 292. http://dx.doi.org/10.3390/en13020292.
Повний текст джерелаАнотація:
Traffic analysis attacks are common in monitoring wireless sensor networks (WSNs). In the attacks, adversaries analyze the traffic pattern to obtain critical information such as the location information of a source node. Fake source packet routing protocols are often used to ensure source location privacy (SLP) protection. The protocols rely on broadcasting fake packets from fake sources concurrently with the transmission of real packets from the real source nodes to obfuscate the adversaries. However, fake source packet routing protocols have demonstrated some performance limitations including high energy consumption, low packet delivery ratio (PDR), and long end-to-end delay (EED). In this study, two existing fake source packet routing protocols are considered. Then two new phantom-based SLP routing protocols are proposed to address the limitations. Each proposed protocol introduces a two-level phantom routing strategy to ensure two adversary confusion phases. When the adversaries perform traffic analysis attacks on the packet routes, they encounter two levels of obfuscation. Simulation results establish that the proposed protocols have superior performance features. The protocols guarantee strong SLP protection throughout the WSN domain with controlled energy consumption, PDR, and EED. Furthermore, the proposed protocols achieve more practical results under varied network configurations.
18
Kuaban, Godlove Suila, Tülin Atmaca, Amira Kamli, Tadeusz Czachórski, and Piotr Czekalski. "Performance Analysis of Packet Aggregation Mechanisms and Their Applications in Access (e.g., IoT, 4G/5G), Core, and Data Centre Networks." Sensors 21, no. 11 (June 4, 2021): 3898. http://dx.doi.org/10.3390/s21113898.
Повний текст джерелаАнотація:
The transmission of massive amounts of small packets generated by access networks through high-speed Internet core networks to other access networks or cloud computing data centres has introduced several challenges such as poor throughput, underutilisation of network resources, and higher energy consumption. Therefore, it is essential to develop strategies to deal with these challenges. One of them is to aggregate smaller packets into a larger payload packet, and these groups of aggregated packets will share the same header, hence increasing throughput, improved resource utilisation, and reduction in energy consumption. This paper presents a review of packet aggregation applications in access networks (e.g., IoT and 4G/5G mobile networks), optical core networks, and cloud computing data centre networks. Then we propose new analytical models based on diffusion approximation for the evaluation of the performance of packet aggregation mechanisms. We demonstrate the use of measured traffic from real networks to evaluate the performance of packet aggregation mechanisms analytically. The use of diffusion approximation allows us to consider time-dependent queueing models with general interarrival and service time distributions. Therefore these models are more general than others presented till now.
19
Kvist, Fredrik, Andreas Ramstad Urke, and Knut Øvsthus. "Energy Efficient Determinism in WSN through Reverse Packet Elimination." Sensors 20, no. 10 (May 20, 2020): 2890. http://dx.doi.org/10.3390/s20102890.
Повний текст джерелаАнотація:
Recently, the industrial wireless sensor network (WSN) has gained attention as a complement to wired networks due to its flexibility and lower installation cost. We present a novel Reverse Packet Elimination (RPE) algorithm implementation at the IPv6 over the TSCH mode of IEEE 802.15.4e (6TiSCH) stack that increases reliability without significantly increasing energy consumption. RPE increases the reliability while conserving energy by transmitting a cancellation packet from the sink towards the sender to reduce unnecessary packets. The evaluation utilized mainly the 6TiSCH Simulator, with additional analytical assessments. We present several evaluation scenarios and compare WSN with and without RPE. In a WSN where each link had a packet reception rate of 70%, RPE increased the reliability with 11.8%. Furthermore, the average latency decreased with 39.1%. The average energy consumption increased with 19.8% when utilizing RPE. However, the network lifetime, i.e., the time before the first node experiences battery depletion increases slightly, which is a significant improvement compared to alternative replication mechanisms.
20
Bhattacharya, Partha Pratim, and Jyoti Saraswat. "An Energy Efficient Data Transfer Mechanism for Wireless Sensor Network." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 6, no. 3 (May 30, 2013): 359–69. http://dx.doi.org/10.24297/ijct.v6i3.4459.
Повний текст джерелаАнотація:
Wireless Sensor Networks (WSNs) are generally energy and resource constrained. In most WSN applications the traffic pattern is from sensor-to-sink and for effective utilization of available resources in network data aggregation is employed. If a data packet is lost due to node failure or collision the correlated information content by data packets is lost. Existing protocols that provide reliable data transfer for sensor-to-sink traffic are either not energy efficient or they provide reliability at the event level. Energy efficiency can be improved by employing proper duty cycle values. By extending the concept of monitors the proposed protocol provides packet level reliability and improves the energy efficiency by employing duty cycles. To further decrease the energy consumption only a subset of nodes is chosen as active nodes to transfer the data. The performance of the proposed protocol is evaluated using Matlab. Results show that protocol has significant improvement in terms of energy saving, throughput and packet delivery ratio.
21
Chen, Zhuangbin, Anfeng Liu, Zhetao Li, Young-June Choi, Hiroo Sekiya, and Jie Li. "Energy-Efficient Broadcasting Scheme for Smart Industrial Wireless Sensor Networks." Mobile Information Systems 2017 (2017): 1–17. http://dx.doi.org/10.1155/2017/7538190.
Повний текст джерелаАнотація:
In smart Industrial Wireless Sensor Networks (IWSNs), sensor nodes usually adopt a programmable technology. These smart devices can obtain new or special functions by reprogramming: they upgrade their soft systems through receiving new version of program codes. If sensor nodes need to be upgraded, the sink node will propagate program code packets to them through “one-to-many” broadcasting, and therefore new capabilities can be obtained, forming the so-called Software Defined Network (SDN). However, due to the high volume of code packet, the constraint energy of sensor node, and the unreliable link quality of wireless network, rapidly broadcasting the code packets to all nodes in network can be a challenge issue. In this paper, a novel Energy-efficient Broadcast scheme with adjustable broadcasting radius is proposed aiming to improve the performance of network upgrade. In our scheme, the nonhotspots sensor nodes take full advantage of their residual energy caused in data collection period to improve the packet reception probability and reduce the broadcasting delay of code packet transmission by enlarging the broadcasting radius, that is, the transmitting power. The theoretical analyses and experimental results show that, compared with previous work, our approach can averagely reduce the Network Upgrade Delay (NUD) by 14.8%–45.2% and simultaneously increase the reliability without harming the lifetime of network.
22
Bharti, Rajendra Kumar, Soundarajan S, Sushma V. Sumant, C. Anand Deva Durai, Relangi Anil Kumar, Kamlesh Singh, Hemant Palivela, B. Rajesh Kumar, and Baru Debtera. "Enhanced Path Routing with Buffer Allocation Method Using Coupling Node Selection Algorithm in MANET." Wireless Communications and Mobile Computing 2022 (July 18, 2022): 1–11. http://dx.doi.org/10.1155/2022/1955290.
Повний текст джерелаАнотація:
In a mobile network, nodes are placed in infrequent manner, which are moved along network in abruptly. Communication flaw between sender node and accepting node in path, the node having restricted energy and restricted transmission rate. It does not provide perfect route for communication among mobile nodes. It increases the packet drop rate and minimizes the lifetime of network. This work has proposed enhanced path routing with buffer allocation (IPBA) scheme which is implemented to obtain better communication; it protects the node from packet loss, and the buffer is used to maintain the temporary details of nodes and data packets that are ready to broadcast and receive. The coupling node selection algorithm is constructed to offer the path which frequently communicates data packets in normal case; the two efficient nodes are coupled with each other, and this type of nodes is selected to perform communication. It reduces the packet loss rate and increases network lifetime. End-to-end delay, communication overhead, throughput, network lifetime, packet loss, and energy consumption are the parameters considered for performance evaluations.
23
Kimura, Mitsutaka, Mitsuhiro Imaizumi, and Toshio Nakagawa. "Reliability Analysis of Window Flow Control Based on Packet Transmission Interval with ECN Considering Packet Loss." International Journal of Reliability, Quality and Safety Engineering 28, no. 01 (July 4, 2020): 2150001. http://dx.doi.org/10.1142/s0218539321500017.
Повний текст джерелаАнотація:
This paper discusses the reliability model of a window flow control scheme using High-performance and Flexible Protocol (HpFP) with Explicit Congestion Notification (ECN) considering packet loss. HpFP is an important techniques as congestion control scheme in a radio environment and video stream communication. HpFP has the character that throughput is adjusted by changing a packet transmission interval. We have already discussed some reliability models of a window flow control scheme based on a packet transmission interval. In these models, if some packets has failed at a first-time transmission, the packet transmission interval is prolonged. On the other hand, the server checks the state of network congestion by ECN bit. That is, if ECN bit has been set during connection, a packet transmission interval is also prolonged. We consider an extended stochastic model of a window flow control scheme based on a packet transmission interval with ECN considering packet loss. That is, the server checks ECN bit during connection and if the server detects the network congestion, the server executes congestion control that a packet transmission interval is prolonged. Thereafter, if a constant number of the retransmission has failed, or a constant number of packets has failed, the server checks it again. We derive the mean time until packet transmissions succeed, and discuss analytically a window size which maximizes the amount of packets per unit of mean transmission time.
24
Ding, Weichen, Wenbin Zhai, Liang Liu, Ying Gu, and Hang Gao. "Detection of Packet Dropping Attack Based on Evidence Fusion in IoT Networks." Security and Communication Networks 2022 (July 9, 2022): 1–14. http://dx.doi.org/10.1155/2022/1028251.
Повний текст джерелаАнотація:
Internet of Things (IoT) is widely used in environmental monitoring, smart healthcare, and other fields. Due to its distributed nature, IoT is vulnerable to various internal attacks. One of these attacks is the packet-dropping attack, which is very harmful. The existing packet-dropping attack detection algorithms are unsuitable for emerging resource-constrained IoT networks. For example, ML-based algorithms always inject numerous packets to obtain the training dataset. However, it is heavyweight for energy-limited nodes to forward these extra packets. In this paper, we propose a lightweight evidence fusion-based detection algorithm (EFDA), which leverages the packet forwarding evidence to identify malicious nodes. Firstly, EFDA finds the sequence numbers of dropped packets and their corresponding source nodes. Then, it traces the routing path of each dropped packet and collects evidence for detection. The evidence stored by nodes around the path record the node’s forwarding behaviors. Finally, the collected evidence is fused to evaluate the trust of nodes. Based on nodes’ trust, the K-means clustering is used to distinguish between malicious nodes and benign nodes. We conduct simulation experiments to compare EFDA with ML-based algorithms. The experimental results demonstrate that EFDA can detect the packet-dropping attack without injecting packets and achieve a higher detection accuracy.
25
Venu, Nookala, M. Revanesh, M. Supriya, Manjunath B. Talawar, A. Asha, Lydia D. Isaac, and Alachew Wubie Ferede. "Energy Auditing and Broken Path Identification for Routing in Large-Scale Mobile Networks Using Machine Learning." Wireless Communications and Mobile Computing 2022 (August 21, 2022): 1–12. http://dx.doi.org/10.1155/2022/9418172.
Повний текст джерелаАнотація:
In mobile computing, all nodes are movable nodes, which causes many problems for transmitting data packets in a sequence manner; since the mobile nodes are connected with each other, during movement, nodes make the connection fail or damaged. This kind of link damage is caused by nodes that travel out of range from the network limit and also affect the packet success rate. This reduces the network lifetime and detection efficiency and increases the communication overhead. Every mobile node in mobile computing is an unstable node, causing numerous problems for broadcasting data packets in a series method. When the mobile nodes are connected to each other, relay nodes cause the link to break or else sustain damage. This type of connection failure is brought on by nodes that leave the network’s permitted range, which also lowers the packet success rate. The link failure cannot be recovered by the multipath routing algorithm. As a result, the communication overhead is increased while the network lifetime and detection effectiveness are reduced. Then, the novel energy routing (NER) method that has been proposed is employed to support the energetic routing path across the middle nodes. It is challenging to locate the failed channels and carry on with the successful packet transfer. The master node selection algorithm is intended to identify the best relaying node, fault-free packet transmission process among the network structure’s relaying nodes. The master node is efficiently chosen in this manner. The master node, also known as the energy-based important node, is employed in the mobile network to carry out error-free packet transmission procedures. The other nodes are lower energy nodes that do not participate in packet forwarding, and this algorithm only detects the higher energy successful nodes. This lengthens the network’s lifespan, improves detection effectiveness, and lowers communication overhead. The energy-based heavy node is also known as the master node, which is used to perform a problem-free communication process in the mobile network. This algorithm only accepts the higher energy successful node; the remaining nodes are lower energy nodes which do not perform the communication process. This increases the network lifetime and detection efficiency and reduces the communication overhead. The performance metrics for the proposed system is evaluated by end to end delay, communication overhead, throughput, detection efficiency, network lifetime, and packet drop rate.
26
Bahmani, Elham, Aso Mohammad Darwesh Darwesh, Mojtaba Jamshidi, and Somaieh Bali. "A Restricted Multipath Routing Algorithm in Wireless Sensor Networks Using a Virtual Cylinder: Bypassing Black hole and Selective Forwarding Attacks." UHD Journal of Science and Technology 3, no. 2 (August 22, 2019): 51. http://dx.doi.org/10.21928/uhdjst.v3n2y2019.pp51-58.
Повний текст джерелаАнотація:
In this paper, a simple and novel routing algorithm is presented to improve the packet delivery in harsh conditions such as selective forwarding and blackhole attacks to the wireless sensor networks. The proposed algorithm is based on restricted multi-path broadcast based on a virtual cylinder from the source node to the sink node. In this algorithm, when a packet is broadcast by a source node, a virtual cylinder with radius w is created from the source node to a sink node. All the nodes located in this virtual cylinder are allowed to forwardthe packet to the sink. Thus, data is forwarded to sink via multiple paths, but in a restricted manner so that the nodes do not consume a high amount of energy. If there are some compromised nodes in this virtual cylinder, the packets may be forwarded to the sink via other nodes of the virtual cylinder. The proposed algorithm is simulated and evaluated in terms of packet delivery rate and energy consumption. The experiment results show that the proposed algorithm increases packet delivery rate 7 times compared to the single-path routing method and reduces energy consumption up to three times compared to flooding routing method.
27
Kadioglu, Yasin Murat. "FINITE CAPACITY ENERGY PACKET NETWORKS." Probability in the Engineering and Informational Sciences 31, no. 4 (April 19, 2017): 477–504. http://dx.doi.org/10.1017/s0269964817000080.
Повний текст джерелаАнотація:
This paper surveys research on mathematical models that predict the performance of digital devices that operate with intermittent energy sources. The approach taken in this work is based on the “Energy Packet Network” paradigm where the arrival of data to be processed or transmitted, and the energy to operate the system, are modeled as discrete random processes. Our assumption is that these devices will capture energy from intermittent ambient sources such as vibrations, heat or light, and capture it onto electrical energy that may be stored in batteries or capacitors. The devices consume this energy intermittently for processing and for wired or wireless transmission. Thus, both the arrival of energy to the device, and the devices workload, are modeled as random processes. Based on these assumptions, we discuss probability models based on Markov chains that can be used to predict the effective rates at which such devices operate. We also survey related work that models networks of such systems.
28
Ullah, Ubaid, Anwar Khan, Mahdi Zareei, Ihsan Ali, Hasan Ali Khattak, and Ikram Ud Din. "Energy-Effective Cooperative and Reliable Delivery Routing Protocols for Underwater Wireless Sensor Networks." Energies 12, no. 13 (July 9, 2019): 2630. http://dx.doi.org/10.3390/en12132630.
Повний текст джерелаАнотація:
Underwater deployed sensors nodes are energy-constrained. Therefore, energy efficiency becomes crucial in underwater wireless sensor networks (U-WSNs). The adverse channel corrupts the packets and challenges their reliability. To handle these challenges, two routing schemes are introduced in this paper. They are effective energy and reliable delivery (EERD) and cooperative effective energy and reliable delivery (CoEERD). In EERD, the packets follow single-path routing and the best forwarder node is selected using a weight function such that packets are transferred via the reliable paths with low energy usage. Packet transfer via a single route in EERD has, however, compromised reliability as the undersea links bear harshness and unpredictability. Therefore, the CoEERD scheme adds cooperative routing to EERD, in which a relay node is introduced between a source–destination pair. The destination requests the relay when the packets it gets from the source are corrupted beyond a threshold value. Selection of weight function is unique and considers many factors to ensure low energy usage with reliability while considering nodes for data transfer. This also helps in selecting a single relay node rather than many relays in the conventional cooperative routing model. Based on simulation results, the EERD and CoEERD protocols have improved performance in energy usage, reliable packet transfer and delay.
29
R., Sridhar, and N. Guruprasad. "Energy efficient chaotic whale optimization technique for data gathering in wireless sensor network." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 4 (August 1, 2020): 4176. http://dx.doi.org/10.11591/ijece.v10i4.pp4176-4188.
Повний текст джерелаАнотація:
A Wireless Sensor Network includes the distributed sensor nodes using limited energy, to monitor the physical environments and forward to the sink node. Energy is the major resource in WSN for increasing the network lifetime. Several works have been done in this field but the energy efficient data gathering is still not improved. In order to amend the data gathering with minimal energy consumption, an efficient technique called chaotic whale metaheuristic energy optimized data gathering (CWMEODG) is introduced. The mathematical model called Chaotic tent map is applied to the parameters used in the CWMEODG technique for finding the global optimum solution and fast convergence rate. Simulation of the proposed CWMEODG technique is performed with different parameters such as energy consumption, data packet delivery ratio, data packet loss ratio and delay with deference to dedicated quantity of sensor nodes and number of packets. The consequences discussion shows that the CWMEODG technique progresses the data gathering and network lifetime with minimum delay as well as packet loss than the state-of-the-art methods.
30
Ashok Babu, P., L. Kavisankar, Jasmine Xavier, V. Senthilkumar, Gokul Kumar, T. Kavitha, A. Rajendran, G. Harikrishnan, A. Rajaram, and Amsalu Gosu Adigo. "Selfish Node Detection for Effective Data Transmission Using Modified Incentive Sorted Pathway Selection in Wireless Sensor Networks." Wireless Communications and Mobile Computing 2022 (February 18, 2022): 1–11. http://dx.doi.org/10.1155/2022/9359135.
Повний текст джерелаАнотація:
Wireless nodes have time-varying behavior in their nature because the energy usage of each node is not being constant. Packet transmission among cluster nodes gets overloaded when multi-input and multioutput is made; multitask is performed causing more energy usage; also, selfish node could not transfer the data packet to the target node. Selfish nodes need to hide some important data and then only transmit normal data that try to misuse those data, so packet delivery rate is reduced. This normal method does not identify selfish nodes in the routing path. Proposed Incentive Sorted Path Selection Scheme (ISPSS), the progressively stable algorithm, enables the identification of such selfish nodes. The results confirm the enhancement in the lifetime of the network, the energy efficiency, and the delivery rates of the packets with reduced end-to-end delay.
31
Nasir, Husna Jamal Abdul, Ku Ruhana Ku-Mahamud, and Eiji Kamioka. "Energy Efficient Ant Colony System for Packet Routing in Wireless Sensor Network." Journal of Physics: Conference Series 2312, no. 1 (August 1, 2022): 012003. http://dx.doi.org/10.1088/1742-6596/2312/1/012003.
Повний текст джерелаАнотація:
Abstract Routing packets in Wireless Sensor Network (WSN) is challenging due to the distribution of sensor nodes with different ability. Inefficient routing may lead to higher failure rate, higher latency and higher energy consumption. One of the common approaches to solve this problem is by using bio-inspired routing algorithms due to their abilities to adapt with dynamic environment. This paper proposed an improved ant colony system for packing routing in WSN that focuses on exploration and exploitation techniques. In the proposed routing algorithm, the best path to be used for packet transmission will be determined by considering the remaining energy of each sensor node to reduce the hotspot problem. Local pheromone update and global pheromone update are used with the aim to prevent imbalanced energy depletion of sensor nodes and to balance the packet distribution. The proposed routing algorithm was validated against several bio-inspired routing algorithms in medium and large sized networks. The results suggested that it has outperformed in terms of success rate, packet loss rate, latency and energy efficiency.
32
TAKEUCHI, YOSHIHIRO, YUICHI TAZAKI, S. Y. TSAI, and TAKASHI YAMAZAKI. "WAVE PACKET APPROACH TO THE EQUAL-ENERGY/MOMENTUM/VELOCITY PRESCRIPTIONS OF NEUTRINO OSCILLATION." Modern Physics Letters A 14, no. 33 (October 30, 1999): 2329–39. http://dx.doi.org/10.1142/s0217732399002418.
Повний текст джерелаАнотація:
Neutrino oscillation is discussed with emphasis placed more on its conceptual aspects. After reviewing the two conventional formulations, referred to as the equal-energy prescription and the equal-momentum prescription, wave packet treatments are developed for each of these two prescriptions. Both wave packets localized in space and those localized in time are considered, and, by invoking relativistic kinematics as well, the necessary conditions for oscillation to occur are derived, which appear to have a form more well-defined and quantitative than what have been noted before. Some phenomenological implications suggested by the wave packet treatments are briefly mentioned. Finally, as a possible third prescription, the equal-velocity prescription is given.
33
Lu, Yongjie, Rongxi He, Xiaojing Chen, Bin Lin, and Cunqian Yu. "Energy-Efficient Depth-Based Opportunistic Routing with Q-Learning for Underwater Wireless Sensor Networks." Sensors 20, no. 4 (February 14, 2020): 1025. http://dx.doi.org/10.3390/s20041025.
Повний текст джерелаАнотація:
Underwater Wireless Sensor Networks (UWSNs) have aroused increasing interest of many researchers in industry, military, commerce and academe recently. Due to the harsh underwater environment, energy efficiency is a significant theme should be considered for routing in UWSNs. Underwater positioning is also a particularly tricky task since the high attenuation of radio-frequency signals in UWSNs. In this paper, we propose an energy-efficient depth-based opportunistic routing algorithm with Q-learning (EDORQ) for UWSNs to guarantee the energy-saving and reliable data transmission. It combines the respective advantages of Q-learning technique and opportunistic routing (OR) algorithm without the full-dimensional location information to improve the network performance in terms of energy consumption, average network overhead and packet delivery ratio. In EDORQ, the void detection factor, residual energy and depth information of candidate nodes are jointly considered when defining the Q-value function, which contributes to proactively detecting void nodes in advance, meanwhile, reducing energy consumption. In addition, a simple and scalable void node recovery mode is proposed for the selection of candidate set so as to rescue packets that are stuck in void nodes unfortunately. Furthermore, we design a novel method to set the holding time for the schedule of packet forwarding base on Q-value so as to alleviate the packet collision and redundant transmission. We conduct extensive simulations to evaluate the performance of our proposed algorithm and compare it with other three routing algorithms on Aqua-sim platform (NS2). The results show that the proposed algorithm significantly improve the performance in terms of energy efficiency, packet delivery ratio and average network overhead without sacrificing too much average packet delay.
34
Nawaz Jadoon, Rab, WuYang Zhou, Iftikhar Ahmed Khan, Muhammad Amir Khan, and Waqas Jadoon. "EEHRT: Energy Efficient Technique for Handling Redundant Traffic in Zone-Based Routing for Wireless Sensor Networks." Wireless Communications and Mobile Computing 2019 (May 6, 2019): 1–12. http://dx.doi.org/10.1155/2019/7502140.
Повний текст джерелаАнотація:
This paper presents an energy-efficient technique to handle redundant traffic (EEHRT) in the zone-based routing for wireless sensor networks. In this technique, multihop routing is performed based on the remaining energy of the nodes. Afterwards, it performs position-based routing without the need for the nodes to know their respective position. The main objective of this paper is to handle the redundant packets generated in zone-based routing using short beacon messages. Nodes of lower zones route the data of the higher zone to base station (BS) with a minimum number of hops and utilize only those nodes on the path which are energy efficient and located closer to BS. Moreover, the source node is acknowledged by the relaying node using a wireless broadcast advantage (WBA) without sending any special ACK packet to the sender, which reduces the control overhead in the routing process. The EEHRT technique improves the routing against RARZ by ensuring only one copy of the packet is propagated at each hop along the routing path to BS. Simulation results show that EEHRT achieved 28% improvement in energy efficiency, 10% and 25% improvements in data throughput against total and distinct packet reception at BS respectively, 35% increase in overall network lifetime, and 100% reduction in redundant packets generation and propagation in the network against RARZ routing.
35
S M, Benakappa, and Kiran M. "Energy Aware Stable Multipath Disjoint Routing Based on Accumulated Trust Value in MANETs." International Journal of Computer Network and Information Security 14, no. 4 (August 8, 2022): 14–26. http://dx.doi.org/10.5815/ijcnis.2022.04.02.
Повний текст джерелаАнотація:
Conserving energy and finding the stable path are the two vital issues in Mobile Ad Hoc Networks (MANETs) as the prior increases the network lifetime and the later increases the network throughput. The nodes which are not legitimate in terms of residual energy and packet forwarding history might be a threat to the path thereby making the path unstable. Thus, it results in frequent link failure, reduced throughput, reduced network and path life time. In order to reduce these hazards, authors have proposed an energy efficient, reliable path selecting protocol referred to as Trust Based Energy Aware Multipath Disjoint Routing Protocol (TEA-MDRP) for MANETS in this article. TEA-MDRP finds the optimum route between the source and the destination nodes using two parameters namely, the Accumulated Trust Value (ATV) and the node’s residual energy (N_res). ATV is calculated based on the packet forwarding status of the node which shows how good the node is in terms of packet forwarding point of view. TEA-MDRP allows only the nodes which have a good ATV and sufficient residual energy. A good ATV shows loyalty in forwarding the packets while a sufficiently large residual energy node avoids frequent path breakups and packet drops. Thus, the TEA-MDRP not only increases the network and path lifetime but also increases the throughput of the communication. Further, with the legitimate nodes in the paths, the TEA-MDRP considerably reduces the control packet overhead which might occur because of the frequent route re-discovery process. An extensive simulation is carried out using Network Simulator-2.35 for the quantitative and qualitative analysis of TEA-MDRP. The results obtained are compared with classical AOMDV and the results are satisfactory.
36
Darif, Anouar, and Rachid Fateh. "Non-line-of-sight outdoor channel identifcation for wireless sensor networks based on impluse radio ultra wide band." Indonesian Journal of Electrical Engineering and Computer Science 28, no. 1 (October 1, 2022): 441. http://dx.doi.org/10.11591/ijeecs.v28.i1.pp441-449.
Повний текст джерелаАнотація:
Wireless sensor networks (WSN) have become increasingly popular in a variety of fields in recent years. This is due to the development of their capabilities, which include remote environmental monitoring, process automation, telemedicine, and many other domains. Besides, among the widely used modern WSN radio technologies, we find impluse radio ultra wide band (IR-UWB) that is recognized by their advantages regarding low power consumption, low cost, low complexity and high resistance to multipath fading in outdoor wireless networks. Energy consumption minimization, packet delivery ratio improvement and latency minimization are the main objectives in this work. The chosen performance metrics (energy consumption, packet delivery ratio and latency) are justified by the direct impact of these three parameters on the network’s efficiency. Accordingly, we proposed and introduced an outdoor non-line-of-sight (NLOS) packet delivery ratio using broadband radio access network (BRAN) channel to improve WSN’s based on IR-UWB performance in terms of energy consumption, packets delivery ratio (PDR) and latency.
37
Shi, Liwei, and Zhou Bo. "Rectifier Fault Diagnosis and Fault Tolerance of a Doubly Fed Brushless Starter Generator." Journal of Sensors 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/961894.
Повний текст джерелаАнотація:
This paper presents a rectifier fault diagnosis method with wavelet packet analysis to improve the fault tolerant four-phase doubly fed brushless starter generator (DFBLSG) system reliability. The system components and fault tolerant principle of the high reliable DFBLSG are given. And the common fault of the rectifier is analyzed. The process of wavelet packet transforms fault detection/identification algorithm is introduced in detail. The fault tolerant performance and output voltage experiments were done to gather the energy characteristics with a voltage sensor. The signal is analyzed with 5-layer wavelet packets, and the energy eigenvalue of each frequency band is obtained. Meanwhile, the energy-eigenvalue tolerance was introduced to improve the diagnostic accuracy. With the wavelet packet fault diagnosis, the fault tolerant four-phase DFBLSG can detect the usual open-circuit fault and operate in the fault tolerant mode if there is a fault. The results indicate that the fault analysis techniques in this paper are accurate and effective.
38
Lusweti, Samuel, Collins Odoyo, and Dorothy Rambim. "An Enhanced Bio-Inspired Aco Model For Fault-Tolerant Networks." Buana Information Technology and Computer Sciences (BIT and CS) 4, no. 1 (January 14, 2023): 11–18. http://dx.doi.org/10.36805/bit-cs.v4i1.3040.
Повний текст джерелаАнотація:
This research mainly aimed at establishing the current functionality of computer network systems, evaluating the causes of network faults, and developing an enhanced model based on the existing ACO model to help solve these network issues. The new model developed suggests ways of solving packet looping and traffic problems in common networks that use standard switches. The researcher used simulation as a method of carrying out this research whereby an enhanced algorithm was developed and used to monitor and control the flow of packets over the computer network. The researcher used an experimental research design that involved the development of a computer model and collecting data from the model. The traffic of packets was monitored by the Cisco Packet Tracer tool in which a network of four computers was created and used to simulate a real network system. Data collected from the simulated network was analyzed using the ping tool, observation of the movement of packets in the network and message delivery status displayed by the Cisco Packet Tracer. In the experiment, a control was used to show the behavior of the network in ideal conditions without varying any parameters. Here, all the packets sent were completely and correctly received. Secondly, when a loop was introduced in the network it was found that the network was adversely affected because for all packets sent by the computers on the network, none of them was delivered due to stagnation of packets. In the third experiment, still, with the loops on, a new ACO model was introduced in the cisco packet tracer used to simulate the network. In this experiment, all the packets sent were completely and correctly delivered just like in the control experiment.
39
Yadav, Saneh Lata, R. L. Ujjwal, Sushil Kumar, Omprakash Kaiwartya, Manoj Kumar, and Pankaj Kumar Kashyap. "Traffic and Energy Aware Optimization for Congestion Control in Next Generation Wireless Sensor Networks." Journal of Sensors 2021 (June 28, 2021): 1–16. http://dx.doi.org/10.1155/2021/5575802.
Повний текст джерелаАнотація:
Congestion in wireless sensor networks (WSNs) is an unavoidable issue in today’s scenario, where data traffic increased to its aggregated capacity of the channel. The consequence of this turns in to overflowing of the buffer at each receiving sensor nodes which ultimately drops the packets, reduces the packet delivery ratio, and degrades throughput of the network, since retransmission of every unacknowledged packet is not an optimized solution in terms of energy for resource-restricted sensor nodes. Routing is one of the most preferred approaches for minimizing the energy consumption of nodes and enhancing the throughput in WSNs, since the routing problem has been proved to be an NP-hard and it has been realized that a heuristic-based approach provides better performance than their traditional counterparts. To tackle all the mentioned issues, this paper proposes an efficient congestion avoidance approach using Huffman coding algorithm and ant colony optimization (ECA-HA) to improve the network performance. This approach is a combination of traffic-oriented and resource-oriented optimization. Specially, ant colony optimization has been employed to find multiple congestion-free alternate paths. The forward ant constructs multiple congestion-free paths from source to sink node, and backward ant ensures about the successful creation of paths moving from sink to source node, considering energy of the link, packet loss rate, and congestion level. Huffman coding considers the packet loss rate on different alternate paths discovered by ant colony optimization for selection of an optimal path. Finally, the simulation result presents that the proposed approach outperforms the state of the art approaches in terms of average energy consumption, delay, and throughput and packet delivery ratio.
40
Nassiri, Mohammad, Mehri Karimi, Reza Mohammadi, and Mehdi Abbasi. "EEARP - an Efficient and Energy Aware Routing Protocol for Underwater Wireless Sensor Networks." ECTI Transactions on Electrical Engineering, Electronics, and Communications 18, no. 2 (August 31, 2020): 145–57. http://dx.doi.org/10.37936/ecti-eec.2020182.222642.
Повний текст джерелаАнотація:
Recently, Underwater Wireless Sensor Networks (UWSNs) have attracted significant attention from both academia and industry to explore the vast underwater environment. Since UWSNs suffer from long propagation delay, low bandwidth, and high error rate, providing an efficient routing protocol is challenging. This paper proposes EEARP, a series of new routing protocols for underwater networks to improve the performance of existing DBR. The DBR does not consider energy. It only receives data packets from upper depth node and forwards the packets to lower depth nodes. Moreover, this greedy behavior of DBR causes void area problem. EEARP creates a directed acyclic graph rooted at a sink. Each node receives information like depth, energy, and the number of parents from its parents. When forwarding, each node sends a data packet to one or more of its parent nodes. We implemented EEARP in NS2 simulator and evaluated its performance under different scenarios. Results confirm that EEARP outperforms DBR in terms of energy saving, network lifetime, end-to-end delay and packet loss ratio.
41
Kim, Dae-Young, Zilong Jin, Jungwook Choi, Ben Lee, and Jinsung Cho. "Transmission Power Control with the Guaranteed Communication Reliability in WSN." International Journal of Distributed Sensor Networks 2015 (2015): 1–12. http://dx.doi.org/10.1155/2015/632590.
Повний текст джерелаАнотація:
In a wireless sensor network, sensor nodes are deployed in an ad hoc fashion and they deliver data packets using multihop transmission. However, transmission failures occur frequently in the multihop transmission over wireless media. Thus, a loss recovery mechanism is required to provide end-to-end reliability. In addition, because the sensor nodes are very small devices and have insufficient resources, energy-efficient data transmission is crucial for prolonging the lifetime of a wireless sensor network. This paper proposes a transmission power control mechanism for reliable data transmission, which satisfies communication reliability through recovery of lost packets. The proposed method calculates packet reception rate (PRR) of each hop to maintain end-to-end packet delivery rate (PDR), which is determined based on the desired communication reliability. Then, the transmission power is adjusted based on the PRR to reduce energy consumption. The proposed method was evaluated through extensive simulations, and the results show that it leads to more energy-efficient data transmission compared to existing methods.
42
Murali Krishna, M., and S. Sivasakthiselvan. "Enhanced Communication in Void Region of Underwater Wireless Sensor Network using Vector-Based Void Avoidance Comparing with Void Aware Pressure Routing Protocol." Journal of Physics: Conference Series 2222, no. 1 (May 1, 2022): 012004. http://dx.doi.org/10.1088/1742-6596/2222/1/012004.
Повний текст джерелаАнотація:
Abstract The aim of the proposed work is to improve the energy efficiency of sensor nodes in underwater wireless sensor networks using Vector-based void avoidance (VBVA) in comparison with void-aware pressure routing (VAPR). The performance of vector-based void avoidance uses the vector shift and backpressure mechanisms compared with the void-aware pressure routing protocol. A total of 34 samples are collected and 17 samples for each group is taken to the data sets. The proposed algorithm is tested in an underwater virtual environment by Aquasim in the NS2 simulator. The throughput, energy consumption, and packet delivery ratio are calculated to evaluate the performance of the proposed VBVA Protocol. The energy efficiency of the proposed vector-based void avoidance protocol is improved by avoids of void nodes and forward data packets. The Throughput mean value is (1.3297), Energy consumption mean value is (0.9960) and Packet delivery ratio mean value is (91.1735) achieved using VBVA protocol. This work has obtained significance (<0.01). The simulation results show that reduction of packet loss and improve the energy efficiency of the sensor network using the proposed VBVA algorithm in comparison with VAPR.
43
Bandani, Anil Kumar, Makam Venkata Subramanyam, and Kodati Satya Prasad. "An Innovative Prediction of Link Failure and Node Lifetime in Mobile Ad Hoc Networks Using Grey Wolf Optimization." Journal of Hunan University Natural Sciences 49, no. 9 (September 30, 2022): 118–28. http://dx.doi.org/10.55463/issn.1674-2974.49.9.13.
Повний текст джерелаАнотація:
The Path Restoration System in Mobile Ad hoc Network (MANET) was tough due to the changing environment. Data packets are lost if a link is broken while delivering information, and the system is vulnerable to various assaults. Considering this, we propose the Grey Wolf Optimization technique (GWO) to predict connection failure, link and node lifetime before broadcasting packets to avoid packet loss. To define the path, we used the Route Information Protocol (RIP). Following that, GWO is manually played; with this method, this research forecasts the node and lifetime, and achieves a packet delivery ratio of 0.7. The proposed Gray-Wolf algorithm achieves an efficient packet transmission rate and improves the early detection of links and node lifetimes to maintain path stability for data transmission. The proposed model reduces end-to-end delay, overhead, and packet drop. It improves the residual energy of nodes and the packet delivery ratio. Grey Wolf Optimization is one of many examining boosting methods activated by the grouping within the wolf family and the special hunting techniques used by grey wolves. As a result, the Grey Wolf optimization method was used to find the optimal result by mocking the overall characteristics of the grey wolf colony.
44
Oyakhire, Omuwa, and Koichi Gyoda. "Improved Proactive Routing Protocol Considering Node Density Using Game Theory in Dense Networks." Future Internet 12, no. 3 (March 9, 2020): 47. http://dx.doi.org/10.3390/fi12030047.
Повний текст джерелаАнотація:
In mobile ad hoc networks, network nodes cooperate by packet forwarding from the source to the destination. As the networks become denser, more control packets are forwarded, thus consuming more bandwidth and may cause packet loss. Recently, game theory has been applied to address several problems in mobile ad hoc networks like energy efficiency. In this paper, we apply game theory to reduce the control packets in dense networks. We choose a proactive routing protocol, Optimized Link State Routing (OLSR) protocol. We consider two strategies in this method: willingness_always and willingness_never to reduce the multipoint relay (MPR) ratio in dense networks. Thus, nodes with less influence on other nodes are excluded from nomination as MPRs. Simulations were used to confirm the efficiency of using our improved method. The results show that the MPR ratio was significantly reduced, and packet delivery ratio was increased compared to the conventional protocol.
45
Sultania, Ashish Kumar, Carmen Delgado, and Jeroen Famaey. "Enabling Low-Latency Bluetooth Low Energy on Energy Harvesting Batteryless Devices Using Wake-Up Radios." Sensors 20, no. 18 (September 12, 2020): 5196. http://dx.doi.org/10.3390/s20185196.
Повний текст джерелаАнотація:
With the growth of the number of IoT devices, the need for changing batteries is becoming cumbersome and has a significant environmental impact. Therefore, batteryless and maintenance-free IoT solutions have emerged, where energy is harvested from the ambient environment. Energy harvesting is relevant mainly for the devices that have a low energy consumption in the range of thousands of micro-watts. Bluetooth Low Energy (BLE) is one of the most popular technologies and is highly suitable for such batteryless energy harvesting devices. Specifically, the BLE friendship feature allows a Low Power Node (LPN) to sleep most of the time. An associated friend node (FN) temporarily stores the LPN’s incoming data packets. The LPN wakes up and polls periodically to its FN retrieving the stored data. Unfortunately, the LPNs typically experience high downlink (DL) latency. To resolve the latency issue, we propose combining the batteryless LPN with a secondary ultra-low-power wake-up radio (WuR), which enables it to always listen for an incoming wake-up signal (WuS). The WuR allows the FN to notify the LPN when new DL data is available by sending a WuS. This removes the need for frequent polling by the LPN, and thus saves the little valuable energy available to the batteryless LPN. In this article, we compare the standard BLE duty-cycle based polling and WuR-based data communication between an FN and a batteryless energy-harvesting LPN. This study allows optimising the LPN configuration (such as capacitor size, polling interval) based on the packet arrival rate, desired packet delivery ratio and DL latency at different harvesting powers. The result shows that WuR-based communication performs best for high harvesting power (400 μW and above) and supports Poisson packet arrival rates as low as 1 s with maximum PDR using a capacitor of 50 mF or more.
46
Kim, Sunyong, Chiwoo Cho, Kyung-Joon Park, and Hyuk Lim. "Increasing network lifetime using data compression in wireless sensor networks with energy harvesting." International Journal of Distributed Sensor Networks 13, no. 1 (January 2017): 155014771668968. http://dx.doi.org/10.1177/1550147716689682.
Повний текст джерелаАнотація:
In wireless sensor networks powered by battery-limited energy harvesting, sensor nodes that have relatively more energy can help other sensor nodes reduce their energy consumption by compressing the sensing data packets in order to consequently extend the network lifetime. In this article, we consider a data compression technique that can shorten the data packet itself to reduce the energies consumed for packet transmission and reception and to eventually increase the entire network lifetime. First, we present an energy consumption model, in which the energy consumption at each sensor node is derived. We then propose a data compression algorithm that determines the compression level at each sensor node to decrease the total energy consumption depending on the average energy level of neighboring sensor nodes while maximizing the lifetime of multihop wireless sensor networks with energy harvesting. Numerical simulations show that the proposed algorithm achieves a reduced average energy consumption while extending the entire network lifetime.
47
Best, R. W. B. "The energy of a wave packet." Plasma Physics and Controlled Fusion 27, no. 6 (June 1, 1985): 691–707. http://dx.doi.org/10.1088/0741-3335/27/6/005.
Повний текст джерела
48
Shahariar, Rezvi, Abu Naser, and Riham Morsed. "Avoiding Low Energy Routing Node in MANET Based on Critical Energy Level." Dhaka University Journal of Science 64, no. 1 (June 28, 2016): 39–44. http://dx.doi.org/10.3329/dujs.v64i1.28522.
Повний текст джерелаАнотація:
Mobile ad hoc network is a temporary wireless network consisting of mobile nodes. Frequent route breakage is a common event in Every node is equipped with battery energy. This form of energy is one of the scarce resources in MANET. This paper is focused on promiscuous mode to observe packets coming from the nodes within a direct transmission range. At the same time critical energy of a routing node is used to find the low energy node on an ongoing route. This low energy node will perform local route repairing scheme such as QLR-APM to find alternate node of low energy node which avoids route breakage in MANET. This approach prevents route breakage and the same time packet loss and retransmission of packets are reduced in MANET. Thus it is easily seen that QLR-APM incorporating this proposed approach outperforms than QLR-APM.Dhaka Univ. J. Sci. 64(1): 39-44, 2016 (January)
49
Bandani, Anil Kumar, Subramanyam Makam Venkata, and Satya Prasad Kodati. "Energy Management in Mobile Ad Hoc Networks with Innovative Protocol TDQR CNFPQR and Bird Optimization Technique." Journal of Hunan University Natural Sciences 49, no. 9 (September 30, 2022): 24–34. http://dx.doi.org/10.55463/issn.1674-2974.49.9.4.
Повний текст джерелаАнотація:
It is impossible to stress the importance of a Dynamic Wireless Ad Hoc Network (MANET) for message path dependability and permanence. Data sharing is a vital activity in a mobile ad hoc network because packet loss occurs when nodes fail or are missing during data transfer. When a packet is lost, it can be subject to various infractions. To overcome this problem, a new algorithm was created known as TDQR CNFPQR (Trigger-Based Distributed QoS Clustered Node Failure Prediction QoS) Protocol. The MBO method analyses node state to minimize packet losses. In comparison to existing methodologies, our suggested methodology uses less energy, delivers more packets, and has a lower routing burden and higher end-to-end latency. Mobile station users can receive stationary network services offered via numerous jump links even if the network is not immediately available to them. Because wireless networks have limited route capacity, it is critical to react to user requests as rapidly as feasible. Because network nodes have limited energy resources, it is critical to spend as little energy as possible when transferring data across the network. Ad hoc wireless networks are hampered by limited battery power, making energy management a critical concern. Knowledge-based algorithm rule analyses the node's monitoring capabilities at the same time. We can then predict node failure, node longevity, and data exchange along the ideal path without packet loss using Migrating Birds Optimization (MBO).
50
Soni, Vaibhav, and Dheeresh K. Mallick. "A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAF." Journal of Computer Networks and Communications 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/527594.
Повний текст джерелаАнотація:
In wireless sensor networks, geographic adaptive fidelity (GAF) is one of the most popular energy-aware routing protocols. It conserves energy by identifying equivalence between sensors from a routing perspective and then turning off unnecessary sensors, while maintaining the connectivity of the network. Nevertheless, the traditional GAF still cannot reach the optimum energy usage since it needs more number of hops to transmit data packets to the sink. As a result, it also leads to higher packet delay. In this paper, we propose a modified version of GAF to minimize hop count for data routing, called two-level GAF (T-GAF). Furthermore, we use a generalized version of GAF called Diagonal-GAF (DGAF) where two diagonal adjacent grids can also directly communicate. It has an advantage of less overhead of coordinator election based on the residual energy of sensors. Analysis and simulation results show significant improvements of the proposed work comparing to traditional GAF in the aspect of total hop count, energy consumption, total distance covered by the data packet before reaching the sink, and packet delay. As a result, compared to traditional GAF, it needs 40% to 47% less hop count and consumes 27% to 35% less energy to extend the network lifetime.