The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Dense and symmetric graphs are useful for modeling fast information distribution in wireless information networks. In this paper, we focus on a specific family of dense and symmetric graphs, the Borel Cayley graphs. More specifically, we investigate the various parameters in the original formulation of Borel Cayley graphs defined in the matrix domain. By eliminating redundant parameters, we propose...
Recent advances in systems of networked sensors have set the stage for smart environments which will have wide-ranging applications from intelligent wildlife monitoring to social applications such as health and elderly care service provisioning. Perhaps the most natural problem in sensor systems is the ??efficient?? propagation of a sensed local event. In order to address this problem, the notion...
Reciprocity technique emerges as an effective way to control freeloading problem. However, direct reciprocity schemes are not suitable for P2P networks with high churn rate; indirect reciprocity schemes are susceptible to sybil attacks. This paper presents a novel indirect reciprocity P2P protocol for limiting the capacity of sybil attacks. Our protocol accounts contributions of nodes and allows nodes...
Mesh topology is one of the most popular architectures in interconnection networks. Although many deadlock-free schemes for mesh networks have been proposed, deadlock avoidance is still the most difficult issue to solve. In this paper, we propose a new concept of channel class dependency for deadlock-free routing algorithm in mesh networks. Based on the channel class dependency graph, a new condition...
One of the main challenges in all-IP networks is the development of suitable mobility solution. Mobile IP (MIP) presents the standard protocol used to support IP mobility. However, MIP is inadequate for real-time applications and inter-domain mobility (when a mobile node performs handover between two autonomous systems (AS)). In this paper, we propose an efficient approach to manage inter-domain handover...
Geographic forwarding is a favorable scheme for data reporting in wireless sensor networks (WSNs) due to its simplicity and low-overhead. However, WSNs are usually subject to complicated environmental factors. Network holes (i.e., the areas where no nodes inside) and barriers (i.e., those blocking the communication between two close nodes) are inevitable in practical deploying environments. These...
A key challenge of message forwarding in delay tolerant networks (DTNs) is to increase delivery rate and decrease delay and cost. When information for future connectivity is not available, opportunistic routing is preferred in DTNs in which messages are forwarded opportunistic (non-deterministically) to nodes with higher delivery probabilities. Many real objects have non-deterministic but cyclic motions;...
We present the design of pService system for P2P Web services discovery supporting similarity search with its locality-preserving feature based on modified Skip Graph. In pService, the most important property (e.g. service name) of a service is viewed as the indexing key of a peer node. The other properties are extracted as multiattributes which would be mapped into one-dimensional indices using HSFC...
The network coding capacity of a single multicast traffic is characterized by the min-cut/max-flow (mcMF) theorem, which can be achieved by random linear network coding (RLNC). Nonetheless, the graph-theoretic characterization for multiple unicast/multicast traffic remains an open problem. This paper proposes and studies a new class of intersession-network-coding schemes: RLNC with selective cancelling...
The tremendous growth of public interest in peer-to-peer (P2P) networks in recent years has initiated a lot of research work on how to design efficient overlay structures for P2P systems. Structured overlay networks that based on various distributed hash tables (DHTs) provide no control over where data is stored and cannot support range queries directly. Ordered overlays such as skip graphs and SkipNet...
We present an overview of combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are allowed. Namely, the input dataset is represented by a comparison oracle that given any three points X,Y,Z answers whether Y or Z is closer to X. We assume that the similarity order of the dataset satisfies the four variations...
Because of automated guided vehicles (AGVs) routing flexibility, they have been used in many manufacturing systems, especially those in which parts with diverse and complex processing routes are made. This paper introduces the design of an material handling flow path control system in a partitioned zone through the timed Petri Nets. The initial requirements of a system specified with sequence diagrams...
It is generally recognized that the current routing scheme of Internet suffers from serious scalability problems. In this paper, we work with the abstract but 'Internet-like' network model consisting of an infinite-variance power-law random graph (IVPLRG) and adopt the idea of a routing scheme proposed by Carmi, Cohen and Dolev (C-C-D). The scheme fits very naturally to the spontaneously emerging...
Most of recent researches on P2P system focus on how to build a highly usable P2P overlay network. Researchers include small routing table, short query path and good robustness into their design objectives of overlay topology. In this paper, we present a general group theory method and define a new Cayley graph. Based on this graph, we propose a novel P2P overlay network called GroupNET, which has...
The Internet occasionally experiences large disruptions, arising from both natural and manmade disturbances, and it is of significant interest to develop methods for locating within the network the source of a given disruption (i.e., the network element(s) whose perturbation initiated the event). This paper presents a new approach to realizing this logical localization objective. The proposed methodology...
The development of peer to peer overlay networks applications has attracted an immense interest from the research community in recent years. Several challenging issues have to be resolved in order to provide accessible, efficient and scalable inter-peer communication. Achieving resilience so as to reduce the disconnection probability, is among the most demanding issues to provide a robust and omnipresent...
This article describes the implementation of a new Algorithm on Auto-Creation the logic diagram with orientation. This type diagram include the topology and route in real world about the cable of telecommunication. The algorithm traversal the graph and set the vertexpsilas position by deep search first method, and avoid the needless inter cross by backtracking method.
Most existing anycast routing algorithms are based on shortest path algorithm. In this paper, an adaptable anycast routing algorithm based on density and proximity is proposed. While determining anycast member, both the proximity factor and nearby anycast members number of the target (density factor) should be considered. Density is calculated on the base of field theory. In comparison with proximity-based...
This paper addresses capacitated location-routing problems (CLRP). Those distribution network design problems involve depot (or hub) location, fleet assignment and routing decisions. The distribution networks under investigation are characterized by several depots, by a capacitated homogeneous vehicle fleet and by a set of customer nodes to be serviced with demands. The objective is to assign the...
There are lots of operations in the distribution center, of which the replenishment operation is an important one that can decrease the processing time seriously and bring considerable economic benefit if managed effectively. We consider the replenishment problem in which travel time and distance is measured according to rectilinear norm. An O(n) polynomial time algorithm to find the optimal replenishing...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.