DEBH: detecting and eliminating black holes in mobile ad hoc network

Security in mobile ad hoc network (MANET) is one of the key challenges due to its special features e.g. hop-by-hop communications, dynamic topology, and open network boundary that received tremendous attention by scholars. Traditional security methods are not applicable in MANET due to its special properties. In this paper, a novel approach called detecting and eliminating black holes (DEBH) is proposed that uses a data control packet and an additional black hole check table for detecting and eliminating malicious nodes. Benefiting from trustable nodes, the processing overhead of the security method decreases by passing time. Ad hoc on-demand distance vector (AODV) routing protocol is used as the routing protocol in our design. After finding the freshest path using AODV, our design checks the safety of selected path. In case of detecting any malicious node, it is isolated from the entire network by broadcasting a packet that contains the ID of malicious nodes. Simulation results show that DEBH increases network throughput and decreases packet overhead and delay in comparison with other studied approaches. Moreover, DEBH is able to detect all active malicious nodes which generates fault routing information.     

Self‐adaptive routing protocols for integrating cellular networks,WLANs, and MANETs

A growing need to have ubiquitous connectivity has motivated our research to provide continuous connection between various wireless platforms such as cellular networks, wireless local area networks (WLANs), and mobile ad hoc networks (MANETs). In this paper, we consider integration at the routing layer and propose two adaptable routing protocols (IRP‐RD and IRP‐PD) that exploit topology information stored at the fixed network components (cellular base stations and WLAN access points) for the route discovery and maintenance processes. Our proposed protocols can provide connectivity to the cellular network and/or WLAN hotspots through multihop routing, while differ in the gateway discovery approach used. In IRP‐RD, multihop routes to gateways to the cellular network or WLAN hot spots are discovered on demand, while in IRP‐PD out of coverage users proactively maintain routes to the gateways. Furthermore, proposed protocols can be used in any heterogeneous scenario, combining a cellular network and WLANs operating in infrastructure or ad hoc (MANET) mode. We provide simulation results that demonstrate the effectiveness of the proposed integrated routing protocols and show the advantages and drawbacks of each gateway discovery approach in different heterogeneous scenarios. Copyright © 2006 John Wiley & Sons, Ltd.     

Road Aware Geographical Routing Protocol Coupled with Distance,Direction and Traffic Density Metrics for Urban Vehicular Ad Hoc Networks

The new information and communication technologies have changed the trend of communication in all fields. The transportation sector is one of the emerging field, where vehicles are communicating with each other or with infrastructure for different safety and comfort applications in the network. Vehicular ad hoc networks is one of the emerging multi-hop communication type of intelligent transportation field to deal with high mobility and dynamic vehicular traffic to deliver data packets in the network. The high mobility and dynamic topologies make the communication links unreliable and leads to frequent disconnectivity, delay and packet dropping issues in the network. To address these issues, we proposed a road aware geographical routing protocol for urban vehicular ad hoc networks. The proposed routing protocol uses distance, direction and traffic density routing metrics to forward the data towards the destination. The simulation results explore the better performance of proposed protocol in terms of data delivery, network delay and compared it with existing geographical routing protocols.

     

A path selection based routing protocol for urban vehicular ad hoc network (UVAN) environment

Routing in urban environment is a challenging task due to high mobility of vehicles in the network. Many existing routing protocols only consider density, link connectivity, delay, and shortest path information to send the data to the destination. In this paper, a routing protocol is proposed which uses the urban road network information such as multi-lane and flyover to send the data to the destination with a minimum packet forwarding delay. The next path for data forwarding is selected based on a path value calculated by the Road Side Unit for each path connected to a junction. This protocol uses Ground Vehicle to Ground Vehicle (GV2GV) communication, Flyover Vehicle to Flyover Vehicle (FV2FV) communication, and Flyover Vehicle to Ground Vehicle/Ground Vehicle to Flyover Vehicle (FV2GV/GV2FV) communication to enhance the routing performance. Simulation results show that proposed protocol performs better than P-GEDIR, GyTAR, A-STAR, and GSR routing protocols in terms of end-to-end delay, number of network gaps, and number of hops.     

