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.
To identifies the desired transmission range of each node in a cluster and power management based on mean transmission power within the context of wireless ad-hoc networks. By reducing the transmission range of the nodes, energy consumed by each node is decreased and topology is formed by sending messages between the nodes such as RTS and CTS. A new algorithm is formulated by deriving a mathematical...
In this paper we propose a distributed secure clustering scheme for wireless ad hoc networks. Our scheme is implemented over the GPSR ad hoc routing protocol and consists of a) a weighted clustering algorithm that forms opinions, b) a threshold-based protective block, c) a distributed voting-based cooperative block by which the final cluster heads are elected, and d) a cryptographic block used for...
In this paper, we develop algorithms for the data aggregation problem which arises in the context of big-data applications that employ the MapReduce operation. For the case when source racks can send their data to the aggregator using multiple paths, we show that an aggregation tree topology that minimizes aggregation time can be constructed in polynomial time. We consider also the problem of constructing...
Visually mining a large influence graph is appealing yet challenging. Existing summarization methods enhance the visualization with blocked views, but have adverse effect on the latent influence structure. How can we visually summarize a large graph to maximize influence flows? In particular, how can we illustrate the impact of an individual node through the summarization? Can we maintain the appealing...
Discovering topologies in a social network targets various business applications such as finding key influencers in a network, recommending music movies in virtual communities, finding active groups in network and promoting a new product. Since social networks are large in size, discovering topologies from such networks is challenging. In this paper, we present a scalable topology discovery approach...
Servers and network contribute about 60% to the total cost of data center in cloud computing. How to efficiently place virtual machines so that the cost can be saved as much as possible, while guaranteeing the quality of service plays a critical role in enhancing the competitiveness of service cloud provider. Considering the heterogeneous servers and the random property of multiple resources requirements...
This paper presents a Kernighan-Lin bi-partitioning based approach to perform mapping the core graph of an application onto a mesh-based Network-on-Chip (NoC) architecture. It aims at optimizing both communication cost and thermal variance of the resulting solution. Experimental results show that the approach could obtain significant reduction in mean temperature of the die and its standard deviation,...
In this paper, an enhanced clustering algorithm is proposed for large scale and dense Wireless Mobile Sensor Network (WMSN) to reduce the energy consumption for each sensor node and to maximize the system life. Sensor nodes in WMSN run on non-rechargeable and non-replaceable batteries and it is deployed in harsh locations, where recharging or changing sensor node battery is generally impossible. So,...
Clustering algorithms have been widely used in wireless sensor networks for virtual backbone construction. They organize the nodes into smaller groups and form a structured topology allowing more efficient bandwidth usage and battery consumption. As the clustering algorithms are usually used for routing, it is crucial to measure the efficiency of the generated backbone in information transport. Failure...
Multicast benefits data center group communication in both saving network traffic and improving application throughput. The SLA (Service Level Agreement) of cloud service requires the computation correctness of distributed applications, translating to the requirement of reliable Multicast delivery. In this paper we present INICE, a high stable Multicast approach for data center network. The key idea...
Topology control offers many advantages for wireless networks such as reduced energy cost, simplified communication graph and network-wide connectivity. There are mainly two methods for managing the network topology. In clustering, a hierarchy of backbone nodes is selected to improve on the systems scalability and network lifetime whereas in power control each node adjusts its transmission power to...
VCube is a distributed diagnosis algorithm for virtually interconnecting network nodes. VCube presents several logarithmic properties, and is a logical hypercube when all nodes are fault-free. VCube is dynamic in the sense that nodes can leave and rejoin the system as they become faulty and are repaired. The topology re-organizes itself and keeps its logarithmic properties even if an arbitrary number...
Constructing an efficient and trustable content delivery community with low cost is the general target for the designers of the Peer-to-Peer (P2P) systems. To achieve this goal, many reputation mechanisms are introduced in recent years to alleviate the blindness during peer selection in distributed P2P environment where malicious peers coexist with honest ones. They indeed provide incentives for peers...
Growing performance gap between processors and main memory has made it worthwhile to consider off-chip data accesses in multi-query processing [2], [1], [3]. Exploiting data-sharing opportunities among concurrent queries can be critical for effective utilization of the underlying shared memory hierarchy. Given a set of queries, there may be a common retrieval operation for several cases to the same...
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...
A more detailed community structure can contribute to a better understanding of the network, which can also benefit efficient routing protocols and QoS schemes designing. For an Opportunistic Network which consists of different kinds of mobile nodes, its topology changes over time. Therefore the community detection becomes more difficult than static situations. Moreover the overlapping community detection...
Large networks are always partitioned into several small networks when deploying software defined networking (SDN). The network partitioning with SDN control planes open many unanswered questions such as latency, reliability, and load balancing. This paper opens the investigation by focusing on two specific questions: given a wide-area network topology, how to partition it into several small SDN domains,...
In this paper, we study the problem of provisioning large-scale virtual clusters over federated clouds connected by multi-domain, layer-2 wide area networks. We first present the virtual cluster request abstraction and the abstraction models for substrate resource pools. Based on these two abstraction models, we developed a novel layer-2 exchange mechanism and an implementation of it in a multi-domain...
The current approach for text binarization proposes a clustering algorithm as a preprocessing stage to an energy-based segmentation method. It uses a clustering algorithm to obtain a coarse estimate of the background (BG) and foreground (FG) pixels. These estimates are used as a prior for the source and sink points of a graph cut implementation, which is used to efficiently find the minimum energy...
Aimed at the uneven energy consumption and data redundancy problem of the long-distance ribbon wireless sensor network, a cluster topology control algorithm is proposed based on the topology of ribbon wireless sensor network. The algorithm optimizes the cluster head selection mechanism and effectively guarantees sensor nodes with more residual energy and less communication cost as a cluster head....
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.