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.
Wimax is an broadband wireless technology based on IEEE 802.16. It is very helpful and cheaper than other possible solutions. It is purely based on the 4G technology for the upcoming generation. In wireless technology the major problem is speed, Quality of Service, data rates in order to overcome that they going for some valuable technology. In this paper we consider WIMAX and WLAN for controlling...
An opportunistic contact between two mobile devices takes place when they are within communication range of each other. Typically, cyber-physical environments comprise a number of mobile devices that are likely to make opportunistic contacts in time and space. In the recent past, researchers have exploited opportunistic links mostly for routing and content sharing. However, less attention has been...
We propose a connectivity-based routing protocol (named CRP) for underwater wireless sensor networks (UWSNs). CRP considers the reliability issue due to high error rate in UWSNs. Hence, during forwarding, a node with the highest connectivity to the sink is selected as a next forwarding node. Using the NS-2 simulator, CRP is compared against a localization-free routing protocol in UWSNs (i.e. H2-DAB)...
In this paper, a distributed traffic-balancing routing protocol is proposed for multi-sink industrial wireless sensor networks that effectively distributes traffic from sources to sinks. Each node has a gradient field that is used to decide on a neighbor node to reach a sink. The node's gradient index contains (1) the distance cost from source to a respective sink, and (2) traffic information from...
In opportunistic networks, nodes have no prior knowledge of the routes to forward the information to its intended destination. Message transfer without generating excessive traffic poses a challenge in these networks. Improvements in message routing/forwarding in opportunistic networks can be achieved by exploiting nodes that exhibit a high level of popularity or influence within the network. Based...
We investigate the impact of a protocol-level cooperation idea in a wireless multiple-access system. By dynamically and opportunistically exploiting spatial diversity among the source users, a packet is delivered to the common destination through either a direct link or through cooperative relaying by intermediate source nodes that have a statistically better channel to the destination. The traffic...
This paper studies practical backpressure routing strategies in WiFi-based Mesh Networks (WMN). It is practical in the sense that, unlike previous theoretical centralized algorithms, we present a distributed implementation of the algorithm with low queue complexity (i.e., one finite data queue at each node) to deal with any-to-any communications. To our knowledge, this is the first practical study...
In this paper, we propose a distributed traffic-aware routing system for wireless sensor networks with multiple sinks. In multisink networks, traffic moving toward one sink may congest that moving toward others. The algorithm presented here considers the traffic of surrounding neighbors before jumping to any sink. We accomplish this by building, for each single sink, a gradient field and using gradient...
IP lookup is one of the key functions in the design of core routers. Its efficiency determines how fast a router can forward packets. As new content is continuously brought to the Internet, novel routing technologies must be developed to meet the increasing throughput demand. Hash-based lookup schemes are promising because they have low lookup delays and can handle large routing tables. To achieve...
The separation between edge and core addresses has been proposed to address the scalability problem of the Internet routing system. One main challenge is to design an efficient mapping mechanism for the two address spaces. The layer structure is attractive because of its scalability and simple index mechanism, while existing layered mapping system lacks a clear structure study and faces serious deployment...
Epidemic Routing offers a reliable approach to transmitting data in opportunistic networks, which has developed a few of variations so far. However, these algorithms have some redundant control overhead in sensing neighbor nodes and exchanging data packets. To address the issue, we propose a high-efficiency low-delay routing algorithm based on exchange of increments in packet indexes. Our algorithm...
In order to reduce the maintenance cost of resource index table of the mobile nodes in the MP2P network, use the edge resource of network enough, and parallel process the mobile task of network, we propose the resource interactive technology based on genetic algorithm to make sure that the mobile node could adapt the change of routing actively during the resource interaction. The simulation experiments...
We propose a dual TCAM architecture - DUOS, for routing tables. Four memory management schemes for TCAMs also are proposed and evaluated. DUOS and our memory management schemes support control-plane incremental updates without delaying data-plane lookups. Compared to other TCAM architectures such as CAO OPT [19] that support incremental updates without delaying lookups, DUOS offers reduction in power...
The complex multi-attribute query processing in the large-scale distributed systems is a research topic focused by both academia and industry. This paper introduces a common architecture of the multi-dimensional data range queries based on the P2P network and constructs a virtual hierarchical tree based on space division which ensures that the exploration of the relevant query regions occurred between...
This paper considers the problem of routing packets across a multi-hop network consisting of multiple sources of traffic and wireless links with stochastic reliability and a broadcast nature. Opportunistic routing relies on the following principle. Each packet transmission can be overheard by a random subset of receiver nodes among which the next relay can be selected opportunistically. This paper...
Trust models studied before evaluated trust degree by the previous interactions of entities in ad hoc networks within a protocol. However, this way is not accurate and difficult to decide the trust value. The basic difficulty lies in the fact that trust information is often fuzzy and incomplete in an open network environment. The performance of mobile ad hoc network also is constrained by residual...
In this paper, we sought to understand the reasons causing failures and delays of message delivery in Delay Tolerant Networks (DTN), and to use this understanding for improving the network. By studying two real-world datasets, we found that node isolation is prevalent, which largely accounts for the inefficiencies in DTN's message delivery. In addition, by analyzing nodes' contact-location relationship,...
Although multi-path routing protocols are more complicated to design than single-path based ones, they can be more resilient to route failures. Also, they can achieve a load balancing and hence lower end-to-end delay of transmitted messages in between a source and destination. Such advantages of multi-path routing can be significant in tactical wireless networks, where the messages transmitted are...
The existing opportunistic protocols of delay tolerant network (DTN) occupy much storage and the prediction-based protocols need to calculate and spread much predication information and the scheduling protocols cannot accommodate to huge complex network. This paper analyses and summarizes the existing DTN protocols and proposes a new DTN routing protocol called CRHC which is based on hierarchical...
In this paper, we propose two algorithms for broadcasting a large data set with limited loads of all nodes on a DHT-based P2P network using a de Bruijn graph. One of the broadcast algorithms is applied to de Bruijn graphs with the restricted number of nodes. We prove that this algorithm broadcasts a data set along a degree-constrained spanning tree without global knowledge of a P2P network and that...
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.