Fire Controlling Under Uncertainty in Urban Region Using Smart Vehicular Ad hoc Network

Every year thousands of urban and industrial fires occur, which leads to the destruction of infrastructure, buildings, and loss of lives. One of the reasons behind this is the delayed transmission of information to the fire station and the nearer hospitals for ambulance service as the transmission of information is dependent on observer at the location where the fire is caught and cellular network. This paper proposed an automated routing protocol for the urban vehicular ad-hoc network to send the information from the location where the fire is caught to the nearest fire stations and hospitals with optimum service time. This transmission of information involves Road Side Unit (RSU) at the junction and the vehicles present in the transmission path. Selection of route to transmit faulty vehicle information from the RSU to the required faulty vehicle is based on a parameter called path value. The computation of path value is done by the attributes such as expected End To End (E2E) delay, the shortest distance to destination, the density of vehicle between the junctions, and attenuation. From the current junction, the selection of the next junction is based on minimum path value. The proposed routing protocol considers the performance parameters such as E2E delay, total service time (TST), number of network fragments or network gaps, number of hops, and attenuation for the propagation path for the evaluation of the proposed methodology. The proposed routing algorithm is implemented through OmNet++ and SUMO. Results obtained for the proposed routing protocol is compared with three existing VANET protocols (GSR, A-STAR, and ARP) in terms of End To End delay, number of hops, number of vehicular gaps, and Total Service Time (TST).

     

Gazetteer enrichment for addressing urban areas: a case study

The advent of volunteered geographical information (VGI) has contributed to the growth of the amount of user-contributed spatial data around the world. Spatial data acquired from crowdsourcing environments may contain valuable information which can be useful in other research fields, such as Digital gazetteers, commonly used in Geographic Information Retrieval. Digital gazetteers have a powerful role in the geoparsing process. They need to be kept up-to-date and as comprehensive as possible to enable geoparsers to perform lookup and then resolve toponym recognition precisely over digital documents. The detection of toponyms in digital texts such as social media posts is a bottom line for discovering useful spatially related information such as complaints regarding urban areas. In this context, this article proposes a method for gazetteer enrichment leveraging VGI data sources. Indeed VGI environments are not originally developed to work as gazetteers, however, they often contain more detailed and up-to-date information than gazetteers. Our method is applied within a geoparser environment by adapting its heuristics set besides enriching the corresponding gazetteer. A case study was performed by geoparsing Twitter posts focusing solely on the messages aiming at evaluating the performance of the enriched system. The obtained results were encouraging and have provided a good basis for discussion.     

Historical data learning based dynamic LSP routing for overlay IP/MPLS over WDM networks

Overlay IP/MPLS over WDM network is a promising network architecture starting to gain wide deployments recently. A desirable feature of such a network is to achieve efficient routing with limited information exchanges between the IP/MPLS and the WDM layers. This paper studies dynamic label switched path (LSP) routing in the overlay IP/MPLS over WDM networks. To enhance network performance while maintaining its simplicity, we propose to learn from the historical data of lightpath setup costs maintained by the IP-layer integrated service provider (ISP) when making routing decisions. Using a novel historical data learning scheme for logical link cost estimation, we develop a new dynamic LSP routing method named Existing Link First (ELF) algorithm. Simulation results show that the proposed algorithm significantly outperforms the existing ones under different traffic loads, with either limited or unlimited numbers of optical ports. Effects of the number of candidate routes, add/drop ratio and the amount of historical data are also evaluated.     

RATES: a server for MPLS traffic engineering

