Search results

This paper is a review of a number routing protocols in the internet of vehicles (IoV). IoV emphasizes information interaction among humans, vehicles and a roadside unit (RSU), within which routing is one of the most important steps in IoV network.

In this paper, the authors have summarized different research data on routing protocols in the IoV. Several routing protocols for IoV have been proposed in the literature. Their classification is made according to some criteria such as topology-based, position-based, transmission strategy and network structure. This paper focuses on the transmission strategy criteria. There exist three types of protocols that are based on this strategy: unicast protocol, broadcast protocols and multicast protocols. This later type is classified into two subclasses: geocast and cluster-based protocols. The taxonomy of the transmission strategy is presented in this study. We discuss the advantages and disadvantages of each type with a general comparison between the five types.

The authors can deduce that many challenges are encountered when designing routing protocols for IoV.

A simple and well-explained presentation of the functioning of the IoV is provided with a comparison among each categories of protocols is well presented along with the advantages and disadvantages of each type. The authors examined the main problems encountered during the design of IoV routing protocol, such as the quick change of topology, the frequent disconnection, the big volume of data to be processed and stored in the IoV, and the problem of network fragmentation. This work explores, compares existing routing protocols in IoV and provides a critical analysis. For that, the authors extract the challenges and propose future perspectives for each categories of protocols.

A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many routing schemes proposed in the literature try to minimize the energy consumed in routing or maximize the lifetime of the sensor network without taking into consideration limited capacities of nodes and wireless links. This can lead to congestion, increased delay, packet losses and ultimately to retransmission of packets, which will waste considerable amount of energy. This paper presents a Minimum‐cost Capacity‐constrained Routing (MCCR) protocol which minimize the total energy consumed in routing while guaranteeing that the total load on each sensor node and on each wireless link does not exceed its capacity. The protocol is derived from polynomial‐time minimum‐cost flow algorithms. Therefore protocol is simple and scalable. The paper improves the routing protocol in (1) to incorporate integrality, node capacity and link capacity constraints. This improved protocol is called Maximum Lifetime Capacity‐constrained Routing (MLCR). The objective of MLCR protocol is to maximize the time until the first battery drains its energy subject to the node capacity and link capacity constraints. A strongly polynomial time algorithm is proposed for a special case of MLCR problem when the energy consumed in transmission by a sensor node is constant. Simulations are performed to analyzed the performance of the proposed protocols.

The paper is an excerpt from a more comprehensive study by the Florida Department of Environmental Protection comparing the technical elements of offset projects in forestry, agriculture, and waste management, as well as some miscellaneous project types. The authors compare and contrast design elements of three specific offset projects: afforestation/reforestation, manure management, and landfill gas capture. The technical review for each offset project is concluded with a look at the potential applicability for that project in Florida in the context of the protocols evaluated.

Offset projects that may be employed in Florida are first broken up into comparable design elements specific to the selected offset project type. Focusing on the design elements, a discussion of the similarities and differences among the protocols for each offset project is presented. Each section begins with general findings then moves on to assessments of the detailed design elements. Finally, the project's general applicability to Florida is considered, highlighting specific strengths of particular protocols from the analysis of the design elements.

Protocols tend to vary from highly specific requirements to a more general set of recommendations. Interestingly, no one program's set of protocols is the most opportunistic for Florida, but rather various protocols may have distinctive strengths depending on the project type.

Many comparative studies of offset protocols evaluate protocols in the context of program‐level policies. This study uniquely values the technical details in the protocols and does not consider policy or program‐level issues.

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.

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.

A new routing algorithm for MANETs which performs better than some of the existing algorithms.

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.

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.

To the authors’ knowledge, no other paper has combined the greedy and backtracking approach to design a routing protocols for MANETs.

The purpose of this paper is to review an evidence-based tool for training child forensic interviewers called the National Institute of Child Health and Human Development Protocol (NICHD Protocol), with a specific focus on how the Protocol is being adapted in various countries.

The authors include international contributions from experienced trainers, practitioners, and scientists, who are already using the Protocol or whose national or regional procedures have been directly influenced by the NICHD Protocol research (Canada, Finland, Israel, Japan, Korea, Norway, Portugal, Scotland, and USA). Throughout the review, these experts comment on: how and when the Protocol was adopted in their country; who uses it; training procedures; challenges to implementation and translation; and other pertinent aspects. The authors aim to further promote good interviewing practice by sharing the experiences of these international experts.

