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...
The growth in broadband access and increases in terminal capability have enabled us to provide large-scale multimedia services. The traditional unicast architecture cannot support such a service because the transportation from a content server to many end hosts causes the overload to a content server. Overlay multicast techniques have been proposed to solve this problem. This high-layer technology...
This paper deals with the evaluation of the end-to-end packet delay for a lossy network where network coding is adopted to achieve better performance. Differently from previous published papers on this subject, connection oriented services are assumed, this means that packets have to be in-order received and wait at the receiver buffer till all the previous ones have been correctly delivered. The...
Ethernet networks are evolving from the enterprise to the carrier thus facing new demands and requirements. Therefore, a set of new control approaches are being defined for Ethernet. Amongst these, IEEE 802.1aq Shortest Path Bridging (SPB) aims to assure the transmission of unicast and multicast frames on the shortest path in a bridged network. Three protocols have been proposed for the control of...
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,...
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...
A large number of network applications today allow several users to interact together using the many-to-many service mode. A many-to-many session consists of group of users (we refer to them as members), where each member transmits its traffic to all other members in the same group. We address the problem of designing and provisioning of WDM networks to support many-to-many traffic grooming. Our objective...
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,...
To achieve both access control and service availability, many researchers have attempted to design an efficient key management system for secure multicast services. Periodic and batch rekeying (PBR) is well known for its significant improvement in rekeying efficiency for large-scale and highly dynamic groups at the cost of relaxing some forward secrecy. However, PBR is uncontrollably vulnerable in...
IEEE 802.15.4 standard is designed to achieve low-power transmissions in low-rate and short-distance wireless personal area networks (WPANs). For the sake of reducing the control overheads, the modified CSMA/CA protocol used by 802.15.4 does not have the hidden device protection mechanism, such as RTS/CTS mechanism. Previous studies indicate that the probability of any two devices in a infrastructure...
Wireless Sensor Networks (WSNs) consist of spatially-distributed autonomous sensors that can cooperatively monitor physical and environmental conditions. Because of sensors' resource-constraints in terms of size, power, and bandwidth, one of the fundamental objectives in WSNs is improving energy-efficiency. In this paper, utilizing sensors with variable sensing radii, we propose a group-based technique...
We address multi-radio networks, i.e., wireless networks where the nodes are equipped with multiple air interfaces. We analyze, both analytically and via simulation, various gains that the multi-radio environment can provide. First we investigate the gain in network connectivity by modeling the topology of a multi-radio network by a multigraph. The gain is captured by introducing the novel graph theoretic...
Intuitively, many wireless and sensing applications benefit from knowledge of network boundaries. Many virtual coordinate constructions rely on the furthest set of nodes as beacons. Network edges may also bound routing holes in the network, regions of failure due to environmental effects, or indicate the need for additional deployment. In this paper we propose an algorithm to identify nodes and links...
In this paper we consider a network of distributed sensors that are trying to measure a parameter of interest cooperatively, by exchanging their acquired information repeatedly over fading channels. We consider different ways of using the available bandwidth, in terms of what each node can send to its neighbors. More specifically, we characterize the impact of local fusion and show how it is a suitable...
The fair allocation of the resources among different nodes is one of the critical problems in wireless mesh networks. Existing solutions mainly focus on rate-limitation policies or distributed fair MAC schemes at the potential expense of total network utilization. This paper investigates a special starvation problem among TCP flows that are different hops away from the BS, as well as the recently...
Burst contention is a well-known challenging problem in optical burst switching (OBS) networks. Contention resolution approaches are always reactive and attempt to minimize the BLR based on local information available at the core node. On the other hand, a proactive approach that avoids burst losses before they occur is desirable. To reduce the probability of burst contention, a more robust routing...
The deployment of large-scale wireless sensor networks presents major challenges whose solution requires the design and development of robust and time-efficient protocols. In this work, we focus on the design of an efficient and robust protocol aiming to rapidly configure highly populated networks. Our main effort goes towards the definition of a fast collision resolution protocol for conveying the...
This paper analyzes TCP fairness in IEEE 802.11-based wireless mesh networks (WMNs). Fairness of bandwidth sharing is important for equitable network access by various users. With our Indoor WMN testbed, we observe that even though TCP flows have similar round trip time and loss probability, they encounter an unfairness problem. Especially, when TCP flows experience high TCP ACK losses (around 20%),...
When designing network topology, we need to simultaneously consider multiple criteria, such as network cost and reliability. Therefore, the author applied the analytic hierarchy process (AHP) to network topology evaluation. However, the time required to construct a candidate topology set drastically increases as the network scale grows. So, the author proposed an efficient method for constructing...
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.