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.
The capacitated vehicle routing is a combinatorial optimization problem of that has aroused major interest because it is present in critical areas (logistics, transport and other) and it is a problem of considerable difficulty. There are currently several techniques that have been developed to try to solve this problem efficiently. In this paper, we present a solution to this problem based on the...
Wireless sensor networks (WSNs) are often deployed in harsh environments with little human control, thereby necessitating self organizing and maintenance mechanisms for medium sharing and data routing. Moreover, since sensor nodes operate on energy-limited batteries, designing energy-efficient routing techniques that extend the network lifetime is of a paramount importance. In this paper, we propose...
By building a P2P content distribution network (CDN), peers collaborate to distribute the content of underprovisionned Websites and to serve queries for larger audiences on behalf of the Websites. This can reveal very challenging, given the highly dynamic and autonomous participation of peers. Indeed, the P2P-CDN should adapt to increasing numbers of participants and provide robust algorithms under...
Many realistic problem domains are composed of heterogeneous tasks distributed in a physical environment. A team of mobile agents has to autonomously allocate these tasks, navigate to them and finally execute them. Recently auctions have been used for task allocation among homogeneous agents. Less studied is the case of allocation where both the tasks and the agents are heterogeneous in nature. In...
One of the exigent problems in wireless sensor networks is the recognition of network boundary and the detection of holes within the network. In this paper, we propose an algorithm in which every node in the network self-detects whether it is a boundary node or an inner node by utilizing the available connectivity information and making no assumptions about the location awareness. The algorithm is...
This paper presents a method for the qualitative analysis of WorkFlow nets based on the proof trees of linear logic. The analysis is concerned with the proof of the correctness criterion soundness defined for WorkFlow nets. To prove the soundness property, a proof tree of linear logic is built for each different scenario of the WorkFlow net. Based on this approach, a method is proposed to verify in...
Client/Server-based DVE approaches incur scalability and load balancing problems while addressing massive number of users. In order to mitigate these problems P2P overlays are proposed for content provision and management issues instead. However, content provision and management in a distributed manner is much more complicated and requires an exhaustive study of overlay network properties. In order...
In recent years there was much attention about connected dominating set as a backbone for wireless networks. The aim is changing much nodes' state to inactive as possible and keep smallest number of nodes active and leave communication duty of inactive group to active group. In previous algorithms for attaining this goal, nodes with greater degree were kept active and trees were grown over nodes with...
Resource space model (RSM) is a normalized classification model that uses m-dimensional semantic spaces to share and manage various resources in a centralized manner. This paper explores how to use the idea of classification semantics to organize indexes of resources in a decentralized manner. We deploy RSM on a structured P2P topology HRing by two ID management methods. HRing is a ring-structured...
The high capacity of fibers used in optical networks, can be divided into many channels, using the WDM technology. Any damage to a fiber causes all the channels routed through this link to be broken, which may result in a serious amount of data loss. As a solution to this problem, the virtual layer can be mapped onto the physical topology, such that, a failure on any physical link does not disconnect...
In this paper, we propose an optimized clustering technique based on spatial-correlation in wireless sensor networks (WSN). It combines the advantages of clustering technique with spatial-correlation. It can avoid the impact of unexpected data on the results and get approximate results in a tolerant error by using similarity degree to construct clusters. Moreover, for only cluster-heads transmit data...
D-meshes belong to an extended family of regular two-dimensional meshes of an arbitrary degree d. They have shorter maximal and average node-to-node distances than most other interconnection networks. Competitive congestion-free routing algorithms for all-to-all communication can be implemented on d-meshes. Additional nodes can be added to the system with no changes on most of existing nodes and with...
With the intensification of market competition and fast development of science and technology, many enterprises have begun to realize the importance of logistic distribution vehicle routing problem under uncertainty environment, and begin to pay more attention to the research of this problem. In this paper, The traditional vehicle routing problem with time windows is expanded to the situation that...
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...
Based on an analysis of related work about time exception in workflow, an algorithm for time exception handling of temporal workflow is presented in the paper. The algorithm is to meet the overall deadline of the case via an approach of cutting down the slack time of remaining activities, when there is a time exception. Meanwhile, details about the adjusting strategy for various kinds of routing constructions...
Although metric access methods (MAMs) proved their capabilities when performing efficient similarity search, their further performance improvement is needed due to extreme growth of data volumes. Since multi core processors become widely available, it is justified to exploit parallelism. However, taking into account the Gustafsonpsilas law, it is necessary to find tasks suitable for parallelization...
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.
Presently available schemes for data centric storage in sensor networks usually use geographical routing protocols to communicate data between sensor nodes. However, sensor nodes are required to know their locations for them to use geographical routing protocols. In this paper, we propose a new routing protocol that does not rely on location information, and thus can be used for data centric storage...
Multicast communication is an efficient method of data transmission and distribution among a group, especially when network resources are inadequate and needs to be shared. Fair share of network resources, such as, bandwidth, is desirable in such cases. Although there has been an intensive research effort to design protocols and construct multicast routing graphs for a single multicast group, construction...
Multicast communication over mobile ad hoc networks becomes popular. Dependable and scalable multicast routing protocol is required for large mobile ad hoc networks, even though network size and node mobility continue to increase. However, the data packet delivery becomes less dependable due to radio interference and frequent route breaks as the hop count between the source node and the multicast...
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.