Relevant bibliographies by topics / Greedy forwarding / Journal articles

To see the other types of publications on this topic, follow the link: Greedy forwarding.

Journal articles on the topic 'Greedy forwarding'

Author: Grafiati

Published: 4 June 2021

Last updated: 5 February 2022

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Greedy forwarding.'

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.

Minn, Aye Zarchi, and May Zin Oo. "Angle-Aware Greedy Forwarding Algorithm for Vehicular Ad Hoc Networks." Journal of Computer Science 2, no. 1 (2016): 12–19. http://dx.doi.org/10.31357/jcs.v2i1.2722.

Full text

Abstract:

Greedy Perimeter Stateless Routing (GPSR) gives the good forwarding nodes for Mobile Ad Hoc Networks (MANET) but does not provide the right directional forwarding nodes in Vehicular Ad Hoc Network (VANET). This is the fact that MANET uses the nodes without limitations in moving but VANET uses fixed infrastructure in mobility such as roads with lanes. The key of original greedy forwarding is choosing the forwarding node with the shortest distance between the source and the destination. It does not consider the direction of the forwarding nodes, which possibly cause the selected forwarding node going opposite direction from the destination. This paper thus tries to improve the greedy forwarding method of Greedy Perimeter Stateless Routing (GPSR) by taking into considerations in both the distance and the direction. Moreover it shows the mystery of angle that gives the right direction. The optimized GPSR (OGPSR) using improved greedy forwarding provides the better throughput, average end-to-end delay and routing overheads than the original GPSR.

APA, Harvard, Vancouver, ISO, and other styles

Yao, Jian, Hao You Peng, and Tian Fu. "Improved GPSR Routing Protocol in VANETs." Applied Mechanics and Materials 336-338 (July 2013): 1877–81. http://dx.doi.org/10.4028/www.scientific.net/amm.336-338.1877.

Full text

Abstract:

According to characteristics that the vehicles move fast and topology changes quickly in Vehicular Ad hoc Networks (VANETs), a novel routing protocol GMGP based on the location is proposed for VANETs. Predicting the changes of the neighboring nodes positions and using greedy forwarding mechanism forward packet, and using a movement perimeter forwarding algorithm to select the next reliable hop node on the basis of direction and velocity of the mobile nodes when the greedy forwarding fails, it improves the reliability of routing. When a more realistic vehicles mobility model is applied to the NS-2 simulation platform, the simulation indicates that the improved routing protocol has better performance than the GPSR routing protocol.

APA, Harvard, Vancouver, ISO, and other styles

Mahmoud, Marwan, and Mahmoud Ahmad Al-Khasawneh. "Greedy Intersection-Mode Routing Strategy Protocol for Vehicular Networks." Complexity 2020 (December 12, 2020): 1–10. http://dx.doi.org/10.1155/2020/4870162.

Full text

Abstract:

The advantages of vehicular ad hoc networks (VANETs) have been acknowledged, particularly during the last decade. Furthermore, VANET-related issues have been addressed by different researchers. Forwarding information professionally in a VANET is considered a challenging task precisely at the intersections where forwarding the information turns out to be extremely problematic. To elucidate this problem, many researchers have established routing protocols. The improved greedy perimeter stateless routing protocol (IGPSR) has been suggested, in the direction of employing greedy-mode proceeding traditional transportation's streets as well as to employ intersection-method at the joints. In view of greedy mode, the selection of the following stage is as in GPSR. By contrast, in the mode at an intersection, we would expect the vehicle guidelines to govern the following stage. The recreated consequences expose the algorithm, which is anticipated to undeniably demonstrate its competency.

APA, Harvard, Vancouver, ISO, and other styles

Oladeji-Atanda, G., D. Mpoeleng, and F. Ogwu. "Multi-greedy geographic packets forwarding using flow-based indicators." ICST Transactions on Mobile Communications and Applications 6, no. 18 (2021): 169914. http://dx.doi.org/10.4108/eai.13-5-2021.169914.

Full text

APA, Harvard, Vancouver, ISO, and other styles

LI, Chengming, Wenjing LIU, and Koji OKAMURA. "A greedy ant colony forwarding algorithm for Named Data Networking." Proceedings of the Asia-Pacific Advanced Network 34 (May 17, 2013): 17. http://dx.doi.org/10.7125/apan.34.3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Chen, Jiming, Jialu Fan, Xianghui Cao, and Yousian Sun. "GRFR: Greedy Rumor Forwarding Routing for Wireless Sensor/Actor Networks." Information Technology Journal 7, no. 4 (2008): 661–66. http://dx.doi.org/10.3923/itj.2008.661.666.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Zhang, Jingwei. "Greedy forwarding for mobile social networks embedded in hyperbolic spaces." ACM SIGCOMM Computer Communication Review 43, no. 4 (2013): 555–56. http://dx.doi.org/10.1145/2534169.2491728.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Huang, Chung-Ming, and Shih-Yang Lin. "Timer-based greedy forwarding algorithm in vehicular ad hoc networks." IET Intelligent Transport Systems 8, no. 4 (2014): 333–44. http://dx.doi.org/10.1049/iet-its.2013.0014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Alnabhan, Mohammad M. "Advanced GPSR in Mobile Ad-hoc Networks (MANETs)." International Journal of Interactive Mobile Technologies (iJIM) 14, no. 18 (2020): 107. http://dx.doi.org/10.3991/ijim.v14i18.16661.

