Page 164 - 2023-Vol19-Issue2

160 |
not optimized for multimedia applications and may result in
high packet loss rates. Secondly, the evaluation of the DDCP
routing algorithm through simulations and real-world exper-
iments using a testbed of wireless multimedia sensor nodes
provides valuable insights into its performance in terms of
packet delivery ratio, end-to-end delay, and energy efficiency.
The comparison with traditional routing protocols such as
AODV highlights the superiority of the DDCP algorithm in
enhancing packet reliability for multimedia applications.
Finally, the analysis of the impact of dynamic cooperative
range adjustment on the performance of the DDCP routing
algorithm and the investigation of the optimal range for packet
reliability enhancement provide important information for op-
timizing the performance of the algorithm in practical applica-
tions. The contributions of this work are the Development of a
proposed Distributed Dynamic Cooperation Protocol (DDCP)
routing algorithm that prioritizes packet reliability in WM-
SNs by leveraging the cooperation of neighboring nodes and
dynamically adjusting the transmission range, Evaluation of
the performance of the DDCP routing algorithm in terms of
packet delivery ratio, end-to-end delay, and energy efficiency
through simulations and experiments on a testbed of wireless
multimedia sensor nodes.
Demonstration of the efficacy of the proposed DDCP rout-
ing algorithm in enhancing packet dependability and network
performance as a whole in WMSNs, making it suitable for a
wide range of applications where reliable data transmission is
critical.
Packet reliability specifies the capability of delivering the algorithms can reduce the chances of packet loss and enhance
data from the source to the sink node with the least possi-
ble packet loss. Packet reliability in wireless multimedia
sensor networks can be enhanced by using effective routing
procedures that consider the network characteristics and the
multimedia data being transmitted. A few approaches that
could be utilized to improve packet reliability in WMSNs are
specified below:
1) Multipath Routing:
Multiple routes to the destination can be found by a source
node using multipath routing protocols. Traditionally, one of
the built-in channels is utilized as the primary path for data
transmission, with the others being utilized in the circum-
stance of failure of the primary path. Instead of relying on a
single path, multipath routing algorithms establish multiple
paths among source and sink nodes. This approach increases
reliability as the packets can be sent through alternative paths
if any of the paths experience congestion or packet loss. By
dynamically selecting and utilizing multiple paths, the likeli-
hood of successful packet delivery shall be improved.
Al-Jabry & Al-Asadi
2) Quality-of-Service (QoS)-Aware Routing:
QoS-aware routing algorithms consider the specific require-
ments of multimedia data, such as bandwidth, delay, and
packet loss. These algorithms aim to find routes that sat-
isfy the QoS constraints of multimedia applications. QoS
refers to the overall performance and reliability of network
services, including bandwidth, delay, jitter, packet loss, and
reliability. By selecting routes that can meet the desired QoS
criteria, the reliability of delivery in multimedia packets can
be improved. Several QoS-aware routing protocols have been
offered for WMSNs, such as Multi-constrained QoS Routing
Protocol (MCQRP), Energy-Aware QoS Routing (EA-QoSR),
and Quality-of-Service-based Routing (QoSR). These pro-
tocols employ different mechanisms and metrics to achieve
QoS-aware routing in WMSNs
3) Cross-Layer Routing:
Cross-layer routing procedures exploit information from mul-
tiple layers of the protocol stack to make routing decisions. By
considering information about the wireless link quality, net-
work congestion, and other relevant parameters, cross-layer
routing algorithms can dynamically adapt the routing paths
to improve packet reliability. For example, if aparticular link
is experiencing high packet loss, the routing algorithm can
avoid using that link to enhance reliability.
4) Load-Balanced Routing:
These load-balanced routing algorithms distribute the traffic
load across the network by selecting routes that minimize
congestion and balance the utilization of network resources.
By avoiding heavily loaded nodes or congested paths, these
reliability. The currently available mechanisms in WMSNs
are divided into two classes: Routing for single sinks and
multiple sinks.
5) Energy-Aware Routing:
These algorithms consider the energy limitations of sensor
nodes in the network. By considering the remaining energy
levels of nodes and minimizing energy consumption, these
algorithms can optimize packet delivery while extending the
network lifetime. Energy-aware routing can help ensure reli-
able packet delivery by preventing node failures due to energy
depletion.
6) Reliable Data Dissemination:
Some routing algorithms in WMSNs focus on reliable data
dissemination to overcome the challenges posed by unreliable
wireless links. These algorithms utilize mechanisms such
as data replication, redundancy, and hop-by-hop error detec-
tion and correction to improve packet reliability during data
dissemination.