Hampered performance of migratory swans: intra- and inter-seasonal effects of avian influenza virus

The extent to which animal migrations shape parasite transmission networks is critically dependent on a migrant's ability to tolerate infection and migrate successfully. Yet, sub-lethal effects of parasites can be intensified through periods of increased physiological stress. Long-distance migrants may, therefore, be especially susceptible to negative effects of parasitic infection. Although a handful of studies have investigated the short-term, transmission-relevant behaviors of wild birds infected with low-pathogenic avian influenza viruses (LPAIV), the ecological consequences of LPAIV for the hosts themselves remain largely unknown. Here, we assessed the potential effects of naturally-acquired LPAIV infections in Bewick's swans, a long-distance migratory species that experiences relatively low incidence of LPAIV infection during early winter. We monitored both foraging and movement behavior in the winter of infection, as well as subsequent breeding behavior and inter-annual resighting probability over 3 years. Incorporating data on infection history we hypothesized that any effects would be most apparent in naïve individuals experiencing their first LPAIV infection. Indeed, significant effects of infection were only seen in birds that were infected but lacked antibodies indicative of prior infection. Swans that were infected but had survived a previous infection were indistinguishable from uninfected birds in each of the ecological performance metrics. Despite showing reduced foraging rates, individuals in the naïve-infected category had similar accumulated body stores to re-infected and uninfected individuals prior to departure on spring migration, possibly as a result of having higher scaled mass at the time of infection. And yet individuals in the naïve-infected category were unlikely to be resighted 1 year after infection, with 6 out of 7 individuals that never resighted again compared to 20 out of 63 uninfected individuals and 5 out of 12 individuals in the re-infected category. Collectively, our findings indicate that acute and superficially harmless infection with LPAIV may have indirect effects on individual performance and recruitment in migratory Bewick's swans. Our results also highlight the potential for infection history to play an important role in shaping ecological constraints throughout the annual cycle.

The effects of the social structure of digital networks on viral marketing performance

Viral marketing is a form of peer-to-peer communication in which individuals are encouraged to pass on promotional messages within their social networks. Conventional wisdom holds that the viral marketing process is both random and unmanageable. In this paper, we deconstruct the process and investigate the formation of the activated digital network as distinct from the underlying social network. We then consider the impact of the social structure of digital networks (random, scale free, and small world) and of the transmission behavior of individuals on campaign performance. Specifically, we identify alternative social network models to understand the mediating effects of the social structures of these models on viral marketing campaigns. Next, we analyse an actual viral marketing campaign and use the empirical data to develop and validate a computer simulation model for viral marketing. Finally, we conduct a number of simulation experiments to predict the spread of a viral message within different types of social network structures under different assumptions and scenarios. Our findings confirm that the social structure of digital networks play a critical role in the spread of a viral message. Managers seeking to optimize campaign performance should give consideration to these findings before designing and implementing viral marketing campaigns. We also demonstrate how a simulation model is used to quantify the impact of campaign management inputs and how these learnings can support managerial decision making.

Energy efficient, fully-connected mesh networks for high speed applications

Fully-connected mesh networks that can potentially be employed in a range of applications, are inherently associated with major deficiencies in interference management and network capacity improvement. The tree-connected (routing based) mesh networks used in today’s applications have major deficiencies in routing delays and reconfiguration delays in the implementation stage. This paper introduces a CDMA based fully-connected mesh network, which controls the transmission powers of the nodes in order to ensure that the communication channels remain interference-free and minimizes the energy consumption. Moreover, the bounds for the number of nodes and the spatial configuration are provided to ensures that the communication link satisfies the QoS (Quality of Service) requirements at all times.

Performance of smart antennas with receive diversity in wireless sensor networks

