In this paper we consider the problem of scheduling a given task graph on a dynamic network, where processors may become available or unavailable during the lifetime of the computation. We show that known list schedul...
详细信息
An area covered by a wireless sensor network is protected, or covered, by a sensor barrier if there exists a subset of sensors that divide the area into two regions, such that no intruder can move from one region into...
详细信息
An area covered by a wireless sensor network is protected, or covered, by a sensor barrier if there exists a subset of sensors that divide the area into two regions, such that no intruder can move from one region into the other without being detected. To maximize the length of time the area is covered by a barrier, the sensors can be divided into multiple disjoint subsets, where each subset is a barrier. By having only one barrier active at any time, the duration of the coverage is maximized. Algorithms exist that divide the sensors into the maximum number of barriers, and thus, maximize network lifetime. Recently, a new security problem was discovered, known as a barrier-breach, that allows an intruder to cross the area while one barrier is being replaced by another. this is dependent not on the structure of an individual sensor barrier, but in the relative shape of two consecutive sensor barriers. Heuristics have been presented to choose the maximum number of sensor barriers without a barrier breach. In this paper, we redefine the barrier breach problem in such a way that it motivates a different heuristic for its solution. through simulations, we show that our heuristic significantly outperforms the best known heuristic, and thus, it improves network lifetime and/or fault-tolerance.
the hybrid mobile robot has high degree of freedom and has walking instability in dynamic walking. therefore there are many researches to develop robots that improve its mobility to adapt in various uneven environment...
详细信息
ISBN:
(纸本)9781467327428
the hybrid mobile robot has high degree of freedom and has walking instability in dynamic walking. therefore there are many researches to develop robots that improve its mobility to adapt in various uneven environments. When the robot moves position especially, Stability has been one of the most important factors. In the paper, we propose algorithm to increase stability by using FSR sensor. Also we actually verify a performance through walking experiment.
In WSN there is always a scope of improvement in efficient energy utilization, network lifetime. Efficient energy utilization always seems to be an important aspect in WSN's. Because of the fact that energy consum...
详细信息
ISBN:
(纸本)9781467382878
In WSN there is always a scope of improvement in efficient energy utilization, network lifetime. Efficient energy utilization always seems to be an important aspect in WSN's. Because of the fact that energy consumption directly effect the overall performance of WSN. Numbers of protocols are designed for enhancement of network lifetime and prevent the batteries from earlier drainage. Most of the protocols are designed to assuming that all the sensor nodes remain at the same place after deployment. Also the energy level of nodes is similar. In this paper we introduce multihop protocol having some moveable nodes on the boundaries of the whole network. these mobile nodes are rechargeable. the outcome of proposed scheme shows the better performance as compare to basic SEP.
We propose a novel input interface for touch panel devices that employs the built-in camera of the devices to measure multi-axis force information applied by a user. the user attaches the proposed interface, which con...
详细信息
ISBN:
(纸本)9781467327428
We propose a novel input interface for touch panel devices that employs the built-in camera of the devices to measure multi-axis force information applied by a user. the user attaches the proposed interface, which consists of an elastic body and markers, to the built-in camera. the touch panel device can then detect force information applied by the user to the elastic body based on vision-based force sensor technology called GelForce. We implemented a prototype and confirmed that the proposed interface can measure 3-axis force. We then conducted user studies to verify that the proposed interface is acceptable to users of touch panel devices.
We report in this paper on a wireless sensor network deployment at railway tracks to monitor and analyze the vibration patterns caused by trains passing by. We investigate in particular a system that relies on having ...
详细信息
ISBN:
(纸本)9781479902064
We report in this paper on a wireless sensor network deployment at railway tracks to monitor and analyze the vibration patterns caused by trains passing by. We investigate in particular a system that relies on having a distributed network of sensor nodes that individually contain efficient feature extraction algorithms and classifiers that fit the restricted hardware resources, rather than using few complex and specialized sensors. A feasibility study is described on the raw data obtained from a real-world deployment on one of Europe's busiest railroad sections, which was annotated withthe help of video footage and contains vibration patterns of 186 trains. these trains were classified in 6 types by various methods, the best performing at an accuracy of 97%. the trains' length in wagons was estimated with a mean-squared error of 3.98. Visual inspection of the data shows further opportunities in the estimation of train speed and detection of worn-out cargo wheels.
sensor networks have emerged as a promising technology with various applications, and power consumption is one of the key issues. Since each full function device can act as a coordinator or a device in ieee 802.15.4 s...
详细信息
sensor networks have emerged as a promising technology with various applications, and power consumption is one of the key issues. Since each full function device can act as a coordinator or a device in ieee 802.15.4 standard, 802.15.4-based sensor networks have various possible network topologies. In this paper, we try to construct network topologies with small number of coordinators while still maintaining network connectivity. By reducing the number of coordinators, the average duty cycle is reduced and the battery life is prolonged. three topology control algorithms are proposed in this paper. Self-pruning is the simplest one with O(l) running time. Ordinal pruning significantly improves self-pruning in terms of power saving with O(n) running time. Layered pruning is a tradeoff between the first two pruning algorithms with O(radicn) running time and a little higher power consumption than ordinal pruning. Furthermore, all three algorithms are independent of the physical radio propagation characteristics
the proceedings contain 44 papers. the special focus in this conference is on cognitive radio networks, security, resource allocation, wireless protocols and algorithms, advanced networking systems, sensor networks, s...
ISBN:
(纸本)9783642292217
the proceedings contain 44 papers. the special focus in this conference is on cognitive radio networks, security, resource allocation, wireless protocols and algorithms, advanced networking systems, sensor networks, scheduling and optimization, routing protocols, and multimedia and stream processing. the topics include: Transport control based on spectrum switching detection in cognitive radio ad hoc networks;cross-layer control for utility maximization in multihop cognitive radio networks;reliable channel selection and routing for real-time services over cognitive radio mesh networks;studying non-intrusive tracing in the internet;a sparse Bayesian framework for anomaly detection in heterogeneous networks;mobile sensing enabled robust detection of security threats in urban environments;detection of fabricated CTS packet attacks in wireless LANs;channel aware and queue aware scheduling in LTE uplink;network coding based QoS-provisioning MAC for wireless smart metering networks;a strategy-proof and non-monetary admission control mechanism for wireless access networks;admission control and QoS provisioning in multi-service MDA for ieee 802.11s-based wireless mesh networks;empirical analysis of local round trip time for wireless traffic differentiation;performance analysis of cloud computing centers;efficient stream processing in the cloud;deterministic algorithm for coded cooperative data exchange;dynamically provisioned priority-aware algorithms in shared mesh optical networks;interference aware routing and load balancing in wireless sensor and actuator networks;sensor distribution on coverage in sensor networks;sensor-aided navigation in GPS-denied environments;distributed scheduling for advance bandwidth reservation in high-performance networks;a multi-objective optimization approach for designing multihop cellular networks;optimal oblivious routing in hole-free networks.;self-optimizing mechanism for prediction-based decentralized routing;downlink power allocation
In distributed Cloud computing, applications are deployed across many data centres at topologically diverse locations to improved network-related quality of service (QoS). As we focus on interactive applications, we m...
详细信息
In distributed Cloud computing, applications are deployed across many data centres at topologically diverse locations to improved network-related quality of service (QoS). As we focus on interactive applications, we minimize the latency between users and an application by allocating Cloud resources nearby the customers. Allocating resources at all locations will result in the best latency but also in the highest expenses. So we need to find an optimal subset of locations which reduces the latency but also the expenses - the facility location problem (FLP). In addition, we consider resource capacity restrictions, as a resource can only serve a limited amount of users. An FLP can be globally solved. Additionally, we propose a local, distributed heuristic. this heuristic is running within the network and does not depend on a global component. No distributed, local approximations for the capacitated FLP have been proposed so far due to the complexity of the problem. We compared the heuristic with an optimal solution obtained from a mixed integer program for different network topologies. We investigated the influence of different parameters like overall resource utilization or different latency weights.
Software systems are often built by composing services distributed over the network. Choreographies are a form of decentralized composition that models the external interaction of the services by specifying peer-to-pe...
暂无评论