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.
Multipath Routing plays an important role in communication networks. Multiple disjoint paths can increase the effective bandwidth between pairs of vertices, avoid congestion in a network and reduce the probability of dropped packets. In this paper, we built mathematical models for arc-disjoint paths problem and vertex-disjoint paths problem respectively, and then proposed polynomial algorithms for...
In virtue of its widespread application scenarios, especially in battlefield communication, disaster rescue, satellite and deep-space transmission, Delay-disruption Tolerant Network (hereinafter referred to as DTN) has become one of the most attractive focuses in research for future Internet. Due to the intermittent connectivity, mobility of nodes, signal interference, jamming in DTN, there exist...
We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the deadline is one of its edges. Targets arrive continuously over time on the edge opposite the deadline, and move towards the deadline at a fixed speed. The goal for the vehicle is to maximize the fraction of targets that are captured...
The (n, k)-arrangement graph An,k is a generalization of the well known star graph and the alternating group graph. We first present a constant time routing algorithm that allows two groups of An-1,k-1 's to exchange their data in a one-to-one fashion. We then use this routing algorithm to develop an optimal broadcasting algorithm, an optimal algorithm for computing the general prefix sums as well...
Event detection and notification is a common task in a wireless sensor networks (WSN). Efficient data aggregation and minimization of energy consumption are the great research challenges in WSN. In WSN, aggregated event information is more important than individual event information for energy saving and reliability. Proximity queries or query approximation can be used to reduce the complexity of...
In the following paper, we study the tradeoff between network utility and network lifetime for energy-constrained wireless sensor networks (WSNs). By introducing a parameter r, we combine these two objectives into a single weighted objective, and consider rate control and routing in this tradeoff framework simultaneously. First, using the dual decomposition method, we decompose the tradeoff model...
This paper imports the concept of domain to design a resource locating model with local domain first based on Kademlia protocol, which is abbreviated to LDF-KAD, to refer the small world phenomenon and the characteristic of localized dataflow first on the Internet. The LDF-KAD model includes two layers structure that are super node layer and general layer. And super node layer consists of all super...
Replication technique is an effective method for improving the availability of data and enhancing performance, however, it also brings significant costs in storage space and traffic. In this paper, we study how to decrease redundant traffic cost and redundant replicas for replication in structured P2P overlay by topology optimization. We develop a hierarchical proximity-aware P2P overlay with dominating...
In wireless sensor networks (WSNs), some unavailable areas often formes because some sensor nodes become unavailable due to energy exhausted, congestion, or disaster. In this paper, we propose a new micro sensor multi-path routing protocol (MSMRP) to cross around the unavailable areas when building up the routes. And we design a neighbor node table exchanging mechanism that can avoid the multiple...
The fleet size and mix vehicle routing problem (FSMVRP) consists of defining the type, the number of vehicles of each type, as well as the order in which to serve the customers with each vehicle when a company has to distribute goods to a set of customers geographically spread, with the objective of minimizing the total costs. In this paper, we study a real-life FSMVRP with time windows (FSMVRPTW)...
In sensor network applications, data gathering mechanisms, which are based on multi-hop forwarding, can be expensive in terms of energy. This limitation challenges the use of sensor networks for applications that demand a predefined operational-lifetime. To avoid this problem, using of mobile element (ME) as a mechanical data carrier has emerged as a promising approach. However, practical considerations...
The recursive dual-net is a newly proposed interconnection network for of massive parallel computers. The recursive dual-net is based on a recursive dual-construction of a base network. A k-level dual-construction for k > 0 creates a network containing (2n0)2k nodes with node-degree d0 + k, where no and do are the number of nodes and the node-degree of the base network, respectively. The recursive...
Recent advances in networked systems and wireless communications have set the stage for applications with wide-ranging benefits. Perhaps the most natural problem in such systems is the ??efficient?? propagation of locally stored data. In order to address this problem, the notion of greedy embedding was defined by Papadimitriou and Ratajczak, where the authors conjectured that every 3-connected planar...
As more and more services are provided by servers via the Internet, Denial-of-Service (DoS) attacks pose an increasing threat to the Internet community. A DoS attack overloads the target server with a large volume of adverse requests, thereby rendering the server unavailable to ??well-behaved?? users. Recently, the novel paradigm of traffic ownership that enables the clients of Internet service providers...
According to the cross relationship between administrative division map and the graph of backbone routing system, we classify the routing nodes by map-coloring technology which is based on "triangular element". Then, we design the "tricolor loop" network architecture and its routing policy. In order to give a better description about this scheme, we take the backbone routing system...
Researching on delay tolerant networks is an emerging field. Many researchers are dedicated to the approach of the routing algorithms and its applications. With sufficient energy in the core-nodes in the networks, a nested source spray and wait routing algorithm, which is ameliorated from source spray and wait routing algorithm, has been put forward in this paper. The simulation results indicate that...
A fundamental problem in P2P systems is content-based full-text search. Traditional approaches have either been centralized or use flooding to ensure accuracy of the results returned. In this paper, we present the design of a distributed P2P system (S-Peer) that supports semantics-based content searches of relevant documents. S-Peer nodes with semantically similar content are grouped into one semantic...
E-sports, multiplayer online games or similar Internet applications need peer-to-peer network to offer fast response and adaptability. Those typical P2P file sharing protocols can't meet this requirement good enough. This paper introduces an optimized double-layer overlay network, called GMeridian, which defines a node's placement by measuring its round-trip latency to other nodes. The results of...
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...
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 ant colony algorithm (IACA) was proposed...
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.