Message Routing Research Articles

Analysis of Enhanced Switching Agent for Zigbee Wireless Sensor Network using LAR

A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper suggests an approach to utilize location information (for instance, obtained using the global positioning system) to improve performance of routing protocols for ad hoc networks. By using location information, the proposed Location-Aided Routing (LAR) protocols limit the search for a new route to a smaller “request zone” of the ad hoc network. This results in a significant reduction in the number of routing messages. We present two algorithms to determine the request zone, and also suggest potential optimizations to our algorithms.

Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks

The widespread use of mobile networking devices, such as smart phones and tablets, has substantially increased the number of nodes in the operational networks. These devices often suffer from the lack of power and bandwidth. Hence, we have to optimize their message routing for the sake of maximizing their capabilities. However, the optimal routing typically relies on a delicate balance of diverse and often conflicting objectives, such as the route's delay and power consumption. The network design also has to consider the nodes' user-centric social behavior. Hence, the employment of socially aware load balancing becomes imperative for avoiding the potential formation of bottlenecks in the network's packet-flow. In this paper, we propose a novel algorithm, referred to as the multi-objective decomposition quantum optimization (MODQO) algorithm, which exploits the quantum parallelism to its full potential by reducing the database correlations for performing multi-objective routing optimization, while at the same time balancing the teletraffic load among the nodes without imposing a substantial degradation on the network's delay and power consumption. Furthermore, we introduce a novel socially aware load balancing metric, namely, the normalized entropy of the normalized composite betweenness of the associated socially aware network, for striking a better tradeoff between the network's delay and power consumption. We analytically prove that the MODQO algorithm achieves the full-search based accuracy at a significantly reduced complexity, which is several orders of magnitude lower than that of the full search. Finally, we compare the MODQO algorithm to the classic non-dominated sort genetic algorithm II evolutionary algorithm and demonstrate that the MODQO succeeds in halving the network's average delay, while simultaneously reducing the network's average power consumption by 6 dB without increasing the computational complexity.

Triadic Motifs in the Partitioned World Trade Web

One of the crucial aspects of the Internet of Things that influences the effectiveness of communication among devices is the communication model, for which no universal solution exists. The actual interaction pattern can in general be represented as a directed graph, whose nodes represent the “Things” and whose directed edges represent the sent messages. Frequent patterns can identify channels or infrastructures to be strengthened and can help in choosing the most suitable message routing schema or network protocol. In general, frequent patterns have been called motifs and overrepresented motifs have been recognized to be the low-level building blocks of networks and to be useful to explain many of their properties, playing a relevant role in determining their dynamic and evolution. In this paper triadic motifs are found first partitioning a network by strength of connections and then analyzing the partitions separately. The case study is the World Trade Web (WTW), that is the directed graph connecting world Countries with trade relationships, with the aim of finding its topological characterization in terms of motifs and isolating the key factors underlying its evolution. The WTW has been split based on the weights of the graph to highlight structural differences between the big players in terms of volumes of trade and the rest of the world. As test case, the period 2003-2010 has been analyzed, to show the structural effect of the economical crisis in the year 2007.

Optimizing groups of colluding strong attackers in mobile urban communication networks with evolutionary algorithms

In novel forms of the Social Internet of Things, any mobile user within communication range may help routing messages for another user in the network. The resulting message delivery rate depends both on the users’ mobility patterns and the message load in the network. This new type of configuration, however, poses new challenges to security, amongst them, assessing the effect that a group of colluding malicious participants can have on the global message delivery rate in such a network is far from trivial. In this work, after modeling such a question as an optimization problem, we are able to find quite interesting results by coupling a network simulator with an evolutionary algorithm. The chosen algorithm is specifically designed to solve problems whose solutions can be decomposed into parts sharing the same structure. We demonstrate the effectiveness of the proposed approach on two medium-sized Delay-Tolerant Networks, realistically simulated in the urban contexts of two cities with very different route topology: Venice and San Francisco. In all experiments, our methodology produces attack patterns that greatly lower network performance with respect to previous studies on the subject, as the evolutionary core is able to exploit the specific weaknesses of each target configuration.

