The complexity of distributedcomputingsystems and their increasing interaction with the physical world impose challenging requirements in terms of adaptation, robustness, and resilience to attack. Based on their rel...
详细信息
ISBN:
(纸本)9781424448906
The complexity of distributedcomputingsystems and their increasing interaction with the physical world impose challenging requirements in terms of adaptation, robustness, and resilience to attack. Based on their reliance on heuristics, algorithms for consensus, where members of a group agree on a course of action, are particularly sensitive to these conditions. Given the ability of natural organisms to respond to adversity, many researchers have investigated biologically-inspired approaches to designing robust distributedsystems. In this paper, we describe a study in the use of digital evolution, a type of artificial life system, to produce a distributed behavior for reaching consensus. The evolved algorithm employs a novel mechanism for probabilistically reaching consensus based on the frequency of messaging. Moreover, this design approach enables us to change parameters based on the specifics of the desired system, with evolution producing corresponding flavors of consensus algorithms. Our results demonstrate that artificial life systems can be used to discover solutions to engineering problems, and that experiments in artificial life can inspire new studies in distributed protocol development.
Energy efficiency in wireless sensor network has gained important. Energy efficient routing algorithms are proposed to increase the lifetime of the network. Routing energy is consumed in topology assessesments where t...
详细信息
ISBN:
(纸本)9781467345286
Energy efficiency in wireless sensor network has gained important. Energy efficient routing algorithms are proposed to increase the lifetime of the network. Routing energy is consumed in topology assessesments where the sink broadcast the message and after receiving the acknowledgement assesses the current topology of the network. Our work studies the topological behavior of WSN and proposed an algorithm which can maximize the lifetime by reducing communication overheads increase due to topology assessments.
The deployment of complex, multi-threaded sensor network applications is growing rapidly (e.g there are dual-core sensor mote platforms such as the Microsoft m-platform). This paper argues that parallelism can benefit...
详细信息
ISBN:
(纸本)9781467347211
The deployment of complex, multi-threaded sensor network applications is growing rapidly (e.g there are dual-core sensor mote platforms such as the Microsoft m-platform). This paper argues that parallelism can benefit networked sensors, particularly if it is based on a safe approach, i.e., follows a deadlock-free paradigm. sensor network applications should be deadlock-free because applications running on sensor networks are often critical and thus, it is undesirable to encounter concurrency problems in such environments. This paper presents an approach to ensuring safe parallelism in sensor networks and shows a number of potential benefits to this domain. This is particularly highlighted by a case study on runtime reconfigurable wireless network communication that promotes deadlock-free reconfigurable parallelism.
Energy efficiency is main design issue for protocols of wireless sensor networks. Node clustering is an energy efficient approach for sensor networks. In clustering algorithms, nodes are grouped into independent clust...
详细信息
ISBN:
(纸本)9781467345286
Energy efficiency is main design issue for protocols of wireless sensor networks. Node clustering is an energy efficient approach for sensor networks. In clustering algorithms, nodes are grouped into independent clusters and each cluster has a cluster head. Data units gathered at base station depends upon lifetime of network. Cluster head selection is an important issue for energy efficiency of clustering schemes. Intra cluster communication distance depends upon position of cluster head in cluster. In this paper, a new cluster head selection scheme is proposed. Proposed scheme can be implemented with any distributed clustering scheme. In proposed scheme, network area is divided into two parts: border area and inner area. Scheme restricts cluster head selection to only inner area nodes. Scheme is implemented and simulated with LEACH in NS-2. Simulation shows that proposed scheme significantly outperform LEACH for network lifetime and data gathering rate.
In this paper, the input-output finite-time stability and stabilization for distributed parameter systems was studied. The concept of input-output finite-time stability for distributed parameter systems was defined. B...
详细信息
ISBN:
(纸本)9781538604854
In this paper, the input-output finite-time stability and stabilization for distributed parameter systems was studied. The concept of input-output finite-time stability for distributed parameter systems was defined. By employing Lyapunov functional theory, sufficient conditions of input-output finitetime stability for distributed parameter systems were given. Sufficient conditions for the existence of distributed state feedback controllers which ensure the closed-loop distributed parameter systems be input-output finite-time stable were also proposed. Finally, a numerical example was given to illustrate our results.
The EU funded ANGEL project focuses on the development and deployment of wireless sensor networks building ambient intelligence systems for assisted-living and personal health monitoring. The provision of security ser...
详细信息
ISBN:
(纸本)9781424443093
The EU funded ANGEL project focuses on the development and deployment of wireless sensor networks building ambient intelligence systems for assisted-living and personal health monitoring. The provision of security services such as confidentiality and authentication is a fundamental requirement for ANGEL in order to ensure the safety and privacy of the users;the technical realization is challenging due to the high mobility of users accessing a multitude of wireless sensor networks. Our security architecture ensures the secure deployment and efficient, yet secure operation of ANGEL systems. Based on keying-material distribution, we provide a solution for the secure configuration of sensors and gateways. This ensures that users can interact with their system in an easy, transparent and safe way. We further introduce a fast distributed key agreement protocol on top of ZigBee that enables very fast and efficient operation. Performance and security analysis point out the advantages of our new solution.
The paper aims to provide an energy efficient routing algorithm for Wireless sensor Networks (WSNs). Clustering is a technique widely adopted in WSNs. It divides the network into clusters and the cluster heads are res...
详细信息
ISBN:
(纸本)9781479970025
The paper aims to provide an energy efficient routing algorithm for Wireless sensor Networks (WSNs). Clustering is a technique widely adopted in WSNs. It divides the network into clusters and the cluster heads are responsible for forwarding the aggregated data to the sink. There are many algorithms for forwarding the data to the sink. In this paper, a Game theory based Energy efficient Routing Algorithm (GERA) is proposed. As a clustering algorithm GERA adopts game theory and set a utility function based on the benefit and energy consumption of the node. Cluster heads are selected based on the utility function of the node iteratively. The cluster formation is done based on the cost function of the node in the network. Also an intra-cluster and multi-hop inter-cluster routing algorithms are designed and the simulation results shows that cluster heads are evenly distributed. The proposed routing algorithm consumes less energy than other existing algorithms such as Low Energy Adaptive Clustering Hierarchy (LEACH) and Density-based Energy-efficient Game-theoretic Routing Algorithm (DEGRA). Also the network lifetime is largely prolonged.
暂无评论