The NICHD Protocol can be easily incorporated into existing training programs worldwide and is available for free. It was originally developed in English and Hebrew and is available in several other languages.

This paper reviews an evidence-based tool for training child forensic interviewers called the NICHD Protocol. It has been extensively studied and reviewed over the past 20 years. This paper is unique in that it brings together practitioners who are actually responsible for training forensic interviewers and conducting forensic interviews from all around the world.

In this study, we discuss three DTN routing protocols, these are epidemic, PRoPHET and spray and wait routing protocols. A special simulator will be used; that is opportunistic network environment (ONE) to create a network environment. Spray and wait has highest delivery rate and low latency in most of the cases. Hence, spray and wait have better performance than others. This analysis of the performance of DTN protocols helps the researcher to learn better of these protocols in the different environment.

Delay-Tolerant Network (DTN) is a network designed to operate effectively over extreme distances, such as those encountered in space communications or on an interplanetary scale. In such an environment, nodes are occasional communication and are available among hubs, and determinations of the next node communications are not confirmed. In such network environment, the packet can be transferred by searching current efficient route available for a particular node. Due to the uncertainty of packet transfer route, DTN is affected by a variety of factors such as packet size, communication cost, node activity, etc.

Spray and wait have highest delivery rate and low latency in most of the cases. Hence, spray and wait have better performance than others.

The primary goal of the paper is to extend these works in an attempt to offer a better understanding of the behavior of different DTN routing protocols with delivery probability, latency and overhead ratio that depend on various amounts of network parameters such as buffer size, number of nodes, movement ratio, time to live, movement range, transmission range and message generation rate. In this study, we discuss three DTN routing protocols: these are epidemic, PRoPHET and spray and wait routing protocols. A special simulator will be used; that is opportunistic network environment (ONE) to create a network environment. Spray and wait have highest delivery rate and low latency in most of the cases. Hence, spray and wait have better performance than others. This analysis of the performance of DTN protocols helps the researcher to learn better of these protocols in the different environment.

The Linked Systems project (LSP) is directed towards implementing computer‐to‐computer communications among its participants. The original three participants are the Library of Congress (LC), the Research Libraries Group (RLG), and the Western Library Network (WLN, formerly the Washington Library Network). The project now has a fourth participant, the Online Computer Library Center (OCLC). LSP consists of two major components. The first component, Authorities Implementation, is described in Library Hi Tech issue 10 (page 61). The second component, the Standard Network Interconnection (SNI), is the specification of the LSP protocols, and the implementation of these protocols on the participant systems. Protocol specification was a joint effort of the original three participants (LC, RLG, and WLN) and was described in Library Hi Tech issue 10 (page 71). Implementation, however, has consisted of individual efforts of the (now) four participants. This four‐part report focuses on these individual implementation efforts.

With the rapid growth of wireless sensor networks (WSNs), they have become an integral and substantial part of people's life. As such WSN stands as an assuring outlook, but because of sensor's resource limitations and other prerequisites, optimal dual route discovery becomes an issue of concern. WSN along with central sink node is capable of handling wireless transmission, thus optimizing the network's lifetime by selecting the dual path. The major problem confronted in the application of security mechanisms in WSNs is resolving the issues amid reducing consumption of resources and increases security.

According to the proposed system, two metrics, namely, path length and packets delivery ratio are incorporated for identifying dual routes amid the source and destination. Thereafter by making use of the distance metric, the optimal dual route is chosen and data transmission is carried out amid the nodes. With the usage of the recommended routing protocol high packet delivery ratio is achieved with reduced routing overhead and low average end to end delay. It is clearly portrayed in the simulation output that the proposed on demand dual path routing protocol surpasses the prevailing routing protocol. Moreover, security is achieved make use of in accord the data compression reduces the size of the data. With the help of dual path, mathematical model of Finite Automata Theory is derived to transmit data from source to destination. Finite Automata Theory comprises Deterministic Finite Automata (DFA) that is being utilized for Dual Path Selection. In addition, data transition functions are defined for each input stage. In this proposed work, another mathematical model is 10; introduced to efficiently choose an alternate path between a receiver and transmitter for data transfer with qualified node as relay node using RR Algorithm. It also includes Dynamic Mathematical Model for Node Localization to improve the precision in location estimation using Node Localization Algorithm. As a result a simulator is built and various scenarios are elaborated for comparing the performance of the recommended dual path routing protocol with respect to the prevailing ones.

