scholarly journals An Energy-Efficient Two-Stage Cooperative Routing Scheme in Wireless Multi-Hop Networks

Sensors ◽  
2019 ◽  
Vol 19 (5) ◽  
pp. 1002 ◽  
Author(s):  
Jianming Cheng ◽  
Yating Gao ◽  
Ningbo Zhang ◽  
Hongwen Yang
Keyword(s):  
Energy Efficiency ◽  
Network Lifetime ◽  
Cooperative Transmission ◽  
Transmission Model ◽  
Two Stage ◽  
Routing Scheme ◽  
Cooperative Routing ◽  
Link Cost ◽  
Simulation Results ◽  
End To End

Cooperative routing is one of the most widely used technologies for improving the energy efficiency and energy balance of wireless multi-hop networks. However, the end-to-end energy cost and network lifetime are greatly restricted if the cooperative transmission model is not designed properly. The main aim of this paper is to explore a two-stage cooperative routing scheme to further improve the energy efficiency and prolong the network lifetime. A two-stage cooperative (TSC) transmission model is firstly designed in which the core helper is introduced to determine the helper set for cooperation. Then, the two-stage link cost is formulated where x, the weight of residual energy, is introduced to be adjusted for different design goals. By selecting the optimal helper set, the two-stage link cost of each link can be optimized. Finally, based on the designed TSC transmission model and the optimized two-stage link cost, a distributed two-stage cooperative routing (TSCR) scheme is further proposed to minimize the end-to-end cooperative routing cost. Simulation results evaluate the effect of x on the different performance metrics. When x equals 0, TSCR can achieve the shortest end-to-end transmission delay and highest energy efficiency, while a larger x can achieve a longer network lifetime. Furthermore, simulation results also show that the proposed TSCR scheme can effectively improve both the energy efficiency and network lifetime compared with the existing schemes.

scholarly journals Mitigation of packet loss with end-to-end delay in wireless body area network applications

2022 ◽  
Vol 12 (1) ◽  
pp. 460
Author(s):  
Suha Sahib Oleiwi ◽  
Ghassan N. Mohammed ◽  
Israa Al_Barazanchi
Keyword(s):  
Network Lifetime ◽  
Routing Protocol ◽  
Packet Loss ◽  
Wireless Body Area Network ◽  
Body Area Network ◽  
Area Network ◽  
Body Area ◽  
Cooperative Routing ◽  
End To End Delay ◽  
End To End

The wireless body area network (WBAN) has been proposed to offer a solution to the problem of population ageing, shortage in medical facilities and different chronic diseases. The development of this technology has been further fueled by the demand for real-time application for monitoring these cases in networks. The integrity of communication is constrained by the loss of packets during communication affecting the reliability of WBAN. Mitigating the loss of packets and ensuring the performance of the network is a challenging task that has sparked numerous studies over the years. The WBAN technology as a problem of reducing network lifetime; thus, in this paper, we utilize cooperative routing protocol (CRP) to improve package delivery via end-to-end latency and increase the length of the network lifetime. The end-to-end latency was used as a metric to determine the significance of CRP in WBAN routing protocols. The CRP increased the rate of transmission of packets to the sink and mitigate packet loss. The proposed solution has shown that the end-to-end delay in the WBAN is considerably reduced by applying the cooperative routing protocol. The CRP technique attained a delivery ratio of 0.8176 compared to 0.8118 when transmitting packets in WBAN.

scholarly journals Routing of emergency data in a wireless sensor network for mining applications

2021 ◽  
Author(s):  
Mandana Jafarian
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Residual Energy ◽  
Mesh Network ◽  
Wireless Sensor ◽  
End To End Delay ◽  
Simulation Results ◽  
End To End

