In most of the applications of wireless sensor networks (WSN), covering the area of interest and delivering the sensed information to the sink are two fundamental functions. Extensive research associated with these tw...
详细信息
ISBN:
(纸本)9781612842325
In most of the applications of wireless sensor networks (WSN), covering the area of interest and delivering the sensed information to the sink are two fundamental functions. Extensive research associated with these two issues, such as energy efficient coverage and delay-constraint routing, can be found in the literature. However, few works combine these two issues together. Considering the fact that wireless sensors can take the responsibility of both sensing and routing, it is expected that a solution jointly considering these two issues will provide more benefit. In this paper, we consider the problem: how to find a routing path in a WSN with the maximum sensing coverage provided by the nodes on the path subject to the delay constraint. We first proved that this problem is NP-hard and then proposed a distributed algorithm based on Monte-Carlo integration method and label setting (LS) algorithm. Analysis and simulation results show that under the same time delay constraint, the proposed algorithm can find a routing path with significantly larger sensing coverage (more than 87percent in our simulation) than that was obtained considering only hop constraint.
It is a hot issue to study on how to locate the resource efficiently in P2P networks and grid computing. Chord is a structured P2P routing protocol based on DHT, with the features of fully distributed, load balancing ...
详细信息
It is commonly believed that Ant routing algorithms cannot be applied with the TCP transport layer. We show that, contrary to this belief, TCP in the transport layer still enables the adaptive algorithms to extend the...
详细信息
ISBN:
(纸本)9783540718048
It is commonly believed that Ant routing algorithms cannot be applied with the TCP transport layer. We show that, contrary to this belief, TCP in the transport layer still enables the adaptive algorithms to extend the range of load levels under which they can find efficient routing policies.
Clos Interconnection network is one of the known connection networks in processing systems and distributed systems, which is used extensively in many fields such as Telecommunication networks, ATM switches and Data tr...
详细信息
Clos Interconnection network is one of the known connection networks in processing systems and distributed systems, which is used extensively in many fields such as Telecommunication networks, ATM switches and Data transmission. In order to eliminate the blocking in such networks, various routing algorithm have been proposed, each imposing extra costs due to hardware use and re-routing algorithm. This study offers a routing algorithm which takes a blocking-avoidance approach hence avoiding related costs. There is no blocking while the primary routing is performed from the input to output. This method has the complexity of (NN) The results show that this algorithm is simpler than the algorithms previously proposed.
In wireless sensor networks, accurate and complete sensor data is important to the analysis of a phenomenon. Therefore, designing a robust sensor network is of high importance. We first derive the relationships betwee...
详细信息
ISBN:
(纸本)9781424411436
In wireless sensor networks, accurate and complete sensor data is important to the analysis of a phenomenon. Therefore, designing a robust sensor network is of high importance. We first derive the relationships between transmission power, energy consumption and robustness of the network using analytical modeling. Then, we validate our model by using linear programming to find the optimal routing algorithm that will optimize the robustness of the sensor network. The optimal robust routing algorithm is then compared with other popular routing algorithms used in sensor networks and we find that the robustness achieved varies with different routing algorithms. This demonstrates the need for a cross-layer design approach, when designing robust sensor networks. In addition, we also prove that an energy-efficient routing algorithm that optimizes the lifetime of the sensor network does not optimize the robustness of the network. By using correlation analysis on the optimal routing algorithm, we design a robust geographic routing algorithm that only utilizes local neighborhood information to obtain nearly optimal robustness performance. Our algorithm also minimizes data losses in cases when sensor nodes fail.
A crucial problem in ad hoc networks is finding an efficient and correct route between a source and a destination;however for many networks, a more important problem is providing an energy efficient route because of, ...
详细信息
ISBN:
(纸本)9781424403523
A crucial problem in ad hoc networks is finding an efficient and correct route between a source and a destination;however for many networks, a more important problem is providing an energy efficient route because of, for example, the limited battery life of the wireless nodes. Most previous routing protocols make the routing decision without taking into account the energy budget of the nodes. In addition, when using a fixed transmission power, nodes may waste power by transmitting with more power than is needed for correct reception. In position-based routing algorithms, the nodes use the geographical position of the nodes to make the routing decisions. In this paper we present several localized power-aware 313 position-based routing algorithms that increase the life-time of the network by maximizing the life time of the nodes. These new algorithms use the idea of replacing the constant transmission power of the node with an adjusted transmission power during two stages - first a lower power while discovering the neighboring nodes, and, if needed, a second higher transmission power during the routing process. We evaluate our algorithms and compare their power savings with the current power-aware routing algorithms. The simulation results show a significant improvement in the energy saving (up to 50%).
This paper presents the performance of topological multicast routing algorithms on mobile wireless ad-hoc networks. Flooding and On-Demand Multicast routing Protocol (ODMRP) are simulated and compared with Topological...
详细信息
ISBN:
(纸本)9780769529745
This paper presents the performance of topological multicast routing algorithms on mobile wireless ad-hoc networks. Flooding and On-Demand Multicast routing Protocol (ODMRP) are simulated and compared with Topological Multicast routing Protocol (ToMuRo). The scenario evaluated considers one multicast transmitter and one, two, and three multicast receivers under various mobility and transmission ranges. The behavior of 250 nodes is evaluated in terms of End to End Delay (EED), jitter, packet delivery ratio, and overhead Results reveal that ToMuRo performs better in terms of packet delivery ratio and overhead, flooding has the best behavior with jitter and ODMRP with respect to EED. In general, ToMuRo has the best performance compared to the other algorithms.
Multicast routing algorithms that are capable of providing quality of service (QoS) to its members will play an important role in future communications networks. In the paper, for the multi-constrained minimum Steiner...
详细信息
ISBN:
(纸本)0769529097
Multicast routing algorithms that are capable of providing quality of service (QoS) to its members will play an important role in future communications networks. In the paper, for the multi-constrained minimum Steiner tree problem, we proposed a CBT-based multi-constrained multicast routing algorithm(CMCMRA) and a SPH-based multi-constrained multicast routing algorithm(SMCMRA). Anlysis showed the algorithms are easy to implement and the time complexities are quite and simulation results illustrated the algorithms have features of well performance of cost and guarantee QoS multiple constraints efficiently.
The Internet research community is making a great effort in order to define efficient network management and, control functions. The goal is to make the best use of the network infrastructure, while meeting the users&...
详细信息
ISBN:
(纸本)9781424407385
The Internet research community is making a great effort in order to define efficient network management and, control functions. The goal is to make the best use of the network infrastructure, while meeting the users' requirements at the same time. One of the keys to achieve such a goal is the routing algorithm. A wide variety of traffic engineering and QoS routing algorithms have been proposed aiming to optimize resources and provide QoS to the users. However, the performace of such algorithms have usually been evaluated through simulations. In this paper, we present an architecture which enables to experiment with different routing algorithms in a real network. The performance of the routing algorithms can then be evaluated in terms of number of admitted flow requests, average delay, packet loss and jitter. We describe how we implemented all the components of the proposed architecture and how we setup a testbed consisting of Linux PCs. Finally, we illustrate an experiment we conducted to demonstrate the operation of our architecture.
The cellular network systems are expected to evolve into Multi-hop Cellular Network (MCN). While a mobile terminal and the base station have a direct connection in a conventional cellular network, in MCN a mobile term...
详细信息
ISBN:
(纸本)9780769527772
The cellular network systems are expected to evolve into Multi-hop Cellular Network (MCN). While a mobile terminal and the base station have a direct connection in a conventional cellular network, in MCN a mobile terminal may reach the base station via relays by using multi-hopping. The relay can be either mobile terminal referred to client relay or dedicated relay referred to infra relay that has capabilities like those of the base station. In this paper, we focus on routing mechanism in multi-hop cellular networks. In particular, we study routing performance metrics for multi-hop cellular networks which consider energy efficiency and the relay capabilities.
暂无评论