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 poor performance of TCP in multihop ad hoc networks is mainly attributed to the inefficient interaction among different protocol layers in previous literature, while the heavy load caused by end-to-end TCP acknowledgements (ACKs) with limited information is usually ignored. In this paper, we propose a novel incorporating ACK transfer scheme, IACK, to alleviate its impact. In IACK, TCP acknowledgements...
This paper provides parameter setting and 2-D local stability conditions for TCP/RED networks. In general, a network cannot avoid congestions due to the limit of network capacity. The RED scheme is one of the representative AQM that was proposed to avoid and alleviate network congestions. However, the issue of network stability with many TCP subscribers needs to be considered when setting the RED...
In this paper, a greedy sub-channel redistribution routing scheme (GSRRS) is proposed for multi-hop wireless OFDMA networks. In GSRRS, between any two neighboring nodes, different sub-channels are routed over different paths including the direct one-hop path and the two-hop path with one intermediate node. Compared to the traditional routing scheme where all the sub-channels route over the same path,...
Delay Tolerant Networks (DTNs) are able to provide communication services in challenged networks where the end-to-end path between the source and destination does not exist. In order to increase the probability of delivery, DTN routing mechanisms may require nodes in the network to store and carry messages in their local buffer and replicate many copies. When the limited buffer is consumed, choosing...
Due to the dynamic topology and non infrastructure, network participants cooperate with their neighbors to route packets. The lack of centralized services allows mobile ad hoc networks to be easily and swiftly deployed, but make it difficult to check others' identities on the other hand. Cryptographic tools have been introduced to secure group communications, such as private and public key infrastructure...
Providing the required quality of service (QoS) for clients in a wireless mesh network (WMN) is a challenging task. This is due to the complex architecture of the WMN and unpredictable behavior of the wireless links and the intermediate nodes. This can be alleviated by introducing a cognitive mechanism within the WMN. In this paper, a WMN is developed, where the data traffic is forwarded in a cognitive...
An important issue of supporting multi-user video streaming over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resources while, at the same time, to meet each video's QoS (quality of service) requirement. In this work, we study the problem of video scheduling over multi-channel multi-radio multi-hop networks with the goals of minimizing...
Proxy mobile IPv6 (PMIPv6), a network-based IP mobility solution, is a promising approach for mobility management in all-IP wireless networks. How to enhance its handoff-related performance, such as handoff delay and signaling cost, is an important issue. Current solutions rely on approaches such as fast handoff, routing optimization and paging extension. However, the case of many correlated mobile...
It is known that there exist Triangle Inequality Violations (TIVs) with respect to network Quality of Service (QoS) metrics such as latency between nodes in the Internet. This motivates the exploitation of QoS-aware routing overlays. To find an optimal overlay route, we would usually need to examine all the possible overlay routes. However, this requires both measuring QoS between all node pairs and...
In this paper, we propose a novel routing metric, namely biased delivery probability (BDP), for measuring the wireless node's capacity of forwarding data packet to the destination. BDP essentially assigns different weights to the multi-paths information associated with different hop counts. An theoretical theory is established to compute the weights for different scenarios. Using BDP routing metric,...
We consider the problem of maximizing network revenue from the perspective of bandwidth allocation and route selection. The objective is to perform offline maximization of revenue from served demands in the context of self-similar (long range dependent) traffic. We use an alpha-stable distribution for the aggregate demand volume to capture the appropriate level of traffic burstiness. We take a centralized...
In the following paper, we study the tradeoff between network lifetime and network utility for energy-constrained wireless sensor networks (WSNs) with the real-time requirement. 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. For real-time requirement, we set up real-time...
Traffic grooming in wavelength division multiplexing networks merges low-speed flows into large capacity pipes so that the bandwidth discrepancy between them will not lead to underutilization of resources. Dynamic grooming deals with requests for wavelength allocation based on a dynamic pattern of arrivals in contrast to the situation of static grooming in which the pattern of arrivals must be previously...
Recently, explicit Control Protocol (XCP), Rate Control Protocol (RCP), and Adaptive Proportional-Integral Rate Control Protocol (API-RCP) have been proposed for congestion control, with the main objective of achieving fair and maximum bandwidth utilization. However, studies reveal that both RCP and XCP may suffer continuous oscillations due to misestimating the bottleneck link capacity, and API-RCP...
Network coding is a promising technology that can effectively improve the efficiency and capacity of multihop wireless networks by exploiting the broadcast nature of the wireless medium. However, current packet routing schemes do not take advantage of the network coding, and the benefits of network coding have not been fully utilized. To improve the performance gain of network coding, in this paper,...
This paper investigates the network performance loss of using only single-path routing when multiple paths are available. The performance metric is the aggregate utility achieved by the joint optimization of congestion control and routing. As computing the exact loss for a general network topology is NP-hard, we develop analytical bounds on this "cost of not splitting". Our bound is independent...
The task of routing in epidemic networks faces certain difficulties involving minimizing the delivery delay with a reduced consumption of resources. Every node has severe power constraints and the network is also susceptible to temporary but random failure of nodes. In the previous work, the parameter of mobility has been considered a constant for a certain setting. In our setting, we consider a varying...
In view of the dense and complex space network topologies envisioned for the future, the management of congestion control is a prominent issue that deserves a particular attention. Given the challenging peculiarities of interplanetary environments, this paper focuses on the advantages offered by storage-based routing and on potentials of implementing Random Early Detection (RED) and Explicit Congestion...
Network virtualization is becoming an irresistible trend for building future Internet. It enables multiple virtual networks running on the same physical substrate, by which network service can be deployed on a customized virtual network to get better performance. In this paper, we propose a method to achieve more reliable live streaming service by deploying it over multiple virtual networks, namely...
Mobile ad hoc social networks are self-configuring social networks that connect users using mobile devices, such as laptops, PDAs, and cellular phones. These social networks facilitate users to form virtual communities of similar interests or commonalities. This paper proposes a concrete, generalized, and novel framework to develop a fully functional mobile ad hoc social network. The proposed framework...
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.