Log in

Relevant bibliographies by topics / Face routing / Journal articles

To see the other types of publications on this topic, follow the link: Face routing.

Journal articles on the topic 'Face routing'

Author: Grafiati

Published: 4 June 2021

Last updated: 15 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 'Face routing.'

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

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

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Yujun Li, Yaling Yang, and Xianliang Lu. "Rules of Designing Routing Metrics for Greedy, Face, and Combined Greedy-Face Routing." IEEE Transactions on Mobile Computing 9, no. 4 (2010): 582–95. http://dx.doi.org/10.1109/tmc.2009.171.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Tao, Shao, A. L. Ananda, and Mun Choon Chan. "Greedy face routing with face identification support in wireless networks." Computer Networks 54, no. 18 (2010): 3431–48. http://dx.doi.org/10.1016/j.comnet.2010.07.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Clouser, Thomas, Mark Miyashita, and Mikhail Nesterenko. "Concurrent face traversal for efficient geometric routing." Journal of Parallel and Distributed Computing 72, no. 5 (2012): 627–36. http://dx.doi.org/10.1016/j.jpdc.2012.01.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Cho, Hyunchong, Sangdae Kim, Seungmin Oh, Euisin Lee, and Sang-Ha Kim. "Energy-Efficient and Reliable Face-Routing Scheme in Wireless Networks." Sensors 21, no. 8 (2021): 2746. http://dx.doi.org/10.3390/s21082746.

Full text

Abstract:

Face-routing is one of the reliable recovery schemes when geographic routing fails to transmit data packets. Although studies on face-routing can overcome the failure of the data transmission, they lead to much energy consumption due to frequent data transmissions between adjacent nodes for carrying out the rule of face-routing. To avoid the frequent data transmissions, several face-routing schemes have been recently proposed to transmit data packets to the farthest-neighbor node. However, they happen with many data retransmissions because the farthest-neighbor node has a relatively low transm

APA, Harvard, Vancouver, ISO, and other styles

5

Naves, Guyslain. "The hardness of routing two pairs on one face." Mathematical Programming 131, no. 1-2 (2010): 49–69. http://dx.doi.org/10.1007/s10107-010-0343-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

DATTA, AJOY K., JERRY L. DERBY, JAMES E. LAWRENCE, and SÉBASTIEN TIXEUIL. "STABILIZING HIERARCHICAL ROUTING." Journal of Interconnection Networks 01, no. 04 (2000): 283–302. http://dx.doi.org/10.1142/s0219265900000172.

Full text

Abstract:

Hierarchical routing provides a less expensive algorithm compared to the traditional all-pairs routing algorithms. We present an algorithm in this paper which benefits from the lower memory requirement, faster routing table lookup, and less costly broadcast exemplified by hierarchical routing, and yet maintains routing capability of all pairs of connected nodes even in the presence of faults, such as link/node failures and repairs, and corruption of program variables. Additionally, this algorithm solves the problem of cluster partitioning where nodes that are supposed to be in the same subset

APA, Harvard, Vancouver, ISO, and other styles

7

Mao, Yingchi. "Greedy-Face-Greedy Routing based Human Tracking in Mobile Social Networks." Procedia Computer Science 5 (2011): 472–79. http://dx.doi.org/10.1016/j.procs.2011.07.061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Cho, Hyunchong, Cheonyong Kim, Sangdae Kim, Seungmin Oh, and Sang-Ha Kim. "Disjointed Multipath using Energy Efficient Face Routing in Wireless Sensor Networks." KIISE Transactions on Computing Practices 23, no. 2 (2017): 116–21. http://dx.doi.org/10.5626/ktcp.2017.23.2.116.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

SangeethaPriya, N., L. Bharathi, S. Dola Sanjay, N. V. D. P. Murthy, and A. N. L. Harisha. "Optimal Multilevel Link Extend Umpiring Routing Based Secure Routing Protocol for Improving Privacy Standard in Wireless Sensor Networks." Journal of Computational and Theoretical Nanoscience 17, no. 12 (2020): 5543–49. http://dx.doi.org/10.1166/jctn.2020.9451.

Full text

Abstract:

Generally wireless sensor networks (WSN) are connected via a wireless medium to form a large amount of cooperative sensor nodes. Monitoring control is an important aspect of monitoring users in monitoring applications, such as wireless sensor networks, because of security. There are countless applications to pay for themselves but at the same time, their special properties offer a number of challenges, such as security and surveillance, control, and operation and complex system maintenance. WSN has already seen it on the Internet, from face-to-face security attacks. To propose an Optimal Multi

APA, Harvard, Vancouver, ISO, and other styles

10

Stanulovic, Jelena, Nathalie Mitton, and Ivan Mezei. "Routing with Face Traversal and Auctions Algorithms for Task Allocation in WSRN." Sensors 21, no. 18 (2021): 6149. http://dx.doi.org/10.3390/s21186149.

Full text

Abstract:

Four new algorithms (RFTA1, RFTA2, GFGF2A, and RFTA2GE) handling the event in wireless sensor and robot networks based on the greedy-face-greedy (GFG) routing extended with auctions are proposed in this paper. In this paper, we assume that all robots are mobile, and after the event is found (reported by sensors), the goal is to allocate the task to the most suitable robot to act upon the event, using either distance or the robots’ remaining energy as metrics. The proposed algorithms consist of two phases. The first phase of algorithms is based on face routing, and we introduced the parameter c

APA, Harvard, Vancouver, ISO, and other styles

11

Cho, Hyunchong, Sangdae Kim, Cheonyong Kim, Sang-Ha Kim, and Chi-Jung Hwang. "Energy-Efficient Face Routing Protocol Considering Radio Range in Wireless Sensor Networks." Journal of Korean Institute of Communications and Information Sciences 40, no. 6 (2015): 1058–69. http://dx.doi.org/10.7840/kics.2015.40.6.1058.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Lian, Jie, and Kshirasagar Naik. "Skipping technique in face routing for wireless ad hoc and sensor networks." International Journal of Sensor Networks 4, no. 1/2 (2008): 92. http://dx.doi.org/10.1504/ijsnet.2008.019255.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Seada, Karim, Ahmed Helmy, and Ramesh Govindan. "Modeling and analyzing the correctness of geographic face routing under realistic conditions." Ad Hoc Networks 5, no. 6 (2007): 855–71. http://dx.doi.org/10.1016/j.adhoc.2007.02.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Chen, Liang Bin, Qiang Li, and Xiang Feng. "Research on Multicast Routing Algorithm for P2P Overlay Network." Applied Mechanics and Materials 347-350 (August 2013): 2293–97. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2293.

Full text

Abstract:

Multicast routing is a critical problem in the P2P network. The main task for multicast routing is to establish a multicast tree with good performance, to satisfy the various qualities of service requirements, such as improving the streaming media service quality, and the utilization rate of cyber source. Many efficient overlay multicast routing algorithms are proposed to face the new challenge in current P2P network. This paper attempts to survey the current problems, the solutions for overlay multicast routing algorithms, and points out the further research directions.

APA, Harvard, Vancouver, ISO, and other styles

15

Huang, Feng, Chun Jiang Zhao, Fei Fei Li, and Hua Rui Wu. "A WSN Routing and Sleeping Algorithm in Agriculture Intermittent Data Collection." Applied Mechanics and Materials 513-517 (February 2014): 606–11. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.606.

Full text

Abstract:

Farmland environment is away from power facilities and its information collection lasts long time. These characteristics make the wireless sensor networks in agriculture face the problem of energy constraint. Efficient routing and sleeping algorithm can save energy. Considering the node residual energy and the collection cycle of the destination nodes, this paper improved a WSN routing and sleeping algorithm based on the AODV routing algorithm. This algorithm establishes routing path based on the node residual energy and the node collection cycle. Node sleeping cycle determined after the routi

APA, Harvard, Vancouver, ISO, and other styles

16

Rodrigues, João, Roberto Lam, and Hans du Buf. "Cortical 3D Face and Object Recognition Using 2D Projections." International Journal of Creative Interfaces and Computer Graphics 3, no. 1 (2012): 45–62. http://dx.doi.org/10.4018/jcicg.2012010104.

Full text

Abstract:

Empirical studies concerning face recognition suggest that faces may be stored in memory by a few canonical representations. In cortical area V1 exist double-opponent colour blobs, also simple, complex and end-stopped cells which provide input for a multiscale line/edge representation, keypoints for dynamic feature routing, and saliency maps for Focus-of-Attention. All these combined allow faces to be segregated. Events of different facial views are stored in memory and combined to identify the view and recognise a face, including its expression. In this paper, the authors show that with five

