Energy consumption is one of the most challenging constraintsof the design and implementation of the sensor network. Underwater sensor networking is the technology that enables the applications like environment monitoring, underwater exploration, seismic monitoring and other surveillance applications. In underwater sensor network,a sensor node senses the data and transmits it to the sink. Many routing algorithms have been proposed in order to make the network phase of UWSNs more efficient.In this report, we present a review and comparison of various data collection algorithms and clustering schemes, proposed recently in order to execute the demands of the ongoing researches. The main goal of data aggregation technique is to accumulate data in an energy efficient manner for a long-term network monitoring. The main purpose of this study is to present algorithms addressing issues like deployment and localization in UWSNs under different conditions.

The Internet of Vehicles (IoV) is a new paradigm for vehicular networks. Using diverse access methods, IoV enables vehicles to connect with their surroundings. However, without data security, IoV settings might be hazardous. Because of the IoV’s openness and self-organization, they are prone to malevolent attack. To overcome this problem, this paper proposes a revolutionary blockchain-enabled game theory-based authentication mechanism for securing IoVs. Here, a three layer multi-trusted authorization solution is provided in which authentication of vehicles can be performed from initial entry to movement into different trusted authorities’ areas without any delay by the use of Physical Unclonable Functions (PUFs) in the beginning and later through duel gaming, and a dynamic Proof-of-Work (dPoW) consensus mechanism. Formal and informal security analyses justify the framework’s credibility in more depth with mathematical proofs. A rigorous comparative study demonstrates that the suggested framework achieves greater security and functionality characteristics and provides lower transaction and computation overhead than many of the available solutions so far. However, these solutions never considered the prime concerns of physical cloning and side-channel attacks. However, the framework in this paper is capable of handling them along with all the other security attacks the previous work can handle. Finally, the suggested framework has been subjected to a blockchain implementation to demonstrate its efficacy with duel gaming to achieve authentication in addition to its capability of using lower burdened blockchain at the physical layer, which current blockchain-based authentication models for IoVs do not support.

Generally speaking these protocols are classified into two broad categories: proactive (table driven) and on demand The Ad hoc On Demand Distance Vector (AODV) routing routing (source initiated) [4,5,6]. Proactive protocols are less protocol is intended for use by mobile nodes in ad hoc efficient than the later, as they need more network resources networks. To provide quality of service, extensions can be to maintain an up-to-date routing information to every other added to the messages used during route discovery. These node in the network. On the other hand, on-demand routing extensions specify the service requirements which must be met protocols initiate route discovery (route request and route by nodes rebroadcasting a route request (RREQ) or returning maintenance) as and when required and these protocols only a route reply (RREP) for a destination. In order to provide maintain the part of routing table currently in use. On demand quality delivery to delay sensitive applications such as voice routing protocols react to topology change quickly and also and video, it is extremely important that mobile ad hoc save routing overheads compared to proactive routing networks provide quality ofservice (QoS) support in terms of protocols. Many routing protocols have been proposed for bandwidth and delay. In spite of using IEEE 802.11 as MANETs. Most of the current ad hoc routing protocols only medium access control (MAC), most of the ad hoc routing use number of hops as a measure of route cost in making protocols do not consider contention time which occurs in the routing decisions. But in this some important link capacity medium reservation. Large contention times can be more properties are ignored due to simplicity and ease of critical than hop counts in determining the end-to-end delay. implementation. Firstly, as each node has a different traffic Most existing routing protocols for mobile ad hoc networks load, therefore the average number of packets in the queue are designed to search for the shortest path with minimum and the associated queuing delay at each node is different. hop counts. However, the shortest routes do not always Secondly, the number of neighbor nodes as well as their provide the best performance, especially when there are traffic patterns are different, and thus, nodes that have more congested nodes along these routes. In this paper we propose number of active neighbors may encounter more collisions. If an on demand delay based quality of service (QoS) routing nodes with more traffic fall on the shortest route, it may protocol (AODV-D) to ensure that delay does not exceed a actually introduce longer end-to-end delay, even though the maximum value for mobile ad hoc networks. This protocol number of hops along the chosen route is minimum. will take into consideration MAC layer channel contention Furthermore, if some of the heavy nodes are congested, it information and the number ofpackets in the interface queue may lead to massive packet drop rates and subsequent in addition to minimum hops. MAC l...

No abstract

No abstract