We propose a method for the sharing of capacity among zones of a communication network. Our approach can be employed either when a zone owner wishes to sell capacity for a specified period of time to a number of diffe...
详细信息
In this paper, we classified existing address autoconfiguration schemes based on two communication models: centralized and distributed schemes. We defined performance metrics and evaluated four existing address autoco...
详细信息
ISBN:
(纸本)1932415408
In this paper, we classified existing address autoconfiguration schemes based on two communication models: centralized and distributed schemes. We defined performance metrics and evaluated four existing address autoconfiguration schemes. We suggested requirements for an address autoconfiguration scheme.
In a multiobjective setting, evolutionary algorithms can be used to generate a set of compromise solutions. This makes decision making easier for the user as he has alternative solutions at hand which he can directly ...
详细信息
ISBN:
(纸本)9781605581309
In a multiobjective setting, evolutionary algorithms can be used to generate a set of compromise solutions. This makes decision making easier for the user as he has alternative solutions at hand which he can directly compare. However, if the number of solutions and the number of decision variables which define the solutions are large, such an analysis may be difficult and corresponding tools are desirable to support a human in separating relevant from irrelevant information. In this paper, we present a method to extract structural information from Pareto-set approximations which offers the possibility to present and visualize the trade-off surface in a compressed form. The main idea is to identify modules of decision variables that are strongly related to each other. Thereby, the set of decision variables can be reduced to a smaller number of significant modules. Furthermore, at the same time the solutions are grouped in a hierarchical manner according to their module similarity. Overall, the output is a dendrogram where the leaves are the solutions and the nodes are annotated with modules. As will be shown on knapsack problem instances and a network processor design application, this method can be highly useful to reveal hidden structures in compromise solution sets. Copyright 2008 ACM.
MLS is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarchy of pointers that each node maintains...
详细信息
ISBN:
(纸本)1595933689
MLS is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarchy of pointers that each node maintains. We show that MLS has constant stretch for lookup requests. In contrast to previous work, we consider a concurrent setup where nodes are truly mobile and move even while messages are being routed towards them. We prove correctness and efficiency of MLS and determine the maximum speed at which the nodes might move, which is up to 1/15 of the routing speed. To the best of our knowledge, this is the first work that bounds the node speed, a necessity to prove the success of a lookup algorithm. We verified our theoretical results through extensive simulation and show that the average lookup stretch is around 6. Copyright 2006 ACM.
Recent generations of high-density and high-speed FPGAs provide a sufficient capacity for implementing complete configurable systems on a chip (CSoCs). Hybrid CPUs that combine standard CPU cores with reconfigurable c...
详细信息
Design space exploration is introduced as one of the major tasks in embedded system design. After reviewing existing exploration methods at various layers of abstraction, a generic approach is described based on multi...
详细信息
A method for optimizing the schedule and allocation of uniform algorithms onto processor arrays is derived. The main results described in the following paper are: (1) single (integer) linear programs are given for the...
A method for optimizing the schedule and allocation of uniform algorithms onto processor arrays is derived. The main results described in the following paper are: (1) single (integer) linear programs are given for the optimal schedule of regular algorithms with and without resource constraints, (2) the class of algorithms is extended by allowing certain non-convex index domains, (3) efficient branch and bound techniques are used such that problems of relevant size can be solved. Moreover, additional constraints such as cache memory, bus bandwidths and access conflicts can be considered also. The results are applied to an example of relevant size.
Commercial, coin-sized iButton temperature logger devices are well-suited for densely instrumenting large outdoor areas. An efficient workflow for deploying and maintaining those devices is necessary when striving to ...
详细信息
ISBN:
(纸本)9781450303446
Commercial, coin-sized iButton temperature logger devices are well-suited for densely instrumenting large outdoor areas. An efficient workflow for deploying and maintaining those devices is necessary when striving to deploy and operate several hundreds of data logger devices. Additionally, a sophisticated data management is required for handling the emerging, large amounts of meta and measurement data. Therefore, we developed iAssist, a solution that integrates the handling of iButton data logger devices together with a GPS receiver and a digital camera for gathering accurate location information. iAssist efficiently supports the whole workflow consisting of deploying, relocating and reading tiny sensing systems. iAssist is especially tailored for outdoor operation asking for as little user interaction as possible. Copyright 2010 ACM.
In order to solve the problems in wireless sensor networks, such as node failures and the key node attack, a secure communication model based on secret sharing is presented to improve the communication success rate. I...
详细信息
In order to solve the problems in wireless sensor networks, such as node failures and the key node attack, a secure communication model based on secret sharing is presented to improve the communication success rate. In this model, the network is divided into a series of logical domains, and each domain is composed of the council nodes, the key node, the gateway nodes and ordinary nodes. Using the secret sharing mechanism, the council nodes can protect the master key of each domain, distribute session keys to the nodes in the domain, and periodically monitor the key node to avoid its failure. This method transforms traditional node-based networks into domain-based networks, and the new networks are more stable than the former ones. This new communication model can maintain a steady network despite instability of the network nodes, so it can raise the communication success rate.
Among several techniques proposed for indoor positioning using IEEE 802.11 Wireless Fidelity (Wi-Fi) based networks, those that rely on fingerprinting have been demonstrated to outperform those based on lateration, an...
详细信息
暂无评论