Journal articles on the topic 'Minimum routing overhead'
To see the other types of publications on this topic, follow the link: Minimum routing overhead.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Minimum routing overhead.'
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.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Bindhu, M., Beulah Jackson, and S. Asha. "Secured Routing Using Neighbour Coverage with Minimum Overhead in Ad Hoc Networks." Journal of Computational and Theoretical Nanoscience 17, no. 4 (April 1, 2020): 1867–70. http://dx.doi.org/10.1166/jctn.2020.8456.
Full textAbstract:
A wireless ad hoc network is a dispersed type of wireless network. The network is called as ad hoc as it does not rely on any pre existing infrastructure. Routing decisions are ready by node itself, so the determination of which node to forward data is prepared dynamically based on network connectivity. The overhead of a route discovery cannot be neglected. In this, Neighbour coverage protocol proposes for reducing routing overhead and to utilize the neighbour coverage knowledge and the probabilistic mechanism, which can radically decrease the number of retransmissions to reduce the routing overhead, and can also improve the routing performance. Due to high mobility of nodes in ad hoc networks, there exist regular link breakages, which lead to frequent path failures and route discoveries. ALERT dynamically partitions the network field into zones and arbitrarily chooses nodes in zones as intermediate relay nodes, which form a non-traceable unsigned route. In addition, it conceals the data initiator/receiver among many initiators/receivers to build up source and destination anonymity protection. Thus, ALERT offers anonymity security to sources, destinations, and routes for effective counter intersection and timing attacks and overheads are reduced.
2
Latha N R and G. R. Prasad. "Memory and I/O Optimized Rectilinear Steiner Minimum Tree Routing For VLSI." International Journal of Electronics, Communications, and Measurement Engineering 9, no. 1 (January 2020): 46–59. http://dx.doi.org/10.4018/ijecme.2020010104.
Full textAbstract:
As the size of devices are scaling down at rapid pace, the interconnect delay play a major part in performance of IC chips. Therefore minimizing delay and wire length is the most desired objective. FLUTE (Fast Look-Up table) presented a fast and accurate RSMT (Rectilinear Steiner Minimum Tree) construction for both smaller and higher degree net. In this paper, FLUTE presented an optimization technique that reduces time complexity for RSMT construction for both smaller and larger degree nets. However for larger degree net this technique induces memory overhead, as it does not consider the memory requirement in constructing RSMT. Since availability of memory is very less and is expensive, it is desired to utilize memory more efficiently which in turn results in reducing I/O time (i.e. reduce the number of I/O disk access). The proposed work presents a Memory Optimized RSMT (MORSMT) construction in order to address the memory overhead for larger degree net. The depth-first search and divide and conquer approach is adopted to build a Memory optimized tree. Experiments are conducted to evaluate the performance of proposed approach over existing model for varied benchmarks in term of computation time, memory overhead and wire length. The experimental results show that the proposed model is scalable and efficient.
3
N. R., Latha, and G. R. Prasad. "Memory and I/O optimized rectilinear steiner minimum tree routing for VLSI." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 3 (June 1, 2020): 2959. http://dx.doi.org/10.11591/ijece.v10i3.pp2959-2968.
Full textAbstract:
As the size of devices are scaling down at rapid pace, the interconnect delay play a major part in performance of IC chips. Therefore minimizing delay and wire length is the most desired objective. FLUTE (Fast Look-Up table) presented a fast and accurate RSMT (Rectilinear Steiner Minimum Tree) construction for both smaller and higher degree net. FLUTE presented an optimization technique that reduces time complexity for RSMT construction for both smaller and larger degree nets. However for larger degree net this technique induces memory overhead, as it does not consider the memory requirement in constructing RSMT. Since availability of memory is very less and is expensive, it is desired to utilize memory more efficiently which in turn results in reducing I/O time (i.e. reduce the number of I/O disk access). The proposed work presents a Memory Optimized RSMT (MORSMT) construction in order to address the memory overhead for larger degree net. The depth-first search and divide and conquer approach is adopted to build a Memory optimized tree. Experiments are conducted to evaluate the performance of proposed approach over existing model for varied benchmarks in terms of computation time, memory overhead and wire length. The experimental results show that the proposed model is scalable and efficient.
4
Katiravan, Jeevaa, D. Sylvia, and D. Srinivasa Rao. "Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks." Scientific World Journal 2015 (2015): 1–7. http://dx.doi.org/10.1155/2015/576754.
Full textAbstract:
In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.
5
Kamboj, Pariza, and Ashok K. Sharma. "Energy Efficient Multicast Routing Protocol for MANET with Minimum Control Overhead (EEMPMO)." International Journal of Computer Applications 8, no. 7 (October 10, 2010): 1–11. http://dx.doi.org/10.5120/1224-1780.
Full text
6
Tariq, Rehan, Zeshan Iqbal, and Farhan Aadil. "IMOC: Optimization Technique for Drone-Assisted VANET (DAV) Based on Moth Flame Optimization." Wireless Communications and Mobile Computing 2020 (November 7, 2020): 1–29. http://dx.doi.org/10.1155/2020/8860646.
Full textAbstract:
Technology advancement in the field of vehicular ad hoc networks (VANETs) improves smart transportation along with its many other applications. Routing in VANETs is difficult as compared to mobile ad hoc networks (MANETs); topological constraints such as high mobility, node density, and frequent path failure make the VANET routing more challenging. To scale complex routing problems, where static and dynamic routings do not work well, AI-based clustering techniques are introduced. Evolutionary algorithm-based clustering techniques are used to solve such routing problems; moth flame optimization is one of them. In this work, an intelligent moth flame optimization-based clustering (IMOC) for a drone-assisted vehicular network is proposed. This technique is used to provide maximum coverage for the vehicular node with minimum cluster heads (CHs) required for routing. Delivering optimal route by providing end-to-end connectivity with minimum overhead is the core issue addressed in this article. Node density, grid size, and transmission ranges are the performance metrics used for comparative analysis. These parameters were varied during simulations for each algorithm, and the results were recorded. A comparison was done with state-of-the-art clustering algorithms for routing such as Ant Colony Optimization (ACO), Comprehensive Learning Particle Swarm Optimization (CLPSO), and Gray Wolf Optimization (GWO). Experimental outcomes for IMOC consistently outperformed the state-of-the-art techniques for each scenario. A framework is also proposed with the support of a commercial Unmanned Aerial Vehicle (UAV) to improve routing by minimizing path creation overhead in VANETs. UAV support for clustering improved end-to-end connectivity by keeping the routing cost constant for intercluster communication in the same grid.
7
Li, Yanhua, Abedelaziz Mohaisen, and Zhi-Li Zhang. "Trading Optimality for Scalability in Large-Scale Opportunistic Routing." Vehicular Technology, IEEE Transactions on 62, no. 5 (June 2013): 2253–63. http://dx.doi.org/10.1109/tvt.2012.2237045.
Full textAbstract:
Opportunistic routing utilizes the broadcast nature of wireless networks, significantly promoting the unicast throughput. Many variations of opportunistic routing designs have been proposed, although all of the current designs consistently rely on all of the topology information to construct forwarder lists and process data forwarding, which indeed restricts the application in large-scale wireless networks, where collecting global optimal information is very costly. In this paper, we propose the localized opportunistic routing (LOR) protocol, which utilizes the distributed minimum transmission selection (MTS-B) algorithm to partition the topology into several nested close-node-sets (CNSs) using local information. LOR can locally realize the optimal opportunistic routing for a large-scale wireless network with low control overhead cost. Since it does not use global topology information, LOR highlights an interesting tradeoff between the global optimality of the used forwarder lists and scalability inferred from the incurred overhead. Extensive simulation results show that LOR dramatically improves performances over extremely opportunistic routing (ExOR) and MAC-independent opportunistic routing protocol (MORE), which are two well-known designs from the literature, in terms of control overhead, end-to-end delay, and throughputs. It also exhibits promising performance in vehicular ad hoc networks (VANETs).
8
Yu, Yang, Mangui Liang, and Zhiyu Liu. "An optimized node-disjoint multipath routing scheme in mobile ad hoc." International Journal of Modern Physics C 27, no. 07 (May 24, 2016): 1650080. http://dx.doi.org/10.1142/s0129183116500807.
Full textAbstract:
In mobile ad hoc networks (MANETs), link failures are caused frequently because of node’s mobility and use of unreliable wireless channels for data transmission. Multipath routing strategy can cope with the problem of the traffic overloads while balancing the network resource consumption. In the paper, an optimized node-disjoint multipath routing (ONMR) protocol based on ad hoc on-demand vector (AODV) is proposed to establish effective multipath to enhance the network reliability and robustness. The scheme combines the characteristics of reverse AODV (R-AODV) strategy and on-demand node-disjoint multipath routing protocol to determine available node-disjoint routes with minimum routing control overhead. Meanwhile, it adds the backup routing strategy to make the process of data salvation more efficient in case of link failure. The results obtained through various simulations show the effectiveness of the proposed scheme in terms of route availability, control overhead and packet delivery ratio.
9
Mitra, Sulata, and Priyodarshini Dhar. "Two Variants of Secure Routing Algorithms in Mobile Ad Hoc Network." International Journal of Sensors, Wireless Communications and Control 9, no. 1 (July 15, 2019): 80–110. http://dx.doi.org/10.2174/2210327908666180807100746.
Full textAbstract:
Background and Objective: Two different variants of secure routing algorithms are proposed in the present work. In both the variants a stable route is established between source and destination. Methods: The selected route is associated with the nodes having sufficient energy to establish the route and to transmit the data packets, minimum velocity to reduce the frequency of link failure, maximum distance from the source node to reduce the number of hops in the selected route, minimum number of neighbors to reduce the routing overhead. Each variant has two phases. In the first phase it is assumed that the selected route has no attackers. The first phase is made more realistic in the second phase by considering the presence of attacker in the selected route. In the first variant a node associated with the selected route overhears the transmission of the next forwarder node to detect an attacker node in the routing path. But a node may fail to overhear its next hop in presence of hidden node, due to limited overhear range etc. Such problem is eliminated in the second variant. In the second variant each node associated with the selected route searches its data packet buffer for the reception of the next data packet from its predecessor node associated with the same route and suspects the predecessor node as an attacker in case the next data packet is not found in the buffer. The performance of both the variants is compared on the basis of packet delivery ratio, throughput and average end-to-end delay. Results: The throughput and packet delivery ratio are higher in the second variant than the first variant whereas the average end-to-end delay is less in the second variant than the first variant. Conclusion: Moreover both the variants outperform the existing schemes in terms of packet delivery ratio, throughput and average end-to-end delay.
10
Shen, Xue Zhen, and Xin Guo Tang. "Dynamic Routing Algorithm Based on HIP Multicast Model." Advanced Materials Research 424-425 (January 2012): 607–11. http://dx.doi.org/10.4028/www.scientific.net/amr.424-425.607.
Full textAbstract:
A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be equal
11
Zhou, Ze Sshun, Yi Xu, Min Qin, Chu Yang Mao, and La Yuan Li. "A Hierarchical QoS Routing Protocol for the Wireless Sensor Networks." Applied Mechanics and Materials 347-350 (August 2013): 2018–22. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2018.
Full textAbstract:
The large wireless sensor networks are often structured hierarchically by grouping nodes into different domains in order to deal with the scaling problem. This paper proposes a new protocol called hierarchical QoS routing protocol (HQRP) that achieves scalability by organizing the network as a hierarchy of domains using the full-mesh aggregation technique. In HQRP, each local node just only needs to maintain local routing and summary information of other domains, but does not requires any global states maintained. The HQRP uses a Reverse Best Metric Path Forwarding approach with hierarchical, topological and QoS forwarding conditions to construct the multicast tree while minimizing message overhead and satisfying delay-bandwidth and minimum energy consumption. The paper presents proof of correctness and complexity analysis of the HQRP. Simulation results show very good performance in terms of success ratio and message overhead.
12
Butt, Suhail, Kamalrulnizam Bakar, Nadeem Javaid, Niayesh Gharaei, Farruh Ishmanov, Muhammad Afzal, Muhammad Mehmood, and Muhammad Mujahid. "Exploiting Layered Multi-Path Routing Protocols to Avoid Void Hole Regions for Reliable Data Delivery and Efficient Energy Management for IoT-Enabled Underwater WSNs." Sensors 19, no. 3 (January 26, 2019): 510. http://dx.doi.org/10.3390/s19030510.
Full textAbstract:
The key concerns to enhance the lifetime of IoT-enabled Underwater Wireless Sensor Networks (IoT-UWSNs) are energy-efficiency and reliable data delivery under constrained resource. Traditional transmission approaches increase the communication overhead, which results in congestion and affect the reliable data delivery. Currently, many routing protocols have been proposed for UWSNs to ensure reliable data delivery and to conserve the node’s battery with minimum communication overhead (by avoiding void holes in the network). In this paper, adaptive energy-efficient routing protocols are proposed to tackle the aforementioned problems using the Shortest Path First (SPF) with least number of active nodes strategy. These novel protocols have been developed by integrating the prominent features of Forward Layered Multi-path Power Control One (FLMPC-One) routing protocol, which uses 2-hop neighbor information, Forward Layered Multi-path Power Control Two (FLMPC-Two) routing protocol, which uses 3-hop neighbor information and ’Dijkstra’ algorithm (for shortest path selection). Different Packet Sizes (PSs) with different Data Rates (DRs) are also taken into consideration to check the dynamicity of the proposed protocols. The achieved outcomes clearly validate the proposed protocols, namely: Shortest Path First using 3-hop neighbors information (SPF-Three) and Breadth First Search with Shortest Path First using 3-hop neighbors information (BFS-SPF-Three). Simulation results show the effectiveness of the proposed protocols in terms of minimum Energy Consumption (EC) and Required Packet Error Rate (RPER) with a minimum number of active nodes at the cost of affordable delay.
13
G, Shyamala, and G. R. Prasad. "Obstacle aware delay optimized rectilinear steiner minimum tree routing." Indonesian Journal of Electrical Engineering and Computer Science 16, no. 2 (November 1, 2019): 640. http://dx.doi.org/10.11591/ijeecs.v16.i2.pp640-652.
Full textAbstract:
<p><span>This work presents a method to solve the problem of constructing Rectilinear Steiner Minimum Tree (RSMT) for a group of pins in the presence of obstacles. In modern </span><span>very large-scale integrated circuit</span><span> (VLSI) designs, the obstacles, generally blocks the metal and the device layer. Therefore routing on top of blockage is a possible solution but buffers cannot be placed over the obstacle. Modern VLSI design OARSMT construction has long wire length, which results in signal violation. To address this issue a slew constraint interconnect need to be considered in routing over obstacle. This is called the Obstacle-Avoiding Rectilinear Steiner minimum trees (OARSMT) problem with slew constraints over obstacles. The drawback of traditional OARSMT is that they only consider slew constraint, and delay constraints are neglected. It induces high routing resources overhead due to buffer insertion and does not solve global routing solution. This work presents an Obstacle Aware Delay Optimized Rectilinear Steiner Minimum Tree (OADORSMT) Routing to address the delay, slew constraint and reduce the routing resources. Experiments are conduced to evaluate the performance of proposed approach over existing approach in term of wire length and worst negative slack. The experiments are conducted for small and large nets considering fixed and varied obstacles and outcome shows the proposed efficiency over existing approaches. The OADORSMT is designed in such a way where it can be parallelized to obtain better efficiency.</span></p>
14
Jin, Junwei, and Sanghyun Ahn. "A Multipath Routing Protocol Based on Bloom Filter for Multihop Wireless Networks." Mobile Information Systems 2016 (2016): 1–10. http://dx.doi.org/10.1155/2016/8151403.
Full textAbstract:
On-demand multipath routing in a wireless ad hoc network is effective in achieving load balancing over the network and in improving the degree of resilience to mobility. In this paper, the salvage capable opportunistic node-disjoint multipath routing (SNMR) protocol is proposed, which forms multiple routes for data transmission and supports packet salvaging with minimum overhead. The proposed mechanism constructs a primary path and a node-disjoint backup path together with alternative paths for the intermediate nodes in the primary path. It can be achieved by considering the reverse route back to the source stored in the route cache and the primary path information compressed by a Bloom filter. Our protocol presents higher capability in packet salvaging and lower overhead in forming multiple routes. Simulation results show that SNMR outperforms the compared protocols in terms of packet delivery ratio, normalized routing load, and throughput.
15
Mir, Mohd Yaseen, and Satyabrata Das. "An Efficient Clustering in MANETs with Minimum Communication and Reclustering Overhead." International Journal of Rough Sets and Data Analysis 4, no. 4 (October 2017): 101–14. http://dx.doi.org/10.4018/ijrsda.2017100107.
Full textAbstract:
A flat structure in MANETs based on proactive or reactive routing schemes face scalability problems with increase in both mobility and network size. Clustering offers hierarchical organization of mobile nodes by forming disjoint groups (clusters). So clustering techniques solve the scalability issue in large MANETs but, requires extra message exchange among mobile nodes for maintenance of cluster structure. Due to mobility in MANETs stability of cluster structure is greatly affected as such it often leads to Ripple effect of reclustering. In this paper, the authors present clustering algorithm that eliminates the requirement of frozen period and minimizes reclustering of entire network by locally repairing cluster structure that gets affected due to moment of head node. They have reduced the number of messages exchanged in their proposed work by including different range of transmission for each node and overall stability of entire structure is enhanced.
16
Vanamoorthy, Muthumanikandan, Valliyammai Chinnaiah, and Harish Sekar. "A Hybrid Approach for Providing Improved Link Connectivity in SDN." International Arab Journal of Information Technology 17, no. 2 (February 28, 2019): 250–56. http://dx.doi.org/10.34028/iajit/17/2/13.
Full textAbstract:
Software-Defined Networking (SDN) is a unique approach to design and build networks. The networks services can be better handled by administrators with the abstraction that SDN provides. The problem of re-routing the packets with minimum overhead in case of link failure is handled in this work. Protection and restoration schemes have been used in the past to handle such issues by giving more priority to minimal response time or controller overhead based on the use case. A hybrid scheme has been proposed with per-link Bidirectional forwarding mechanism to handle the failover. The proposed method makes sure that the controller overhead does not impact the flow of packets, thereby decreasing the overall response time, even with guaranteed network resiliency. The computation of the next shortest backup path also guarantees that the subsequent routing of packets always chooses the shortest path available. The proposed method is compared with the traditional approaches and proven by results to perform better with minimal response time.
17
Bharti, Rajendra Kumar, V. Bhoopathy, Parul Bhanarkar, Kanahaiya Lal Ambashtha, K. Priya, C. Anand Deva Durai, Manam Vamsi Krishna, P. Joel Josephson, and Kibebe Sahile. "Routing Path Selection and Data Transmission in Industry-Based Mobile Communications Using Optimization Technique." Wireless Communications and Mobile Computing 2022 (July 21, 2022): 1–9. http://dx.doi.org/10.1155/2022/5431413.
Full textAbstract:
In a mobile network, nodes are share data packets; sometimes, that packets are totally flooding. The packet dropping node does not easily detect for routing time instance. The node trust level is minimum causing the packet loss; it affects the entire network performance, and it reduces throughput and increases communication overhead. Proposed exhaustive routing path allocation (ERP) technique is applied to select the legitimate node for broadcasting the data packets completely. The attacker nodes of that flooding packets are detected by using the legitimate detector which are present in network environment. The node credence level evaluation algorithm is planned to estimating each and every node authority range, whether the nodes have higher credence level basis efficient packet transmission in wireless nodes; otherwise, nodes have lesser credence level basis in effective packet broadcasting. These higher credence level nodes are assigned for communication process in movable network. It improves the throughput and minimizes the communication overhead. The performance metrics of the parameters are delay, communication overhead, throughput, network lifetime, energy consumption, and packet loss.
18
Fadllullah, Arif. "Rancangan Modifikasi Algoritma AODV Pada MANET Untuk Meningkatkan Performansi Skema Routing Dan Deteksi Kongesti (Studi Literatur)." Elektrika Borneo 5, no. 1 (April 10, 2019): 10–18. http://dx.doi.org/10.35334/jeb.v5i1.589.
Full textAbstract:
AODV adalah salah satu protokol reaktif routing yang terkenal pada MANET yang dibangun berdasarkan permintaan routing. Protokol ini banyak dipakai karena overhead routing yang rendah dan performa tinggi. Hanya saja pengiriman paket data menggunakan AODV konvensional seringkali terjadi delay, manakala jalur routing terputus sebagai akibat adanya pergerakan node yang berubah-ubah dalam jalur. Oleh karena itu, penelitian ini mengusulkan rancangan AODV modifikasi yang tidak hanya memiliki fitur skema routing jalur utama yang dipilih berdasarkan link throughput dan minimum hop count, tetapi juga mempertimbangkan penyediaan jalur alternatif saat link node mengalami kerusakan maupun saat antrian paket data melebihi kapasitas maksimal suatu node hingga status kongesti terjadi pada node, khususnya untuk mengurangi delay pengiriman paket yang rentan terjadi pada AODV konvensional.
19
Shahzad, Muhammad K., Dang Tu Nguyen, Vyacheslav Zalyubovskiy, and Hyunseung Choo. "LNDIR: A lightweight non-increasing delivery-latency interval-based routing for duty-cycled sensor networks." International Journal of Distributed Sensor Networks 14, no. 4 (April 2018): 155014771876760. http://dx.doi.org/10.1177/1550147718767605.
Full textAbstract:
Wireless sensor networks are composed of low-energy, small-size, and low-range unattended sensor nodes. Recently, it has been observed that by periodically turning on and off the sensing and communication capabilities of sensor nodes, we can significantly reduce the active time and thus prolong network lifetime. However, this duty cycling may result in high network latency, routing overhead, and neighbor discovery delays due to asynchronous sleep and wake-up scheduling. These limitations call for a countermeasure for duty-cycled wireless sensor networks which should minimize routing information, routing traffic load, and energy consumption. In this article, we propose a lightweight non-increasing delivery-latency interval routing referred as LNDIR. This scheme can discover minimum latency routes at each non-increasing delivery-latency interval instead of each time slot. Simulation experiments demonstrated the validity of this novel approach in minimizing routing information stored at each sensor. Furthermore, this novel routing can also guarantee the minimum delivery latency from each source to the sink. Performance improvements of up to 12-fold and 11-fold are observed in terms of routing traffic load reduction and energy efficiency, respectively, as compared to existing schemes.
20
Kumar, Sushil, and Anil Kumar Verma. "An advanced forwarding routing protocol for urban scenarios in VANETs." International Journal of Pervasive Computing and Communications 13, no. 4 (November 6, 2017): 334–44. http://dx.doi.org/10.1108/ijpcc-d-17-00008.
Full textAbstract:
Purpose The purpose of this paper is to give an insight in to the routing protocols in Vehicular ad hoc Network (VANET). In this direction, for the efficient data dissemination in VANETs, a street-based forwarding protocol (SBFP) has been proposed. Design/methodology/approach The interferences among different street segments are considered and a unique street-based forwarding concept is introduced to reduce the local maximum problem. In this protocol, the greedy forwarding concept along with the broadcasting mechanism and suppression technique is implemented to minimize the overhead created in the regular beacons forwarding processes. QualNet simulator is used to implement and simulate SBFP. SUMO and MOVE tools are used to create the vehicle’s movement pattern and network topology. Findings The simulated results demonstrated improved packet delivery ratio (PDR) with a minimum average number of broadcast by each individual vehicle in the proposed SBFP than in its peer protocols. Originality/value This paper will be discussing a unique street-based forwarding technique exploring the advantages of global positioning system to obtain the location of vehicles and streets. This technique results in higher PDR and reduced network overhead.
21
Wang, Jin, Tinghuai Ma, Jinsung Cho, and Sungoung Lee. "An energy efficient and load balancing routing algorithm for wireless sensor networks." Computer Science and Information Systems 8, no. 4 (2011): 991–1007. http://dx.doi.org/10.2298/csis110228052w.
Full textAbstract:
Many energy aware routing algorithms and protocols have been proposed for wireless sensor networks recently to achieve aims like minimum energy consumption, maximized network lifetime, reduced communication latency and overhead etc. The problem of hotspot can not be well addressed under many routing algorithms since some nodes which are on the shortest path or close to the base station tend to deplete their energy quickly and consequently cause network partition. In this paper, we propose a Ring-based Energy Aware Routing (REAR) algorithm for wireless sensor networks which can achieve both energy balancing and energy efficiency for all sensor nodes. Our algorithm considers not only the hop number and distance but also the residual energy of the next hop node during routing process. Simulation results validate that our algorithm outperforms some other routing algorithms in the aspects of energy consumption and network lifetime etc.
22
Naser, Jaber Ibrahim, and Ahmed Jawad Kadhim. "Multicast routing strategy for SDN-cluster based MANET." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 5 (October 1, 2020): 4447. http://dx.doi.org/10.11591/ijece.v10i5.pp4447-4457.
Full textAbstract:
The energy limitation and frequent movement of the mobile Ad hoc network (MANET) nodes (i.e., devices) make the routing process very difficult. The multicast routing problem is one of the NP-complete problems. Therefore, the need for a new power-aware approach to select an optimum multicast path with minimum power consumption that can enhance the performance and increase the lifetime of MANET has become urgent. Software defined network (SDN) is a new technique that can solve many problems of the traditional networks by dividing the architecture into data part and control part. This paper presents three power-aware multicast routing strategies for MANET. First one called a Reactive Multicast routing strategy for cluster based MANET by using SDN (RMCMS), second one called proactive multicast routing strategy for cluster based MANET by using SDN (PMCMS) and third one represents modification of PMCMS called M-PMCMS. Moreover, it produces a new mathematical model to build a multicast tree with minimum power consumption and takes into account the remaining power in each node. All proposed multicast strategies operate based on this mathematical model and aim to maximize the MANET lifetime by exploiting the advantages of SDN and clustering concepts. They consider the multicast tree with minimum power consumption as an optimal one. The simulation results illustrated that RMCMS is better than PMCMS, M-PMCMS, and MAODV in terms of power consumption and network overhead while M-PMCMS is the best one in terms of dropped packets ratio (DPR) and average end to end (E2E) delay.
23
Bansal, Ishu, and Rajnish Kansal. "A Novel Approach for Data Communication and Safety Concern in VANET Using Cognitive Radio." International Journal of Advanced Research in Computer Science and Software Engineering 7, no. 11 (November 30, 2017): 174. http://dx.doi.org/10.23956/ijarcsse.v7i11.499.
Full textAbstract:
VANET is branch of networking that is used for communication in intelligent transportation system. In this process of VANET various nodes are interconnected to each other and road side units. R2R, V2V and V2R communication has been done in VANET. Due to variouscommunications under VANET routing protocols have overhead for computation of shortest path and transmission of information with minimum delay. Delay in the network cause minimum safety. In this paper an approach has been proposed that can be used for transmission of safety message over the network with minimum delay. On the basis of proposed approach safety message can be transmitted in shortest interval of time so that safety can be achieved in the network.
24
Sekaran, Ramesh, and Ganesh Kumar Parasuraman. "A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks." Scientific World Journal 2014 (2014): 1–13. http://dx.doi.org/10.1155/2014/865071.
Full textAbstract:
The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET.
25
Palmieri, Francesco, and Aniello Castiglione. "Condensation-Based Routing in Mobile Ad-Hoc Networks." Mobile Information Systems 8, no. 3 (2012): 199–211. http://dx.doi.org/10.1155/2012/149697.
Full textAbstract:
The provision of efficient broadcast containment schemes that can dynamically cope with frequent topology changes and limited shared channel bandwidth, is one of the most challenging research topics in MANETs, and is crucial to the basic operations of networks serving fully mobile devices within areas having no fixed communication infrastructure. This problem particularly impacts the design of dynamic routing protocol that can efficiently establish routes to deliver data packets among mobile nodes with minimum communication overhead, and at the same time, ensure high throughput and low end-to-end delay. Accordingly, this work exploits and analyzes an adaptive probabilistic broadcast containment technique based on a particular condensation phenomenon borrowed from Quantum Mechanics and transposed in self-organizing random networks, that has the potential to effectively drive the on-demand route discovery process. Simulation-based performance analysis has shown that the proposed technique can introduce significant benefits on the general performance of broadcast-based reactive routing protocols in MANETs.
26
Kumar, Sunil, Siddharth Khimsara, Kashyap Kambhatla, Kalyani Girivanesh, John D. Matyjas, and Michael Medley. "Robust On-Demand Multipath Routing with Dynamic Path Upgrade for Delay-Sensitive Data over Ad Hoc Networks." Journal of Computer Networks and Communications 2013 (2013): 1–13. http://dx.doi.org/10.1155/2013/791097.
Full textAbstract:
Node mobility in mobile ad hoc networks (MANETs) causes frequent route breakages and intermittent link stability. In this paper, we introduce a robust routing scheme, known as ad hoc on-demand multipath distance vector with dynamic path update (AOMDV-DPU), for delay-sensitive data transmission over MANET. The proposed scheme improves the AOMDV scheme by incorporating the following features: (i) a routing metric based on the combination of minimum hops and received signal strength indicator (RSSI) for discovery of reliable routes; (ii) alocal path updatemechanism which strengthens the route, reduces the route breakage frequency, and increases the route longevity; (iii) akeep alivemechanism for secondary route maintenance which enables smooth switching between routes and reduces the route discovery frequency; (iv) apacket salvagingscheme to improve packet delivery in the event of a route breakage; and (v) low HELLO packet overhead. The simulations are carried out in ns-2 for varying node speeds, number of sources, and traffic load conditions. Our AOMDV-DPU scheme achieves significantly higher throughput, lower delay, routing overhead, and route discovery frequency and latency compared to AOMDV. For H.264 compressed video traffic, AOMDV-DPU scheme achieves 3 dB or higher PSNR gain over AOMDV at both low and high node speeds.
27
Meghanathan, Natarajan. "Impact of the Optimum Routing and Least Overhead Routing Approaches on Minimum Hop Routes and Connected Dominating Sets in Mobile Ad Hoc Networks." International Journal of Wireless & Mobile Networks 3, no. 2 (April 30, 2011): 196–212. http://dx.doi.org/10.5121/ijwmn.2011.3216.
Full text
28
Idoudi, Hanen. "Efficient Forwarding With Power Saving and Load Balancing In Wireless Sensor Networks." International Journal of Business Data Communications and Networking 9, no. 2 (April 2013): 45–60. http://dx.doi.org/10.4018/jbdcn.2013040104.
Full textAbstract:
Energy efficiency is still a challenging issue in wireless sensor networks (WSNs). Balancing nodes’ activities and duty cycling are efficient ways that could enhance WSN’s performances. In this paper the authors introduce a new asynchronous power saving mechanism that provides an adaptive duty cycle and a minimum overhead to achieve load balancing and energy saving. This mechanism relies on two basic functions: an asynchronous duty cycling for activity balancing and a lightweight geographic routing. Extensive simulations showed the effectiveness of the proposed approach in terms of residual energy, energy consumption balancing and packet delivery ratio.
29
Vijay, Shams Tabrez Siddiqui, Ritu, Relangi Anil Kumar, Avinash Kumar, S. Umamaheswararao, Narahari Dudiki, Y. Venkateswara Reddy, and Kenenisa Dekeba. "Intertwine Connection-Based Routing Path Selection for Data Transmission in Mobile Cellular Networks and Wireless Sensor Networks." Wireless Communications and Mobile Computing 2022 (August 4, 2022): 1–9. http://dx.doi.org/10.1155/2022/8398128.
Full textAbstract:
In a network setting, a sensor node's round-trip delay time over hostile nodes compromises the node's ability to transmit data from the sender node to the destination node. Minimum distance path discovery causes the path failure, since aggressive nodes are available. Node connectivity is poor which should cause the packet loss; it does not control more energy consumption, since packet broadcasting is repeated for many times using that path. So, the proposed intertwine connection-based routing path selection (ICBRPS) technique allows only energy efficient routing path, path connectivity is important, and routing path is damaged because of the presence of aggressive nodes. It hacks the information from sensor and operates unpredictable manner. The objective of this presented ICBRPS scheme is to improve the routing path in efficient manner. If any damages occur during the transmission of data, then the alternate best node connectivity path is created by energetic route discovery method. The performance metrics of parameters are delay, network overhead, energy consumption, packet loss, packet delivery ratio, and connectivity ratio. It enhances the connectivity rate and reduces the energy consumption.
30
Ganesh, N. "Performance Evaluation of Depth Adjustment and Void Aware Pressure Routing (DA-VAPR) Protocol for Underwater Wireless Sensor Networks." Computer Journal 63, no. 2 (November 6, 2019): 193–202. http://dx.doi.org/10.1093/comjnl/bxz093.
Full textAbstract:
Abstract Underwater wireless sensor network (UWSN) has gained its popularity as a powerful technology for monitoring oceans, sea and river. The sensor node drifting along with ocean current offers 4D (space and time) monitoring for real-time underwater application. However, the main challenge arises from the underwater acoustic communication that results in high propagation delay, packet loss and overhead in the network. In order to overcome these issues, a depth adjustment and void aware pressure routing protocol is proposed for UWSN. A greedy forwarding strategy is used to forward the packet. In case a node fails to forward the packet using greedy forwarding strategy, then it immediately switches to the recovery mode. In the recovery mode, the node determines the new depth using particle swarm optimization technique. The global best value gives the new depth with minimum displacement. The void node forwards the packet with minimum displacement without any packet loss and delay.
31
Jaiswal, Ms Rashmi, and Ms Chandramala Amarji. "A Distributed Intrusion Detection System for AODV Network." International Journal for Research in Applied Science and Engineering Technology 10, no. 8 (August 31, 2022): 1576–86. http://dx.doi.org/10.22214/ijraset.2022.46247.
Full textAbstract:
Abstract: The Ad hoc On-Demand Distance Vector (AODV) routing protocol, designed for mobile ad hoc networks, offers quick adaptation to dynamic link conditions, low processing and memory overhead, and low network utilization. However, without keeping in mind the security issues in the protocol design, AODV is vulnerable to various kinds of attacks. This thesis analyzes some of the vulnerabilities, specifically discussing attacks against AODV that manipulate the routing messages. We propose a solution based on specification-based intrusion detection to detect attacks on AODV. Briefly, our approach involves the use of finite state machines for specifying correct AODV routing behavior and distributed network monitors for detecting run-time violation of the specifications. In addition, one additional field in the protocol message is proposed to enable the monitoring. We illustrate that our algorithm, which employs a tree data structure, can effectively detect most of the serious attacks in real time and with minimum overhead. Routing attacks will have distressing effects over the network and bequest a significant challenge once planning strong security mechanisms for vehicular communication. In this paper, we examine the effect and malicious activities of a number of the foremost common attacks and also mention some security schemes against some major attacks in VANET. The attacker's aim is only to modify the actual route or provides the false data about the route to the sender and also some attackers are only flooding unwanted packets to consume resources in available network. Various routing approaches are also mentioned in the paper because the routing of data is very important to deliver the traffic information to leading vehicles. It's advised that a number of the ways that to approach this made field of analysis issues in VANET might be to fastidiously design new secure routing protocols in which attacks are often rendered meaningless and because of the inherent constraints found in the network, there's a desire for light-weight and sturdy security mechanisms.
32
DAY, KHALED, and ABDEL-ELAH AL-AYYOUB. "ADAPTIVE FAULT-TOLERANT ROUTING IN STAR NETWORKS." Journal of Interconnection Networks 02, no. 02 (June 2001): 213–31. http://dx.doi.org/10.1142/s0219265901000336.
Full textAbstract:
We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in the network. A distributed fault-tolerant routing algorithm for the star network based on this construction method is then presented and evaluated. The proposed algorithm adapts the routing decisions in response to node failures. Node failure and repair conditions may arise dynamically (at any time) provided that the total number of faulty nodes at any given time is less than the node-connectivity n - 1 of the n-star. When a message is blocked due to faulty components, the source of the message is warned and requested to switch to a different node-disjoint path. The methods used to identify the paths, to propagate failure information back to source nodes, and to switch from a routing path to another incur little communication and computation overhead. We show that if the node failures occur 'reasonably' apart in time, then all messages will be routed on paths of length δ + ε where δ is the minimum distance between the source and the destination and ε is 0, 2, or 4. In the unlikely case where more failures occur in a 'short period', the algorithm still delivers all messages but via possibly longer paths.
33
Zhou, Ze Shun, Yi Xu, Jun Jie Yan, Zhong Wei Nie, and La Yuan Li. "A Multiple Constrained QoS Routing Algorithm for the Wireless Sensor Networks." Applied Mechanics and Materials 347-350 (August 2013): 553–58. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.553.
Full textAbstract:
Routing problem is one of the most important issues to a wireless sensor network (WSN). It is the key problem to find an efficient energy strategy for prolonging network's lifetime because power supply might be impossible. This paper discusses the multicast routing problem of WSN with multiple QoS constraints, which may deal with the delay, bandwidth, hop count and packet reception rat and surplus energy metrics, and finds a minimum resource consumption path while satisfying multiple constraints optimization conditions, and describes a network model for researching the multicast routing problem. It presents a dynamic multicast routing algorithm with multiple QoS constraints (MCQoSRA). The MCQoSRA successfully solves the QoS routing problems when multicast nodes change dynamically in the networks. The MCQoSRA only requires the local state information of the link (or node), but does not require any global network sate to be maintained. In MCQoSRA, a multicast group member can join or leave the multicast session dynamically. The MCQoSRA can effectively decrease the overhead for constructing a multicast tree and the delay of the nodes, and improve the success ratio of seeking links. Simulation results show that the MCQoSRA provides an available means to implement multicast routing, and adapt to all kinds of the topology networks, and have better expansibility.
34
Jadhaw, Arjun, and Vikrant Sharma. "AN IMPLEMENTATION OF EFFICIENT PATH SELECTION METHOD FOR SUCCESSFUL DATA TRANSMISSION IN MOBILE AD HOC NETWORKS." BSSS journal of computer 12, no. 1 (June 30, 2021): 36–48. http://dx.doi.org/10.51767/jc1205.
Full textAbstract:
Routing is a process of forwarding the data from a known source to the destination. In this procedure, the data might travel during some in-between paths, and there exist a required to select the best probable best possible nodes to forward the data. This best selection of nodes will permit to achieve a high presentation in the network. Big amount of worked has been carried out to find the best pathway in the network routing to progress its effectiveness and to eliminate overcrowding problems. A good routing algorithm should be able to find an optimal path and it must be simple. It also must have low overhead, and be robust and stable, converging rapidly, and must remain flexible. Routing in MANET by means of the direct pathway metric is not a sufficient situation to construct high quality pathway, since minimum hop count routing frequently chooses routes that have considerably less capacity than the best pathway that live in the network. In this article, we suggest a mechanism to prefer the routing protocol based on manifold measure like Throughput, PDR, energy expenditure etc. These paths are quite resourceful. Network presentation will be raise by using these paths. The efficiency of our mechanism is illustrated by simulations conducted using network simulator ns-2.
35
Nawaz Jadoon, Rab, WuYang Zhou, Iftikhar Ahmed Khan, Muhammad Amir Khan, and Waqas Jadoon. "EEHRT: Energy Efficient Technique for Handling Redundant Traffic in Zone-Based Routing for Wireless Sensor Networks." Wireless Communications and Mobile Computing 2019 (May 6, 2019): 1–12. http://dx.doi.org/10.1155/2019/7502140.
Full textAbstract:
This paper presents an energy-efficient technique to handle redundant traffic (EEHRT) in the zone-based routing for wireless sensor networks. In this technique, multihop routing is performed based on the remaining energy of the nodes. Afterwards, it performs position-based routing without the need for the nodes to know their respective position. The main objective of this paper is to handle the redundant packets generated in zone-based routing using short beacon messages. Nodes of lower zones route the data of the higher zone to base station (BS) with a minimum number of hops and utilize only those nodes on the path which are energy efficient and located closer to BS. Moreover, the source node is acknowledged by the relaying node using a wireless broadcast advantage (WBA) without sending any special ACK packet to the sender, which reduces the control overhead in the routing process. The EEHRT technique improves the routing against RARZ by ensuring only one copy of the packet is propagated at each hop along the routing path to BS. Simulation results show that EEHRT achieved 28% improvement in energy efficiency, 10% and 25% improvements in data throughput against total and distinct packet reception at BS respectively, 35% increase in overall network lifetime, and 100% reduction in redundant packets generation and propagation in the network against RARZ routing.
36
Onwuegbuzie, Innocent Uzougbo, Shukor Abd Razak, and Ismail Fauzi Isnin. "Control Messages Overhead Impact on Destination Oriented Directed Acyclic Graph—A Wireless Sensor Networks Objective Functions Performance Comparison." Journal of Computational and Theoretical Nanoscience 17, no. 2 (February 1, 2020): 1227–35. http://dx.doi.org/10.1166/jctn.2020.8794.
Full textAbstract:
Routing Protocol for Low-power and Lossy Network (RPL) with IPv6 support is the de facto standard for routing over Low-power and Lossy Network (LLN) called Wireless Sensor Networks (WSN). Objective Functions namely Minimum Rank with Hysteresis Objective Function (MRHOF) and Objective Function Zero (OF0) together with the Internet Control Messaging Protocol (ICMP) control messages, propel RPL to constructs routing paths called Destination Oriented Directed Acyclic Graph (DODAG), for packet routing within the sensor network. To the best knowledge of the authors, no detailed investigation has been carried out to unravel the dynamics of how these control messages impact on the network with respect to DODAG formation right before convergence is attained, particularly from the perspective of MRHOF and OF0. In this paper, the authors investigated the various types of control messages (DODAG Information Solicitation, DODAG Information Object and Destination Advertisement Object) used to setup the DODAG. RPL Simulations was carried out on one 100 nodes, starting with 10 nodes and incremented by 10 until the 100th node. Each simulation was repeated five times with a confidence level of 95%, which statistically signifies a reliable and acceptable confidence interval, for a duration of thirty minutes. Results obtained showed that the DIS–OF0 generated the least packets with 125 packets, followed by DAO–MRHOF with 1357 packets and the most generated; DIO–MRHOF with 1536 packets. Subsequently, MRHOF had higher Convergence Time of 130.67 seconds as to 87.93 seconds for OF0. This information is valuable for both the academia and industry.
37
Debnath, Sumon Kumar, Mousumi Saha, Md Manowarul Islam, Prodip Kumar Sarker, and Ileas Pramanik. "Evaluation of Multicast and Unicast Routing Protocols Performance for Group Communication with QoS Constraints in 802.11 Mobile Ad-hoc Networks." International Journal of Computer Network and Information Security 13, no. 1 (February 8, 2021): 1–15. http://dx.doi.org/10.5815/ijcnis.2021.01.01.
Full textAbstract:
In Mobile Ad-hoc Network (MANET), portable devices like smartphones, or laptop PC can join together to make provisional networks without any infrastructure The objective of multicast or unicast protocols is to ensure an efficient route formation and flow control mechanism which is a very challenging issue for many group computing services in MANETs. MANETs can support several real-time applications like emergency rescue, and disaster relief operations which require minimum Quality of Service (QoS) to handle high traffic. Providing QoS for multimedia and group-oriented computing in MANETs becomes a real challenge due to the wireless medium and the mobility of operating nodes. Therefore, an investigation of routing protocols for one-to-many or many-to-many computing is important that supports acceptable QoS in MANETs. Numerous QoS metrics have been considered for the assessment like packet delivery ratio, latency, packet loss rate, control overhead, and throughput. By considering different network topologies and scenarios with different performance parameters, the primary goal of this study is to explore the challenges and factors for QoS services in MANET’s multicast communication. The outcomes of investigation can be used to design the future MANET protocol for multimedia applications. The performance results indicate that the increasing number of sending/receiving nodes may increase the overhead or latency of the network but capable of providing higher network throughput, carried out in NS-2. The results also indicate although MANETs can induce errors and packets are lost as part of the normal operating context, multicast AODV practice superior to the unicast protocol to various QoS in a wide range of scenarios with less overhead.
38
DURRESI, ARJAN, VAMSI PARUCHURI, MIMOZA DURRESI, and LEONARD BAROLLI. "CLUSTERING PROTOCOL FOR SENSOR NETWORKS." Journal of Interconnection Networks 07, no. 04 (December 2006): 423–36. http://dx.doi.org/10.1142/s0219265906001788.
Full textAbstract:
In this paper we present Clustering Protocol for Sensor networks (CPS). Clustering techniques are used by different protocols and applications to increase scalability and reduce delays in sensor networks. Examples include routing protocols, and applications requiring efficient data aggregation. Our approach is based on the Covering Problem that aims at covering an area with minimum number of circular disks. CPS is a lightweight protocol that does not require any neighborhood information and imposes low communication overhead. We present simulation results to show the efficiency of CPS in both ideal cases and randomly distributed networks. Moreover, CPS is scalable with respect to density and network size.
39
Barom Jeon, Paul, and George Kesidis. "A Pheromone-Aided Multipath QoS Routing Protocol and its Applications in MANETs." Journal of Communications Software and Systems 2, no. 2 (April 5, 2017): 108. http://dx.doi.org/10.24138/jcomss.v2i2.294.
Full textAbstract:
In this paper, we present an ant-based multipath QoS routing protocol that utilizes a single link metric combiningmultiple weighted criteria. The metric is applied to the proposed energy efficient multipath algorithm that considers both energy and latency. Energy efficiency is an important issue in mobile ad hoc networks (MANETs) since node energy supplies are stored in batteries. In order to increase the network lifetime it is important to maximize the minimum node energy along a path. As the network topology changes, failures may occur on active routes,resulting in the need for new route discoveries if only singleroutes per flow are maintained. Frequent new route discovery would, however, increase routing overhead and increase mean and peak packet latency. Using multiple routes simultaneously per flow can be a solution to these problems. Also, a special case of the multipath QoS routing protocol that considers throughput is applied to a security context. A compromised node can obstruct network communication by simply dropping packets that are supposed to be forwarded. In our approach, messages aredistributed over multiple paths between source and destination using ant-based QoS routing. In proportion to the throughput of each path, a pheromone-aided routing table is updated and, subsequently, paths that contain malicious nodes are naturally avoided.
40
Madni, Mohamed Atef Ali, Saeid Iranmanesh, and Raad Raad. "DTN and Non-DTN Routing Protocols for Inter-CubeSat Communications: A comprehensive survey." Electronics 9, no. 3 (March 14, 2020): 482. http://dx.doi.org/10.3390/electronics9030482.
Full textAbstract:
CubeSats, which are limited by size and mass, have limited functionality. These miniaturised satellites suffer from a low power budget, short radio range, low transmission speeds, and limited data storage capacity. Regardless of these limitations, CubeSats have been deployed to carry out many research missions, such as gravity mapping and the tracking of forest fires. One method of increasing their functionality and reducing their limitations is to form CubeSat networks, or swarms, where many CubeSats work together to carry out a mission. Nevertheless, the network might have intermittent connectivity and, accordingly, data communication becomes challenging in such a disjointed network where there is no contemporaneous path between source and destination due to satellites’ mobility pattern and given the limitations of range. In this survey, various inter-satellite routing protocols that are Delay Tolerant (DTN) and Non Delay Tolerant (Non-DTN) are considered. DTN routing protocols are considered for the scenarios where the network is disjointed with no contemporaneous path between a source and a destination. We qualitatively compare all of the above routing protocols to highlight the positive and negative points under different network constraints. We conclude that the performance of routing protocols used in aerospace communications is highly dependent on the evolving topology of the network over time. Additionally, the Non-DTN routing protocols will work efficiently if the network is dense enough to establish reliable links between CubeSats. Emphasis is also given to network capacity in terms of how buffer, energy, bandwidth, and contact duration influence the performance of DTN routing protocols, where, for example, flooding-based DTN protocols can provide superior performance in terms of maximizing delivery ratio and minimizing a delivery delay. However, such protocols are not suitable for CubeSat networks, as they harvest the limited resources of these tiny satellites and they are contrasted with forwarding-based DTN routing protocols, which are resource-friendly and produce minimum overheads on the cost of degraded delivery probability. From the literature, we found that quota-based DTN routing protocols can provide the necessary balance between delivery delay and overhead costs in many CubeSat missions.
41
Vadivel, Sharmila, Srinivas Konda, Kavitha Rani Balmuri, Andrzej Stateczny, and B. D. Parameshachari. "Dynamic Route Discovery Using Modified Grasshopper Optimization Algorithm in Wireless Ad-Hoc Visible Light Communication Network." Electronics 10, no. 10 (May 14, 2021): 1176. http://dx.doi.org/10.3390/electronics10101176.
Full textAbstract:
In recent times, visible light communication is an emerging technology that supports high speed data communication for wireless communication systems. However, the performance of the visible light communication system is impaired by inter symbol interference, the time dispersive nature of the channel, and nonlinear features of the light emitting diode that significantly reduces the bit error rate performance. To address these problems, many environments offer a rich infrastructure of light sources for end-to-end communication. In this research paper, an effective routing protocol named the modified grasshopper optimization algorithm is proposed to reduce communication interruptions, and to provide alternative routes in the network without the need of previous topology knowledge. In this research paper, the proposed routing protocol is implemented and analyzed using the MATLAB environment. The experimental result showed that the proposed routing protocol adapts to dynamic changes in the communication networks, like obstacles and shadows. Hence, the proposed protocol achieved better performance in data transmission in terms of throughput, packet delivery ratio, end-to-end delay, and routing overhead. In addition, the performance is analyzed by varying the number of nodes like 50, 100, 250, and 500. From the experimental analysis, the proposed routing protocol achieved maximum of 16.69% and minimum of 2.20% improvement in packet delivery ratio, and minimized 0.80 milliseconds of end-to-end delay compared to the existing optimization algorithms.
42
Akbar, Shuja, Muhammad Mohsin Mehdi, M. Hasan Jamal, Imran Raza, Syed Asad Hussain, Jose Breñosa, Julio César Martínez Espinosa, Alina Eugenia Pascual Barrera, and Imran Ashraf. "Multipath Routing in Wireless Body Area Sensor Network for Healthcare Monitoring." Healthcare 10, no. 11 (November 17, 2022): 2297. http://dx.doi.org/10.3390/healthcare10112297.
Full textAbstract:
Mobility and low energy consumption are considered the main requirements for wireless body area sensor networks (WBASN) used in healthcare monitoring systems (HMS). In HMS, battery-powered sensor nodes with limited energy are used to obtain vital statistics about the body. Hence, energy-efficient schemes are desired to maintain long-term and steady connectivity of the sensor nodes. A sheer amount of energy is consumed in activities such as idle listening, excessive transmission and reception of control messages, packet collisions and retransmission of packets, and poor path selection, that may lead to more energy consumption. A combination of adaptive scheduling with an energy-efficient protocol can help select an appropriate path at a suitable time to minimize the control overhead, energy consumption, packet collision, and excessive idle listening. This paper proposes a region-based energy-efficient multipath routing (REMR) approach that divides the entire sensor network into clusters with preferably multiple candidates to represent each cluster. The cluster representatives (CRs) route packets through various clusters. For routing, the energy requirement of each route is considered, and the path with minimum energy requirements is selected. Similarly, end-to-end delay, higher throughput, and packet-delivery ratio are considered for packet routing.
43
Kancharakuntla, Deepika, and Hosam El-Ocla. "EBR: Routing Protocol to Detect Blackhole Attacks in Mobile Ad Hoc Networks." Electronics 11, no. 21 (October 26, 2022): 3480. http://dx.doi.org/10.3390/electronics11213480.
Full textAbstract:
The presence of malevolent nodes in mobile ad hoc networks (MANETs) would lead to genuine security concerns. These nodes may disturb the routing process or deform the pattern of the data packets passing through the network. The MANET is extremely liable to attacks, owing to its characteristics of the network framework, such as the absence of infrastructure, moveable topology, and a centralized control unit. One of the most common attacks in MANETs is the blackhole attack. MANET nodes are susceptible to spectacular degradation of network performance in the presence of such attacks. In this regard, detecting or preventing deceitful nodes that will launch blackhole attacks is a challenge in MANETs. In this paper, we propose an Enhanced Blackhole Resistance (EBR) protocol to identify and resist nodes that are responsible for blackhole attacks. EBR can avoid congested traffic by passing the data packets through a safe route with the minimum RTT. The EBR protocol uses a combination of time to live (TTL) and round trip time (RTT), which is also called a TR mechanism, to detect the blackhole attacks. Our algorithm does not require any cryptographic or authentication mechanisms. Simulation results prove that EBR behaves better than other protocols in terms of throughput, end-to-end delay, packet delivery ratio, energy, and routing overhead.
44
Bhajantri, Lokesh B., and Nalini N. "Cluster Based Optimization of Routing in Distributed Sensor Networks Using Bayesian Networks with Tabu Search." International Journal of Electronics and Telecommunications 60, no. 2 (June 1, 2014): 199–208. http://dx.doi.org/10.2478/eletel-2014-0025.
Full textAbstract:
Abstract Distributed Sensor Networks (DSNs) have attracted significant attention over the past few years. A growing list of many applications can employ DSNs for increased effectiveness especially in hostile and remote areas. In all applications a large number of sensors are expected and requiring careful architecture and management of the network. Grouping nodes into clusters has been the most popular approach for support scalability in DSN. This paper proposes a cluster based optimization of routing in DSN by employing a Bayesian network (BN) with Tabu search (TS) approach. BN based approach is used to select efficient cluster heads and construction of BN for the proposed scheme. This approach incorporates energy level of each node, bandwidth and link efficiency. The optimization of routing is considered as a design issue in DSN due to lack of energy consumption, delay and maximum time required for data transmission between source nodes (cluster heads) to sink node. In this work optimization of routing takes place through cluster head nodes by using TS. Simulations have been conducted to compare the performance of the proposed approach with LEACH protocol. The objective of the proposed work is to improve the performance of network in terms of energy consumption, throughput, packet delivery ratio, and time efficiency of optimization of routing. The result shows that the proposed approach perform better than LEACH protocol that utilizes minimum energy, latency for cluster formation and reduce overhead of the protocol.
45
Afzal, Kiran, Rehan Tariq, Farhan Aadil, Zeshan Iqbal, Nouman Ali, and Muhammad Sajid. "An Optimized and Efficient Routing Protocol Application for IoV." Mathematical Problems in Engineering 2021 (May 19, 2021): 1–32. http://dx.doi.org/10.1155/2021/9977252.
Full textAbstract:
IoV is the latest application of VANET and is the alliance of Internet and IoT. With the rapid progress in technology, people are searching for a traffic environment where they would have maximum collaboration with their surroundings which comprise other vehicles. It has become a necessity to find such a traffic environment where we have less traffic congestion, minimum chances of a vehicular collision, minimum communication delay, fewer communication errors, and a greater message delivery ratio. For this purpose, a vehicular ad hoc network (VANET) was devised where vehicles were communicating with each other in an infrastructureless environment. In VANET, vehicles communicate in an ad hoc manner and communicate with each other to deliver messages, for infotainment purposes or for warning other vehicles about emergency scenarios. Unmanned aerial vehicle- (UAV-) assisted VANET is one of the emerging fields nowadays. For VANET’s routing efficiency, several routing protocols are being used like optimized link state routing (OLSR) protocol, ad hoc on-demand distance vector (AODV) routing protocol, and destination-sequenced distance vector (DSDV) protocol. To meet the need of the upcoming era of artificial intelligence, researchers are working to improve the route optimization problems in VANETs by employing UAVs. The proposed system is based on a model of VANET involving interaction with aerial nodes (UAVs) for efficient data delivery and better performance. Comparisons of traditional routing protocols with UAV-based protocols have been made in the scenario of vehicle-to-vehicle (V2V) communication. Later on, communication of vehicles via aerial nodes has been studied for the same purpose. The results have been generated through various simulations. After performing extensive simulations by varying different parameters over grid sizes of 300 × 1500 m to 300 × 6000 m, it is evident that although the traditional DSDV routing protocol performs 14% better than drone-assisted destination-sequenced distance vector (DA-DSDV) when we have number of sinks equal to 25, the performance of drone-assisted optimized link state routing (DA-OLSR) protocol is 0.5% better than that of traditional OLSR, whereas drone-assisted ad hoc on-demand distance vector (DA-AODV) performs 22% better than traditional AODV. Moreover, if we increase the number of sinks up to 50, it can be clearly seen that the DA-AODV outperforms the rest of the routing protocols by up to 60% (either traditional routing protocol or drone-assisted routing protocol). In addition, for parameters like MAC/PHY overhead and packet delivery ratio, the performance of our proposed drone-assisted variants of protocols is also better than that of the traditional routing protocols. These results show that our proposed strategy performs better than the traditional VANET protocols and plays important role in minimizing the MAC/PHY and enhancing the average throughput along with average packet delivery ratio.
46
Fakhar, Mohammad Amin Ebrahimzadeh, and Seyed Reza Kamel Tabbakh. "An energy-aware distributed algorithm for virtual backbone in wireless sensor network with different transmission range." Ciência e Natura 37 (December 19, 2015): 388. http://dx.doi.org/10.5902/2179460x20800.
Full textAbstract:
Since there is no fixed infrastructure or centralized management in Wireless Sensor Networks (WSNs), a Connected Dominating Set(CDS) has been proposed as a virtual backbone is efficient. A virtual backbone plays a major role in routing, broadcasting, coverage andactivity scheduling. Wireless sensor networks to form a CDS usually by UDG (Unit Disk Graph) models that are used in this model, allnodes have the same message, but this article UDG model instead of a version that is closer to reality called DGB (Disk Graph withBidirectional links) is used in which nodes can adopt different transmission intervals. In many applications, to reduce overhead, increasenetwork lifetime, and so on, to find the MCDS (minimum connected dominating set) is desirable, but the point is that MCDS UDG modelsand DGB, the problem is NP-hard. In addition to the analysis of algorithms, the new algorithm will provide and the efficiency of thealgorithm, especially in terms of energy consumption, through theoretical analysis and simulation algorithms are available to be checked out.
47
Zhang, Zheng, Yanling Shao, Xing Liu, and Yibo Han. "Telematics Collaborative Resource Allocation Algorithm Based on Cloud Sidecar." Security and Communication Networks 2022 (September 8, 2022): 1–14. http://dx.doi.org/10.1155/2022/2332769.
Full textAbstract:
This paper provides an in-depth study and analysis of a distributed allocation algorithm for collaborative resources for cloud-edge-vehicle-based Telematics. The approach starts from the emerging application of urban environmental monitoring based on vehicular networking, with an integrated design of data sensing detection and transmission, and collaborative monitoring of vehicle swarm intelligence based on urban air quality collection to avoid redundancy of information and communication overload. A hybrid routing method with minimal delay for reliable data transmission is proposed. The power adjustment algorithm divides the channel into 3 states. When the CBR is less than 0.5, the channel is in an idle state, and when the CBR is greater than 0.5 and less than 0.8, the channel is in an active state. The algorithm designs redundancy strategies based on coding mechanisms to improve the reliability of data transmission, combines coding mechanisms with routing design, incorporates routing switching ideas, and performs probability-based routing decisions to minimize the delay. In straight-line road sections, a fuzzy logic prediction-based vehicle adaptive connectivity clustering routing algorithm is proposed to reduce the communication overhead during vehicle collaboration and ensure high network connectivity; at intersections, a probability-based minimum delay routing decision algorithm is proposed to reduce the information transmission delay. Experiments show that the proposed method effectively improves the efficiency of data-aware collection and transmission, and increases the reliability of transmission. With the explosive growth of video services, the problem of intelligent transmission of DASH-based video streams has become another research hotspot in mobile edge networks. Based on the edge container cloud architecture of vehicular networking, the resource constraints of microservices when deployed in the edge cloud platform were analyzed, and a multi-objective optimization model for microservice resource scheduling was established with the comprehensive performance objectives of shortest microservice invocation distance, highest resource utilization of physical machine clusters, and ensuring load balancing as much as possible.
48
R, Jayamma. "Improving The Performances of WSN Using Data Scheduler and Hierarchical Tree." Journal of Computational Science and Intelligent Technologies 2, no. 2 (August 16, 2021): 7–16. http://dx.doi.org/10.53409/mnaa/jcsit/2202.
Full textAbstract:
Users of data-intensive implementation needs intelligent services and schedulers that will provide models and strategies to optimize their data transfer jobs. Normally sensor nodes are connected to consecutive sensor nodes depending on frequent transmission. To enhance end-to-end data flow parallelism for throughput optimization in high speed WSNs. The major objective is to maximize the WSNs throughput, minimizing the model overhead, avoiding disputation among users and using minimum number of end-system resources. Data packets are broadcasted from sender node to target node. Though, all nodes operate concurrently in various communications, the analysis shows that more packet latencies are occurred and priority-based transmission tasks are performed. Then the proposed Bearing parallelism-based Data Scheduler (BPDS) is used for data scheduling to enhance the end-to-end throughput input parameter. Sensor nodes are fast working node, it verifies each and every node before allocating packet transmission for that node. Busy resources are monitored to inform the nodes that are in processing, based on the schedule it allocates various paths to particular node and monitors the node capacity. Sampling algorithm supports for fixing threshold value, based on the values, they are further allocated to communicate between channels. It assigns the routing path with minimum resources and reduces end to end delay, to improve throughput, and network lifetime.
49
Rukaiya, Rukaiya, Shoab Ahmed Khan, Muhammad Umar Farooq, and Farhan Hussain. "A Novel Self-Forming Virtual Sub-Nets Based Cross-Layer MAC Protocol for Multihop Tactical Network." Applied Sciences 11, no. 6 (March 10, 2021): 2470. http://dx.doi.org/10.3390/app11062470.
Full textAbstract:
A tactical network mainly consists of software-defined radios (SDRs) integrated with programmable and reconfigurable features that provide the addition and customization of different waveforms for different scenarios, e.g., situational awareness, video, or voice transmission. The network, which is mission-critical, congested, and delay-sensitive, operates in infrastructure-less terrains with self-forming and self-healing capabilities. It demands reliability and the need to survive by seamlessly maintaining continuous network connectivity during mobility and link failures. SDR platforms transfer large amounts of data that must be processed with low latency transmissions. The state-of-the-art solutions lack the capability to provide high data throughput and incorporate overhead in route discovery and resource distribution that is not appropriate for resource-constrained mission-critical networks. A cross-layer design exploits existing resources to react to environment changes efficiently, enable reliability, and escalate network throughput. A solution that integrates SDR benefits and cross-layer optimization can perform all the mentioned operations efficiently. In tactical networks, SDR’s maximum usable bandwidth can be utilized by exploiting radios’ autonomous behavior. This paper presents a novel virtual sub-nets based cross-layer medium access control (VSCL-MAC) protocol for self-forming multihop tactical radio networks. It is a MAC-centric design with cross-layer optimization that enables dynamic routing and autonomous time-slot scheduling in a multichannel network environment among SDRs. The cross-layer coupling uses link-layer information from the hybrid of time division multiple access and frequency division multiple access (TDMA/FDMA) MAC to proactively enable distributed intelligent routing at the network layer. The virtual sub-nets based distributed algorithm exploits spectrum resources and provides call setup with persistently available k-hop route information and simultaneous collision-free transmission of voice and data. The experimental results over extensive simulations show significant performance improvements in terms of minimum control overhead, processing time in relay nodes, a substantial increase in network throughput, and lower data latency (up to 76.98%) compared to conventional time-slotted MAC protocols. The design is useful for mission-critical, time-sensitive networks and exploits multihop simultaneous communication in a distributed manner.
50
WONG, LI-PEI, MALCOLM YOKE HEAN LOW, and CHIN SOON CHONG. "BEE COLONY OPTIMIZATION WITH LOCAL SEARCH FOR TRAVELING SALESMAN PROBLEM." International Journal on Artificial Intelligence Tools 19, no. 03 (June 2010): 305–34. http://dx.doi.org/10.1142/s0218213010000200.
Full textAbstract:
Many real world industrial applications involve the Traveling Salesman Problem (TSP), which is a problem that finds a Hamiltonian path with minimum cost. Examples of problems that belong to this category are transportation routing problem, scan chain optimization and drilling problem in integrated circuit testing and production. This paper presents a Bee Colony Optimization (BCO) algorithm for symmetrical TSP. The BCO model is constructed algorithmically based on the collective intelligence shown in bee foraging behaviour. The algorithm is integrated with a fixed-radius near neighbour 2-opt (FRNN 2-opt) heuristic to further improve prior solutions generated by the BCO model. To limit the overhead incurred by the FRNN 2-opt, a frequency-based pruning strategy is proposed. The pruning strategy allows only a subset of the promising solutions to undergo local optimization. Experimental results comparing the proposed BCO algorithm with existing approaches on a set of benchmark problems are presented. For 84 benchmark problems, the BCO algorithm is able to obtain an overall average solution quality of 0.31% from known optimum. The results also show that it is comparable to other algorithms such as Ant Colony Optimization and Particle Swarm Optimization.