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.
It is a significant challenge to design a secure routing protocol for wireless sensor networks (WSN), because a WSN has dynamic topology, limited energy, confined computing ability and small memory size. The performance metrics usually considered when working with a WSN are power consumption, connectivity, scalability, and limited resources. Sensor nodes play the dual role of data collection and routing...
In this paper we compare the performance of the pull and push strategy in a large homogeneous distributed system. When a pull strategy is in use, lightly loaded nodes attempt to steal jobs from more highly loaded nodes, while under the push strategy more highly loaded nodes look for lightly loaded nodes to process some of their jobs. Given the maximum allowed overall probe rate R and arrival rate...
The positive effect of traffic localization in P2P systems is widely praised as it allows to decrease the amount of traffic crossing inter-ISP links. At the same time its negative effect is often overlooked. In this paper we concentrate on the biased choice of peers as a way to localize traffic in P2P BitTorrent-like file sharing systems. We demonstrate, evaluate and discuss the negative effect of...
Overlay networking has emerged as an alternative solution to solve many problems related to massive information distribution and processing tasks by providing enhanced services in application layer. For instance, overlay networks can improve data dissemination in P2P file sharing overlays and Content Distribution Networks (CDNs) in which delay is considered as a critical performance metric. A viable...
The IPv6 protocol is the next-generation IP protocol that addresses many of the shortcomings that exist in the IPv4 protocol. Some of the enhancements include increased address space, mandatory security and provisioning of stateless auto-configuration, a technique through which a new node forms its own address without the assistance of centralized host configuration servers operating in the network...
An adaptive MAC retransmission limit selection scheme is proposed to improve the performance of IEEE 802.11p MAC protocol for video streaming applications over vehicular area networks (VANETs). A multi-objective optimization framework is applied at road side unit (RSU) which jointly minimizes the probability of playback freezes and the start-up delay of the streamed video at the destination vehicle...
The overlay approach to dynamic spectrum access recently proposed in information theory allows both primary users (PUs) and secondary users (SUs) to simultaneously access the same spectrum with comparable power levels. However, the information theory approach is based on idealized assumptions that are difficult to be satisfied in practice. We propose a practical scheme with the overlay flavor for...
The volume of multimedia traffic over wireless networks has been steadily increasing over the past decade. Unlike web browsing applications, multimedia data needs to satisfy stringent delay requirements since late packets are as good as lost packets. In this paper, we present a framework for the nodes in 802.11 networks to estimate the distribution of uplink access delay in Distributed Coordination...
In a vehicular ad hoc network, vehicles can communicate with their correspondent nodes through the Internet using various wireless technologies. This kind of wireless networks brings a lot of new applications to metropolitan networks, such as online games, VoIP, etc. However, compared with traditional wireless networks, the high speed of vehicles and the limited transmission range of antennas introduce...
In sparse mobile social networks, the moving activity of nodes always happen in a specific area, which corresponds to some specific community. How to guarantee the higher packet delivery ratio while reducing forwarding delay in such networks, is a challenging issue and has not been widely investigated yet. Recently, additional super-node was introduced to ferry packets between the isolated areas....
In order to overcome the phenomenon that the existence of end-to-end path is no longer guaranteed because of intermittent connection in the opportunistic network, it is desirable to employ a special node called ferry, which moves in a specific trace and forwards data for disconnected nodes, to provide communication opportunities. In this paper, Global Ferry Scheme (GFS), which exploits multiple local...
High speed switch is one of the key components in modern networks. In this paper, we propose the Distribute and Match (DM) switch, a novel switch that achieves 100% throughput while maintaining packet order without requiring speedup of the switching fabric. The DM switch has two switching stages, where the first stage distributes the packets to the middle nodes and the second stage forwards packets...
This paper provides an indication that the distance between clients and their local DNS servers (LDNS) can have a significant negative impact on the performance of content delivery networks (CDNs). Consequently, we propose a novel peer-topeer client-side DNS mechanism that moves LDNS close to their clients while still allowing nearby clients to share the common DNS cache. Through trace-driven simulations...
This paper introduces a statistical model that allows the users of a random access-based cognitive radio network sharing a single wireless channel to evaluate the quality-of-service (QoS) capability of the network. The model captures the variation of the channel service process taking into account the statistics of the channel availability in addition to the randomness of the data traffic of the cognitive...
In this paper, we propose a dynamic secure routing game framework to effectively combat jamming attacks in distributed cognitive radio networks. We first propose a stochastic multi-stage zero-sum game framework based on the directional exploration of ad hoc on-demand distance vector (AODV) algorithms. The zero-sum game captures the conflicting goals between malicious attackers and honest nodes and...
Due to the uncertainty of transmission opportunities between mobile nodes, Delay Tolerant Networks (DTNs) exploits the opportunistic forwarding mechanism. This mechanism requires nodes to forward messages in a cooperative and selfish way. However, in the real word, most of the nodes exhibit selfish behaviors such as individual and social selfishness. At the same time, the energy is usually limited...
Today's access networks are increasingly shaped by the services that they provide to the end users. In a hybrid wireless-optical broadband access network (WOBAN), to access any service, connection requests require multi-hop communications over the wireless mesh network (WMN) and the Passive Optical Network (PON), and subsequently over the Internet to some server in the service provider's domain. To...
In this paper, we study the multicast capacity-delay tradeoff of a wireless network consisting of mobile wireless nodes and base stations. base stations are regularly placed in a square region and is the number of mobile nodes in the network. We assume that mobile nodes move according to an independent and identical distributed (i.i.d.) pattern and each desires to send packets to ...
In this paper, we study the capacity and delay scaling laws for cognitive radio networks (CRN). The primary network consists of static, randomly and evenly distributed primary users (PUs), which require high throughput with low delay. The secondary network consists of $m=O(n^{1+\delta})$ randomly and evenly distributed cognitive secondary users (SUs) with $\delta>0$, which move in different area...
End-to-end delay is an important QoS metric in sensor networks as well as any application that involves transferring of small-sized files. In this paper, we address how to minimize the end-to-end delay in a multihop wireless network. End-to-end delay is defined as the total time it takes for a single packet to reach the destination. It is a result of many factors including the length of the routing...
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.