Privacy preservation and protection for cluster based geographic routing protocol in MANET

In mobile ad hoc networks (MANET), the malicious attackers may attack the location information and routing messages. Hence these information need to be protected by means of authentication, integrity and encryption. In this paper, we propose a privacy preservation and protection for cluster based geographic routing protocol in MANET. In this technique, cluster head is chosen based on node value which is estimated based on degree difference, node mobility and residual energy. The cluster consists of GPS enabled node and antenna equipped node. The cluster that contains at least one G-Node considers the remaining energy, speed of the node along with the mobility of node to select the cluster head. In order to perform privacy and anonymity protection of cluster members, the cluster head then initializes group signature scheme. Then the secured routing technique is deployed where the routing packets are protected by encryption. By simulation results, we show that the proposed technique reduces the network overhead.

Modified Ad Hoc On-Demand Distance Vector Routing Protocols

network is a network without physical structure and is established with mobile nodes using wireless connections. Ad Hoc network is highly flexible and supports dynamic network topology. Thus, the efficiency of the routing protocol will affect the overall network performance. Mobile ad hoc networks carriage several kinds of security problems, initiated by their open systems and nature of collaborative by limited accessibility of resources. In this paper we study and analyses various attacks that can be possible on AODV. My planned work is an extension of AODV to the secure AODV protocol extension, which contains tuning policies aimed at improving routing performance. Proposed an extension to Adaptive- SAODV of the secure AODV protocol extension. In our thesis we goals s Developed a routing protocol algorithm to solve the problem of efficiency transmission in Mobile Ad Hoc networks. So that work we divided the process into two parts. In M-AODV an intermediate node create an adaptive reply decision for an incoming demand that helps to stabile its security and efficiency of incoming messages. I.e. we propose a modification to adaptive mechanism that adjusts M-AODV behaviour. In the AODV protocol, a backup route will be began to transfer data when the original route is broken. However, a backup method affects the overall network performance such as pdr, end-to-end delay, etc. To solve this problem, the method developed in this research is used to reroute the data traffic and improve the performance of AODV protocol by via ACK reply path as a backup way whenever there is a route failure. The proposed method, called Modified AODV protocol (M-AODV), is developed by modifying the AODV protocol. The method creates new flags in the routing message, so that as long as the source node can still receive ACK reply from the destination node when an original route is broken, it uses the forwarding path of ACK as a backup route to transfer the rest of the data packets. M-AODV also incorporates features of the M-TCP scheme to solve unnecessary resending of lost data packets. The both algorithm uses only connectivity information to look for illegal structures in the connectivity graph. The algorithm is independent of wireless communication models. We have analysis that our proposed algorithm improve the performance in M-AODV and also compared its performance like the throughput, end-to-end delay and packet delivery ratio with existing mechanisms using EXATA simulation.

Asymptotic Throughput Capacity Analysis of VANETs Exploiting Mobility Diversity

Vehicular ad hoc networks (VANETs) rely on intervehicle relay to extend the communication range of individual vehicles for message transmissions to roadside units (RSUs). With the presence of a large number of quickly moving vehicles in the network, the end-to-end transmission performance from individual vehicles to RSUs through intervehicle relaying is, however, highly unreliable due to the violative intervehicle connectivity. As an effort toward this issue, this paper develops an efficient message routing scheme that can maximize the message delivery throughput from vehicles to RSUs. Specifically, we first develop a mathematical framework to analyze the asymptotic throughput scaling of VANETs. We demonstrate that in an urban-like layout, the achievable uplink throughput per vehicle from vehicle to RSUs scales as $\Theta(\hbox{1}/\log n)$ when the number of RSUs scales as $\Theta(n/\log n)$ with $n$ denoting vehicle population. By noting that the network throughput is bottlenecked by the unbalanced data traffic generated by hotspots of realistic urban areas, which may overload the RSUs nearby, a novel packet-forwarding scheme is proposed to approach the optimal network throughput by exploiting the mobility diversity of vehicles to balance the data traffic across the network. Using extensive simulations based on realistic traffic traces, we demonstrate that the proposed scheme can improve the network throughput approaching the asymptotic throughput capacity.