In this paper we propose a Geometrically Based Single Bounce Elliptical Model (GBSBEM) for multipath components involving randomly placed scatterers in the scattering region with sensors deployed on a field. The system model assumes a cluster based wireless sensor network (WSN) which collects information from the sensors, filters and modulates the data and transmit it through a wireless channel to be collected at the receiver. We first develop a GBSBE model and based on this model we develop our channel model. Use of Smart antenna system at the receiver end, which exploits various receive diversity combining techniques like Maximal Ratio Combining (MRC), Equal Gain Combining (EGC), and Selection Combining (SC), adds novelty to this system. The performance of these techniques have been proved through matlab simulations and further ahead based on different number of antenna elements present at the receiver array, we calculate the performance of our system in terms of bit-error-rate (BER). Based on the transmission power we quantify for the energy efficiency of our communication model.

Service-oriented wireless sensor networks and an energy-aware mesh routing algorithm

Service-oriented wireless sensor networks (WSNs) are being paid more and more attention because service computing can hide complexity of WSNs and enables simple and transparent access to individual sensor nodes. Existing WSNs mainly use IEEE 802.15.4 as their communication specification, however, this protocol suite cannot support IP-based routing and service-oriented access because it only specifies a set of physical- and MAC-layer protocols. For inosculating WSNs with IP networks, IEEE proposed a 6LoWPAN (IPv6 over LoW Power wireless Area Networks) as the adaptation layer between IP and MAC layers. However, it is still a challenging task how to discover and manage sensor resources, guarantee the security of WSNs and route messages over resource-restricted sensor nodes. This paper is set to address such three key issues. Firstly, we propose a service-oriented WSN architectural model based on 6LoWPAN and design a lightweight service middleware SOWAM (service-oriented WSN architecture middleware), where each sensor node provides a collection of services and is managed by our SOWAM. Secondly, we develop a security mechanism for the authentication and secure connection among users and sensor nodes. Finally, we propose an energyaware mesh routing protocol (EAMR) for message transmission in a WSN with multiple mobile sinks, aiming at prolonging the lifetime of WSNs as long as possible. In our EAMR, sensor nodes with the residual energy lower than a threshold do not forward messages for other nodes until the threshold is leveled down. As a result, the energy consumption is evened over sensor nodes significantly. The experimental results demonstrate the feasibility of our service-oriented approach and lightweight middleware SOWAM, as well as the effectiveness of our routing algorithm EAMR.

Matrix-based pairwise key establishment in wireless mesh networks using deployment knowledge

Due to the nature of wireless transmission, communication in wireless mesh networks (WMNs) is vulnerable to many adversarial activities including eavesdropping. Pairwise key establishment is one of the fundamental issues in securing WMNs. This paper presents a new matrix-based pairwise key establishment scheme for mesh clients. Our design is motivated by the fact that in WMNs, mesh routers are more powerful than mesh clients, both in computation and communication. By exploiting this heterogeneity, expensive operations can be delegated to mesh routers, which help alleviate the overhead of mesh clients during key establishment. The new scheme possesses two desirable features: (1) Neighbor mesh clients can directly establish pairwise keys; and (2) Communication and storage costs at mesh clients are significantly reduced.

Matrix-based pairwise key establishment with pre and post deployment knowledge for wireless mesh networks

The nature of wireless transmission leads to vulnerabilities to many malicious activities, and communication in wireless mesh networks (WMNs) must be protected by proper security measures. This paper focuses on symmetric pair wise key establishment and presents a new matrix-based pair wise key establishment scheme for mesh clients. In WMNs, mesh routers are much more powerful than mesh clients, both in communication and computation. By taking advantage of this heterogeneity, our new scheme delegates energy-consuming operations to mesh routers when establishing pair wise keys for mesh clients. Additionally, neighbor mesh clients in our scheme can directly establish pair wise keys with significantly reduced communication and storage costs, due to the use of both pre and post deployment knowledge.

Bloom filter based secure and anonymous DSR protocol in wireless ad hoc networks

