Search results

Inclusion of mobile nodes (MNs) in Internet of Things (IoT) further increases the challenges such as frequent network disconnection and intermittent connectivity because of high mobility rate of nodes. This paper aims to propose a proactive mobility and congestion aware route prediction mechanism (PMCAR) to find the congestion free route from leaf to destination oriented directed acyclic graph root (DODAG-ROOT) which considers number of MNs connected to a static node. This paper compares the proposed technique (PMCAR) with RPL (OF0) which considers the HOP-COUNT to determine the path from leaf to DODAG-ROOT. The authors performed a simulation with the proposed technique in MATLAB to present the benefits in terms of packet loss and energy consumption.

In this pandemic situation, mobile and IoT play major role in predicting and preventing the CoronaVirus Disease of 2019 (COVID-19). Huge amount of computations is happening with the data generated in this pandemic with the help of mobile devices. To route the data to remote locations through the network, it is necessary to have proper routing mechanism without congestion. In this paper, PMCAR mechanism is introduced to achieve the same. Internet of mobile Things (IoMT) is an extension of IoT that consists of static embedded devices and sensors. IoMT includes MNs which sense data and transfer it to the DODAG-ROOT. The nodes in the IoMT are characterised by low power, low memory, low computing power and low bandwidth support. Several challenges are encountered by routing protocols defined for IPV6 over low power wireless personal area networks to ensure reduced packet loss, less delay, less energy consumption and guaranteed quality of service.

The results obtained shows a significant improvement compared to the existing approach such as RPL (OF0). The proposed route prediction mechanism can be applied largely to medical applications which are delay sensitive, particularly in pandemic situations where the number of patients involved and the data gathered from them flows towards a central root for analysis. Support of data transmission from the patients to the doctors without much delay and packet loss will make the response or decisions available more quickly which is a vital part of medical applications.

The computational technologies in this COVID-19 pandemic situation needs timely data for computation without delay. IoMT is enabled with various devices such as mobile, sensors and wearable devices. These devices are dedicated for collecting the data from the patients or any objects from different geographical location based on the predetermined time intervals. Timely delivery of data is essential for accurate computation. So, it is necessary to have a routing mechanism without delay and congestion to handle this pandemic situation. The proposed PMCAR mechanism ensures the reliable delivery of data for immediate computation which can be used to make decisions in preventing and prediction.

Wireless Multimedia Sensor Network (WMSN) is expected to be a key technology for future network. The multimodal information along with very low-cost availability of the camera sensor nodes is promoting the extensive use of audio, image and video in various real-time implementations. The purpose of this paper is to study various routing issues and the effect of mobility on existing solutions for the applications in future internet.

This paper conducts a survey of the various methodologies for routing and the vital issues in the design of routing protocols for WMSN, and it also discusses about the effect of mobility on various routing methodologies of WMSN. WMSN ubiquitously performs data acquisition, processing and routing for scalar and multimedia data in a mobile environment. The routing protocols should be adaptive in nature and should have a dynamic approach to service effectively for future network. Many authors proposed the mobility of sink to improve lifetime of the network. This paper discusses some effective approaches for the network where not only the sink node but also some of the sensor nodes are mobile.

During the survey, the performance and lifetime of the network are discussed, other parameters like delay, packet loss, energy consumption and simulators used for implementation are also discussed.

The techniques in this paper represent a considerable solution for mobility issues in future internet applications.

Mobility management for single‐hop cellular networks has received much research attention in the last few years. One of the research challenges for 4G wireless systems is the design of mobility management techniques that integrate cellular and ad‐hoc networks. Currently, there are no structured mobility management schemes for these heterogeneous multi‐hop networks. This paper aims to address these issues.

This paper describes techniques for tracking a mobile node (MN) in an integrated architecture with minimum overhead. This paper proposes group rerouting concept.

