this paper proposes mu T-Kernel, a real-time operating system for networked tiny devices, which adopts a preemptive priority-based scheduling. It provides a sophisticated application programming interface to facilitat...
详细信息
ISBN:
(纸本)9781424437702
this paper proposes mu T-Kernel, a real-time operating system for networked tiny devices, which adopts a preemptive priority-based scheduling. It provides a sophisticated application programming interface to facilitate software development. In addition, to provide rich functionalities with a small-footprint, the kernel is reconfigurable with respect to the API. Moreover, mu T-ernel supports a power management which utilizes the periodicity of WSN applications. We conducted performance analyses of the memory footprint and energy consumption, and migrated sample applications to show the programmability of mu T-Kernel. Our results show mu T-Kernel is effective for developing WSN systems while realizing a kernel small enough to fit into a resource-constrained node.
In wireless sensor networks (WSNs), providing resilience (fault tolerance) is a challenging issue. A lot of multipath routing protocols, therefore, have been proposed to achieve the goal;however, they usually suffer f...
详细信息
ISBN:
(纸本)9783642028298
In wireless sensor networks (WSNs), providing resilience (fault tolerance) is a challenging issue. A lot of multipath routing protocols, therefore, have been proposed to achieve the goal;however, they usually suffer from control message overhead or a lack of scalability. Although some protocols utilize partially disjoint paths or longer alternate paths in order to reduce such overhead, they cannot guarantee resilience, because a single failure on a shared node breaks all the paths. In this paper, we therefore propose a scalable multipath source routing (SMSR) protocol. In SMSR, a sink node collects each sensor node's one-hop upstream neighbor information during an initialization phase which the sink node then uses in order to construct several shortest node-disjoint downstream (sink-to-sensor) paths. When transmitting downstream packets, the source routing technique is exploited. On the other hand, each sensor node forwards upstream (sensor-to-sink) packets to one of its upstream neighbors, through the concept of gradient-based routing. the initialization phase depends on only one-time flooding and n (network size) times unicasting, and each sensor node manages only one-hop upstream neighbor information. In this sense, SMSR is scalable in terms of the overhead and the size of routing tables in sensor nodes. Particularly, since SMSR provides several node-disjoint paths with low overhead, it can guarantee resilience efficiently. through experiments using both ns-2 simulation and our real world test-bed, we verify that SMSR achieves the goal better than other existing routing protocols.
Users' authentication and authorization to services access are two important challenges standing against the deployment of ad hoc networks by network operators and services commercialization using these networks. ...
详细信息
Consider that a transform coder is installed at each sensor node. In this paper, an analytical framework for optimal rate allocation of compressed data streams in wireless multihop sensor networks is presented. Compac...
详细信息
the evolution of services market raises the need for automatic support for negotiating service use criteria. In order to reach an agreement, the negotiating parties need to develop a common understanding of the Qualit...
详细信息
Network capacity is a critical feature of wireless ad hoc and sensor networks. It is particularly challenging to determine network capacity when combined with other performance objectives such as timeliness. this pape...
详细信息
ISBN:
(纸本)9789639799592
Network capacity is a critical feature of wireless ad hoc and sensor networks. It is particularly challenging to determine network capacity when combined with other performance objectives such as timeliness. this paper investigates real-time capacity for event-driven data-gathering sensor networks withthe unbalanced many-to-one traffic pattern. First, we compute the average allowable throughputs of nodes for a given event distribution, based on which we then leverage results of queuing theory to estimate the per-hop delays. We develop a new slack time distribution scheme for the unbalanced many-to-one traffic pattern, and prove it optimal in terms of the per-hop success probability. Here the per-hop success probability is defined as the probability for a packet to meet its sub-deadlines at each hop. Finally, we define the network-wide real-time capacity, i.e., given a threshold for the per-hop success probability, how much data (in bit per second) can be delivered to the sink node meeting their deadlines. For these research results, we provide some application scenarios, including configuring packet deadlines or verifying a specific deadline configuration, setting a packet's priority for dynamic scheduling, and trading the reliability of real-time data delivery for capacity efficiency etc. We also study two special cases of WSNs, the chain model and the continuous model. Our slack distribution scheme yields consistent or similar results for these two special cases as that of past works, but is more adaptive by supporting more generic cases.
Programming sensor/actuator networks requires expertise in low-level programming, mainly because of using resource constraint hardware. the code of the resulting systems has typically no clear separation between appli...
详细信息
ISBN:
(纸本)9781424437702
Programming sensor/actuator networks requires expertise in low-level programming, mainly because of using resource constraint hardware. the code of the resulting systems has typically no clear separation between application and system (infrastructure) logic. this minimizes the possibility to reuse code and leads very often, to the necessity of major changes, in case the underlying platform (hardware or operating system) is changed. In this paper, we present a model driven approach based on the service oriented paradigm to support, the different parties involved in the development, namely platform experts, domain experts and end users. the goal of our approach is to enable the use of pre-implemented services in a potentially heterogeneous sensor/actuator network that can be easily combined to form an application. the interaction of these components is implemented by a middleware. To address the resource constraints, this middleware is tailored for each application and platform using a domain specific development tool. the platform experts can expand the code generator to support further platforms and features. Domain experts provide services and describe a potential interaction between different services. the end users can select, configure and combine adequate services to form a running application.
this paper presents a distributed and robust time slot scheduling algorithm, which is suitable for underwater acoustic sensor network (UASN). the information of nodes' 2-hop neighbors is needed to be collected and...
详细信息
this paper presents a distributed and robust time slot scheduling algorithm, which is suitable for underwater acoustic sensor network (UASN). the information of nodes' 2-hop neighbors is needed to be collected and then be used to calculate nodes' initial time slot by a distributed algorithm. A maximal independent set is formed by the nodes which were assigned withthe same initial slot. Some theorems were proved to reveal that in an interference graph the size of this maximal independent set is at least of the size of the maximum independent set of the nodes. the simulation compares UD-TDMA with other three MAC protocols. the results show that the proposed protocol is effective in the UASN with random deployment, especially in high-density underwater acoustic sensor network.
Bluetooth has provided many features that enable wireless ad-hoc networks, but it has also introduced many problems. the root cause of these problems lies in its communication mechanisms. We argue in this paper that t...
详细信息
Bluetooth has provided many features that enable wireless ad-hoc networks, but it has also introduced many problems. the root cause of these problems lies in its communication mechanisms. We argue in this paper that the models that have been used to study distributed algorithms on Bluetooth networks do not adequately model these networks in most cases, and were often oversimplified. this is mainly due to how the many restrictions that the Bluetooth specifications impose on such networks are taken into account, and the lack of ldquoshared knowledgerdquo of these restrictions among the researchers of this field. We give some examples to back our argument. We give also some suggestions and proposals to overcome these issues.
this paper discusses a grid-type sensor network with reconfigurable PSoCs as sensor nodes, and details the middleware routines that support the high-level model for distributed programming. the advantages of using rec...
详细信息
this paper discusses a grid-type sensor network with reconfigurable PSoCs as sensor nodes, and details the middleware routines that support the high-level model for distributed programming. the advantages of using reconfigurable PSoCs over other architectures, like MICA2 motes, are also discussed. the paper refers to a case study to illustrate the capabilities of the proposed network concept.
暂无评论