Wireless ad hoc networks, especially in the hostile environment, are vulnerable to traffic analysis which allows the adversary to trace the routing messages and the sensitive data packets. Anonymity mechanism in ad hoc networks is a critical securing measure method employed to mitigate these problems. In this paper, we propose a novel secure and anonymous source routing protocol, called SADSR, based on Dynamic Source Routing (DSR) for wireless ad hoc networks. In the proposed scheme, we use the pseudonym, pseudonym based cryptography and the bloom filter to establish secure and anonymous routing in wireless ad hoc networks. Compared to other anonymous routing protocol, SADSR is not only anonymous but also the secure in the routing discover process and data transmission process.

Fabrication of conductive elastic nanocomposites via framing intact interconnected graphene networks

Electrically conductive elastic nanocomposites with well-organized graphene architectures offer significant improvement in various properties. However, achieving desirable graphene architectures in cross-linked rubber is challenging due to high viscosity and cross-linked nature of rubber matrices. Here, three dimensional (3D) interconnected graphene networks in natural rubber (NR) matrix are framed with self-assembly integrating latex compounding technology by employing electrostatic adsorption between poly(diallyldimethylammonium chloride) modified graphene (positively charged) and NR latex particles (negatively charged) as the driving force. The 3D graphene structure endows the resulted nanocomposites with excellent electrical conductivity of 7.31. S/m with a graphene content of 4.16. vol.%, extremely low percolation threshold of 0.21. vol.% and also analogous reinforcement in mechanical properties. The developed strategy will provide a practical approach for developing elastic nanocomposites with multi-functional properties. © 2014 Elsevier Ltd.

Analysis of backward congestion notification with delay for enhanced Ethernet networks

At present, companies and standards organizations are enhancing Ethernet as the unified switch fabric for all of the TCP/IP traffic, the storage traffic and the high performance computing traffic in data centers. Backward congestion notification (BCN) is the basic mechanism for the end-to-end congestion management enhancement of Ethernet. To fulfill the special requirements of the unified switch fabric, i.e., losslessness and low transmission delay, BCN should hold the buffer occupancy around a target point tightly. Thus, the stability of the control loop and the buffer size are critical to BCN. Currently, the impacts of delay on the performance of BCN are unidentified. When the speed of Ethernet increases to 40 Gbps or 100 Gbps in the near future, the number of on-the-fly packets becomes the same order with the buffer size of switch. Accordingly, the impacts of delay will become significant. In this paper, we analyze BCN, paying special attention on the delay. We model the BCN system with a set of segmented delayed differential equations, and then deduce sufficient condition for the uniformly asymptotic stability of BCN. Subsequently, the bounds of buffer occupancy are estimated, which provides direct guidelines on setting buffer size. Finally, numerical analysis and experiments on the NetFPGA platform verify our theoretical analysis.

A stochastic time-domain model for burst data aggregation in IEEE 802.15.4 wireless sensor networks

In many network applications, the nature of traffic is of burst type. Often, the transient response of network to such traffics is the result of a series of interdependant events whose occurrence prediction is not a trivial task. The previous efforts in IEEE 802.15.4 networks often followed top-down approaches to model those sequences of events, i.e., through making top-view models of the whole network, they tried to track the transient response of network to burst packet arrivals. The problem with such approaches was that they were unable to give station-level views of network response and were usually complex. In this paper, we propose a non-stationary analytical model for the IEEE 802.15.4 slotted CSMA/CA medium access control (MAC) protocol under burst traffic arrival assumption and without the optional acknowledgements. We develop a station-level stochastic time-domain method from which the network-level metrics are extracted. Our bottom-up approach makes finding station-level details such as delay, collision and failure distributions possible. Moreover, network-level metrics like the average packet loss or transmission success rate can be extracted from the model. Compared to the previous models, our model is proven to be of lower memory and computational complexity order and also supports contention window sizes of greater than one. We have carried out extensive and comparative simulations to show the high accuracy of our model.