Mobile beacon localization approaches have been proposed in the literature as an interesting alternative for centralized/decentralized approaches because of their low cost, their accuracy and their low energy consumpt...
详细信息
ISBN:
(纸本)9780769528892
Mobile beacon localization approaches have been proposed in the literature as an interesting alternative for centralized/decentralized approaches because of their low cost, their accuracy and their low energy consumption. However, their main drawback in a random deployment remains the lack of a well defined mobile beacon trajectory that ensures localization for all the nodes with acceptable error estimations. In this paper we give a solution to the question "What is the optimum mobile beacon trajectory and when should the beacon packets be sent?", and then we propose a simple localization algorithm. This algorithm is based on one mobile beacon. We study three different known curves and we justify the use of the Hilbert space filling curve to be the mobile beacon trajectory. We further compare the localization error of our proposed algorithm and other existing mobile beacon based algorithms. Our results are verified by simulation on Omnet++.
The routing methods which used in the wireless sensor network deal with the clustering method to diminish the amount of data transmission from the energy efficiency view. However, the clustering methods cause several ...
详细信息
ISBN:
(纸本)9780769528892
The routing methods which used in the wireless sensor network deal with the clustering method to diminish the amount of data transmission from the energy efficiency view. However, the clustering methods cause several problems in energy consumption at the cluster head node. Dynamic clustering is a method which used to supplement a high energy consumption problem by distributing energy consumption through the re-selection of the cluster head node. But, this method changes cluster structure every time the cluster head node is re-selected, which causes energy consumption. Namely, the dynamic clustering method approaches examined in previous researches involve the repetitive processes of cluster head node selection. This consumes a high amount of energy during the set-up process of cluster generation. Consequently, this paper proposes the hybrid clustering method that fixes the cluster and selects the head node in a round-robin method. The hybrid clustering approach is an energy-efficient method that realizes consistent and balanced energy consumption in each node of a generated cluster to prevent repetitious set-up processes as in the LEACH method. The propriety of the proposed method is substantiated with a simulation experiment.
In this paper, we extend the partitioning approach proposed in [1], which considers jointly channel allocation and transmission scheduling under the Primary Interference Constraint, into the more general model of wire...
详细信息
ISBN:
(纸本)9781424413119
In this paper, we extend the partitioning approach proposed in [1], which considers jointly channel allocation and transmission scheduling under the Primary Interference Constraint, into the more general model of wireless networks the Protocol Model, and discuss the application of the approach in the Physical Model.
Aiming at large-scale Wireless sensor Network(WSN) whose main communication mode is broadcast, the main factors restricting access performance of contention-based Media Access Control(MAC) protocols were analyzed in t...
详细信息
ISBN:
(纸本)0769529097
Aiming at large-scale Wireless sensor Network(WSN) whose main communication mode is broadcast, the main factors restricting access performance of contention-based Media Access Control(MAC) protocols were analyzed in this paper. Accordingly, a kind of adaptive probability Access mechanism was put forward, through which contention-based MAC protocols can transmit acknowledgement packet according to acknowledgement probability in the broadcast communication mode and adaptively adjust the acknowledgement probability on the basis of network status in the transmission window. Plentiful simulation results show that the MAC protocol based on the proposed adaptive probability acknowledgement mechanism has better access control performance and energy consumption performance.
In this paper, we address one of the wireless sensor network query;processing issues posed due to the lack of support for multiple sensor network queries. The objective of the paper is to provide efficient and effecti...
详细信息
ISBN:
(纸本)9781424413119
In this paper, we address one of the wireless sensor network query;processing issues posed due to the lack of support for multiple sensor network queries. The objective of the paper is to provide efficient and effective support to multiple queries so that the set of queries are pre-processed before disseminating them into the sensor network. It is very important that only necessary works will be assigned to the sensor network by virtue of strict energy constraint. The problem is modeled by Minimum Set Cover, which is one of the NP-complete problems. We propose an optimization scheme called TAMPA - a TAbu search-based Multiple queries oPtimizAtion to find an optimal merge order. The final set of queries to be sent into the network then can be derived from that merge order. We evaluate the proposed algorithm by conducting extensive simulation studies. The results show that energy can be significantly saved while the overall workload still satisfies the user requirements.
Service-Oriented Architectures provide integration of interoperability for independent and loosely coupled services. Web services and the associated new standards such as WSRF are frequently used to realise such Servi...
详细信息
ISBN:
(纸本)9780769530642
Service-Oriented Architectures provide integration of interoperability for independent and loosely coupled services. Web services and the associated new standards such as WSRF are frequently used to realise such Service-Oriented Architectures. In such systems, autonomic principles of self-configuration, self-optimisation, self-healing and self-adapting are desirable to ease management and improve robustness. In this paper we focus on the extension of the self management and autonomic behaviour of a WSRF container connected by a structured P2P overlay network to monitor and rectify its QoS to satisfy its SLAs. The SLA plays an important role during two distinct phases in the life-cycle of a WSRF container Firstly during service deployment when services are assigned to containers in such a way as to minimise the threat of SLA violations, and secondly during maintenance when violations are detected and services are migrated to other containers to preserve QoS. In addition, as the architecture has been designed and built using standardised modem technologies and with high levels of transparency, conventional web services can be deployed with the addition of a SLA specification.
Data is dynamically structured by nature and can be highly diverse and multifaceted. Often, such diverse and complex information needs to be linked. Conventional datastores, such as relational databases, do not conven...
详细信息
ISBN:
(纸本)9780769530642
Data is dynamically structured by nature and can be highly diverse and multifaceted. Often, such diverse and complex information needs to be linked. Conventional datastores, such as relational databases, do not conveniently accommodate dynamically varying structures, as frequently modifying database schemas is not feasible. rdF triplestores offer a flexible solution for handling such data, where any property about an entity can be described by a triple having a subject, a predicate, and an object. Also, data is inherently distributed due to origination points, ownership and many other reasons. Furthermore, storing data in triplestores gives rise to the need to distribute data due to the large number of triples that would result by migrating existing data from a database, for example. In this paper we present our work on designing index structures in order to facilitate efficient querying of a distributed triplestore (DTS). The distributed querying algorithm in DTS makes use of a sub-graph isomorphism approach to eliminate traversing edges between triplestores that does not have the potential to produce any results. We show that our triplestore has equivalent performance as 3Store when used in a non-distributed mode. Our performance tests in the distributed mode show that the indexes improve efficiency of querying.
Power conservation is one of the primary issues to be taken care of in wireless sensor networks. Due to the limited battery life, the need to choose an appropriate transmit power becomes more important also to guarant...
详细信息
ISBN:
(纸本)9781424413119
Power conservation is one of the primary issues to be taken care of in wireless sensor networks. Due to the limited battery life, the need to choose an appropriate transmit power becomes more important also to guarantee a maximal connectivity. Transmitting at the least possible power to prolong the network lifetime as a whole while also guaranteeing the best connectivity would be our main interest. We have worked in this paper to look for the most optimum transmit power while also considering the data rates and bow densely the nodes are deployed. We investigated the effects of the transmit power on the network and nodes lifetime thus aiming to prolong the network life by choosing the correct approach.
In wireless sensor network (WSN), one of the most critical issues is to minimize the energy consumption. The use of cooperative multiple-input multiple-output (MIMO) communication can save a lot of transmission energy...
详细信息
ISBN:
(纸本)9781424413119
In wireless sensor network (WSN), one of the most critical issues is to minimize the energy consumption. The use of cooperative multiple-input multiple-output (MIMO) communication can save a lot of transmission energy. However, how to organize the WSN based on MIMO remains a critical challenge. In this paper, a novel clustering-CH-exchange-method (CCEM) is proposed to apply cooperative MIMO in WSN. CCEM firstly selects some cluster heads (CHs) and partitions the network into clusters. Then the CH in each cluster finds cooperative nodes to form MIMO antennas. The CH exchange operation runs if CH can't rind enough cooperative nodes. The energy consumption of the network is developed. Simulation results show that CCEM provides high success probability of forming complete MIMO overlay network and significant energy efficiencies.
How to estimate the collaborative detection probability (CDP) for given certain number of sensors, characteristics of sensor and target is an important problem for coverage in large-scale WSN. A triangular analytical ...
详细信息
ISBN:
(纸本)9781424413119
How to estimate the collaborative detection probability (CDP) for given certain number of sensors, characteristics of sensor and target is an important problem for coverage in large-scale WSN. A triangular analytical model (TAM) is developed to analyze CDP for a randomly deployment sensors in a 2-dimensional region. Making use of binomially stochastic distribution and normalization analysis methods, we theoretically characterize the relationship between the CDP for 3 collaborative sensors with the factors of sensor normalization node density (NND) and normalization specified path length (NSPL) on an assumption of target moving direction in parallel to X-axis, and work out a lower bounds on the CDP for 3 collaborative sensors at worst case on condition of NSPL no more than 1. The simulations of random deployment of sensors and target randomly moving direction show that the mobile target moving direction assumed in theoretical analysis has little influence on the detection performance analysis, and that the CDP for 3 collaborative sensors can be evaluated by the NND and the NSPL.
暂无评论