Emergency situations in mines result in loss of precious human lives. In this thesis we discussed architecture of a Wireless Sensor Network (WSN) that can be deployed in mines, which takes care of severe geographical and environmental constraints found inside mines. The proposed architecture is a two-level hierarchy of small sized WSNs that employs a wireless Mesh network as the backbone connecting small sized WSNs scattered inside mines. We proposed a routing protocol for that WSN that is optimized for both emergency and non-emergency data routing. Since our main goal is to provide safety in the mining environment, the main consideration of the routing protocol is to provide reliability and reduce the end-to-end delay for vital emergency traffic while optimizing for network longevity for non-emergency traffic. We present a new cost-based routing protocol called MDML, which provides Minimum Delay and Maximum Lifetime routing for such networks. The proposed MDML routing defines separate cost metrics for emergency and non-emergency traffic. It finds the least-cost path for the reliable delay-constrained emergency traffic with regards to link error rate but also gives secondary consideration to nodes' residual energy. It is an energy efficient routing scheme for non-emergency or regular data traffic routing that maximizes the network lifetime. However, for emergency traffic energy efficiency is compromised to achieving minimal delay. Regular traffic is generated through periodic monitoring and is delay-insensitive. For regular traffic delivery, a shortest path routinig algorithm is employed which uses link costs that reflect both the communication energy consumption rates and the residual energy levels at the two end nodes. Simulation results show that using the proposed emergency routes reduces the end-to-end delay for emergency traffic. The effect of protocol update cycle on increasing the network lifetime is verified true simulation. MDML is also compared with a simulated non-MDML approach to compare the lifetime and delay performance. Simulation results have demonstrated the effectiveness of our approach.

scholarly journals An Opportunistic Cooperative Packet Transmission Scheme in Wireless Multi-Hop Networks

Sensors ◽  
2019 ◽  
Vol 19 (21) ◽  
pp. 4821 ◽  
Author(s):  
Yating Gao ◽  
Guixia Kang ◽  
Jianming Cheng
Keyword(s):  
Cooperative Communication ◽  
Opportunistic Routing ◽  
Packet Transmission ◽  
Cooperative Transmission ◽  
Transmit Beamforming ◽  
Routing Schemes ◽  
Cooperative Routing ◽  
Transmission Distance ◽  
Multiple Receivers ◽  
End To End

Cooperative routing, combining cooperative communication in the physical layer and routing technology in the network layer, is one of the most widely used technologies for improving end-to-end transmission reliability and delay in the wireless multi-hop networks. However, the existing cooperative routing schemes are designed based on an optimal fixed-path routing so that the end-to-end performance is greatly restricted by the low spatial efficiency. To address this problem, in this paper an opportunistic cooperative packet transmission (OCPT) scheme is explored by combining cooperative communication and opportunistic routing. The proposed scheme divides the multi-hop route into multiple virtual multiple-input-multiple-output (MIMO) transmissions. Before each transmission, based on the idea of opportunistic routing, a cluster head (CH) is introduced to determine the multiple transmitters and multiple receivers to form a cluster. Then, the single-hop transmission distance is defined as the metric of forward progress to the destination. Each intra-cluster cooperative packet transmission is formulated as a transmit beamforming optimization problem, and an iterative optimal beamforming policy is proposed to solve the problem and maximize the single-hop transmission distance. CH organizes multiple transmitters to cooperatively transmit packets to multiple receivers with the optimized transmit beamforming vector. Finally, according to the transmission results, the cluster is updated and the new cooperative transmission is started. Iteratively, the transmission lasts until the destination has successfully received the packet. We comprehensively evaluate the OCPT scheme by comparing it with conventional routing schemes. The simulation results demonstrate that the proposed OCPT scheme is effective on shortening the end-to-end transmission delay, increasing the number of successful packet transmissions and improving the packet arrival ratio and transmission efficiency.

scholarly journals Performance Evaluation of Zone-Based Routing with Hierarchical Routing in Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-10
Author(s):  
Rab Nawaz Jadoon ◽  
WuYang Zhou ◽  
Iftikhar Ahmed Khan ◽  
Muhammad Amir Khan ◽  
Shahbaz Akhtar Abid ◽  
...  
Keyword(s):  
Energy Efficiency ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Wireless Sensor ◽  
Hierarchical Routing ◽  
Battery Power ◽  
Simulation Based ◽  
Simulation Results ◽  
Static Clustering

Routing remains a most challenging task in sensor networks because of constrained resources like battery power, processing, and memory. Many energy efficiency techniques for the sensor networks have been proposed, among which hierarchical routing is considered the most energy-efficient and extended network lifetime technique. This technique has a lesser number of transmissions in the network. On the contrary, zone-based routing claims lesser control and routing overhead on the overall network lifetime. In this research, a simulation-based comparison of zone-based routing with static clustering hierarchical routing is conducted. The simulation results show that the zone-based routing outperforms hierarchical routing with static clustering in terms of energy efficiency, network lifetime, and throughput.

