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 order to solve the problem of instability clustering in Ad Hoc Networks with complex and changeable node motion, this paper proposes a weighted clustering algorithm based on node stability(SA-WCA). In this algorithm, we propose a node stability factor based on node received power, which does not need to calculate the specific distance between nodes and can only judge the relative motion between...
Cloud platforms have emerged as a leading solution for computation. In the meantime, large computations have shifted from big parallel tasks to workflows of smaller tasks with data dependencies between them. Task placement is a major issue on Cloud platforms, especially considering the impact of data exchanges on cost and makespan. In this paper, we investigate the consequences of network contention...
Identification of protein complexes is very important to investigate the characteristics of biological processes. Most of existing protein complex clustering algorithms were often run only on a static protein-protein interaction (PPI) network. The dynamic characteristics of interactions were ignored. In order to solve the problem, a new clustering algorithm (TP-WDPIN) was proposed which is based on...
The characteristics of P2P networks which are open, anonymous, and loosely coupled inter-node lead to false resources, malicious evaluation, and syndicates. A related cluster based trust model for P2P networks named RCTrust is presented in this paper. Peers gather in clusters according to their interest similarity and communication history. There are two kinds of trust relationships. In RCTrust, measure...
In order to discover overlapping community structure of social networks more effectively, this paper proposes an algorithm of overlapping community detection based on peak density. The algorithm firstly calculates the matrixes of network topology information distance, and then calculates the local density for each node within a given radius. And then cluster centers are those points which have high...
Dynamic network is the abstraction of networks with frequent topology changes arising from node mobility or other reasons. With the model of dynamic network, fundamental distributed computing problems can be formally studied with rigorous correctness. In this work, we study the counting problem, which plays a significant role in many applications, such as all-to-all information dissemination. Existing...
Various Ideas on leader election process has evolved and most of them rely on techniques such as extrema finding or centrality finding methods. These methods are very reliable and highly efficient in a static network, but when discussion reaches ad-hoc networks robustness is questioned and current system doesn't answer to this dilemma. So taking in to account this highly dynamic nature of mobile ad-hoc...
Based on the territorial continuity of IP addresses, this paper proposes an enhanced Boot-Trapping algorithm. It constructs a Patricia Tree which reflects the topology of the physical network, and collects information of the online Ultra Peers. By providing an UltraPeer physical network nearby for a LeafPeer, it can improve the proximity between the overlay network and the physical network, the aggregation...
A mobile ad hoc network (MANET), is a self-configuring network of mobile devices connected by wireless links. In order to achieve stable clusters, the cluster-heads maintaining the cluster should be stable with minimum overhead of cluster re-elections. In this paper we propose a Probability Based Adaptive Invoked Weighted Clustering Algorithm (PAIWCA) which can enhance the stability of the clusters...
In current cellular networks the rollout of base stations needs to be conscientiously prepared, because their radio configuration should match with the coverage provided by existing cells. The radio planning for every new cell requires considerable human resources. This paper proposes a framework for Dynamic Radio Configuration (DRC) of future Self-Organizing base stations, which is adaptive to the...
Topology control tries to provide more spatial reuse and power conservation while keeping network connectivity. Some topology control algorithms try to provide more energy conservation by sleeping the redundant nodes. This paper presents a learning automata based algorithm to determine whether the node has to sleep or not. Just few efforts have focused on the issue of topology control with mobility...
In this paper, we propose a new dynamic energy efficient routing scheme for wireless sensor networks. Based on the dynamic reconfiguration approach, the proposed scheme can provide network adaptability while enhancing the network efficiency. In addition, our distributed control paradigm has low complexity, making it practical for real sensor network management. Simulation results indicate the superior...
To the question of topology mismatch in structured P2P network, this paper presents a routing advanced algorithm using super-nodes and self-organizing clustering. The algorithm adds self-organizing clustering based on physical location information in structured P2P system, and each node decides whether it can become clustering header according to its ability. In this algorithm, a series of powerful...
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algorithms have been proposed for clusters and grid environments. The most common approach is to construct one or more spanning trees based on the network topology and network monitoring data in order to maximize available bandwidth...
Cooperative communications exploit the spatial diversity inherent in multiuser system by allowing cooperation among users having a wide range of channel qualities. How to search the cluster-head and its member relay nodes to cooperate is important. Since nodes are coming into or out of the clusters time to time, the network topology is perturbed and the reconfiguration of the network is unavoidable...
In second and third generation cellular networks the rollout of base stations needs to be conscientiously prepared, because their radio configuration should match with the coverage provided by existing cells in their neighborhood. The detailed radio planning for every new cell requires considerable human resources and time. This paper proposes a framework for 3G Long Term Evolution (LTE) that can...
Sensor nodes carry limited, generally irreplaceable, power sources. Therefore, sensor network must focus on power conservation. It is possible to extend the lifetime of a network by controlling its topology through clustering. Overlapping Clustering find its wide applications such as inter-cluster routing, topology discovery, node localization, and recovery from cluster head failure and so on. Topology...
Topology of power line carrier network (PLCN) is complex, fast changeable and its channel is time-variant. To enhance the availability and effectiveness of network communication, a cluster based dynamic routing algorithm (CBDR) is proposed in the paper. The algorithm adopts clustering based on root tree and local traversal in order to construct and maintain the dynamic routes according to trees topology,...
Data aggregation in wireless sensor networks eliminates data redundancy, thereby improving bandwidth usage and energy utilization. This paper presents a data aggregation algorithm, called MRDWA (Multi-Role Dynamic Weighting Aggregation), it mainly used in event driven WSN (Wireless Sensor Networks). MRDWA is based on cluster topology structure, and use different data aggregation algorithm according...
The increased popularity of the Internet in recent years, has witnessed an upsurge in the number of traffic types (e.g. Multimedia). This has led to dynamic traffic behaviour that has to be efficiently managed by the Internet service providers (ISPs) in coordination with the underlying carrier network. In this paper, we propose a genetic algorithm based routing solution for carrier networks that efficiently...
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.