It has been suggested that one of the most significant reasons for multiprotocol label switching (MPLS) network deployment is network traffic engineering. The goal of traffic engineering is to make the best use of the network infrastructure, and this is facilitates by the explicit routing feature of MPLS, which allows many of the shortcomings associated with current IP routing schemes to be addressed. This article describes a software system called Routing and Traffic Engineering Server (RATES) developed for MPLS traffic engineering. It also describes some new routing ideas incorporated in RATES for MPLS explicit path selection. The RATES implementation consists of a policy and flow database, a browser-based interface for policy definition and entering resource provisioning requests, and a Common Open Policy Service protocol server-client implementation for communicating paths and resource information to edge routers. RATES also uses the OSPF topology database for dynamically obtaining link state information. RATES can set up bandwidth-guaranteed label-switched (LSPs) between specified ingress-egress pairs. The path selection for LSPs is on a new minimum-interference routing algorithm aimed at making the best use of network infrastructure in an online environment where LSP requests arrive one by one with no a priori information about future requests. Although developed for an MPLS application, the RATES implementation has many similarities in components to an intradomain differentiated services bandwidth broker     

Applying trust enhancements to reactive routing protocols in mobile ad hoc networks

Due to the characteristics of mobile ad hoc networks, such networks are more susceptible to the destruction of malicious attacks or denial of cooperation. It would be easy for an adversary or a malicious node to launch attacks on routing function, especially attacks on packet routing. In order to mitigate these hazards, we incorporate the concept of ‘trust’ into MANETs, and abstract a decentralized trust inference model. The core of this model is trust computation, which is divided into two parts: historical trust assessment and trust prediction. We can quantify a node’s historical trust based on its historical behaviors via introducing multiple trust attributes. The fuzzy AHP method based on entropy weights is used to calculate the weight of trust attributes. By making use of the obtained historical trust data sequence, we propose an improved dynamic grey-Markov chain prediction measure to effectively estimate node’s trust prediction. In order to verify the validity of our trust model, we propose a trust-enhanced unicast routing protocol and a trust-enhanced multicast routing protocol, respectively. Both of the two new protocols can provide a feasible approach to kick out the untrustworthy nodes and choose the optimal trusted routing path. Moreover, the new proposed data-driven route maintenance mechanisms can reduce the routing overhead. The persuasive experiments have been conducted to evaluate the effectiveness of the new proposed trust-enhanced routing protocols in the aspects of packets delivery ratio, end-to-end latency, malicious node detection and attack resistance.     

Optimizing OSPF/IS-IS weights in a changing world

A system of techniques is presented for optimizing open shortest path first (OSPF) or intermediate system-intermediate system (IS-IS) weights for intradomain routing in a changing world, the goal being to avoid overloaded links. We address predicted periodic changes in traffic as well as problems arising from link failures and emerging hot spots     

An Improved Fuzzy Unequal Clustering Algorithm for Wireless Sensor Network

This paper introduces IFUC, which is an Improved Fuzzy Unequal Clustering scheme for large scale wireless sensor networks (WSNs).It aims to balance the energy consumption and prolong the network lifetime. Our approach focuses on energy efficient clustering scheme and inter-cluster routing protocol. On the one hand, considering each node’s local information such as energy level, distance to base station and local density, we use fuzzy logic system to determine each node’s chance of becoming cluster head and estimate the cluster head competence radius. On the other hand, we use Ant Colony Optimization (ACO) method to construct the energy-aware routing between cluster heads and base station. It reduces and balances the energy consumption of cluster heads and solves the hot spots problem that occurs in multi-hop WSN routing protocol to a large extent. The validation experiment results have indicated that the proposed clustering scheme performs much better than many other methods such as LEACH, CHEF and EEUC.     

Network condition and application‐based data adaptive intelligent message routing in vehicular network

Recent advances in intelligent transportation systems enable a broad range of potential applications that significantly improve the vehicle and road safety and facilitate the efficient dissemination of information among the vehicles. To assist the vehicle traffic, message broadcasting is a widely adopted technique for road safety. But efficient message broadcasting is a significant issue, especially in a high network density due to the broadcast storm problem. To solve this issue, several methods are proposed to eliminate the redundant transmission of safety packets. However, they lack in restricting the broadcasting region of safety messages, and the transmissions of safety packets outside the dangerous region, and force the vehicles to unnecessary detours. This paper proposes an adaptive multimode routing protocol, network condition, and application‐based data adaptive intelligent message routing in vehicular network (NetCLEVER) that supports 2 modes of operation such as message broadcasting and intelligent routing. In message broadcasting mode, the NetCLEVER decides the dangerous region of the network by considering the changes of neighbor vehicles velocity, instead of current vehicle velocity, because a vehicle decision in velocity is interdependent with the preceding vehicles. In intelligent routing mode, the NetCLEVER exploits the cuckoo search optimization in routing by taking into account multiple routing factors such as the road topology of intersections and traffic signals and their impact on link stability, which improves the reliability of routing packets significantly. The performance evaluation illustrates that the proposed NetCLEVER improves reliable wireless communication as well as road safety in vehicular ad hoc networks.     