scholarly journals Routing of emergency data in a wireless sensor network for mining applications

2021 ◽  
Author(s):  
Mandana Jafarian
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Residual Energy ◽  
Mesh Network ◽  
Wireless Sensor ◽  
End To End Delay ◽  
Simulation Results ◽  
End To End

Emergency situations in mines result in loss of precious human lives. In this thesis we discussed architecture of a Wireless Sensor Network (WSN) that can be deployed in mines, which takes care of severe geographical and environmental constraints found inside mines. The proposed architecture is a two-level hierarchy of small sized WSNs that employs a wireless Mesh network as the backbone connecting small sized WSNs scattered inside mines. We proposed a routing protocol for that WSN that is optimized for both emergency and non-emergency data routing. Since our main goal is to provide safety in the mining environment, the main consideration of the routing protocol is to provide reliability and reduce the end-to-end delay for vital emergency traffic while optimizing for network longevity for non-emergency traffic. We present a new cost-based routing protocol called MDML, which provides Minimum Delay and Maximum Lifetime routing for such networks. The proposed MDML routing defines separate cost metrics for emergency and non-emergency traffic. It finds the least-cost path for the reliable delay-constrained emergency traffic with regards to link error rate but also gives secondary consideration to nodes' residual energy. It is an energy efficient routing scheme for non-emergency or regular data traffic routing that maximizes the network lifetime. However, for emergency traffic energy efficiency is compromised to achieving minimal delay. Regular traffic is generated through periodic monitoring and is delay-insensitive. For regular traffic delivery, a shortest path routinig algorithm is employed which uses link costs that reflect both the communication energy consumption rates and the residual energy levels at the two end nodes. Simulation results show that using the proposed emergency routes reduces the end-to-end delay for emergency traffic. The effect of protocol update cycle on increasing the network lifetime is verified true simulation. MDML is also compared with a simulated non-MDML approach to compare the lifetime and delay performance. Simulation results have demonstrated the effectiveness of our approach.

WS-Security on PRODML

2014 ◽  
Vol 1 (1) ◽  
pp. 9-34
Author(s):  
Bobby Suryajaya
Keyword(s):  
Web Services ◽  
Digital Signature ◽  
Data Transfer ◽  
Web Services Security ◽  
Soap Message ◽  
Simulation Results ◽  
End To End

SKK Migas plans to apply end-to-end security based on Web Services Security (WS-Security) for Sistem Operasi Terpadu (SOT). However, there are no prototype or simulation results that can support the plan that has already been communicated to many parties. This paper proposes an experiment that performs PRODML data transfer using WS-Security by altering the WSDL to include encryption and digital signature. The experiment utilizes SoapUI, and successfully loaded PRODML WSDL that had been altered with WSP-Policy based on X.509 to transfer a SOAP message.

QoS Aware Multi-hop Multi-path Routing Approach in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 43-52
Author(s):  
Omkar Singh ◽  
Vinay Rishiwal
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Life Time ◽  
Base Station ◽  
Environmental Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
End To End

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.

QoS aware Multi-Path Routing using Link Scheduling Algorithm

2019 ◽  
Vol 09 ◽  
Author(s):  
Satyasrikanth Palle ◽  
Shivashankar
Keyword(s):  
Cellular Networks ◽  
Scheduling Algorithm ◽  
Research Work ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Link Scheduling ◽  
Spatial Reuse ◽  
Mobile Cellular ◽  
Simulation Results ◽  
End To End

