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.
In this paper, we address the problem of efficient routing in delay tolerant network. We propose a new routing protocol dubbed as ORION. In ORION, only a single copy of a data packet is kept in the network and transmitted, contact by contact, towards the destination. The aim of the ORION routing protocol is twofold: on one hand, it enhances the delivery ratio in networks where an end-to-end path does...
In this paper we investigate the benefits of placing optimal number of sinks for a wireless sensor network (WSN) to prolong the network lifetime, provided that the number of hops from each sensor to its nearest sink is no more than h>=1 and the sink location space is given in advance. We first formulate this problem as a joint optimization problem, which consists of finding the optimal number of...
The association policy in current IEEE 802.11 networks usually considers Received Signal Strength Indication (RSSI) to be the only metric to capture access link quality. However, when a Mesh Client (MC) in IEEE 802.11-based Wireless Mesh Network (WMN) needs to be associated with the most appropriate Mesh Access Point (MAP), the quality of both the access link and the routing path in mesh backhaul...
Research and industries are recently more interesting and attracting to the Vehicular Ad hoc Networks (VANETs) development domain. They contribute to safer and more efficient roads by providing timely and accuracy information to drivers and authorities. Thus, the definition of a quality of service routing protocol for VANETs is one of their challenges. In this paper, we propose QoSBeeVanet, a new...
In a target detection application, rational adversary targets that are conscious of the deployed location of sensor nodes are capable of planning a path in order to avoid being detected by sensor nodes. Probing sensor communication is one of the means that are used by adversary targets to get the necessary information. Therefore, this paper investigates how to reduce the sensor communication exposure...
Wireless community networks are mesh networks built by volunteers which own, configure, and manage their wireless node. Such networks are prone to either unintentional (e.g. misconfiguration) or intentional node misbehavior. This paper proposes a fully distributed trust-based routing framework, tightly integrated with OLSR, which is the most exploited routing protocol in real world wireless community...
The paper proves that it is possible to optimize application-level multicast operation from the viewpoint of traffic flows. A modification of the FreePastry/Scribe application is proposed to enable cooperation with the IETF ALTO (Application- Layer Traffic Optimization) protocol. Consequently, the overlay topology is constructed taking into account the underlying network topology. The presented results...
Multi-Packet Reception (MPR) enables simultaneous receptions from different transmitters to a single receiver, which has been demonstrated to bring capacity improvement in wireless network. However, MPR does not improve the transmission capability of intermediate relay nodes in a multi-hop routing and thus these nodes may become the bottlenecks for increasing throughput despite of great reception...
Data aggregation is one of the main methods to conserve energy in wireless sensor networks (WSN). Redundant data can be aggregated at intermediate nodes of a WSN reducing the number of messages exchanged and, consequently, reducing communication costs. Most data aggregation protocols are generally based on a static routing scheme. Although those protocols can save energy by eliminating data redundancy,...
Maximizing the aggregate network performance over constrained computing and communication resources has been an active research area. Real-time wireless sensor network (RTWSN) is an important application of real-time and networked embedded systems. Due to the severe resources constraints and associated real-time requirements, new challenges arise in RTWSN. In this paper, we study an integrated scheme...
Traffic analysis is considered the most powerful strategy of disclosing the hidden communication relations in an anonymous communication system. Statistical traffic analysis attacks are even more subtle in that the attackers are usually eavesdroppers who do not modify the network's behaviors. Moreover, the attackers even do not need to look into the traffic content, which may be encrypted, in order...
Wireless links are often unreliable and prone to transmission error due to varying channel conditions. These can degrade the performance in wireless networks, particularly for applications with tight quality-of-service requirements. A common remedy is to use channel coding where the transmitter node adds redundant bits to the transmitted packets in order to reduce the error probability at the receiver...
The decrease of AS-level route length, called Internet flattening, has a significance impact on the the design of next generation global routing system. However, there is little quantitative assessment of its factors. We report our findings through monitoring and analysis of inter-domain routing. Using BGP routing table and update messages from RouteViews and RIPE RIS, we explore Internet flattening...
Traffic Engineering (TE) aims at distributing traffic through routes to suit a specific goal. BGP addresses TE in a very specific way: it is a single path system, and mixes traffic control and route dissemination by letting attributes influence the choice of the best path. Several techniques have been proposed but due to BGP characteristics they have high complexity requirements such as the need for...
The paper presents a concept of a rating algorithm aiming at overall peer-to-peer traffic reduction (and locality awareness) and decrease of load on costly links, thus diminishing operator's costs. The rating algorithm is not only performed by a sole Oracle, as is typically proposed, but its operation is also supported by a similar entity located in other domains. Due to this concept, a usually omitted...
The Border Gateway Protocol (BGP) is the de facto interdomain routing protocol on the Internet which controls the packet forwarding behavior on the data plane. It has significant impact on the well-being of the global Internet. Over the past ten years, there has been a large body of studies conducted on evaluating and improving the BGP performance. These studies develop tools using BGP data for identifying...
We present a formal distributed algorithm that can be used for the deployment of arbitrary routing policies in a network infrastructure that attempts to complete the ideas proposed by Griffin et al. We prove that our algorithm is based on a function that satisfies conditions proposed by Bertsekas. These conditions guarantee that the distributed version of the algorithm will converge and yield the...
In the paper, we consider the end-to-end routing and link scheduling problem for multi-hop wireless sensor networks. The efficient link scheduler under our consideration is intended to assign time slots to different users so as to minimize channel usage subject to constraints on data rate, delay bound, and delay bound violation probability. We also present a coupled robust multi-path routing structure...
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.