Relevant bibliographies by topics / Nodal routing

Academic literature on the topic 'Nodal routing'

Author: Grafiati
Published: 30 May 2022
Last updated: 31 May 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Nodal routing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Nodal routing"

1

Ichaba, Mutuma, and Felix Musau. "Minimizing Routing Overheads in Zone Routing Protocol (ZRP); Replacing Zone Radius with Node Location Information." International Journal of Computer Applications Technology and Research 11, no. 04 (April 2022): 145–54. http://dx.doi.org/10.7753/ijcatr1104.1007.

Full text
Abstract:
There are many routing protocols suggested for use in Mobile Ad Hoc Networks (MANETs). Among them (the routing protocols) is the Zone Routing Protocol (ZRP). ZRP uses the concept of zones to ensure that proactive activities are limited to a defined area around a node. The zone is determined by the radius (hops). By limiting a proactive zone on the radius, the transmission of data packets is made effective. However, any node that resides beyond the zone, is reachable reactively. The literature review indicates that one of the shortcomings in ZRP is the overlapping of zones. Furthermore, the exercise of determining zone radius is complicated. The overlapping of zones occurs because individual nodes and their zones are determined by a hop-count radius. Consequently, this overlapping of zones leads to increased routing overhead in ZRP. In an effort to resolve zone overlapping and thus reduce routing overheads, this study suggests the application of the Location-Aided Routing (LAR) Scheme I in the Interzone Routing Protocol (IARP) scheme of ZRP. By applying LAR Scheme 1 algorithm, the need for a hop-count-based radius is eliminated. Location information of nodes in IARP ensures that zones do not overlap, resulting in reduced routing overheads. This study simulates elementary parameters of delay, drop rates, deliver ratio, and the general throughput of ZRP based on the number of nodes, the area, and the size of the data packets. The conventional algorithm of ZRP was rendered on NS-2 and while the nodal-location enhanced ZRP algorithm on OMNET++. Simulation results suggest that the positionally enhanced ZRP algorithm minimizes zonal overlapping hence better data packets throughput, minimized delay and drop rates, and augmented data packets delivery ratio.
APA, Harvard, Vancouver, ISO, and other styles
2

Bai, Bing, Zhenqian Feng, Baokang Zhao, and Jinshu Su. "Benefiting from the community structure in opportunistic forwarding." Computer Science and Information Systems 10, no. 2 (2013): 865–76. http://dx.doi.org/10.2298/csis120921038b.

Full text
Abstract:
In Delay Tolerant Networks (DTNs), an end-to-end connectivity cannot be assumed for node mobility and lack of infrastructure. Due to the uncertainty in nodal mobility, routing in DTNs becomes a challenging problem. To cope with this, many researchers proposed opportunistic routing algorithms based on some utilities. However, these simple metrics may only capture one facet of the single node?s mobility process, which cannot reflect the inherent structure of the networks well. Recently, some researchers introduce the Complex network analysis (CNA) to formulate and predict the future contact in DTNs. The community structure is one of the most important properties of CNA. And it reveals the inherent structure of the complex network. In this paper, we present a community-based single-copy forwarding protocol for DTNs routing, which efficiently utilizes the community structure to improve the forwarding efficiency. Simulation results are presented to support the effectiveness of our scheme.
APA, Harvard, Vancouver, ISO, and other styles
3

Chikh, Asma, and Mohamed Lehsaini. "Link Quality and Load Balancing Multipath Geographic Routing for Wireless Multimedia Sensor Networks." International Journal of Wireless Networks and Broadband Technologies 10, no. 1 (January 2021): 45–58. http://dx.doi.org/10.4018/ijwnbt.2021010103.