The paper implements and evaluates the proposed protocol by using the network simulator (NS‐2). The proposed protocol increases performance compared to broadcasting schemes.

This scheme considers devices with two interfaces only.

The paper proposes a scheme to extend the coverage of cellular base stations by using ad‐hoc devices.

This paper describes techniques for tracking an MN in an integrated architecture with minimum overhead. This scheme is independent of the routing protocol used in a multi‐hop network.

Routing in ad hoc networks faces significant challenges due to node mobility and dynamic network topology. In this work we propose the use of mobility prediction to reduce the search space required for route discovery. A method of mobility prediction making use of a sectorized cluster structure is described with the proposal of the Prediction based Location Aided Routing (P‐LAR) protocol. Simulation study and analytical results of P‐LAR find it to offer considerable saving in the amount of routing traffic generated during the route discovery phase.

The paper aims to address wireless sensor network (WSN) security by proposing new cluster-based mobile key management scheme (CMKMS). The growing demands of WSNs in variety of real-time and mission-critical applications increase the challenges in terms of energy efficiency, security and mobility. The security is important to avoid malicious attacks and improve the energy efficiency, while mobility helps to improve the reachability of network. The CMKMS algorithm focuses on the management and maintenance of keys under cluster-based mobile WSN network.

The paper studied the related work in the area of key management and compared the different key management algorithms according to the technique used. The comparative study shows that the available key management algorithms are efficient in terms of security, but they are not scaleable enough to the changing conditions of network and do not work efficiently under node mobility. The research uses cluster-based approach for improving scalability, where cluster head (CH) acts as a key manager. The work developed by considering both static and mobile CH.

The CMKMS considers two phases, first for key maintenance which establishes the two private keys, home key for own cluster and foreign key when node moves from one cluster to another. The second phase maintains the keys when CH moves from one cluster to another. The proposed algorithm improves the efficiency of key management algorithm in terms of security, mobility, energy efficiency and scalability of network. The simulation of scheme in different realistic situation shows that proposed solution shows less computational overheads, energy consumption and delay as compared with state-of-art solution.

The research is validated using computer-based simulation, which limits the testing of research by considering external environmental conditions. Therefore, research can be further test using WSN test bed.

The research address the issues in key management, developed the scaleable, and node mobility supportable key management algorithms, for addressing the demands of growing WSN applications.

This paper accomplish the security of WSN using scaleable and mobility-supported key management algorithms.

Many clustering protocols for mobile ad hoc networks (MANETs) have been proposed in the literature. With only one exception so far (1), all these protocols are proactive, thus wasting bandwidth when their function is not currently needed. To reduce the signalling traffic load, reactive clustering may be employed.We have developed a clustering protocol named “On‐Demand Group Mobility‐Based Clustering” (ODGMBC) (2), (3) which is reactive. Its goal is to build clusters as a basis for address autoconfiguration and hierarchical routing. In contrast to the protocol described in ref. (1), the design process especially addresses the notions of group mobility and of multi‐hop clusters in a MANET. As a result, ODGMBC maps varying physical node groups onto logical clusters. In this paper, ODGMBC is described. It was implemented for the ad hoc network simulator GloMoSim (4) and evaluated using several performance indicators. Simulation results are promising and show that ODGMBC leads to stable clusters. This stability is advantageous for autoconfiguration and routing mechansims to be employed in conjunction with the clustering algorithm.

Quality communication is a big challenge in mobile ad hoc networks because of a restricted environment for mobile devices, bandwidth-constrained radio connections, random mobility of connected devices, etc. High-quality communication through wireless links mainly depends on available bandwidth, link stability, energy of nodes, etc. Many researchers proposed stability and link quality methods to improve these issues, but they still require optimization. This study aims to contribute towards better quality communication in temporarily formed networks. The authors propose the stable and bandwidth aware dynamic routing (SBADR) protocol with the aim to provide an efficient, stable path with sufficient bandwidth and enough energy hold nodes for all types of quality of service (QoS) data communication.

