Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
2,688
result(s) for
"Routing protocols (Computer network protocols)"
Sort by:
An Energy Efficient Localization-Free Routing Protocol for Underwater Wireless Sensor Networks
Recently, underwater wireless sensor networks (UWSNs) have attracted much research attention from both academia and industry, in order to explore the vast underwater environment. UWSNs have peculiar characteristics; that is, they have large propagation delay, high error rate, low bandwidth, and limited energy. Therefore, designing network/routing protocols for UWSNs is very challenging. Also, in UWSNs, improving the energy efficiency is one of the most important issues since the replacement of the batteries of underwater sensor nodes is very expensive due to the unpleasant underwater environment. In this paper, we therefore propose an energy efficient routing protocol, named (energy-efficient depth-based routing protocol) EEDBR for UWSNs. EEDBR utilizes the depth of sensor nodes for forwarding data packets. Furthermore, the residual energy of sensor nodes is also taken into account in order to improve the network lifetime. Based on the comprehensive simulation using NS2, we observe that EEDBR contributes to the performance improvements in terms of the network lifetime, energy consumption, and end-to-end delay. A previous version of this paper was accepted in AST-2011 conference.
Journal Article
ZBP-MM: Zone-based producer mobility management protocol in named data networking for Internet of Things
The Internet of Things (IoT) is a diverse technology that primarily utilizes TCP/IP protocols in IoT environments. However, it is often argued that the existing IP protocol stack is insufficient to support data sharing and storage capabilities for mobile IoT applications. Named Data Networking (NDN) has gained significant attention over time as a solution to the limitations of host-centric services in traditional IP networks. The key advantages of NDN include name-based routing and network caching, along with mobility support in wireless networks. The integration of NDN and IoT can address issues related to frequent node mobility, name-based routing, and storage constraints on resource-limited devices. IoT devices are frequently in mobility, creating routing challenges when transitioning from one domain to another. Interest packets remain unsatisfied until the producer reconnects to a new Point of Attachment (PoA) and updates its location. Despite these reconnections, challenges such as interest and data packet losses, increased latency, and suboptimal routing paths persist during communication. Consequently, managing producer mobility remains difficult during the frequent movement of nodes across different IoT domains. This paper proposes a novel Zone-Based Producer Mobility Management (ZBP-MM) protocol for NDN-based IoT environments. The proposed technique is evaluated and compared against the OPMSS scheme using the ndnSIM simulator. Results demonstrated that the proposed scheme achieves better hop count and cache hit ratio, with minimized interest satisfaction delay and handover delay, compared to the OPMSS technique during producer mobility scenarios in intra- and inter-zones.
Journal Article
Cost analysis of IPv6 distributed mobility management protocols in comparison with TFMIPv6
The past decade has witnessed a significant evolution in the role of the Internet, transitioning from individual connectivity to an integral aspect of various domains. This shift has prompted a move in IP paradigms from hierarchical to distributed architectures characterized by decentralized structures. This transition empowers efficient data routing and management across diverse networks. However, traditional distributed mobility management (DMM) protocols, reliant on tunneling mechanisms, incur overheads, costs, and delays, exacerbating challenges in managing the exponential growth of mobile data traffic. This research proposes Tunnel-Free Mobility for IPv6 (TFMIPv6) as a solution to address the shortcomings of existing DMM protocols. TFMIPv6 eliminates the need for tunneling, simplifying routing processes and reducing latency. A comprehensive cost analysis and performance evaluation are conducted, comparing TFMIPv6 with traditional protocols such as MIPv6, PMIPv6, FMIPv6, and HMIPv6. The study reveals significant improvements with TFMIPv6. Signaling costs are reduced by 50%, packet delivery costs by 23%, and tunneling costs are completely eliminated (100%). Real-world network traffic datasets are used for simulation, providing statistical evidence of TFMIPv6’s efficacy in supporting an uninterrupted movement of IPv6 data across networks.
Journal Article
An ICN-Based On-Path Computing Resource Scheduling Architecture with User Preference Awareness for Computing Network
The Computing Network is an emerging network paradigm that aims to realize computing resource scheduling through the intrinsic capabilities of the network. However, existing resource scheduling architectures based on conventional TCP/IP networks for the Computing Network suffer from deficiencies in routing flexibility and a lack of user preference awareness, while Information-Centric Networking (ICN) holds the potential to address these issues. ICN inherently supports dynamic routing in scenarios such as multi-homing and mobility due to its routing mechanism that is based on content names rather than host addresses, and it is further enhanced by the integration with Software-Defined Networking (SDN) technologies, which facilitate convenient network-layer route readdressing, thus offering a conducive environment for flexible routing scheduling. Furthermore, ICN introduces novel routing protocols that, compared with the more rigid protocol designs in conventional TCP/IP networks, offer greater flexibility in field usage. This flexibility allows for the incorporation of customized fields, such as “preference”, enabling the perception of user preferences within the network. Therefore, this paper proposes a novel ICN-based on-path computing resource scheduling architecture named IPCRSA. Within this architecture, an original design for computing resource request packet format is developed based on the IPv6 extension header. Additionally, preference-based computing resource scheduling strategies are incorporated, which employ the technique for order preference by similarity to ideal solution (TOPSIS) combined with the entropy weight method, to comprehensively evaluate computing resource nodes and use a roulette-selection algorithm to accomplish the probability selection of destination nodes. Experimental results indicate that, in comparison to alternative scheduling schemes, IPCRSA exhibits significant advantages in enhancing scheduling flexibility, improving scheduling success rates, and catering to diverse user requirements.
Journal Article
Q-RPL: Q-Learning-Based Routing Protocol for Advanced Metering Infrastructure in Smart Grids
Efficient and reliable data routing is critical in Advanced Metering Infrastructure (AMI) within Smart Grids, dictating the overall network performance and resilience. This paper introduces Q-RPL, a novel Q-learning-based Routing Protocol designed to enhance routing decisions in AMI deployments based on wireless mesh technologies. Q-RPL leverages the principles of Reinforcement Learning (RL) to dynamically select optimal next-hop forwarding candidates, adapting to changing network conditions. The protocol operates on top of the standard IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL), integrating it with intelligent decision-making capabilities. Through extensive simulations carried out in real map scenarios, Q-RPL demonstrates a significant improvement in key performance metrics such as packet delivery ratio, end-to-end delay, and compliant factor compared to the standard RPL implementation and other benchmark algorithms found in the literature. The adaptability and robustness of Q-RPL mark a significant advancement in the evolution of routing protocols for Smart Grid AMI, promising enhanced efficiency and reliability for future intelligent energy systems. The findings of this study also underscore the potential of Reinforcement Learning to improve networking protocols.
Journal Article
Formal modeling and analysis of security schemes of RPL protocol using colored Petri nets
In the Internet of things (IoT), data packets are accumulated and disseminated across IoT devices without human intervention, therefore the privacy and security of sensitive data during transmission are crucial. For this purpose, multiple routing techniques exist to ensure security and privacy in IoT Systems. One such technique is the routing protocol for low power and lossy networks (RPL) which is an IPv6 protocol commonly used for routing in IoT systems. Formal modeling of an IoT system can validate the reliability, accuracy, and consistency of the system. This paper presents the formal modeling of RPL protocol and the analysis of its security schemes using colored Petri nets that applies formal validation and verification for both the secure and non-secure modes of RPL protocol. The proposed approach can also be useful for formal modeling-based verification of the security of the other communication protocols.
Journal Article
A survey of Sybil attack countermeasures in IoT-based wireless sensor networks
Wireless sensor networks (WSN) have been among the most prevalent wireless innovations over the years exciting new Internet of Things (IoT) applications. IoT based WSN integrated with Internet Protocol IP allows any physical objects with sensors to be connected ubiquitously and send real-time data to the server connected to the Internet gate. Security in WSN remains an ongoing research trend that falls under the IoT paradigm. A WSN node deployed in a hostile environment is likely to open security attacks such as Sybil attack due to its distributed architecture and network contention implemented in the routing protocol. In a Sybil attack, an adversary illegally advertises several false identities or a single identity that may occur at several locations called Sybil nodes. Therefore, in this paper, we give a survey of the most up-to-date assured methods to defend from the Sybil attack. The Sybil attack countermeasures includes encryption, trust, received signal indicator (RSSI), encryption and artificial intelligence. Specifically, we survey different methods, along with their advantages and disadvantages, to mitigate the Sybil attack. We discussed the lesson learned and the future avenues of study and open issues in WSN security analysis.
Journal Article
Novel Modification of Integrated Optimization Method for Sensor’s Communication in Wi-Fi Public Networks
A novel modification of IP networks integrated optimization method for heterogeneous networks, for example, the seamless Wi-Fi network serving simultaneously mobile users and wireless sensors, has been developed in this article. The mutual influence of signal reception, frequency-territorial planning, and routing procedures in heterogeneous networks have been analyzed in the case of simultaneous data transmission by both mobile users and wireless sensors. New principles for the listed procedures interaction and the basic functions for their describing are formulated. A novel modification of the integrated optimization method and its algorithm have been developed. The developed method's effectiveness has been analyzed for the IEEE 802.11ax network segment. Its result showed that the network load was decreased by an average of 20%, the data rate over the network as a whole increased for users and sensors by an average of 25% and 40%, respectively, and the sensors’ lifetime increased by an average of 20% compared to the novel modification of the Collective Dynamic Routing method.
Journal Article
Toward Improved RPL: A Congestion Avoidance Multipath Routing Protocol with Time Factor for Wireless Sensor Networks
Designing routing protocols in Low power and Lossy Networks (LLNs) imposes great challenges. In emergency scenarios, the large and rapid data traffic caused by emergencies will lead to network congestion and bring about significant packet loss and delay. Routing protocol for LLNs (RPL) is the IETF standard for IPv6 routing in LLNs. The basic version of RPL uses Expected Transmission Count (ETX) as the default routing metric; it cannot solve the problem of sudden large data traffic. In this paper, we propose a congestion avoidance multipath routing protocol which uses composite routing metrics based on RPL, named CA-RPL. A routing metric for RPL that minimized the average delay towards the DAG root is proposed, and the weight of each path is computed by four metrics. The mechanism is explained and its performance is evaluated through simulation experiments based on Contiki. Simulation results show that the proposed CA-RPL reduces the average time delay by about 30% compared to original RPL when the interpacket interval is short and has almost 20% reduction in packet loss ratio. The CA-RPL can effectively alleviate the network congestion in the network with poor link quality and large data traffic and significantly improve the performance of LLNs.
Journal Article