Full text

Abstract:

This work aims to develop the routing capability of GPSR in MANETs. A new GPSR advancement described as Adaptive GPSR (AGPSR) is proposed with enhanced greedy forwarding and efficient routing decision. AGPSR greedy forwarding model consists of three major phases; initialization, finding target neighbor, weight value computation and next hop selection. The weight value encounters a set of network metrics including node density, network size, congestion level, transmission range, node speed and movement direction. An intensive evaluation methodology was implemented in order to evaluate the performance of proposed AGPSR in MANET. Results confirm that proposed GPSR has surpassed several MANET environmental challenges and outperformed conventional GPSR in terms of PDR, E2E delay, routing overhead, and power consumption. The delay is reduced by AGPSR of up-to 10% compared to conventional GPSR. In addition, 5% increase in PDR and more than 7% decrease in routing overhead and in power consumption was achieved by AGPSR.

APA, Harvard, Vancouver, ISO, and other styles

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 (2019): 193–202. http://dx.doi.org/10.1093/comjnl/bxz093.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

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 (2017): 334–44. http://dx.doi.org/10.1108/ijpcc-d-17-00008.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

KIM, Ki-Il, Min-Jung BAEK, and Tae-Eung SUNG. "Load Balancing for Greedy Forwarding of Geographic Routing in Wireless Networks." IEICE Transactions on Communications E93-B, no. 8 (2010): 2184–87. http://dx.doi.org/10.1587/transcom.e93.b.2184.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Si, Weisheng, Quincy Tse, Guoqiang Mao, and Albert Y. Zomaya. "On the performance of greedy forwarding on Yao and Theta graphs." Journal of Parallel and Distributed Computing 117 (July 2018): 87–97. http://dx.doi.org/10.1016/j.jpdc.2018.02.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Krioukov, Dmitri, Fragkiskos Papadopoulos, Marián Boguñá, and Amin Vahdat. "Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces." ACM SIGMETRICS Performance Evaluation Review 37, no. 2 (2009): 15–17. http://dx.doi.org/10.1145/1639562.1639568.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Cha, Siho, Jongeon Lee, and Minwoo Ryu. "Greedy Anycast Forwarding Protocol based on Vehicle Moving Direction and Distance." Journal of the Korea Society of Digital Industry and Information Management 13, no. 1 (2017): 79–85. http://dx.doi.org/10.17662/ksdim.2017.13.1.079.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Manickavasagam, B., B. Amutha, and S. Priyanka. "Optimal packet routing for wireless body area network using software defined network to handle medical emergency." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 1 (2020): 427. http://dx.doi.org/10.11591/ijece.v10i1.pp427-437.

Full text

Abstract:

<span lang="EN-US">The packet forwarding node selection is one of the main constraints in the Software Defined Network (SDN). To improve the network performance, the SDN controller has to choose the shortest and optimised path between source and destination in routine and emergency packet transmission. In e-health service, information of the emergency patient has to be transferred immediately to remote hospitals or doctors by using efficient packet routing approach in Wireless Body Area Network (WBAN). In WBAN, to improve the packet transmission, the optimal packet routing policy developed based on packets priority with the support of a greedy algorithm for SDN. The SDN Controller selects the forwarding node based on node propagation delay and available bandwidth between two forwarding nodes. The mesh network topology network created for implementation, implementation results are compared with existing research works. Finally, this algorithm implemented in our institution, Software defined communication testbed laboratory (SDCTestbed Lab) with the support of 13 Zodiac-Fx (Forwarding device), 2 Raspberry-Pi3 B+ Model (host) and Arduino kit (sensor node).</span>

APA, Harvard, Vancouver, ISO, and other styles

Patel, Hiteshkumar Chandrakant, and Gopal Ramchandra Kulkarni. "MCFS Enhanced Route Selection Approach Using Multipath Carry Forwarding and Searching in VANET." International Journal of Vehicular Telematics and Infotainment Systems 2, no. 1 (2018): 1–17. http://dx.doi.org/10.4018/ijvtis.2018010101.

Full text

Abstract:

This article describes how a vehicular ad-hoc network (VANET) is an infrastructureless network in which vehicles are connected without wires. Routing in VANET is challenging nowadays due to increased number of a vehicle, the high mobility of nodes, dynamically changing topology and highly partitioned network, so the challenges on the roads are also increased like the road congestion, the safety problem, speed, etc. Various protocol designs have been suggested by various authors to search and forward packets to the destination node. These various algorithms use different schemes like greedy forwarding, perimeter forwarding, carry and store approach, geographic location base approach, etc. The proposed system uses both beacon packets and a geographic closure node approach to forward packets. The beacon-based strategy includes a carry and search approach to search for a routing path. Geographic forwarding will start when carry and search forwarding fails to transmit packets. Route requests will perform multicasting while a route reply follows a unicast strategy. The new proposed system achieves good PDR and an end to end delay.

APA, Harvard, Vancouver, ISO, and other styles

Shelly, Siddharth, and A. V. Babu. "Link Reliability Based Greedy Perimeter Stateless Routing for Vehicular Ad Hoc Networks." International Journal of Vehicular Technology 2015 (March 25, 2015): 1–16. http://dx.doi.org/10.1155/2015/921414.

Full text

Abstract:

We propose an enhancement for the well-known greedy perimeter stateless routing (GPSR) protocol for vehicular ad hoc networks (VANETs), which exploits information about link reliability when one-hop vehicles are chosen for forwarding a data packet. In the proposed modified routing scheme, a tagged vehicle will select its one-hop forwarding vehicle based on reliability of the corresponding communication link. We define link reliability as the probability that a direct link among a pair of neighbour vehicles will remain alive for a finite time interval. We present a model for computing link reliability and use this model for the design of reliability based GPSR. The proposed protocol ensures that links with reliability factor greater than a given threshold alone are selected, when constructing a route from source to destination. The modified routing scheme shows significant improvement over the conventional GPSR protocol in terms of packet delivery ratio and throughput. We provide simulation results to justify the claim.

APA, Harvard, Vancouver, ISO, and other styles

Yang, Bo, Wei Peng, and Xing Zhou. "A Genetic Algorithm for Flow Scheduling in Data Center Networks." Applied Mechanics and Materials 713-715 (January 2015): 2414–17. http://dx.doi.org/10.4028/www.scientific.net/amm.713-715.2414.

Full text

Abstract:

Traffic in today’s data center networks grows rapidly. Traditional routing and forwarding protocols in data center usually rely on static hashing, and may cause avoidable bottlenecks. We present a genetic algorithm to make better use of the resources. Our goal is to minimize the maximum single link utilization of the network. And results show that our algorithm performs better than a recent greedy algorithm.

APA, Harvard, Vancouver, ISO, and other styles

Bengag, Amina, Asmae Bengag, and Mohamed Elboukhari. "A Novel Greedy Forwarding Mechanism Based on Density, Speed and Direction Parameters for Vanets." International Journal of Interactive Mobile Technologies (iJIM) 14, no. 08 (2020): 196. http://dx.doi.org/10.3991/ijim.v14i08.12695.

Full text

Abstract:

In the recent years, the study and developments of networks that do not depend on any pre-existing infrastructure have been very popular. Vehicular Ad Hoc Networks (VANETs) belong to the class of these networks, in which each vehicle participates in routing by transmitting data for other nodes (vehicles). Due to the characteristics of VANET (e.g. high dynamic topology, different communication environment, frequently link breakage…), the routing process still one of the most challenging aspects. Hence, many routing protocols have been suggested to overcome these challenges. Moreover, routing protocols based on the position of vehicles are the most popular and preferred class, thanks to its many advantages like the less control overhead and the scalability. However, this class suffer from some problems such as frequent link breakages caused by the high-mobility of vehicles, which cause a low PDR and throughput. In this investigation, we introduce a novel greedy forwarding strategy used to create a new routing protocol based on the position of vehicles, to reduce the link breakages and get a stable route that improves the PDR and throughput. The proposed Density and Velocity (Speed, Direction) Aware Greedy Perimeter Stateless Routing protocol (DVA-GPSR) is based on the suggested greedy forwarding technique that utilizes the density, the speed and the direction for selecting the most convenient relaying node candidate. The results of simulation prove that DVA-GPSR protocol outperforms the classical GPSR in all studied metrics like PDR, throughput, and the ratio of routing overhead by changing the quantity of vehicles in urban and highway scenarios.

APA, Harvard, Vancouver, ISO, and other styles

Hemalatha, S., and E. George Dharma Prakash Raj. "Enhanced Greedy Perimeter Forwarding Algorithm for Mobile Sensor Network in Cluster region." International Journal of Computer Sciences and Engineering 7, no. 6 (2019): 115–23. http://dx.doi.org/10.26438/ijcse/v7i6.115123.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Huang, Pei, Chen Wang, and Li Xiao. "Improving End-to-End Routing Performance of Greedy Forwarding in Sensor Networks." IEEE Transactions on Parallel and Distributed Systems 23, no. 3 (2012): 556–63. http://dx.doi.org/10.1109/tpds.2011.175.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Vieira, Luiz Filipe M., and André V. dos S. Cunha. "Performance of Greedy Forwarding in Geographic Routing for the Internet of Drones." Internet Technology Letters 1, no. 5 (2018): e47. http://dx.doi.org/10.1002/itl2.47.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Habboush, Ahmad Khader. "Hot Spot Phenomenon and Greedy Routing Failure in Mobile Ad-hoc Networks." Modern Applied Science 13, no. 4 (2019): 89. http://dx.doi.org/10.5539/mas.v13n4p89.

Full text

Abstract:

Lately, Greedy Forwarding Strategy (GFS) is express as a basic mechanistic in geographic routing for Mobile Ad Hoc Networks (MANETs). GFS employs the shortest path between two connected nodes. The research&rsquo;s analysis of networks that using GFS indicates that some areas of the MANET are more decumbent to high traffic load compared with other places. This situation is called hot spot phenomenon. Accordingly, these hot spot nodes become constrained in terms of many issues and seem to be died fast. The performance of GFS becomes limited to these hot spot nodes. The whole MANET fails, as GFS fails to function well in this area. This paper takes an in depth look at the reason behind greedy failure. Lastly, the work concludes the most appropriate characteristics that should be consider for enhancing greedy scheme to be compatible with the unique features of MANET.

APA, Harvard, Vancouver, ISO, and other styles

Stephan, Thompson, Ananthnarayan Rajappa, K. S. Sendhil Kumar, Shivang Gupta, Achyut Shankar, and V. Vijayakumar. "Modified fuzzy-based greedy routing protocol for VANETs." Journal of Intelligent & Fuzzy Systems 39, no. 6 (2020): 8357–64. http://dx.doi.org/10.3233/jifs-189154.