The proposal made in this work used received signal strength from the media access control (MAC) layer to estimate the stability of the radio connection. The proposed path stability model combines the stability of the individual link to compute path stability. The amount of bandwidth available for communication at a specific time on a link is defined as the available link bandwidth that is understood as the maximum throughput of that link. Bandwidth as a QoS parameter ensures high-quality communication for every application in such a network. One other improvement, towards quality data transmission, is made by incorporating residual energies of communicating and receiving nodes in the calculation of available link bandwidth.

Communication quality in mobile ad hoc network (MANET) does not depend on a single parameter such as bandwidth, energy, path stability, etc. To address and enhance quality communication, this paper focused on high impact factors, such as path stability, available link bandwidth and energy of nodes. The performance of SBADR is evaluated on the network simulator and compared with that of other routing protocols, i.e. route stability based QoS routing (RSQR), route stability based ad-hoc on-demand distance vector (RSAODV) and Ad-hoc on-demand distance vector (AODV). Experimental outcomes show that SBADR significantly enhanced network performance in terms of throughput, packet delivery ratio (PDR) and normalized control overhead (NCO). Performance shows that SBADR is suitable for any application of MANET having random and high mobility.

QoS in MANET is a challenging task. To achieve high-quality communication, the authors worked on multiple network parameters, i.e. path stability, available link bandwidth and energy of mobile nodes. The performance of the proposed routing protocol named SBADR is evaluated by a network simulator and compared with that of other routing protocols. Statistical analysis done on results proves significant enhancement in network performance. SBADR is suitable for applications of MANET having random and high mobility. It is also efficient for applications having a requirement of high throughput.

SBADR shows a significant enhancement in received data bytes, which are 1,709, 788 and 326 more in comparison of AODV, RSAODV and RSQR, respectively. PDR increased by 21.27%, 12.1%, 4.15%, and NCO decreased by 9.67%, 5.93%, 2.8% in comparison of AODV, RSAODV and RSQR, respectively.

Outcomes show SBADR will perform better with applications of MANET such as disaster recovery, city tours, university or hospital networks, etc. SBADR is suitable for every application of MANET having random and high mobility.

This is to certify that the reported work in the paper entitled “SBADR: stable and bandwidth aware dynamic routing protocol for mobile ad hoc network” is an original one and has not been submitted for publication elsewhere. The authors further certify that proper citations to the previously reported work have been given and no data/tables/figures have been quoted verbatim from the other publications without giving due acknowledgment and without permission of the author(s).

The paper aims to investigate performance benefits associated with adopting a mobile wireless sensor network (WSN). Sensor nodes are generally energy constrained due to the latter being acquired from onboard battery cells. If one or more sensor nodes fail, possible coverage holes may be created which could invariantly lead to a reduced network lifetime. The paper proposes that instead of rendering the entire WSN inoperative, sensor nodes should physically change position within the region of interest thus adaptively altering the WSN topology with a view of recovering from failures. This type of motion will be referred to as “self healing”.

This paper presents a mobility scheme based on Bayesian networks for predictive reasoning (BayesMob) which is essentially a distributed self healing algorithm for coordinating physical relocation of sensor nodes. Using the algorithm, sensor nodes can predict the performance of the WSN in terms of coverage given that the node moves in a given direction. The evidence for this hypothesis is acquired from local neighborhood information.

The paper compares BayesMob with an alternative algorithm – Coverage Fidelity Algorithm – and shows that BayesMob maintains a higher level WSN coverage for a greater percentage of failures, thus increasing the useful lifetime of the WSN.

The physical relocation of sensor nodes will incur energy overhead, therefore the tradeoffs between all application criteria should be investigated before implementation.

This paper presents a Bayesian network based motion coordination algorithm for WSN which repairs coverage holes caused by energy exhaustion and/or abrupt node failures.

