Home  About us  Contact
 

Source Node (source + node)

Distribution by Scientific Domains
Mathematics and Statistics30%

Selected Abstracts

AODV-RIP: improved security in mobile ad hoc networks through route investigation procedure

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 7 2010
Byung-Seok Kang
Abstract Most routing protocols in mobile ad hoc networks (MANETs) place an emphasis on finding paths in dynamic networks without considering security. As a result, there are a number of attacks that can be used to manipulate the routing in MANET. A malicious node that sends a modified control message to an intermediate node can disturb the network using a control message. To solve this problem, we introduce AODV protocol with route investigation procedure (AODV-RIP). It uses two additional control messages to defeat security attacks that can occur in AODV routing protocol. When an intermediate node that is on the path between the source node and the destination node receives a control message, it sends a Rroute Investigation Request (IREQ) message to the destination node in order to check the reliability of the control message. According to the existence of Route Investigation Reply (IREP), the intermediate node decides whether it transmits the control message to the source node or not. Consequently, the intermediate node that receives the control message confirms that it is using two additive control messages: IREQ and IREP. Through this investigation procedure, the source node can obtain a reliable path for transmitting data packets to an intentional destination node. The simulation results show an improvement in the packet delivery ratio and end-to-end delay at the expense of a moderate increase of the control message overhead compared with the current routing protocols. Copyright © 2009 John Wiley & Sons, Ltd. [source]

Competitive flow control in general multi-node multi-link communication networks

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 2 2008
Ismet Sahin
Abstract In this paper, we consider the flow control in a general multi-node multi-link communication network with competing users. Each user has a source node, a destination node, and an existing route for its data flow over any set of links in the network from its source to its destination node. The flow rate for each user is a control variable that is determined by optimizing a user-specific utility function which combines maximizing the flow rate and minimizing the network congestion for that user. A preference parameter in the utility function allows each user to adjust the trade-off between these two objectives. Since all users share the same network resources and are only interested in optimizing their own utility functions, the Nash equilibrium of game theory represents a reasonable solution concept for this multi-user general network. The existence and uniqueness of such an equilibrium is therefore very important for the network to admit an enforceable flow configuration. In this paper, we derive an expression for the Nash equilibrium and prove its uniqueness. We illustrate the results with an example and discuss some properties and observations related to the network performance when in the Nash equilibrium. Copyright © 2007 John Wiley & Sons, Ltd. [source]

A new delay-constrained algorithm for multicast routing tree construction

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 10 2004
Mohamed Aissa
Abstract New multimedia applications provide guaranteed end-to-end quality of service (QoS) and have stringent constraints on delay, delay-jitter, bandwidth, cost, etc. The main task of QoS routing is to find a route in the network, with sufficient resources to satisfy the constraints. Most multicast routing algorithms are not fast enough for large-scale networks and where the source node uses global cost information to construct a multicast tree. We propose a fast and simple heuristic algorithm (EPDT) for delay-constrained routing problem for multicast tree construction. This algorithm uses a greedy strategy based on shortest-path and minimal spanning trees. It combines the minimum cost and the minimum radius objectives by combining respectively optimal Prim's and Dijkstra's algorithms. It biases routes through destinations. Besides, it uses cost information only from neighbouring nodes as it proceeds, which makes it more practical, from an implementation point of view. Copyright © 2004 John Wiley & Sons, Ltd. [source]

A comparison of congestion control and time slot algorithms in Internet transmission performance

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 1 2002
Chyan Yang
Abstract The characteristics of TCP and UDP lead to different network transmission behaviours. TCP is responsive to network congestion whereas UDP is not. This paper proposes two mechanisms that operate at the source node to regulate TCP and UDP flows and provide a differential service for them. One is the congestion-control mechanism, which uses congestion signal detected by TCP flows to regulate the flows at the source node. Another is the time-slot mechanism, which assigns different number of time slots to flows to control their flow transmission. Based on the priority of each flow, different bandwidth proportions are allocated for each flow and differential services are provided. Simulation results show some insights of these two mechanisms. Moreover, we summarize the factors that may impact the performance of these two mechanisms. Copyright © 2001 John Wiley & Sons, Ltd. [source]

Graph-theoretical identification of dissociation pathways on free energy landscapes of biomolecular interaction

JOURNAL OF COMPUTATIONAL CHEMISTRY, Issue 4 2010
Ling Wang
Abstract Biomolecular association and dissociation reactions take place on complicated interaction free energy landscapes that are still very hard to characterize computationally. For large enough distances, though, it often suffices to consider the six relative translational and rotational degrees of freedom of the two particles treated as rigid bodies. Here, we computed the six-dimensional free energy surface of a dimer of water-soluble alpha-helices by scanning these six degrees of freedom in about one million grid points. In each point, the relative free energy difference was computed as the sum of the polar and nonpolar solvation free energies of the helix dimer and of the intermolecular coulombic interaction energy. The Dijkstra graph algorithm was then applied to search for the lowest cost dissociation pathways based on a weighted, directed graph, where the vertices represent the grid points, the edges connect the grid points and their neighbors, and the weights are the reaction costs between adjacent pairs of grid points. As an example, the configuration of the bound state was chosen as the source node, and the eight corners of the translational cube were chosen as the destination nodes. With the strong electrostatic interaction of the two helices giving rise to a clearly funnel-shaped energy landscape, the eight lowest-energy cost pathways coming from different orientations converge into a well-defined pathway for association. We believe that the methodology presented here will prove useful for identifying low-energy association and dissociation pathways in future studies of complicated free energy landscapes for biomolecular interaction. © 2009 Wiley Periodicals, Inc. J Comput Chem, 2010 [source]