Full text

Abstract:

Vehicular Ad Hoc Networks (VANETs) is the most growing research area in wireless communication and has been gaining significant attention over recent years due to its role in designing intelligent transportation systems. Wireless multi-hop forwarding in VANETs is challenging since the data has to be relayed as soon as possible through the intermediate vehicles from the source to destination. This paper proposes a modified fuzzy-based greedy routing protocol (MFGR) which is an enhanced version of fuzzy logic-based greedy routing protocol (FLGR). Our proposed protocol applies fuzzy logic for the selection of the next greedy forwarder to forward the data reliably towards the destination. Five parameters, namely distance, direction, speed, position, and trust have been used to evaluate the node’s stability using fuzzy logic. The simulation results demonstrate that the proposed MFGR scheme can achieve the best performance in terms of the highest packet delivery ratio (PDR) and minimizes the average number of hops among all protocols.

APA, Harvard, Vancouver, ISO, and other styles

Yang, Xiao Ling, Dan Liao, Gang Sun, Chuan Lu, and Hong Fang Yu. "GPCR-D: A Topology and Position Based Routing Protocol in VANET." Advanced Materials Research 846-847 (November 2013): 858–63. http://dx.doi.org/10.4028/www.scientific.net/amr.846-847.858.

Full text

Abstract:

Compared with traditional GPCR, there are three differences in the new GPCR-D: 1) GPCR-D is a topology and position based routing protocol. 2) It can detect dynamically the network density and establish the local areas with high node density, where vehicles speed is limited and topology changes slowly. Therefore, we adopt shortest path algorithm aimed at delivering packets speedily. While outside the local areas, topology changes rapidly, so greedy forwarding is used to avoid restoring and maintaining links frequently. Thus GPCR-D makes full use of their respective advantages. 3) The repair strategy of GPCR-D selects the neighbor whose direction is closest to destination in the neighbor table as the next forwarding hop. The simulation shows that GPCR-D works more effectively than GPCR in terms of average delivery success rate and end-to-end time delay.

APA, Harvard, Vancouver, ISO, and other styles

Shelly, Siddharth, Vishnu Vijay, and A. V. Babu. "Model for Path Duration in Vehicular Ad Hoc Networks under Greedy Forwarding Strategy." Procedia Computer Science 48 (2015): 394–400. http://dx.doi.org/10.1016/j.procs.2015.04.112.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Zhang, Li Cui, Xiao Nan Zhu, Zhi Gang Wang, and Guang Hui Han. "Research of Improvement of GPSR Protocol in Vehicular Ad Hoc Networks." Applied Mechanics and Materials 738-739 (March 2015): 1115–18. http://dx.doi.org/10.4028/www.scientific.net/amm.738-739.1115.

Full text

Abstract:

Considering the shortcoming of the traditional Greedy Perimeter Stateless Routing Protocol in the Vehicular Ad hoc Networks ,this paper focuses on an improved GPSR protocol based on the density of vehicle flow .This new scheme includes macro-directing algorithm , micro-forwarding strategy and the maintenance of the neighbor list.The simulation result shows that compared with the traditional GPSR protocol, the new GPSR protocol improves data packet delivery ratio, but its average end-to-end delay is slightly larger than before.

APA, Harvard, Vancouver, ISO, and other styles

Aliyu, Ahmed, Hesham El-Sayed, Abdul Hanan Abdullah, Intyaz Alam, Jun Li, and Mukesh Prasad. "Video Streaming in Urban Vehicular Environments: Junction-Aware Multipath Approach." Electronics 8, no. 11 (2019): 1239. http://dx.doi.org/10.3390/electronics8111239.

Full text

Abstract:

In multipath video streaming transmission, the selection of the best vehicle for video packet forwarding considering the junction area is a challenging task due to the several diversions in the junction area. The vehicles in the junction area change direction based on the different diversions, which lead to video packet drop. In the existing works, the explicit consideration of different positions in the junction areas has not been considered for forwarding vehicle selection. To address the aforementioned challenges, a Junction-Aware vehicle selection for Multipath Video Streaming (JA-MVS) scheme has been proposed. The JA-MVS scheme considers three different cases in the junction area including the vehicle after the junction, before the junction and inside the junction area, with an evaluation of the vehicle signal strength based on the signal to interference plus noise ratio (SINR), which is based on the multipath data forwarding concept using greedy-based geographic routing. The performance of the proposed scheme is evaluated based on the Packet Loss Ratio (PLR), Structural Similarity Index (SSIM) and End-to-End Delay (E2ED) metrics. The JA-MVS is compared against two baseline schemes, Junction-Based Multipath Source Routing (JMSR) and the Adaptive Multipath geographic routing for Video Transmission (AMVT), in urban Vehicular Ad-Hoc Networks (VANETs).

APA, Harvard, Vancouver, ISO, and other styles

Sahoo, Kshira Sagar, Bibhudatta Sahoo, Ratnakar Dash, and Brojo Kishore Mishra. "Improving Resiliency in SDN using Routing Tree Algorithms." International Journal of Knowledge Discovery in Bioinformatics 7, no. 1 (2017): 42–57. http://dx.doi.org/10.4018/ijkdb.2017010104.

Full text

Abstract:

The ability to recover the control logic after a failure is detected in specific time window is called resiliency. The Software Defined Network (SDN) is an emerged and powerful architecture which allow to separate the control plane from forwarding. This decoupling architecture brings new difficulties to the network resiliency because link failure between switch and controller could defunct the forwarding plane. It has been identified that the resiliency of the network can be improved by choosing the correct place for the controller and by choosing proper routing tree once the controller location is known. In this work, we have analysed the performance of various Routing Tree algorithms on different network topology generated by Bernoulli Random Graph model and found that Greedy Routing Tree (GRT) provides the maximum resiliency. The Closeness Centrality Theorem has proposed to find the best controller position and later analysed the performance of various single controller placement algorithms on GRT for finding the overall improvement of the resiliency of the network.

APA, Harvard, Vancouver, ISO, and other styles

Saqour, Raed, Mohamad Shanuldin, and Mahamod Ismail. "Prediction Schemes to Enhance the Routing Process in Geographical GPSR Ad Hoc Protocol." Mobile Information Systems 3, no. 3-4 (2007): 203–20. http://dx.doi.org/10.1155/2007/364101.

Full text

Abstract:

Geographical routing protocols have received a serious attention due to more advantages they have in comparison to the conventional routing protocols. They require information about the physical position of nodes needed to be available. Commonly, each node determines its own position through the use of Global Positioning System (GPS) or some other type of positioning service. Greedy Perimeter Stateless Routing (GPSR) protocol, which is one of geographical routing protocols, limits the forwarding decision of the packet based on the node's own position, the destination's position and the position of the forwarding node's neighbors. Location information has some inaccuracy depending on the localization system and the environment exists in. This paper aims to study the impact of mobility metrics (beacon interval, and node speed) on introducing location information error in GPSR protocol using different mobility models. The effect of these metrics is identified in GPSR as Neighbor Break Link (NBL) problem. Based on simulation analysis, mobility prediction schemes are proposed to migrate the observed problem.

APA, Harvard, Vancouver, ISO, and other styles

Ram Shringar Raw. "Comparison and Analysis of Greedy Forwarding Using BNGF Method in Different Vehicular Traffic Scenarios." International Journal of Next-Generation Networks 3, no. 2 (2011): 74–87. http://dx.doi.org/10.5121/ijngn.2011.3205.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Al-shugran, Mahmoud, Osman Ghazali, Suhaidi Hassan, Kashif Nisar, and A. Suki M. Arif. "A qualitative comparison evaluation of the greedy forwarding strategies in Mobile Ad Hoc Network." Journal of Network and Computer Applications 36, no. 2 (2013): 887–97. http://dx.doi.org/10.1016/j.jnca.2012.10.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

De, S. "On hop count and euclidean distance in greedy forwarding in wireless ad hoc networks." IEEE Communications Letters 9, no. 11 (2005): 1000–1002. http://dx.doi.org/10.1109/lcomm.2005.11019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Jimoh, Onemayin David, Lukman Adewale Ajao, Oluwafemi Oyetunde Adeleke, and Stephen Sunday Kolo. "A Vehicle Tracking System Using Greedy Forwarding Algorithms for Public Transportation in Urban Arterial." IEEE Access 8 (2020): 191706–25. http://dx.doi.org/10.1109/access.2020.3031488.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Cheng, Yuanguo, and Guohui Li. "A Scheme of Restricted Flooding and Greedy Forwarding Routing for Object Tracking Sensor Networks." International Journal of Distributed Sensor Networks 5, no. 1 (2009): 94–95. http://dx.doi.org/10.1080/15501320802575153.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Habboush, Ahmad, and Mahmoud AlShugran. "An Enhanced Queue Management Approach for Greedy Routing in MANETs." Computer and Information Science 11, no. 2 (2018): 64. http://dx.doi.org/10.5539/cis.v11n2p64.

Full text

Abstract:

Mobile Ad-hoc network (MANET) is the guiding technology of ubiquitous era and a cornerstone in the 4G communication architecture. MANET has limited resources and characterized with high mobility and frequent topology change. Routing in MANET should follow these constrains, otherwise, it can severely degrade the performance of MANET. Owing to Greedy routing (GFS) nature in MANET, a certain part of the MANET becomes congested before other parts. In such area the nodes have failed to forward packets in a timely manner or drop them, thus such nodes called Network Holes. This paper presents a simple and efficient enhanced GFS routing algorithm called Intelligent Fuzzy logic Greedy forwarding Scheme (IFGFS). IFGFS consider the De-congestion level of each mobile node as another selective metric besides distance. In order to validate our algorithm, we rely on a wide simulation experiments. The evaluation results showed the correctness of our new proposed algorithm the adaptive- congestion IFGFS which maximize the performance of the network.

APA, Harvard, Vancouver, ISO, and other styles

Mahmood, Baban A., and Dakshnamoorthy Manivanann. "Hybrid on-demand greedy routing protocol with backtracking for mobile ad-hoc networks." International Journal of Pervasive Computing and Communications 16, no. 1 (2020): 24–52. http://dx.doi.org/10.1108/ijpcc-04-2019-0039.

Full text

Abstract:

Purpose The purpose of this paper is to design an efficient on-demand routing protocol for mobile ad hoc networks (MANETs) which combines greedy forwarding and backtracking. Design/methodology/approach It uses a hybrid approach. It uses greedy approach to determine a route from source to the destination. If the greedy approach fails, then it uses a backtracking approach. Combining greedy and backtracking approaches results in a more efficient protocol. Findings A new routing algorithm for MANETs which performs better than some of the existing algorithms. Research limitations/implications A major limitation of this work is that the authors did not implement the protocol on a test bed and evaluated the performance. They neither had the infrastructure nor the resources to actually implement the protocol. Instead, like most of the researchers, they evaluated the performance of their protocol based on extensive simulation. The mobility model, the area of deployment and the density of nodes chosen to simulate the protocol are consistent with what many of the other researchers have done. Intuitively, the authors’ protocol, as the performance evaluation indicates, is likely to perform well in small networks. Practical implications The authors did not implement the protocol on a test bed to evaluate the performance of the protocol. The authors used simulation to study the performance of their protocol. Their simulation model is similar to many of the research works published in the literature. Originality/value To the authors’ knowledge, no other paper has combined the greedy and backtracking approach to design a routing protocols for MANETs.

APA, Harvard, Vancouver, ISO, and other styles

Qin, Yu Jue, and Zhi Hui Ge. "Area Partition-Based Suppression Algorithm for Contention-Based Forwarding in Mobile Ad-Hoc Networks." Applied Mechanics and Materials 239-240 (December 2012): 1360–67. http://dx.doi.org/10.4028/www.scientific.net/amm.239-240.1360.

Full text

Abstract:

Contention-Based Forward (CBF) has proven to achieve a very good performance in mobile ad-hoc networks. Compare with other greedy forward algorithm, CBF is much more robust and have low maintenance network overheads. On the other hand, the main issue of CBF is to avoid packet duplication. Duplication is very easy to occur due to the hidden nodes problem. In this paper we introduce an area partition-based suppression algorithm for CBF in mobile ad-hoc networks. This algorithm sets the transmission area of a node into two areas: suppression area and none-suppression area. In the none-suppression area, the algorithm still use the SS-CBF (Sender Suppression-CBF) algorithm, in the suppression area, this paper will use a new equation to avoid packet duplication. The result shows that the new protocol could reduce the network overheads and do not cost extra transmission time.

APA, Harvard, Vancouver, ISO, and other styles

Et. al., Dr B. Shadaksharappa,. "Attack Prediction By Using Greedy Algorithm For Diminishing The Drop And Delay In Wireless Sensor Networks." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 6 (2021): 1072–82. http://dx.doi.org/10.17762/turcomat.v12i6.2425.

Full text

Abstract:

The essential constraint of the internet is that forwarding the data packets of data among the restricted and trustworthy data nodes. If the receiver node is attacker node then it'll drop the data rather than forwarding the data to ensuing neighbor node. Therefore, efficient and secure data transmission is extremely necessary within the network data transmission. Each router node within the network can accept the data packets up to its buffer size only. Once the queue value reached the buffer threshold value then congestion can occur at the node. Once congestion happens then it would lose the data packets. By sending the data packets to the next neighbour node this problem will be resolved. This congestion will be handled by the Fully Distributed Congestion Control FDCC and Cooperative and Memory Efficient Token Bucket (CMTB) algorithms. Because the data is transmitted to the next neighbour node predicting the node behavior is extremely necessary because it is an attacker or the conventional transmitter node because it has to transmit the efficient data securely to the destination node. In this paper, the node behavior will be predicted by analyzing the trace file. The simulation results show that this proposed method would provide a lot of security in data transmission. The WSN comprises a group of sensor nodes that are disseminated on the network. These sensor nodes initially exchange their data packets to the near nodes to send the data packets to the target node. During the transmission of these data packets some data packets drop may also happen inside the network. This packet drop should be kept up as low as feasible for correct data transmission to the target node or destination node. This algorithm highlights the routes with high link quality, low packet delay and with low packet drop. Simulation results show that this proposed algorithm can provide the most effective path for transmitting the data to the destination meanwhile it reduces the packet drop and packet delay.

APA, Harvard, Vancouver, ISO, and other styles

KEELER, HOLGER P. "A stochastic analysis of greedy routing in a spatially dependent sensor network." European Journal of Applied Mathematics 23, no. 4 (2012): 485–514. http://dx.doi.org/10.1017/s095679251200006x.

Full text

Abstract:

For a sensor network, a tractable spatially dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stochastic model is formulated to examine message advancements under greedy routing in such a sensor network. The aim of this work is to demonstrate that an inhomogeneous Poisson process can be used to model a sensor network with spatially dependent node density. Symmetric elliptic integrals and asymptotic approximations are used to describe the random behaviour of hops. Types of dependence that affect hop advancements are examined. We observe that the dependence between successive jumps in a multi-hop path is captured by including only the previous forwarding node location. We include a simple uncoordinated sleep scheme, and observe that the complexity of the model is reduced when sufficiently many nodes are asleep. All expressions involving multi-dimensional integrals are derived and evaluated with quasi-Monte Carlo integration methods based on Halton sequences and recently developed lattice rules. An importance sampling function is derived to speed up the quasi-Monte Carlo methods. The ensuing results agree extremely well with simulations.

APA, Harvard, Vancouver, ISO, and other styles

Dixit, Prashant, Anuradha Pillai, and Rahul Rishi. "Back tracking with exclusion A solution for local maxima problem in greedy location based packet forwarding for MANETs." International Journal of Computer Sciences and Engineering 6, no. 9 (2018): 361–64. http://dx.doi.org/10.26438/ijcse/v6i9.361364.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Smiri, Safae, Adil Ben Abbou, Abdelali Boushaba, Azeddine Zahi, and Rachid Ben Abbou. "WA-GPSR: Weight-Aware GPSR-Based Routing Protocol for VANET." International Journal of Interactive Mobile Technologies (iJIM) 15, no. 17 (2021): 69. http://dx.doi.org/10.3991/ijim.v15i17.24083.