Reliability and fault-tolerance: The actual motive in utilizing the approach of multipath routing in sensor network was to offer path resilience in case of a node or link failures thus ascertaining reliable transmission of data. Usually in a fault tolerant domain, when the sensor node is unable to forward the data packets to the sink, alternative paths can be utilized for recovering its data packets during the failure of any link/node. Load balancing: Load balancing involves equalizing energy consumption of all the existing nodes, thereby degrading them together. Load balancing via clustering improves network scalability. The network's lifetime as well as reliability can be extended if varied energy level's nodes exist in sensor node. Quality of service (QoS): Improvement backing of quality of service with respect to the data delivery ratio, network throughput and end-to-end latency stands very significant in building multipath routing protocols for various network types. Reduced delay: There is a reduced delay in multipath routing since the backup routes are determined at the time of route discovery. Bandwidth aggregation: By dividing the data toward the same destination into multiple streams (by routing all to a separate path) can aggregate the effective bandwidth. The benefit being that, in case a node possesses many links with low bandwidth, it can acquire a bandwidth which is more compared to the individual link.

Few more new algorithms can be used to compare the QoS parameters.

Proposed mechanism with feedback ascertains improvised delivery ratio compared to the single path protocol since in case of link failure, the protocol has alternative route. In case there are 50 nodes in the network, the detection mechanism yields packet delivery of 95% and in case there are 100 nodes, the packet delivery is lowered to 89%. It is observed that the packet rate in the network is more for small node range. When the node count is 200, the packet ratio is low, which is lowered to 85%. With a node count of 400, the curve depicts the value of 87%. Hence, even with a decrease in value, it is superior than the existing protocols. The average end-to-end delay represents the transmission delay of the data packets that have been successfully delivered as depicted in Figure 6 and Table 3. The recommended system presents the queue as well as the propagation delay from the source to destination. The figure depicts that when compared to the single path protocol, the end-to-end delay can be reduced via route switching. End-to-end delay signifies the time acquired for the delay in the receival of the the retransmitted packet by each node. The comparison reveals that the delay was lower compared to the existing ones in the WSN. Proposed protocol aids in reducing consumption of energy in transmitter, receiver and various sensors. Comparative analysis of energy consumptions of the sensor in regard to the recommended system must exhibit reduced energy than the prevailing systems.

On demand dual path routing protocol. Hence it is verified that the on demand routing protocol comprises DFA algorithms determines dual path. Here mathematical model for routing between two nodes with relay node is derived using RR algorithm to determine alternate path and thus reduce energy consumption. Another dynamic mathematical model for node localization is derived using localization algorithm. For transmitting data with a secure and promising QoS in the WSNs, the routing optimization technique has been introduced. The simulation software environment follows the DFA. The simulation yields in improvised performance with respect to packet delivery ratio, throughput, average end-to-end delay and routing overhead. So, it is proved that the DFA possesses the capability of optimizing the routing algorithms which facilitates the multimedia applications over WSNs.

This paper proposes and tests, through a series of structured multi-disciplinary design activities, a “Concept Design Stages Protocol” (CDS Protocol) to structure project initiation, to attain smoother collaboration and greater consensus among multi-disciplinary project teams.

A collaborative approach from the outset is imperative for project success, especially when considering multi-disciplinary teams in the architecture, engineering and construction (AEC) industry. However, involving different disciplines hinders communication paths and affects informed decision-making.

Based on these findings, the research demonstrates that the CDS Protocol provides a solid foundation to aid in the optimal implementation of collaborative design, and with particular regard to multi-disciplinary working.

The research demonstrates the potential for significant improvement in the optimisation of the conceptual design stages, with positive implications for time, communication and whole-team engagement.

Over the past eight years, the MELVYL catalog has become one of the largest public access catalogs in the world, and now plays a central role in providing access to the library resources of the University of California. Currently, under heavy load, the MELVYL catalog supports many hundreds of simultaneous terminal connections, servicing over a quarter of a million queries a week and displaying more than two million records a week to its user community. This article discusses the history of the network that has supported the MELVYL catalog from the early days of its prototype to the present. It also describes both the current technical and policy issues that must be addressed as the network moves into the 1990s, and the roles that the network is coming to play in integrating local automation, the union catalog, access to resource databases, and other initiatives. Sidebars discuss the TCP/IP protocol suite, internet protocol gateways, and Telenet and related inter‐operability problems.