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.
A wireless sensor network consists of a large number of sensor nodes scattered in the region of the network which have limited energy and limited computational and sensing ability. Data aggregation is important in this kind of network which can make use of the energy of the sensor nodes efficiently, and reduce the traffic in network by utilizing the abilities of the nodes in local computation and...
Routing in mobile ad hoc networks (MANETs) is central to their proper functioning. Network dynamics make the routing a real challenging task. Although a host of studies has been reported in the literature evaluating the performance of proposed routing algorithms, a deeper insight reveals some residual malfunctioning: wall effects, looping and inconsistency. In this paper, we first unleash the cover...
As the rapid growth of Internet and the communication link speed, it becomes increasingly challenging for network processors to timely route the incoming traffic to the destination ports. The traditional approach must look up the routing table based on the destination IP address to determine the output port. The ternary CAM approach provides fast associative look up, but is very costly for large routing...
In this paper, we focus on the design of the fault-tolerant routing algorithm for the (n,k)-star graph. We apply the idea of collecting the limited global information used for routing on the n-star graph to the (n,k)-star graph. First, we build the probabilistic safety vector (PSV) with modified cycle patterns. Then, our routing algorithm decides the fault-free routing path with the help of PSV. The...
Many networks in real life such as electric power systems, transportation systems and manufacturing systems can be modeled as a stochastic-flow networks whose arcs and nodes have discrete and multi-valued random capacities. For such a flow network, the system reliability is the probability that the maximum flow of the network is not less than the given demand d. The researchers in this field have...
In order to provide the fault-tolerant capability of multicast communications, several multicast recovery schemes have been proposed at present. These schemes can be divided into two classes: reactive and pro-active. Reactive scheme can take longer recovery time. In result, it does not fit some real applications. In this paper, we focus on pro-active multicast recovery scheme, for example, the "dual-tree"...
According to the open vehicle routing problem (OVRP), a vehicle is not required to return to the distribution depot after servicing the last customer on its route. In this paper, the open vehicle routing problem with time windows (OVRPTW) is considered, and a mixed integer programming mathematic model of OVRPTW was proposed in detail. Meantime, an improved genetic algorithm (IGA) was proposed to overcome...
Aiming at the conflict between information transmission QoS and network resource, propose some notions and schemes including delivery strategy, distribution procedure, resource matching and delivery routing which based on the distribution policy. With the proper distribution policy, the efficient delivery control procedure and dissemination management could be taken relatively, according to the type...
In this paper, the vehicle routing problem with time windows (VRPTW) was considered, and a mixed integer programming mathematic model of VRPTW was proposed in detail. Meantime, an improved ant colony algorithm (IACA) was proposed to overcome the shortcomings of premature convergence and slow convergence of conventional ant colony algorithm (ACA). The experiment results showed that the IACA can solve...
It's necessary to choose the optimal route in traffic network. Various foreign researchers have done a lot of research and improvement. The traditional optimal routing algorithms were represented by Dijkstra algorithm, and they all not only had high complexity but also had the disadvantage of not reflecting the dynamic very well. In this paper, a new algorithm about choosing the optimal routing problem...
In order to solve the problem that the structure of P2P network's logical network and physical topology do not match at a large extent, information of resources' searching are time-consuming, we propose an improved P2P chord model which was based on the IP-LCO algorithm. The adoption of IPv6 addresses can solve the unmatched problem, and LCO algorithm can quickly location the resources' network node...
As an important component of online privacy, anonymity is concerned by all users of P2P system. Many methods are proposed to provide mutual anonymity and most of them are path-based: an anonymous path should be constructed by source peer before transmission. Although those proposals perform well in providing mutual anonymity, the pre-constructed paths suffer from node churn and make anonymous transmission...
Logistics service suppliers are expected to make a reasonable collection routes to reduce service cost and improve service level. In this paper, the vehicle scheduling and routing model is proposed to choose optimal collection routes and to minimize the total cost which is composed by transport cost, overtime cost, punitive fine and inventory cost. A modified saving algorithm which takes the total...
Chord is a typical model of structured P2P network. However, there are some problems for the mechanism of searching resources in Chord, such as too much redundant information in the routing tables of nodes, the deviation of needed times of forwarding lookup messages among searching resources whose key values are located in different areas of identifier space, some available routing information being...
Data dissemination and discovery is critical for ad-hoc wireless sensor networks. Most existing research depends on location information that is not always obtained easily, efficiently and accurately. We propose the concept of Contour-cast, a location-free data dissemination and discovery approach for large-scale wireless sensor networks. One important property of Contour-cast is that it does not...
Differential evolution (DE) algorithm is a heuristic approach that gains more interest in today's research. It finds the true global minimum regardless of the initial parameter values, fast convergence, and using few control parameters. DE algorithm is a population based algorithm like genetic algorithm using similar operators; crossover, mutation and selection. This paper addresses the restrictive...
To alleviate the data collection latency problem in mobile WSNs, we shorten the data collection path by visiting a minimal set of points in the network, which we call the {\it Stop Point Set} (SPS). A point selection method named path-points identification method has been proposed recently, which plays the same role as our SPS calculating method. However, as a clustering based method, it may not scale...
An alarming trend for the global routing table's growth factor in the interdomain IP backbone shows that Internet inter-domain routing scalability becomes an issue again. It is widely agreed upon that the rapid global routing table size growth is mainly due to the growth in the number of ASs and the wide deployments of multihoming and traffic engineering. These popular commercial practices deaggregate...
Due to the rapidly changing topology of vehicular ad hoc network (VANET), it requires the routing protocol can be able to find out comparatively more stable routes. But the routing protocols in existence are not taking the distinguishing features of vehicles and roadway into consideration, and this brought about challenges to these routing protocols' applicability in VANET. In this paper, we take...
We propose a new DSP block for use in modern high-performance FPGAs. Current DSP blocks contain fixed-bitwidth multipliers that can be combined efficiently to form larger multipliers. Our approach is similar, but includes a bypass layer following the partial product generator that exposes the compressor tree used for partial product reduction directly to the user. As a consequence, the proposed DSP...
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.