Full text

Abstract:

The extremely fast topology has created new requirements for the geographic routing protocol, which has been the most efficient solution for Vehicular Ad-hoc Networks (VANETs). The frequent disconnection of links makes the choice of the next routing node extremely difficult. Hence, an efficient routing algorithm needs to deliver the appropriate path to transfer the data packets with the most relevant quality of service (QoS). In this work, the weight-aware greedy perimeter stateless (WA-GPSR) routing protocol is presented. The enhanced GPSR protocol computes the reliable communication area and selects the next forwarding vehicle based on several routing criteria. The proposal has been evaluated and compared to Maxduration-Minangle GPSR (MM-GPSR) and traditional GPSR using strict metric analysis. Our experimental results using NS-2 and VanetMobiSim, have demonstrated that WA-GPSR has the ability to enhance network performance.

APA, Harvard, Vancouver, ISO, and other styles

Park, Youngho, Chul Sur, and Kyung-Hyune Rhee. "A Secure Incentive Scheme for Vehicular Delay Tolerant Networks Using Cryptocurrency." Security and Communication Networks 2018 (July 8, 2018): 1–13. http://dx.doi.org/10.1155/2018/5932183.

Full text

Abstract:

One remarkable feature of vehicular ad hoc networks is characterized by an opportunistic communications by means of store-carry-forward message relaying which requires the cooperation of vehicles on the networks. However, we cannot be sure that all vehicles willingly contribute their computing resources to the networks for message forwarding with no rewards for their efforts in real-world scenarios. In addition, unfortunately, there may exist some selfish and greedy node which may not help others but tend to take their own gain. To cope with this challenge, incentive mechanisms are generally considered as the promising solution. In this paper, we design a Bitcoin-based secure and reliable incentive scheme for cooperative vehicular delay tolerant networking services. Bitcoin is the well-known worldwide cryptocurrency and digital payment system whose implementation relies on cryptographic techniques, which makes it possible to develop a practical credit-based incentive scheme on the vehicular networks at a low cost. We also implement Bitcoin transaction scripts to handle our proposed incentive scheme.

APA, Harvard, Vancouver, ISO, and other styles

Nassiri, Mohammad, Mehri Karimi, Reza Mohammadi, and Mehdi Abbasi. "EEARP - an Efficient and Energy Aware Routing Protocol for Underwater Wireless Sensor Networks." ECTI Transactions on Electrical Engineering, Electronics, and Communications 18, no. 2 (2020): 145–57. http://dx.doi.org/10.37936/ecti-eec.2020182.222642.

Full text

Abstract:

Recently, Underwater Wireless Sensor Networks (UWSNs) have attracted significant attention from both academia and industry to explore the vast underwater environment. Since UWSNs suffer from long propagation delay, low bandwidth, and high error rate, providing an efficient routing protocol is challenging. This paper proposes EEARP, a series of new routing protocols for underwater networks to improve the performance of existing DBR. The DBR does not consider energy. It only receives data packets from upper depth node and forwards the packets to lower depth nodes. Moreover, this greedy behavior of DBR causes void area problem. EEARP creates a directed acyclic graph rooted at a sink. Each node receives information like depth, energy, and the number of parents from its parents. When forwarding, each node sends a data packet to one or more of its parent nodes. We implemented EEARP in NS2 simulator and evaluated its performance under different scenarios. Results confirm that EEARP outperforms DBR in terms of energy saving, network lifetime, end-to-end delay and packet loss ratio.

APA, Harvard, Vancouver, ISO, and other styles

Muthusenthil, Balaubramanian, and Hyunsung Kim. "SHRP - Secure Hybrid Routing Protocol over Hierarchical Wireless Sensor Networks." International Journal of Computers Communications & Control 12, no. 6 (2017): 854. http://dx.doi.org/10.15837/ijccc.2017.6.2909.

Full text

Abstract:

A data collection via secure routing in wireless sensor networks (WSNs)has given attention to one of security issues. WSNs pose unique security challengesdue to their inherent limitations in communication and computing, which makes vulnerableto various attacks. Thus, how to gather data securely and efficiently based onrouting protocol is an important issue of WSNs. In this paper, we propose a securehybrid routing protocol, denoted by SHRP, which combines the geographic basedscheme and hierarchical scheme. First of all, SHRP differentiates sensor nodes intotwo categories, nodes with GPS (NG) and nodes with antennas (NA), to put differentroles. After proposing a new clustering scheme, which uses a new weight factor toselect cluster head efficiently by using energy level, center weight and mobility afterforming cluster, we propose routing scheme based on greedy forwarding. The packetsin SHRP are protected based on symmetric and asymmetric cryptosystem, which providesconfidentiality, integrity and authenticity. The performance analyses are doneby using NS2 and show that SHRP could get better results of packet loss rate, deliveryratio, end to end delay and network lifetime compared to the well known previousschemes.

APA, Harvard, Vancouver, ISO, and other styles

Shen, Dawei, Wei Yan, Yuhuai Peng, Yanhua Fu, and Qingxu Deng. "Congestion Control and Traffic Scheduling for Collaborative Crowdsourcing in SDN Enabled Mobile Wireless Networks." Wireless Communications and Mobile Computing 2018 (2018): 1–11. http://dx.doi.org/10.1155/2018/9821946.

