Professional Documents
Culture Documents
TinyOS is designed for Wireless Sensor Networks. Wireless Sensor Networks may
consist of several nodes. These nodes have many practical applications like temperature
sensing humidity sensing, eco system monitoring and many more. These nodes can be
installed anywhere and their data may be collected centrally. These nodes are dispersed
and accessed remotely so to perform their tasks effectively we need a well defined
Operating System with different architecture and approach than others.
In this paper we will briefly discuss different aspects of TinyOS including Event driven
mechanism, efficient Scheduling Algorithms for Quality of Service like SJP scheduling,
routing protocol and component-based architecture of tinyOS. Constraints like Power
consumption, coding and memory limitations, security issues would also be addressed in
this paper.
Introduction:
[02]
Wireless Sensor Network (WSN) is made by the
convergence of sensor, micro-electro-mechanism system and
networks technologies [1~3]. It has become one of the front
fields to research. As a novel technology about acquiring and
processing information, it brings a lot of challenges to us, and
one of them is the micro embedded operating system.
The research on micro operating system must be done firstly.
The capability of the hardware is so limited that the embedded
operating system has to realize efficient management of the
hardware in a limited space. As a result, choosing appropriate
operating system for the nodes of wireless sensor networks is
very important.
Based on the requirements of WSN, this paper puts forward
the design target of operating system. As there is a wide range
of potential applications, the variation in physical devices is
likely to be large. So good transplanting is a key element [4]
for the operating system of the nodes of wireless sensor
networks. According to the characteristics of WSN and the
demands analysis of node operating system, the authors do
profound studies on the classical operating system TinyOS
[03]
[06]
The TinyOS is an embedded operating system for network sensor based on event-driven, and its goal is to
support the concurrency intense operations of network sensors with minimal hardware [1]. The TinyOS job
scheduling is based on non-preempting first-come-first-served strategy (FCFS), which helps to reduce the
system requirement for storage space. However, it is not able to give highly real time network jobs quick
response, and it is likely to be overloaded [2], resulting in the job lost and the information throughput
getting lower etc. Literature [3] proposes a double ring scheduling strategy, improving the system response
speed. Literature [4] reports that the WSN system real-time can be improved by the TinyOS priority
scheduling strategy based on time limit. Literature [5] put forward a job priority scheduling algorithm to
increase the throughput of overloaded nodes comparatively and thus to resolve the question of overload of
local node package. This paper presents a SJP algorithm based on time limit and shortestjob-first
Priority scheduling strategy, and the system throughput was also considered.
SJP:
In order to improve the emergency jobs quick response, hard and
soft real-time jobs are divided by the SJP algorithmaccording to
the job significance. Hard real-time job has hardtime constrains,
and the miss of its time limit can causeserious consequences. The
soft real-time job has soft constrains, the miss of its time limit in
some cases can beaccepted, and no serious consequences occur.
[04]
The major contribution of this work is introduction of a novel dynamic scheduling
algorithm to handle prioritized data communication in wireless sensor networks.
Additionally, wireless sensor network environments impose significant communication
and computation limitations that have forced us to come up with new algorithms to
implement the proposed dynamic scheduling algorithm. Tiny-DWFQ dynamically adjusts
its parameters in order to fulfill the Quality of Service
(QoS) requirements of the data being sent throughout the network in the midst of
continuously changing network conditions and requirements. One of the major obstacles
that we overcame in achieving this was designing and implementing a lightweight
algorithm, specifically for resource constrained wireless sensor networks, that is robust
enough to handle continuous real-time data flows. Due to the limited computational
capacity of wireless sensor networks, most significantly memory, computational capacity,
and bandwidth, our algorithm is designed specifically to meet these demanding
requirements. Bandwidth limitations in any wireless network provide a restricted amount
of resources to be shared amongst competing data flows. Thus, in order to maximize the
available resources, we designed TinyDWFQ to be a congestion reactive, scheduling
Algorithm.
In order to meet the overall needs of many different types of communication, it is necessary for data to be
categorized based on its importance, or priority level within the network.
Ideally we would be able to transmit all of the data all of the time. However when network congestion
occurs due to the limited available bandwidth, a decision must be made as to which data should be sent and
in which order. These decisions are the responsibilities of our Tiny-DWFQ scheduling algorithm.
Security issue
Most WSN deployments do not consider security among
their requirements because of the execution time/energy overhead
it adds to the system; hence, security tends to be
considered simply as an undesirable “extra cost” in such
constrained environments. However, when targeting WSNs
for health applications or applications that monitor sensitive
information, it is important to consider confidentiality;
therefore, in these scenarios, the deployment of encryption
algorithms is essential. Furthermore, in many situations data
integrity and authenticity are also critical, since the existence
of invalid data could lead to mistaken actions with severe
consequences; since the origin of such invalid information
can be either natural (caused by hardware malfunctioning,
transmission errors, etc.) or intentional (e.g., generated by fake
sensors introduced in the network with malicious intent), the
deployment of Message Authentication Codes (MACs) is also
made necessary. Finally, since such algorithms depend on the
existence of secret keys for their functioning, applications need
to deal with the distribution of such keys, what is a especially
challenging issue in WSNs [6]. [/* is it enough or proceed down */]
Due to the constraints intrinsic to WSNs, security mechanisms
employed must be extremely lightweight. The literature
includes some comparative evaluations of traditional hash
functions, block and stream ciphers [7], [8], [9], [10] in sensor
networks. The main goal of these analysis is to determine
the most adequate algorithms for deployment in WSNs, considering
both efficiency and security requirements. Similarly,
many authors have tried to identify efficient implementations
of Elliptic Curve Cryptography (ECC) for such constrained
scenarios [11], [12], [13]. The results obtained in these studies
usually show that the deployment of general-purpose algorithms
leads to the need of choosing performance over security
level or vice-versa. For example, after analyzing the efficiency
of several traditional block ciphers in WSNs, Law et al. [7]
recommends AES [14] and Skipjack [15] for scenarios with,
respectively, high and low security requirements. Due to this
urge for security in many important scenarios and to the need
of sufficiently lightweight solutions, some algorithms specifically
designed for WSNs have been proposed and analyzed in
the last years, such as TinyTate [11] (for key management),
Curupira [16], [17] (block ciphers) and Marvin [18] (a MAC
algorithm).
Despite their importance for providing further information