Communication Models for Algorithm Design in Wireless Sensor Networks (original) (raw)
Related papers
On communication models for algorithm design in networked sensor systems: A case study
Pervasive and Mobile Computing, 2005
Towards building a systematic methodology of algorithm design for applications of networked sensor systems, we formally define two link-wise communication models, the Collision Free Model (CFM) and the Collision Aware Model (CAM). While CFM provides ease of programming and analysis for high level application functionality, CAM enables more accurate performance analysis and hence more efficient algorithms through cross-layer optimization, at the expense of increased programming and analysis complexity. These communication models are part of an abstract network model, above which algorithm design and performance optimization is performed. We use the example of optimizing a probability based broadcasting scheme under CAM to illustrate algorithm optimization based on the defined models. Specifically, we present an analytical framework that facilitates an accurate modeling and analysis for the probability based broadcasting in CAM (PB_CAM). Our analytical results indicate that (1) the optimal broadcast probability for either maximizing the reachability within a given latency constraint or minimizing the latency for a given reachability constraint decreases rapidly with node density, and (2) the optimal probability for either maximizing the reachability with a given energy constraint or minimizing the energy cost for a given reachability constraint varies slowly between 0 and 0.1 over the entire range of the variations in node density. Our analysis is also confirmed by extensive simulation results.
Programming models for sensor networks: A survey
ACM Transactions on Sensor Networks, 2008
Sensor networks have a significant potential in diverse applications some of which are already beginning to be deployed in areas such as environmental monitoring. As the application logic becomes more complex, programming difficulties are becoming a barrier to adoption of these networks. The difficulty in programming sensor networks is not only due to their inherently distributed nature but also the need for mechanisms to address their harsh operating conditions such as unreliable communications, faulty nodes, and extremely constrained resources. Researchers have proposed different programming models to overcome these difficulties with the ultimate goal of making programming easy while making full use of available resources. In this article, we first explore the requirements for programming models for sensor networks. Then we present a taxonomy of the programming models, classified according to the level of abstractions they provide. We present an evaluation of various programming models for their responsiveness to the requirements. Our results point to promising efforts in the area and a discussion of the future directions of research in this area.
Formal Approach for Modeling, Verification and Performance Analysis of Wireless Sensors Network
Lecture Notes in Computer Science, 2015
The Control of energy consumption by sensor networks and the maximization of the sensor network lifetime are the most fundamental issues. Due to the variety of protocols dedicated to the different sensor's layers and the difficulty of a real network deployment, designers need some mechanisms and tools to validate the energy consumption and to observe its impact on the network's lifetime before deployment. In this context, we have proposed a modeling approach considering the global behavior of a sensor network and allowing the estimation of the network's energy consumption. This approach is based on the concept of components oriented modeling and the expressiveness of Colored Petri Nets (CP-NET). Thus, the global model representing sensor behavior is obtained by interfacing different models each one representing the behavior of a particular component of the sensor. In this work, our interest was firstly focused on the radio because it's the most energy consumer. When observing the node functioning, we show that the radio behavior is mainly controlled by the MAC component. Therefore, we were also interested in MAC component. The generated model has been used to estimate the energy consumption and to evaluate the network lifetime. Adopting the oriented components modeling approach, we may obtain two global models, where only MAC protocol change. Obtained models, representing the behavior of mostly used MAC protocols, allow comparing the impact of these two protocols on the network's global behavior and particularly on its lifetime.
C3: an energy-efficient protocol for coverage, connectivity and communication in WSNs
Personal and Ubiquitous Computing, 2013
The lower layer of ubiquitous and pervasive systems consists of wireless ad hoc and sensor networks. In wireless sensor networks (WSNs), sensors consume most of their energy in data transmission and idle listening. Hence, efficient usage of energy can be ensured by improved protocols for topology control (i.e., coverage and connectivity), sleep scheduling, communication, and aggregation and compression of data. Though several protocols have been proposed for this purpose, they are not energy-efficient. We propose an integrated and energyefficient protocol for Coverage, Connectivity, and Communication (C3) in WSNs. The C3 protocol uses received signal strength indicator to divide the network into virtual rings, defines clusters with clusterheads more probably at alternating rings, defines dings that are rings inside a cluster and uses triangular tessellation to identify redundant nodes, and communicates data to sink through clusterheads and gateways. The proposed protocol strives for nearoptimal deployment, load balancing, and energy-efficient communication. Simulation results show that the C3 protocol ensures partial coverage of more than 90 % of the total deployment area, ensures one connected network, and facilitates energy-efficient communication while expending only one-fourth of the energy compared to other related protocols such as the coverage and connectivity protocol, and the layered diffusion-based coverage control.
Programming models for sensor networks
ACM Transactions on Sensor Networks, 2008
Sensor networks have a significant potential in diverse applications some of which are already beginning to be deployed in areas such as environmental monitoring. As the application logic becomes more complex, programming difficulties are becoming a barrier to adoption of these networks. The difficulty in programming sensor networks is not only due to their inherently distributed nature but also the need for mechanisms to address their harsh operating conditions such as unreliable communications, faulty nodes, and extremely constrained resources. Researchers have proposed different programming models to overcome these difficulties with the ultimate goal of making programming easy while making full use of available resources. In this article, we first explore the requirements for programming models for sensor networks. Then we present a taxonomy of the programming models, classified according to the level of abstractions they provide. We present an evaluation of various programming m...
Proceedings of the 2014 Zone 1 Conference of the American Society for Engineering Education, 2014
Wireless sensor networks (WSNs) have gained a lot of considerations in recent years and have significant impacts on different application areas. Wireless sensors have been successfully deployed in different computing environments to measure, gather and process the raw information in the sensing area to the observers. Sensor networks provide infinite opportunities, but at the same time pose rough challenges due to the sensors' characteristics and the operating conditions of these sensors. This paper provides an extensive study of the current state-of-art in programming wireless sensor network, presenting a classification of programming levels in the field and highlighting some likely programming challenges and research future directions.
A layered model for wireless sensor networks
2009
Aiming at optimizing the use of a wireless sensor network (WSN) as a miniature components integrated on chip (according to SoC technology), the adoption of specific protocols in the fields of applications of such network type is crucial. WSNs differ largely from the traditional wireless networks, they consequently require the use of new variations of energy-preserving protocols to ensure a prolonged life span for a sensor and to allow autonomy for a mostly dynamic topology-characterized network. Indeed, several routing and medium access control (MAC) protocols were proposed, and often adapted to the targeted applicability (house automation, biology, security, rural...). In this paper, we put forward a layered model for WSNs, with reference to OSI, TCP/IP and IEEE802 models which guaranteed a simple design and an easy implementation, for computer networks on (LAN/Wi-LAN, WAN, PAN...), thanks to layer decomposition reducing complexity and outlining functionalities relating to layers/levels coordinating through specific interfaces. The suggested model defines the levels of abstraction features of a WSN nodes according to their types (sensor, base station ldquoBSrdquo...) and intelligence level so as to serve as a basic model for design and future implementations of WSNs protocols and applications. This layered model allows the interconnection of a WSN with any other type of computer network.
A Step towards the Efficiency of Collisions in the Wireless Sensor Networks
ICST Transactions on Scalable Information Systems
Wireless Sensor Networks (WSNs) have an ideal tactic for implementing the number of applications due to evading complex wirings connections and their maintenance. On the other hand, the main source of data communication in other networks is protocols. The Medium Access control Protocol defines when a wireless sensor (WS) transmits its recognizer data. However, MAC protocols suffer from collisions that ultimately affect the performance of WSNs. Consequently, care must be taken for improving the efficiency of medium access protocol. This paper presents a model of the Lightweight medium access protocol (LMAC) protocol, which is energy efficient protocol suitable to analyze the probability of collisions for SN (Sensor Nodes) when the data is transmitted at the same time. This paper we consider connected topologies that consist of 5 nodes. For analysis, we have used UMC PRO 0.2 (UPPAAL Model Checker Probabilistic) and results show that the chances of collisions decreases if the weight of nodes before they transmit data is increased. After that, we also compare the results of five nodes with their time slot 5, 6, and 7 depend on the chances of the collisions and suggest an optimistic choice of efficiency and also decrease the cost of networks a network setup that improves the performance and reduces the cost of the network.
PCTMC Models of Wireless Sensor Network Protocols
Lecture Notes in Computer Science, 2013
Wireless Sensor Networks (WSNs) consist of a large number of spatially distributed embedded devices (nodes), which communicate with one another via radio. Over the last decade improvements in hardware and a steady decrease in cost have encouraged the application of WSNs in areas such as industrial control, security and environmental monitoring. However, despite increasing popularity, the design of end-to-end software for WSNs is still an expert task since the choice of middleware protocols heavily influences the performance of resourceconstrained WSNs. As a consequence, WSN designers resort to discrete event simulation prior to deploying networks. While such simulations are reasonably accurate, they tend to be computationally expensive to run, especially for large networks. This particularly limits the number of distinct protocol configurations that engineers can test in advance of construction and hence their final setup may be suboptimal. To mitigate this effect we discuss how highly efficient mean-field techniques can be brought to bear on models of wireless sensor networks. In particular, we consider the practical modelling issues involved in constructing appropriately realistic Population CTMC (PCTMC) models of WSN protocols.
IEEE Transactions on Industrial Informatics, 2000
QoS metrics such as reliability, timeliness and system lifetime. The limited communication range of WSN nodes, link asymmetry and the characteristics of the physical environment lead to a major source of QoS degradation in WSNs -the "hidden node problem". In wireless contention-based Medium Access Control (MAC) protocols, when two nodes that are not visible to each other transmit to a third node that is visible to the formers, there will be a collision -called hidden-node or blind collision. This problem greatly impacts network throughput, energyefficiency and message transfer delays, and the problem dramatically increases with the number of nodes. This paper proposes H-NAMe, a very simple yet extremely efficient Hidden-Node Avoidance Mechanism for WSNs. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-hidden nodes that scales to multiple clusters via a cluster grouping strategy that guarantees no interference between overlapping clusters. Importantly, H-NAMe is instantiated in IEEE 802.15.4/ZigBee, which currently are the most widespread communication technologies for WSNs, with only minor add-ons and ensuring backward compatibility with their protocols standards. H-NAMe was implemented and exhaustively tested using an experimental test-bed based on "off-the-shelf" technology, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. H-NAMe effectiveness was also demonstrated in a target tracking application with mobile robots over a WSN deployment.