Full text
Abstract:
Multimedia applications in wireless multimedia sensor networks (WMSNs) demand a high level of quality of service (QoS) requirements. The multipath routing approach is considered as an effective solution to meet these requirements. However, the high-energy consumption in WMSNs is a critical concern for lifetime of network contains sensor nodes with limited battery. Many proposed works have designed multipath routing protocols to provide load balancing between discovered paths, although there is a trade-off between power efficiency and data delivery. This paper proposes a link quality and load balancing multipath geographic routing (LQLB-MGR) protocol for WMSNs. This protocol consists of two phases. The first phase is responsible to find multiple node-disjoint paths with high link quality and the second phase allows load balancing between the discovered paths based on nodal residual energy. Simulation results show that LQLB-MGR provides better performance compared to other protocols.
APA, Harvard, Vancouver, ISO, and other styles
4

Das, Priyanka, Prosenjit Chowdhury, Bikash Poudel, and Tanmay De. "Fibonary Spray and Wait Routing in Delay Tolerant Networks." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 6 (December 1, 2016): 3205. http://dx.doi.org/10.11591/ijece.v6i6.10361.

Full text
Abstract:
<p>Although there has been a tremendous rise in places being connected through the Internet or any other network protocol, there still lie areas, which remain out of reach due to various reasons. For all such places the answer is a Delay Tolerant Network (DTN). A DTN is such a network where there is no fixed or predefined route for messages and no such guarantee whatsoever of all messages being correctly routed. DTN can be considered as a superset of networks wherein other networks such as adhoc, mobile, vehicular etc. form the subset. Therefore routing in DTN is a very chancy affair where one has to maximize on the present network scenarios to get any fruitful result other than depending on past information. Also protocols here need to be less complex and not increase the already high nodal overhead. In this paper we propose a new approach, the Fibonary Spray and Wait, which does exactly this. It forwards copies of a message in a modified Binary Spray and Wait manner so that it performs well even in non independent and identically distributed node structure. We have supported our statements with mathematical as well as simulation analysis.</p>
APA, Harvard, Vancouver, ISO, and other styles
5

Das, Priyanka, Prosenjit Chowdhury, Bikash Poudel, and Tanmay De. "Fibonary Spray and Wait Routing in Delay Tolerant Networks." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 6 (December 1, 2016): 3205. http://dx.doi.org/10.11591/ijece.v6i6.pp3205-3216.

Full text
Abstract:
<p>Although there has been a tremendous rise in places being connected through the Internet or any other network protocol, there still lie areas, which remain out of reach due to various reasons. For all such places the answer is a Delay Tolerant Network (DTN). A DTN is such a network where there is no fixed or predefined route for messages and no such guarantee whatsoever of all messages being correctly routed. DTN can be considered as a superset of networks wherein other networks such as adhoc, mobile, vehicular etc. form the subset. Therefore routing in DTN is a very chancy affair where one has to maximize on the present network scenarios to get any fruitful result other than depending on past information. Also protocols here need to be less complex and not increase the already high nodal overhead. In this paper we propose a new approach, the Fibonary Spray and Wait, which does exactly this. It forwards copies of a message in a modified Binary Spray and Wait manner so that it performs well even in non independent and identically distributed node structure. We have supported our statements with mathematical as well as simulation analysis.</p>
APA, Harvard, Vancouver, ISO, and other styles
6

Alghamdi, Saleh A. "Load balancing maximal minimal nodal residual energy ad hoc on-demand multipath distance vector routing protocol (LBMMRE-AOMDV)." Wireless Networks 22, no. 4 (August 11, 2015): 1355–63. http://dx.doi.org/10.1007/s11276-015-1029-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Avvedimento, Stefania, Sara Todeschini, Carlo Giudicianni, Armando Di Nardo, Tom Walski, and Enrico Creaco. "Flowing Blow-Offs: A Solution to Maintain Adequate Disinfectant Residuals of Dead-End Nodes in WDNs." Proceedings 48, no. 1 (November 12, 2019): 20. http://dx.doi.org/10.3390/ecws-4-06443.

