الفهرس 
Literature Review for MWSNs ProtocolsOnly 14 pages are availabe for public view
 |  | from | 203 |  |  |
| | | from | 203 | | |
Abstract
Mobile Wireless Sensor Network (MWSN) has drawn attention widely. It is a network
with lots of sensors that initially distributed randomly and collaborate to gather, process, and
transmit information around targets to the sink node. MWSNs are the overgrowth and
emerging technology with significant applications that provide free moving for sensor nodes
and flexible communicating with each other without fixed infrastructure. Because of the
small size of the sensor nodes, they have limited power, storage, and radio capability.
Therefore, many clustering routing protocols were developed in static WSNs to utilize this
limited energy and resources by reducing the energy consumption and prolonging the
lifetime of the network. MWSNs perform many improvements in energy consumption,
network lifetime, and channel capacity than static WSNs. However, the routing process in
mobile nodes network is more complicated than static one because the network topology is
not fixed and needs to construct new links between nodes frequently, therefore, many routing
protocols have been implemented to accomplish progress in the energy consumption field
for MWSN data collecting recently. These protocols can be grouped into three groups
according to the mobile elements on the network namely sink mobility, nodes mobility, and
mobility of sink and sensors together.
This thesis considers the data routing for the three types of mobility in MWSN. The
previous algorithms used to deal with only sink mobility or sensor nodes mobility and suffer
from some restrictions in expended energy, mobility adapting, load balance, fault variance,
and connectivity. Therefore, four routing protocols are developed to prolong the network
lifetime, ensure connectivity between nodes, achieve stability, and solve the hot-spot
problem.
The first proposed protocol is Mobile Sink Improved Energy-Efficient PEGASISBased routing protocol with Direct Transmission (MIEEPB-DT). This protocol utilizes the
idea of moving the sink node instead of static one with static sensor nodes to achieve
amelioration in energy utilization and provide longer network lifetime. The idea of the
proposed protocol depends on combining Mobile sink Improved Energy-Efficient
PEGASIS-Based routing protocol (MIEEPB) with Direct Transmission (DT) protocol to
utilize the limited energy of wireless sensors efficiently. As the motorized movement of the
sink is operated by petrol or current, the data loss through the transition of this sink from its
current location to the next location must be diminished by restricting the moving distance.
In this protocol, this mobile sink must spend at least a certain amount of time (sojourn time)
at each of its sojourn locations to avoid overhead.
The second protocol presents a Mobility based Genetic Algorithm Hierarchical routing
Protocol (MGAHP) to achieve maximum lifetime of the network as possible and improve
the stable period of MWSN. The basic idea of MGAHP protocol is using the Genetic
Algorithm (GA) to find the optimum number of Cluster Heads (CHs) and their locations
depending on minimizing the energy consumption of the sensor nodes.
The third protocol is Improved Mobility based Genetic Algorithm Hierarchical routing
Protocol (IMGAHP) to handle the packet delivery ratio problem in MGAHP and maximize
the network stability period. The first concept of this proposed IMGAHP is utilizing
optimization process GA to detect the optimum location of CHs and their numbers. The
second idea is reassigning timeslots allocated for sensor nodes which moved out of the
cluster or didn’t have data to send, to nodes registered in secondary Time Division Multiple
Access (TDMA) schedule or new joined mobile nodes.
The fourth protocol is Joint Nodes and Sink Mobility based Immune routingClustering protocol (JNSMIC) which support mobility of the sink and the sensor nodes
together. It depends on using the mobile sink for solving the hot spot problem and the MultiObjective Immune Algorithm (MOIA) for clustering the network and finding the visiting
locations of the mobile sink. The JNSMIC protocol considers different objectives during the
clustering process, namely the consumption energy, network coverage, link connection time,
residual energy, and mobility. Also, the proposed protocol reduces the computational time
of finding CHs by dividing it into two phases. JNSMIC performs the clustering process only
if the remaining energy is below a threshold value thus the computational time and overhead
control packets are reduced. In the JNSMIC protocol, the deputy CH concept is considered
to perform the task of CH during CH failure. Furthermore, it performs a fault-tolerance
process after transmitting each frame to maintain the link stability among CHs and their
members which improves the throughput.