基于增强学习的协作主动路由信息交换机制

分组交换网是当今全球通信基础设施的重要部分，IP网络终将与其他网络相互融合，演化成为新一代网络技术，现有路由协议的实现是单一的，并且将数据库、最优路径计算和网络状态分发机制捆绑在一起。主动路由选择是一个把上述困难作为目标的新路由选择策略。主动路由选择机制被设计用来提供基于用户服务模式的路由选择。本文提出了一种基于增强学习的协作主动路由信息交换机制，主动路由代理获悉网络基础结构不同属性的当前状态，并在这个基础上建立和维护路由表，实现主动路由选择机制。     

A novel networking architecture for mobile content delivery in urban transport systems

Today, the media content delivery in intermittent connected networks has become increasingly critical. This paper studies content exchange among mobile commuters in urban transport systems. Our work is inspired by two facts: (1) the commuters in urban transport systems tend to take regular routes to the same place every weekday and their paths exhibit a high degree of temporal and spatial regularities; (2) the rapid development of broadband wireless technologies such as IEEE 802.11n makes fast data transfer possible. We first propose a new disconnection-tolerant network infrastructure, which reinforces the connectivity of intermittent connected mobile commuters and uses store-and-forward routers to increase their encounter opportunity, and in turn achieves efficient media content delivery among them. Then a router-centric prediction method is designed to collect passengers’ historical path information to determine the best delivery scheme. We evaluate the feasibility and the performance of the proposed infrastructure as well as the delivery scheme, using real data set from an urban transport system. The simulation results demonstrate the proposed system is highly practical in terms of the memory usage of routers and the maximum achievable data transfer rate.     

Integrated routing algorithms for anycast messages

The use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same path for anycast packets from a source, while multipath routing splits anycast traffic into several different paths. The former is simple and easy to implement, while the latter may potentially reduce congestion, improving delay and throughput performance. However, multipath routing may require additional cost to maintain multipath information. To take advantage of both approaches and overcome their shortcomings, we develop a set of integrated routing algorithms that can adaptively select a subset of routers in the network to carry out multipath routing for anycast messages. We demonstrate that systems using our integrated routing algorithms perform substantially better than those where either the single-path or multipath approach is used alone     

End-to-end routing behavior in the Internet

The large-scale behavior of routing In the Internet has gone virtually without any formal study, the exceptions being Chinoy's (1993) analysis of the dynamics of Internet routing information, and work, similar in spirit, by Labovitz, Malan, and Jahanian (see Proc. SIGCOMM'97, 1997). We report on an analysis of 40000 end-to-end route measurements conducted using repeated “traceroutes” between 37 Internet sites. We analyze the routing behavior for pathological conditions, routing stability, and routing symmetry. For pathologies, we characterize the prevalence of routing loops, erroneous routing, infrastructure failures, and temporary outages. We find that the likelihood of encountering a major routing pathology more than doubled between the end of 1994 and the end of 1995, rising from 1.5% to 3.3%. For routing stability, we define two separate types of stability, “prevalence”, meaning the overall likelihood that a particular route is encountered, and “persistence”, the likelihood that a route remains unchanged over a long period of time. We find that Internet paths are heavily dominated by a single prevalent route, but that the time periods over which routes persist show wide variation, ranging from seconds up to days. About two-thirds of the Internet paths had routes persisting for either days or weeks. For routing symmetry, we look at the likelihood that a path through the Internet visits at least one different city in the two directions. At the end of 1995, this was the case half the time, and at least one different autonomous system was visited 30% of the time     