Full text
Abstract:
Flushing plans within a water distribution network (WDN) provide a tool for improving disinfectant residuals and removing stagnant water. The problem of low disinfectant residuals occurs in areas of a WDN such as dead-end nodes, in which low flow conditions and long residence times lead to excessive decay of the disinfectant upstream from users. Here, a methodology is presented to maintain adequate disinfectant residuals in WDNs that have numerous dead-end nodes. The slight increase in nodal outflows at these sites, which can be obtained through the opening of a blow-off at the hydrant site, can help in tackling this problem. The methodology is based on the combined use of optimization and of flow routing/water quality modelling. The concentration of disinfectant at the source(s) and the values of nodal emitter coefficients at the critical dead-end nodes are the decisional variables to be optimized. Two objective functions are considered in the optimization, namely the total volume of water delivered in the network and the total mass of disinfectant injected into the network. The effectiveness of the methodology is proven on a real WDN, yielding an insight into the economic feasibility of the solution.
APA, Harvard, Vancouver, ISO, and other styles
8

Mohanaprakash, K., and T. GunaSekar. "Efficient and Secure Remote Health Management in Cloud in Vehicular Adhoc Network Environment." Journal of Medical Imaging and Health Informatics 11, no. 12 (December 1, 2021): 2966–75. http://dx.doi.org/10.1166/jmihi.2021.3905.

Full text
Abstract:
Vehicle Ad Hoc Networks (VANETs) is a crucial communications framework for transferring messages between any healthcare systems. The dilemma of fixing the safest efficient route is a tedious issue in VANET. Hence the secure and most reliable way will give the appropriate solution for the routing issues in the VANET. In this paper, by using the Multi-Objective Bio-inspired Heuristic Cuckoo Search Node optimization algorithm is designed to find the efficient safest route for transferring health data within a short period. After seeing the efficient route, the node can be distinguished upon the traffic and security by using the Stochastic Discriminant Random Forest Node Classifier. Then in the selected route, the nodal distance can be calculated by applying the delay-based weighted end-to-end approach for traffic analysis. Then the authentic vehicle node can be analyzed through the Trust Aware extreme Gradient Boosting Node Classification based Secured Routing (TAXGBNC-SR) Technique. The obtained information that can be stored in the cloud. It deal with the multiple number of tasks gives to the ARM micro-controllers in order to perform the multiple tasks that gets logged in the cloud via Internet of Things technology (Iot).
APA, Harvard, Vancouver, ISO, and other styles
9

Latif, Kamran, Nadeem Javaid, Imdad Ullah, Zeeshan Kaleem, Zafar Abbas Malik, and Long D. Nguyen. "DIEER: Delay-Intolerant Energy-Efficient Routing with Sink Mobility in Underwater Wireless Sensor Networks." Sensors 20, no. 12 (June 19, 2020): 3467. http://dx.doi.org/10.3390/s20123467.

Full text
Abstract:
Underwater Wireless Sensor Networks (UWSNs) are an enabling technology for many applications in commercial, military, and scientific domains. In some emergency response applications of UWSN, data dissemination is more important, therefore these applications are handled differently as compared to energy-focused approaches, which is only possible when propagation delay is minimized and packet delivery at surface sinks is assured. Packet delivery underwater is a serious concern because of harsh underwater environments and the dense deployment of nodes, which causes collisions and packet loss. Resultantly, re-transmission causes energy loss and increases end-to-end delay ( D E 2 E ). In this work, we devise a framework for the joint optimization of sink mobility, hold and forward mechanisms, adoptive depth threshold ( d t h ) and data aggregation with pattern matching for reducing nodal propagation delay, maximizing throughput, improving network lifetime, and minimizing energy consumption. To evaluate our technique, we simulate the three-dimensional (3-D) underwater network environment with mobile sink and dense deployments of sensor nodes with varying communication radii. We carry out scalability analysis of the proposed framework in terms of network lifetime, throughput, and packet drop. We also compare our framework to existing techniques, i.e., Mobicast and iAMCTD protocols. We note that adapting varying d t h based on node density in a range of network deployment scenarios results in a reduced number of re-transmissions, good energy conservation, and enhanced throughput. Furthermore, results from extensive simulations show that our proposed framework achieves better performance over existing approaches for real-time delay-intolerant applications.
APA, Harvard, Vancouver, ISO, and other styles
10