Objective: The demand for Cellular based multimedia services is growing day by day, in order to fulfill such demand the present day cellular networks needs to be upgraded to support excessive capacity calls along with high data accessibility. Analysis of traffic and huge network size could become very challenging issue for the network operators for scheduling the available bandwidth between different users. In the proposed work a novel QoS Aware Multi Path scheduling algorithm for smooth CAC in wireless mobile networks. The performance of the proposed algorithm is assessed and compared with existing scheduling algorithms. The simulation results show that the proposed algorithm outperforms existing CAC algorithms in terms of throughput and delay. The CAC algorithm with scheduling increases end-to-end throughput and decreases end-to-end delay. Methods: The key idea to implement the proposed research work is to adopt spatial reuse concept of wireless sensor networks to mobile cellular networks. Spatial reusability enhances channel reuse when the node pairs are far away and distant. When Src and node b are communicating with each other, the other nodes in the discovered path should be idle without utilizing the channel. Instead the other nodes are able to communicate parallelly the end-to-end throughput can be improved with acceptable delay. Incorporating link scheduling algorithms to this key concept further enhances the end-to-end throughput with in the turnaround time. So, in this research work we have applied spatial reuse concept along with link scheduling algorithm to enhance end-to-end throughput with in turnaround time. The proposed algorithm not only ensures that a connection gets the required bandwidth at each mobile node on its way by scheduling required slots to meet the QoS requirements. By considering the bandwidth requirement of the mobile connections, the CAC module at the BS not only considers the bandwidth requirement but also conforming the constrains of system dealy and jitter are met. Result: To verify the feasibility and effectiveness of our proposed work, with respect to scheduling the simulation results clearly shows the throughput improvement with Call Admission Control. The number of dropped calls is significantly less and successful calls are more with CAC. The percentage of dropped calls is reduced by 9 % and successful calls are improved by 91%. The simulation is also conducted on time constraint and ratio of dropped calls are shown. The total time taken to forward the packets and the ration of dropped calls is less when compared to non CAC. On a whole the CAC with scheduling algorithms out performs existing scheduling algorithms. Conclusion: In this research work we have proposed a novel QoS aware scheduling algorithm that provides QoS in Wireless Cellular Networks using Call Admission Control (CAC). The simulation results show that the end-to-end throughput has been increased by 91% when CAC is used. The proposed algorithm is also compared with existing link scheduling algorithms. The results reveal that CAC with scheduling algorithm can be used in Mobile Cellular Networks in order to reduce packet drop ratio. The algorithm is also used to send the packets within acceptable delay.

scholarly journals TMaR: a two-stage MapReduce scheduler for heterogeneous environments

2020 ◽  
Vol 10 (1) ◽  
Author(s):  
Neda Maleki ◽  
Hamid Reza Faragardi ◽  
Amir Masoud Rahmani ◽  
Mauro Conti ◽  
Jay Lofstead
Keyword(s):  
Task Scheduling ◽  
Network Traffic ◽  
Input Data ◽  
Power Reduction ◽  
Heterogeneous Environments ◽  
Two Stage ◽  
Finish Time ◽  
Remote Storage ◽  
Simulation Results

Abstract In the context of MapReduce task scheduling, many algorithms mainly focus on the scheduling of Reduce tasks with the assumption that scheduling of Map tasks is already done. However, in the cloud deployments of MapReduce, the input data is located on remote storage which indicates the importance of the scheduling of Map tasks as well. In this paper, we propose a two-stage Map and Reduce task scheduler for heterogeneous environments, called TMaR. TMaR schedules Map and Reduce tasks on the servers that minimize the task finish time in each stage, respectively. We employ a dynamic partition binder for Reduce tasks in the Reduce stage to lighten the shuffling traffic. Indeed, TMaR minimizes the makespan of a batch of tasks in heterogeneous environments while considering the network traffic. The simulation results demonstrate that TMaR outperforms Hadoop-stock and Hadoop-A in terms of makespan and network traffic and achieves by an average of 29%, 36%, and 14% performance using Wordcount, Sort, and Grep benchmarks. Besides, the power reduction of TMaR is up to 12%.

Dual-Hop Amplify-and-Forward Variable Gain Relaying over Mixture Gamma Fading Channels

2015 ◽  
Vol 719-720 ◽  
pp. 767-772
Author(s):  
Wei Jun Cheng
Keyword(s):  
Fading Channels ◽  
Signal To Noise Ratio ◽  
Symbol Error Rate ◽  
Amplify And Forward ◽  
Variable Gain ◽  
Average Symbol Error Rate ◽  
Simulation Results ◽  
End To End ◽  
The Moment ◽  
Relaying System

In this paper, we present the end-to-end performance of a dual-hop amplify-and-forward variablegain relaying system over Mixture Gamma distribution. Novel closed-form expressions for the probability density function and the moment-generation function of the end-to-end Signal-to-noise ratio (SNR) are derived. Moreover, the average symbol error rate, the average SNR and the average capacity are found based on the above new expressions, respectively. These expressions are more simple and accuracy than the previous ones obtained by using generalized-K (KG) distribution. Finally, numerical and simulation results are shown to verify the accuracy of the analytical results.

Sign in / Sign up

Export Citation Format

Share Document