Full text

Abstract:

Currently, a number of crowdsourcing-based mobile applications have been implemented in mobile networks and Internet of Things (IoT), targeted at real-time services and recommendation. The frequent information exchanges and data transmissions in collaborative crowdsourcing are heavily injected into the current communication networks, which poses great challenges for Mobile Wireless Networks (MWN). This paper focuses on the traffic scheduling and load balancing problem in software-defined MWN and designs a hybrid routing forwarding scheme as well as a congestion control algorithm to achieve the feasible solution. The traffic scheduling algorithm first sorts the tasks in an ascending order depending on the amount of tasks and then solves it using a greedy scheme. In the proposed congestion control scheme, the traffic assignment is first transformed into a multiknapsack problem, and then the Artificial Fish Swarm Algorithm (AFSA) is utilized to solve this problem. Numerical results on practical network topology reveal that, compared with the traditional schemes, the proposed congestion control and traffic scheduling schemes can achieve load balancing, reduce the probability of network congestion, and improve the network throughput.

APA, Harvard, Vancouver, ISO, and other styles

Zheng, Guoqiang, Bing Li, Jishun Li, Huahong Ma, and Baofeng Ji. "An Efficient Data Collection Protocol Based on Multihop Routing and Single-Node Cooperation in Wireless Sensor Networks." Journal of Sensors 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/186806.

Full text

Abstract:

Considering the constrained resource and energy in wireless sensor networks, an efficient data collection protocol named ESCDD which adopts the multihop routing technology and the single-node selection cooperative communication is proposed to make the communication protocol more simple and easy to realize for the large-scale multihop wireless sensor networks. ESCDD uses the greedy strategy and the control information based on RTS/CTS to select forwarding nodes. Then, the hops in the multihop data transmission are reduced. Based on the power control in physical layer and the control frame called CoTS in MAC layer, ESCDD chooses a single cooperative node to perform cooperative transmission. The receiving node adopts maximal ratio combining (MRC) to recover original data. The energy consumption per hop is reduced. Furthermore, the total energy consumption in data collection process is shared by more nodes and the network lifetime is extended. Compared with GeRaF, EERNFS, and REEFG protocol, the simulation results show that ESCDD can effectively reduce the average delay of multihop data transmission, improve the successful delivery rate of data packets, significantly save the energy consumption of network nodes, and make the energy consumption more balanced.

APA, Harvard, Vancouver, ISO, and other styles

Ghafoor, Huma, Insoo Koo, and Nasir-ud-Din Gohar. "Neighboring and Connectivity-Aware Routing in VANETs." Scientific World Journal 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/789247.

Full text

Abstract:

A novel position-based routing protocol anchor-based connectivity-aware routing (ACAR) for vehicular ad hoc networks (VANETs) is proposed in this paper to ensure connectivity of routes with more successfully delivered packets. Both buses and cars are considered as vehicular nodes running in both clockwise and anticlockwise directions in a city scenario. Both directions are taken into account for faster communication. ACAR is a hybrid protocol, using both the greedy forwarding approach and the store-carry-and-forward approach to minimize the packet drop rate on the basis of certain assumptions. Our solution to situations that occur when the network is sparse and when any (source or intermediate) node has left its initial position makes this protocol different from those existing in the literature. We consider only vehicle-to-vehicle (V2V) communication in which both the source and destination nodes are moving vehicles. Also, no road-side units are considered. Finally, we compare our protocol with A-STAR (a plausible connectivity-aware routing protocol for city environments), and simulation results in NS-2 show improvement in the number of packets delivered to the destination using fewer hops. Also, we show that ACAR has more successfully-delivered long-distance packets with reasonable packet delay than A-STAR.

APA, Harvard, Vancouver, ISO, and other styles

Gupta, Naveen Kumar, Rama Shankar Yadav, Rajendra Kumar Nagaria, and Deepak Gupta. "An Angular 3D Path Selection Protocol in Wireless Sensor Networks." Open Computer Science 11, no. 1 (2021): 190–207. http://dx.doi.org/10.1515/comp-2020-0203.

Full text

Abstract:

Abstract Geographical routing is an area of interest for wireless sensor networks because of its scalability and local decision making capability. Usually, geographical routing protocols rely on greedy approach and suffer from the void node problem (VNP). This paper presents an angular three-dimensional routing protocol (A3DR) for wireless sensor networks. In A3DR, the next hop is selected from nodes available in solid angle decided dynamically based on network density, i.e., larger solid angle for sparse networks while a smaller angle for dense one. The delay based contention mechanism has been proposed to select a suitable forwarding node among nodes lying in a particular solid angle. A3DR has a provision to adaptively tune the solid angle to resolve the void node problem. Further, the proposed protocol A3DR will take care of traffic congestion problem suffered by beaconless routing protocol. The A3DR tackle the concave void problem by allowing conditional backtracking to find another suitable path and prevent looping. Additionally, A3DR address overhear problem by utilizing the concept of request-to-forward and clear-to-forward for the nodes lying outside the solid angle 60°. The performance of proposed A3DR is compared with existing protocols by implementing it on the INET framework under OMNET++ simulator. The simulation results indicate that A3DR achieves a high packet reception rate while maximizing the residual energy and minimizing traffic overhead.

APA, Harvard, Vancouver, ISO, and other styles

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!