A Geoweb-Based Tagging System for Borderlands Data Acquisition

Borderlands modeling and understanding depend on both spatial and non-spatial data, which were difficult to obtain in the past. This has limited the progress of borderland-related research. In recent years, data collection technologies have developed greatly, especially geospatial Web 2.0 technologies including blogs, publish/subscribe, mashups, and GeoRSS, which provide opportunities for data acquisition in borderland areas. This paper introduces the design and development of a Geoweb-based tagging system that enables users to tag and edit geographical information. We first establish the GeoBlog model, which consists of a set of geospatial components, posts, indicators, and comments, as the foundation of the tagging system. GeoBlog is implemented such that blogs are mashed up with OpenStreetMap. Moreover, we present an improvement to existing publish/subscribe systems with support for spatio-temporal events and subscriptions, called Spatial Publish/Subscribe, as well as the event agency network for routing messages from the publishers to the subscribers. A prototype system based on this approach is implemented in experiments. The results of this study provide an approach for asynchronous interaction and message-ordered transfer in the tagging system.

Fault-tolerant routing over shortest node-disjoint paths in hypercubes

This paper presented a routing algorithm that finds n disjoint shortest paths from the source node s to target node d in the n-dimensional hypercube. Fault-tolerant routing over all shortest node-disjoint paths has been investigated to overcome the failure encountered during routing in hypercube networks. In this paper, we proposed an efficient approach to provide fault-tolerant routing which has been investigated on hypercube networks. The proposed approach is based on all shortest node-disjoint paths concept in order to find a fault-free shortest path among several paths provided. The proposed algorithm is a simple uniform distributed algorithm that can tolerate a large number of process failures, while delivering all n messages over optimal-length disjoint paths. However, no distributed algorithm uses acknowledgement messages (acks) for fault tolerance. So, for dealing the faults, acknowledgement messages (acks) are included in the proposed algorithm for routing messages over node-disjoint paths in a hypercube network.

An adaptive vehicular epidemic routing method based on attractor selection model

Vehicular ad hoc networks (VANETs) is an emerging technology that can support many vehicular safety and comfort applications through intervehicle communications. However, VANETs could face a great challenge arising from rapidly varying network topology. It is an essential issue to design an efficient and reliable solution for message dissemination in dynamic VANETs. In this paper, we propose an epidemic routing method with capability of self-adapting to the highly dynamic nature of VANETs. To ensure a good trade-off between reachability and efficiency of message dissemination, an adaptive probabilistic infection and an adaptive limited-time forwarding mechanisms are also proposed for the epidemic broadcasting. Moreover, inspired by the self-adaptability and robustness of the cellular gene regulatory networks, we use the attractor selection mechanism to enhance routing messages in dynamic VANETs. Through comparative simulations under different traffic scenarios, we validate our proposed method and prove that it can guarantee message reachability and achieve high delivery efficiency in terms of message delivery ratio, average routing latency and cost.

How the brain sorts and routes messages

Brain Computation How do higher brain areas communicate with each other? Do they send out all computations equally to all target areas and leave the recipient to extract the needed and relevant information? Or does the transmitting region package and route computations differentially to distinct

Research on seamless mobility handover for 6LoWPAN wireless sensor networks

