Context maintenance and discovery, which aim to represent, manage and share context information, have been discussed since context-awareness was presented in the 1990s. these become more challenging when being applied...
详细信息
ISBN:
(纸本)9780769534923
Context maintenance and discovery, which aim to represent, manage and share context information, have been discussed since context-awareness was presented in the 1990s. these become more challenging when being applied to a ubiquitous environment where dynamic and distributedcomputing happens anytime, anywhere. In this paper, a platform for ubiquitous context representation and its distribution is introduced. Five semantic dimensions are used to recognise and organise potential context information. A Context information Base (CiB), a context repository, is integrated in each device of a ubiquitous network to maintain context parameters discovered from neighbour nodes. the CiComm protocol distributes context information and accordingly realises the capabilities of context deployment and retrieval. the resulting architecture is fully extensible being infrastructure-less and based on an ontological model. Simulations carried out using NS-2 have also demonstrated the operations of the protocol and proven through experimental results that it works efficiently in a dynamic ubiquitous environment.
Multi-sensorsystems are increasingly being deployed in many application scenarios due to the enormous potential they can offer. However, as the processing of sensory data often results in imprecise outcome, measuring...
详细信息
Efficient data management techniques are needed in Wireless sensor Networks (WSNs) to counteract issues related to limited resources, e.g. energy, memory, bandwidth, as well as limited connectivity. Self-organizing an...
详细信息
ISBN:
(纸本)9781424425747
Efficient data management techniques are needed in Wireless sensor Networks (WSNs) to counteract issues related to limited resources, e.g. energy, memory, bandwidth, as well as limited connectivity. Self-organizing and cooperative algorithms are thought to be the optimal solution to overcome these limitations. On an abstract level, structured peer-to-peer protocols provide O(1) complexity for storing and retrieving data in the network. However, they rely on underlayer routing techniques. In this paper we present the Virtual Cord Protocol (VCP), a virtual relative position based efficient routing protocol that also provides means for data management, e.g. insert, get, and delete, as known from typical distributed Hash Table (DHT) services. the key contributions of this protocol are independence of real location information by relying on relative positions of neighboring nodes, short virtual paths because successors and predecessors are in their vicinity, and high scalability because only information about direct neighbors is needed for routing. Furthermore, VCP inherently prevents dead-ends and it is easy to be implemented.
Traditional backoff algorithms in distributed contention-based MAC protocols adopt contention window scheme for collision resolution. Collided nodes are redistributed in extended windows to avoid further collision. Ho...
详细信息
ISBN:
(纸本)9781424423910
Traditional backoff algorithms in distributed contention-based MAC protocols adopt contention window scheme for collision resolution. Collided nodes are redistributed in extended windows to avoid further collision. However, collision may still occur due to intersecting window ranges. In this paper, we propose an effective backoff algorithm featuring Collision-Free Collision Classification Resolution (CF-CCR) based on collision classification model to resolve different collisions with different manners. Under the schedule of CF-CCR, the network will ultimately converges to a collision free state, in which nodes access channel sequentially with no collision occurred. the simulation results show that CF-CCR outperforms ieee 802.11 DCF in collision times, throughput, delay and fairness.
the collaboration landscape evolves rapidly by allowing people to participate in ad-hoc and process-centric collaborations. thus, it is important to support humans in managing highly dynamic and complex interactions. ...
详细信息
ISBN:
(纸本)9780769533407
the collaboration landscape evolves rapidly by allowing people to participate in ad-hoc and process-centric collaborations. thus, it is important to support humans in managing highly dynamic and complex interactions. the problem currently with managing interactions is that humans are unable to specify different interaction interfaces for various collaborations, nor able to indicate their availability to participate in collaborations. this paper introduces the Human-provided Services (HpS) framework, which allows users to provide services based on their skills and expertise. Such services can be used by human actors and software services in both ad-hoc and process-centric collaborations. Withthe HpS framework, people can offer multiple services and manage complex interactions, while requesters can find the right experts and available users for performing specific tasks. In this paper we present the HpS middleware, which is the core of the HpS framework. We show how HpS services can be used in Web-scale ad-hoc collaboration scenarios.
Aiming at a realistic mobile connectivity model for vehicular sensor networks in urban environments, we propose the combination of large-scale traffic simulation and computational tools to characterize fundamental gra...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
Aiming at a realistic mobile connectivity model for vehicular sensor networks in urban environments, we propose the combination of large-scale traffic simulation and computational tools to characterize fundamental graph-theoretic parameters. To illustrate the proposed approach, we use the DIVERT simulation framework to illuminate the temporal evolution of the average node degree in this class of networks and provide an algorithm for computingthe transitive connectivity profile that ultimately determines the flow of information in a vehicular sensor network.
Body sensor networks (BSNs) for healthcare put more emphasis on security and adaptation to changes in context and application requirement. Policy-based management enables flexible adaptive behaviour by supporting dyna...
详细信息
ISBN:
(纸本)9781424425747
Body sensor networks (BSNs) for healthcare put more emphasis on security and adaptation to changes in context and application requirement. Policy-based management enables flexible adaptive behaviour by supporting dynamic loading, enabling and disabling of policies without shutting down nodes. this overcomes many of the limitations of sensor operating systems, such as TinyOS, which do not support dynamic modification of code. Alternative schemes for network adaptation, such as networking programming, suffer from high communication cost and operational interruption. In addition, the policy-driven approach enables fine-grained access control through specifying authorization policies. this paper presents an efficient policy system called Finger which enables policy interpretation and enforcement on distributedsensors to support sensor level adaptation and fine-grained access control. It features support for dynamic management of policies, minimization of resources usage, high responsiveness and node autonomy. the policy system is integrated as a TinyOS component, exposing simple, well-defined interfaces which can easily be used by application developers. the system performance in terms of processing latency and resource usage is evaluated.
Scientific applications like weather forecasting require high performance and fast response time. But this ideal requirement has always been constrained by peculiarities of underlying platforms specially, distributed ...
详细信息
ISBN:
(纸本)9780769534923
Scientific applications like weather forecasting require high performance and fast response time. But this ideal requirement has always been constrained by peculiarities of underlying platforms specially, distributed platforms. One such constraint is the efficiency of communication between geographically dispersed and physically distributed processes running these applications, that is the efficiency, of inter process communication (IPC) mechanisms. this paper provides hard evidence that an operating system kernel-level implementation of IPC on multicomputers reduces the execution time of a weather forecasting model by nearly half on average compared to when the IPC mechanism is implemented at library level. A well known nonhydrostatic version of the Penn State/NCAR Mesoscale Model, called MM5, is executed on a networked cluster. the performance of MM5 is measured with two distributed implementations of IPC, a kernel-level implementation called DIPC2006 and a renowned library, level implementation called MPI. It is both shown how and argued why the performance of MM5 on a DIPC2006 configured cluster is by far better than its performance on an MPI configured similar cluster. Even ignoring the favorable points of kernel-level implementations, like safety, privilege, reliability, and primitiveness, the insight is twofold. Scientist may look for more efficient distributed implementations of IPC to run their simulations faster, and computer engineers may try harder to develop more efficient distributed implementations of IPC for scientists.
Stability and delay constraints have significant impact on the design and operation of wireless sensor networks. In this paper, we propose a closed architecture for data sampling in wireless sensor networks. Examples ...
详细信息
ISBN:
(纸本)9781424414567
Stability and delay constraints have significant impact on the design and operation of wireless sensor networks. In this paper, we propose a closed architecture for data sampling in wireless sensor networks. Examples show that the proposed scheme outperforms the traditional layered scheme, both in terms of stable operating region as well as the end to end delays. We then propose a distributed routing scheme for a broad class of wireless sensor networks which converges (in the Cesaro sense) to the set of Cesaro Wardrop equilibria. the scheme is based on multiple time scale stochastic approximation algorithms. Convergence is established using standard results from the related literature and validated by simulation results. Our algorithm can adapt to changes in the network traffic and delays.
To benefit from data aggregation in large scale sensor networks, an aggregation point, i.e. the place where data are aggregated, must be close to sources. In event triggered sensor networks, this can be achieved by dy...
详细信息
ISBN:
(纸本)9781424425747
To benefit from data aggregation in large scale sensor networks, an aggregation point, i.e. the place where data are aggregated, must be close to sources. In event triggered sensor networks, this can be achieved by dynamically constructing a tree connecting the sources rooted at a nearby node. However, this incurs high control and maintenance overhead. With static trees, the distance (Delta) between sources and the aggregation point can be as high as O(n) [1] where n is the number of nodes in the network. this diminishes the benefit of data aggregation, thereby limiting the scalability of static trees. In this paper we propose AFT, a structure with multi-level overlapping clusters. Packet forwarding decisions on AFT are made on the fly when packets are being forwarded and it bounds the distance between the aggregation point and sources by O(delta) irrespective of network size, where delta is the diameter of the event. this guarantees that packets can be aggregated near sources without the overhead of constructing a dynamic structure and therefore is scalable. We prove that in the worst case, AFT guarantees aggregation at a node that is at most 2(1 + root 13)delta away from the sources.
暂无评论