Network disconnection problems in a centralized network

NAVAL RESEARCH LOGISTICS: AN INTERNATIONAL JOURNAL, Issue 7 2007
Young-Soo Myung
Abstract We consider three network disconnection problems in a centralized network where a source node provides service to the other nodes, called demand nodes. In network disconnection problems, each demand node gets a certain benefit when connected to a source node and a network attacker destroys edges to prevent demand nodes from achieving benefits. As destroying edges incurs expenses, an attacker considers the following three different strategies. The first is to maximize the sum of benefits of the disconnected nodes while keeping the total edge destruction cost no more than a given budget. The second is to minimize the total destruction cost needed to make a certain amount of benefits not accomplished. The last is to minimize the ratio of the total destruction cost to the benefits not accomplished. In this paper, we develop exact algorithms to solve the above three problems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 [source]

A polynomial-time algorithm to find shortest paths with recourse

NETWORKS: AN INTERNATIONAL JOURNAL, Issue 2 2003
J. Scott Provan
Abstract The Shortest Path with Recourse Problem involves finding the shortest expected-length paths in a directed network, each of whose arcs have stochastic traversal lengths (or delays) that become known only upon arrival at the tail of that arc. The traveler starts at a given source node and makes routing decisions at each node in such a way that the expected distance to a given sink node is minimized. We develop an extension of Dijkstra's algorithm to solve the version of the problem where arclengths are nonnegative and reset after each arc traversal. All known no-reset versions of the problem are NP-hard. We make a partial extension to the case where negative arclengths are present. © 2003 Wiley Periodicals, Inc. [source]

Energy-efficient target detection in sensor networks using line proxies

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 3 2008
Jangwon Lee
Abstract One of the fundamental and important operations in sensor networks is sink,source matching, i.e. target detection. Target detection is about how a sink finds the location of source nodes observing the event of interest (i.e. target activity). This operation is very important in many sensor network applications such as military battlefield and environment habitats. The mobility of both targets and sinks brings significant challenge to target detection in sensor networks. Most existing approaches are either energy inefficient or lack of fault tolerance in the environment of mobile targets and mobile sinks. Motivated by these, we propose an energy-efficient line proxy target detection (LPTD) approach in this paper. The basic idea of LPTD is to use designated line proxies as rendezvous points (or agents) to coordinate mobile sinks and mobile targets. Instead of having rendezvous nodes for each target type as used by most existing approaches, we adopt the temporal-based hash function to determine the line in the given time. Then the lines are alternated over time in the entire sensor network. This simple temporal-based line rotation idea allows all sensor nodes in the network to serve as rendezvous points and achieves overall load balancing. Furthermore, instead of network-wide flooding, interests from sinks will be flooded only to designated line proxies within limited area. The interest flooding can further decrease if the interest has geographical constraints. We have conducted extensive analysis and simulations to evaluate the performance of our proposed approach. Our results show that the proposed approach can significantly reduce overall energy consumption and target detection delay. Copyright © 2007 John Wiley & Sons, Ltd. [source]

An energy-efficient multipath routing protocol for wireless sensor networks

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 7 2007
Ye Ming Lu
Abstract The energy consumption is a key design criterion for the routing protocols in wireless sensor networks. Some of the conventional single path routing schemes may not be optimal to maximize the network lifetime and connectivity. In this paper, we propose a distributed, scalable and localized multipath search protocol to discover multiple node-disjoint paths between the sink and source nodes. We also propose a load balancing algorithm to distribute the traffic over the multiple paths discovered. We compare our proposed scheme with the directed diffusion, directed transmission, N -to-1 multipath routing, and the energy-aware routing protocols. Simulation results show that our proposed scheme has a higher node energy efficiency, lower average delay and control overhead than those protocols. Copyright © 2006 John Wiley & Sons, Ltd. [source]

Approximation algorithms for the k-source multicast tree construction problem

NETWORKS: AN INTERNATIONAL JOURNAL, Issue 3 2006
Paraskevi Fragopoulou
Abstract Given an undirected graph with nonnegative weights on its edges, a group of source nodes, and a group of destination nodes, we investigate the problem of constructing a multicast tree that minimizes the sum of distances from a destination node to all sources. This problem has been proven to be NP-complete. In this article, we show that there is a point c of the graph such that a shortest paths tree constructed from c is a 2-approximation to the problem, a significant improvement over the previous results, and we present an efficient approximation algorithm. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(3), 178,183 2006 [source]