Delay-Sensitive Optimization Models and Distributed Routing Algorithms for Mobile Wireless Sensor Networks

Communication disruptions caused by mobility in wireless sensor networks introduce undesired delays which affect the network performance in delay sensitive applications in MWSN. In order to study the negative effects caused by mobility, we propose two mathematical models to find the minimum cost path between a source node and a destination node considering the nodes position changes across time. Our mathematical models consider the usage of buffers in the nodes to represent the fact of storing a message if there is not an appropriate forwarding node for transmitting it. In order to contrast our mathematical models results we have designed two kinds of algorithms: the first one takes advantage of the closest neighbours to the destination node in order to reach it as fast as possible from the source node. The second one simply reaches the destination node if a neighbour node is precisely the destination node. Finally, we compare the delay performance of these algorithms against our mathematical models to show how efficient they are for reaching a destination node. This paper is an extension of [10].a The mathematical model proposed in [10] is improved by adding two new binary variables with the aim of make it more readable and compact mathematically. This means a post-processing algorithm is added only for evaluating if a solution is at the first network state.

Download Full-text

Genetic Algorithm for Effective Optimization of Delay Performance in Wireless Sensor Networks

Journal of University of Babylon for Pure and Applied Sciences ◽

10.29196/jubpas.v26i10.1886 ◽

2018 ◽

Vol 26 (10) ◽

pp. 281-308

Author(s):

Saif Khalid Musluh ◽

Alaa Abid Muslam ◽

Raid Abd Alreda Shekan

Keyword(s):

Genetic Algorithm ◽

Wireless Sensor Networks ◽

Wireless Networks ◽

Sensor Networks ◽

Network Performance ◽

Data Transfer ◽

Relay Node ◽

Network Capacity ◽

Wireless Sensor ◽

Delay Performance

Wireless sensor networks (WSNs) play an important role in many real-world applications like surveillance. Wireless networks are also used to have data transfer. In such cases, there are problems with resourcece-constraintnednetworks. The problems include a delay in communication and reduction in Quality of Service (QoS). Topology control can solve this problem to some extent. However, the delay performance and QoS need to be improved further to support intended operations in wireless networks. When relay node concept is considered, it is possible to optimize performance in such networks. In this paper, we proposed a Genetic Algorithm (GA) based relay configuration for optimizing delay performance in WSN. Relay nodes compute optimal positions using the proposed algorithm so as to improve QoS and reduce delay as much as possible. We implemented the algorithm using NS2 simulations. The results revealed that the proposed approach is able to improve QoS, reduce delay besides improving network performance in terms of throughput, network capacity, and energy efficiency.

Download Full-text

Enhanced Underwater Balanced Co-operative Routing Protocol

International Journal of Recent Technology and Engineering - 2 ◽

10.35940/ijrte.d7772.118419 ◽

2019 ◽

Vol 8 (4) ◽

pp. 4817-4821

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Residual Energy ◽

Cooperative Transmission ◽

Source Node ◽

Wireless Sensor ◽

Destination Node ◽

Underwater Wireless Sensor Networks ◽

Probability Of Error ◽

Cooperative Routing

Underwater wireless sensor networks (UWSNs) is an developing area for research in the wireless sensor networks (WSN) area. The normal method is to adapt for underwater use presently accessible terrestrial architectures and well-proven architectures. Underwater Wireless Sensor Networks (UWSNs) have drawn a lot of concentration to help multiple applications such as tracking pollution, tsunami warnings, offshore exploration, tactical tracking, etc. For many applications, the efficiency and reliability of the network in terms of high performance, energy conservation, low bit error rate (BER) and reduced delay are prerequisites. However, UWSN's unique characteristics such as low bandwidth available, big delay in propagation, extremely vibrant network topology, and high probability of error pose many difficulties in the development of effective and reliable communication protocols. Therefore, in this proposed work, along with its mathematical model, we suggest a protocol that focuses on improving network reliability and effectiveness through cooperative routing and sink mobility. For reliable data transmission, cooperative transmission is well known. Based on their residual energy data and depth , prospective relay and target nodes for cooperative routing are chosen in this algorithm. Data from the source node is transferred in a cooperative way to the target node via the relay node. Mobile Sinks collect information straight from the nodes of the location. We consider as selection parameters the depth threshold of the source node, the residual energy of the destination nodes/ potential relay and the SNR of the relating source node to the potential relay / destination node. In this work, two distinct selection criteria for partner nodes are also introduced and contrasted. Partner node selection (relay / destination node) for cooperative routing should be carried out on the grounds of a certain criterion in order to achieve efficient outcomes. Based on the extensive simulations carried out in MATLAB, we note that our suggested method increases performance in terms of energy efficiency, network life and decreases BER relative to the existing depth-based routing protocols.

Download Full-text

Fuzzy Logic-Based Geographic Routing Protocol for Dynamic Wireless Sensor Networks

Sensors ◽

10.3390/s19010196 ◽

2019 ◽

Vol 19 (1) ◽

pp. 196 ◽

Cited By ~ 3

Author(s):

Xing Hu ◽

Linhua Ma ◽

Yongqiang Ding ◽

Jin Xu ◽

Yan Li ◽

...

Keyword(s):

Wireless Sensor Networks ◽

Fuzzy Logic ◽

Sensor Networks ◽

Routing Protocol ◽

Geographic Routing ◽

Wireless Sensor ◽

Location Information ◽

Destination Node ◽

Routing Overhead ◽

Geographic Routing Protocol

The geographic routing protocol only requires the location information of local nodes for routing decisions, and is considered very efficient in multi-hop wireless sensor networks. However, in dynamic wireless sensor networks, it increases the routing overhead while obtaining the location information of destination nodes by using a location server algorithm. In addition, the routing void problem and location inaccuracy problem also occur in geographic routing. To solve these problems, a novel fuzzy logic-based geographic routing protocol (FLGR) is proposed. The selection criteria and parameters for the assessment of the next forwarding node are also proposed. In FLGR protocol, the next forward node can be selected based on the fuzzy location region of the destination node. Finally, the feasibility of the FLGR forwarding mode is verified and the performance of FLGR protocol is analyzed via simulation. Simulation results show that the proposed FLGR forwarding mode can effectively avoid the routing void problem. Compared with existing protocols, the FLGR protocol has lower routing overhead, and a higher packet delivery rate in a sparse network.

Download Full-text