The purpose of this study is to extensively explore the vehicular network paradigm, challenges faced by them and provide a reasonable solution for securing these vulnerable networks. Vehicle-to-everything (V2X) communication has brought the long-anticipated goal of safe, convenient and sustainable transportation closer to reality. The connected vehicle (CV) paradigm is critical to the intelligent transportation systems vision. It imagines a society free of a troublesome transportation system burdened by gridlock, fatal accidents and a polluted environment. The authors cannot overstate the importance of CVs in solving long-standing mobility issues and making travel safer and more convenient. It is high time to explore vehicular networks in detail to suggest solutions to the challenges encountered by these highly dynamic networks.

This paper compiles research on various V2X topics, from a comprehensive overview of V2X networks to their unique characteristics and challenges. In doing so, the authors identify multiple issues encountered by V2X communication networks due to their open communication nature and high mobility, especially from a security perspective. Thus, this paper proposes a trust-based model to secure vehicular networks. The proposed approach uses the communicating nodes’ behavior to establish trustworthy relationships. The proposed model only allows trusted nodes to communicate among themselves while isolating malicious nodes to achieve secure communication.

Despite the benefits offered by V2X networks, they have associated challenges. As the number of CVs on the roads increase, so does the attack surface. Connected cars provide numerous safety-critical applications that, if compromised, can result in fatal consequences. While cryptographic mechanisms effectively prevent external attacks, various studies propose trust-based models to complement cryptographic solutions for dealing with internal attacks. While numerous trust-based models have been proposed, there is room for improvement in malicious node detection and complexity. Optimizing the number of nodes considered in trust calculation can reduce the complexity of state-of-the-art solutions. The theoretical analysis of the proposed model exhibits an improvement in trust calculation, better malicious node detection and fewer computations.

The proposed model is the first to add another dimension to trust calculation by incorporating opinions about recommender nodes. The added dimension improves the trust calculation resulting in better performance in thwarting attacks and enhancing security while also reducing the trust calculation complexity.

This paper aims to determine the network efficient topology for low power and lossy networks (LLNs) using routing protocol for LLN (RPL) with respect to the increase in network size and propose a novel approach to overcome the shortcomings of the existing models.

The authors have used Contiki OS/Cooja simulator to conduct experiments on primarily four topologies (star, bus/linear, ring/eclipse and random). They have implemented RPL protocol using Sky motes for each topology from 10, 20, 30 and up to 70 nodes. Consequently, after 24 h of experimentation, the readings have been noted and, alongside, a comprehensive comparative analysis has been performed based on the network density and metric parameters: packet delivery ratio (PDR), expected transmission (ETX) and power consumption. Further, a hybrid model is proposed where the additional factors of mobility, multiple sink and a combination of static and mobile nodes are introduced. The proposed model is then compared with the star model (all static nodes and star topology) and the dynamic model (all mobile nodes) to analyze the efficiency and network performance for different network sizes (28, 36, 38 and 44 nodes). The mobility is introduced using BonnMotion tool in Contiki OS.

Simulation results have shown that the star topology is most network efficient when compared with bus/linear, ring/eclipse and random topologies for low density and high scalable network. But when the same setup is compared with the proposed hybrid model, the proposed model shows a significant improvement and gives the best and efficient network performance with highest PDR (average improvement approximately 44.5%) and lowest ETX (average improvement approximately 49.5%) comparatively.

Also, these findings will benefit the deployment of smart devices used in advanced metering infrastructure, road side units and in various industrial applications such as traffic monitoring system, electronic toll collection and traffic analysis in the smart grid infrastructure.

The impact of topology is significant and detailed analysis is required to understand the impact of different topologies of the nodes in the network for the present and the future scenarios. As very few research studies have discussed this gap, this research paper is quintessential and shall open novel future potential direction. Also, the proposed approach of hybrid model with mobility has not been considered in the literature yet.