Search results

An Improved Rank Criterion-based NLOS node Detection Mechanism (IRC-NLOS-DM) is proposed based on the benefits of a reputation model for effective localization of NLOS nodes during the dynamic exchange of emergency messages in critical situations.

This proposed IRC-NLOS-DM scheme derives the benefits of a reputation model that influentially localizes the NLOS nodes under dynamic exchange of emergency messages. This proposed IRC-NLOS-DM scheme is an attempt to resolve the issues with the routing protocols that aids in warning message delivery of vehicles that are facing NLOS situations with the influence of channel contention and broadcast storm. It is developed for increasing the warning packet delivery rate with minimized overhead, delay and channel utilization.

The simulation results of the proposed IRC-NLOS-DM scheme confirmed the excellence of the proposed IRC-NLOS-DM over the existing works investigated based on the channel utilization rate, neighborhood prediction rate and emergency message forwarding rate.

It is proposed for reliable warning message delivery in Vehicular Ad hoc Networks (VANETs) which is referred as the specialized category of mobile ad hoc network application that influences Intelligent Transportation Systems (ITS) and wireless communications. It is proposed for implementing vehicle safety applications for constructing a least cluttered and a secure environment on the road.

It is contributed as a significant mechanism for facilitating reliable dissemination of emergency messages between the vehicular nodes, which is essential in the critical environment to facilitate a risk-free environment. It also aids in creating a reliable environment for accurate localization of Non-Line of Sight (NLOS) nodes that intentionally introduces the issues of broadcasting storm and channel congestion during the process of emergency message exchanges.

The purpose of this paper is to find a practical method to minimize unnecessary rebroadcasts for ad hoc networks in a remote area.

The authors design a theoretical coverage estimation model for autonomous broadcast pruning. To verify the effect of the model, simulations are performed to evaluate the effect of confidence level and the actual performance by using ns2 network simulator.

The algorithm used to predict the coverage area of broadcasts can minimize unnecessary rebroadcasts.

Autonomous broadcast pruning scheme based on the local prediction of a remained coverage area in the on‐going broadcast process brings us beneficial results in terms of energy savings and limited bandwidth preservation.

This paper aims to introduce vehicular network platform, routing and broadcasting methods and vehicular positioning enhancement technology, which are three aspects of the applications of intelligent computing in vehicular networks. From this paper, the role of intelligent algorithm in the field of transportation and the vehicular networks can be understood.

In this paper, the authors introduce three different methods in three layers of vehicle networking, which are data cleaning based on machine learning, routing algorithm based on epidemic model and cooperative localization algorithm based on the connect vehicles.

In Section 2, a novel classification-based framework is proposed to efficiently assess the data quality and screen out the abnormal vehicles in database. In Section 3, the authors can find when traffic conditions varied from free flow to congestion, the number of message copies increased dramatically and the reachability also improved. The error of vehicle positioning is reduced by 35.39% based on the CV-IMM-EKF in Section 4. Finally, it can be concluded that the intelligent computing in the vehicle network system is effective, and it will improve the development of the car networking system.

This paper reviews the research of intelligent algorithms in three related areas of vehicle networking. In the field of vehicle networking, these research results are conducive to promoting data processing and algorithm optimization, and it may lay the foundation for the new methods.

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.

Wireless mesh networks (WMNs) are regarded as a milestone in developing next‐generation wireless networks. The multi‐hop architecture of WMN makes it very attractive. However, interoperability is an inherent problem for deploying a large‐scale WMN, which may consist of various types of wireless networks. There are two intuitive approaches to solving the interoperability problem: the dual‐stack/multi‐stack approach and the naive layer‐2 broadcast approach. While the former incurs high cost in all devices, the latter creates broadcast storm in the whole network. This paper aims to propose a cross‐layer heterogeneous routing protocol for solving this problem without the adverse effects of the intuitive approaches.

A conceptual discussion and approach are employed.

The simulation results validate the efficiency of the proposed protocol.

The paper provides details of a method for routing selection in WMNs.

Many clustering protocols for mobile ad hoc networks (MANETs) have been proposed in the literature. With only one exception so far (1), all these protocols are proactive, thus wasting bandwidth when their function is not currently needed. To reduce the signalling traffic load, reactive clustering may be employed.We have developed a clustering protocol named “On‐Demand Group Mobility‐Based Clustering” (ODGMBC) (2), (3) which is reactive. Its goal is to build clusters as a basis for address autoconfiguration and hierarchical routing. In contrast to the protocol described in ref. (1), the design process especially addresses the notions of group mobility and of multi‐hop clusters in a MANET. As a result, ODGMBC maps varying physical node groups onto logical clusters. In this paper, ODGMBC is described. It was implemented for the ad hoc network simulator GloMoSim (4) and evaluated using several performance indicators. Simulation results are promising and show that ODGMBC leads to stable clusters. This stability is advantageous for autoconfiguration and routing mechansims to be employed in conjunction with the clustering algorithm.

