"Energy Cost Calculations for Enhanced Power Efficient Gathering in Sensor Information Systems Algorithm with Mobile-Sink "

2021 ◽  
Vol 8 (1) ◽  
pp. 14-21
Author(s):  
"Mohammad Kh. R. Al-juaifari
Keyword(s):  
Information Systems ◽  
Network Performance ◽  
Data Transfer ◽  
Data Gathering ◽  
Minimum Cost ◽  
Life Time ◽  
Mobile Sink ◽  
Power Efficient ◽  
Sensor Information ◽  
The Impact

"The issue of energy consumption in wireless sensor networks is an important issue nowadays, Power efficient gathering in sensor information systems (PEGASIS) acts as routing protocols improve the energy consumed, which is one of the most important hierarchical directives used and that works to collect and transfer data to and from a neighbor to reduce duplication of data transfer by transferring data to bypass the dead node. In this research paper, experimental results have been made to improve the performance with new location for nodes trajectory to mobile sink, Finally, minimum cost for data gathering calculated to optimize network performance and life time with parameters of enhanced PEGASIS criteria to show the impact of factors changing.

Bus Optimization for Low Power in High-Level Synthesis

2003 ◽  
Vol 12 (01) ◽  
pp. 1-17
Author(s):  
Sungpack Hong ◽  
Taewhan Kim
Keyword(s):  
Optimal Solution ◽  
Minimum Cost ◽  
Maximum Flow ◽  
High Level Synthesis ◽  
Benchmark Problems ◽  
Timing Constraints ◽  
Power Efficient ◽  
High Level ◽  
The Impact ◽  
Operation Scheduling

Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral level and the RT level of design. This paper addresses the problem of minimizing power dissipated in the switching of the buses in the high-level synthesis of data-dominated behavioral descriptions. Unlike the previous approaches in which the minimization of the power consumed in buses has not been considered until operation scheduling is completed, our approach integrates the bus binding problem into scheduling to exploit the impact of scheduling on the reduction of power dissipated on the buses more fully and effectively. We accomplish this by formulating the problem into a flow problem in a network, and devising an efficient algorithm which iteratively finds the maximum flow of minimum cost solutions in the network. Experimental results on a number of benchmark problems show that given resource and global timing constraints our designs are 19.8% power-efficient over the designs produced by a random-move based solution, and 15.5% power-efficient over the designs by a clock-step based optimal solution.

scholarly journals Researching the Impact of Parameters of the Developed Routing Models on Network Performance

2017 ◽  
Vol 4 (1) ◽  
pp. 61 ◽  
Author(s):  
Mohammad Alhihi ◽  
Hani Attar ◽  
Mohammad Samour ◽  
Artem Akulynichev
Keyword(s):  
Network Performance ◽  
Structural Model ◽  
Data Gathering ◽  
Oriented Graph ◽  
Telecommunication Networks ◽  
High Quality ◽  
Network Maintenance ◽  
Telecommunications Network ◽  
Routing Methods ◽  
The Impact

Nowadays, it is hard to imagine work without applying the principle of computer networks, and every day the requirement for high-quality network maintenance is increasing. In order to have a high-quality network; always optimize QoS through the optimization of routing protocols is required. In this paper, the scientific task of optimizing routing processes in hybrid telecommunication networks with guaranteed quality of service is solved by developing models and methods of adaptive routing. To develop methods, a system of Telecommunications network (TN) mathematical models was constructed at the levels of its morphological and functional descriptions. We used a weighted oriented graph as a structural model. Formalization of the main indicators of the network operation efficiency is carried out, which are the network performance (or its derivatives – relative and normalized performances) and indicators of the degree of use of network resources – buffer memory capacities of nodes and bandwidth of the transmission paths. In this paper, an experimental study of the developed models and routing methods was carried out in order to verify their adequacy, evaluate the effectiveness, and develop practical recommendations. The scheme of experiment, focusing on the investigation of processes occurring in the network while solving routing tasks (data gathering, RT processing, distribution, and implementation), is proposed.

Relay Selection in Distributed Orthogonal Space-Time Block Coded Networks

2017 ◽  
Vol 27 (01) ◽  
pp. 1850011
Author(s):  
Dokhyl M. Al-Qahtani ◽  
Abdulhameed M. Al-Sanie
Keyword(s):  
Relay Selection ◽  
Signal To Noise Ratio ◽  
Life Time ◽  
Space Time ◽  
Time Block ◽  
Power Efficient ◽  
Full Diversity ◽  
Orthogonal Space ◽  
The Impact ◽  
Relay Selection Algorithm

This paper examines the impact of relay selection on the performance of distributed orthogonal space-time block coding (D-OSTBC) in a wireless network. The relay selection algorithm is based on minimizing the pairwise error probability (PER) or equivalently maximizing the signal to noise ratio (SNR) at the receiver. The receiver can always find the optimal selected relay by exhaustive search where the number of relays rarely exceeds four. It is shown in this work that the proposed scheme achieves full diversity order and provides an additional array gain compared to conventional D-OSTBC. Our results show that the proposed scheme is more power efficient than the conventional D-OSTBC. Since 50% of the time the half of the relay is off, the proposed scheme increases the life time of the relay.

scholarly journals Enhanced PEGASIS using Dynamic Programming for Data Gathering in Wireless Sensor Network

2019 ◽  
Vol 7 (1) ◽  
pp. 176-199
Author(s):  
Mohammad Robihul Mufid ◽  
M. Udin Harun Al Rasyid ◽  
Iwan Syarif
Keyword(s):  
Dynamic Programming ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Data Transfer ◽  
Dominating Set ◽  
Data Gathering ◽  
Base Station ◽  
Wireless Sensor ◽  
Power Efficient ◽  
Adaptive Clustering

A number of routing protocol algorithms such as Low-Energy Adaptive Clustering Hierarchy (LEACH) and Power-Efficient Gathering in Sensor Information Systems (PEGASIS) have been proposed to overcome the problem of energy consumption in Wireless Sensor Network (WSN) technology. PEGASIS is a development of the LEACH protocol, where within PEGASIS all nodes are active during data transfer rounds thus limiting the lifetime of the WSN. This study aims to propose improvements from the previous PEGASIS version by giving the name Enhanced PEGASIS using Dynamic Programming (EPDP). EPDP uses the Dominating Set (DS) concept in selecting a subset of nodes to be activated and using dynamic programming based optimization in forming chains from each node. There are 2 topology nodes that we use, namely random and static. Then for the Base Station (BS), it will also be divided into several scenarios, namely the BS is placed outside the network, in the corner of the network, and in the middle of the network. Whereas to determine the performance between EPDP, PEGASIS and LEACH, an analysis of the number of die nodes, number of alive nodes, and remaining of energy were analyzed. From the experiment result, it was found that the EPDP protocol had better performance compared to the LEACH and PEGASIS protocols in terms of number of die nodes, number of alive nodes, and remaining of energy. Whereas the best BS placement is in the middle of the network and uses static node distribution topologies to save more energy.

Sign in / Sign up

Export Citation Format

Share Document