APA, Harvard, Vancouver, ISO, and other styles

17

Jaiswal, Jyotsana, and Pabitra Mohan Khilar. "FFGPSR: Fault-Tolerant Face-shift Greedy Perimeter Stateless Routing for Ad hoc Network." Procedia Engineering 38 (2012): 3779–88. http://dx.doi.org/10.1016/j.proeng.2012.06.433.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Seada, Karim, Ahmed Helmy, and Ramesh Govindan. "On the effect of location inaccuracy on geographic face routing in wireless networks." ACM SIGMOBILE Mobile Computing and Communications Review 7, no. 4 (2003): 61–63. http://dx.doi.org/10.1145/965732.965746.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Lesovoy, Ivan, and Genadij Pylypenko. "IMITATION MODELING OF THE ROUTING PROCESS BASED ON FUZZY LOGIC." Informatics Control Measurement in Economy and Environment Protection 8, no. 1 (2018): 16–19. http://dx.doi.org/10.5604/01.3001.0010.8545.

Full text

Abstract:

The paper discusses the details of modeling of the routing process according to the loading of output buffer storage. Shows the obtained dependence of the fraction of lost packets from the input intensity. It is shown that taking into account buffer occupancy increases the efficiency of their use and can significantly affect the quality of the functioning of the telecommunications network in the face of considerable.

APA, Harvard, Vancouver, ISO, and other styles

20

Euchi, Jalel, Salah Zidi, and Lamri Laouamer. "A new distributed optimization approach for home healthcare routing and scheduling problem." Decision Science Letters 10, no. 3 (2021): 217–30. http://dx.doi.org/10.5267/j.dsl.2021.4.003.

Full text

Abstract:

