Description:
For many applications, simultaneous sensing of a number of parameters is crucial that leads to the deployment of multiple classes of sensors having different initial energy, data generation rate and deployment density within the vicinity of a cluster as opposed to identical sensors assumed in the existing heterogeneous sensor networks. For data transmission to cluster head, such networks use single hop, multi hop and their hybrid as intra-cluster transmission policy which suffer highly from non-uniform energy usage among sensors, thereby reducing the lifetime drastically leaving considerable amount of energy in many nodes. In this paper, we propose a framework for multi-class heterogeneous sensor networks where incoming traffic is relayed towards cluster head in collaboration among multiple classes of sensors considering their heterogeneity. We also propose two transmission policies for this framework considering generic polygonal cluster and limited transmission range for individual sensors. Performance analysis shows substantial improvement of overall lifetime by the collaborative framework of multi-class sensors. Our proposed transmission policies further improve the lifetime over existing multi hop and hybrid communications through better distribution of energy usage among sensors.kam
Description:
Most existing data models and transmission policies for sensor network assume uniform periodic data generation and unconstrained transmission range for sensor nodes, both assumptions being too restrictive to capture and analyze real- world operation for practical deployment. In this paper, we consider these two practical aspects and present a new transmission policy formulated after (i) stochastic data model where a set of events occur with certain probabilities and rate of data generation by a sensor varies based on sensed event and (ii) limited transmission range of sensors. Assuming co-centric rings around the base station, located at a generic location (internal or external to the network area), ring thickness and hope sizes over lifetime is determined by formatting an optimization problem where nodes in each ring may transmit data at different hop sizes at a given instant and also vary hop sizes over lifetime. Performance analysis shows significant improvement in network lifetime and better uniformity in energy usage distribution in the proposed policy irrespective of network size and maximum allowable transmission range of nodes.
Description:
Although transmission policy is crucial in extending lifetime of sensor networks, most existing policies make simplified assumptions which include: i) circular cluster with cluster head (CH) at the center, ii) uniform periodic data generation model and iii) unrestricted transmission range for nodes. But, in practice, these assumptions are too restrictive for real-world deployment of heterogeneous sensor networks where clusters are usually polygonal. Moreover, in multi hop transmission energy consumption by sensors varies greatly with their distance from CH and even among sensors in the critical ring due to non-uniform relay traffic caused by asymmetric polygonal structure of cluster. In this paper, we propose a new transmission policy where sensors transmit at optimally determined hop sizes that varies over lifetime and a distributed hop selection algorithm that regulates each packet's arrival to CH within a given hop limit. Our formulation considers generic polygonal cluster, stochastic data generation model where data generation rate by sensors vary with events and limited transmission range for sensors. Performance analysis shows significant improvement in lifetime and better uniformity in energy usage among sensors in the proposed policy irrespective of cluster size, hop limit and maximum allowable transmission range of nodes
Description:
Transmission policy, in addition to topology control, routing, and MAC protocols, can play a vital role in extending network lifetime. Existing transmission policies, however, cause an extremely unbalanced energy usage that contributes to early demise of some sensors reducing overall network's lifetime drastically. Considering cocentric rings around the sink, we decompose the transmission distance of traditional multihop scheme into two parts: ring thickness and hop size, analyze the traffic and energy usage distribution among sensors and determine how energy usage varies and critical ring shifts with hop size. Based on above observations, we propose a transmission scheme and determine the optimal ring thickness and hop size by formulating network lifetime as an optimization problem. Numerical results show substantial improvements in terms of network lifetime and energy usage distribution over existing policies. Two other variations of this policy are also presented by redefining the optimization problem considering: 1) concomitant hop size variation by sensors over lifetime along with optimal duty cycles, and 2) a distinct set of hop sizes for sensors in each ring. Both variations bring increasingly uniform energy usage with lower critical energy and further improves lifetime. A heuristic for distributed implementation of each policy is also presented.
Description:
Transmission policy, in addition to topology control, routing, and MAC protocols, can play a vital role in extending network lifetime. Existing transmission policies, however, cause an extremely unbalanced energy usage that contributes to early demise of some sensors reducing overall network's lifetime drastically. Considering cocentric rings around the sink, we decompose the transmission distance of traditional multihop scheme into two parts: ring thickness and hop size, analyze the traffic and energy usage distribution among sensors and determine how energy usage varies and critical ring shifts with hop size. Based on above observations, we propose a transmission scheme and determine the optimal ring thickness and hop size by formulating network lifetime as an optimization problem. Numerical results show substantial improvements in terms of network lifetime and energy usage distribution over existing policies. Two other variations of this policy are also presented by redefining the optimization problem considering: 1) concomitant hop size variation by sensors over lifetime along with optimal duty cycles, and 2) a distinct set of hop sizes for sensors in each ring. Both variations bring increasingly uniform energy usage with lower critical energy and further improves lifetime. A heuristic for distributed implementation of each policy is also presented.
Description:
Background: We hypothesised that alternating inhibitors of the vascular endothelial growth factor receptor (VEGFR) and mammalian target of rapamycin pathways would delay the development of resistance in advanced renal cell carcinoma (aRCC). Patients and methods: A single-arm, two-stage, multicentre, phase 2 trial to determine the activity, feasibility, and safety of 12-week cycles of sunitinib 50 mg daily 4 weeks on / 2 weeks off, alternating with everolimus 10 mg daily for 5 weeks on / 1 week off, until disease progression or prohibitive toxicity in favourable or intermediate-risk aRCC. The primary end point was proportion alive and progression-free at 6 months (PFS6m). The secondary end points were feasibility, tumour response, overall survival (OS), and adverse events (AEs). The correlative objective was to assess biomarkers and correlate with clinical outcome. Results: We recruited 55 eligible participants from September 2010 to August 2012. Demographics: mean age 61, 71% male, favourable risk 16%, intermediate risk 84%. Cycle 2 commenced within 14 weeks for 80% of participants; 64% received >= 22 weeks of alternating therapy; 78% received >= 22 weeks of any treatment. PFS6m was 29/55 (53%; 95% confidence interval [CI] 40% to 66%). Tumour response rate was 7/55 (13%; 95% CI 4% to 22%, all partial responses). After median follow-up of 20 months, 47 of 55 (86%) had progressed with a median progression-free survival of 8 months (95% CI 5-10), and 30 of 55 (55%) had died with a median OS of 17 months (95% CI 12-undefined). AEs were consistent with those expected for each single agent. No convincing prognostic biomarkers were identified. Conclusions: The EVERSUN regimen was feasible and safe, but its activity did not meet pre-specified values to warrant further research. This supports the current approach of continuing anti-VEGF therapy until progression or prohibitive toxicity before changing treatment.
Description:
Existing in-network query processing techniques are categorized as approximation and aggregation based approaches, where the former achieves lower network traffic at the expense of query response accuracy, whereas the later reduces query response inaccuracy by executing queries at the actual sensor nodes which necessitates the overhead of query specific sensor selection mechanism. In this paper, we propose a hybrid query processing framework that combines the advantages of both the approximation and aggregation based techniques and avoids their limitations. In our approach, we construct a hierarchical probabilistic data model representing the overall sensor data characteristics across the network, which is query independent and is later used for selecting sensor nodes to process user queries. Experimental results illustrate the efficacy of the proposed framework compared to contemporary approximation and aggregation based query processing techniques.
Description:
Wireless sensor networks promise to guarantee accurate, fault tolerant and timely detection of events in large scale sensor fields. To achieve this the notion of k-coverage is widely employed in WSNs where significant redundancy is introduced in deployment as an event is expected to be sensed by at least k sensors in the neighborhood. As sensor density increases significantly with k, it is imperative to find the optimal k for the underlying event detection system. In this work, we consider the detection probability, fault tolerance and latency as the Quality of Service (QoS) metrics of an event detection system employing k-coverage and present a probabilistic model to guarantee given QoS support with the minimum degree of coverage taking into account the noise related measurement error, communication interference and sensor fault probability. This work eventually resolves the problem of over or under deployment of sensors, increases scalability and provides a well defined mechanism to tune the degree of coverage according to performance needs.
Description:
Wireless sensor networks promise to guarantee accurate, fault tolerant and timely detection of events in large scale sensor fields. To achieve this the notion of k-coverage is widely employed in WSNs where significant redundancy is introduced in deployment as an event is expected to be sensed by at least k sensors in the neighborhood. As sensor density increases significantly with k, it is imperative to find the optimal k for the underlying event detection system. In this work, we consider the detection probability, fault tolerance and latency as the Quality of Service (QoS) metrics of an event detection system employing k-coverage and present a probabilistic model to guarantee given QoS support with the minimum degree of coverage taking into account the noise related measurement error, communication interference and sensor fault probability. This work eventually resolves the problem of over or under deployment of sensors, increases scalability and provides a well defined mechanism to tune the degree of coverage according to performance needs.
Description:
The wireless networked sensors embedded with everyday objects will become an integral part of Future Internet, where the interaction among people, computer and those objects will shift the current Internet to a new paradigm, namely the Internet of Things. The terabyte torrent of data generated by billions of sensors belonging to a large number of distributed heterogeneous sensor networks in Future Internet will only be valuable if they can be effectively used on purpose, which leads to the necessity of an Internet scale query processing framework. In this paper, firstly, we focus on the distinct challenges present in Internet scale query processing over distributed sensor networks. Then, we propose a flexible and scalable system architecture capable of handling the complex scenario that might arise from the integration of a large number of such networks in Future Internet. Finally, we discuss the overall query processing methodology over such system and present some directions on the possible solutions to a number of identified research challenges. The outcome of this paper would foster the sensor network research in Future Internet domain
Description:
Security and privacy protection are very critical requirements for the widespread deployment of RFID technologies for commercial applications. In this chapter, the authors first present the security and privacy requirement of any commercial system, and then highlight the security and privacy threats that are unique to an RFID system. The security and privacy preserving protocols for RFID system proposed in literature are elaborately discussed, analyzing their strengths, vulnerabilities, and implementation issues. The open research challenges that need further investigation, especially with the rapid introduction of diverse RFID applications, are also presented.
Description:
Radio Frequency Identification (RFID) systems and Wireless Sensor Networks (WSNs) are believed to be the two most important technologies in realizing the ubiquitous computing vision of Future Internet. RFID technology provides much cheaper solution for object identification and tracking based on radio wave. On the other hand, data on various parameters about the physical environment can be acquired using WSNs. Integration of the advantages of both RFID systems and WSNs would benefit many application domains. In RFID system, either an active RFID tag itself or an RFID reader (reading passive or semi-passive tags) consisting of an RF transceiver poses communication capability similar to that for nodes in WSNs. Therefore, instead of using single hop RFID protocol, RFID networks can take advantage of WSN-like multihop communication, and in this regard a number of WSN protocols can be useful for such RFID systems. In this chapter we present possible scenario of the integration of RFID system and WSNs and study a number of wireless sensor network protocols suitable to use in RFID system.