SRDPV: secure route discovery and privacy-preserving verification in MANETs

In the routing discovery phase of the Mobile Ad hoc Networks (MANETs), the source node tries to find a fast and secure path to transmit data. However, the adversaries attempt to get the rights of routing during this phase ,then the networks can easily be paralyzed during the data transmission phase. During the routing discovery phase, finding a good path is already a challenge and verifying the security of the established path without revealing any privacy of the nodes adds a new dimension to the problem. In this paper, we present SRDPV, an approach that helps the source find the benign destination dynamically and conducts privacy-preserving verification of the path. Our approach first finds the benign destination. Then, it spreads the verification tasks across multiple nodes and verifies the log entries without revealing private data of the nodes. Unlike the traditional debugging system to detect the faults or misbehaviors of the nodes after the attacks, SRDPV can guarantee the source to avoid transmitting data through malicious nodes at the beginning and perform the verification without introducing a third party. We demonstrate the effectiveness of the approach by applying SRDPV in two scenarios: resisting the collaborative black-hole attack of the AODV protocol and detecting injected malicious intermediated routers which commit active and passive attacks in MANETs. We compared our approach with the existing secure routing algorithms and the results show that our approach can detect the malicious nodes, and the overhead of SRDPV is moderate.

     

A Connectivity-Based Multi-Lane Routing Optimization Algorithm in Vehicular Communication

This paper proposed a connectivity-based multi-lane geographic routing protocol (CGRP) for vehicular ad hoc networks. The proposed CGRP is based on an effective selection of road intersections through which a package must pass from source to destination. The cooperative connectivity probability and delay are taken into consideration when choosing the most suitable path for delay-sensitive safety traffic. Analytical expressions for cooperative connectivity probability is derived based on a three-lanes path model. Geographical forwarding is used to transfer packets between any two intersections on the path, reducing the path sensitivity to individual node movements. Furthermore, forwarding packets between two adjacent intersections also depend on geographic location information. Neighbor nodes’ priority are assigned according to position, speed, direction and other factors. Node with the highest priority will be selected as the next hop. Numerical and simulation results show that the proposed algorithm outperforms the exsiting routing protocols in terms of the end-to-end delay and the number of hops with a little cost of routing overhead in city environments.     

高分六号卫星城市建成区提取方法

针对基于可见光红波段和基于可见光绿波段的建成区指数方法提取的建成区易与水体和裸土区域混淆的问题,提出一种新建城区提取指数(NBAEI)方法,该方法考虑黄色波段在构建建成区提取指数的作用,利用建成区在黄色波段与红色波段的反射率差值所具有的正负特性可以完全区分建成区与水体区域,同时放大与裸地之间的差异以便提取建成区。以宝鸡市、日照市和保定市作为实验区域,分析总体精度、错分精度和漏分精度三类指标。实验结果表明,NBAEI方法总体分类精度高于其他两种方法,错分精度和漏分精度低于其他两种方法,说明所提方法的提取精度更高,效果更好,更适用于高分六号卫星提取建成区。     

Integrating service discovery with routing and session management for ad-hoc networks

In this paper, we propose GSR: a new routing and session management protocol for ad-hoc networks as an integral part of a service discovery infrastructure. Traditional approaches place routing at a layer below service discovery. While this distinction is appropriate for wired networked services, we argue that in ad-hoc networks this layering is not as meaningful and show that integrating routing with discovery infrastructure increases system efficiency. Central to our protocol is the idea of reusing the path created by the combination of a service discovery request and a service advertisement for data transmission. This precludes the need to use separate routing and discovery protocols. GSR also combines transport layer features and provides end-to-end session management that detects disconnections, link and node failures and enables service-centric session redirection to handle failures. This enables GSR to accommodate service-centric routing apart from the traditional node-centric routing. We compare GSR with AODV in terms of packet delivery ratio, response time and average number of hops traveled by service requests as well as data. GSR achieves better packet delivery ratio with a minor increase of the average packet delivery delay.