Home health care faces new challenges day by day and it has become increasingly legitimate in the face of an aging population. Home healthcare centers are exposed to cumulative demands and academics are paying attention to the routing and scheduling matter, which is offered in literature as a Technician Routing and Scheduling Problem (TRSP) where the aim is to minimize the total cost subject to the time windows constraints to serve the patients respecting their priorities. In this paper, we develop a new distributed algorithm to resolve the home health care routing and scheduling problem (HHRS

APA, Harvard, Vancouver, ISO, and other styles

21

Cho, Eun-Seok, Yongbin Yim, and Sang-Ha Kim. "Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs." Sensors 17, no. 10 (2017): 2402. http://dx.doi.org/10.3390/s17102402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Pacheco, Joaquín, and Manuel Laguna. "Vehicle routing for the urgent delivery of face shields during the COVID-19 pandemic." Journal of Heuristics 26, no. 5 (2020): 619–35. http://dx.doi.org/10.1007/s10732-020-09456-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Sepas-Moghaddam, Alireza, Ali Etemad, Fernando Pereira, and Paulo Lobato Correia. "CapsField: Light Field-Based Face and Expression Recognition in the Wild Using Capsule Routing." IEEE Transactions on Image Processing 30 (2021): 2627–42. http://dx.doi.org/10.1109/tip.2021.3054476.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

AlSawafi, Yahya, Abderezak Touzene, Khaled Day, and Nasser Alzeidi. "Hybrid RPL-based sensing and routing protocol for smart city." International Journal of Pervasive Computing and Communications 16, no. 3 (2020): 279–306. http://dx.doi.org/10.1108/ijpcc-11-2019-0088.

Full text

Abstract:

Purpose Wireless sensor network (WSN) and mobile crowd sensing (MCS) technologies face some challenges, especially when deployed in a large environment such as a smart city environment. WSN faces network latency, packets delivery and limited lifetime due to the nature of the used constrained internet of things small devices and low power network. On the other hand, most of the current applications that adapt MCS technology use 3G or long term evalution network to collect data and send them directly to the server. This leads to higher battery and bandwidth consumption and higher data cost. Desi

APA, Harvard, Vancouver, ISO, and other styles

25

Hasty, J. D., M. M. Pfeifer, L. C. Eastwood, et al. "National Beef Quality Audit-2016: Phase 1, Face-to-face interviews." Translational Animal Science 1, no. 3 (2017): 320–32. http://dx.doi.org/10.2527/tas2017.0039.

Full text

Abstract:

Abstract The National Beef Quality Audit (NBQA) is conducted every 5 yr and was most recently again conducted in 2016. Face-to-face interviews gauged progress in quality associated with live cattle production using procedures first utilized in NBQA 2011. The 2016 NBQA was the first in which interviews concerning fed steers and heifers were combined with an audit of market cow and bull beef. Face-to-face interviews were designed to illicit definitions for beef quality, estimate willingness to pay (WTP) for quality attributes, establish relative importance rankings for important quality factors,

APA, Harvard, Vancouver, ISO, and other styles

26

CHEN, TSENG-YI, HSIN-WEN WEI, CHE-RUNG LEE, FU-NAN HUANG, TASN-SHENG HSU, and WEI-KUAN SHIH. "ENERGY EFFICIENT GEOGRAPHIC ROUTING ALGORITHMS IN WIRELESS SENSOR NETWORK." Journal of Interconnection Networks 14, no. 01 (2013): 1350001. http://dx.doi.org/10.1142/s0219265913500011.

Full text

Abstract:

Over the past decade, energy efficiency has consistently been a critical research topic in the field of wireless sensor networks. In wireless networks, signal interference often leads to power waste in a sensor node. Several SINR-based routing algorithms designed for energy efficiency or interference avoidance had been proposed. However, they are either too complex to be useful in practices or may slow in routing computation speed. In this paper, two energy efficient geographic routing algorithms (EEGRA) for wireless sensor network are proposed to address the power consumption issue while cons

APA, Harvard, Vancouver, ISO, and other styles

27

Zhang, Shu-kai, Guo-you Shi, Zheng-jiang Liu, Zhi-wei Zhao, and Zhao-lin Wu. "Data-driven based automatic maritime routing from massive AIS trajectories in the face of disparity." Ocean Engineering 155 (May 2018): 240–50. http://dx.doi.org/10.1016/j.oceaneng.2018.02.060.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Yuan, Yina, Xiaoguang Zhou, and Mengke Yang. "Emergency logistics vehicle routing optimization based on insufficient supply." E3S Web of Conferences 136 (2019): 04068. http://dx.doi.org/10.1051/e3sconf/201913604068.

Full text

Abstract:

In the face of various emergencies, emergency logistics vehicles are required to meet the needs of the affected areas in a short enough time. However, due to the suddenness of the incident and the shortage of relief supplies, it is necessary to further consider how to optimize the route of emergency vehicles in case of insufficient supply. In this paper, when the supply point is insufficient, the emergency vehicle routing can be optimized in the shortest possible time and at the same time to meet the requirements of the disaster site. By establishing the corresponding mathematical model and us

APA, Harvard, Vancouver, ISO, and other styles

29

Aziz, Layla, and Hanane Aznaoui. "Efficient Routing Approach Using a Collaborative Strategy." Journal of Sensors 2020 (February 25, 2020): 1–17. http://dx.doi.org/10.1155/2020/2547061.

Full text

Abstract:

Wireless sensor networks (WSNs) are a huge number of sensors, which are distributed in area monitoring to collect important signals. WSNs are widely used in several applications such as home automation, environment, and healthcare monitoring. However, most of these applications face various difficulties due to sensor design. Therefore, the major challenge of designing WSNs is saving the energy consumed during communication and extending the network lifetime. Multicriteria Decision Analysis (MCDA) methods have been exploited for saving network energy. However, the majority of researches focus o

APA, Harvard, Vancouver, ISO, and other styles

30

Yao, Haipeng, Chao Fang, Yiru Guo, and Chenglin Zhao. "An Optimal Routing Algorithm in Service Customized 5G Networks." Mobile Information Systems 2016 (2016): 1–7. http://dx.doi.org/10.1155/2016/6146435.

Full text

Abstract:

With the widespread use of Internet, the scale of mobile data traffic grows explosively, which makes 5G networks in cellular networks become a growing concern. Recently, the ideas related to future network, for example, Software Defined Networking (SDN), Content-Centric Networking (CCN), and Big Data, have drawn more and more attention. In this paper, we propose a service-customized 5G network architecture by introducing the ideas of separation between control plane and data plane, in-network caching, and Big Data processing and analysis to resolve the problems traditional cellular radio netwo

APA, Harvard, Vancouver, ISO, and other styles

31

Ghoreyshi, Seyed Mohammad, Alireza Shahrabi, and Tuleen Boutaleb. "A Stateless Opportunistic Routing Protocol for Underwater Sensor Networks." Wireless Communications and Mobile Computing 2018 (November 11, 2018): 1–18. http://dx.doi.org/10.1155/2018/8237351.

Full text

Abstract:

Routing packets in Underwater Sensor Networks (UWSNs) face different challenges, the most notable of which is perhaps how to deal with void communication areas. While this issue is not addressed in some underwater routing protocols, there exist some partially state-full protocols which can guarantee the delivery of packets using excessive communication overhead. However, there is no fully stateless underwater routing protocol, to the best of our knowledge, which can detect and bypass trapped nodes. A trapped node is a node which only leads packets to arrive finally at a void node. In this pape

APA, Harvard, Vancouver, ISO, and other styles

32

Jaafar Abbas, Muthanna, Haider Mohammed Turki Alhilfi, and Tole Sutikno. "Performance evaluation of two models in the reactive routing protocol in manets." Indonesian Journal of Electrical Engineering and Computer Science 21, no. 1 (2021): 391. http://dx.doi.org/10.11591/ijeecs.v21.i1.pp391-397.

Full text

Abstract:

<span>Due to the need for the multicast connection required by multimedia applications such as video conferencing and natural disaster management, it was necessary to use a set of portable and connected wireless peripheral devices without the need for infrastructure and without a central router, by use wireless network as "a mobile ad hoc network (MANET) " Despite the difficulties facing this technology in the process of effective guidance and the expansion of the use of such networks, in this type of network because of its applications in the fields of civil and military systems that do

APA, Harvard, Vancouver, ISO, and other styles

33

Amdouni, Ichrak, Cedric Adjih, Nadjib AitSaadi, and Paul Muhlethaler. "Extensive Experimentations on Opportunistic Routing in Wireless Sensor Networks." Sensors 18, no. 9 (2018): 3031. http://dx.doi.org/10.3390/s18093031.

Full text

Abstract:

In this paper, we design and experiment ODYSSE (Opportunistic Duty cYcle based routing protocol for wirelesS Sensor nEtworks) protocol. It combines three main mechanisms: (i) duty cycle, where nodes alternate between active and sleep states, (ii) opportunistic routing where routing tables do not exist and the next hop is elected once the packet arrives, and (iii) source coding with LDPC (Low-Density Parity-Check) codes in order to face packet losses while minimizing energy consumption. We focus on two heterogeneous scenarios: bulk image transmission and infrequent events reporting. Modeling th

APA, Harvard, Vancouver, ISO, and other styles

34

Al-Ani, Aymen Dawood, and Jochen Seitz. "QoS-aware Routing in Multi-rate Ad hoc Networks Based on Ant Colony Optimization." Network Protocols and Algorithms 7, no. 4 (2016): 1. http://dx.doi.org/10.5296/npa.v7i4.8513.

Full text

Abstract:

QoS-aware routing in mobile ad hoc networks (MANETs) is a major challenge due to node mobility and scarcity of resources. QoS-aware routing based on ant colony optimization (ACO) algorithms is a promising approach to overcome these problems. However, as compared to MANETs, vehicular ad hoc networks (VANETs) face additional challenges due to rapid topology change, making the estimation or prediction of QoS parameters difficult or stale. VANETs require time-critical message delivery, as late delivery may result in endangering lives. Currently existing routing protocols usually require the exchan

APA, Harvard, Vancouver, ISO, and other styles

35

Liu, Jun, Meiming Yu, Xingwang Wang, Yuanyuan Liu, Xiaohui Wei, and Junhong Cui. "RECRP: An Underwater Reliable Energy-Efficient Cross-Layer Routing Protocol." Sensors 18, no. 12 (2018): 4148. http://dx.doi.org/10.3390/s18124148.

Full text

Abstract:

A reliable energy-efficient routing protocol plays a key role in underwater data transmission. In the face of acoustic communication challenges in underwater wireless sensor networks (UWSNs), including long propagation delay, topology change, limited energy, and communication voids, we propose RECRP, a Reliable Energy-efficient Cross-layer Routing Protocol to achieve high data delivery rate. RECRP is a location-free single-copy protocol. The information of the physical layer such as Doppler scale shift measurement, Received Signal Strength Indication (RSSI), etc. are adopted to estimate the di

APA, Harvard, Vancouver, ISO, and other styles

36

Veichtlbauer, Armin, Alexander Heinisch, Ferdinand von von Tüllenburg, Peter Dorfinger, Oliver Langthaler, and Ulrich Pache. "Smart Grid Virtualisation for Grid-Based Routing." Electronics 9, no. 11 (2020): 1879. http://dx.doi.org/10.3390/electronics9111879.

Full text

Abstract:

Due to changed power consumption patterns, technological advance and deregulation, the appearance of the power grid in the low and medium voltage segment has changed. The spread of heating and cooling with electrical energy and an increase of electric vehicles as well as the broad rollout of photovoltaic systems has a major impact on the peak power demand of modern households and the volatility smart grids have to face. Thus, besides the load impact of the growing population of electric vehicles, modern households are not only consumers of electrical power, but also power producers, so called

APA, Harvard, Vancouver, ISO, and other styles

37

Ripp, Evgeny Germanovich, A. R. Fattakhov, T. M. Ripp, R. A. Postanogov, N. M. Iminov, and E. V. Parmon. "Infectious safety during primary specialized accreditation in the COVID-19 pandemic." Virtual Technologies in Medicine, no. 1 (April 22, 2021): 14–20. http://dx.doi.org/10.46594/2687-0037_2021_1_1288.

Full text

Abstract:

This article is devoted to the organization of the work of the Accreditation and Simulation Center of the Institute of Medical Education of the Almazov National Medical Research Centre during the primary specialized accreditation in the COVID-19 pandemic. Organizational solutions, technological processes and routing of accredited (308 people), support and technical personnel (98 people) and employees of the Accreditation and Simulation Center (14 people) and members of accreditation commissions (67 people) are presented to ensure infectious safety and the effectiveness of the face-to-face prac

APA, Harvard, Vancouver, ISO, and other styles

38

Jahanbakhsh Gudakahriz, S., S. Jamali, M. Vajed Khiavi та A. Soleimany. "A Stable TORA Based for Routing in Mobile Ad Ηoc Networks". Engineering, Technology & Applied Science Research 8, № 1 (2018): 2532–36. http://dx.doi.org/10.48084/etasr.1720.

Full text

Abstract:

A mobile ad hoc network (MANET) is defined as a set of mobile nodes which communicate through wireless links with no central infrastructure. In these networks nodes are always moving and could enter to or exit from the network at any time. Therefore, network topology is completely dynamic. Another characteristic of these networks is the low node energy level, resulting from inherent node limitations. Stable routing is one method to face routing challenges in mobile ad hoc networks. The objective of this study is to stabilize TORA protocol which is a distributed routing protocol, with high adap

APA, Harvard, Vancouver, ISO, and other styles

39

GEORGIOU, CHRYSSIS, THEOPHANIS PAVLIDES, and ANNA PHILIPPOU. "SELFISH ROUTING IN THE PRESENCE OF NETWORK UNCERTAINTY." Parallel Processing Letters 19, no. 01 (2009): 141–57. http://dx.doi.org/10.1142/s0129626409000122.

Full text

Abstract:

We study the problem of selfish routing in the presence of incomplete network information. Our model consists of a number of users who wish to route their traffic on a network of m parallel links with the objective of minimizing their latency. However, in doing so, they face the challenge of lack of precise information on the capacity of the network links. This uncertainty is modeled via a set of probability distributions over all the possibilities, one for each user. The resulting model is an amalgamation of the KP-model of [14] and the congestion games with user-specific functions of [22]. W

APA, Harvard, Vancouver, ISO, and other styles

40

Hui, Wen, Hai Ying Zhao, Chuang Lin, and Yang Yang. "Network Coordinates-Based Request Routing Approach to Improve Multimedia Content Delivery." Applied Mechanics and Materials 182-183 (June 2012): 888–92. http://dx.doi.org/10.4028/www.scientific.net/amm.182-183.888.

Full text

Abstract:

In order to solve the problem of large-scale multimedia content delivery, we present Multimedia Content Delivery Network (MM-CDN). For providing multimedia services with high quality in MM-CDN, the traditional request routing approaches in CDN face two key challenges, namely performance and cost. To balance the tradeoff between performance and cost in MM-CDN, we propose an improved request routing approach. First, based on the idea of network coordinates, the computation and transfer costs of different server clusters are computed depending on the network and server status change. Then, all th

APA, Harvard, Vancouver, ISO, and other styles

41

Ramírez Gómez, Julián, Héctor Fernando Vargas Montoya, and Álvaro León Henao. "Implementing a Wormhole Attack on Wireless Sensor Networks with XBee S2C Devices." Revista Colombiana de Computación 20, no. 1 (2019): 41–58. http://dx.doi.org/10.29375/25392115.3606.

Full text

Abstract:

One of the most dangerous threats to Wireless Sensor Networks (WSN) are wormhole attacks, due to their capacity to manipulate routing and application data in real time and cause important damages to the integrity, availability, and confidentiality of network data. An empirical method to launch a successful attack on IEEE 802.15.4/Zigbee devices with source routing enabled is adopted in this work to find signatures for detecting wormhole attacks in real environments. It uses the KillerBee framework with algorithms for packet manipulation through a malicious node to capture and inject malicious

APA, Harvard, Vancouver, ISO, and other styles

42

Liu, Kanghuai, Zhigang Chen, Jia Wu, and Leilei Wang. "FCNS: A Fuzzy Routing-Forwarding Algorithm Exploiting Comprehensive Node Similarity in Opportunistic Social Networks." Symmetry 10, no. 8 (2018): 338. http://dx.doi.org/10.3390/sym10080338.

Full text

Abstract:

At the dawn of big data and 5G networks, end-to-end communication with large amounts of data between mobile devices is difficult to be implemented through the traditional face-to-face transmission mechanism in social networks. Consequently, opportunistic social networks proposed that message applications should choose proper relay nodes to perform effective data transmission processes. At present, several routing algorithms, based on node similarity, attempt to use the contextual information related to nodes and the special relationships between them to select a suitable relay node among neigh

APA, Harvard, Vancouver, ISO, and other styles

43

Khani, Hadi, and Hamed Khanmirza. "Randomized routing of virtual machines in IaaS data centers." PeerJ Computer Science 5 (September 2, 2019): e211. http://dx.doi.org/10.7717/peerj-cs.211.

Full text

Abstract:

Cloud computing technology has been a game changer in recent years. Cloud computing providers promise cost-effective and on-demand resource computing for their users. Cloud computing providers are running the workloads of users as virtual machines (VMs) in a large-scale data center consisting a few thousands physical servers. Cloud data centers face highly dynamic workloads varying over time and many short tasks that demand quick resource management decisions. These data centers are large scale and the behavior of workload is unpredictable. The incoming VM must be assigned onto the proper phys

APA, Harvard, Vancouver, ISO, and other styles

44

Saeed, Shakeel R., and Richard T. Ramsden. "Rehabilitation of the paralysed face: results of facial nerve surgery." Journal of Laryngology & Otology 110, no. 10 (1996): 922–25. http://dx.doi.org/10.1017/s0022215100135364.

Full text

Abstract:

AbstractThe case notes of 34 patients undergoing rehabilitative facial nerve surgery between 1978 and 1994 were retrospectively examined. Thirteen patients underwent facio-hypoglossal transposition with six achieving a facial nerve grade of IV (House-Brackmann scale) at 24 months post-surgery. Twelve patients underwent cable grafting of the facial nerve defect. Of these, 10 achieved a grade III result at 24 months. Nine patients underwent end to end anastomosis of the facial nerve, seven achieving a grade III result at 24 months after the repair. Re-routing of the facial nerve and the use of t

APA, Harvard, Vancouver, ISO, and other styles

45

Phate, Neelam, and M. A. Rizvi. "CHALLENGES, CLASSIFICATION AND COMPARATIVE STUDY OF QOS SOLUTIONS IN MANET." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 13, no. 6 (2014): 4530–36. http://dx.doi.org/10.24297/ijct.v13i6.2514.

Full text

Abstract:

A mobile ad-hoc network (MANET) is composed of mobile nodes without any fixed infrastructure. Mobile nodes are communicating with each other over radio links. The large amount of real-time traffic involves high bandwidth and liable to congestion. Routing in MANET is a challenging task due to high mobility of nodes in a network. Quality of Service (QoS) is an important consideration in MANET. It is more difficult to guarantee QoS in MANETs than in other type of networks. To establish the routes and to secure the resources necessary to provide the QoS requires collaboration among the nodes. Ther

APA, Harvard, Vancouver, ISO, and other styles

46

Shamsaldin, Ahmed S., Tarik A. Rashid, Rawan A. Al-Rashid Agha, Nawzad K. Al-Salihi, and Mokhtar Mohammadi. "Donkey and smuggler optimization algorithm: A collaborative working approach to path finding." Journal of Computational Design and Engineering 6, no. 4 (2019): 562–83. http://dx.doi.org/10.1016/j.jcde.2019.04.004.

Full text

Abstract:

AbstractSwarm Intelligence is a metaheuristic optimization approach that has become very predominant over the last few decades. These algorithms are inspired by animals' physical behaviors and their evolutionary perceptions. The simplicity of these algorithms allows researchers to simulate different natural phenomena to solve various real-world problems. This paper suggests a novel algorithm called Donkey and Smuggler Optimization Algorithm (DSO). The DSO is inspired by the searching behavior of donkeys. The algorithm imitates transportation behavior such as searching and selecting routes for

APA, Harvard, Vancouver, ISO, and other styles

47

Iqbal, Semab, Israr Hussain, Zubair Sharif, Kamran Hassan Qureshi, and Javeria Jabeen. "Reliable and Energy-Efficient Routing Scheme for Underwater Wireless Sensor Networks (UWSNs)." International Journal of Cloud Applications and Computing 11, no. 4 (2021): 42–58. http://dx.doi.org/10.4018/ijcac.2021100103.

Full text

Abstract:

Despite the fact that the ocean plays a role in everything from the air we breathe to daily weather and climate patterns, we know very little about our ocean. Underwater wireless sensor network (UWSN) is one of the options helping us to discover some domains such as natural assets and underwater resource exploration. However, the acoustic signal is the only suitable option in underwater communication in the absence of radio waves, which face a number of challenges under this environment. To overcome these issues, many routing schemes are introduced by researchers though energy consumption is s

APA, Harvard, Vancouver, ISO, and other styles

48

Shafique, Ayesha, Guo Cao, Muhammad Aslam, Muhammad Asad, and Dengpan Ye. "Application-Aware SDN-Based Iterative Reconfigurable Routing Protocol for Internet of Things (IoT)." Sensors 20, no. 12 (2020): 3521. http://dx.doi.org/10.3390/s20123521.

Full text

Abstract:

The central intelligence offered by Software Defined Networking (SDN) promise the smart and reliable reconfiguration which enables the scalability of dynamic enterprise networks. The decoupled forwarding plane and control plane of SDN infrastructure is a key feature that supports the SDN controller to extract the physical network topology information at runtime to formulate network reconfigurations. This SDN-based network reconfiguration enables application-aware routing capability for Internet of Thing (IoT). However, these IoT enabled SDN-based routing protocols face some performance limitat

APA, Harvard, Vancouver, ISO, and other styles

49

Hoogeboom, Maaike, Yossiri Adulyasak, Wout Dullaert, and Patrick Jaillet. "The Robust Vehicle Routing Problem with Time Window Assignments." Transportation Science 55, no. 2 (2021): 395–413. http://dx.doi.org/10.1287/trsc.2020.1013.

Full text

Abstract:

In practice, there are several applications in which logistics service providers determine the service time windows at the customers, for example, in parcel delivery, retail, and repair services. These companies face uncertain travel times and service times that have to be taken into account when determining the time windows and routes prior to departure. The objective of the proposed robust vehicle routing problem with time window assignments (RVRP-TWA) is to simultaneously determine routes and time window assignments such that the expected travel time and the risk of violating the time windo

APA, Harvard, Vancouver, ISO, and other styles

50

Faheem, Butt, Raza, et al. "A Multiobjective, Lion Mating Optimization Inspired Routing Protocol for Wireless Body Area Sensor Network Based Healthcare Applications." Sensors 19, no. 23 (2019): 5072. http://dx.doi.org/10.3390/s19235072.

Full text

Abstract:

The importance of body area sensor networks (BASNs) is increasing day by day because of their increasing use in Internet of things (IoT)-enabled healthcare application services. They help humans in improving their quality of life by continuously monitoring various vital signs through biosensors strategically placed on the human body. However, BASNs face serious challenges, in terms of the short life span of their batteries and unreliable data transmission, because of the highly unstable and unpredictable channel conditions of tiny biosensors located on the human body. These factors may result

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!