共查询到20条相似文献,搜索用时 31 毫秒
1.
Many mobile devices (e.g., smart phones, PDAs, portable computers) and wireless routers (e.g., WiFi access points) nowadays are equipped with ad hoc transmission mode. In a dense environment such as a college/office campus, this creates the possibility of forming a wireless mesh network (WMN) in which mobile users communicate with each other through multiple wireless hops. This allows mobile users to exchange (share) files over the free access WMN rather than a carrier frequency such as 3G and WiMax. We consider a peer‐to‐peer (P2P) content sharing setting in a WMN, wherein the mesh network operator over‐provision a number of mesh routers in the network with additional storage capacity and P2P‐aware devices that are programmed to cache and store P2P content. Those mesh routers act as caches and participants in P2P content sharing. The aim of this setting is to both reduce the cost of communications between peers within the WMN (i.e., reduce bandwidth and energy that P2P traffic consumes in the network), and enhance the performance of P2P content sharing (i.e., reduce the average P2P content download delay). Our main contribution in this paper is an optimum P2P content replication strategy at the participating mesh routers. In particular, we determine the optimum number of replicas for every P2P file such that the average access cost of all files in the network is minimized. We propose a centralized algorithm that enables the participating mesh routers to implement the optimal strategy. We further propose a distributed (low cost) algorithm for P2P content replication at the participating mesh routers, and show that the distributed algorithm mimics the optimal strategy very well. The analytical and simulation results show that our replication strategy significantly reduces the average overall cost of accessing P2P files in the WMN as compared with other commonly used replication strategies. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
2.
In Data Grid systems, quick data access is a challenging issue due to the high latency. The failure of requests is one of the most common matters in these systems that has an impact on performance and access delay. Job scheduling and data replication are two main techniques in reducing access latency. In this paper, we propose two new neighborhood‐based job scheduling strategies and a novel neighborhood‐based dynamic data replication algorithm (NDDR). The proposed algorithms reduce the access latency by considering a variety of practical parameters for decision making and the access delay by considering the failure probability of a node in job scheduling, replica selection, and replica placement. The proposed neighborhood concept in job scheduling includes all the nodes with low data transmission costs. Therefore, we can select the best computational node and reduce the search time by running a hierarchical and parallel search. NDDR reduces the access latency through selecting the best replica by performing a hierarchical search established based on the access time, storage queue workload, storage speed, and failure probability. NDDR improves the load balancing and data locality by selecting the best replication place considering the workload, temporal locality, geographical locality, and spatial locality. We evaluate our proposed algorithms by using Optorsim Simulator in two scenarios. The simulations confirm that the proposed algorithms improve the results compared with similar existing algorithms by 11%, 15%, 12%, and 10% in terms of mean job time, replication frequency, mean data access latency, and effective network usage, respectively. 相似文献
3.
The reliability of sensor networks is generally dependent on the battery power of the sensor nodes that it employs; hence it is crucial for the sensor nodes to efficiently use their battery resources. This research paper presents a method to increase the reliability of sensor nodes by constructing a connected dominating tree (CDT), which is a subnetwork of wireless sensor networks. It detects the minimum number of dominatees, dominators, forwarder sensor nodes, and aggregates, as well as transmitting data to the sink. A new medium access control (MAC) protocol, called Homogenous Quorum‐Based Medium Access Control (HQMAC), is also introduced, which is an adaptive, homogenous, asynchronous quorum‐based MAC protocol. In this protocol, certain sensor nodes belonging to a network will be allowed to tune their wake‐up and sleep intervals, based on their own traffic load. A new quorum system, named BiQuorum, is used by HQMAC to provide a low duty cycle, low network sensibility, and a high number of rendezvous points when compared with other quorum systems such as grid and dygrid. Both the theoretical results and the simulation results proved that the proposed HQMAC (when applied to a CDT) facilitates low transmission latency, high delivery ratio, and low energy consumption, thus extending the lifetime of the network it serves. 相似文献
4.
In this paper we present a unified solution to identify peer‐to‐peer (P2P) communities operating in the network. We propose an algorithm that is able to progressively discover nodes cooperating in a P2P network and to identify that P2P network. Starting from a single known node, we can easily identify other nodes in the P2P network, through the analysis of widely available and standardized IPFIX (NetFlow) data. Instead of relying on the analysis of content characteristics or packet properties, we monitor connections of known nodes in the network and then progressively discover other nodes through the analysis of their mutual contacts. We show that our method is able to discover cooperating nodes in many P2P networks and present the real computational requirements of the algorithm on a large network. The use of standardized input data allows for easy deployment onto real networks. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
5.
The Peer to Peer-Cloud (P2P-Cloud) is a suitable alternative to distributed cloud-based or peer-to-peer (P2P)-based content on a large scale. The P2P-Cloud is used in many applications such as IPTV, Video-On-Demand, and so on. In the P2P-Cloud network, overload is a common problem during overcrowds. If a node receives many requests simultaneously, the node may not be able to respond quickly to user requests, and this access latency in P2P-Cloud networks is a major problem for their users. The replication method in P2P-Cloud environments reduces the time to access and uses network bandwidth by making multiple data copies in diverse locations. The replication improves access to the information and increases the reliability of the system. The data replication's main problem is identifying the best possible placement of replica data nodes based on user requests for data access time and an NP-hard optimization problem. This paper proposes a new replica replacement to improve average access time and replica cost using fuzzy logic and Ant Colony Optimization algorithm. Ants can find the shortest path to discover the optimal node to place the duplicate file with the least access time latency. The fuzzy module evaluates the historical information of each node to analyze the pheromone value per iteration. The fuzzy membership function is also used to determine each node's degree based on the four characteristics. The simulation results showed that the access time and replica cost are improved compared to other replica replacement algorithms. 相似文献
6.
Topology discovery is a prerequisite when investigating the network properties; with the enormous number of Bitcoin users and performance issues, it becomes critical to analyse the network in a fashion that makes it possible to detect all Bitcoin's nodes and understand their behaviour. In massive, dynamic, and distributed peer‐to‐peer (P2P) networks like Bitcoin, where thousands of updates occur per second, it is hard to obtain an accurate topology representing the structure of the network as a graph with nodes and links by using the traditional local measurement approaches based on batches, offline data, or on the discovery of the topology around a small set of nodes and then combine them to discover an approximate network topology. All of which present some limitation when applying them on blockchain‐based networks. In this paper, we propose a topology discovery system that performs a real‐time data collection and analysis for Bitcoin P2P links, which assembles incoming nodes information for deeper graph analysis processing. The topology discovery system allows us to gain knowledge on the Bitcoin network size, the network stability in terms of reachable, churn, and well‐connected nodes, as well as some data regarding the effects of some countries' Internet infrastructure on Bitcoin traffic. 相似文献
7.
Wireless mesh networks (WMNs) have emerged as a promising technology that provides low‐cost broadband access to the Internet for fixed and mobile wireless end users. An orthogonal evolution in computer networking has been the rise of peer‐to‐peer (P2P) applications such as P2P data sharing. It is of interest to enable effective P2P data sharing in this type of networks. Conventional P2P data sharing systems are not cognizant of the underlying network topology and therefore suffer from inefficiency. We argue for dual‐layer mesh network architecture with support from wireless mesh routers for P2P applications. The main contribution of this paper is P2PMesh: a topology‐aware system that provides combined architecture and efficient schemes for enabling efficient P2P data sharing in WMNs. The P2PMesh architecture utilizes three schemes: (i) an efficient content lookup that mitigates traffic load imbalance at mesh routers; (ii) an efficient establishment of download paths; and (iii) a data transfer protocol for multi‐hop wireless networks with limited capacity. We note here that the path establishment and data transfer schemes are specific to P2P traffic and that other traffic would use routes determined by the default routing protocol in the WMN. Simulation results suggest that P2PMesh has the potential to improve the performance of P2P applications in a wireless multi‐hop setting; specifically, we focused on data sharing, but other P2P applications can also be supported by this approach. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
8.
非结构化P2P网络中常用的泛洪搜索方法造成了严重的通信消耗.提出一种基于位置感知和语义的P2P网络模型,在覆盖网络的构建过程中考虑底层的物理网络拓扑,同时兼顾拓扑结构与共享资源之间的相关性.该网格模型基础上,给出了语义搜索算法.实验结果表明,提出的网络模型能够减少覆盖网络与底层物理网络拓扑不匹配带来的网络开销,并且在查找性能和网络开销之间取得了良好的平衡. 相似文献
9.
Interactive multimedia applications such as peer‐to‐peer (P2P) video services over the Internet have gained increasing popularity during the past few years. However, the adopted Internet‐based P2P overlay network architecture hides the underlying network topology, assuming that channel quality is always in perfect condition. Because of the time‐varying nature of wireless channels, this hardly meets the user‐perceived video quality requirement when used in wireless environments. Considering the tightly coupled relationship between P2P overlay networks and the underlying networks, we propose a distributed utility‐based scheduling algorithm on the basis of a quality‐driven cross‐layer design framework to jointly optimize the parameters of different network layers to achieve highly improved video quality for P2P video streaming services in wireless networks. In this paper, the quality‐driven P2P scheduling algorithm is formulated into a distributed utility‐based distortion‐delay optimization problem, where the expected video distortion is minimized under the constraint of a given packet playback deadline to select the optimal combination of system parameters residing in different network layers. Specifically, encoding behaviors, network congestion, Automatic Repeat Request/Query (ARQ), and modulation and coding are jointly considered. Then, we provide the algorithmic solution to the formulated problem. The distributed optimization running on each peer node adopted in the proposed scheduling algorithm greatly reduces the computational intensity. Extensive experimental results also demonstrate 4–14 dB quality enhancement in terms of peak signal‐to‐noise ratio by using the proposed scheduling algorithm. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
10.
The wireless sensor networks composed of tiny sensor with the capability of monitoring the tangible changes for a wide range of applications are limited with the capabilities on processing and storage. Their limited capabilities make them seek the help of the cloud that provides the rented service of processing and storage. The dense deployment of the wireless sensor and their vulnerability to the unknown attacks, alterations make them incur difficulties in the process of the conveyance causing the modifications or the loss of the content. So, the paper proposes an optimized localization of the nodes along with the identification of the trusted nodes and minimum distance path to the cloud, allowing the target to have anytime and anywhere access of the content. The performance of the cloud infrastructure‐supported wireless sensor network is analyzed using the network simulator 2 on the terms of the forwarding latency, packet loss rate, route failure, storage, reliability, and the network longevity to ensure the capacities of the cloud infrastructure‐supported wireless sensor networks. 相似文献
11.
The MAC protocol for a cognitive radio network should allow access to unused spectrum holes without (or with minimal) interference to incumbent system devices. To achieve this main goal, in this paper a distributed cognitive radio MAC (DCR‐MAC) protocol is proposed for wireless ad hoc networks that provides for the detection and protection of incumbent systems around the communication pair. DCR‐MAC operates over a separate common control channel and multiple data channels; hence, it is able to deal with dynamics of resource availability effectively in cognitive networks. A new type of hidden node problem is introduced that focuses on possible signal collisions between incumbent devices and cognitive radio ad hoc devices. To this end, a simple and efficient sensing information exchange mechanism between neighbor nodes with little overhead is proposed. In DCR‐MAC, each ad hoc node maintains a channel status table with explicit and implicit channel sensing methods. Before a data transmission, to select an optimal data channel, a reactive neighbor information exchange is carried out. Simulation results show that the proposed distributed cognitive radio MAC protocol can greatly reduce interference to the neighbor incumbent devices. A higher number of neighbor nodes leads to better protection of incumbent devices. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
12.
Wireless sensor networks (WSNs) have been vastly employed in the collection and transmission of data via wireless networks. This type of network is nowadays used in many applications for surveillance activities in various environments due to its low cost and easy communications. In these networks, the sensors use a limited power source which after its depletion, since it is non‐renewable, network lifetime ends. Due to the weaknesses in sensor nodes, they are vulnerable to many threats. One notable attack threating WSN is Denial of Sleep (DoS). DoS attacks denotes the loss of energy in these sensors by keeping the nodes from going into sleep and energy‐saving mode. In this paper, the Abnormal Sensor Detection Accuracy (ASDA‐RSA) method is utilized to counteract DoS attacks to reducing the amount of energy consumed. The ASDA‐RSA schema in this paper consists of two phases to enhancement security in the WSNs. In the first phase, a clustering approach based on energy and distance is used to select the proper cluster head and in the second phase, the RSA cryptography algorithm and interlock protocol are used here along with an authentication method, to prevent DoS attacks. Moreover, ASDA‐RSA method is evaluated here via extensive simulations carried out in NS‐2. The simulation results indicate that the WSN network performance metrics are improved in terms of average throughput, Packet Delivery Ratio (PDR), network lifetime, detection ratio, and average residual energy. 相似文献
13.
The advanced technique of multiple beam antennas is recently considered in wireless networks to improve the system throughput by increasing spatial reuse, reducing collisions, and avoiding co‐channel interference. The usage of multiple beam antennas is similar to the concept of Space Division Multiple Access (SDMA), while each beam can be treated as a data channel. Wireless networks can increase the total throughput and decrease the transmission latency if the physical layer of a mobile node can support multirate capability. Multirate wireless networks incurs the anomaly problem, because low data rate hosts may influence the original performance of high data rate hosts. In this work, each node fits out multiple beam antennas with multirate capability, and a node can either simultaneously transmit or receive multiple data on multiple beams. Observe that the transmitting or receiving operation does not happen at the same time. In this paper, we propose a multiple relay‐based medium access control (MAC) protocol to improve the throughput for low data rate hosts. Our MAC protocol exploits multiple relay nodes and helps the source and the destination to create more than one data channel to significantly reduce the transmission latency. Observe that low data rate links with long‐distance transmission latencies are distributed by multiple relay nodes, hence the anomaly problem can be significantly alleviated. In addition, the ACK synchronization problem is solved to avoid the condition that source nodes do not receive ACKs from destination nodes. An adjustment operation is presented to reduce unnecessary relay nodes during the fragment burst period. Finally, simulation results illustrate that our multiple relay‐based MAC protocol can achieve high throughput and low transmission latency. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
14.
Over the last few years, mobility management in the Internet has been one of the most active fields in communications. The recent increasing mobile traffic demand is having an important impact on the design of mobile networks and some limitations are arising from traditional network deployments. In order to deal with this new scenario, mobility management network architectures are being redesigned towards a more distributed operation. In this paper, we introduce DM3 (distributed mobility management MPLS), a fully distributed architecture designed to track efficiently the mobility of users in the current paradigm of evolving mobile IP networks. In DM3 architecture, several nodes are distributed in the MPLS‐based access network and the mobile nodes are served by a close‐by mobility anchor. With this operation, we reduce the routing and registration update costs, and provide a low handoff latency with a minimal packet loss rate. Analytical and experimental results are presented to justify the benefits of our proposed architecture. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
15.
The fiber‐wireless (FiWi) access network is a very promising solution for next‐generation access networks. Because of the different protocols between its subnets, it is hard to globally optimize the operation of FiWi networks. Network virtualization technology is applied to FiWi networks to realize the coexistence of heterogeneous networks and centralized control of network resource. The existing virtual resource management methods always be designed to optimize virtual network (VN) request acceptance rate and survivability, but seldom consider energy consumption and varied requirements of quality of service (QoS) satisfaction, which is a hot and important topic in the industrial field. Therefore, this paper focuses on the QoS‐aware cross‐domain collaborative energy saving mechanism for FiWi virtual networks. First, the virtual network embedding (VNE) model, energy consumption model, and VNE profit model of FiWi networks are established. Then, a QoS‐aware in‐region VN embedding mechanism is proposed to guarantee service quality of different services. After that, an underlying resource updating mechanism based on energy efficiency awareness is designed to realize low‐load ONU and wireless routers co‐sleep in FiWi networks. Finally, a QoS‐aware re‐embedding mechanism is presented to allocate proper resource to the VNs affected by the sleeping mechanism. Especially for video VNs, a re‐embedding scheme which adopts traffic splitting and multipath route is introduced to meet resource limitation and low latency. Simulation results show that the proposed mechanism can reduce FiWi network's energy consumption, improve VNE profit, and ensure high embedding accepting rate and strict delay demand of high‐priority VNs. 相似文献
16.
Wireless sensor networks nowadays find application in all the fields of the world. Rare event detection is an important application in which the wireless sensor network is used. In the case of rare event detection, event of interest or the important event occurs very rarely. Battery‐powered sensor nodes are deployed to detect the event and report to the base station. Sensing and communicating the low priority events happen in major portion of the lifetime for the sensor nodes. However, if the event occurs, then it should be detected and communicated at the earliest to the base station or to the sink node. To reduce the network traffic due to low priority data, we propose a cross layered algorithm to improve the lifetime of the sensor nodes in the case of clustered architecture. In spite of the increase in the network lifetime, the time to detect and communicate to the base station is maintained as that of the traditional clustering approach. The proposed algorithm is simulated, and results show significant improvement in the lifetime of the sensor nodes with guaranteed latency. In this paper, we also suggest methods to support the latency to sensor nodes on priority basis for continuous reporting. 相似文献
17.
Because video streaming over mobile handheld devices has been of great interest, the necessity of introducing new methods with low implementation cost and scalable infrastructures is a strong demand of the service. In particular, these requirements are present in popular wireless networks such as wireless mesh networks (WMN). Peer‐to‐peer (P2P) networks promise an efficient scalable network infrastructure for video streaming over wired and wireless networks. Limited resources of the peers in P2P networks and high error rate in wireless channels make it more challenging to run P2P streaming applications over WMNs. Therefore, it is necessary to design efficient and improved error protection methods in P2P video streaming applications over WMNs. In this paper, we propose a new adaptive unequal video protection method specially intended for large scale P2P video streaming over mobile WMNs. Using this method, different frames have different priorities in receivers along the recovery process. Moreover, we precisely and completely evaluate different aspects related to frame protection in these networks using five important performance metrics including video distortion, late arrival distortion, end‐to‐end delay, overhead and initial start‐up delay. The results obtained from a precise simulation in OMNeT++ show that the proposed adaptive method significantly outperforms other solutions by providing better video quality on mobile wireless nodes. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
18.
This work describes a novel location‐aware, self‐organizing, fault‐tolerant peer‐to‐peer (P2P) overlay network, referred to as Laptop. Network locality‐aware considerations are a very important metric for designing a P2P overlay network. Several network proximity schemes have been proposed to enhance the routing efficiency of existing DHT‐based overlay networks. However, these schemes have some drawbacks such as high overlay network and routing table maintenance overhead, or not being completely self‐organizing. As a result, they may result in poor scalability as the number of nodes in the system grows. Laptop constructs a location‐aware overlay network without pre‐determined landmarks and adopts a routing cache scheme to avoid maintaining the routing table periodically. In addition, Laptop significantly reduces the overlay maintenance overhead by making each node maintain only the connectivity between parent and itself. Mathematical analysis and simulations are conducted to evaluate the efficiency, scalability, and robustness of Laptop. Our mathematical analysis shows that the routing path length is bounded by log d N, and the joining and leaving overhead is bounded by d log d N, where N is the number of nodes in the system, and d is the maximum degree of each node on the overlay tree. Our simulation results show that the average latency stretch is 1.6 and the average routing path length is only about three in 10 000 Laptop nodes, and the maximum degree of a node is bounded by 32. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
19.
Hierarchical architecture can significantly reduce the workload overheads and facilitate effective search in peer‐to‐peer (P2P) network by dividing the peers into two layers: a supernode layer and an ordinary node layer. System scalability is therefore improved, which is critical to the deployment of P2P applications, particularly for the P2P‐based Voice over Internet Protocol systems. However, the lack of appropriate size ratio of the supernode layer to the ordinary node layer makes the system search performance far from being optimal. To address the problem, the goal of this paper is to find the optimal layer ratio, such that lookup latency is minimized, subject to the capacity constraint of supernodes. With this particular objective, this paper first formulates a search delay model for the distributed hash table (DHT)‐based layered P2P architecture, taking account of two main sources of latency: DHT routing and queuing delay at the supernode. Then the optimal ratio between supernodes and ordinary nodes is found with the analytical model. Simulation and numerical results show that the obtained solution can improve the performance of a two‐layer P2P system in terms of lookup latency. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
20.
The recent developments in collaborative search, acquisition, and tracking have hoisted the geographical barrier. The network between unmanned aerial vehicles (UAVs) and wireless sensor networks (WSNs) is one such collaboration, which comprises battery‐powered static sensor nodes that act as sources and sinks and UAVs that act as relays. This collaborative network presents with opportunities and advantages, but at the same time, configuration of such networks is an arduous task. The WSN nodes are characterized by constant depleting power. Their network itself requires constant management and reconfiguration. These requisites can be slaked through the formation of an efficient data dissemination algorithm, which acclimates according to the network state. Considering this, a data dissemination approach is presented in this paper, which constructs a virtual topology predicated on the charge of WSN nodes utilizing software‐defined networks (SDNs) through UAVs. The topology is constantly monitored and reconfigured when required. The aerial nodes are equipped with multiple‐input multiple‐output (MIMO) antennas in order to facilitate simultaneous communication with the ground nodes, the base station, and the SDN controller. An efficient sleep timer and backoff counter strategies are also utilized by the proposed approach. The SDN controller facilitates the topology formation and maintenance of a sleep timer and a backoff counter. The proposed model is compared with clustered hierarchical layouts and hexagonal cell layouts through the network simulations. The results suggest significant improvements in the proposed model for various metrics, such as lifetime, delay, latency, delivery ratio, and throughput in comparison with the existing solutions. 相似文献
|