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 opportunistic networks, forwarding based protocols lead to a large amount of data flow to the highly connected nodes and unfairness of the nodes' traffic load, finally, it makes the highly connected nodes suffer congestion and results in the messages were discarded. To solve this problem, a congestion control algorithm based on Social Awareness is proposed in this paper. When choosing the next...
WirelessHART has become an industrial standard for robust and real-time wireless monitoring and control. While energy-efficiency is one of the key design considerations for networks with battery-operated devices, data aggregation has been widely studied in the wireless sensor network (WSN) environments to reduce the traffic and prolong the lifetime of the network. However, existing data aggregation...
Facing the massive data rapidly growing in the data centers, deduplication storage system continuously confronts the challenges in providing the corresponding throughputs, necessary capacities to move backup data within backup and low recovery window times. One approach is to construct a well design deduplication clusters which includes many high throughputs data nodes to generate an allover throughputs...
With the development of ever-expanding wireless sensor networks (WSNs) that are meant to connect physical worlds with human societies, gathering sensory data at a single point is becoming less and less practical. Unfortunately, the alternative in-network data management schemes may fail to operate in the face of communication voids (or holes) in WSNs (especially 3D WSNs). In response to this challenge,...
Delay tolerant networks (DTNs) use mobility-assisted routing, where nodes carry, store, and forward data to each other in order to overcome the intermittent connectivity and limited network capacity of this type of network. In this paper, we propose a routing protocol that includes two mechanisms: message replication and message migration. Each mechanism has two steps: message selection and node selection...
The traditional method in single-phase earth fault is too complicated, massive manpower material and financial resources are wasted, the method which proposed in the article is based on Ad hoc. In distribution network, install wireless nodes across a distance, framework for wireless networks, real-time monitoring. And there is a broad application prospect of the phase location method which proposed...
Cognitive networks embody a sense of dynamic responsiveness as actions are typically taken in response to changing circumstances and changing resource availability, which use prior and current knowledge gained from the network to take actions with respect to the end-to-end goals of the whole network. According to the cognitive network framework, a multi-path routing algorithm based on traffic prediction...
This paper proposes novel mechanisms to access sensory data in a distributed fashion in 3D wireless sensor networks. As these networks have their nodes deployed in 3D volumes, we first propose a volume parametrization algorithm to transform irregular volumes into a regular one; it also allows us to extend network protocols from 2D to 3D (which would otherwise be highly non-trivial). Based on this...
The (n, k)-arrangement graph An,k is a generalization of the well known star graph and the alternating group graph. We first present a constant time routing algorithm that allows two groups of An-1,k-1 's to exchange their data in a one-to-one fashion. We then use this routing algorithm to develop an optimal broadcasting algorithm, an optimal algorithm for computing the general prefix sums as well...
Ultra-wide band (UWB) is a radio technology that uses a very large bandwidth. A two-dimensional exclusion mechanism and routing strategy are mentioned in. We extend the exclusion region to three-dimension and modify the interference from other nodes as Gaussian noise. The conclusion is also correct under mobility. We also present a new model combining exclusion mechanism and interference mitigation...
In disruption-tolerant networks (DTNs), network topology constantly changes and end-to-end paths can hardly be sustained. However, social network properties are observed in many DTNs and tend to be stable over time. To utilize the social network properties to facilitate packet forwarding, we present LocalCom, a community-based epidemic forwarding scheme that efficiently detects the community structure...
Nodes in disruption-tolerant networks (DTNs) usually exhibit repetitive motions. Several recently proposed DTN routing algorithms have utilized the DTNs' cyclic properties for predicting future forwarding. The prediction is based on metrics abstracted from nodes' contact history. However, the robustness of the encounter prediction becomes vital for DTN routing since malicious nodes can provide forged...
This paper presents a hybrid routing protocol based on Mobile Agent (HRPMA) for Ad Hoc Networks (MANET). In the proposed approach, a few mobile agents move in the network and communicate with each node. They collect the network information to build the global information matrix of nodes. The data packets are transferred according to the matrix by a routing search algorithm. We have done the experiments...
Recently, opportunistic routing (OR) has been widely used to compensate for the low packet delivery ratio of multi-hop wireless networks. Previous works either provide heuristic solutions without optimality analysis, or assume that unlimited retransmission is available for delivering a data packet. In this paper, we apply OR to a utility-based routing where the successful delivery of a data packet...
In this paper, we embed an incentive-compatible, efficient, and individual rational payment scheme into our cost- and stability-based routing protocol in ad hoc networks which consist of selfish nodes. Unlike traditional routing protocols in ad hoc networks, which only elicit cost information from selfish nodes, our protocol motivates selfish nodes to report truthfully both their stability and cost...
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.