This paper proposes a seamless mobility handover scheme (SMH) for IPv6 over low power wireless personal area networks wireless sensor networks. In SMH, the routing of the control messages for the mobility handover is performed in the link layer and is automatically achieved through the IPv6-access-node trees, so the mobility handover cost is reduced and the delay is shortened. SMH proposes the hierarchical IPv6 address structure for sensor nodes which effectively shortens the length of an IPv6 address and reduces the transmission cost. In SMH, a mobile sensor node does not need a care-of address during the mobility handover process, so it does not need to perform the binding operation between its home address and care-of address. As a result, the mobility handover cost is reduced and the delay is shortened. The paper analyzes the performance parameters of SMH, and the data results show that SMH reduces the mobility handover cost and shortens the delay.

Performance Investigation of Signal Strength based Gossip AODV

Due to their “on demand” nature, the reactive protocols for MANETs, incurred less overhead and hence are preferred over proactive protocols. Since reactive protocols rely on network wide flooding of routing messages, they suffer from the “broadcast storm” problem. Received signal strength based probabilistic flooding scheme named RSSGossipAODV was proposed in [13]as an attempt to solve the frequent link breakages and broadcast storm experienced in AODV routing protocol. This paper investigates the ability of RSS-GossipAODV to handle different node mobility speeds in faded and non-faded environments.The performance of RSS-GossipAODV is evaluated by varying node mobility speed. It is evident from our experimental results that in both non faded and Rician faded scenarios, RSS-GossipAODV outperforms conventional AODV in term of packet delivery ratio, throughput, delay and link breakages and at the same time tries to minimize the broadcast storm problem by flooding lesser number of route request (RREQ) messages. General Terms Ad Hoc Networks, MANET

Network resource efficient routing in mobile ad hoc wireless networks

Network resources in mobile ad hoc wireless networks (MANETs) are constrained due to their dynamic topology and lack of centralized control. Mobile nodes in MANETs tend to broadcast packets to exchange information and consume lots of network resources such as network bandwidth and battery power of each node during forwarding their packets. Hence, the conserving network resource is crucial to maintain the quality of network services without interruptions. In order to discover an ideal routing algorithm that should use minimum network resources and improve network performance, we propose an adaptive-gossiping routing algorithm that saves network bandwidth and energy consumption at each node by reducing the duplicated routing messages. Our new analytical model of adaptive-gossiping probability $$p_{n}$$pn provides a less routing overhead which results in conserving network resources and reducing the end-to-end delay. The both analytical and experimental results of our proposed method confirm its advantages over flooding and static-gossiping based routing protocols in large-scale networks.

Minimum average relative load for online routing

We are given a network where each edge has an associated capacity or bandwidth. Requests for connections arrive online; each request specifies the source and sink and the requested bandwidth. This paper presents an algorithm for routing of messages. At the time of arrival of each request, if its bandwidth is bigger than associated bound, then the request is rejected. Otherwise, the algorithm assigns it a path to send the message. We define a new routing objective, which is called the average relative load on edges. Our objective is different from the previously studied objective (Aspnes et al. in J ACM 44:486---504, 1997; Buchbinder and Naor 2006), minimizing the maximum relative load. The algorithm assigns the paths such that the competitive ratio of the algorithm is $$-\frac{1}{2\beta }/(\alpha +\frac{1}{2\beta })=O(1)$$-12β/(?+12β)=O(1), where $$\beta <0$$β<0 and $$-1/2\beta <\alpha <-1/\beta$$-1/2β<?<-1/β. Also, an upper bound $$O(\log _a n)$$O(logan) for the relative load of each edge is presented, where $$1/2\le a< 1$$1/2≤a<1.

Delay tolerant lazy release consistency for distributed shared memory in opportunistic networks

Opportunistic networks (ONs) allow mobile wireless devices to interact with one another through a series of opportunistic contacts. While ONs exploit mobility of devices to route messages and distribute information, the intermittent connections among devices make many traditional computer collaboration paradigms, such as distributed shared memory (DSM), very difficult to realize. DSM systems, developed for traditional networks, rely on relatively stable, consistent connections among participating nodes to function properly.We propose a novel delay tolerant lazy release consistency (DTLRC) mechanism for implementing distributed shared memory in opportunistic networks. DTLRC permits mobile devices to remain independently productive while separated, and provides a mechanism for nodes to regain coherence of shared memory if and when they meet again. DTLRC allows applications to utilize the most coherent data available, even in the challenged environments typical to opportunistic networks. Simulations demonstrate that DTLRC is a viable concept for enhancing cooperation among mobile wireless devices in opportunistic networking environment.