Noureddine, Seddiki, Benahmed Khelifa, and Belgachi Mohammed. "Approach to minimizing consumption of energy in wireless sensor networks." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 3 (June 1, 2020): 2551. http://dx.doi.org/10.11591/ijece.v10i3.pp2551-2561.

Full text
Abstract:
The Wireless Sensor Networks (WSN) technology has benefited from a central position in the research space of future emerging networks by its diversity of applications fields and also by its optimization techniques of its various constraints, more essentially, the minimization of nodal energy consumption to increase the global network lifetime. To answer this saving energy problem, several solutions have been proposed at the protocol stack level of the WSN. In this paper, after presenting a state of the art of this technology and its conservation energy techniques at the protocol stack level, we were interested in the network layer to propose a routing solution based on a localization aspect that allows the creation of a virtual grid on the coverage area and introduces it to the two most well-known energy efficiency hierarchical routing protocols, LEACH and PEGASIS. This allowed us to minimize the energy consumption and to select the clusters heads in a deterministic way unlike LEACH which is done in a probabilistic way and also to minimize the latency in PEGASIS, by decomposing its chain into several independent chains. The simulation results, under "MATLABR2015b", have shown the efficiency of our approach in terms of overall residual energy and network lifetime.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Nodal routing"

1

Скулиш, Марія Анатоліївна. "Метод оцінки якості обслуговування інформаційних потоків в мультисервісних мережах зв'язку." Doctoral thesis, 2010. https://ela.kpi.ua/handle/123456789/673.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Nodal routing"

1

Tode, H., Y. Sakai, M. Yamamoto, H. Okada, and Y. Tezuka. "Multicast routing algorithm for nodal load balancing." In [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications. IEEE, 1992. http://dx.doi.org/10.1109/infcom.1992.263481.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dan, Liu, and Qianzhi Hong. "Study on ZigBee Network Routing Based on Nodal Heterogeneity." In 2009 International Conference on Communication Software and Networks. IEEE, 2009. http://dx.doi.org/10.1109/iccsn.2009.49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rani, P. Vimala, and S. Mercy Shalinie. "Efficient cache distribution using hash-routing schemes and nodal clustering for information centric network." In 2017 Fourth International Conference on Signal Processing,Communication and Networking (ICSCN). IEEE, 2017. http://dx.doi.org/10.1109/icscn.2017.8085718.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Toreja, Allen J., and Rizwan-Uddin. "Improving the Efficiency of the Nodal Integral Method With the Portable, Extensible Toolkit for Scientific Computation." In 10th International Conference on Nuclear Engineering. ASMEDC, 2002. http://dx.doi.org/10.1115/icone10-22684.

Full text
Abstract:
An existing implementation of the nodal integral method for the time-dependent convection-diffusion equation is modified to incorporate various PETSc (Portable, Extensible Toolkit for Scientific Computation) solver and preconditioner routines. In the modified implementation, the default iterative Gauss-Seidel solver is replaced with one of the following PETSc iterative linear solver routines: Generalized Minimal Residuals, Stabilized Biconjugate Gradients, or Transpose-Free Quasi-Minimal Residuals. For each solver, a Jacobi or a Successive Over-Relaxation preconditioner is used. Two sample problems, one with a low Peclet number and one with a high Peclet number, are solved using the new implementation. In all the cases tested, the new implementation with the PETSc solver routines outperforms the original Gauss-Seidel implementation. Moreover, the PETSc Stabilized Biconjugate Gradients routine performs the best on the two sample problems leading to CPU times that are less than half the CPU times of the original implementation.
APA, Harvard, Vancouver, ISO, and other styles
5

He, Ling, Jun Huang, and Feng Yang. "A noval hybrid wireless routing protocol for WMNs." In 2010 International Conference on Electronics and Information Engineering (ICEIE 2010). IEEE, 2010. http://dx.doi.org/10.1109/iceie.2010.5559874.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Nodal routing' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography