Multicast routing allows network sources to use network resources efficiently by sending only a single copy of data to all group members. In the group multicast routing problem (GMRP), every member of a group is also a source node. The routing algorithm must construct a source-based routing tree for each member of the group which spans all other member nodes without exceeding the capacities of ...

This paper analyzes the recent development regarding the technology in ad-hoc networks. It compares the different routing protocols and analyses them from architecture design perspective. The comparison includes technical aspects, similarities and missing functionality on each of the protocols. The paper identifies the network resource discovery as missing functionality, and presents a generic ...

Abstract Location-Routing problems involve locating a number of facilities among candidate sites and establishing delivery routes to a set of users in such a way that the total system cost is minimized. A special case of these problems is Hamiltonian p Median Problem (HpMP). In attempting to solve this problem, numerous mathematical formulations have been proposed. Most of them have in common t...

The routing table poisoning attack is one of the most devastating and least researched topic among Internet attacks, which needs immediate research attention. In this paper, we develop a scalable method for detecting router attacks and locating the malicious routers (within a small bounded set of nodes) in link state routing protocols. We carry out analytical and simulation studies to evaluate ...

We consider the problem of routing locality in peer-to-peer storage systems where peers store and exchange data among themselves. With the global information, peers will take the data locality into consideration when they implement their replication mechanisms to keep a number of file replicas all over the systems. In this paper, we mainly propose a peer-to-peer storage system – Malugo. Algorit...

Peer-to-peer (P2P) systems are distributed systems in which nodes act as peers, such systems are becoming very popular in applications like file sharing. In this kind of architecture, security in each transaction is fundamental requirements. The aim of a Distributed hash tables provides the method for locating resources (generally files) within a P2P network. In this paper our target is to anal...

Throughout history, nature has exposed humans to destructive phenomena such as earthquakes, floods, droughts, tornadoes, volcanic eruptions, and tropical and marine storms. The large scale of damages and casualties caused by natural disasters around the world has led to extensive applied research in the field of preparation and development of a comprehensive system for disaster management to mi...

Mobility affects routing protocol performance within a Mobile Ad Hoc NETwork (MANET). Past research on mobility models and framework was motivated by the need to provide a simulation platform for evaluating routing protocol performance via realistic scenarios. Mobility information of individual nodes has also been used to improve routing decisions (e.g., choice of next hop, link break predictio...

Cross-layer mechanism, for which a protocol locating at a given layer uses information issued from other layers, may enhance the mobile networks performance. Some of those mechanisms are based on mobility metrics. For example, the establishment of a route by choosing less mobile nodes could improve the routing protocol. In this paper, we study the ability of mobility metrics to reflect the mobi...

We introduce an informative labelling method for vertices in a family of Farey graphs, and deduce a routing algorithm on all the shortest paths between any two vertices in Farey graphs. The label of a vertex is composed of the precise locating position in graphs and the exact time linking to graphs. All the shortest paths routing between any pair of vertices, which number is exactly the product...