The research on end-to-end delay upper bound in wireless sensor network

Author(s):  
Li Cui ◽  
Ju Yong-feng
2021 ◽  
Author(s):  
Mandana Jafarian

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.


Author(s):  
N Saranya ◽  
Mr. S.V. Manisekaran

In a dynamic Wireless Sensor Network (WSN) the movement of each sensor node affects the structure of network which may result in inefficient routing. Various difficulties in a dynamic network may include lack of communication between the nodes, end to end delay and transmission overhead. Transmitting data in a dynamic network to the destination node with less delay is the major problem to be addressed. Sensed data can be transmitted using flooding scheme, where the end to end delay can be minimized but results in transmission overhead. In this scheme sensed data is broadcasted to all the nearby nodes until it reaches the sink node. The proposed system make use of cluster based routing protocol, where the sensor nodes with similar mobility pattern are grouped into cluster. Exponentially weighted moving average (EWMA) scheme is used for updating the nodal contact probability of each cluster node. Two Gateway nodes are selected for routing which performs data transmission. The simulation result shows that cluster based routing protocol implemented for a dynamic wireless sensor network result in less end to end delay.


2021 ◽  
Author(s):  
Mandana Jafarian

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.


2020 ◽  
Vol 8 (5) ◽  
pp. 1411-1414

Wireless Sensor Network (WSN) is susceptible to various kinds of security attacks such as the misdirection attack. Detection of misdirection attack in WSN is a difficult job. The malicious node misdirects the arriving packets to a node other than the purposive node in the path from the source to the destination. Consequently, it introduces high end- to- end delay in the network. A novel technique for detection of misdirection attack in WSN without using cluster heads is proposed in the paper. The proposed detection technique has been implemented using Omnetpp 5.4.1 on four different network scenarios (10, 20, 30, and 40 numbers of nodes) and varying number of malicious nodes. The results of simulation shows that the proposed technique delivers better detection rate with reduced end- to- end delay compared to the detection method which uses cluster heads.


2018 ◽  
Vol 7 (2) ◽  
pp. 768
Author(s):  
Muruganandam. A ◽  
Anitha. R

A Wireless Sensor Network (WSNs) is popular developing the field in industrial and other major markets. Wireless data security is the central theme in the WSNs application where security of transmitted data is more concerned. Due to the significant concentration of energy efficiency and performance analysis in WSN, providing secured communication is a challenging issue. To overcome this interdependent problem Game theory can be used. Game theory is applied here to select different routes to transfer the data from source to destination. The performance of the WSNs can be increased by providing security for transmitted data. The graph for throughput, end to end delay, delivery, and packet loss ratio are generated using NS2 simulation tool.


Sign in / Sign up

Export Citation Format

Share Document