The purpose of this paper is to explore grid‐based routing in wireless sensor networks and to compare the energy available in the network over time for different grid sizes.

The test area is divided into square‐shaped grids of certain length. Energized nodes are placed randomly in the terrain area with the sink node in a fixed position. One node per grid is elected as the leader node based on the highest energy level and the proximity to the centre of the grid. The sink node floods the network to identify a path from sink to source. The path from the sink to the source through the leader nodes are computed using three different methods: shortest path; leader nodes which have the highest energy; and leader nodes based on their received signal strength (RSS) indicator values. After the path is computed, transmission of data is continued until the leader nodes run out of energy. New leader nodes are then elected using the same mechanism to replace the depleted ones.

Identified the optimal grid size to minimize the energy consumption in sensor networks and to extend the network lifetime. Also proposed is a new routing protocol which identifies routes based on energy threshold and RSS threshold.

The use of RSS threshold is identified to be the good metric for path selection in routing the data between source and the sink.

Simulator software and the protocol developed can be used for in optimizing energy efficiency in sensor networks.

This work contributes to the discussion on uniform and non‐uniform grid sizes and emphasizes a new method for reducing the energy consumption by identifying an optimum grid size. It also utilizes bursty data for simulation.

This case of a Weyerhaeuser business unit’s use of the military’s methodologies provides an example for businesses that are faced with a daunting challenge to develop and execute strategies in a complex, rapidly changing business environment, when timely implementation is an important key to success. The goal of the industrial segment of Weyerhaeuser Building Materials (WBM) division was to accelerate innovation and growth in a stagnant market after two previous, unsuccessful attempts. The complexity of the task was large: 70 geographically dispersed locations and decision makers, new matrix organization, and a multi‐market environment in 12 regions. The industrial segment of WBM developed a revenue‐growth initiative and accelerated its execution by applying the fast‐cycle methodology of Desert Storm strategists in the 1991 military air campaign. The new strategy completely repositioned the business.

The purpose of this paper is to introduce a new data dissemination model in order to improve the performance of transmission in VANET. It proposes a protocol named Epidemic and Transmission-Segment-based Geographic Routing (ETSGR) and outlining the issues due to high mobility of nodes and uncertain physical topologies in the network. The proposed ETSGR is mainly used to analyze the vehicle state, direction, distance, traffic density and link quality of the network.

This research work based on ETSGR protocol mainly uses epidemic algorithm in order to find the vehicle state based on susceptible, infected and recovered (SIR) model. Furthermore, the vehicle position and finding the head node in the network is utilized using the transmission segment protocol based on geographic routing and analyses each node to form the segments and find the destination to transmit the data in timely manner.

The paper provides the enhancement of the performance based on some metrics such as end-to-end delay that obtained 0.62%, data throughput as 32.3%, packet delivery ratio as 67% and one-hop communication as 13%. The proposed ETSGR protocol analyzes the state of the vehicle correctly and each node segmented to transmit the data with the timely manner and obtaining reliable performance even with high mobility of nodes in the network.

The proposed ETSGR protocol may have some limitation when considering the timing which should improve even in increasing many number of vehicles and different road segments.

This paper includes some suggestions for the practical deployment of the approach in which a real-time traffic analysis can be evaluated for taking prior actions during an emergency situation and proper dissemination of data in timely manner can help utilize the guidance of proper planning of roads.

This research fulfills an enhanced protocol to improve the performance of data dissemination.

The purpose of this paper is to focus on the large-scale flood response coordination across sectors and jurisdictions, investigating the characteristics and gaps of the 2011 Thailand flood response operations.

The large-scale flood response coordination was measured as an inter-organizational network. An extensive content analysis of news reports was conducted to identify the participating organizations and relationships among them that emerged during the initial flood response operations. Social network analysis was used to examine the patterns and gaps of coordination among the organizations.

The research identified three major gaps that might weaken the response coordination. First, the coordination structure was highly fragmented with many isolated actors. Second, the benefit of inter-sector relationships was not well leveraged in the system due to weak reciprocal relationships across sectors. Third, provincial level organizations did not serve as a strong liaison between local actors (cities) and national actors.

Based on the findings, the research offers suggestions to improve the performance of response coordination in recurring flood disasters.

This study is distinctive in its examination of structural characteristics of large-scale, inter-sector and multi-jurisdictional flood response coordination in Thailand. Previous studies have explored how citizens were organized and responded to flood disasters at the local level, and measured indicators or causes of response resilience at the provincial level system. Yet, studies examining the patterns of coordination structure among response organizations across all affected-jurisdictional authorities and sectors have been lacking.