Network Coding and Cross-Layer Approach for Reliability and Optimization of Routing in VANET: A Survey

Vehicular Ad-hoc Networks (VANET) is a subclass of mobile ad hoc networks. VANET provides wireless communication among vehicles and vehicle to roadside equipment. The communication between vehicles is regarding safety, comfort and entertainment. The performance of whole system depends on the reliability of the system and the routing of messages. Routing depends on the kind of routing protocol that is used. In this study we, aim to study the routing protocols designed specifically for VANET. Due to the highly dynamic nature and set of challenges in the VANET environment, routing techniques designed for MANET cannot work with VANET. In order to increase the reliability and optimization of routing protocols, researchers have suggested methods like Network Coding and cross layer approach. This paper also gives an overview of these and effectiveness of these methods. General Terms Wireless Ad-hoc Networks, Vehicular Ad-hoc Networks (VANET), Routing protocols.

Distributed efficient similarity search mechanism in wireless sensor networks.

The Wireless Sensor Network similarity search problem has received considerable research attention due to sensor hardware imprecision and environmental parameter variations. Most of the state-of-the-art distributed data centric storage (DCS) schemes lack optimization for similarity queries of events. In this paper, a DCS scheme with metric based similarity searching (DCSMSS) is proposed. DCSMSS takes motivation from vector distance index, called iDistance, in order to transform the issue of similarity searching into the problem of an interval search in one dimension. In addition, a sector based distance routing algorithm is used to efficiently route messages. Extensive simulation results reveal that DCSMSS is highly efficient and significantly outperforms previous approaches in processing similarity search queries.

ML-SOR: Message routing using multi-layer social networks in opportunistic communications

Opportunistic networks are a generalization of DTNs in which disconnections are frequent and encounter patterns between mobile devices are unpredictable. In such scenarios, message routing is a fundamental issue. Social-based routing protocols usually exploit the social information extracted from the history of encounters between mobile devices to find an appropriate message relay. Protocols based on encounter history, however, take time to build up a knowledge database from which to take routing decisions. While contact information changes constantly and it takes time to identify strong social ties, other types of ties remain rather stable and could be exploited to augment available partial contact information. In this paper, we start defining a multi-layer social network model combining the social network detected through encounters with other social networks and investigate the relationship between these social network layers in terms of node centrality, community structure, tie strength and link prediction. The purpose of this analysis is to better understand user behavior in a multi-layered complex network combining online and offline social relationships. Then, we propose a novel opportunistic routing approach ML-SOR (Multi-layer Social Network based Routing) which extracts social network information from such a model to perform routing decisions. To select an effective forwarding node, ML-SOR measures the forwarding capability of a node when compared to an encountered node in terms of node centrality, tie strength and link prediction. Trace driven simulations show that a routing metric combining social information extracted from multiple social network layers allows users to achieve good routing performance with low overhead cost.

Position Based and Hybrid Routing Protocols for Mobile Ad Hoc Networks: A Survey

Routing protocols for mobile ad-hoc networks can be broadly classified as position-based (geographic) and topology-based. Geographic routing uses location information of nodes to route messages. Geographic routing protocols use greedy forwarding under which a node forwards a packet to a next node which is closer to the destination than itself; when greedy routing fails due to the non-existence of nodes closer to the destination than itself, different protocols use different strategies to forward packets. In this paper, we present a critical survey of the geographic and hybrid routing protocols presented in the literature recently. The main aim of the paper is to provide a timely survey of the recently proposed protocols, complementary to the existing surveys on geographic routing protocols.