FuGeF: A Resource Bound Secure Forwarding Protocol for Wireless Sensor Networks.

Science.gov (United States)

Umar, Idris Abubakar; Mohd Hanapi, Zurina; Sali, A; Zulkarnain, Zuriati A

2016-06-22

Resource bound security solutions have facilitated the mitigation of spatio-temporal attacks by altering protocol semantics to provide minimal security while maintaining an acceptable level of performance. The Dynamic Window Secured Implicit Geographic Forwarding (DWSIGF) routing protocol for Wireless Sensor Network (WSN) has been proposed to achieve a minimal selection of malicious nodes by introducing a dynamic collection window period to the protocol's semantics. However, its selection scheme suffers substantial packet losses due to the utilization of a single distance based parameter for node selection. In this paper, we propose a Fuzzy-based Geographic Forwarding protocol (FuGeF) to minimize packet loss, while maintaining performance. The FuGeF utilizes a new form of dynamism and introduces three selection parameters: remaining energy, connectivity cost, and progressive distance, as well as a Fuzzy Logic System (FLS) for node selection. These introduced mechanisms ensure the appropriate selection of a non-malicious node. Extensive simulation experiments have been conducted to evaluate the performance of the proposed FuGeF protocol as compared to DWSIGF variants. The simulation results show that the proposed FuGeF outperforms the two DWSIGF variants (DWSIGF-P and DWSIGF-R) in terms of packet delivery.

An Improved Forwarding of Diverse Events with Mobile Sinks in Underwater Wireless Sensor Networks.

Science.gov (United States)

Raza, Waseem; Arshad, Farzana; Ahmed, Imran; Abdul, Wadood; Ghouzali, Sanaa; Niaz, Iftikhar Azim; Javaid, Nadeem

2016-11-04

In this paper, a novel routing strategy to cater the energy consumption and delay sensitivity issues in deep underwater wireless sensor networks is proposed. This strategy is named as ESDR: Event Segregation based Delay sensitive Routing. In this strategy sensed events are segregated on the basis of their criticality and, are forwarded to their respective destinations based on forwarding functions. These functions depend on different routing metrics like: Signal Quality Index, Localization free Signal to Noise Ratio, Energy Cost Function and Depth Dependent Function. The problem of incomparable values of previously defined forwarding functions causes uneven delays in forwarding process. Hence forwarding functions are redefined to ensure their comparable values in different depth regions. Packet forwarding strategy is based on the event segregation approach which forwards one third of the generated events (delay sensitive) to surface sinks and two third events (normal events) are forwarded to mobile sinks. Motion of mobile sinks is influenced by the relative distribution of normal nodes. We have also incorporated two different mobility patterns named as; adaptive mobility and uniform mobility for mobile sinks. The later one is implemented for collecting the packets generated by the normal nodes. These improvements ensure optimum holding time, uniform delay and in-time reporting of delay sensitive events. This scheme is compared with the existing ones and outperforms the existing schemes in terms of network lifetime, delay and throughput.

Performance analysis of multi-hop wireless packet networks

Directory of Open Access Journals (Sweden)

Lim J.-T.

1997-01-01

Full Text Available In this paper, a unified analytical framework for performance analysis of multi-hop wireless packet networks is developed. The effect of coupling between the hops on the degradation of the delay-throughput characteristics and the probability of blocking is investigated. The issue of hop decoupling is addressed.

A Routing Strategy for Non-Cooperation Wireless Multi-Hop Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Dung T. Tran

2012-01-01

Full Text Available Choosing routes such that the network lifetime is maximized in a wireless network with limited energy resources is a major routing problem in wireless multi-hop ad hoc networks. In this paper, we study the problem where participants are rationally selfish and non-cooperative. By selfish we designate the users who are ready to tamper with their source-routing (senders could choose intermediate nodes in the routing paths or next hop selection strategies in order to increase the total number of packets transmitted, but do not try to harm or drop packets of the other nodes. The problem therefore amounts to a non-cooperative game. In the works [2,6,19,23], the authors show that the game admits Nash equilibria [1]. Along this line, we first show that if the cost function is linear, this game has pure-strategy equilibrium flow even though participants have different demands. However, finding a Nash equilibrium for a normal game is computationally hard [9]. In this work, inspired by mixed-strategy equilibrium, we propose a simple local routing algorithm called MIxed Path Routing protocol (MiPR. Using analysis and simulations, we show that MiPR drives the system to an equilibrium state where selfish participants do not have incentive to deviate. Moreover, MiPR significantly improves the network lifetime as compared to original routing protocols.

Novel Scheme for Packet Forwarding without Header Modifications in Optical Networks

DEFF Research Database (Denmark)

Wessing, Henrik; Christiansen, Henrik Lehrmann; Fjelde, Tina

2002-01-01

We present a novel scheme for packet forwarding in optical packet-switched networks and we further demonstrate its good scalability through simulations. The scheme requires neither header modification nor any label distribution protocol, thus reducing component cost while simplifying network...

Fair packet scheduling in Wireless Mesh Networks

KAUST Repository

Nawab, Faisal

2014-02-01

In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wireless Mesh Networks (WMNs). We use a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically determine the throughput. Based on the developed model, we propose a distributed MAC protocol called Timestamp-ordered MAC (TMAC), aiming to alleviate the unfairness problem in WMNs. TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended with a timestamp to a selected list of neighbors. It can proceed with the transmission only if it receives a sufficient number of grant control messages from these neighbors. A grant message indicates that the associated data packet has the lowest timestamp of all the packets pending transmission at the local transmit queue. We demonstrate that a loose ordering of timestamps among neighboring nodes is sufficient for enforcing local fairness, subsequently leading to flow rate fairness in a multi-hop WMN. We show that TMAC can be implemented using the control frames in IEEE 802.11, and thus can be easily integrated in existing 802.11-based WMNs. Our simulation results show that TMAC achieves excellent resource allocation fairness while maintaining over 90% of maximum link capacity across a large number of topologies.

Fast Packet forwarding Engine Based on Software Circuits

NARCIS (Netherlands)

Makkes, M.X.; Varabanescu, A.; Laat, C. de; Meijer, R.J.

2015-01-01

Forwarding packets is part of the performance critical path of routing devices, and affects the network performance at any scale. This operation is typically performed by dedicated routing boxes, which are fast, but expensive and inflexible. Recent work has shown that in many cases commodity

Packets distribution in a tree-based topology wireless sensor networks

CSIR Research Space (South Africa)

Akpakwu, GA

2016-07-01

Full Text Available The concept of data distribution within cluster of sensor nodes to the source sink has resulted to intense research in Wireless Sensor Networks (WSNs). In this paper, in order to determine the scheduling length of packet distribution, a tree...

Robust Controller for Delays and Packet Dropout Avoidance in Solar-Power Wireless Network

OpenAIRE

Al-Azzawi, Waleed

2013-01-01

Solar Wireless Networked Control Systems (SWNCS) are a style of distributed control systems where sensors, actuators, and controllers are interconnected via a wireless communication network. This system setup has the benefit of low cost, flexibility, low weight, no wiring and simplicity of system diagnoses and maintenance. However, it also unavoidably calls some wireless network time delays and packet dropout into the design procedure. Solar lighting system offers a clean environment, therefo...

Handbook on theoretical and algorithmic aspects of sensor, ad hoc wireless, and peer-to-peer networks

CERN Document Server

Wu, Jie

2005-01-01

PrefaceAD HOC WIRELESS NETWORKSA Modular Cross Layer Architecture for Ad Hoc Networks, M. Conti, J. Crowcroft, G. Maselli, and G. TuriRouting Scalability in MANETs, J. Eriksson, S. Krishnamurthy and M. FaloutsosUniformly Distributed Algorithm for Virtual Backbone Routing in Ad Hoc Wireless Networks, D.S. KimMaximum Necessary Hop Count for Packet Routing in MANET, X. Chen and J. ShenEfficient Strategyproof Multicast in Selfish Wireless Networks, X.-Yang LiGeocasting in Ad Hoc and Sensor Networks, I. StojmenovicTopology Control for Ad hoc Networks: Present Solutions and Open Issues, C.-C. Shen a

A Game Theory-Based Obstacle Avoidance Routing Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Shujun Bi

2011-09-01

Full Text Available The obstacle avoidance problem in geographic forwarding is an important issue for location-based routing in wireless sensor networks. The presence of an obstacle leads to several geographic routing problems such as excessive energy consumption and data congestion. Obstacles are hard to avoid in realistic environments. To bypass obstacles, most routing protocols tend to forward packets along the obstacle boundaries. This leads to a situation where the nodes at the boundaries exhaust their energy rapidly and the obstacle area is diffused. In this paper, we introduce a novel routing algorithm to solve the obstacle problem in wireless sensor networks based on a game-theory model. Our algorithm forms a concave region that cannot forward packets to achieve the aim of improving the transmission success rate and decreasing packet transmission delays. We consider the residual energy, out-degree and forwarding angle to determine the forwarding probability and payoff function of forwarding candidates. This achieves the aim of load balance and reduces network energy consumption. Simulation results show that based on the average delivery delay, energy consumption and packet delivery ratio performances our protocol is superior to other traditional schemes.

Algorithms for energy efficiency in wireless sensor networks

Energy Technology Data Exchange (ETDEWEB)

Busse, M

2007-01-21

The recent advances in microsensor and semiconductor technology have opened a new field within computer science: the networking of small-sized sensors which are capable of sensing, processing, and communicating. Such wireless sensor networks offer new applications in the areas of habitat and environment monitoring, disaster control and operation, military and intelligence control, object tracking, video surveillance, traffic control, as well as in health care and home automation. It is likely that the deployed sensors will be battery-powered, which will limit the energy capacity significantly. Thus, energy efficiency becomes one of the main challenges that need to be taken into account, and the design of energy-efficient algorithms is a major contribution of this thesis. As the wireless communication in the network is one of the main energy consumers, we first consider in detail the characteristics of wireless communication. By using the embedded sensor board (ESB) platform recently developed by the Free University of Berlin, we analyze the means of forward error correction and propose an appropriate resync mechanism, which improves the communication between two ESB nodes substantially. Afterwards, we focus on the forwarding of data packets through the network. We present the algorithms energy-efficient forwarding (EEF), lifetime-efficient forwarding (LEF), and energy-efficient aggregation forwarding (EEAF). While EEF is designed to maximize the number of data bytes delivered per energy unit, LEF additionally takes into account the residual energy of forwarding nodes. In so doing, LEF further prolongs the lifetime of the network. Energy savings due to data aggregation and in-network processing are exploited by EEAF. Besides single-link forwarding, in which data packets are sent to only one forwarding node, we also study the impact of multi-link forwarding, which exploits the broadcast characteristics of the wireless medium by sending packets to several (potential

Algorithms for energy efficiency in wireless sensor networks

Energy Technology Data Exchange (ETDEWEB)

Busse, M.

2007-01-21

The recent advances in microsensor and semiconductor technology have opened a new field within computer science: the networking of small-sized sensors which are capable of sensing, processing, and communicating. Such wireless sensor networks offer new applications in the areas of habitat and environment monitoring, disaster control and operation, military and intelligence control, object tracking, video surveillance, traffic control, as well as in health care and home automation. It is likely that the deployed sensors will be battery-powered, which will limit the energy capacity significantly. Thus, energy efficiency becomes one of the main challenges that need to be taken into account, and the design of energy-efficient algorithms is a major contribution of this thesis. As the wireless communication in the network is one of the main energy consumers, we first consider in detail the characteristics of wireless communication. By using the embedded sensor board (ESB) platform recently developed by the Free University of Berlin, we analyze the means of forward error correction and propose an appropriate resync mechanism, which improves the communication between two ESB nodes substantially. Afterwards, we focus on the forwarding of data packets through the network. We present the algorithms energy-efficient forwarding (EEF), lifetime-efficient forwarding (LEF), and energy-efficient aggregation forwarding (EEAF). While EEF is designed to maximize the number of data bytes delivered per energy unit, LEF additionally takes into account the residual energy of forwarding nodes. In so doing, LEF further prolongs the lifetime of the network. Energy savings due to data aggregation and in-network processing are exploited by EEAF. Besides single-link forwarding, in which data packets are sent to only one forwarding node, we also study the impact of multi-link forwarding, which exploits the broadcast characteristics of the wireless medium by sending packets to several (potential

QoS Differentiated and Fair Packet Scheduling in Broadband Wireless Access Networks

Directory of Open Access Journals (Sweden)

Zhang Yan

2009-01-01

Full Text Available This paper studies the packet scheduling problem in Broadband Wireless Access (BWA networks. The key difficulties of the BWA scheduling problem lie in the high variability of wireless channel capacity and the unknown model of packet arrival process. It is difficult for traditional heuristic scheduling algorithms to handle the situation and guarantee satisfying performance in BWA networks. In this paper, we introduce learning-based approach for a better solution. Specifically, we formulate the packet scheduling problem as an average cost Semi-Markov Decision Process (SMDP. Then, we solve the SMDP by using reinforcement learning. A feature-based linear approximation and the Temporal-Difference learning technique are employed to produce a near optimal solution of the corresponding SMDP problem. The proposed algorithm, called Reinforcement Learning Scheduling (RLS, has in-built capability of self-training. It is able to adaptively and timely regulate its scheduling policy according to the instantaneous network conditions. Simulation results indicate that RLS outperforms two classical scheduling algorithms and simultaneously considers: (i effective QoS differentiation, (ii high bandwidth utilization, and (iii both short-term and long-term fairness.

Spatial reuse of wireless medium in multi-hop wireless sensor networks

NARCIS (Netherlands)

Geerlings, J.; Geerlings, J.; van Hoesel, L.F.W.; Hoeksema, F.W.; Slump, Cornelis H.; Havinga, Paul J.M.

2007-01-01

The idea of multi-hop communication originates from the 1990’s and is eagerly incorporated in the wireless sensor network research field, since a tremendous amount of energy can be saved by letting —often battery powered– nodes in the network assist each other in forwarding packets. In such systems

A novel lost packets recovery scheme based on visual secret sharing

Science.gov (United States)

Lu, Kun; Shan, Hong; Li, Zhi; Niu, Zhao

2017-08-01

In this paper, a novel lost packets recovery scheme which encrypts the effective parts of an original packet into two shadow packets based on (2, 2)-threshold XOR-based visual Secret Sharing (VSS) is proposed. The two shadow packets used as watermarks would be embedded into two normal data packets with digital watermarking embedding technology and then sent from one sensor node to another. Each shadow packet would reveal no information of the original packet, which can improve the security of original packet delivery greatly. The two shadow packets which can be extracted from the received two normal data packets delivered from a sensor node can recover the original packet lossless based on XOR-based VSS. The Performance analysis present that the proposed scheme provides essential services as long as possible in the presence of selective forwarding attack. The proposed scheme would not increase the amount of additional traffic, namely, lower energy consumption, which is suitable for Wireless Sensor Network (WSN).

Review of Rateless-Network-Coding-Based Packet Protection in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

A. S. Abdullah

2015-01-01

Full Text Available In recent times, there have been many developments in wireless sensor network (WSN technologies using coding theory. Fast and efficient protection schemes for data transfer over the WSN are some of the issues in coding theory. This paper reviews the issues related to the application of the joint rateless-network coding (RNC within the WSN in the context of packet protection. The RNC is a method in which any node in the network is allowed to encode and decode the transmitted data in order to construct a robust network, improve network throughput, and decrease delays. To the best of our knowledge, there has been no comprehensive discussion about RNC. To begin with, this paper briefly describes the concept of packet protection using network coding and rateless codes. We therefore discuss the applications of RNC for improving the capability of packet protection. Several works related to this issue are discussed. Finally, the paper concludes that the RNC-based packet protection scheme is able to improve the packet reception rate and suggests future studies to enhance the capability of RNC protection.

Source Authentication for Code Dissemination Supporting Dynamic Packet Size in Wireless Sensor Networks.

Science.gov (United States)

Kim, Daehee; Kim, Dongwan; An, Sunshin

2016-07-09

Code dissemination in wireless sensor networks (WSNs) is a procedure for distributing a new code image over the air in order to update programs. Due to the fact that WSNs are mostly deployed in unattended and hostile environments, secure code dissemination ensuring authenticity and integrity is essential. Recent works on dynamic packet size control in WSNs allow enhancing the energy efficiency of code dissemination by dynamically changing the packet size on the basis of link quality. However, the authentication tokens attached by the base station become useless in the next hop where the packet size can vary according to the link quality of the next hop. In this paper, we propose three source authentication schemes for code dissemination supporting dynamic packet size. Compared to traditional source authentication schemes such as μTESLA and digital signatures, our schemes provide secure source authentication under the environment, where the packet size changes in each hop, with smaller energy consumption.

Congestion control in wireless links based on selective delivery of erroneous packets

DEFF Research Database (Denmark)

Korhonen, Jari; Perkis, Andrew; Reiter, Ulrich

2011-01-01

Traditionally, congestion control in packet networks is performed by reducing the transmission rate when congestion is detected, in order to cut down the traffic that overwhelms the capacity of the network. However, if the bottleneck is a wireless link, congestion is often cumulated because...... the performance of the proposed mechanism against traditional congestion control with a simulation study. The results show that the proposed approach can improve the overall performance both by increasing the throughput over the wireless and improving the video quality in terms of peak signal-to-noise ratio (PSNR...

Extending Lifetime of Wireless Sensor Networks using Forward Error Correction

DEFF Research Database (Denmark)

Donapudi, S U; Obel, C O; Madsen, Jan

2006-01-01

Communication between nodes in wireless sensor networks (WSN) is susceptible to transmission errors caused by low signal strength or interference. These errors manifest themselves as lost or corrupt packets. This often leads to retransmission, which in turn results in increased power consumption...

Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

Science.gov (United States)

Song, W.-Z.; Yuan, F.; LaHusen, R.; Shirazi, B.

2007-01-01

This paper studies the wireless sensor networks (WSN) application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs [image omitted], N(u0)-1) time slots, assuming each node reports one unit of data in each round. Here [image omitted] is the total number of sensors, while [image omitted] denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet-scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also mitigated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle.

Research on Matrix-type Packet Loss Compensation Scheme for Wireless Video Transmission on Subway

Directory of Open Access Journals (Sweden)

Fan Qing-Wu

2017-01-01

Full Text Available As the mainstream wireless LAN technology, Wi-Fi can achieve fast data transfer. With the subway moving in a high speed, video data transmission between the metro and the ground is achieved through Wi-Fi technology. This paper aims at solving the Caton problem caused by switching packet loss in the process of playing real-time video on the train terminal, and proposes matrix-type packet loss compensation scheme. Finally, the feasibility of the scheme is verified by experiments.

What does it cost to deliver information using position-based beaconless forwarding protocols?

KAUST Repository

Bader, Ahmed

2012-04-01

Beaconless position-based forwarding protocols have recently evolved as a promising solution for packet forwarding in wireless sensor networks. Quite a few variants of this class of forwarding protocols have been proposed over the years. One common observation is that they have all been evaluated from the perspective of a single node. Although useful, but a solid understanding of the end-to-end performance is still necessary. In this paper, we shed light on the end-to-end performance of beaconless position-based protocols along three distinct dimensions: energy, latency, and back-off probability. The latter is used as a direct indicator of the network\\'s transport capacity. Consequently, we are able to provide an elaborate response to the question: what does it really cost to deliver a packet in a wireless sensor network using position-based beaconless forwarding protocols? In responding to this question, we highlighted the different performance tradeoffs inherent to beaconless position-based protocols. Furthermore, some operational recommendations are also provided. © 2012 IEEE.

What does it cost to deliver information using position-based beaconless forwarding protocols?

KAUST Repository

Bader, Ahmed; Abed-Meraim, Karim; Alouini, Mohamed-Slim

2012-01-01

Beaconless position-based forwarding protocols have recently evolved as a promising solution for packet forwarding in wireless sensor networks. Quite a few variants of this class of forwarding protocols have been proposed over the years. One common observation is that they have all been evaluated from the perspective of a single node. Although useful, but a solid understanding of the end-to-end performance is still necessary. In this paper, we shed light on the end-to-end performance of beaconless position-based protocols along three distinct dimensions: energy, latency, and back-off probability. The latter is used as a direct indicator of the network's transport capacity. Consequently, we are able to provide an elaborate response to the question: what does it really cost to deliver a packet in a wireless sensor network using position-based beaconless forwarding protocols? In responding to this question, we highlighted the different performance tradeoffs inherent to beaconless position-based protocols. Furthermore, some operational recommendations are also provided. © 2012 IEEE.

Source Authentication for Code Dissemination Supporting Dynamic Packet Size in Wireless Sensor Networks †

Science.gov (United States)

Kim, Daehee; Kim, Dongwan; An, Sunshin

2016-01-01

Code dissemination in wireless sensor networks (WSNs) is a procedure for distributing a new code image over the air in order to update programs. Due to the fact that WSNs are mostly deployed in unattended and hostile environments, secure code dissemination ensuring authenticity and integrity is essential. Recent works on dynamic packet size control in WSNs allow enhancing the energy efficiency of code dissemination by dynamically changing the packet size on the basis of link quality. However, the authentication tokens attached by the base station become useless in the next hop where the packet size can vary according to the link quality of the next hop. In this paper, we propose three source authentication schemes for code dissemination supporting dynamic packet size. Compared to traditional source authentication schemes such as μTESLA and digital signatures, our schemes provide secure source authentication under the environment, where the packet size changes in each hop, with smaller energy consumption. PMID:27409616

STORED-AND-FORWARD PACKET COMMUNICATION PAYLOAD OF KITSAT 1/2 MICROSATELLITES

Directory of Open Access Journals (Sweden)

Young-Ro Lee

1996-06-01

Full Text Available In this paper, we describe the architecture and protocol of stored-and-forward packet communication payload of KITSAT 1/2 microsatellites and then analyze this payload in terms of the probabilities of login success and login refusal, and maximum throughput as quality of service parameters.

Stabilization of a Wireless Networked Control System with Packet Loss and Time Delay: An ADS Approach

Directory of Open Access Journals (Sweden)

Jing Wang

2012-01-01

Full Text Available The stabilization problem of a wireless networked control system is considered in this paper. Both time delay and packet loss exist simultaneously in the wireless network. The system is modeled as an asynchronous dynamic system (ADS with unstable subsystems. A sufficient condition for the system to be stable is presented. A numerical example is given to demonstrate the effectiveness of the proposed approach.

Event-Triggered Fault Estimation for Stochastic Systems over Multi-Hop Relay Networks with Randomly Occurring Sensor Nonlinearities and Packet Dropouts.

Science.gov (United States)

Li, Yunji; Peng, Li

2018-02-28

Wireless sensors have many new applications where remote estimation is essential. Considering that a remote estimator is located far away from the process and the wireless transmission distance of sensor nodes is limited, sensor nodes always forward data packets to the remote estimator through a series of relays over a multi-hop link. In this paper, we consider a network with sensor nodes and relay nodes where the relay nodes can forward the estimated values to the remote estimator. An event-triggered remote estimator of state and fault with the corresponding data-forwarding scheme is investigated for stochastic systems subject to both randomly occurring nonlinearity and randomly occurring packet dropouts governed by Bernoulli-distributed sequences to achieve a trade-off between estimation accuracy and energy consumption. Recursive Riccati-like matrix equations are established to calculate the estimator gain to minimize an upper bound of the estimator error covariance. Subsequently, a sufficient condition and data-forwarding scheme are presented under which the error covariance is mean-square bounded in the multi-hop links with random packet dropouts. Furthermore, implementation issues of the theoretical results are discussed where a new data-forwarding communication protocol is designed. Finally, the effectiveness of the proposed algorithms and communication protocol are extensively evaluated using an experimental platform that was established for performance evaluation with a sensor and two relay nodes.

Opportunistic Nonorthogonal Packet Scheduling in Fixed Broadband Wireless Access Networks

Directory of Open Access Journals (Sweden)

Ahmed Mohamed H

2006-01-01

Full Text Available In order to mitigate high cochannel interference resulting from dense channel reuse, the interference management issues are often considered as essential part of scheduling schemes in fixed broadband wireless access (FBWA networks. To that end, a series of literature has been published recently, in which a group of base stations forms an interferer group (downlink transmissions from each base station become dominant interference for the users in other in-group base stations, and the scheduling scheme deployed in the group allows only one base station to transmit at a time. As a result of time orthogonality in transmissions, the dominant cochannel interferers are prevented, and hence the packet error rate can be improved. However, prohibiting concurrent transmissions in these orthogonal schemes introduces throughput penalty as well as higher end-to-end packet delay which might not be desirable for real-time services. In this paper, we utilize opportunistic nonorthogonality among the in-group transmissions whenever possible and propose a novel transmission scheduling scheme for FBWA networks. The proposed scheme, in contrast to the proactive interference avoidance techniques, strives for the improvements in delay and throughput efficiency. To facilitate opportunistic nonorthogonal transmissions in the interferer group, estimation of signal-to-interference-plus-noise ratio (SINR is required at the scheduler. We have observed from simulations that the proposed scheme outperforms the reference orthogonal scheme in terms of spectral efficiency, mean packet delay, and packet dropping rate.

Performance of Implementation IBR-DTN and Batman-Adv Routing Protocol in Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Herman Yuliandoko

2016-03-01

Full Text Available Wireless mesh networks is a network which has high mobility and flexibility network. In Wireless mesh networks nodes are free to move and able to automatically build a network connection with other nodes. High mobility, heterogeneous condition and intermittent network connectivity cause data packets drop during wireless communication and it becomes a problem in the wireless mesh networks. This condition can happen because wireless mesh networks use connectionless networking type such as IP protocol which it is not tolerant to delay. To solve this condition it is needed a technology to keep data packets when the network is disconnect. Delay tolerant technology is a technology that provides store and forward mechanism and it can prevent packet data dropping during communication. In our research, we proposed a test bed wireless mesh networks implementation by using proactive routing protocol and combining with delay tolerant technology. We used Batman-adv routing protocol and IBR-DTN on our research. We measured some particular performance aspect of networking such as packet loss, delay, and throughput of the network. We identified that delay tolerant could keep packet data from dropping better than current wireless mesh networks in the intermittent network condition. We also proved that IBR-DTN and Batman-adv could run together on the wireless mesh networks. In The experiment throughput test result of IBR-DTN was higher than Current TCP on the LoS (Line of Side and on environment with obstacle. Keywords: Delay Tolerant, IBR-DTN, Wireless Mesh, Batman-adv, Performance

Monitoring Agent for Detecting Malicious Packet Drops for Wireless Sensor Networks in the Microgrid and Grid-Enabled Vehicles

Directory of Open Access Journals (Sweden)

Jongbin Ko

2012-05-01

Full Text Available Of the range of wireless communication technologies, wireless sensor networks (WSN will be one of the most appropriate technologies for the Microgrid and Grid-enabled Vehicles in the Smartgrid. To ensure the security of WSN, the detection of attacks is more efficient than their prevention because of the lack of computing power. Malicious packet drops are the easiest means of attacking WSNs. Thus, the sensors used for constructing a WSN require a packet drop monitoring agent, such as Watchdog. However, Watchdog has a partial drop problem such that an attacker can manipulate the packet dropping rate below the minimum misbehaviour monitoring threshold. Furthermore, Watchdog does not consider real traffic situations, such as congestion and collision, and so it has no way of recognizing whether a packet drop is due to a real attack or network congestion. In this paper, we propose a malicious packet drop monitoring agent, which considers traffic conditions. We used the actual traffic volume on neighbouring nodes and the drop rate while monitoring a sending node for specific period. It is more effective in real network scenarios because unlike Watchdog it considers the actual traffic, which only uses the Pathrater. Moreover, our proposed method does not require authentication, packet encryption or detection packets. Thus, there is a lower likelihood of detection failure due to packet spoofing, Man-In-the Middle attacks or Wormhole attacks. To test the suitability of our proposed concept for a series of network scenarios, we divided the simulations into three types: one attack node, more than one attack nodes and no attack nodes. The results of the simulations meet our expectations.

Trade-Offs between Energy Saving and Reliability in Low Duty Cycle Wireless Sensor Networks Using a Packet Splitting Forwarding Technique

Directory of Open Access Journals (Sweden)

Leonardi Alessandro

2010-01-01

Full Text Available One of the challenging topics and design constraints in Wireless Sensor Networks (WSNs is the reduction of energy consumption because, in most application scenarios, replacement of power resources in sensor devices might be unfeasible. In order to minimize the power consumption, some nodes can be put to sleep during idle times and wake up only when needed. Although it seems the best way to limit the consumption of energy, other performance parameters such as network reliability have to be considered. In a recent paper, we introduced a new forwarding algorithm for WSNs based on a simple splitting procedure able to increase the network lifetime. The forwarding technique is based on the Chinese Remainder Theorem and exhibits very good results in terms of energy efficiency and complexity. In this paper, we intend to investigate a trade-off between energy efficiency and reliability of the proposed forwarding scheme when duty-cycling techniques are considered too.

Modified Aggressive Packet Combining Scheme

International Nuclear Information System (INIS)

Bhunia, C.T.

2010-06-01

In this letter, a few schemes are presented to improve the performance of aggressive packet combining scheme (APC). To combat error in computer/data communication networks, ARQ (Automatic Repeat Request) techniques are used. Several modifications to improve the performance of ARQ are suggested by recent research and are found in literature. The important modifications are majority packet combining scheme (MjPC proposed by Wicker), packet combining scheme (PC proposed by Chakraborty), modified packet combining scheme (MPC proposed by Bhunia), and packet reversed packet combining (PRPC proposed by Bhunia) scheme. These modifications are appropriate for improving throughput of conventional ARQ protocols. Leung proposed an idea of APC for error control in wireless networks with the basic objective of error control in uplink wireless data network. We suggest a few modifications of APC to improve its performance in terms of higher throughput, lower delay and higher error correction capability. (author)

Adaptive Demand-Driven Multicast Routing in Multi-Hop Wireless Ad Hoc Networks

National Research Council Canada - National Science Library

Jetcheva, Jorjeta G

2004-01-01

...) nodes that wish to communicate. Each node in the ad hoc network acts as a router and forwards packets on behalf of other nodes, allowing nodes that are not within wireless range of each other to communicate over multi-hop paths...

Packet Duplication in Dual Connectivity Enabled 5G Wireless Networks: Overview and Challenges

OpenAIRE

Aijaz, Adnan

2018-01-01

Enabling ultra-reliable low latency communications (uRLLC) over 5G wireless networks creates challenging design requirements, particularly on the air-interface. The stringent latency and reliability targets require enhancements at different layers of the protocol stack. On the other hand, the parallel redundancy protocol (PRP), wherein each data packet is duplicated and transmitted concurrently over two independent networks, provides a simple solution for improving reliability and reducing la...

Routing Protocol for Mobile Ad-hoc Wireless Networks

Directory of Open Access Journals (Sweden)

I. M. B. Nogales

2007-09-01

Full Text Available Bluetooth is a cutting-edge technology used for implementing wireless ad hoc networks. In order to provide an overall scheme for mobile ad hoc networks, this paper deals with scatternet topology formation and routing algorithm to form larger ad hoc wireless Networks. Scatternet topology starts by forming a robust network, which is less susceptible to the problems posed by node mobility. Mobile topology relies on the presence of free nodes that create multiple connections with the network and on their subsequently rejoining the network. Our routing protocol is a proactive routing protocol, which is tailor made for the Bluetooth ad hoc network. The connection establishment connects nodes in a structure that simplifies packet routing and scheduling. The design allows nodes to arrive and leave arbitrarily, incrementally building the topology and healing partitions when they occur. We present simulation results that show that the algorithm presents low formation latency and also generates an efficient topology for forwarding packets along ad-hoc wireless networks.

Efficient Actor Recovery Paradigm for Wireless Sensor and Actor Networks.

Science.gov (United States)

Mahjoub, Reem K; Elleithy, Khaled

2017-04-14

The actor nodes are the spine of wireless sensor and actor networks (WSANs) that collaborate to perform a specific task in an unverified and uneven environment. Thus, there is a possibility of high failure rate in such unfriendly scenarios due to several factors such as power consumption of devices, electronic circuit failure, software errors in nodes or physical impairment of the actor nodes and inter-actor connectivity problem. Therefore, it is extremely important to discover the failure of a cut-vertex actor and network-disjoint in order to improve the Quality-of-Service (QoS). In this paper, we propose an Efficient Actor Recovery (EAR) paradigm to guarantee the contention-free traffic-forwarding capacity. The EAR paradigm consists of a Node Monitoring and Critical Node Detection (NMCND) algorithm that monitors the activities of the nodes to determine the critical node. In addition, it replaces the critical node with backup node prior to complete node-failure which helps balancing the network performance. The packets are handled using Network Integration and Message Forwarding (NIMF) algorithm that determines the source of forwarding the packets; either from actor or sensor. This decision-making capability of the algorithm controls the packet forwarding rate to maintain the network for a longer time. Furthermore, for handling the proper routing strategy, Priority-Based Routing for Node Failure Avoidance (PRNFA) algorithm is deployed to decide the priority of the packets to be forwarded based on the significance of information available in the packet. To validate the effectiveness of the proposed EAR paradigm, the proposed algorithms were tested using OMNET++ simulation.

Adaptive Control of the Packet Transmission Period with Solar Energy Harvesting Prediction in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Kideok Kwon

2015-04-01

Full Text Available A number of research works has studied packet scheduling policies in energy scavenging wireless sensor networks, based on the predicted amount of harvested energy. Most of them aim to achieve energy neutrality, which means that an embedded system can operate perpetually while meeting application requirements. Unlike other renewable energy sources, solar energy has the feature of distinct periodicity in the amount of harvested energy over a day. Using this feature, this paper proposes a packet transmission control policy that can enhance the network performance while keeping sensor nodes alive. Furthermore, this paper suggests a novel solar energy prediction method that exploits the relation between cloudiness and solar radiation. The experimental results and analyses show that the proposed packet transmission policy outperforms others in terms of the deadline miss rate and data throughput. Furthermore, the proposed solar energy prediction method can predict more accurately than others by 6.92%.

Adaptive control of the packet transmission period with solar energy harvesting prediction in wireless sensor networks.

Science.gov (United States)

Kwon, Kideok; Yang, Jihoon; Yoo, Younghwan

2015-04-24

A number of research works has studied packet scheduling policies in energy scavenging wireless sensor networks, based on the predicted amount of harvested energy. Most of them aim to achieve energy neutrality, which means that an embedded system can operate perpetually while meeting application requirements. Unlike other renewable energy sources, solar energy has the feature of distinct periodicity in the amount of harvested energy over a day. Using this feature, this paper proposes a packet transmission control policy that can enhance the network performance while keeping sensor nodes alive. Furthermore, this paper suggests a novel solar energy prediction method that exploits the relation between cloudiness and solar radiation. The experimental results and analyses show that the proposed packet transmission policy outperforms others in terms of the deadline miss rate and data throughput. Furthermore, the proposed solar energy prediction method can predict more accurately than others by 6.92%.

Multihop Wireless Networks Opportunistic Routing

CERN Document Server

Zeng, Kai; Li, Ming

2011-01-01

This book provides an introduction to opportunistic routing an emerging technology designed to improve the packet forwarding reliability, network capacity and energy efficiency of multihop wireless networks This book presents a comprehensive background to the technological challenges lying behind opportunistic routing. The authors cover many fundamental research issues for this new concept, including the basic principles, performance limit and performance improvement of opportunistic routing compared to traditional routing, energy efficiency and distributed opportunistic routing protocol desig

An Incentivized Approach for Fair Participation in Wireless Ad hoc Networks

OpenAIRE

Choudhuri, Arka Rai; S, Kalyanasundaram; Sridhar, Shriyak; B, Annappa

2015-01-01

In Wireless Ad hoc networks (WANETs), nodes separated by considerable distance communicate with each other by relaying their messages through other nodes. However, it might not be in the best interests of a node to forward the message of another node due to power constraints. In addition, all nodes being rational, some nodes may be selfish, i.e. they might not relay data from other nodes so as to increase their lifetime. In this paper, we present a fair and incentivized approach for participa...

An On-Demand Emergency Packet Transmission Scheme for Wireless Body Area Networks.

Science.gov (United States)

Al Ameen, Moshaddique; Hong, Choong Seon

2015-12-04

The rapid developments of sensor devices that can actively monitor human activities have given rise to a new field called wireless body area network (BAN). A BAN can manage devices in, on and around the human body. Major requirements of such a network are energy efficiency, long lifetime, low delay, security, etc. Traffic in a BAN can be scheduled (normal) or event-driven (emergency). Traditional media access control (MAC) protocols use duty cycling to improve performance. A sleep-wake up cycle is employed to save energy. However, this mechanism lacks features to handle emergency traffic in a prompt and immediate manner. To deliver an emergency packet, a node has to wait until the receiver is awake. It also suffers from overheads, such as idle listening, overhearing and control packet handshakes. An external radio-triggered wake up mechanism is proposed to handle prompt communication. It can reduce the overheads and improve the performance through an on-demand scheme. In this work, we present a simple-to-implement on-demand packet transmission scheme by taking into considerations the requirements of a BAN. The major concern is handling the event-based emergency traffic. The performance analysis of the proposed scheme is presented. The results showed significant improvements in the overall performance of a BAN compared to state-of-the-art protocols in terms of energy consumption, delay and lifetime.

An On-Demand Emergency Packet Transmission Scheme for Wireless Body Area Networks

Directory of Open Access Journals (Sweden)

Moshaddique Al Ameen

2015-12-01

Full Text Available The rapid developments of sensor devices that can actively monitor human activities have given rise to a new field called wireless body area network (BAN. A BAN can manage devices in, on and around the human body. Major requirements of such a network are energy efficiency, long lifetime, low delay, security, etc. Traffic in a BAN can be scheduled (normal or event-driven (emergency. Traditional media access control (MAC protocols use duty cycling to improve performance. A sleep-wake up cycle is employed to save energy. However, this mechanism lacks features to handle emergency traffic in a prompt and immediate manner. To deliver an emergency packet, a node has to wait until the receiver is awake. It also suffers from overheads, such as idle listening, overhearing and control packet handshakes. An external radio-triggered wake up mechanism is proposed to handle prompt communication. It can reduce the overheads and improve the performance through an on-demand scheme. In this work, we present a simple-to-implement on-demand packet transmission scheme by taking into considerations the requirements of a BAN. The major concern is handling the event-based emergency traffic. The performance analysis of the proposed scheme is presented. The results showed significant improvements in the overall performance of a BAN compared to state-of-the-art protocols in terms of energy consumption, delay and lifetime.

The selfish goal meets the selfish gene.

Science.gov (United States)

Neuberg, Steven L; Schaller, Mark

2014-04-01

The connection between selfish genes and selfish goals is not merely metaphorical. Many goals that shape contemporary cognition and behavior are psychological products of evolutionarily fundamental motivational systems and thus are phenotypic manifestations of genes. An evolutionary perspective can add depth and nuance to our understanding of "selfish goals" and their implications for human cognition and behavior.

Distributed Similarity based Clustering and Compressed Forwarding for wireless sensor networks.

Science.gov (United States)

Arunraja, Muruganantham; Malathi, Veluchamy; Sakthivel, Erulappan

2015-11-01

Wireless sensor networks are engaged in various data gathering applications. The major bottleneck in wireless data gathering systems is the finite energy of sensor nodes. By conserving the on board energy, the life span of wireless sensor network can be well extended. Data communication being the dominant energy consuming activity of wireless sensor network, data reduction can serve better in conserving the nodal energy. Spatial and temporal correlation among the sensor data is exploited to reduce the data communications. Data similar cluster formation is an effective way to exploit spatial correlation among the neighboring sensors. By sending only a subset of data and estimate the rest using this subset is the contemporary way of exploiting temporal correlation. In Distributed Similarity based Clustering and Compressed Forwarding for wireless sensor networks, we construct data similar iso-clusters with minimal communication overhead. The intra-cluster communication is reduced using adaptive-normalized least mean squares based dual prediction framework. The cluster head reduces the inter-cluster data payload using a lossless compressive forwarding technique. The proposed work achieves significant data reduction in both the intra-cluster and the inter-cluster communications, with the optimal data accuracy of collected data. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Design and Implementation of Dual-Mode Wireless Video Monitoring System

Directory of Open Access Journals (Sweden)

BAO Song-Jian

2014-10-01

Full Text Available Dual-mode wireless video transmission has two major problems. Firstly, one is time delay difference bringing about asynchronous reception decoding frame error phenomenon; secondly, dual-mode network bandwidth inconformity causes scheduling problem. In order to solve above two problems, a kind of TD-SCDMA/CDMA20001x dual-mode wireless video transmission design method is proposed. For the solution of decoding frame error phenomenon, the design puts forward adding frame identification and packet preprocessing at the sending and synchronizing combination at the receiving end. For the solution of scheduling problem, the wireless communication channel cooperative work and video data transmission scheduling management algorithm is proposed in the design.

Reliable Wireless Broadcast with Linear Network Coding for Multipoint-to-Multipoint Real-Time Communications

Science.gov (United States)

Kondo, Yoshihisa; Yomo, Hiroyuki; Yamaguchi, Shinji; Davis, Peter; Miura, Ryu; Obana, Sadao; Sampei, Seiichi

This paper proposes multipoint-to-multipoint (MPtoMP) real-time broadcast transmission using network coding for ad-hoc networks like video game networks. We aim to achieve highly reliable MPtoMP broadcasting using IEEE 802.11 media access control (MAC) that does not include a retransmission mechanism. When each node detects packets from the other nodes in a sequence, the correctly detected packets are network-encoded, and the encoded packet is broadcasted in the next sequence as a piggy-back for its native packet. To prevent increase of overhead in each packet due to piggy-back packet transmission, network coding vector for each node is exchanged between all nodes in the negotiation phase. Each user keeps using the same coding vector generated in the negotiation phase, and only coding information that represents which user signal is included in the network coding process is transmitted along with the piggy-back packet. Our simulation results show that the proposed method can provide higher reliability than other schemes using multi point relay (MPR) or redundant transmissions such as forward error correction (FEC). We also implement the proposed method in a wireless testbed, and show that the proposed method achieves high reliability in a real-world environment with a practical degree of complexity when installed on current wireless devices.

Packet Header Compression for the Internet of Things

Directory of Open Access Journals (Sweden)

Pekka KOSKELA

2016-01-01

Full Text Available Due to the extensive growth of Internet of Things (IoT, the number of wireless devices connected to the Internet is forecasted to grow to 26 billion units installed in 2020. This will challenge both the energy efficiency of wireless battery powered devices and the bandwidth of wireless networks. One solution for both challenges could be to utilize packet header compression. This paper reviews different packet compression, and especially packet header compression, methods and studies the performance of Robust Header Compression (ROHC in low speed radio networks such as XBEE, and in high speed radio networks such as LTE and WLAN. In all networks, the compressing and decompressing processing causes extra delay and power consumption, but in low speed networks, energy can still be saved due to the shorter transmission time.

Utilization of OFDM for efficient packet forwarding in wireless sensor networks

KAUST Repository

Bader, Ahmed; Abed-Meraim, Karim; Alouini, Mohamed-Slim

2011-01-01

-to-end energy and delay performance is adversely impacted. Motivated by the need for a forwarding mechanism that is more tolerant to growth in node density, an alternative position-based protocol is proposed in this paper. The protocol is designed

BER IMPROVEMENT OF WIRELESS LAN IEEE 802.11 STANDARD USING WAVELET PACKET TRANSFORMS

Directory of Open Access Journals (Sweden)

Sanjeev Kumar

2012-09-01

Full Text Available High data rates and spectral efficiency is the main requirements for wireless communication systems. Orthogonal Frequency Division Multiplexing (OFDM is a special form of multi carrier transmission used to achieve high data rates of the various WLAN standards. WLAN uses an Inverse Fast Fourier Transform (IFFT at the transmitter to modulate a high bit-rate signal onto a number of carriers and ensure orthogonality between the carriers. The FFT-OFDM has a disadvantage that it is inherently inflexible and requires a complex IFFT core. Recently, Wavelet Packet Transform is proposed as an alternate to FFT. It is a multiplexing method in which data is assigned to wavelet sub bands having different time and frequency resolutions. This paper presents a BER analysis of Fourier-based OFDM (FFT-OFDM and Wavelet Packet based OFDM (WPT-OFDM in WLAN standard (IEEE 802.11a. The performance of FFT and WPT OFDM for various modulation techniques such as PSK, DPSK and QAM for varying values of M was evaluated in AWGN Channel.

Effective ANT based Routing Algorithm for Data Replication in MANETs

Directory of Open Access Journals (Sweden)

N.J. Nithya Nandhini

2013-12-01

Full Text Available In mobile ad hoc network, the nodes often move and keep on change its topology. Data packets can be forwarded from one node to another on demand. To increase the data accessibility data are replicated at nodes and made as sharable to other nodes. Assuming that all mobile host cooperative to share their memory and allow forwarding the data packets. But in reality, all nodes do not share the resources for the benefits of others. These nodes may act selfishly to share memory and to forward the data packets. This paper focuses on selfishness of mobile nodes in replica allocation and routing protocol based on Ant colony algorithm to improve the efficiency. The Ant colony algorithm is used to reduce the overhead in the mobile network, so that it is more efficient to access the data than with other routing protocols. This result shows the efficiency of ant based routing algorithm in the replication allocation.

Smart home design for electronic devices monitoring based wireless gateway network using cisco packet tracer

Science.gov (United States)

Sihombing, Oloan; Zendrato, Niskarto; Laia, Yonata; Nababan, Marlince; Sitanggang, Delima; Purba, Windania; Batubara, Diarmansyah; Aisyah, Siti; Indra, Evta; Siregar, Saut

2018-04-01

In the era of technological development today, the technology has become the need for the life of today's society. One is needed to create a smart home in turning on and off electronic devices via smartphone. So far in turning off and turning the home electronic device is done by pressing the switch or remote button, so in control of electronic device control less effective. The home smart design is done by simulation concept by testing system, network configuration, and wireless home gateway computer network equipment required by a smart home network on cisco packet tracer using Internet Thing (IoT) control. In testing the IoT home network wireless network gateway system, multiple electronic devices can be controlled and monitored via smartphone based on predefined configuration conditions. With the Smart Ho me can potentially increase energy efficiency, decrease energy usage costs, control electronics and change the role of residents.

H-Seda: Partial Packet Recovery with Heterogeneous Block Sizes for Wireless Sensor Networks

KAUST Repository

Meer, Ammar M.

2012-12-08

Wireless sensor networks (WSN) have been largely used in various applications due to its ease of deployment and scalability. The throughput of such networks, however, suffers from high bit error rates mainly because of medium characteristics. Maximizing bandwidth utilization while maintaining low frame error rate has been an interesting problem. Frame fragmentation into small blocks with dedicated error detection codes per block can reduce the unnecessary retransmission of the correctly received blocks. The optimal block size, however, varies based on the wireless channel conditions. In addition, blocks within a frame can have different optimal sizes based on the variations on interference patterns. This thesis studies two dynamic partial packet recovery approaches experimentally over several interference intensities with various transmission-power levels. It also proposes a dynamic data link layer protocol: Hybrid Seda (H-Seda). H-Seda effectively addresses the challenges associated with dynamic partitioning of blocks while taking the observed error patterns into consideration. The design of H-Seda is discussed in details and compared to other previous approaches, namely Seda+ and Seda. The implementation of H-Seda shows substantial enhancements over fixed-size partial packet recovery protocols, achieving up to 2.5x improvement in throughput when the channel condition is noisy, while delay experienced decreases to only 14 % of the delay observed in Seda. On average, it shows 35% gain in goodput across all channel conditions used in our experiments. This significant improvement is due to the selective nature of H-Seda which minimizes retransmission overhead by selecting the appropriate number of blocks in each data frame. Additionally, H-Seda successfully reduces block overhead by 50% through removing block number field reaching to better performance when channel conditions are identical.

Pithy Review on Routing Protocols in Wireless Sensor Networks and Least Routing Time Opportunistic Technique in WSN

Science.gov (United States)

Salman Arafath, Mohammed; Rahman Khan, Khaleel Ur; Sunitha, K. V. N.

2018-01-01

Nowadays due to most of the telecommunication standard development organizations focusing on using device-to-device communication so that they can provide proximity-based services and add-on services on top of the available cellular infrastructure. An Oppnets and wireless sensor network play a prominent role here. Routing in these networks plays a significant role in fields such as traffic management, packet delivery etc. Routing is a prodigious research area with diverse unresolved issues. This paper firstly focuses on the importance of Opportunistic routing and its concept then focus is shifted to prime aspect i.e. on packet reception ratio which is one of the highest QoS Awareness parameters. This paper discusses the two important functions of routing in wireless sensor networks (WSN) namely route selection using least routing time algorithm (LRTA) and data forwarding using clustering technique. Finally, the simulation result reveals that LRTA performs relatively better than the existing system in terms of average packet reception ratio and connectivity.

Selfish genetic elements and the gene’s-eye view of evolution

Science.gov (United States)

2016-01-01

During the last few decades, we have seen an explosion in the influx of details about the biology of selfish genetic elements. Ever since the early days of the field, the gene’s-eye view of Richard Dawkins, George Williams, and others, has been instrumental to make sense of new empirical observations and to the generation of new hypotheses. However, the close association between selfish genetic elements and the gene’s-eye view has not been without critics and several other conceptual frameworks have been suggested. In particular, proponents of multilevel selection models have used selfish genetic elements to criticize the gene’s-eye view. In this paper, I first trace the intertwined histories of the study of selfish genetic elements and the gene’s-eye view and then discuss how their association holds up when compared with other proposed frameworks. Next, using examples from transposable elements and the major transitions, I argue that different models highlight separate aspects of the evolution of selfish genetic elements and that the productive way forward is to maintain a plurality of perspectives. Finally, I discuss how the empirical study of selfish genetic elements has implications for other conceptual issues associated with the gene’s-eye view, such as agential thinking, adaptationism, and the role of fitness maximizing models in evolution. PMID:29491953

Optimal JPWL Forward Error Correction Rate Allocation for Robust JPEG 2000 Images and Video Streaming over Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Benoit Macq

2008-07-01

Full Text Available Based on the analysis of real mobile ad hoc network (MANET traces, we derive in this paper an optimal wireless JPEG 2000 compliant forward error correction (FEC rate allocation scheme for a robust streaming of images and videos over MANET. The packet-based proposed scheme has a low complexity and is compliant to JPWL, the 11th part of the JPEG 2000 standard. The effectiveness of the proposed method is evaluated using a wireless Motion JPEG 2000 client/server application; and the ability of the optimal scheme to guarantee quality of service (QoS to wireless clients is demonstrated.

An efficient collaborative approach for black hole attack discovery and mitigating its impact in manet

Science.gov (United States)

Devipriya, K.; Ivy, B. Persis Urbana; Prabha, D.

2018-04-01

A mobile ad hoc network (MANET) is an assemblage of nodes composed of mobile devices coupled in various ways wirelessly which do not have any central administration. Each node in MANET cooperates in forwarding packets in the network. This type of collaboration incurs high cost but there exits nodes that declines to cooperate leading to selfish conduct of nodes which effects overall network performance. To discover the attacks caused by such nodes, a renowned mechanism using watchdog can be deployed. In infrastructure less network attack detection and reaction and high false positives, false negatives initiating black hole attack becomes major issue in watchdog. This paper put forward a collaborative approach for identifying such attacks in MANET. Through abstract analysis and extensive simulation of this approach, the detection time of misbehaved nodes is reduced and substantial enhancement in overhead and throughput is witnessed.

Joint Connection and Packet level Analysis in W-CDMA Radio Interface

DEFF Research Database (Denmark)

Benetis, Vilius; Popova, Larissa; Iversen, Villy Bæk

2007-01-01

algorithm which defines the feasible state space at packet level. At packet level we take into consideration wireless interference (soft blocking). The traffic is modeled as multi-rate Binomial-Poisson-Pascal (BPP-) traffic at connection level and on-off traffic at packet level. We obtain individual...

Static Three-Dimensional Fuzzy Routing Based on the Receiving Probability in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Sohrab Khanmohammadi

2013-11-01

Full Text Available A Wireless Sensor Network (WSN is a collection of low-cost, low-power and large-scale wireless sensor nodes. Routing protocols are an important topic in WSN. Every sensor node should use a proper mechanism to transmit the generated packets to its destination, usually a base station. In previous works, routing protocols use the global information of the network that causes the redundant packets to be increased. Moreover, it leads to an increase in the network traffic, to a decrease in the delivery ratio of data packets, and to a reduction in network life. In this paper, we propose a new inferential routing protocol called SFRRP (Static Three-Dimensional Fuzzy Routing based on the Receiving Probability. The proposed protocol solves the above mentioned problems considerably. The data packets are transmitted by hop-to-hop delivery to the base station. It uses a fuzzy procedure to transmit the sensed data or the buffered data packets to one of the neighbors called selected node. In the proposed fuzzy system, the distance and number of neighbors are input variables, while the receiving probability is the output variable. SFRRP just uses the local neighborhood information to forward the packets and is not needed by any redundant packet for route discovery. The proposed protocol has some advantages such as a high delivery ratio, less delay time, high network life, and less network traffic. The performance of the proposed protocol surpasses the performance of the Flooding routing protocol in terms of delivery ratio, delay time and network lifetime.

Modeling On-Body DTN Packet Routing Delay in the Presence of Postural Disconnections

Directory of Open Access Journals (Sweden)

Taghizadeh Mahmoud

2011-01-01

Full Text Available This paper presents a stochastic modeling framework for store-and-forward packet routing in Wireless Body Area Networks (WBAN with postural partitioning. A prototype WBANs has been constructed for experimentally characterizing and capturing on-body topology disconnections in the presence of ultrashort range radio links, unpredictable RF attenuation, and human postural mobility. Delay modeling techniques for evaluating single-copy on-body DTN routing protocols are then developed. End-to-end routing delay for a series of protocols including opportunistic, randomized, and two other mechanisms that capture multiscale topological localities in human postural movements have been evaluated. Performance of the analyzed protocols are then evaluated experimentally and via simulation to compare with the results obtained from the developed model. Finally, a mechanism for evaluating the topological importance of individual on-body sensor nodes is developed. It is shown that such information can be used for selectively reducing the on-body sensor-count without substantially sacrificing the packet delivery delay.

Modeling On-Body DTN Packet Routing Delay in the Presence of Postural Disconnections.

Science.gov (United States)

Quwaider, Muhannad; Taghizadeh, Mahmoud; Biswas, Subir

2011-01-01

This paper presents a stochastic modeling framework for store-and-forward packet routing in Wireless Body Area Networks ( WBAN ) with postural partitioning. A prototype WBANs has been constructed for experimentally characterizing and capturing on-body topology disconnections in the presence of ultrashort range radio links, unpredictable RF attenuation, and human postural mobility. Delay modeling techniques for evaluating single-copy on-body DTN routing protocols are then developed. End-to-end routing delay for a series of protocols including opportunistic, randomized, and two other mechanisms that capture multiscale topological localities in human postural movements have been evaluated. Performance of the analyzed protocols are then evaluated experimentally and via simulation to compare with the results obtained from the developed model. Finally, a mechanism for evaluating the topological importance of individual on-body sensor nodes is developed. It is shown that such information can be used for selectively reducing the on-body sensor-count without substantially sacrificing the packet delivery delay.

Trust framework for a secured routing in wireless sensor network

Directory of Open Access Journals (Sweden)

Ouassila Hoceini

2015-11-01

Full Text Available Traditional techniques to eliminate insider attacks developed for wired and wireless ad hoc networks are not well suited for wireless sensors networks due to their resource constraints nature. In order to protect WSNs against malicious and selfish behavior, some trust-based systems have recently been modeled. The resource efficiency and dependability of a trust system are the most fundamental requirements for any wireless sensor network (WSN. In this paper, we propose a Trust Framework for a Secured Routing in Wireless Sensor Network (TSR scheme, which works with clustered networks. This approach can effectively reduce the cost of trust evaluation and guarantee a better selection of safest paths that lead to the base station. Theoretical as well as simulation results show that our scheme requires less communication overheads and consumes less energy as compared to the current typical trust systems for WSNs. Moreover, it detects selfish and defective nodes and prevents us of insider attacks

Cross-Layer Techniques for Adaptive Video Streaming over Wireless Networks

Directory of Open Access Journals (Sweden)

Yufeng Shan

2005-02-01

Full Text Available Real-time streaming media over wireless networks is a challenging proposition due to the characteristics of video data and wireless channels. In this paper, we propose a set of cross-layer techniques for adaptive real-time video streaming over wireless networks. The adaptation is done with respect to both channel and data. The proposed novel packetization scheme constructs the application layer packet in such a way that it is decomposed exactly into an integer number of equal-sized radio link protocol (RLP packets. FEC codes are applied within an application packet at the RLP packet level rather than across different application packets and thus reduce delay at the receiver. A priority-based ARQ, together with a scheduling algorithm, is applied at the application layer to retransmit only the corrupted RLP packets within an application layer packet. Our approach combines the flexibility and programmability of application layer adaptations, with low delay and bandwidth efficiency of link layer techniques. Socket-level simulations are presented to verify the effectiveness of our approach.

Securing DSR with mobile agents in wireless ad hoc networks

Directory of Open Access Journals (Sweden)

Ahmed Abosamra

2011-03-01

Full Text Available Ad hoc wireless network consists of a set of wireless nodes communicating with each other without a pre-defined infrastructure. They communicate by forwarding packets which can reach wireless nodes that do not exist in the range of the direct radio transmission. Designing ad hoc network routing protocols is a challenging task because of its decentralized infrastructure which makes securing ad hoc networks more and more challenging. Dynamic Source Routing (DSR protocol is a popular routing protocol designed for use in wireless ad hoc networks. Mobile agent is a promising technology used in diverse fields of network applications. In this paper, we try to implement DSR using mobile agents for securing this type of wireless network. Hybrid encryption technique (symmetric key encryption/public key encryption is used to improve performance; where symmetric keys are used to encrypt routing data to authenticate and authorize node sending data, while, public keys are used for the exchange of symmetric keys between nodes. We found that DSR may be secured using mobile agents with competitive performance.

A Novel Approach to Detect Network Attacks Using G-HMM-Based Temporal Relations between Internet Protocol Packets

Directory of Open Access Journals (Sweden)

Han Kyusuk

2011-01-01

Full Text Available This paper introduces novel attack detection approaches on mobile and wireless device security and network which consider temporal relations between internet packets. In this paper we first present a field selection technique using a Genetic Algorithm and generate a Packet-based Mining Association Rule from an original Mining Association Rule for Support Vector Machine in mobile and wireless network environment. Through the preprocessing with PMAR, SVM inputs can account for time variation between packets in mobile and wireless network. Third, we present Gaussian observation Hidden Markov Model to exploit the hidden relationships between packets based on probabilistic estimation. In our G-HMM approach, we also apply G-HMM feature reduction for better initialization. We demonstrate the usefulness of our SVM and G-HMM approaches with GA on MIT Lincoln Lab datasets and a live dataset that we captured on a real mobile and wireless network. Moreover, experimental results are verified by -fold cross-validation test.

Error and Congestion Resilient Video Streaming over Broadband Wireless

Directory of Open Access Journals (Sweden)

Laith Al-Jobouri

2015-04-01

Full Text Available In this paper, error resilience is achieved by adaptive, application-layer rateless channel coding, which is used to protect H.264/Advanced Video Coding (AVC codec data-partitioned videos. A packetization strategy is an effective tool to control error rates and, in the paper, source-coded data partitioning serves to allocate smaller packets to more important compressed video data. The scheme for doing this is applied to real-time streaming across a broadband wireless link. The advantages of rateless code rate adaptivity are then demonstrated in the paper. Because the data partitions of a video slice are each assigned to different network packets, in congestion-prone wireless networks the increased number of packets per slice and their size disparity may increase the packet loss rate from buffer overflows. As a form of congestion resilience, this paper recommends packet-size dependent scheduling as a relatively simple way of alleviating the buffer-overflow problem arising from data-partitioned packets. The paper also contributes an analysis of data partitioning and packet sizes as a prelude to considering scheduling regimes. The combination of adaptive channel coding and prioritized packetization for error resilience with packet-size dependent packet scheduling results in a robust streaming scheme specialized for broadband wireless and real-time streaming applications such as video conferencing, video telephony, and telemedicine.

Node Load Balance Multi-flow Opportunistic Routing in Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Wang Tao

2014-04-01

Full Text Available Opportunistic routing (OR has been proposed to improve the performance of wireless networks by exploiting the multi-user diversity and broadcast nature of the wireless medium. It involves multiple candidate forwarders to relay packets every hop. The existing OR doesn’t take account of the traffic load and load balance, therefore some nodes may be overloaded while the others may not, leading to network performance decline. In this paper, we focus on opportunities routing selection with node load balance which is described as a convex optimization problem. To solve the problem, by combining primal-dual and sub-gradient methods, a fully distributed Node load balance Multi-flow Opportunistic Routing algorithm (NMOR is proposed. With node load balance constraint, NMOR allocates the flow rate iteratively and the rate allocation decides the candidate forwarder selection of opportunities routing. The simulation results show that NMOR algorithm improves 100 %, 62 % of the aggregative throughput than ETX and EAX, respectively.

Mutual trust method for forwarding information in wireless sensor networks using random secret pre-distribution

Directory of Open Access Journals (Sweden)

Chih-Hsueh Lin

2016-04-01

Full Text Available In wireless sensor networks, sensing information must be transmitted from sensor nodes to the base station by multiple hopping. Every sensor node is a sender and a relay node that forwards the sensing information that is sent by other nodes. Under an attack, the sensing information may be intercepted, modified, interrupted, or fabricated during transmission. Accordingly, the development of mutual trust to enable a secure path to be established for forwarding information is an important issue. Random key pre-distribution has been proposed to establish mutual trust among sensor nodes. This article modifies the random key pre-distribution to a random secret pre-distribution and incorporates identity-based cryptography to establish an effective method of establishing mutual trust for a wireless sensor network. In the proposed method, base station assigns an identity and embeds n secrets into the private secret keys for every sensor node. Based on the identity and private secret keys, the mutual trust method is utilized to explore the types of trust among neighboring sensor nodes. The novel method can resist malicious attacks and satisfy the requirements of wireless sensor network, which are resistance to compromising attacks, masquerading attacks, forger attacks, replying attacks, authentication of forwarding messages, and security of sensing information.

Moral actor, selfish agent.

Science.gov (United States)

Frimer, Jeremy A; Schaefer, Nicola K; Oakes, Harrison

2014-05-01

People are motivated to behave selfishly while appearing moral. This tension gives rise to 2 divergently motivated selves. The actor-the watched self-tends to be moral; the agent-the self as executor-tends to be selfish. Three studies present direct evidence of the actor's and agent's distinct motives. To recruit the self-as-actor, we asked people to rate the importance of various goals. To recruit the self-as-agent, we asked people to describe their goals verbally. In Study 1, actors claimed their goals were equally about helping the self and others (viz., moral); agents claimed their goals were primarily about helping the self (viz., selfish). This disparity was evident in both individualist and collectivist cultures, attesting to the universality of the selfish agent. Study 2 compared actors' and agents' motives to those of people role-playing highly prosocial or selfish exemplars. In content (Study 2a) and in the impressions they made on an outside observer (Study 2b), actors' motives were similar to those of the prosocial role-players, whereas agents' motives were similar to those of the selfish role-players. Study 3 accounted for the difference between the actor and agent: Participants claimed that their agent's motives were the more realistic and that their actor's motives were the more idealistic. The selfish agent/moral actor duality may account for why implicit and explicit measures of the same construct diverge, and why feeling watched brings out the better angels of human nature.

Interactive Video Coding and Transmission over Heterogeneous Wired-to-Wireless IP Networks Using an Edge Proxy

Directory of Open Access Journals (Sweden)

Modestino James W

2004-01-01

Full Text Available Digital video delivered over wired-to-wireless networks is expected to suffer quality degradation from both packet loss and bit errors in the payload. In this paper, the quality degradation due to packet loss and bit errors in the payload are quantitatively evaluated and their effects are assessed. We propose the use of a concatenated forward error correction (FEC coding scheme employing Reed-Solomon (RS codes and rate-compatible punctured convolutional (RCPC codes to protect the video data from packet loss and bit errors, respectively. Furthermore, the performance of a joint source-channel coding (JSCC approach employing this concatenated FEC coding scheme for video transmission is studied. Finally, we describe an improved end-to-end architecture using an edge proxy in a mobile support station to implement differential error protection for the corresponding channel impairments expected on the two networks. Results indicate that with an appropriate JSCC approach and the use of an edge proxy, FEC-based error-control techniques together with passive error-recovery techniques can significantly improve the effective video throughput and lead to acceptable video delivery quality over time-varying heterogeneous wired-to-wireless IP networks.

Stability Analysis of Wireless Measurement and Control System Based on Dynamic Matrix

Directory of Open Access Journals (Sweden)

Yongxian SONG

2014-01-01

Full Text Available Focus on data packet loss and time delay problems in wireless greenhouse measurement and control system, and temperature and humidity were taken as the research objects, the model of temperature and humidity information transmission was set up by decoupling technology according to the characteristics of wireless greenhouse measurement and control system. According to related theory of exponential stability in network control system, the stability conditions judgment of temperature and humidity control model was established, the linear matrix inequality that time delay and packet loss should satisfy was obtained when wireless measurement and control system was stable operation. The feasibility analysis of linear matrix inequality (LMI was implemented Using LMI toolbox in MATLAB, and the critical values of time delay and packet loss rate were obtained when the system was stable operation. The wireless sensor network control system simulation model with time delay and packet loss was set up using TrueTime toolbox. The simulation results have shown that the system was in a stable state when time delay and packet loss rate obtained were less than the critical values in wireless greenhouse sensor network measurement and control system; With the increase of time delay and packet loss rate, and stable performance drops; When time delay and packet loss rate obtained were more than the critical values, the measurement and control system would be in a state of flux, and when it was serious, even can lead to collapse of the whole system. As a result, the critical values determination of time delay and packet loss rate provided a theoretical basis for establishing stable greenhouse wireless sensor network (WSN measurement and control system in practical application.

Seamless interworking architecture for WBAN in heterogeneous wireless networks with QoS guarantees.

Science.gov (United States)

Khan, Pervez; Ullah, Niamat; Ullah, Sana; Kwak, Kyung Sup

2011-10-01

The IEEE 802.15.6 standard is a communication standard optimized for low-power and short-range in-body/on-body nodes to serve a variety of medical, consumer electronics and entertainment applications. Providing high mobility with guaranteed Quality of Service (QoS) to a WBAN user in heterogeneous wireless networks is a challenging task. A WBAN uses a Personal Digital Assistant (PDA) to gather data from body sensors and forwards it to a remote server through wide range wireless networks. In this paper, we present a coexistence study of WBAN with Wireless Local Area Networks (WLAN) and Wireless Wide Area Networks (WWANs). The main issue is interworking of WBAN in heterogenous wireless networks including seamless handover, QoS, emergency services, cooperation and security. We propose a Seamless Interworking Architecture (SIA) for WBAN in heterogenous wireless networks based on a cost function. The cost function is based on power consumption and data throughput costs. Our simulation results show that the proposed scheme outperforms typical approaches in terms of throughput, delay and packet loss rate.

A Distributed Energy-Aware Trust Management System for Secure Routing in Wireless Sensor Networks

Science.gov (United States)

Stelios, Yannis; Papayanoulas, Nikos; Trakadas, Panagiotis; Maniatis, Sotiris; Leligou, Helen C.; Zahariadis, Theodore

Wireless sensor networks are inherently vulnerable to security attacks, due to their wireless operation. The situation is further aggravated because they operate in an infrastructure-less environment, which mandates the cooperation among nodes for all networking tasks, including routing, i.e. all nodes act as “routers”, forwarding the packets generated by their neighbours in their way to the sink node. This implies that malicious nodes (denying their cooperation) can significantly affect the network operation. Trust management schemes provide a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them either for data forwarding, data aggregation or any other cooperative function. We propose a secure routing solution based on a novel distributed trust management system, which allows for fast detection of a wide set of attacks and also incorporates energy awareness.

Collective intelligent wireless sensor networks

NARCIS (Netherlands)

Mihaylov, M.; Nowe, A.; Tuyls, K.P.; Nijholt, A.; Pantic, M.

2008-01-01

In this paper we apply the COllective INtelligence (COIN) framework ofWolpert et al. toWireless Sensor Networks (WSNs) with the aim to increase the autonomous lifetime of the network in a decentralized manner. COIN describes how selfish agents can learn to optimize their own performance, so that the

SVANET: A smart vehicular ad hoc network for efficient data transmission with wireless sensors.

Science.gov (United States)

Sahoo, Prasan Kumar; Chiang, Ming-Jer; Wu, Shih-Lin

2014-11-25

Wireless sensors can sense any event, such as accidents, as well as icy roads, and can forward the rescue/warning messages through intermediate vehicles for any necessary help. In this paper, we propose a smart vehicular ad hoc network (SVANET) architecture that uses wireless sensors to detect events and vehicles to transmit the safety and non-safety messages efficiently by using different service channels and one control channel with different priorities. We have developed a data transmission protocol for the vehicles in the highway, in which data can be forwarded with the help of vehicles if they are connected with each other or data can be forwarded with the help of nearby wireless sensors. Our data transmission protocol is designed to increase the driving safety, to prevent accidents and to utilize channels efficiently by adjusting the control and service channel time intervals dynamically. Besides, our protocol can transmit information to vehicles in advance, so that drivers can decide an alternate route in case of traffic congestion. For various data sharing, we design a method that can select a few leader nodes among vehicles running along a highway to broadcast data efficiently. Simulation results show that our protocol can outperform the existing standard in terms of the end to end packet delivery ratio and latency.

Enhancing a network coding security scheme to avoid packet dropping in wireless mesh networks / H.L.H.C. Terblanche.

OpenAIRE

Terblanche, Heila Levina Helena Catharina

2013-01-01

With the increase of mobile and smart device usage, the interest in dynamically forming networks is rising. One such type of network isWireless Mesh Networks (WMNs). WMNs are multi-hop networks, with a decentralised nature that can dynamically form into mesh topologies. Network Coding (NC) is a method that is used to increase the efficiency of networks by encoding and decoding data on packet level by means of an XOR operation. NC works well with WMNs because it can exploit WMNs broadcast a...

Wireless Network Penetration Testing and Security Auditing

Directory of Open Access Journals (Sweden)

Wang Shao-Long

2016-01-01

Full Text Available IEEE802.11 wireless wireless networks have security issues that are vulnerable to a variety of attacks. Due to using radio to transport data, attackers can bypass firewalls, sniff sensitive information, intercept packets and send malicious packets. Security auditing and penetration testing is expected to ensure wireless networks security. The contributions of this work are analyzed the vulnerability and types of attacks pertaining to IEEE 802.11 WLAN, performed well known attacks in a laboratory environment to conduct penetration tests to confirm whether our wireless network is hackable or not. WAIDPS is configured as auditing tool to view wireless attacks, such as WEP/WPA/WPA2 cracking, rouge access points, denial of service attack. WAIDPS is designed to detect wireless intrusion with additional features. Penetration testing and auditing will mitigate the risk and threatening to protect WALN.

The Localized Discovery and Recovery for Query Packet Losses in Wireless Sensor Networks with Distributed Detector Clusters

Directory of Open Access Journals (Sweden)

Ryu Miura

2013-06-01

Full Text Available An essential application of wireless sensor networks is to successfully respond to user queries. Query packet losses occur in the query dissemination due to wireless communication problems such as interference, multipath fading, packet collisions, etc. The losses of query messages at sensor nodes result in the failure of sensor nodes reporting the requested data. Hence, the reliable and successful dissemination of query messages to sensor nodes is a non-trivial problem. The target of this paper is to enable highly successful query delivery to sensor nodes by localized and energy-efficient discovery, and recovery of query losses. We adopt local and collective cooperation among sensor nodes to increase the success rate of distributed discoveries and recoveries. To enable the scalability in the operations of discoveries and recoveries, we employ a distributed name resolution mechanism at each sensor node to allow sensor nodes to self-detect the correlated queries and query losses, and then efficiently locally respond to the query losses. We prove that the collective discovery of query losses has a high impact on the success of query dissemination and reveal that scalability can be achieved by using the proposed approach. We further study the novel features of the cooperation and competition in the collective recovery at PHY and MAC layers, and show that the appropriate number of detectors can achieve optimal successful recovery rate. We evaluate the proposed approach with both mathematical analyses and computer simulations. The proposed approach enables a high rate of successful delivery of query messages and it results in short route lengths to recover from query losses. The proposed approach is scalable and operates in a fully distributed manner.

A Localization-Free Interference and Energy Holes Minimization Routing for Underwater Wireless Sensor Networks.

Science.gov (United States)

Khan, Anwar; Ahmedy, Ismail; Anisi, Mohammad Hossein; Javaid, Nadeem; Ali, Ihsan; Khan, Nawsher; Alsaqer, Mohammed; Mahmood, Hasan

2018-01-09

Interference and energy holes formation in underwater wireless sensor networks (UWSNs) threaten the reliable delivery of data packets from a source to a destination. Interference also causes inefficient utilization of the limited battery power of the sensor nodes in that more power is consumed in the retransmission of the lost packets. Energy holes are dead nodes close to the surface of water, and their early death interrupts data delivery even when the network has live nodes. This paper proposes a localization-free interference and energy holes minimization (LF-IEHM) routing protocol for UWSNs. The proposed algorithm overcomes interference during data packet forwarding by defining a unique packet holding time for every sensor node. The energy holes formation is mitigated by a variable transmission range of the sensor nodes. As compared to the conventional routing protocols, the proposed protocol does not require the localization information of the sensor nodes, which is cumbersome and difficult to obtain, as nodes change their positions with water currents. Simulation results show superior performance of the proposed scheme in terms of packets received at the final destination and end-to-end delay.

A Localization-Free Interference and Energy Holes Minimization Routing for Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Anwar Khan

2018-01-01

Full Text Available Interference and energy holes formation in underwater wireless sensor networks (UWSNs threaten the reliable delivery of data packets from a source to a destination. Interference also causes inefficient utilization of the limited battery power of the sensor nodes in that more power is consumed in the retransmission of the lost packets. Energy holes are dead nodes close to the surface of water, and their early death interrupts data delivery even when the network has live nodes. This paper proposes a localization-free interference and energy holes minimization (LF-IEHM routing protocol for UWSNs. The proposed algorithm overcomes interference during data packet forwarding by defining a unique packet holding time for every sensor node. The energy holes formation is mitigated by a variable transmission range of the sensor nodes. As compared to the conventional routing protocols, the proposed protocol does not require the localization information of the sensor nodes, which is cumbersome and difficult to obtain, as nodes change their positions with water currents. Simulation results show superior performance of the proposed scheme in terms of packets received at the final destination and end-to-end delay.

On Maximizing the Throughput of Packet Transmission under Energy Constraints.

Science.gov (United States)

Wu, Weiwei; Dai, Guangli; Li, Yan; Shan, Feng

2018-06-23

More and more Internet of Things (IoT) wireless devices have been providing ubiquitous services over the recent years. Since most of these devices are powered by batteries, a fundamental trade-off to be addressed is the depleted energy and the achieved data throughput in wireless data transmission. By exploiting the rate-adaptive capacities of wireless devices, most existing works on energy-efficient data transmission try to design rate-adaptive transmission policies to maximize the amount of transmitted data bits under the energy constraints of devices. Such solutions, however, cannot apply to scenarios where data packets have respective deadlines and only integrally transmitted data packets contribute. Thus, this paper introduces a notion of weighted throughput, which measures how much total value of data packets are successfully and integrally transmitted before their own deadlines. By designing efficient rate-adaptive transmission policies, this paper aims to make the best use of the energy and maximize the weighted throughput. What is more challenging but with practical significance, we consider the fading effect of wireless channels in both offline and online scenarios. In the offline scenario, we develop an optimal algorithm that computes the optimal solution in pseudo-polynomial time, which is the best possible solution as the problem undertaken is NP-hard. In the online scenario, we propose an efficient heuristic algorithm based on optimal properties derived for the optimal offline solution. Simulation results validate the efficiency of the proposed algorithm.

HARDWARE IMPLEMENTATION OF SECURE AODV FOR WIRELESS SENSOR NETWORKS

Directory of Open Access Journals (Sweden)

S. Sharmila

2010-12-01

Full Text Available Wireless Sensor Networks are extremely vulnerable to any kind of routing attacks due to several factors such as wireless transmission and resource-constrained nodes. In this respect, securing the packets is of great importance when designing the infrastructure and protocols of sensor networks. This paper describes the hardware architecture of secure routing for wireless sensor networks. The routing path is selected using Ad-hoc on demand distance vector routing protocol (AODV. The data packets are converted into digest using hash functions. The functionality of the proposed method is modeled using Verilog HDL in MODELSIM simulator and the performance is compared with various target devices. The results show that the data packets are secured and defend against the routing attacks with minimum energy consumption.

Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

Science.gov (United States)

Radi, Marjan; Dezfouli, Behnam; Bakar, Kamalrulnizam Abu; Lee, Malrey

2012-01-01

A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks. PMID:22368490

Multipath routing in wireless sensor networks: survey and research challenges.

Science.gov (United States)

Radi, Marjan; Dezfouli, Behnam; Abu Bakar, Kamalrulnizam; Lee, Malrey

2012-01-01

A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks.

A Low Power 2.4 GHz CMOS Mixer Using Forward Body Bias Technique for Wireless Sensor Network

Science.gov (United States)

Yin, C. J.; Murad, S. A. Z.; Harun, A.; Ramli, M. M.; Zulkifli, T. Z. A.; Karim, J.

2018-03-01

Wireless sensor network (WSN) is a highly-demanded application since the evolution of wireless generation which is often used in recent communication technology. A radio frequency (RF) transceiver in WSN should have a low power consumption to support long operating times of mobile devices. A down-conversion mixer is responsible for frequency translation in a receiver. By operating a down-conversion mixer at a low supply voltage, the power consumed by WSN receiver can be greatly reduced. This paper presents a development of low power CMOS mixer using forward body bias technique for wireless sensor network. The proposed mixer is implemented using CMOS 0.13 μm Silterra technology. The forward body bias technique is adopted to obtain low power consumption. The simulation results indicate that a low power consumption of 0.91 mW is achieved at 1.6 V supply voltage. Moreover, the conversion gain (CG) of 21.83 dB, the noise figure (NF) of 16.51 dB and the input-referred third-order intercept point (IIP3) of 8.0 dB at 2.4 GHz are obtained. The proposed mixer is suitable for wireless sensor network.

SVANET: A Smart Vehicular Ad Hoc Network for Efficient Data Transmission with Wireless Sensors

Directory of Open Access Journals (Sweden)

Prasan Kumar Sahoo

2014-11-01

Full Text Available Wireless sensors can sense any event, such as accidents, as well as icy roads, and can forward the rescue/warning messages through intermediate vehicles for any necessary help. In this paper, we propose a smart vehicular ad hoc network (SVANET architecture that uses wireless sensors to detect events and vehicles to transmit the safety and non-safety messages efficiently by using different service channels and one control channel with different priorities. We have developed a data transmission protocol for the vehicles in the highway, in which data can be forwarded with the help of vehicles if they are connected with each other or data can be forwarded with the help of nearby wireless sensors. Our data transmission protocol is designed to increase the driving safety, to prevent accidents and to utilize channels efficiently by adjusting the control and service channel time intervals dynamically. Besides, our protocol can transmit information to vehicles in advance, so that drivers can decide an alternate route in case of traffic congestion. For various data sharing, we design a method that can select a few leader nodes among vehicles running along a highway to broadcast data efficiently. Simulation results show that our protocol can outperform the existing standard in terms of the end to end packet delivery ratio and latency.

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks.

Science.gov (United States)

Katiravan, Jeevaa; Sylvia, D; Rao, D Srinivasa

2015-01-01

In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Jeevaa Katiravan

2015-01-01

Full Text Available In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

Packets Distributing Evolutionary Algorithm Based on PSO for Ad Hoc Network

Science.gov (United States)

Xu, Xiao-Feng

2018-03-01

Wireless communication network has such features as limited bandwidth, changeful channel and dynamic topology, etc. Ad hoc network has lots of difficulties in accessing control, bandwidth distribution, resource assign and congestion control. Therefore, a wireless packets distributing Evolutionary algorithm based on PSO (DPSO)for Ad Hoc Network is proposed. Firstly, parameters impact on performance of network are analyzed and researched to obtain network performance effective function. Secondly, the improved PSO Evolutionary Algorithm is used to solve the optimization problem from local to global in the process of network packets distributing. The simulation results show that the algorithm can ensure fairness and timeliness of network transmission, as well as improve ad hoc network resource integrated utilization efficiency.

Mobile Sinks Assisted Geographic and Opportunistic Routing Based Interference Avoidance for Underwater Wireless Sensor Network.

Science.gov (United States)

Ahmed, Farwa; Wadud, Zahid; Javaid, Nadeem; Alrajeh, Nabil; Alabed, Mohamad Souheil; Qasim, Umar

2018-04-02

The distinctive features of acoustic communication channel-like high propagation delay, multi-path fading, quick attenuation of acoustic signal, etc. limit the utilization of underwater wireless sensor networks (UWSNs). The immutable selection of forwarder node leads to dramatic death of node resulting in imbalanced energy depletion and void hole creation. To reduce the probability of void occurrence and imbalance energy dissipation, in this paper, we propose mobility assisted geo-opportunistic routing paradigm based on interference avoidance for UWSNs. The network volume is divided into logical small cubes to reduce the interference and to make more informed routing decisions for efficient energy consumption. Additionally, an optimal number of forwarder nodes is elected from each cube based on its proximity with respect to the destination to avoid void occurrence. Moreover, the data packets are recovered from void regions with the help of mobile sinks which also reduce the data traffic on intermediate nodes. Extensive simulations are performed to verify that our proposed work maximizes the network lifetime and packet delivery ratio.

Mobile Sinks Assisted Geographic and Opportunistic Routing Based Interference Avoidance for Underwater Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Farwa Ahmed

2018-04-01

Full Text Available The distinctive features of acoustic communication channel-like high propagation delay, multi-path fading, quick attenuation of acoustic signal, etc. limit the utilization of underwater wireless sensor networks (UWSNs. The immutable selection of forwarder node leads to dramatic death of node resulting in imbalanced energy depletion and void hole creation. To reduce the probability of void occurrence and imbalance energy dissipation, in this paper, we propose mobility assisted geo-opportunistic routing paradigm based on interference avoidance for UWSNs. The network volume is divided into logical small cubes to reduce the interference and to make more informed routing decisions for efficient energy consumption. Additionally, an optimal number of forwarder nodes is elected from each cube based on its proximity with respect to the destination to avoid void occurrence. Moreover, the data packets are recovered from void regions with the help of mobile sinks which also reduce the data traffic on intermediate nodes. Extensive simulations are performed to verify that our proposed work maximizes the network lifetime and packet delivery ratio.

Wireless sensor network performance metrics for building applications

Energy Technology Data Exchange (ETDEWEB)

Jang, W.S. (Department of Civil Engineering Yeungnam University 214-1 Dae-Dong, Gyeongsan-Si Gyeongsangbuk-Do 712-749 South Korea); Healy, W.M. [Building and Fire Research Laboratory, 100 Bureau Drive, Gaithersburg, MD 20899-8632 (United States)

2010-06-15

Metrics are investigated to help assess the performance of wireless sensors in buildings. Wireless sensor networks present tremendous opportunities for energy savings and improvement in occupant comfort in buildings by making data about conditions and equipment more readily available. A key barrier to their adoption, however, is the uncertainty among users regarding the reliability of the wireless links through building construction. Tests were carried out that examined three performance metrics as a function of transmitter-receiver separation distance, transmitter power level, and obstruction type. These tests demonstrated, via the packet delivery rate, a clear transition from reliable to unreliable communications at different separation distances. While the packet delivery rate is difficult to measure in actual applications, the received signal strength indication correlated well with the drop in packet delivery rate in the relatively noise-free environment used in these tests. The concept of an equivalent distance was introduced to translate the range of reliability in open field operation to that seen in a typical building, thereby providing wireless system designers a rough estimate of the necessary spacing between sensor nodes in building applications. It is anticipated that the availability of straightforward metrics on the range of wireless sensors in buildings will enable more widespread sensing in buildings for improved control and fault detection. (author)

Goals are not selfish.

Science.gov (United States)

von Hippel, William; von Hippel, Frank A

2014-04-01

The metaphor of selfish goals is misguided. Organisms can be considered vessels that further the interests of their genes, but not vessels that further the interests of their goals. Although goals can act at cross-purposes to each other and to longevity, such trade-offs are predicted by evolutionary theory. The metaphor of selfish goals provides no purchase on this problem.

A parasitic selfish gene that affects host promiscuity.

Science.gov (United States)

Giraldo-Perez, Paulina; Goddard, Matthew R

2013-11-07

Selfish genes demonstrate transmission bias and invade sexual populations despite conferring no benefit to their hosts. While the molecular genetics and evolutionary dynamics of selfish genes are reasonably well characterized, their effects on hosts are not. Homing endonuclease genes (HEGs) are one well-studied family of selfish genes that are assumed to be benign. However, we show that carrying HEGs is costly for Saccharomyces cerevisiae, demonstrating that these genetic elements are not necessarily benign but maybe parasitic. We estimate a selective load of approximately 1-2% in 'natural' niches. The second aspect we examine is the ability of HEGs to affect hosts' sexual behaviour. As all selfish genes critically rely on sex for spread, then any selfish gene correlated with increased host sexuality will enjoy a transmission advantage. While classic parasites are known to manipulate host behaviour, we are not aware of any evidence showing a selfish gene is capable of affecting host promiscuity. The data presented here show a selfish element may increase the propensity of its eukaryote host to undergo sex and along with increased rates of non-Mendelian inheritance, this may counterbalance mitotic selective load and promote spread. Demonstration that selfish genes are correlated with increased promiscuity in eukaryotes connects with ideas suggesting that selfish genes promoted the evolution of sex initially.

DOW-PR DOlphin and Whale Pods Routing Protocol for Underwater Wireless Sensor Networks (UWSNs).

Science.gov (United States)

Wadud, Zahid; Ullah, Khadem; Hussain, Sajjad; Yang, Xiaodong; Qazi, Abdul Baseer

2018-05-12

Underwater Wireless Sensor Networks (UWSNs) have intrinsic challenges that include long propagation delays, high mobility of sensor nodes due to water currents, Doppler spread, delay variance, multipath, attenuation and geometric spreading. The existing Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) protocol considers the weighting depth of the two hops in order to select the next Potential Forwarding Node (PFN). To improve the performance of WDFAD-DBR, we propose DOlphin and Whale Pod Routing protocol (DOW-PR). In this scheme, we divide the transmission range into a number of transmission power levels and at the same time select the next PFNs from forwarding and suppressed zones. In contrast to WDFAD-DBR, our scheme not only considers the packet upward advancement, but also takes into account the number of suppressed nodes and number of PFNs at the first and second hops. Consequently, reasonable energy reduction is observed while receiving and transmitting packets. Moreover, our scheme also considers the hops count of the PFNs from the sink. In the absence of PFNs, the proposed scheme will select the node from the suppressed region for broadcasting and thus ensures minimum loss of data. Besides this, we also propose another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection. Simulation results show that the proposed scheme has high Packet Delivery Ratio (PDR), low energy tax, reduced Accumulated Propagation Distance (APD) and increased the network lifetime.

Further Results on Extended Delivery Time for Secondary Packet Transmission

KAUST Repository

Usman, Muneer

2017-07-10

Cognitive radio transceiver can opportunistically access the underutilized spectrum resource of primary systems for new wireless services. With interweave cognitive implementation, secondary transmission may be interrupted by primary transmission. To facilitate the packet delay analysis of such secondary transmission, we study the extended delivery time of secondary packet transmission. In particular, we derive the exact distribution function of extended delivery time of a fixed-size secondary packet with non-work-preserving strategy, where interrupted packets must be repeated. We also analyze the effect of imperfect periodic sensing, i.e., the secondary user periodically senses the spectrum for availability, with a chance of missing an available channel on a certain sensing attempt. These results complement previous work on work-preserving strategy with perfect sensing. Selected numerical and simulation results are presented for verifying the mathematical formulation.

Two-Step Fair Scheduling of Continuous Media Streams over Error-Prone Wireless Channels

Science.gov (United States)

Oh, Soohyun; Lee, Jin Wook; Park, Taejoon; Jo, Tae-Chang

In wireless cellular networks, streaming of continuous media (with strict QoS requirements) over wireless links is challenging due to their inherent unreliability characterized by location-dependent, bursty errors. To address this challenge, we present a two-step scheduling algorithm for a base station to provide streaming of continuous media to wireless clients over the error-prone wireless links. The proposed algorithm is capable of minimizing the packet loss rate of individual clients in the presence of error bursts, by transmitting packets in the round-robin manner and also adopting a mechanism for channel prediction and swapping.

A Reliable Wireless Control System for Tomato Hydroponics.

Science.gov (United States)

Ibayashi, Hirofumi; Kaneda, Yukimasa; Imahara, Jungo; Oishi, Naoki; Kuroda, Masahiro; Mineno, Hiroshi

2016-05-05

Agricultural systems using advanced information and communication (ICT) technology can produce high-quality crops in a stable environment while decreasing the need for manual labor. The system collects a wide variety of environmental data and provides the precise cultivation control needed to produce high value-added crops; however, there are the problems of packet transmission errors in wireless sensor networks or system failure due to having the equipment in a hot and humid environment. In this paper, we propose a reliable wireless control system for hydroponic tomato cultivation using the 400 MHz wireless band and the IEEE 802.15.6 standard. The 400 MHz band, which is lower than the 2.4 GHz band, has good obstacle diffraction, and zero-data-loss communication is realized using the guaranteed time-slot method supported by the IEEE 802.15.6 standard. In addition, this system has fault tolerance and a self-healing function to recover from faults such as packet transmission failures due to deterioration of the wireless communication quality. In our basic experiments, the 400 MHz band wireless communication was not affected by the plants' growth, and the packet error rate was less than that of the 2.4 GHz band. In summary, we achieved a real-time hydroponic liquid supply control with no data loss by applying a 400 MHz band WSN to hydroponic tomato cultivation.

A Reliable Wireless Control System for Tomato Hydroponics

Science.gov (United States)

Ibayashi, Hirofumi; Kaneda, Yukimasa; Imahara, Jungo; Oishi, Naoki; Kuroda, Masahiro; Mineno, Hiroshi

2016-01-01

Agricultural systems using advanced information and communication (ICT) technology can produce high-quality crops in a stable environment while decreasing the need for manual labor. The system collects a wide variety of environmental data and provides the precise cultivation control needed to produce high value-added crops; however, there are the problems of packet transmission errors in wireless sensor networks or system failure due to having the equipment in a hot and humid environment. In this paper, we propose a reliable wireless control system for hydroponic tomato cultivation using the 400 MHz wireless band and the IEEE 802.15.6 standard. The 400 MHz band, which is lower than the 2.4 GHz band, has good obstacle diffraction, and zero-data-loss communication is realized using the guaranteed time-slot method supported by the IEEE 802.15.6 standard. In addition, this system has fault tolerance and a self-healing function to recover from faults such as packet transmission failures due to deterioration of the wireless communication quality. In our basic experiments, the 400 MHz band wireless communication was not affected by the plants’ growth, and the packet error rate was less than that of the 2.4 GHz band. In summary, we achieved a real-time hydroponic liquid supply control with no data loss by applying a 400 MHz band WSN to hydroponic tomato cultivation. PMID:27164105

Wireless Sensor Network Congestion Control Based on Standard Particle Swarm Optimization and Single Neuron PID.

Science.gov (United States)

Yang, Xiaoping; Chen, Xueying; Xia, Riting; Qian, Zhihong

2018-04-19

Aiming at the problem of network congestion caused by the large number of data transmissions in wireless routing nodes of wireless sensor network (WSN), this paper puts forward an algorithm based on standard particle swarm⁻neural PID congestion control (PNPID). Firstly, PID control theory was applied to the queue management of wireless sensor nodes. Then, the self-learning and self-organizing ability of neurons was used to achieve online adjustment of weights to adjust the proportion, integral and differential parameters of the PID controller. Finally, the standard particle swarm optimization to neural PID (NPID) algorithm of initial values of proportion, integral and differential parameters and neuron learning rates were used for online optimization. This paper describes experiments and simulations which show that the PNPID algorithm effectively stabilized queue length near the expected value. At the same time, network performance, such as throughput and packet loss rate, was greatly improved, which alleviated network congestion and improved network QoS.

Wireless Sensor Network Congestion Control Based on Standard Particle Swarm Optimization and Single Neuron PID

Science.gov (United States)

Yang, Xiaoping; Chen, Xueying; Xia, Riting; Qian, Zhihong

2018-01-01

Aiming at the problem of network congestion caused by the large number of data transmissions in wireless routing nodes of wireless sensor network (WSN), this paper puts forward an algorithm based on standard particle swarm–neural PID congestion control (PNPID). Firstly, PID control theory was applied to the queue management of wireless sensor nodes. Then, the self-learning and self-organizing ability of neurons was used to achieve online adjustment of weights to adjust the proportion, integral and differential parameters of the PID controller. Finally, the standard particle swarm optimization to neural PID (NPID) algorithm of initial values of proportion, integral and differential parameters and neuron learning rates were used for online optimization. This paper describes experiments and simulations which show that the PNPID algorithm effectively stabilized queue length near the expected value. At the same time, network performance, such as throughput and packet loss rate, was greatly improved, which alleviated network congestion and improved network QoS. PMID:29671822

Deep Packet/Flow Analysis using GPUs

Energy Technology Data Exchange (ETDEWEB)

Gong, Qian [Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States); Wu, Wenji [Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States); DeMar, Phil [Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States)

2017-11-12

Deep packet inspection (DPI) faces severe performance challenges in high-speed networks (40/100 GE) as it requires a large amount of raw computing power and high I/O throughputs. Recently, researchers have tentatively used GPUs to address the above issues and boost the performance of DPI. Typically, DPI applications involve highly complex operations in both per-packet and per-flow data level, often in real-time. The parallel architecture of GPUs fits exceptionally well for per-packet network traffic processing. However, for stateful network protocols such as TCP, their data stream need to be reconstructed in a per-flow level to deliver a consistent content analysis. Since the flow-centric operations are naturally antiparallel and often require large memory space for buffering out-of-sequence packets, they can be problematic for GPUs, whose memory is normally limited to several gigabytes. In this work, we present a highly efficient GPU-based deep packet/flow analysis framework. The proposed design includes a purely GPU-implemented flow tracking and TCP stream reassembly. Instead of buffering and waiting for TCP packets to become in sequence, our framework process the packets in batch and uses a deterministic finite automaton (DFA) with prefix-/suffix- tree method to detect patterns across out-of-sequence packets that happen to be located in different batches. In conclusion, evaluation shows that our code can reassemble and forward tens of millions of packets per second and conduct a stateful signature-based deep packet inspection at 55 Gbit/s using an NVIDIA K40 GPU.

A Scheduling Algorithm for Minimizing the Packet Error Probability in Clusterized TDMA Networks

Directory of Open Access Journals (Sweden)

Arash T. Toyserkani

2009-01-01

Full Text Available We consider clustered wireless networks, where transceivers in a cluster use a time-slotted mechanism (TDMA to access a wireless channel that is shared among several clusters. An approximate expression for the packet-loss probability is derived for networks with one or more mutually interfering clusters in Rayleigh fading environments, and the approximation is shown to be good for relevant scenarios. We then present a scheduling algorithm, based on Lagrangian duality, that exploits the derived packet-loss model in an attempt to minimize the average packet-loss probability in the network. Computer simulations of the proposed scheduling algorithm show that a significant increase in network throughput can be achieved compared to uncoordinated scheduling. Empirical trials also indicate that the proposed optimization algorithm almost always converges to an optimal schedule with a reasonable number of iterations. Thus, the proposed algorithm can also be used for bench-marking suboptimal scheduling algorithms.

Wireless Power Transfer and Data Collection in Wireless Sensor Networks

OpenAIRE

Li, Kai; Ni, Wei; Duan, Lingjie; Abolhasan, Mehran; Niu, Jianwei

2017-01-01

In a rechargeable wireless sensor network, the data packets are generated by sensor nodes at a specific data rate, and transmitted to a base station. Moreover, the base station transfers power to the nodes by using Wireless Power Transfer (WPT) to extend their battery life. However, inadequately scheduling WPT and data collection causes some of the nodes to drain their battery and have their data buffer overflow, while the other nodes waste their harvested energy, which is more than they need...

TMAC: Timestamp-Ordered MAC for CSMA/CA Wireless Mesh Networks

KAUST Repository

Nawab, Faisal Saud Yousef; Jamshaid, Kamran; Shihada, Basem; Ho, Pin-Han

2011-01-01

We propose TMAC, a timestamp-ordered MAC protocol for Wireless Mesh Networks (WMNs). TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended

Energy Efficient Payload Aggregation in WSNs

Directory of Open Access Journals (Sweden)

Ákos MILÁNKOVICH

2015-06-01

Full Text Available Creating wireless sensor networks requires a different approach than traditional communication networks because energy efficiency plays a key role in sensor networks, which consist of devices without external power. The amount of energy used determines the lifetime of these devices. In most cases data packets are less sensitive to delay, thus can be aggregated, making it possible to gather more useful information reducing the energy required to transmit information. This article discusses the energy efficiency of different Forward Error Correction algorithms and presents a method to calculate the optimal amount of aggregation of the data packets in terms of power consumption, while taking into account the Bit Error Rate characteristics of the wireless channel. The contribution of this paper is a general method to improve the energy efficiency of wireless sensor networks by using the optimal amount of aggregation in case of different Forward Error Correction codes and channel characteristics. The presented results can be applied to any packet-based wireless protocol.

Minimizing The Completion Time Of A Wireless Cooperative Network Using Network Coding

DEFF Research Database (Denmark)

Roetter, Daniel Enrique Lucani; Khamfroush, Hana; Barros, João

2013-01-01

We consider the performance of network coding for a wireless cooperative network in which a source wants to transmit M data packets to two receivers. We assume that receivers can share their received packets with each other or simply wait to receive the packets from the source. The problem of fin...

Distributed wireless quantum communication networks

International Nuclear Information System (INIS)

Yu Xu-Tao; Xu Jin; Zhang Zai-Chen

2013-01-01

The distributed wireless quantum communication network (DWQCN) has a distributed network topology and transmits information by quantum states. In this paper, we present the concept of the DWQCN and propose a system scheme to transfer quantum states in the DWQCN. The system scheme for transmitting information between any two nodes in the DWQCN includes a routing protocol and a scheme for transferring quantum states. The routing protocol is on-demand and the routing metric is selected based on the number of entangled particle pairs. After setting up a route, quantum teleportation and entanglement swapping are used for transferring quantum states. Entanglement swapping is achieved along with the process of routing set up and the acknowledgment packet transmission. The measurement results of each entanglement swapping are piggybacked with route reply packets or acknowledgment packets. After entanglement swapping, a direct quantum link between source and destination is set up and quantum states are transferred by quantum teleportation. Adopting this scheme, the measurement results of entanglement swapping do not need to be transmitted specially, which decreases the wireless transmission cost and transmission delay. (general)

Efficient incremental relaying for packet transmission over fading channels

KAUST Repository

Fareed, Muhammad Mehboob

2014-07-01

In this paper, we propose a novel relaying scheme for packet transmission over fading channels, which improves the spectral efficiency of cooperative diversity systems by utilizing limited feedback from the destination. Our scheme capitalizes on the fact that relaying is only required when direct transmission suffers deep fading. We calculate the packet error rate for the proposed efficient incremental relaying (EIR) scheme with both amplify and forward and decode and forward relaying. We compare the performance of the EIR scheme with the threshold-based incremental relaying (TIR) scheme. It is shown that the efficiency of the TIR scheme is better for lower values of the threshold. However, the efficiency of the TIR scheme for higher values of threshold is outperformed by the EIR. In addition, three new threshold-based adaptive EIR are devised to further improve the efficiency of the EIR scheme. We calculate the packet error rate and the efficiency of these new schemes to provide the analytical insight. © 2014 IEEE.

Efficient packet forwarding using cyber-security aware policies

Science.gov (United States)

Ros-Giralt, Jordi

2017-10-25

For balancing load, a forwarder can selectively direct data from the forwarder to a processor according to a loading parameter. The selective direction includes forwarding the data to the processor for processing, transforming and/or forwarding the data to another node, and dropping the data. The forwarder can also adjust the loading parameter based on, at least in part, feedback received from the processor. One or more processing elements can store values associated with one or more flows into a structure without locking the structure. The stored values can be used to determine how to direct the flows, e.g., whether to process a flow or to drop it. The structure can be used within an information channel providing feedback to a processor.

SPRINT-SELF: Social-Based Routing and Selfish Node Detection in Opportunistic Networks

Directory of Open Access Journals (Sweden)

Radu Ioan Ciobanu

2015-01-01

Full Text Available Since mobile devices nowadays have become ubiquitous, several types of networks formed over such devices have been proposed. One such approach is represented by opportunistic networking, which is based on a store-carry-and-forward paradigm, where nodes store data and carry it until they reach a suitable node for forwarding. The problem in such networks is how to decide what the next hop will be, since nodes do not have a global view of the network. We propose using the social network information of a node when performing routing, since a node is more likely to encounter members of its own social community than other nodes. In addition, we approximate a node’s contact as a Poisson distribution and show that we can predict its future behavior based on the contact history. Furthermore, since opportunistic network nodes may be selfish, we improve our solution by adding a selfish node detection and avoidance mechanism, which can help reduce the number of unnecessary messages sent in the network, and thus avoid congestion and decrease battery consumption. We show that our algorithm outperforms existing solutions such as BUBBLE Rap and Epidemic in terms of delivery cost and hit rate, as well as the rate of congestion introduced in the network, by testing in various realistic scenarios.

Availability and End-to-end Reliability in Low Duty Cycle Multihop Wireless Sensor Networks.

Science.gov (United States)

Suhonen, Jukka; Hämäläinen, Timo D; Hännikäinen, Marko

2009-01-01

A wireless sensor network (WSN) is an ad-hoc technology that may even consist of thousands of nodes, which necessitates autonomic, self-organizing and multihop operations. A typical WSN node is battery powered, which makes the network lifetime the primary concern. The highest energy efficiency is achieved with low duty cycle operation, however, this alone is not enough. WSNs are deployed for different uses, each requiring acceptable Quality of Service (QoS). Due to the unique characteristics of WSNs, such as dynamic wireless multihop routing and resource constraints, the legacy QoS metrics are not feasible as such. We give a new definition to measure and implement QoS in low duty cycle WSNs, namely availability and reliability. Then, we analyze the effect of duty cycling for reaching the availability and reliability. The results are obtained by simulations with ZigBee and proprietary TUTWSN protocols. Based on the results, we also propose a data forwarding algorithm suitable for resource constrained WSNs that guarantees end-to-end reliability while adding a small overhead that is relative to the packet error rate (PER). The forwarding algorithm guarantees reliability up to 30% PER.

Availability and End-to-end Reliability in Low Duty Cycle MultihopWireless Sensor Networks

Directory of Open Access Journals (Sweden)

Timo D. Hämäläinen

2009-03-01

Full Text Available A wireless sensor network (WSN is an ad-hoc technology that may even consist of thousands of nodes, which necessitates autonomic, self-organizing and multihop operations. A typical WSN node is battery powered, which makes the network lifetime the primary concern. The highest energy efficiency is achieved with low duty cycle operation, however, this alone is not enough. WSNs are deployed for different uses, each requiring acceptable Quality of Service (QoS. Due to the unique characteristics of WSNs, such as dynamic wireless multihop routing and resource constraints, the legacy QoS metrics are not feasible as such. We give a new definition to measure and implement QoS in low duty cycle WSNs, namely availability and reliability. Then, we analyze the effect of duty cycling for reaching the availability and reliability. The results are obtained by simulations with ZigBee and proprietary TUTWSN protocols. Based on the results, we also propose a data forwarding algorithm suitable for resource constrained WSNs that guarantees end-to-end reliability while adding a small overhead that is relative to the packet error rate (PER. The forwarding algorithm guarantees reliability up to 30% PER.

Efficient Vector-Based Forwarding for Underwater Sensor Networks

Directory of Open Access Journals (Sweden)

Peng Xie

2010-01-01

Full Text Available Underwater Sensor Networks (UWSNs are significantly different from terrestrial sensor networks in the following aspects: low bandwidth, high latency, node mobility, high error probability, and 3-dimensional space. These new features bring many challenges to the network protocol design of UWSNs. In this paper, we tackle one fundamental problem in UWSNs: robust, scalable, and energy efficient routing. We propose vector-based forwarding (VBF, a geographic routing protocol. In VBF, the forwarding path is guided by a vector from the source to the target, no state information is required on the sensor nodes, and only a small fraction of the nodes is involved in routing. To improve the robustness, packets are forwarded in redundant and interleaved paths. Further, a localized and distributed self-adaptation algorithm allows the nodes to reduce energy consumption by discarding redundant packets. VBF performs well in dense networks. For sparse networks, we propose a hop-by-hop vector-based forwarding (HH-VBF protocol, which adapts the vector-based approach at every hop. We evaluate the performance of VBF and HH-VBF through extensive simulations. The simulation results show that VBF achieves high packet delivery ratio and energy efficiency in dense networks and HH-VBF has high packet delivery ratio even in sparse networks.

Selfish brain and selfish immune system interplay: A theoretical framework for metabolic comorbidities of mood disorders.

Science.gov (United States)

Yamagata, Ana Sayuri; Mansur, Rodrigo Barbachan; Rizzo, Lucas Bortolotto; Rosenstock, Tatiana; McIntyre, Roger S; Brietzke, Elisa

2017-01-01

According to the "selfish brain" theory, the brain regulates its own energy supply influencing the peripheral metabolism and food intake according to its needs. The immune system has been likewise "selfish" due to independent energy consumption; and it may compete with the brain (another high energy-consumer) for glucose. In mood disorders, stress in mood episodes or physiological stress activate homeostasis mechanisms from the brain and the immune system to solve the imbalance. The interaction between the selfish brain and the selfish immune system may explain various conditions of medical impairment in mood disorders, such as Metabolic Syndrome (MetS), obesity, type 2 diabetes mellitus (T2DM) and immune dysregulation. The objective of this study is to comprehensively review the literature regarding the competition between the brain and the immune system for energy substrate. Targeting the energetic regulation of the brain and the immune system and their cross-talk open alternative treatments and a different approach in the study of general medical comorbidities in mood disorders, although more investigation is needed. Copyright © 2016 Elsevier Ltd. All rights reserved.

Compromises Between Quality of Service Metrics and Energy Consumption of Hierarchical and Flat Routing Protocols for Wireless Sensors Network

Directory of Open Access Journals (Sweden)

Abdelbari BEN YAGOUTA

2016-11-01

Full Text Available Wireless Sensor Network (WSN is wireless network composed of spatially distributed and tiny autonomous nodes, which cooperatively monitor physical or environmental conditions. Among the concerns of these networks is prolonging the lifetime by saving nodes energy. There are several protocols specially designed for WSNs based on energy conservation. However, many WSNs applications require QoS (Quality of Service criteria, such as latency, reliability and throughput. In this paper, we will compare three routing protocols for wireless sensors network LEACH (Low Energy Adaptive Clustering Hierarchy, AODV (Ad hoc on demand Distance Vector and LABILE (Link Quality-Based Lexical Routing using Castalia simulator in terms of energy consumption, throughput, reliability and latency time of packets received by sink under different conditions to determinate the best configurations that offers the most suitable compromises between energy conservation and all QoS metrics for each routing protocols. The results show that, the best configurations that offer the suitable compromises between energy conservation and all QoS metrics is a large number of deployed nodes with low packet rate for LEACH (300 nodes and 1 packet/s, a medium number of deployed nodes with low packet rate For AODV (100 nodes and 1 packet/s and a very low nodes density with low packet rate for LABILE (50 nodes and 1 packet/s.

A Lightweight Anonymous Authentication Protocol with Perfect Forward Secrecy for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Ling Xiong

2017-11-01

Full Text Available Due to their frequent use in unattended and hostile deployment environments, the security in wireless sensor networks (WSNs has attracted much interest in the past two decades. However, it remains a challenge to design a lightweight authentication protocol for WSNs because the designers are confronted with a series of desirable security requirements, e.g., user anonymity, perfect forward secrecy, resistance to de-synchronization attack. Recently, the authors presented two authentication schemes that attempt to provide user anonymity and to resist various known attacks. Unfortunately, in this work we shall show that user anonymity of the two schemes is achieved at the price of an impractical search operation—the gateway node may search for every possible value. Besides this defect, they are also prone to smart card loss attacks and have no provision for perfect forward secrecy. As our main contribution, a lightweight anonymous authentication scheme with perfect forward secrecy is designed, and what we believe the most interesting feature is that user anonymity, perfect forward secrecy, and resistance to de-synchronization attack can be achieved at the same time. As far as we know, it is extremely difficult to meet these security features simultaneously only using the lightweight operations, such as symmetric encryption/decryption and hash functions.

A Lightweight Anonymous Authentication Protocol with Perfect Forward Secrecy for Wireless Sensor Networks.

Science.gov (United States)

Xiong, Ling; Peng, Daiyuan; Peng, Tu; Liang, Hongbin; Liu, Zhicai

2017-11-21

Due to their frequent use in unattended and hostile deployment environments, the security in wireless sensor networks (WSNs) has attracted much interest in the past two decades. However, it remains a challenge to design a lightweight authentication protocol for WSNs because the designers are confronted with a series of desirable security requirements, e.g., user anonymity, perfect forward secrecy, resistance to de-synchronization attack. Recently, the authors presented two authentication schemes that attempt to provide user anonymity and to resist various known attacks. Unfortunately, in this work we shall show that user anonymity of the two schemes is achieved at the price of an impractical search operation-the gateway node may search for every possible value. Besides this defect, they are also prone to smart card loss attacks and have no provision for perfect forward secrecy. As our main contribution, a lightweight anonymous authentication scheme with perfect forward secrecy is designed, and what we believe the most interesting feature is that user anonymity, perfect forward secrecy, and resistance to de-synchronization attack can be achieved at the same time. As far as we know, it is extremely difficult to meet these security features simultaneously only using the lightweight operations, such as symmetric encryption/decryption and hash functions.

Service time analysis of secondary packet transmission with opportunistic channel access

KAUST Repository

Usman, Muneer; Yang, Hongchuan; Alouini, Mohamed-Slim

2014-01-01

Cognitive radio transceiver can opportunistically access the underutilized channels of primary systems for new wireless services. The secondary transmission may be interrupted by the primary user's transmission. To facilitate the delay analysis of such secondary packet transmission, we study the resulting extended delivery time for a fixed-size secondary packet that includes both transmission time and waiting time. In particular we derive the exact distribution functions of extended delivery time of secondary transmission for both continuous sensing and periodic sensing cases. Selected numerical results are presented for illustrating the mathematical formulation.

Service time analysis of secondary packet transmission with opportunistic channel access

KAUST Repository

Usman, Muneer

2014-09-01

Cognitive radio transceiver can opportunistically access the underutilized channels of primary systems for new wireless services. The secondary transmission may be interrupted by the primary user\\'s transmission. To facilitate the delay analysis of such secondary packet transmission, we study the resulting extended delivery time for a fixed-size secondary packet that includes both transmission time and waiting time. In particular we derive the exact distribution functions of extended delivery time of secondary transmission for both continuous sensing and periodic sensing cases. Selected numerical results are presented for illustrating the mathematical formulation.

Granting silence to avoid wireless collisions

KAUST Repository

Choi, Jung Il

2010-10-01

We describe grant-to-send, a novel collision avoidance algorithm for wireless mesh networks. Rather than announce packets it intends to send, a node using grant-to-send announces packets it expects to hear others send. We present evidence that inverting collision avoidance in this way greatly improves wireless mesh performance. Evaluating four protocols from 802.11 meshes and 802.15.4 sensor networks, we find that grant-to-send matches or outperforms CSMA and RTS/CTS in all cases. For example, in a 4-hop UDP flow, grantto- send can achieve 96% of the theoretical maximum throughput while maintaining a 99.9% packet delivery ratio. Grant-tosend is also general enough to replace protocol-specific collision avoidance mechanisms common to sensor network protocols. Grant-to-send is simple. For example, incorporating it into 802.11 requires only 11 lines of driver code and no hardware changes. Furthermore, as it reuses existing 802.11 mechanisms, grant-to-send inter-operates with current networks and can be incrementally deployed. © 2010 IEEE.

Granting silence to avoid wireless collisions

KAUST Repository

Choi, Jung Il; Jain, Mayank; Kazandjieva, Maria A.; Levis, Philip

2010-01-01

We describe grant-to-send, a novel collision avoidance algorithm for wireless mesh networks. Rather than announce packets it intends to send, a node using grant-to-send announces packets it expects to hear others send. We present evidence that inverting collision avoidance in this way greatly improves wireless mesh performance. Evaluating four protocols from 802.11 meshes and 802.15.4 sensor networks, we find that grant-to-send matches or outperforms CSMA and RTS/CTS in all cases. For example, in a 4-hop UDP flow, grantto- send can achieve 96% of the theoretical maximum throughput while maintaining a 99.9% packet delivery ratio. Grant-tosend is also general enough to replace protocol-specific collision avoidance mechanisms common to sensor network protocols. Grant-to-send is simple. For example, incorporating it into 802.11 requires only 11 lines of driver code and no hardware changes. Furthermore, as it reuses existing 802.11 mechanisms, grant-to-send inter-operates with current networks and can be incrementally deployed. © 2010 IEEE.

The dynamics of maternal-effect selfish genetic elements.

Science.gov (United States)

Smith, N G

1998-03-21

Maternal-effect selfish genes such as Medea or Scat act to kill progeny that do not bear a copy of the selfish gene present in the mother. Previous models of this system allowed for two types of allele, the selfish (killer) type and the sensitive (susceptible) wild-type. These models predict that the invasion conditions of the selfish allele are quite broad and that if invasion is possible a high frequency equilibrium is to be expected. The selfish element is therefore predicted to persist. Here a hypothetical third allele that neither kills nor is killed (i.e. insensitive) is considered. Such an allele could enter a population by recombination, mutation or migration. The incorporation of this third allele profoundly affects the dynamics of the system and, under some parameter values, it is possible for the spread of the insensitive allele to lead, eventually, to the fixation of the wild-type allele (reversible evolution). This is most likely if the death of progeny provides no direct benefit to the surviving sibs (i.e. in the absence of fitness compensation), as in insects without gregarious broods. Under these circumstances the selfish element cannot spread when infinitely rare, only after having risen to some finite frequency. A fitness cost to bearing the killer allele then causes its loss. However, if fitness compensation is found (e.g. in placental mammals) the invasion of the selfish element from an infinitely low level is possible for a wide range of costs and both stable coexistences of all three alleles and limit cycles of all three are then found. It is therefore to be expected that in mammals selfish maternal-effect genes are more likely both to spread and to persist than in insects, due to their different levels of fitness compensation.

On the fly all-optical packet switching based on hybrid WDM/OCDMA labeling scheme

Science.gov (United States)

Brahmi, Houssem; Giannoulis, Giannis; Menif, Mourad; Katopodis, Vasilis; Kalavrouziotis, Dimitrios; Kouloumentas, Christos; Groumas, Panos; Kanakis, Giannis; Stamatiadis, Christos; Avramopoulos, Hercules; Erasme, Didier

2014-02-01

We introduce a novel design of an all-optical packet routing node that allows for the selection and forwarding of optical packets based on the routing information contained in hybrid wavelength division multiplexing/optical code division multiple access (WDM/OCDMA) labels. A stripping paradigm of optical code-label is adopted. The router is built around an optical-code gate that consists in an optical flip-flop controlled by two fiber Bragg grating correlators and is combined with a Mach-Zehnder interferometer (MZI)-based forwarding gate. We experimentally verify the proof-of-principle operation of the proposed self-routing node under NRZ and OCDMA packet traffic conditions. The successful switching of elastic NRZ payload at 40 Gb/s controlled by DS-OCDMA coded labels and the forwarding operation of encoded data using EQC codes are presented. Proper auto-correlation functions are obtained with higher than 8.1 dB contrast ratio, suitable to efficiently trigger the latching device with a contrast ratio of 11.6 dB and switching times below 3.8 ns. Error-free operation is achieved with 1.5 dB penalty for 40 Gb/s NRZ data and with 2.1 dB penalty for DS-OCDMA packets. The scheme can further be applied to large-scale optical packet switching networks by exploiting efficient optical coders allocated at different WDM channels.

Genealogical evidence for epidemics of selfish genes.

Science.gov (United States)

Ingvarsson, Par K; Taylor, Douglas R

2002-08-20

Some genetic elements spread infectiously in populations by increasing their rate of genetic transmission at the expense of other genes in the genome. These so-called selfish genetic elements comprise a substantial portion of eukaryotic genomes and have long been viewed as a potent evolutionary force. Despite this view, little is known about the evolutionary history of selfish genetic elements in natural populations, or their genetic effects on other portions of the genome. Here we use nuclear and chloroplast gene genealogies in two species of Silene to show the historical pattern of selection on a well known selfish genetic element, cytoplasmic male sterility. We provide evidence that evolution of cytoplasmic male sterility has been characterized by frequent turnovers of mutations in natural populations, thus supporting an epidemic model for the evolution of selfish genes, where new mutations repeatedly arise and rapidly sweep through populations.

Dynamic optical fiber delivery of Ka-band packet transmissions for wireless access networks

DEFF Research Database (Denmark)

Rodríguez Páez, Juan Sebastián; Madsen, Peter; Tafur Monroy, Idelfonso

2017-01-01

A Reconfigurable Radio Access Unit is presented and experimentally demonstrated. In the unit, an optical switching system is set to dynamically deliver different packets to different points in the network. The packets are transmitted wirelesslty on the Ka-band (26–40 GHz), achieving BER values...

A parasitic selfish gene that affects host promiscuity

OpenAIRE

Giraldo-Perez, Paulina; Goddard, Matthew R.

2013-01-01

Selfish genes demonstrate transmission bias and invade sexual populations despite conferring no benefit to their hosts. While the molecular genetics and evolutionary dynamics of selfish genes are reasonably well characterized, their effects on hosts are not. Homing endonuclease genes (HEGs) are one well-studied family of selfish genes that are assumed to be benign. However, we show that carrying HEGs is costly for Saccharomyces cerevisiae, demonstrating that these genetic elements are not nec...

Packets with deadlines a framework for real-time wireless networks

CERN Document Server

Hou, I-Hong

2013-01-01

With the explosive increase in the number of mobile devices and applications, it is anticipated that wireless traffic will increase exponentially in the coming years. Moreover, future wireless networks all carry a wide variety of flows, such as video streaming, online gaming, and VoIP, which have various quality of service (QoS) requirements. Therefore, a new mechanism that can provide satisfactory performance to the complete variety of all kinds of flows, in a coherent and unified framework, is needed.In this book, we introduce a framework for real-time wireless networks. This consists of a m

Assisted suicide of a selfish gene.

Science.gov (United States)

Thomson, M S; Beeman, R W

1999-01-01

Medea (M) factors and the hybrid incompatibility factor (H) are involved in two incompatibility systems in flour beetles that were previously thought to be independent. M factors are a novel class of selfish genes that act by maternal lethality to nonself. The H factor causes the death of hybrids with a paternally derived H gene and previously uncharacterized maternal cofactors. We now find that M factors exhibit their selfish behavior only in the absence of the H factor. Furthermore, we show that the previously uncharacterized maternal cofactors required for H-associated hybrid inviability are identical to M factors. We propose that incompatibility between H strains and M strains is due to suppression by the H factor of the self-rescuing activity of the lethal M genes. This interaction has the effect of converting M elements from selfish into self-destructive or "suicidal" genes. M factors are globally widespread, but are conspicuously absent from India, the only country where the H factor is known to occur. Such a mechanism could prevent the spread of selfish M elements by establishing an absolute barrier to hybridization in the boundary between M and non-M zones.

Selfish Gene Algorithm Vs Genetic Algorithm: A Review

Science.gov (United States)

Ariff, Norharyati Md; Khalid, Noor Elaiza Abdul; Hashim, Rathiah; Noor, Noorhayati Mohamed

2016-11-01

Evolutionary algorithm is one of the algorithms inspired by the nature. Within little more than a decade hundreds of papers have reported successful applications of EAs. In this paper, the Selfish Gene Algorithms (SFGA), as one of the latest evolutionary algorithms (EAs) inspired from the Selfish Gene Theory which is an interpretation of Darwinian Theory ideas from the biologist Richards Dawkins on 1989. In this paper, following a brief introduction to the Selfish Gene Algorithm (SFGA), the chronology of its evolution is presented. It is the purpose of this paper is to present an overview of the concepts of Selfish Gene Algorithm (SFGA) as well as its opportunities and challenges. Accordingly, the history, step involves in the algorithm are discussed and its different applications together with an analysis of these applications are evaluated.

Wireless Internet

NARCIS (Netherlands)

el Zarki, M.; Heijenk, Geert; Lee, Kenneth S.; Bidgoli, H.

This chapter addresses the topic of wireless Internet, the extension of the wireline Internet architecture to the wireless domain. As such the chapter introduces the reader to the dominant characteristics of the Internet, from its structure to the protocols that control the forwarding of data and

A Wireless LAN and Voice Information System for Underground Coal Mine

Directory of Open Access Journals (Sweden)

Yu Zhang

2014-06-01

Full Text Available In this paper we constructed a wireless information system, and developed a wireless voice communication subsystem based on Wireless Local Area Networks (WLAN for underground coal mine, which employs Voice over IP (VoIP technology and Session Initiation Protocol (SIP to achieve wireless voice dispatching communications. The master control voice dispatching interface and call terminal software are also developed on the WLAN ground server side to manage and implement the voice dispatching communication. A testing system for voice communication was constructed in tunnels of an underground coal mine, which was used to actually test the wireless voice communication subsystem via a network analysis tool, named Clear Sight Analyzer. In tests, the actual flow charts of registration, call establishment and call removal were analyzed by capturing call signaling of SIP terminals, and the key performance indicators were evaluated in coal mine, including average subjective value of voice quality, packet loss rate, delay jitter, disorder packet transmission and end-to- end delay. Experimental results and analysis demonstrate that the wireless voice communication subsystem developed communicates well in underground coal mine environment, achieving the designed function of voice dispatching communication.

The Design of Wireless Data Acquisition and Remote Transmission Interface in Micro-seismic Signals

Directory of Open Access Journals (Sweden)

Huan-Huan BIAN

2014-02-01

Full Text Available The micro-seismic signal acquisition and transmission is an important key part in geological prospecting. This paper describes a bran-new solution of micro-seismic signal acquisition and remote transmission using Zigbee technique and wireless data transmission technique. The hardware such as front-end data acquisition interface made up by Zigbee wireless networking technique, remote data transmission solution composed of general packet radio service (or GPRS for short technique and interface between Zigbee and GPRS is designed in detail. Meanwhile the corresponding software of the system is given out. The solution solves the numerous practical problems nagged by complex and terrible environment faced using micro-seismic prospecting. The experimental results demonstrate that the method using Zigbee wireless network communication technique GPRS wireless packet switching technique is efficient, reliable and flexible.

Selfish cells in altruistic cell society - a theoretical oncology.

Science.gov (United States)

Chigira, M

1993-09-01

In multicellular organisms, internal evolution of individual cells is strictly forbidden and 'evolutional' DNA replication should be performed only by the sexual reproduction system. Wholistic negative control system called 'homeostasis' serves all service to germ line cells. All somatic cells are altruistic to the germ line cells. However, in malignant tumors, it seems that individual cells replicate and behave 'selfishly' and evolve against the internal microenvironment. Tumor cells only express the occult selfishness which is programmed in normal cells a priori. This phenomenon is based on the failure of identical DNA replication, and results in 'autonomy' and 'anomie' of cellular society as shown in tumor cells. Genetic programs of normal cells connote this cellular autonomy and anomie introduced by the deletion of regulators on structure genes. It is rather paradoxical that the somatic cells get their freedom from wholistic negative regulation programmed internally. However, this is not a true paradox, since multicellular organisms have clearly been evolved from 'monads' in which cells proliferate without wholistic regulation. Somatic cells revolt against germ cell DNA, called 'selfish replicator' by Dawkins. It is an inevitable destiny that the 'selfishness' coded in genome should be revenged by itself. Selfish replicator in germ cell line should be revolted by its selfishness in the expansion of somatic cells, since they have an orthogenesis to get more selfishness in order to increase their genome. Tumor heterogeneity and progression can be fully explained by this self-contradictory process which produces heterogeneous gene copies different from the original clone in the tumor, although 'selfish' gene replication is the final target of being. Furthermore, we have to discard the concept of clonality of tumor cells since genetic instability is a fundamental feature of tumors. Finally, tumor cells and proto-oncogenes can be considered as the ultimate parasite

Modeling Multistandard Wireless Networks in OPNET

DEFF Research Database (Denmark)

Zakrzewska, Anna; Berger, Michael Stübert; Ruepp, Sarah Renée

2011-01-01

Future wireless communication is emerging towards one heterogeneous platform. In this new environment wireless access will be provided by multiple radio technologies that are cooperating and complementing one another. The paper investigates the possibilities of developing such a multistandard sys...... system using OPNET Modeler. A network model consisting of LTE interworking with WLAN and WiMAX is considered from the radio resource management perspective. In particular, implementing a joint packet scheduler across multiple systems is discussed more in detail....

Ripples in Communication : Reconfigurable and Adaptive Wireless Communication Systems based on Wavelet Packet Modulators

NARCIS (Netherlands)

Lakshmanan, M.K.

2011-01-01

Wavelet Packet Modulation (WPM) is a multi-carrier transmission technique that uses orthogonal wavelet packet bases to combine a collection of information bits into a single composite signal. This system can be considered as a viable alternative, for wide-band communication, to the popular

Simultaneous Wireless Information and Power Transfer for Decode-and-Forward MIMO Relay Communication Systems

KAUST Repository

Benkhelifa, Fatma

2015-05-01

In this paper, we investigate the simultaneous wireless information and power transfer (SWIPT) for a decode-and-forward (DF) multiple-input multiple-output (MIMO) relay system where the relay is an energy harvesting node. We consider the ideal scenario where both the energy harvesting (EH) receiver and information decoding (ID) receiver at the relay have access to the whole received signal and its energy. The relay harvests the energy while receiving the signal from the source and uses the harvested power to forward the signal to the destination. We obtain the optimal precoders at the source and the relay to maximize the achievable throughput rate of the overall link. In the numerical results, the effect of the transmit power at the source and the position of the relay between the source and the destination on the maximum achievable rate are investigated. © 2015 IEEE.

Game Theory for Wireless Sensor Networks: A Survey

Science.gov (United States)

Shi, Hai-Yan; Wang, Wan-Liang; Kwok, Ngai-Ming; Chen, Sheng-Yong

2012-01-01

Game theory (GT) is a mathematical method that describes the phenomenon of conflict and cooperation between intelligent rational decision-makers. In particular, the theory has been proven very useful in the design of wireless sensor networks (WSNs). This article surveys the recent developments and findings of GT, its applications in WSNs, and provides the community a general view of this vibrant research area. We first introduce the typical formulation of GT in the WSN application domain. The roles of GT are described that include routing protocol design, topology control, power control and energy saving, packet forwarding, data collection, spectrum allocation, bandwidth allocation, quality of service control, coverage optimization, WSN security, and other sensor management tasks. Then, three variations of game theory are described, namely, the cooperative, non-cooperative, and repeated schemes. Finally, existing problems and future trends are identified for researchers and engineers in the field. PMID:23012533

Game Theory for Wireless Sensor Networks: A Survey

Directory of Open Access Journals (Sweden)

Ngai-Ming Kwok

2012-07-01

Full Text Available Game theory (GT is a mathematical method that describes the phenomenon of conflict and cooperation between intelligent rational decision-makers. In particular, the theory has been proven very useful in the design of wireless sensor networks (WSNs. This article surveys the recent developments and findings of GT, its applications in WSNs, and provides the community a general view of this vibrant research area. We first introduce the typical formulation of GT in the WSN application domain. The roles of GT are described that include routing protocol design, topology control, power control and energy saving, packet forwarding, data collection, spectrum allocation, bandwidth allocation, quality of service control, coverage optimization, WSN security, and other sensor management tasks. Then, three variations of game theory are described, namely, the cooperative, non-cooperative, and repeated schemes. Finally, existing problems and future trends are identified for researchers and engineers in the field.

How Much Longer before It All Works: What Online Searchers Should Know about Wireless Data Communications.

Science.gov (United States)

Bell, Steven J.

1994-01-01

Profiles the major wireless data communications (WDC) systems, provides an overview of how they work, and compares their communication features. Topics addressed include the market for wireless data; applications for WDC; wireless online searching; cellular data communication; packet radio; digital cellular; criteria for evaluating WDC systems;…

A Low-Jitter Wireless Transmission Based on Buffer Management in Coding-Aware Routing

Directory of Open Access Journals (Sweden)

Cunbo Lu

2015-08-01

Full Text Available It is significant to reduce packet jitter for real-time applications in a wireless network. Existing coding-aware routing algorithms use the opportunistic network coding (ONC scheme in a packet coding algorithm. The ONC scheme never delays packets to wait for the arrival of a future coding opportunity. The loss of some potential coding opportunities may degrade the contribution of network coding to jitter performance. In addition, most of the existing coding-aware routing algorithms assume that all flows participating in the network have equal rate. This is unrealistic, since multi-rate environments often appear. To overcome the above problem and expand coding-aware routing to multi-rate scenarios, from the view of data transmission, we present a low-jitter wireless transmission algorithm based on buffer management (BLJCAR, which decides packets in coding node according to the queue-length based threshold policy instead of the regular ONC policy as used in existing coding-aware routing algorithms. BLJCAR is a unified framework to merge the single rate case and multiple rate case. Simulations results show that the BLJCAR algorithm embedded in coding-aware routing outperforms the traditional ONC policy in terms of jitter, packet delivery delay, packet loss ratio and network throughput in network congestion in any traffic rates.

MAC layer power management schemes for efficient energy- delay tradeoffs in wireless local area networks

OpenAIRE

Sarkar, Mahasweta

2006-01-01

In order to minimize power consumption and thereby prolong the system lifetime of battery powered wireless devices, it makes sense for such devices to transit to a very low power "Sleep" state when they are not communicating with their peers. However the main challenge of the sleep mechanism lies in the wireless nodes inability to "wake up" as soon as a packet arrives for it during its sleep state. This leads to an obvious tradeoff between power saving and packet delay. In this dissertation w...

Simultaneous Wireless Power Transfer and Secure Multicasting in Cooperative Decode-and-Forward Relay Networks.

Science.gov (United States)

Lee, Jong-Ho; Sohn, Illsoo; Kim, Yong-Hwa

2017-05-16

In this paper, we investigate simultaneous wireless power transfer and secure multicasting via cooperative decode-and-forward (DF) relays in the presence of multiple energy receivers and eavesdroppers. Two scenarios are considered under a total power budget: maximizing the minimum harvested energy among the energy receivers under a multicast secrecy rate constraint; and maximizing the multicast secrecy rate under a minimum harvested energy constraint. For both scenarios, we solve the transmit power allocation and relay beamformer design problems by using semidefinite relaxation and bisection technique. We present numerical results to analyze the energy harvesting and secure multicasting performances in cooperative DF relay networks.

Bidirectional QoS support for novelty detection applications based on hierarchical wireless sensor network model

Science.gov (United States)

Edwards, Mark; Hu, Fei; Kumar, Sunil

2004-10-01

events, the most important QoS parameters should include sensing data packet transmission reliability, lifetime extension degree from sensor sleeping control, event detection latency, congestion reduction level through removal of redundant sensing data. In this paper, we will focus on the following bi-directional QoS topics: (1) Downstream (sink-to-sensor) QoS: Reliable data query command forwarding to particular sensor(s). In other words, we do not want to lose the query command packets; (2) Upstream (sensor-to-sink) QoS: transmission of sensed data with priority control. The more interested data that can help in novelty detection should be transmitted on an optimal path with higher reliability. We propose the use of Differentiated Data Collection. Due to the large-scale nature and resource constraints of typical wireless sensor networks, such as limited energy, small memory (typically RAM short communication range, the above problems become even more challenging. Besides QoS support issue, we will also describe our low-energy Sensing Data Transmission network Architecture. Our research results show the scalability and energy-efficiency of our proposed WSN QoS schemes.

Fault Tolerant Mechanism for Multimedia Flows in Wireless Ad Hoc Networks Based on Fast Switching Paths

Directory of Open Access Journals (Sweden)

Juan R. Diaz

2014-01-01

Full Text Available Multimedia traffic can be forwarded through a wireless ad hoc network using the available resources of the nodes. Several models and protocols have been designed in order to organize and arrange the nodes to improve transmissions along the network. We use a cluster-based framework, called MWAHCA architecture, which optimizes multimedia transmissions over a wireless ad hoc network. It was proposed by us in a previous research work. This architecture is focused on decreasing quality of service (QoS parameters like latency, jitter, and packet loss, but other network features were not developed, like load balance or fault tolerance. In this paper, we propose a new fault tolerance mechanism, using as a base the MWAHCA architecture, in order to recover any multimedia flow crossing the wireless ad hoc network when there is a node failure. The algorithm can run independently for each multimedia flow. The main objective is to keep the QoS parameters as low as possible. To achieve this goal, the convergence time must be controlled and reduced. This paper provides the designed protocol, the analytical model of the algorithm, and a software application developed to test its performance in a real laboratory.

Energy-Efficient Broadcasting Scheme for Smart Industrial Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Zhuangbin Chen

2017-01-01

Full Text Available In smart Industrial Wireless Sensor Networks (IWSNs, sensor nodes usually adopt a programmable technology. These smart devices can obtain new or special functions by reprogramming: they upgrade their soft systems through receiving new version of program codes. If sensor nodes need to be upgraded, the sink node will propagate program code packets to them through “one-to-many” broadcasting, and therefore new capabilities can be obtained, forming the so-called Software Defined Network (SDN. However, due to the high volume of code packet, the constraint energy of sensor node, and the unreliable link quality of wireless network, rapidly broadcasting the code packets to all nodes in network can be a challenge issue. In this paper, a novel Energy-efficient Broadcast scheme with adjustable broadcasting radius is proposed aiming to improve the performance of network upgrade. In our scheme, the nonhotspots sensor nodes take full advantage of their residual energy caused in data collection period to improve the packet reception probability and reduce the broadcasting delay of code packet transmission by enlarging the broadcasting radius, that is, the transmitting power. The theoretical analyses and experimental results show that, compared with previous work, our approach can averagely reduce the Network Upgrade Delay (NUD by 14.8%–45.2% and simultaneously increase the reliability without harming the lifetime of network.

Novel scheme for efficient and cost-effective forwarding of packets in optical networks without header modification

DEFF Research Database (Denmark)

Wessing, Henrik; Fjelde, Tina; Christiansen, Henrik Lehrmann

2001-01-01

We present a novel scheme for addressing the outputs in optical packet switches and demonstrate its good scalability. The scheme requires neither header modification nor distribution of routing information to the packet switches, thus reducing optical component count while simplifying network...

Stochastic petri nets for wireless networks

CERN Document Server

Lei, Lei; Zhong, Zhangdui

2015-01-01

This SpringerBrief presents research in the application of Stochastic Petri Nets (SPN) to the performance evaluation of wireless networks under bursty traffic. It covers typical Quality-of-Service performance metrics such as mean throughput, average delay and packet dropping probability. Along with an introduction of SPN basics, the authors introduce the key motivation and challenges of using SPN to analyze the resource sharing performance in wireless networks. The authors explain two powerful modeling techniques that treat the well-known state space explosion problem: model decomposition and

Intelligent Stale-Frame Discards for Real-Time Video Streaming over Wireless Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Sheu Tsang-Ling

2009-01-01

Full Text Available Abstract This paper presents intelligent early packet discards (I-EPD for real-time video streaming over a multihop wireless ad hoc network. In a multihop wireless ad hoc network, the quality of transferring real-time video streams could be seriously degraded, since every intermediate node (IN functionally like relay device does not possess large buffer and sufficient bandwidth. Even worse, a selected relay node could leave or power off unexpectedly, which breaks the route to destination. Thus, a stale video frame is useless even if it can reach destination after network traffic becomes smooth or failed route is reconfigured. In the proposed I-EPD, an IN can intelligently determine whether a buffered video packet should be early discarded. For the purpose of validation, we implement the I-EPD on Linux-based embedded systems. Via the comparisons of performance metrics (packet/frame discards ratios, PSNR, etc., we demonstrate that video quality over a wireless ad hoc network can be substantially improved and unnecessary bandwidth wastage is greatly reduced.

I-MAC: an incorporation MAC for wireless sensor networks

Science.gov (United States)

Zhao, Jumin; Li, Yikun; Li, Dengao; Lin, Xiaojie

2017-11-01

This paper proposes an innovative MAC protocol called I-MAC. Protocol for wireless sensor networks, which combines the advantages of collision tolerance and collision cancellation. The protocol increases the number of antenna in wireless sensor nodes. The purpose is to monitor the occurrence of packet collisions by increasing the number of antenna in real time. The built-in identity structure is used in the frame structure in order to help the sending node to identify the location of the receiving node after a data packet collision is detected. Packets can be recovered from where the conflict occurred. In this way, we can monitor the conflict for a fixed period of time. It can improve the channel utilisation through changing the transmission probability of collision nodes and solve the problem of hidden terminal through collision feedback mechanism. We have evaluated our protocol. Our results show that the throughput of I-MAC is 5 percentage points higher than that of carrier sense multiple access/collision notification. The network utilisation of I-MAC is more than 92%.

Service Time Analysis for Secondary Packet Transmission with Adaptive Modulation

KAUST Repository

Wang, Wen-Jing; Usman, Muneer; Yang, Hong-Chuan; Alouini, Mohamed-Slim

2017-01-01

Cognitive radio communications can opportunistically access underutilized spectrum for emerging wireless applications. With interweave cognitive implementation, secondary user transmits only if primary user does not occupy the channel and waits for transmission otherwise. Therefore, secondary packet transmission involves both transmission time and waiting time. The resulting extended delivery time (EDT) is critical to the throughput analysis of secondary system. In this paper, we study the EDT of secondary packet transmission with adaptive modulation under interweave implementation to facilitate the delay and throughput analysis of such cognitive radio system. In particular, we propose an analytical framework to derive the probability density functions of EDT considering random-length transmission and waiting slots. We also present selected numerical results to illustrate the mathematical formulations and to verify our analytical approach.

Service Time Analysis for Secondary Packet Transmission with Adaptive Modulation

KAUST Repository

Wang, Wen-Jing

2017-05-12

Cognitive radio communications can opportunistically access underutilized spectrum for emerging wireless applications. With interweave cognitive implementation, secondary user transmits only if primary user does not occupy the channel and waits for transmission otherwise. Therefore, secondary packet transmission involves both transmission time and waiting time. The resulting extended delivery time (EDT) is critical to the throughput analysis of secondary system. In this paper, we study the EDT of secondary packet transmission with adaptive modulation under interweave implementation to facilitate the delay and throughput analysis of such cognitive radio system. In particular, we propose an analytical framework to derive the probability density functions of EDT considering random-length transmission and waiting slots. We also present selected numerical results to illustrate the mathematical formulations and to verify our analytical approach.

Towards Controlling Latency in Wireless Networks

KAUST Repository

Bouacida, Nader

2017-04-24

Wireless networks are undergoing an unprecedented revolution in the last decade. With the explosion of delay-sensitive applications in the Internet (i.e., online gaming and VoIP), latency becomes a major issue for the development of wireless technology. Taking advantage of the significant decline in memory prices, industrialists equip the network devices with larger buffering capacities to improve the network throughput by limiting packets drops. Over-buffering results in increasing the time that packets spend in the queues and, thus, introducing more latency in networks. This phenomenon is known as “bufferbloat”. While throughput is the dominant performance metric, latency also has a huge impact on user experience not only for real-time applications but also for common applications like web browsing, which is sensitive to latencies in order of hundreds of milliseconds. Concerns have arisen about designing sophisticated queue management schemes to mitigate the effects of such phenomenon. My thesis research aims to solve bufferbloat problem in both traditional half-duplex and cutting-edge full-duplex wireless systems by reducing delay while maximizing wireless links utilization and fairness. Our work shed lights on buffer management algorithms behavior in wireless networks and their ability to reduce latency resulting from excessive queuing delays inside oversized static network buffers without a significant loss in other network metrics. First of all, we address the problem of buffer management in wireless full-duplex networks by using Wireless Queue Management (WQM), which is an active queue management technique for wireless networks. Our solution is based on Relay Full-Duplex MAC (RFD-MAC), an asynchronous media access control protocol designed for relay full-duplexing. Compared to the default case, our solution reduces the end-to-end delay by two orders of magnitude while achieving similar throughput in most of the cases. In the second part of this thesis

Trail-Based Search for Efficient Event Report to Mobile Actors in Wireless Sensor and Actor Networks.

Science.gov (United States)

Xu, Zhezhuang; Liu, Guanglun; Yan, Haotian; Cheng, Bin; Lin, Feilong

2017-10-27

In wireless sensor and actor networks, when an event is detected, the sensor node needs to transmit an event report to inform the actor. Since the actor moves in the network to execute missions, its location is always unavailable to the sensor nodes. A popular solution is the search strategy that can forward the data to a node without its location information. However, most existing works have not considered the mobility of the node, and thus generate significant energy consumption or transmission delay. In this paper, we propose the trail-based search (TS) strategy that takes advantage of actor's mobility to improve the search efficiency. The main idea of TS is that, when the actor moves in the network, it can leave its trail composed of continuous footprints. The search packet with the event report is transmitted in the network to search the actor or its footprints. Once an effective footprint is discovered, the packet will be forwarded along the trail until it is received by the actor. Moreover, we derive the condition to guarantee the trail connectivity, and propose the redundancy reduction scheme based on TS (TS-R) to reduce nontrivial transmission redundancy that is generated by the trail. The theoretical and numerical analysis is provided to prove the efficiency of TS. Compared with the well-known expanding ring search (ERS), TS significantly reduces the energy consumption and search delay.

Wireless Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Hong-Chuan Yang

2007-01-01

Full Text Available We study the energy-efficient configuration of multihop paths with automatic repeat request (ARQ mechanism in wireless ad hoc networks. We adopt a cross-layer design approach and take both the quality of each radio hop and the battery capacity of each transmitting node into consideration. Under certain constraints on the maximum tolerable transmission delay and the required packet delivery ratio, we solve optimization problems to jointly schedule the transmitting power of each transmitting node and the retransmission limit over each hop. Numerical results demonstrate that the path configuration methods can either significantly reduce the average energy consumption per packet delivery or considerably extend the average lifetime of the multihop route.

Stability-Aware Geographic Routing in Energy Harvesting Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Tran Dinh Hieu

2016-05-01

Full Text Available A new generation of wireless sensor networks that harvest energy from environmental sources such as solar, vibration, and thermoelectric to power sensor nodes is emerging to solve the problem of energy limitation. Based on the photo-voltaic model, this research proposes a stability-aware geographic routing for reliable data transmissions in energy-harvesting wireless sensor networks (EH-WSNs to provide a reliable routes selection method and potentially achieve an unlimited network lifetime. Specifically, the influences of link quality, represented by the estimated packet reception rate, on network performance is investigated. Simulation results show that the proposed method outperforms an energy-harvesting-aware method in terms of energy consumption, the average number of hops, and the packet delivery ratio.

Wireless communications networks for the smart grid

CERN Document Server

Ho, Quang-Dung; Rajalingham, Gowdemy; Le-Ngoc, Tho

2014-01-01

This brief presents a comprehensive review of the network architecture and communication technologies of the smart grid communication network (SGCN). It then studies the strengths, weaknesses and applications of two promising wireless mesh routing protocols that could be used to implement the SGCN. Packet transmission reliability, latency and robustness of these two protocols are evaluated and compared by simulations in various practical SGCN scenarios. Finally, technical challenges and open research opportunities of the SGCN are addressed. Wireless Communications Networks for Smart Grid provi

Adaptive Modulation and Coding for LTE Wireless Communication

Science.gov (United States)

Hadi, S. S.; Tiong, T. C.

2015-04-01

Long Term Evolution (LTE) is the new upgrade path for carrier with both GSM/UMTS networks and CDMA2000 networks. The LTE is targeting to become the first global mobile phone standard regardless of the different LTE frequencies and bands use in other countries barrier. Adaptive Modulation and Coding (AMC) is used to increase the network capacity or downlink data rates. Various modulation types are discussed such as Quadrature Phase Shift Keying (QPSK), Quadrature Amplitude Modulation (QAM). Spatial multiplexing techniques for 4×4 MIMO antenna configuration is studied. With channel station information feedback from the mobile receiver to the base station transmitter, adaptive modulation and coding can be applied to adapt to the mobile wireless channels condition to increase spectral efficiencies without increasing bit error rate in noisy channels. In High-Speed Downlink Packet Access (HSDPA) in Universal Mobile Telecommunications System (UMTS), AMC can be used to choose modulation types and forward error correction (FEC) coding rate.

Cognitive LF-Ant: A Novel Protocol for Healthcare Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Marcelo Alencar

2012-08-01

Full Text Available In this paper, the authors present the Cognitive LF-Ant protocol for emergency reporting in healthcare wireless sensor networks. The protocol is inspired by the natural behaviour of ants and a cognitive component provides the capabilities to dynamically allocate resources, in accordance with the emergency degree of each patient. The intra-cluster emergency reporting is inspired by the different capabilities of leg-manipulated ants. The inter-cluster reporting is aided by the cooperative modulation diversity with spectrum sensing, which can detect new emergency reporting requests and forward them. Simulations results show the decrease of average delay time as the probability of opportunistic access increases, which privileges the emergency reporting related to the patients with higher priority of resources’ usage. Furthermore, the packet loss rate is decreased by the use of cooperative modulation diversity with spectrum sensing.

Totally opportunistic routing algorithm (TORA) for underwater wireless sensor network

Science.gov (United States)

Hashim, Fazirulhisyam; Rasid, Mohd Fadlee A.; Othman, Mohamed

2018-01-01

Underwater Wireless Sensor Network (UWSN) has emerged as promising networking techniques to monitor and explore oceans. Research on acoustic communication has been conducted for decades, but had focused mostly on issues related to physical layer such as high latency, low bandwidth, and high bit error. However, data gathering process is still severely limited in UWSN due to channel impairment. One way to improve data collection in UWSN is the design of routing protocol. Opportunistic Routing (OR) is an emerging technique that has the ability to improve the performance of wireless network, notably acoustic network. In this paper, we propose an anycast, geographical and totally opportunistic routing algorithm for UWSN, called TORA. Our proposed scheme is designed to avoid horizontal transmission, reduce end to end delay, overcome the problem of void nodes and maximize throughput and energy efficiency. We use TOA (Time of Arrival) and range based equation to localize nodes recursively within a network. Once nodes are localized, their location coordinates and residual energy are used as a matrix to select the best available forwarder. All data packets may or may not be acknowledged based on the status of sender and receiver. Thus, the number of acknowledgments for a particular data packet may vary from zero to 2-hop. Extensive simulations were performed to evaluate the performance of the proposed scheme for high network traffic load under very sparse and very dense network scenarios. Simulation results show that TORA significantly improves the network performance when compared to some relevant existing routing protocols, such as VBF, HHVBF, VAPR, and H2DAB, for energy consumption, packet delivery ratio, average end-to-end delay, average hop-count and propagation deviation factor. TORA reduces energy consumption by an average of 35% of VBF, 40% of HH-VBF, 15% of VAPR, and 29% of H2DAB, whereas the packet delivery ratio has been improved by an average of 43% of VBF, 26

Totally opportunistic routing algorithm (TORA) for underwater wireless sensor network.

Science.gov (United States)

Rahman, Ziaur; Hashim, Fazirulhisyam; Rasid, Mohd Fadlee A; Othman, Mohamed

2018-01-01

Underwater Wireless Sensor Network (UWSN) has emerged as promising networking techniques to monitor and explore oceans. Research on acoustic communication has been conducted for decades, but had focused mostly on issues related to physical layer such as high latency, low bandwidth, and high bit error. However, data gathering process is still severely limited in UWSN due to channel impairment. One way to improve data collection in UWSN is the design of routing protocol. Opportunistic Routing (OR) is an emerging technique that has the ability to improve the performance of wireless network, notably acoustic network. In this paper, we propose an anycast, geographical and totally opportunistic routing algorithm for UWSN, called TORA. Our proposed scheme is designed to avoid horizontal transmission, reduce end to end delay, overcome the problem of void nodes and maximize throughput and energy efficiency. We use TOA (Time of Arrival) and range based equation to localize nodes recursively within a network. Once nodes are localized, their location coordinates and residual energy are used as a matrix to select the best available forwarder. All data packets may or may not be acknowledged based on the status of sender and receiver. Thus, the number of acknowledgments for a particular data packet may vary from zero to 2-hop. Extensive simulations were performed to evaluate the performance of the proposed scheme for high network traffic load under very sparse and very dense network scenarios. Simulation results show that TORA significantly improves the network performance when compared to some relevant existing routing protocols, such as VBF, HHVBF, VAPR, and H2DAB, for energy consumption, packet delivery ratio, average end-to-end delay, average hop-count and propagation deviation factor. TORA reduces energy consumption by an average of 35% of VBF, 40% of HH-VBF, 15% of VAPR, and 29% of H2DAB, whereas the packet delivery ratio has been improved by an average of 43% of VBF, 26

Simultaneous Wireless Power Transfer and Secure Multicasting in Cooperative Decode-and-Forward Relay Networks

Science.gov (United States)

Lee, Jong-Ho; Sohn, Illsoo; Kim, Yong-Hwa

2017-01-01

In this paper, we investigate simultaneous wireless power transfer and secure multicasting via cooperative decode-and-forward (DF) relays in the presence of multiple energy receivers and eavesdroppers. Two scenarios are considered under a total power budget: maximizing the minimum harvested energy among the energy receivers under a multicast secrecy rate constraint; and maximizing the multicast secrecy rate under a minimum harvested energy constraint. For both scenarios, we solve the transmit power allocation and relay beamformer design problems by using semidefinite relaxation and bisection technique. We present numerical results to analyze the energy harvesting and secure multicasting performances in cooperative DF relay networks. PMID:28509841

Simultaneous Wireless Power Transfer and Secure Multicasting in Cooperative Decode-and-Forward Relay Networks

Directory of Open Access Journals (Sweden)

Jong-Ho Lee

2017-05-01

Full Text Available In this paper, we investigate simultaneous wireless power transfer and secure multicasting via cooperative decode-and-forward (DF relays in the presence of multiple energy receivers and eavesdroppers. Two scenarios are considered under a total power budget: maximizing the minimum harvested energy among the energy receivers under a multicast secrecy rate constraint; and maximizing the multicast secrecy rate under a minimum harvested energy constraint. For both scenarios, we solve the transmit power allocation and relay beamformer design problems by using semidefinite relaxation and bisection technique. We present numerical results to analyze the energy harvesting and secure multicasting performances in cooperative DF relay networks.

Genealogical evidence for epidemics of selfish genes

OpenAIRE

Ingvarsson, Pär K.; Taylor, Douglas R.

2002-01-01

Some genetic elements spread infectiously in populations by increasing their rate of genetic transmission at the expense of other genes in the genome. These so-called selfish genetic elements comprise a substantial portion of eukaryotic genomes and have long been viewed as a potent evolutionary force. Despite this view, little is known about the evolutionary history of selfish genetic elements in natural populations, or their genetic effects on other portions of the genome. Here we use nuclea...

Multicasting in Wireless Communications (Ad-Hoc Networks): Comparison against a Tree-Based Approach

Science.gov (United States)

Rizos, G. E.; Vasiliadis, D. C.

2007-12-01

We examine on-demand multicasting in ad hoc networks. The Core Assisted Mesh Protocol (CAMP) is a well-known protocol for multicast routing in ad-hoc networks, generalizing the notion of core-based trees employed for internet multicasting into multicast meshes that have much richer connectivity than trees. On the other hand, wireless tree-based multicast routing protocols use much simpler structures for determining route paths, using only parent-child relationships. In this work, we compare the performance of the CAMP protocol against the performance of wireless tree-based multicast routing protocols, in terms of two important factors, namely packet delay and ratio of dropped packets.

The wireless networking system of Earthquake precursor mobile field observation

Science.gov (United States)

Wang, C.; Teng, Y.; Wang, X.; Fan, X.; Wang, X.

2012-12-01

The mobile field observation network could be real-time, reliably record and transmit large amounts of data, strengthen the physical signal observations in specific regions and specific period, it can improve the monitoring capacity and abnormal tracking capability. According to the features of scatter everywhere, a large number of current earthquake precursor observation measuring points, networking technology is based on wireless broadband accessing McWILL system, the communication system of earthquake precursor mobile field observation would real-time, reliably transmit large amounts of data to the monitoring center from measuring points through the connection about equipment and wireless accessing system, broadband wireless access system and precursor mobile observation management center system, thereby implementing remote instrument monitoring and data transmition. At present, the earthquake precursor field mobile observation network technology has been applied to fluxgate magnetometer array geomagnetic observations of Tianzhu, Xichang,and Xinjiang, it can be real-time monitoring the working status of the observational instruments of large area laid after the last two or three years, large scale field operation. Therefore, it can get geomagnetic field data of the local refinement regions and provide high-quality observational data for impending earthquake tracking forecast. Although, wireless networking technology is very suitable for mobile field observation with the features of simple, flexible networking etc, it also has the phenomenon of packet loss etc when transmitting a large number of observational data due to the wireless relatively weak signal and narrow bandwidth. In view of high sampling rate instruments, this project uses data compression and effectively solves the problem of data transmission packet loss; Control commands, status data and observational data transmission use different priorities and means, which control the packet loss rate within

Measurements on wireless transmission of ECG signals

International Nuclear Information System (INIS)

Gabrielli, A.; Lax, I.

2016-01-01

The scope of this research is to design an electronic prototype, an operative system as a proof of concept, to transmit and receive biological parameters, in particular electrocardiogram signals, through dedicated wireless circuits. The apparatus features microelectronics chips that were developed for more general biomedical applications, here adapted to deal with cardiac signals. The paper mainly focuses on the electronic aspects, as in this study we do not face medical or clinical aspects of the system. The transmitter circuit uses a commercial instrumentation amplifier and the receiver has been equipped with wide-band amplifiers along with made-in-the-lab band-pass filters centered at the carrier. We have been able to mount the entire system prototype into a preliminary data acquisition chain that reads out the electrocardiogram signal. The prototype allows acquiring the waveform, converting it to a digital pattern and open the transmission through a series of high-frequency packets exploiting the Ultra Wide Band protocol. The sensor value is embedded in the transmission through the rate of the digital packets. In fact, these are sent wireless at a specific packet-frequency that depends on the sensor amplitude and are detected into a receiver circuit that recovers the information.

Measurements on wireless transmission of ECG signals

Science.gov (United States)

Gabrielli, A.; Lax, I.

2016-12-01

The scope of this research is to design an electronic prototype, an operative system as a proof of concept, to transmit and receive biological parameters, in particular electrocardiogram signals, through dedicated wireless circuits. The apparatus features microelectronics chips that were developed for more general biomedical applications, here adapted to deal with cardiac signals. The paper mainly focuses on the electronic aspects, as in this study we do not face medical or clinical aspects of the system. The transmitter circuit uses a commercial instrumentation amplifier and the receiver has been equipped with wide-band amplifiers along with made-in-the-lab band-pass filters centered at the carrier. We have been able to mount the entire system prototype into a preliminary data acquisition chain that reads out the electrocardiogram signal. The prototype allows acquiring the waveform, converting it to a digital pattern and open the transmission through a series of high-frequency packets exploiting the Ultra Wide Band protocol. The sensor value is embedded in the transmission through the rate of the digital packets. In fact, these are sent wireless at a specific packet-frequency that depends on the sensor amplitude and are detected into a receiver circuit that recovers the information.

Self-Management of Hybrid Optical and Packet Switching Networks

NARCIS (Netherlands)

Fioreze, Tiago; Pras, Aiko

Hybrid optical and packet switching networks enable data to be forwarded at multiple levels. Large IP flows at the IP level may be therefore moved to the optical level bypassing the per hop routing decisions of the IP level. Such move could be beneficial since congested IP networks could be

Self-Management of Hybrid Optical and Packet Switching Networks

NARCIS (Netherlands)

Fioreze, Tiago

2010-01-01

Hybrid optical and packet switching networks are composed of multi-service hybrid devices that enable forwarding of data at multiple levels. Large IP flows at the IP level may be therefore moved to the optical level bypassing therefore the per hop routing decisions of the IP level. Such move could

Evolution of discrimination in populations at equilibrium between selfishness and altruism.

Science.gov (United States)

Sibly, Richard M; Curnow, Robert N

2012-11-21

Where there is genetically based variation in selfishness and altruism, as in man, altruists with an innate ability to recognise and thereby only help their altruistic relatives may evolve. Here we use diploid population genetic models to chart the evolution of genetically-based discrimination in populations initially in stable equilibrium between altruism and selfishness. The initial stable equilibria occur because help is assumed subject to diminishing returns. Similar results were obtained whether we used a model with two independently inherited loci, one controlling altruism the other discrimination, or a one locus model with three alleles. The latter is the opposite extreme to the first model, and can be thought of as involving complete linkage between two loci on the same chromosome. The introduction of discrimination reduced the benefits obtained by selfish individuals, more so as the number of discriminators increased, and selfishness was eventually eliminated in some cases. In others selfishness persisted and the evolutionary outcome was a stable equilibrium involving selfish individuals and both discriminating and non-discriminating altruists. Heritable variation in selfishness, altruism and discrimination is predicted to be particularly evident among full sibs. The suggested coexistence of these three genetic dispositions could explain widespread interest within human social groups as to who will and who will not help others. These predictions merit experimental and observational investigation by primatologists, anthropologists and psychologists. Copyright © 2012 Elsevier Ltd. All rights reserved.

A Mixed Transmission Strategy to Achieve Energy Balancing in Wireless Sensor Networks

DEFF Research Database (Denmark)

Liu, Tong; Gu, Tao; Jin, Ning

2017-01-01

In this paper, we investigate the problem of energy balanced data collection in wireless sensor networks, aiming to balance energy consumption among all sensor nodes during the data propagation process. Energy balanced data collection can potentially save energy consumption and prolong network...... lifetime, and hence, it has many practical implications for sensor network design and deployment. The traditional hop-by-hop transmission model allows a sensor node to propagate its packets in a hop-by-hop manner toward the sink, resulting in poor energy balancing for the entire network. To address...... the problem, we apply a slice-based energy model, and divide the problem into inter-slice and intra-slice energy balancing problems. We then propose a probability-based strategy named inter-slice mixed transmission protocol and an intra-slice forwarding technique to address each of the problems. We propose...

Network Coding Opportunities for Wireless Grids Formed by Mobile Devices

DEFF Research Database (Denmark)

Nielsen, Karsten Fyhn; Madsen, Tatiana Kozlova; Fitzek, Frank

2008-01-01

Wireless grids have potential in sharing communication, computational and storage resources making these networks more powerful, more robust, and less cost intensive. However, to enjoy the benefits of cooperative resource sharing, a number of issues should be addressed and the cost of the wireless...... link should be taken into account. We focus on the question how nodes can efficiently communicate and distribute data in a wireless grid. We show the potential of a network coding approach when nodes have the possibility to combine packets thus increasing the amount of information per transmission. Our...... implementation demonstrates the feasibility of network coding for wireless grids formed by mobile devices....

Evidence against the selfish operon theory.

Science.gov (United States)

Pál, Csaba; Hurst, Laurence D

2004-06-01

According to the selfish operon hypothesis, the clustering of genes and their subsequent organization into operons is beneficial for the constituent genes because it enables the horizontal gene transfer of weakly selected, functionally coupled genes. The majority of these are expected to be non-essential genes. From our analysis of the Escherichia coli genome, we conclude that the selfish operon hypothesis is unlikely to provide a general explanation for clustering nor can it account for the gene composition of operons. Contrary to expectations, essential genes with related functions have an especially strong tendency to cluster, even if they are not in operons. Moreover, essential genes are particularly abundant in operons.

Application of Game Theory Approaches in Routing Protocols for Wireless Networks

Science.gov (United States)

Javidi, Mohammad M.; Aliahmadipour, Laya

2011-09-01

An important and essential issue for wireless networks is routing protocol design that is a major technical challenge due to the function of the network. Game theory is a powerful mathematical tool that analyzes the strategic interactions among multiple decision makers and the results of researches show that applied game theory in routing protocol lead to improvement the network performance through reduce overhead and motivates selfish nodes to collaborate in the network. This paper presents a review and comparison for typical representatives of routing protocols designed that applied game theory approaches for various wireless networks such as ad hoc networks, mobile ad hoc networks and sensor networks that all of them lead to improve the network performance.

Physical-Layer Design for Next-Generation Cellular Wireless Systems

NARCIS (Netherlands)

Foschini, Gerard J.; Huang, Howard C.; Mullender, Sape J.; Venkatesan, Sivarama; Viswanathan, Harish

The conventional cellular architecture will remain an integral part of nextgeneration wireless systems, providing high-speed packet data services directly to mobile users and also backhaul service for local area networks. In this paper, we present several proposals addressing the challenges

REAL TIME ANALYSIS OF WIRELESS CONTROLLER AREA NETWORK

Directory of Open Access Journals (Sweden)

Gerardine Immaculate Mary

2014-09-01

Full Text Available It is widely known that Control Area Networks (CAN are used in real-time, distributed and parallel processing which cover manufacture plants, humanoid robots, networking fields, etc., In applications where wireless conditions are encountered it is convenient to continue the exchange of CAN frames within the Wireless CAN (WCAN. The WCAN considered in this research is based on wireless token ring protocol (WTRP; a MAC protocol for wireless networks to reduce the number of retransmissions due to collision and the wired counterpart CAN attribute on message based communication. WCAN uses token frame method to provide channel access to the nodes in the system. This method allow all the nodes to share common broadcast channel by taken turns in transmitting upon receiving the token frame which is circulating within the network for specified amount of time. This method provides high throughput in bounded latency environment, consistent and predictable delays and good packet delivery ratio. The most important factor to consider when evaluating a control network is the end-to-end time delay between sensors, controllers, and actuators. The correct operation of a control system depends on the timeliness of the data coming over the network, and thus, a control network should be able to guarantee message delivery within a bounded transmission time. The proposed WCAN is modeled and simulated using QualNet, and its average end to end delay and packet delivery ratio (PDR are calculated. The parameters boundaries of WCAN are evaluated to guarantee a maximum throughput and a minimum latency time, in the case of wireless communications, precisely WCAN.

OCP: Opportunistic Carrier Prediction for Wireless Networks

Science.gov (United States)

2008-08-01

Many protocols have been proposed for medium access control in wireless networks. MACA [13], MACAW [3], and FAMA [8] are the earlier proposals for...world performance of carrier sense. In Proceedings of ACM SIGCOMM E-WIND Workshop, 2005. [13] P. Karn. MACA : A new channel access method for packet radio

CONGESTION CONTROL IMPROVED QoS ROUTING SCHEME FOR WIRELESS SENSOR NETWORK

OpenAIRE

A. Elakkiya*, B. Santhana Krishnan, Dr. M. Ramaswamy

2016-01-01

Wireless sensor network is distributed self-governing sensors used to monitor the physical conditions of the environment. They are constructed by nodes where each of them is connected to sensors. These sensor nodes acquire real time information and transmit the information. When large number of sensor nodes are active in transmitting the information there is a possibility of congestion in the data packets. Congestion occurs due to buffer overflow, channel contention, packet collision, reporti...

Cross-layer designed adaptive modulation algorithm with packet combining and truncated ARQ over MIMO Nakagami fading channels

KAUST Repository

Aniba, Ghassane

2011-04-01

This paper presents an optimal adaptive modulation (AM) algorithm designed using a cross-layer approach which combines truncated automatic repeat request (ARQ) protocol and packet combining. Transmissions are performed over multiple-input multiple-output (MIMO) Nakagami fading channels, and retransmitted packets are not necessarily modulated using the same modulation format as in the initial transmission. Compared to traditional approach, cross-layer design based on the coupling across the physical and link layers, has proven to yield better performance in wireless communications. However, there is a lack for the performance analysis and evaluation of such design when the ARQ protocol is used in conjunction with packet combining. Indeed, previous works addressed the link layer performance of AM with truncated ARQ but without packet combining. In addition, previously proposed AM algorithms are not optimal and can provide poor performance when packet combining is implemented. Herein, we first show that the packet loss rate (PLR) resulting from the combining of packets modulated with different constellations can be well approximated by an exponential function. This model is then used in the design of an optimal AM algorithm for systems employing packet combining, truncated ARQ and MIMO antenna configurations, considering transmission over Nakagami fading channels. Numerical results are provided for operation with or without packet combining, and show the enhanced performance and efficiency of the proposed algorithm in comparison with existing ones. © 2011 IEEE.

Self-Learning Power Control in Wireless Sensor Networks.

Science.gov (United States)

Chincoli, Michele; Liotta, Antonio

2018-01-27

Current trends in interconnecting myriad smart objects to monetize on Internet of Things applications have led to high-density communications in wireless sensor networks. This aggravates the already over-congested unlicensed radio bands, calling for new mechanisms to improve spectrum management and energy efficiency, such as transmission power control. Existing protocols are based on simplistic heuristics that often approach interference problems (i.e., packet loss, delay and energy waste) by increasing power, leading to detrimental results. The scope of this work is to investigate how machine learning may be used to bring wireless nodes to the lowest possible transmission power level and, in turn, to respect the quality requirements of the overall network. Lowering transmission power has benefits in terms of both energy consumption and interference. We propose a protocol of transmission power control through a reinforcement learning process that we have set in a multi-agent system. The agents are independent learners using the same exploration strategy and reward structure, leading to an overall cooperative network. The simulation results show that the system converges to an equilibrium where each node transmits at the minimum power while respecting high packet reception ratio constraints. Consequently, the system benefits from low energy consumption and packet delay.

Threshold-Based Relay Selection for Detect-and-Forward Relaying in Cooperative Wireless Networks

Directory of Open Access Journals (Sweden)

Fan Yijia

2010-01-01

Full Text Available This paper studies two-hop cooperative demodulate-and-forward relaying using multiple relays in wireless networks. A threshold based relay selection scheme is considered, in which the reliable relays are determined by comparing source-relay SNR to a threshold, and one of the reliable relays is selected by the destination based on relay-destination SNR. The exact bit error rate of this scheme is derived, and a simple threshold function is proposed. It is shown that the network achieves full diversity order ( under the proposed threshold, where is the number of relays in the network. Unlike some other full diversity achieving protocols in the literature, the requirement that the instantaneous/average SNRs of the source-relay links be known at the destination is eliminated using the appropriate SNR threshold.

Simultaneous Wireless Information and Power Transfer for MIMO Amplify-and-Forward Relay Systems

KAUST Repository

Benkhelifa, Fatma; Alouini, Mohamed-Slim

2016-01-01

In this paper, we investigate the simultaneous wireless information and power transfer (SWIPT) for the two-hop Multiple-Input Multiple-Output (MIMO) Amplify-and-Forward (AF) relay communication systems with the multiantenna energy harvesting relay. We derive the optimal source and relay covariance matrices to characterize the achievable region between the sourcedestination rate and the harvested energy at the relay, namely Rate-Energy (R-E) region. In this context, we consider the ideal scenario where the energy harvester (EH) receiver and the information decoder (ID) receiver at the relay can simultaneously decode the information and harvest the energy at the relay. Then, we consider more practical schemes which are the power splitting (PS) and the time switching (TS) which separate the EH and ID transfer over the power domain and the time domain, respectively.

Simultaneous Wireless Information and Power Transfer for MIMO Amplify-and-Forward Relay Systems

KAUST Repository

Benkhelifa, Fatma

2016-01-06

In this paper, we investigate the simultaneous wireless information and power transfer (SWIPT) for the two-hop Multiple-Input Multiple-Output (MIMO) Amplify-and-Forward (AF) relay communication systems with the multiantenna energy harvesting relay. We derive the optimal source and relay covariance matrices to characterize the achievable region between the sourcedestination rate and the harvested energy at the relay, namely Rate-Energy (R-E) region. In this context, we consider the ideal scenario where the energy harvester (EH) receiver and the information decoder (ID) receiver at the relay can simultaneously decode the information and harvest the energy at the relay. Then, we consider more practical schemes which are the power splitting (PS) and the time switching (TS) which separate the EH and ID transfer over the power domain and the time domain, respectively.

BTP: a Block Transfer Protocol for Delay Tolerant Wireless Sensor Networks

DEFF Research Database (Denmark)

Hansen, Morten Tranberg; Biagioni, Edoardo S.

2010-01-01

Wireless sensor networks that are energy-constrained must transmit and receive data as efficiently as possible.  If the transmission is delay tolerant, transferring blocks of accumulated data can be more efficient than transferring each sensed measurement as soon as it is available.  This paper...... proposes a Block Transfer Protocol (BTP) designed for efficient and reliable transmission in wireless sensor networks.  BTP reduces the time it takes to reliably transfer a block of packets compared to conventional link layer protocols, by piggybacking in data packets information about the transfer......, minimizing the number of acknowledgements needed for reliable transmission, and reducing the need for timeouts, which can substantially slow down communication when transmission is unreliable.  In addition, BTP improves reliability by handling false positive acknowledgements and by letting the receivers...

Impact of wireless communication on multimedia application performance

Science.gov (United States)

Brown, Kevin A.

1999-01-01

Multimedia applications and specifically voice and video conferencing tools are widely used in business communications, and are quickly being discovered by the consumer market as well. At the same time, wireless communication services such as PCS voice and cellular data are becoming very popular, leading to the desire to deploy multimedia applications in the wireless environment. Wireless links, however, exhibit several characteristics which are different from traditional wired networks. These include: dynamically changing bandwidth due to mobile host movement in and out of cell where bandwidth is shared, high rates of packet corruption and subsequent loss, and frequent are lengthy disconnections due to obstacles, fading, and movement between cells. In addition, these effects are short-lived and difficult to reproduce, leading to a lack of adequate testing and analysis for applications used in wireless environments.

Real-time network traffic classification technique for wireless local area networks based on compressed sensing

Science.gov (United States)

Balouchestani, Mohammadreza

2017-05-01

Network traffic or data traffic in a Wireless Local Area Network (WLAN) is the amount of network packets moving across a wireless network from each wireless node to another wireless node, which provide the load of sampling in a wireless network. WLAN's Network traffic is the main component for network traffic measurement, network traffic control and simulation. Traffic classification technique is an essential tool for improving the Quality of Service (QoS) in different wireless networks in the complex applications such as local area networks, wireless local area networks, wireless personal area networks, wireless metropolitan area networks, and wide area networks. Network traffic classification is also an essential component in the products for QoS control in different wireless network systems and applications. Classifying network traffic in a WLAN allows to see what kinds of traffic we have in each part of the network, organize the various kinds of network traffic in each path into different classes in each path, and generate network traffic matrix in order to Identify and organize network traffic which is an important key for improving the QoS feature. To achieve effective network traffic classification, Real-time Network Traffic Classification (RNTC) algorithm for WLANs based on Compressed Sensing (CS) is presented in this paper. The fundamental goal of this algorithm is to solve difficult wireless network management problems. The proposed architecture allows reducing False Detection Rate (FDR) to 25% and Packet Delay (PD) to 15 %. The proposed architecture is also increased 10 % accuracy of wireless transmission, which provides a good background for establishing high quality wireless local area networks.

Graceful degradation of CACC performance subject to unreliable wireless communication

NARCIS (Netherlands)

Ploeg, J.; Semsar-Kazerooni, E.; Lijster, G.; Wouw, N. van de; Nijmeijer, H.

2013-01-01

Cooperative Adaptive Cruise Control (CACC) employs wireless intervehicle communication, in addition to onboard sensors, to obtain string-stable vehicle-following behavior at small intervehicle distances. As a consequence, however, CACC is vulnerable to communication impairments such as packet loss,

Transmission Delay Based Control over Networks with Wireless Links

Institute of Scientific and Technical Information of China (English)

无

2002-01-01

To achieve the mobility of computers during communication, the TCP connections between fixed host and mobile host may often traverse wired and wireless networks, and the recovery of losses due to wireless transmission error is much different from congestion control. The paper analyzes the side effect of RTT estimation while making the TCP source to handle congestion and wireless error losses properly. Then present a strategy using information feedback by the last hop acknowledgement and monitoring the queuing level of the wired bottleneck link by calculating the changes in transmission delay along the path. With the identification of the early stage of congestion, it can respond to wired congestion quickly while keeping wireless link more reliable, and make TCP react to the different packets losses more appropriately.

Wireless Channel Modeling Perspectives for Ultra-Reliable Communications

DEFF Research Database (Denmark)

Eggers, Patrick Claus F.; Popovski, Petar

2018-01-01

Ultra-Reliable Communication (URC) is one of the distinctive features of the upcoming 5G wireless communication. The level of reliability, going down to packet error rates (PER) of $10^{-9}$, should be sufficiently convincing in order to remove cables in an industrial setting or provide remote co...

A NEW PREDICTIVE MODEL FOR CONGESTION CONTROL IN WIRELESS SENSOR NETWORKS

Directory of Open Access Journals (Sweden)

NAJME TANZADE PANAH

2017-06-01

Full Text Available With the increase of various applications in the domain of wireless sensor networks, the tendency to use wireless sensors has gradually increased in different applications. On the other hand, diverse traffic with different priorities generated by these sensors requires providing adaptive quality of services based on users` needs. In this paper, a congestion control predictor model is proposed for wireless sensor networks, which considers parameters like network energy consumption, packet loss rate and percentage of delivered high and medium priority packets to the destination. This method consists of congestion prevention, congestion control, and energy control plans using shortest path selection algorithm. In the congestion prevention plan, congestion is prevented by investigating the queues length. In the congestion control plan, the congestion is controlled by reducing the transmission rate. Finally, the energy control plan aims to partially balance the energy of nodes to prevent network failures due to node energy outage. Simulation results indicated that the proposed method has a higher efficiency regarding the aforementioned parameters. In addition, comparisons with other well-known methods showed the effectiveness of the proposed method.

Power Control and Coding Formulation for State Estimation with Wireless Sensors

DEFF Research Database (Denmark)

Quevedo, Daniel; Østergaard, Jan; Ahlen, Anders

2014-01-01

efficient communication. In this paper, we examine the role of power control and coding for Kalman filtering over wireless correlated channels. Two estimation architectures are considered; initially, the sensors send their measurements directly to a single gateway (GW). Next, wireless relay nodes provide...... additional links. The GW decides on the coding scheme and the transmitter power levels of the wireless nodes. The decision process is carried out online and adapts to varying channel conditions to improve the tradeoff between state estimation accuracy and energy expenditure. In combination with predictive......Technological advances made wireless sensors cheap and reliable enough to be brought into industrial use. A major challenge arises from the fact that wireless channels introduce random packet dropouts. Power control and coding are key enabling technologies in wireless communications to ensure...

Trail-Based Search for Efficient Event Report to Mobile Actors in Wireless Sensor and Actor Networks †

Science.gov (United States)

Xu, Zhezhuang; Liu, Guanglun; Yan, Haotian; Cheng, Bin; Lin, Feilong

2017-01-01

In wireless sensor and actor networks, when an event is detected, the sensor node needs to transmit an event report to inform the actor. Since the actor moves in the network to execute missions, its location is always unavailable to the sensor nodes. A popular solution is the search strategy that can forward the data to a node without its location information. However, most existing works have not considered the mobility of the node, and thus generate significant energy consumption or transmission delay. In this paper, we propose the trail-based search (TS) strategy that takes advantage of actor’s mobility to improve the search efficiency. The main idea of TS is that, when the actor moves in the network, it can leave its trail composed of continuous footprints. The search packet with the event report is transmitted in the network to search the actor or its footprints. Once an effective footprint is discovered, the packet will be forwarded along the trail until it is received by the actor. Moreover, we derive the condition to guarantee the trail connectivity, and propose the redundancy reduction scheme based on TS (TS-R) to reduce nontrivial transmission redundancy that is generated by the trail. The theoretical and numerical analysis is provided to prove the efficiency of TS. Compared with the well-known expanding ring search (ERS), TS significantly reduces the energy consumption and search delay. PMID:29077017

Fast-forward scaling theory for phase imprinting on a BEC: creation of a wave packet with uniform momentum density and loading to Bloch states without disturbance

Science.gov (United States)

Masuda, Shumpei; Nakamura, Katsuhiro; Nakahara, Mikio

2018-02-01

We study phase imprinting on Bose-Einstein condensates (BECs) with the fast-forward scaling theory revealing a nontrivial scaling property in quantum dynamics. We introduce a wave packet with uniform momentum density (WPUM) which has peculiar properties but is short-lived. The fast-forward scaling theory is applied to derive the driving potential for creation of the WPUMs in a predetermined time. Fast manipulation is essential for the creation of WPUMs because of the instability of the state. We also study loading of a BEC into a predetermined Bloch state in the lowest band from the ground state of a periodic potential. Controlled linear potential is not sufficient for creation of the Bloch state with large wavenumber because the change in the amplitude of the order parameter is not negligible. We derive the exact driving potential for creation of predetermined Bloch states using the obtained theory.

Buffer Sizing in Wireless Networks: Challenges, Solutions, and Opportunities

KAUST Repository

Showail, Ahmad

2016-04-01

Buffer sizing is an important network configuration parameter that impacts the Quality of Service (QoS) characteristics of data traffic. With falling memory costs and the fallacy that \\'more is better\\', network devices are being overprovisioned with large bu ers. This may increase queueing delays experienced by a packet and subsequently impact stability of core protocols such as TCP. The problem has been studied extensively for wired networks. However, there is little work addressing the unique challenges of wireless environment such as time-varying channel capacity, variable packet inter-service time, and packet aggregation, among others. In this paper we discuss these challenges, classify the current state-of-the-art solutions, discuss their limitations, and provide directions for future research in the area.

The short-term effects of antenna insulation thickness on path losses in wireless telemetry implants at microwave frequencies

Directory of Open Access Journals (Sweden)

Lukas Kneisz

2013-07-01

Full Text Available Various physiological parameters can be monitored non-invasively using wireless biotelemetry links. The development of sophisticated ultra low power consuming transceivers allows the transmission of large amounts of data from the inside of the body to an external receiver in real time at microwave frequencies.Antenna impedance matching is crucial for obtaining an acceptable propagation link budget in a wireless telemetry link. The dielectric properties of biological tissue induce detuning to transceiver antennas when implanted into the body. To counteract detuning problems, implant antennas are coated with biocompatible insulating material. The study investigates the propagation losses of a wireless communication link at different insulation thicknesses of medical grade silicone in the Industrial-Scientific-Medical (ISM radio band at 2.45 GHz. The wireless link consisted of an implantable unit which was placed between two pads of tissue substitute material and an external receiver which was connected to a laptop. Predefined data packets were transmitted from the implant, the received packets were analyzed, packet errors and packet losses were logged and the received signal strength indicator values (RSSI were recorded. Our results showed that the mean RSSI values of insulated transmitter antennas - embedded in tissue equivalent material - provide more safety distance to critical receiver sensitivity level than uncoated antennas.The conducted measurements let us conclude that with increasing thickness of the insulation layer, the antenna becomes less sensitive to detuning by adjacent tissue substitute material. Therefore tuned antennas are less influenced by the surrounding tissue after implantation.

Content-Adaptive Packetization and Streaming of Wavelet Video over IP Networks

Directory of Open Access Journals (Sweden)

Chien-Peng Ho

2007-03-01

Full Text Available This paper presents a framework of content-adaptive packetization scheme for streaming of 3D wavelet-based video content over lossy IP networks. The tradeoff between rate and distortion is controlled by jointly adapting scalable source coding rate and level of forward error correction (FEC protection. A content dependent packetization mechanism with data-interleaving and Reed-Solomon protection for wavelet-based video codecs is proposed to provide unequal error protection. This paper also tries to answer an important question for scalable video streaming systems: given extra bandwidth, should one increase the level of channel protection for the most important packets, or transmit more scalable source data? Experimental results show that the proposed framework achieves good balance between quality of the received video and level of error protection under bandwidth-varying lossy IP networks.

Voice over IP in Wireless Heterogeneous Networks

DEFF Research Database (Denmark)

Fathi, Hanane; Chakraborty, Shyam; Prasad, Ramjee

with the deployment of wireless heterogeneous systems, both speech and data traffic are carrried over wireless links by the same IP-based packet-switched infrastructure. However, this combination faces some challenges due to the inherent properties of the wireless network. The requirements for good quality VoIP...... communications are difficult to achieve in a time-varying environment due to channel errors and traffic congestion and across different systems. The provision of VoIP in wireless heterogeneous networks requires a set of time-efficient control mechanisms to support a VoIP session with acceptable quality....... The focus of Voice over IP in Wierless Heterogeneous Networks is on mechanisms that affect the VoIP user satisfaction  while not explicitly involved in the media session. This relates to the extra delays introduced by the security and the signaling protocols used to set up an authorized VoIP session...

Development of synthetic selfish elements based on modular nucleases in Drosophila melanogaster

OpenAIRE

Simoni, A; Siniscalchi, C; Chan, Y-S; Huen, DS; Russell, S; Windbichler, N; Crisanti, A

2014-01-01

Selfish genes are DNA elements that increase their rate of genetic transmission at the expense of other genes in the genome and can therefore quickly spread within a population. It has been suggested that selfish elements could be exploited to modify the genome of entire populations for medical and ecological applications. Here we report that transcription activator-like effector nuclease (TALEN) and zinc finger nuclease (ZFN) can be engineered into site-specific synthetic selfish elements (S...

Human-Centric Wireless Communication Networks

OpenAIRE

Cavallari, Riccardo

2016-01-01

This thesis covers two main topics: the design and performance evaluation of Wireless Body Area Networks (WBANs), and the simulation and mathematical modeling of Delay Tolerant Networks (DTNs). Different Medium Access Control (MAC) protocols for WBANs are implemented on dedicated hardware in order to evaluate, through extensive measurement campaigns, the performance of the network in terms of packet loss rate, delay and energy consumption. Novel solutions to cope with bo...

Whether and Where to Code in the Wireless Relay Channel

DEFF Research Database (Denmark)

Shi, Xiaomeng; Médard, Muriel; Roetter, Daniel Enrique Lucani

2013-01-01

The throughput benefits of random linear network codes have been studied extensively for wirelined and wireless erasure networks. It is often assumed that all nodes within a network perform coding operations. In energy-constrained systems, however, coding subgraphs should be chosen to control...... the number of coding nodes while maintaining throughput. In this paper, we explore the strategic use of network coding in the wireless packet erasure relay channel according to both throughput and energy metrics. In the relay channel, a single source communicates to a single sink through the aid of a half......-duplex relay. The fluid flow model is used to describe the case where both the source and the relay are coding, and Markov chain models are proposed to describe packet evolution if only the source or only the relay is coding. In addition to transmission energy, we take into account coding and reception...

A formal theory of the selfish gene.

Science.gov (United States)

Gardner, A; Welch, J J

2011-08-01

Adaptation is conventionally regarded as occurring at the level of the individual organism. In contrast, the theory of the selfish gene proposes that it is more correct to view adaptation as occurring at the level of the gene. This view has received much popular attention, yet has enjoyed only limited uptake in the primary research literature. Indeed, the idea of ascribing goals and strategies to genes has been highly controversial. Here, we develop a formal theory of the selfish gene, using optimization theory to capture the analogy of 'gene as fitness-maximizing agent' in mathematical terms. We provide formal justification for this view of adaptation by deriving mathematical correspondences that translate the optimization formalism into dynamical population genetics. We show that in the context of social interactions between genes, it is the gene's inclusive fitness that provides the appropriate maximand. Hence, genic selection can drive the evolution of altruistic genes. Finally, we use the formalism to assess the various criticisms that have been levelled at the theory of the selfish gene, dispelling some and strengthening others. © 2011 The Authors. Journal of Evolutionary Biology © 2011 European Society For Evolutionary Biology.

Game Theory Meets Wireless Sensor Networks Security Requirements and Threats Mitigation: A Survey.

Science.gov (United States)

Abdalzaher, Mohamed S; Seddik, Karim; Elsabrouty, Maha; Muta, Osamu; Furukawa, Hiroshi; Abdel-Rahman, Adel

2016-06-29

We present a study of using game theory for protecting wireless sensor networks (WSNs) from selfish behavior or malicious nodes. Due to scalability, low complexity and disseminated nature of WSNs, malicious attacks can be modeled effectively using game theory. In this study, we survey the different game-theoretic defense strategies for WSNs. We present a taxonomy of the game theory approaches based on the nature of the attack, whether it is caused by an external attacker or it is the result of an internal node acting selfishly or maliciously. We also present a general trust model using game theory for decision making. We, finally, identify the significant role of evolutionary games for WSNs security against intelligent attacks; then, we list several prospect applications of game theory to enhance the data trustworthiness and node cooperation in different WSNs.

Game Theory Meets Wireless Sensor Networks Security Requirements and Threats Mitigation: A Survey

Directory of Open Access Journals (Sweden)

Mohamed S. Abdalzaher

2016-06-01

Full Text Available We present a study of using game theory for protecting wireless sensor networks (WSNs from selfish behavior or malicious nodes. Due to scalability, low complexity and disseminated nature of WSNs, malicious attacks can be modeled effectively using game theory. In this study, we survey the different game-theoretic defense strategies for WSNs. We present a taxonomy of the game theory approaches based on the nature of the attack, whether it is caused by an external attacker or it is the result of an internal node acting selfishly or maliciously. We also present a general trust model using game theory for decision making. We, finally, identify the significant role of evolutionary games for WSNs security against intelligent attacks; then, we list several prospect applications of game theory to enhance the data trustworthiness and node cooperation in different WSNs.

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

Science.gov (United States)

Bai, Weigang; Wang, Haiyan; He, Ke; Zhao, Ruiqin

2018-04-23

The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS) and position random candidates selection (PRCS). PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay.

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

Directory of Open Access Journals (Sweden)

Weigang Bai

2018-04-01

Full Text Available The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS and position random candidates selection (PRCS. PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay.

Altruistic functions for selfish DNA.

Science.gov (United States)

Faulkner, Geoffrey J; Carninci, Piero

2009-09-15

Mammalian genomes are comprised of 30-50% transposed elements (TEs). The vast majority of these TEs are truncated and mutated fragments of retrotransposons that are no longer capable of transposition. Although initially regarded as important factors in the evolution of gene regulatory networks, TEs are now commonly perceived as neutrally evolving and non-functional genomic elements. In a major development, recent works have strongly contradicted this "selfish DNA" or "junk DNA" dogma by demonstrating that TEs use a host of novel promoters to generate RNA on a massive scale across most eukaryotic cells. This transcription frequently functions to control the expression of protein-coding genes via alternative promoters, cis regulatory non protein-coding RNAs and the formation of double stranded short RNAs. If considered in sum, these findings challenge the designation of TEs as selfish and neutrally evolving genomic elements. Here, we will expand upon these themes and discuss challenges in establishing novel TE functions in vivo.

Ayn Rand: To be Selfish or Not to be Selfish--That is the Question

Science.gov (United States)

Doctor, Tyrus L.; Kritsonis, William Allan

2009-01-01

Ayn Rand's "The Virtue of Selfishness" (1961) is comprised of a philosophy that defies the entire premise of what our education system is and shall be built upon. The "Objectivist" perspective has depicted a clear distinction between the "Have's" and the "Have Not's" or the Bourgeoisie and Proletariat. The "Objectivist" perspective believes that…

MAC-layer protocol for TCP fairness in Wireless Mesh Networks

KAUST Repository

Nawab, Faisal

2012-08-01

In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wireless Mesh Networks (WMNs). We use a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput performance due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically determine the throughput. Based on the developed model, we propose a distributed MAC protocol to alleviate the unfairness problem in WMNs. Our protocol uses the age of packet as a priority metric for packet scheduling. Simulation is conducted to validate our model and to illustrate the fairness characteristics of our proposed MAC protocol. We conclude that we can achieve fairness with only little impact on network capacity.

Two Tier Cluster Based Data Aggregation (TTCDA) in Wireless Sensor Network

DEFF Research Database (Denmark)

Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

2012-01-01

Wireless Sensor Network (WSN) often used for monitoring and control applications where sensor nodes collect data and send it to the sink. Most of the nodes consume their energy in transmission of data packets without aggregation to sink, which may be located at single or multi hop distance....... The direct transmission of data packets to the sink from nodes in the network causes increased communication costs in terms of energy, average delay and network lifetime. In this context, the data aggregation techniques minimize the communication cost with efficient bandwidth utilization by decreasing...... the packet count reached at the sink. Here, we propose Two Tier Cluster based Data Aggregation (TTCDA) algorithm for the randomly distributed nodes to minimize computation and communication cost. The TTCDA is energy and bandwidth efficient since it reduces the transmission of the number of packets...

PHACK: An Efficient Scheme for Selective Forwarding Attack Detection in WSNs

Directory of Open Access Journals (Sweden)

Anfeng Liu

2015-12-01

Full Text Available In this paper, a Per-Hop Acknowledgement (PHACK-based scheme is proposed for each packet transmission to detect selective forwarding attacks. In our scheme, the sink and each node along the forwarding path generate an acknowledgement (ACK message for each received packet to confirm the normal packet transmission. The scheme, in which each ACK is returned to the source node along a different routing path, can significantly increase the resilience against attacks because it prevents an attacker from compromising nodes in the return routing path, which can otherwise interrupt the return of nodes’ ACK packets. For this case, the PHACK scheme also has better potential to detect abnormal packet loss and identify suspect nodes as well as better resilience against attacks. Another pivotal issue is the network lifetime of the PHACK scheme, as it generates more acknowledgements than previous ACK-based schemes. We demonstrate that the network lifetime of the PHACK scheme is not lower than that of other ACK-based schemes because the scheme just increases the energy consumption in non-hotspot areas and does not increase the energy consumption in hotspot areas. Moreover, the PHACK scheme greatly simplifies the protocol and is easy to implement. Both theoretical and simulation results are given to demonstrate the effectiveness of the proposed scheme in terms of high detection probability and the ability to identify suspect nodes.

A maternal-effect selfish genetic element in Caenorhabditis elegans.

Science.gov (United States)

Ben-David, Eyal; Burga, Alejandro; Kruglyak, Leonid

2017-06-09

Selfish genetic elements spread in natural populations and have an important role in genome evolution. We discovered a selfish element causing embryonic lethality in crosses between wild strains of the nematode Caenorhabditis elegans The element is made up of sup-35 , a maternal-effect toxin that kills developing embryos, and pha-1 , its zygotically expressed antidote. pha-1 has long been considered essential for pharynx development on the basis of its mutant phenotype, but this phenotype arises from a loss of suppression of sup-35 toxicity. Inactive copies of the sup-35/pha-1 element show high sequence divergence from active copies, and phylogenetic reconstruction suggests that they represent ancestral stages in the evolution of the element. Our results suggest that other essential genes identified by genetic screens may turn out to be components of selfish elements. Copyright © 2017, American Association for the Advancement of Science.

Fine-Grained Rate Shaping for Video Streaming over Wireless Networks

Directory of Open Access Journals (Sweden)

Chen Tsuhan

2004-01-01

Full Text Available Video streaming over wireless networks faces challenges of time-varying packet loss rate and fluctuating bandwidth. In this paper, we focus on streaming precoded video that is both source and channel coded. Dynamic rate shaping has been proposed to “shape” the precompressed video to adapt to the fluctuating bandwidth. In our earlier work, rate shaping was extended to shape the channel coded precompressed video, and to take into account the time-varying packet loss rate as well as the fluctuating bandwidth of the wireless networks. However, prior work on rate shaping can only adjust the rate oarsely. In this paper, we propose “fine-grained rate shaping (FGRS” to allow for bandwidth adaptation over a wide range of bandwidth and packet loss rate in fine granularities. The video is precoded with fine granularity scalability (FGS followed by channel coding. Utilizing the fine granularity property of FGS and channel coding, FGRS selectively drops part of the precoded video and still yields decodable bit-stream at the decoder. Moreover, FGRS optimizes video streaming rather than achieves heuristic objectives as conventional methods. A two-stage rate-distortion (RD optimization algorithm is proposed for FGRS. Promising results of FGRS are shown.

Selfishness and Cooperation: Challenge for Social Life

Directory of Open Access Journals (Sweden)

Szocik Konrad

2017-07-01

Full Text Available Cooperation is a great challenge for natural selection. Some scholars assume that cooperation could not evolve within the framework of natural selection. It is undeniable that natural selection, at least at the individual level, favors selfishness and defectors. Nonetheless, this selfish tendency does not necessarily imply that cooperation could not evolve by means of natural selection. In this paper, we specifically acknowledge certain basic challenges for the evolution of the human ability to cooperate at the level of large groups. In this paper, we discuss topics like the human ability for “supercooperation,” the importance of repetition and reputation, and Multilevel Selection Theory as the basic mechanisms of evolution of cooperation.

A NEURAL NETWORK BASED TRAFFIC-AWARE FORWARDING STRATEGY IN NAMED DATA NETWORKING

Directory of Open Access Journals (Sweden)

Parisa Bazmi

2016-11-01

Full Text Available Named Data Networking (NDN is a new Internet architecture which has been proposed to eliminate TCP/IP Internet architecture restrictions. This architecture is abstracting away the notion of host and working based on naming datagrams. However, one of the major challenges of NDN is supporting QoS-aware forwarding strategy so as to forward Interest packets intelligently over multiple paths based on the current network condition. In this paper, Neural Network (NN Based Traffic-aware Forwarding strategy (NNTF is introduced in order to determine an optimal path for Interest forwarding. NN is embedded in NDN routers to select next hop dynamically based on the path overload probability achieved from the NN. This solution is characterized by load balancing and QoS-awareness via monitoring the available path and forwarding data on the traffic-aware shortest path. The performance of NNTF is evaluated using ndnSIM which shows the efficiency of this scheme in terms of network QoS improvementof17.5% and 72% reduction in network delay and packet drop respectively.

Extensible packet processing architecture

Science.gov (United States)

Robertson, Perry J.; Hamlet, Jason R.; Pierson, Lyndon G.; Olsberg, Ronald R.; Chun, Guy D.

2013-08-20

A technique for distributed packet processing includes sequentially passing packets associated with packet flows between a plurality of processing engines along a flow through data bus linking the plurality of processing engines in series. At least one packet within a given packet flow is marked by a given processing engine to signify by the given processing engine to the other processing engines that the given processing engine has claimed the given packet flow for processing. A processing function is applied to each of the packet flows within the processing engines and the processed packets are output on a time-shared, arbitered data bus coupled to the plurality of processing engines.

The research of optimal selection method for wavelet packet basis in compressing the vibration signal of a rolling bearing in fans and pumps

International Nuclear Information System (INIS)

Hao, W; Jinji, G

2012-01-01

Compressing the vibration signal of a rolling bearing has important significance to wireless monitoring and remote diagnosis of fans and pumps which is widely used in the petrochemical industry. In this paper, according to the characteristics of the vibration signal in a rolling bearing, a compression method based on the optimal selection of wavelet packet basis is proposed. We analyze several main attributes of wavelet packet basis and the effect to the compression of the vibration signal in a rolling bearing using wavelet packet transform in various compression ratios, and proposed a method to precisely select a wavelet packet basis. Through an actual signal, we come to the conclusion that an orthogonal wavelet packet basis with low vanishing moment should be used to compress the vibration signal of a rolling bearing to get an accurate energy proportion between the feature bands in the spectrum of reconstructing the signal. Within these low vanishing moments, orthogonal wavelet packet basis, and 'coif' wavelet packet basis can obtain the best signal-to-noise ratio in the same compression ratio for its best symmetry.

A Performance Analysis for UMTS Packet Switched Network Based on Multivariate KPIS

OpenAIRE

Ouyang, Ye; Fallah, M. Hosein

2010-01-01

Mobile data services are penetrating mobile markets rapidly. The mobile industry relies heavily on data service to replace the traditional voice services with the evolution of the wireless technology and market. A reliable packet service network is critical to the mobile operators to maintain their core competence in data service market. Furthermore, mobile operators need to develop effective operational models to manage the varying mix of voice, data and video traffic on a single network. Ap...

Optical wireless connected objects for healthcare.

Science.gov (United States)

Toumieux, Pascal; Chevalier, Ludovic; Sahuguède, Stéphanie; Julien-Vergonjanne, Anne

2015-10-01

In this Letter the authors explore the communication capabilities of optical wireless technology for a wearable device dedicated to healthcare application. In an indoor environment sensible to electromagnetic perturbations such as a hospital, the use of optical wireless links can permit reducing the amount of radio frequencies in the patient environment. Moreover, this technology presents the advantage to be secure, low-cost and easy to deploy. On the basis of commercially available components, a custom-made wearable device is presented, which allows optical wireless transmission of accelerometer data in the context of physical activity supervision of post-stroke patients in hospital. Considering patient mobility, the experimental performance is established in terms of packet loss as a function of the number of receivers fixed to the ceiling. The results permit to conclude that optical wireless links can be used to perform such mobile remote monitoring applications. Moreover, based on the measurements obtained with one receiver, it is possible to theoretically determine the performance according to the number of receivers to be deployed.

Efficient Data Gathering in 3D Linear Underwater Wireless Sensor Networks Using Sink Mobility.

Science.gov (United States)

Akbar, Mariam; Javaid, Nadeem; Khan, Ayesha Hussain; Imran, Muhammad; Shoaib, Muhammad; Vasilakos, Athanasios

2016-03-19

Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability.

Efficient Data Gathering in 3D Linear Underwater Wireless Sensor Networks Using Sink Mobility

Directory of Open Access Journals (Sweden)

Mariam Akbar

2016-03-01

Full Text Available Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS, i.e., an autonomous underwater vehicle (AUV, and also courier nodes (CNs, to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability.

A Dynamic Reputation Management System for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Eric Chiejina

2015-04-01

Full Text Available Nodes in mobile ad hoc networks (MANETs are mandated to utilize their limited energy resources in forwarding routing control and data packets for other nodes. Since a MANET lacks a centralized administration and control, a node may decide to act selfishly, either by refusing to respond to route requests from other nodes or deceitfully by responding to some route requests, but dropping the corresponding data packets that are presented for forwarding. A significant increase in the presence of these misbehaving nodes in a MANET can subsequently degrade network performance. In this paper, we propose a dynamic reputation management system for detecting and isolating misbehaving nodes in MANETs. Our model employs a novel direct monitoring technique to evaluate the reputation of a node in the network, which ensures that nodes that expend their energy in transmitting data and routing control packets for others are allowed to carry out their network activities while the misbehaving nodes are detected and isolated from the network. Simulation results show that our model is effective at curbing and mitigating the effects of misbehaving nodes in the network.

R2d2 Drives Selfish Sweeps in the House Mouse.

Science.gov (United States)

Didion, John P; Morgan, Andrew P; Yadgary, Liran; Bell, Timothy A; McMullan, Rachel C; Ortiz de Solorzano, Lydia; Britton-Davidian, Janice; Bult, Carol J; Campbell, Karl J; Castiglia, Riccardo; Ching, Yung-Hao; Chunco, Amanda J; Crowley, James J; Chesler, Elissa J; Förster, Daniel W; French, John E; Gabriel, Sofia I; Gatti, Daniel M; Garland, Theodore; Giagia-Athanasopoulou, Eva B; Giménez, Mabel D; Grize, Sofia A; Gündüz, İslam; Holmes, Andrew; Hauffe, Heidi C; Herman, Jeremy S; Holt, James M; Hua, Kunjie; Jolley, Wesley J; Lindholm, Anna K; López-Fuster, María J; Mitsainas, George; da Luz Mathias, Maria; McMillan, Leonard; Ramalhinho, Maria da Graça Morgado; Rehermann, Barbara; Rosshart, Stephan P; Searle, Jeremy B; Shiao, Meng-Shin; Solano, Emanuela; Svenson, Karen L; Thomas-Laemont, Patricia; Threadgill, David W; Ventura, Jacint; Weinstock, George M; Pomp, Daniel; Churchill, Gary A; Pardo-Manuel de Villena, Fernando

2016-06-01

A selective sweep is the result of strong positive selection driving newly occurring or standing genetic variants to fixation, and can dramatically alter the pattern and distribution of allelic diversity in a population. Population-level sequencing data have enabled discoveries of selective sweeps associated with genes involved in recent adaptations in many species. In contrast, much debate but little evidence addresses whether "selfish" genes are capable of fixation-thereby leaving signatures identical to classical selective sweeps-despite being neutral or deleterious to organismal fitness. We previously described R2d2, a large copy-number variant that causes nonrandom segregation of mouse Chromosome 2 in females due to meiotic drive. Here we show population-genetic data consistent with a selfish sweep driven by alleles of R2d2 with high copy number (R2d2(HC)) in natural populations. We replicate this finding in multiple closed breeding populations from six outbred backgrounds segregating for R2d2 alleles. We find that R2d2(HC) rapidly increases in frequency, and in most cases becomes fixed in significantly fewer generations than can be explained by genetic drift. R2d2(HC) is also associated with significantly reduced litter sizes in heterozygous mothers, making it a true selfish allele. Our data provide direct evidence of populations actively undergoing selfish sweeps, and demonstrate that meiotic drive can rapidly alter the genomic landscape in favor of mutations with neutral or even negative effects on overall Darwinian fitness. Further study will reveal the incidence of selfish sweeps, and will elucidate the relative contributions of selfish genes, adaptation and genetic drift to evolution. © The Author 2016. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.

Selfishness Level of Strategic Games

NARCIS (Netherlands)

Apt, K.R.; Schäfer, G.

2014-01-01

We introduce a new measure of the discrepancy in strategic games between the social welfare in a Nash equilibrium and in a social optimum, that we call selfishness level. It is the smallest fraction of the social welfare that needs to be offered to each player to achieve that a social optimum is

Social Motivation: Costs and Benefits of Selfishness and Otherishness.

Science.gov (United States)

Crocker, Jennifer; Canevello, Amy; Brown, Ashley A

2017-01-03

We examine recent evidence on the consequences of selfishness and otherishness for psychological well-being, physical health, and relationships. In the first sections, we consider recent evidence regarding the costs and benefits of giving time, money, and support to others and the costs and benefits of taking or receiving those things from others. Then, because the behaviors of giving and taking can be motivated either by selfish or otherish concerns, we next consider the costs and benefits of the motivation underlying giving and taking. We also examine why and for whom selfishness and otherishness have consequences for psychological well-being, physical health, and relationships. We focus on mechanisms identified in research, including intrapsychic mechanisms such as positive and negative affect, self-esteem and self-efficacy, a sense of meaning and purpose in life, and a sense of connectedness to or isolation from others, as well as interpersonal processes such as reciprocation of support and responsiveness.

Sleep Scheduling in Critical Event Monitoring with Wireless Sensor Networks

NARCIS (Netherlands)

Guo, Peng; Jiang, Tao; Zhang, Qian; Zhang, Kui

In this paper, we focus on the applications of wireless sensor networks (WSNs) for critical event monitoring, where normally there are only small number of packets need to be transmitted, while when urgent event occurs, the alarm should be broadcast to the entire network as soon as possible. During

An Internet of Energy Things Based on Wireless LPWAN

Directory of Open Access Journals (Sweden)

Yonghua Song

2017-08-01

Full Text Available Under intense environmental pressure, the global energy sector is promoting the integration of renewable energy into interconnected energy systems. The demand-side management (DSM of energy systems has drawn considerable industrial and academic attention in attempts to form new flexibilities to respond to variations in renewable energy inputs to the system. However, many DSM concepts are still in the experimental demonstration phase. One of the obstacles to DSM usage is that the current information infrastructure was mainly designed for centralized systems, and does not meet DSM requirements. To overcome this barrier, this paper proposes a novel information infrastructure named the Internet of Energy Things (IoET in order to make DSM practicable by basing it on the latest wireless communication technology: the low-power wide-area network (LPWAN. The primary advantage of LPWAN over general packet radio service (GPRS and area Internet of Things (IoT is its wide-area coverage, which comes with minimum power consumption and maintenance costs. Against this background, this paper briefly reviews the representative LPWAN technologies of narrow-band Internet of Things (NB-IoT and Long Range (LoRa technology, and compares them with GPRS and area IoT technology. Next, a wireless-to-cloud architecture is proposed for the IoET, based on the main technical features of LPWAN. Finally, this paper looks forward to the potential of IoET in various DSM application scenarios.

Race for the wireless robot platform

Energy Technology Data Exchange (ETDEWEB)

2008-07-01

With the world going wireless, Norwegian energy champion Statoil Hydro is pushing forward with an unmanned, robot-operated production platform called Mesa Verde. Enlisted to solve safety and operational issues and help the oil company gain a cost edge on global competitors is an Emerson-Cisco wireless alliance itself facing stiff competition

Exact analysis of Packet Reversed Packet Combining Scheme and Modified Packet Combining Scheme; and a combined scheme

International Nuclear Information System (INIS)

Bhunia, C.T.

2007-07-01

Packet combining scheme is a well defined simple error correction scheme for the detection and correction of errors at the receiver. Although it permits a higher throughput when compared to other basic ARQ protocols, packet combining (PC) scheme fails to correct errors when errors occur in the same bit locations of copies. In a previous work, a scheme known as Packet Reversed Packet Combining (PRPC) Scheme that will correct errors which occur at the same bit location of erroneous copies, was studied however PRPC does not handle a situation where a packet has more than 1 error bit. The Modified Packet Combining (MPC) Scheme that can correct double or higher bit errors was studied elsewhere. Both PRPC and MPC schemes are believed to offer higher throughput in previous studies, however neither adequate investigation nor exact analysis was done to substantiate this claim of higher throughput. In this work, an exact analysis of both PRPC and MPC is carried out and the results reported. A combined protocol (PRPC and MPC) is proposed and the analysis shows that it is capable of offering even higher throughput and better error correction capability at high bit error rate (BER) and larger packet size. (author)

Heterogeneous Wireless Networks for Smart Grid Distribution Systems: Advantages and Limitations.

Science.gov (United States)

Khalifa, Tarek; Abdrabou, Atef; Shaban, Khaled; Gaouda, A M

2018-05-11

Supporting a conventional power grid with advanced communication capabilities is a cornerstone to transferring it to a smart grid. A reliable communication infrastructure with a high throughput can lay the foundation towards the ultimate objective of a fully automated power grid with self-healing capabilities. In order to realize this objective, the communication infrastructure of a power distribution network needs to be extended to cover all substations including medium/low voltage ones. This shall enable information exchange among substations for a variety of system automation purposes with a low latency that suits time critical applications. This paper proposes the integration of two heterogeneous wireless technologies (such as WiFi and cellular 3G/4G) to provide reliable and fast communication among primary and secondary distribution substations. This integration allows the transmission of different data packets (not packet replicas) over two radio interfaces, making these interfaces act like a one data pipe. Thus, the paper investigates the applicability and effectiveness of employing heterogeneous wireless networks (HWNs) in achieving the desired reliability and timeliness requirements of future smart grids. We study the performance of HWNs in a realistic scenario under different data transfer loads and packet loss ratios. Our findings reveal that HWNs can be a viable data transfer option for smart grids.

Heterogeneous Wireless Networks for Smart Grid Distribution Systems: Advantages and Limitations

Directory of Open Access Journals (Sweden)

Tarek Khalifa

2018-05-01

Full Text Available Supporting a conventional power grid with advanced communication capabilities is a cornerstone to transferring it to a smart grid. A reliable communication infrastructure with a high throughput can lay the foundation towards the ultimate objective of a fully automated power grid with self-healing capabilities. In order to realize this objective, the communication infrastructure of a power distribution network needs to be extended to cover all substations including medium/low voltage ones. This shall enable information exchange among substations for a variety of system automation purposes with a low latency that suits time critical applications. This paper proposes the integration of two heterogeneous wireless technologies (such as WiFi and cellular 3G/4G to provide reliable and fast communication among primary and secondary distribution substations. This integration allows the transmission of different data packets (not packet replicas over two radio interfaces, making these interfaces act like a one data pipe. Thus, the paper investigates the applicability and effectiveness of employing heterogeneous wireless networks (HWNs in achieving the desired reliability and timeliness requirements of future smart grids. We study the performance of HWNs in a realistic scenario under different data transfer loads and packet loss ratios. Our findings reveal that HWNs can be a viable data transfer option for smart grids.

Reproductive bribing and policing as evolutionary mechanisms for the suppression of within-group selfishness.

Science.gov (United States)

Reeve, H K; Keller, L

1997-07-01

We show that a new, simple, and robust general mechanism for the social suppression of within-group selfishness follows from Hamilton's rule applied in a multilevel selection approach to asymmetrical, two-person groups: If it pays a group member to behave selfishly (i.e., increase its share of the group's reproduction, at the expense of group productivity), then its partner will virtually always be favored to provide a reproductive "bribe" sufficient to remove the incentive for the selfish behavior. The magnitude of the bribe will vary directly with the number of offspring (or other close kin) potentially gained by the selfish individual and inversely with both the relatedness r between the interactants and the loss in group productivity because of selfishness. This bribe principle greatly extends the scope for cooperation within groups. Reproductive bribing is more likely to be favored over social policing for dominants rather than subordinates and as intragroup relatedness increases. Finally, analysis of the difference between the group optimum for an individual's behavior and the individual's inclusive fitness optimum reveals a paradoxical feedback loop by which bribing and policing, while nullifying particular selfish acts, automatically widen the separation of individual and group optima for other behaviors (i.e., resolution of one conflict intensifies others).

Wireless network interface energy consumption implications of popular streaming formats

Science.gov (United States)

Chandra, Surendar

2001-12-01

With the proliferation of mobile streaming multimedia, available battery capacity constrains the end-user experience. Since streaming applications tend to be long running, wireless network interface card's (WNIC) energy consumption is particularly an acute problem. In this work, we explore the WNIC energy consumption implications of popular multimedia streaming formats from Microsoft (Windows media), Real (Real media) and Apple (Quick Time). We investigate the energy consumption under varying stream bandwidth and network loss rates. We also explore history-based client-side strategies to reduce the energy consumed by transitioning the WNICs to a lower power consuming sleep state. We show that Microsoft media tends to transmit packets at regular intervals; streams optimized for 28.8 Kbps can save over 80% in energy consumption with 2% data loss. A high bandwidth stream (768 Kbps) can still save 57% in energy consumption with less than 0.3% data loss. For high bandwidth streams, Microsoft media exploits network-level packet fragmentation, which can lead to excessive packet loss (and wasted energy) in a lossy network. Real stream packets tend to be sent closer to each other, especially at higher bandwidths. Quicktime packets sometimes arrive in quick succession; most likely an application level fragmentation mechanism. Such packets are harder to predict at the network level without understanding the packet semantics.

FPGA implementation of a ZigBee wireless network control interface to transmit biomedical signals

International Nuclear Information System (INIS)

López, M A Gómez; Goy, C B; Bolognini, P C; Herrera, M C

2011-01-01

In recent years, cardiac hemodynamic monitors have incorporated new technologies based on wireless sensor networks which can implement different types of communication protocols. More precisely, a digital conductance catheter system recently developed adds a wireless ZigBee module (IEEE 802.15.4 standards) to transmit cardiac signals (ECG, intraventricular pressure and volume) which would allow the physicians to evaluate the patient's cardiac status in a noninvasively way. The aim of this paper is to describe a control interface, implemented in a FPGA device, to manage a ZigBee wireless network. ZigBee technology is used due to its excellent performance including simplicity, low-power consumption, short-range transmission and low cost. FPGA internal memory stores 8-bit signals with which the control interface prepares the information packets. These data were send to the ZigBee END DEVICE module that receives and transmits wirelessly to the external COORDINATOR module. Using an USB port, the COORDINATOR sends the signals to a personal computer for displaying. Each functional block of control interface was assessed by means of temporal diagrams. Three biological signals, organized in packets and converted to RS232 serial protocol, were successfully transmitted and displayed in a PC screen. For this purpose, a custom-made graphical software was designed using LabView.

FPGA implementation of a ZigBee wireless network control interface to transmit biomedical signals

Science.gov (United States)

Gómez López, M. A.; Goy, C. B.; Bolognini, P. C.; Herrera, M. C.

2011-12-01

In recent years, cardiac hemodynamic monitors have incorporated new technologies based on wireless sensor networks which can implement different types of communication protocols. More precisely, a digital conductance catheter system recently developed adds a wireless ZigBee module (IEEE 802.15.4 standards) to transmit cardiac signals (ECG, intraventricular pressure and volume) which would allow the physicians to evaluate the patient's cardiac status in a noninvasively way. The aim of this paper is to describe a control interface, implemented in a FPGA device, to manage a ZigBee wireless network. ZigBee technology is used due to its excellent performance including simplicity, low-power consumption, short-range transmission and low cost. FPGA internal memory stores 8-bit signals with which the control interface prepares the information packets. These data were send to the ZigBee END DEVICE module that receives and transmits wirelessly to the external COORDINATOR module. Using an USB port, the COORDINATOR sends the signals to a personal computer for displaying. Each functional block of control interface was assessed by means of temporal diagrams. Three biological signals, organized in packets and converted to RS232 serial protocol, were sucessfully transmitted and displayed in a PC screen. For this purpose, a custom-made graphical software was designed using LabView.

Selfish operons: the evolutionary impact of gene clustering in prokaryotes and eukaryotes.

Science.gov (United States)

Lawrence, J

1999-12-01

The Selfish Operon Model postulates that the organization of bacterial genes into operons is beneficial to the constituent genes in that proximity allows horizontal cotransfer of all genes required for a selectable phenotype; eukaryotic operons formed for very different reasons. Horizontal transfer of selfish operons most probably promotes bacterial diversification.

Downlink Transmission of Short Packets

DEFF Research Database (Denmark)

Trillingsgaard, Kasper Fløe; Popovski, Petar

2017-01-01

Cellular wireless systems rely on frame-based transmissions. The frame design is conventionally based on heuristics, consisting of a frame header and a data part. The frame header contains control information that provides pointers to the messages within the data part. In this paper, we revisit...... the principles of frame design and show the impact of the new design in scenarios that feature short data packets, which are central to various 5G and Internet of Things applications. We~treat framing for downlink transmission in an AWGN broadcast channel with $K$ users, where the sizes of the messages....... This requires changes in the way control information is sent, and it requires that the users need to spend power decoding other messages, thereby increasing the average power consumption. We~show that the common heuristic design is only one point on a curve that represents the tradeoff between latency and power...

Optimal design of mixed-media packet-switching networks - Routing and capacity assignment

Science.gov (United States)

Huynh, D.; Kuo, F. F.; Kobayashi, H.

1977-01-01

This paper considers a mixed-media packet-switched computer communication network which consists of a low-delay terrestrial store-and-forward subnet combined with a low-cost high-bandwidth satellite subnet. We show how to route traffic via ground and/or satellite links by means of static, deterministic procedures and assign capacities to channels subject to a given linear cost such that the network average delay is minimized. Two operational schemes for this network model are investigated: one is a scheme in which the satellite channel is used as a slotted ALOHA channel; the other is a new multiaccess scheme we propose in which whenever a channel collision occurs, retransmission of the involved packets will route through ground links to their destinations. The performance of both schemes is evaluated and compared in terms of cost and average packet delay tradeoffs for some examples. The results offer guidelines for the design and optimal utilization of mixed-media networks.

Packet reversed packet combining scheme

International Nuclear Information System (INIS)

Bhunia, C.T.

2006-07-01

The packet combining scheme is a well defined simple error correction scheme with erroneous copies at the receiver. It offers higher throughput combined with ARQ protocols in networks than that of basic ARQ protocols. But packet combining scheme fails to correct errors when the errors occur in the same bit locations of two erroneous copies. In the present work, we propose a scheme that will correct error if the errors occur at the same bit location of the erroneous copies. The proposed scheme when combined with ARQ protocol will offer higher throughput. (author)

An Energy-Efficient Link Layer Protocol for Reliable Transmission over Wireless Networks

Directory of Open Access Journals (Sweden)

Iqbal Adnan

2009-01-01

Full Text Available In multihop wireless networks, hop-by-hop reliability is generally achieved through positive acknowledgments at the MAC layer. However, positive acknowledgments introduce significant energy inefficiencies on battery-constrained devices. This inefficiency becomes particularly significant on high error rate channels. We propose to reduce the energy consumption during retransmissions using a novel protocol that localizes bit-errors at the MAC layer. The proposed protocol, referred to as Selective Retransmission using Virtual Fragmentation (SRVF, requires simple modifications to the positive-ACK-based reliability mechanism but provides substantial improvements in energy efficiency. The main premise of the protocol is to localize bit-errors by performing partial checksums on disjoint parts or virtual fragments of a packet. In case of error, only the corrupted virtual fragments are retransmitted. We develop stochastic models of the Simple Positive-ACK-based reliability, the previously-proposed Packet Length Optimization (PLO protocol, and the SRVF protocol operating over an arbitrary-order Markov wireless channel. Our analytical models show that SRVF provides significant theoretical improvements in energy efficiency over existing protocols. We then use bit-error traces collected over different real networks to empirically compare the proposed and existing protocols. These experimental results further substantiate that SRVF provides considerably better energy efficiency than Simple Positive-ACK and Packet Length Optimization protocols.

Q FUNCTION AWARE OPTICAL PACKET SWITCH WITH LOW PACKET LOSS RATE

Directory of Open Access Journals (Sweden)

OMPAL SINGH

2017-03-01

Full Text Available Optical packet switching (OPS is a very promising technology for the next generation data transfer due to the very large bandwidth of the optical fiber. The success of the OPS relies heavily on design of the node architecture which supports comparatively larger buffering capacity without detiorating signal quality too much and it should provide very low packet loss probability with reasonably low average delay. In this paper, a design analysis of low complexity OPS node architecture is discussed along-with its advantages. The presented architecture support both fixed and variable length packets. The packets are stored in a single piece of fiber using the WDM technology. Physical layer analysis presented in this paper is to obtain the Q function (Bit Error Rate. Finally, the Monte Carlo simulation is done to obtain the packet loss. The average delay performance of the switch and effect of Q values on packet loss rates are discussed.

Data Recovery using Side Information from the Wireless M-Bus Protocol

DEFF Research Database (Denmark)

Melchior Jacobsen, Rasmus; Popovski, Petar

2013-01-01

Dedicated infrastructure for wireless battery-powered smart meters involves a costly setup. To reduce the cost, one often made compromise is the link reliability, where a majority of packets are allowed to be in error, as long as a few packets are received over a long time frame. On the other hand......, each meter transmits frequently to accommodate for drive-by/walk-by remote reading applications, leaving redundancy in the transmissions seen on a dedicated receiver. We utilize the redundancy and the inherent timing structure of the protocol in order to recover metering data from multiple erroneous...

A two-hop based adaptive routing protocol for real-time wireless sensor networks.

Science.gov (United States)

Rachamalla, Sandhya; Kancherla, Anitha Sheela

2016-01-01

One of the most important and challenging issues in wireless sensor networks (WSNs) is to optimally manage the limited energy of nodes without degrading the routing efficiency. In this paper, we propose an energy-efficient adaptive routing mechanism for WSNs, which saves energy of nodes by removing the much delayed packets without degrading the real-time performance of the used routing protocol. It uses the adaptive transmission power algorithm which is based on the attenuation of the wireless link to improve the energy efficiency. The proposed routing mechanism can be associated with any geographic routing protocol and its performance is evaluated by integrating with the well known two-hop based real-time routing protocol, PATH and the resulting protocol is energy-efficient adaptive routing protocol (EE-ARP). The EE-ARP performs well in terms of energy consumption, deadline miss ratio, packet drop and end-to-end delay.

Implementation of fast handover for proxy mobile IPv6: Resolving out-of-order packets.

Science.gov (United States)

Kang, Byungseok; Anh, Khuong Quoc; Choo, Hyunseung

2017-01-01

Mobile IP allows for location-independent routing of IP datagrams on the Internet. Mobile IP specifies how a mobile node (MN) registers with its home agent and how the home agent routes datagrams to the MN through the tunnel. Current Mobile IP protocols have difficulties meeting the stringent handover delay requirements of future wireless networks. Fast handover for Proxy Mobile IPv6 (FPMIPv6) is used to resolve handover latency and packet loss problems that occur in the Proxy Mobile IPv6 (PMIPv6) protocol. However, while implementing the FPMIPv6 scheme in a testbed, we encounter the out-of-order packet (OoOP) problem. The cause of this problem is the existence of two paths for data transmitted from a correspondent node (CN) to an MN. Since the problem affects the quality of service (QoS) of the network and the performance of the MN, we propose a new scheme using the last packet marker and packet buffering to solve this problem in FPMIPv6. The new Mobile Access Gateway (MAG) can control and deliver the data transmitted via the old path or the new path to an MN in order, using the last packet marker to notify the end of the data delivery in the old path and the packet buffering for holding the data delivered in the new path. We implement both the proposed scheme and FPMIPv6 in a testbed as a real network environment to demonstrate the correctness, cost effectiveness, and performance of the proposed scheme. A performance evaluation reveals that the proposed scheme can handle the OoOP problem efficiently.

Implementation of fast handover for proxy mobile IPv6: Resolving out-of-order packets.

Directory of Open Access Journals (Sweden)

Byungseok Kang

Full Text Available Mobile IP allows for location-independent routing of IP datagrams on the Internet. Mobile IP specifies how a mobile node (MN registers with its home agent and how the home agent routes datagrams to the MN through the tunnel. Current Mobile IP protocols have difficulties meeting the stringent handover delay requirements of future wireless networks. Fast handover for Proxy Mobile IPv6 (FPMIPv6 is used to resolve handover latency and packet loss problems that occur in the Proxy Mobile IPv6 (PMIPv6 protocol. However, while implementing the FPMIPv6 scheme in a testbed, we encounter the out-of-order packet (OoOP problem. The cause of this problem is the existence of two paths for data transmitted from a correspondent node (CN to an MN. Since the problem affects the quality of service (QoS of the network and the performance of the MN, we propose a new scheme using the last packet marker and packet buffering to solve this problem in FPMIPv6. The new Mobile Access Gateway (MAG can control and deliver the data transmitted via the old path or the new path to an MN in order, using the last packet marker to notify the end of the data delivery in the old path and the packet buffering for holding the data delivered in the new path. We implement both the proposed scheme and FPMIPv6 in a testbed as a real network environment to demonstrate the correctness, cost effectiveness, and performance of the proposed scheme. A performance evaluation reveals that the proposed scheme can handle the OoOP problem efficiently.

Packet telemetry and packet telecommand - The new generation of spacecraft data handling techniques

Science.gov (United States)

Hooke, A. J.

1983-01-01

Because of rising costs and reduced reliability of spacecraft and ground network hardware and software customization, standardization Packet Telemetry and Packet Telecommand concepts are emerging as viable alternatives. Autonomous packets of data, within each concept, which are created within ground and space application processes through the use of formatting techniques, are switched end-to-end through the space data network to their destination application processes through the use of standard transfer protocols. This process may result in facilitating a high degree of automation and interoperability because of completely mission-independent-designed intermediate data networks. The adoption of an international guideline for future space telemetry formatting of the Packet Telemetry concept, and the advancement of the NASA-ESA Working Group's Packet Telecommand concept to a level of maturity parallel to the of Packet Telemetry are the goals of the Consultative Committee for Space Data Systems. Both the Packet Telemetry and Packet Telecommand concepts are reviewed.

Energy-Efficient Link-Layer Jamming Attacks against Wireless Sensor Network MAC Protocols

NARCIS (Netherlands)

Law, Y.W.; van Hoesel, L.F.W.; Doumen, J.M.; Hartel, Pieter H.; Havinga, Paul J.M.; Atluri, V.; Samarati, P.; Ning, P.; Du, W.

2005-01-01

A typical wireless sensor node has little protection against radio jamming. The situation becomes worse if energy efficient jamming can be achieved by exploiting knowledge of the data link layer. Encrypting the packets may help prevent the jammer from taking actions based on the content of the

A Survey on Cross-Layer Intrusion Detection System for Wireless ...

African Journals Online (AJOL)

pc

2018-03-05

Mar 5, 2018 ... forwarding, and open wireless medium are the factors that make ... Wireless Sensor Network (WSN) is a kind of network that ... These tiny sensors are mainly small sized and have low ..... they were integrated to WSN for intrusion detection in ..... Anomaly Detection Techniques for Smart City Wireless Sensor.

MHBCDA: Mobility and Heterogeneity aware Bandwidth Efficient Cluster based Data Aggregation for Wireless Sensor Network

DEFF Research Database (Denmark)

Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

2013-01-01

Wireless Sensor Network (WSN) offers a variety of novel applications for mobile targets. It generates the large amount of redundant sensing data. The data aggregation techniques are extensively used to reduce the energy consumption and increase the network lifetime, although it has the side effect...... efficient. It exploits correlation of data packets generated by varying the packet generation rate. It prevents transmission of redundant data packets by improving energy consumption by 4.11% and prolongs the network life by 34.45% as compared with state-of-the-art solutions.......-based Data Aggregation (MHBCDA) algorithm for the randomly distributed nodes. It considers the mobile sink based packet aggregation for the heterogeneous WSN. It uses predefined region for the aggregation at cluster head to minimize computation and communication cost. The MHBCDA is energy and bandwidth...

Hierarchically Coordinated Power Management for Target Tracking in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Feng Juan

2013-10-01

Full Text Available Energy efficiency is very important for wireless sensor networks (WSNs since sensor nodes have a limited energy supply from a battery. So far, a lot research has focused on this issue, while less emphasis has been placed on the adaptive sleep time for each node with a consideration for the application constraints. In this paper, we propose a hierarchically coordinated power management (HCPM approach, which both addresses the energy conservation problem and reduces the packet forwarding delay for target tracking WSNs based on a virtual-grid-based network structure. We extend the network lifetime by adopting an adaptive sleep scheduling scheme that combines the local power management (PM and the adaptive coordinate PM strategies to schedule the activities of the sensor nodes at the surveillance stage. Furthermore, we propose a hierarchical structure for the tracking stage. Experimental results show that the proposed approach has a greater capability of extending the network lifetime while maintaining a short transmission delay when compared with the protocol which does not consider the application constraints in target tracking sensor networks.

An Energy-Aware Hybrid ARQ Scheme with Multi-ACKs for Data Sensing Wireless Sensor Networks.

Science.gov (United States)

Zhang, Jinhuan; Long, Jun

2017-06-12

Wireless sensor networks (WSNs) are one of the important supporting technologies of edge computing. In WSNs, reliable communications are essential for most applications due to the unreliability of wireless links. In addition, network lifetime is also an important performance metric and needs to be considered in many WSN studies. In the paper, an energy-aware hybrid Automatic Repeat-reQuest protocol (ARQ) scheme is proposed to ensure energy efficiency under the guarantee of network transmission reliability. In the scheme, the source node sends data packets continuously with the correct window size and it does not need to wait for the acknowledgement (ACK) confirmation for each data packet. When the destination receives K data packets, it will return multiple copies of one ACK for confirmation to avoid ACK packet loss. The energy consumption of each node in flat circle network applying the proposed scheme is statistical analyzed and the cases under which it is more energy efficiency than the original scheme is discussed. Moreover, how to select parameters of the scheme is addressed to extend the network lifetime under the constraint of the network reliability. In addition, the energy efficiency of the proposed schemes is evaluated. Simulation results are presented to demonstrate that a node energy consumption reduction could be gained and the network lifetime is prolonged.

Cross-Layer optimization of the packet loss rate in mobile videoconferencing applications

OpenAIRE

Rivera-Rodríguez, R.; Olivares-Domínguez, O. E.; Serrano-Santoyo, A.

2010-01-01

Videoconferencing transmission over wireless channels presents relevant challenges in mobile scenarios at vehicular speeds. Previous contributions are focused on the optimization of the transmission of multimedia and delay-sensitive applications over the forward link. In this paper, a new Quality of Service (QoS) parameter adaptation scheme is proposed. This scheme applies the Cross-Layer Design technique on the reverse link of an 1xEV-DO Revision 0 channel. As the wireless channel parameters...

TMAC: Timestamp-Ordered MAC for CSMA/CA Wireless Mesh Networks

KAUST Repository

Nawab, Faisal Saud Yousef

2011-07-31

We propose TMAC, a timestamp-ordered MAC protocol for Wireless Mesh Networks (WMNs). TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended with a timestamp to a selected list of neighbors. It can proceed with the transmission only if it receives a sufficient number of grant control messages from these neighbors. A grant message indicates that the associated data packet has the lowest timestamp of all the packets pending transmission at the local transmit queue. We demonstrate that a loose ordering of timestamps among neighboring nodes is sufficient for enforcing local fairness, subsequently leading to flow rate fairness in a multi-hop WMN. We show that TMAC can be implemented using the control frames in IEEE 802.11 stack, and thus can be easily integrated in existing 802.11-based WMNs. Our simulation results show that TMAC achieves excellent resource allocation fairness while maintaining over 90% of maximum link capacity in parking lot and large grid topologies.

Extended Delivery Time Analysis for Secondary Packet Transmission With Adaptive Modulation Under Interweave Cognitive Implementation

KAUST Repository

Wang, Wen-Jing

2017-05-02

Cognitive radio communication can opportunistically access underutilized spectrum for emerging wireless applications. With interweave cognitive implementation, a secondary user (SU) transmits only if primary user does not occupy the channel and waits for transmission otherwise. Therefore, secondary packet transmission involves both transmission periods and waiting periods. The resulting extended delivery time (EDT) is critical to the throughput analysis of secondary system. In this paper, we study the EDT of secondary packet transmission with adaptive modulation under interweave implementation to facilitate the delay analysis of such cognitive radio system. In particular, we propose an analytical framework to derive the probability density functions of EDT considering random-length SU transmission and waiting periods. We also present selected numerical results to illustrate the mathematical formulations and to verify our analytical approach.

Fiber-wireless for smart grid: A survey

Science.gov (United States)

Radzi, NAM; Ridwan, MA; Din, NM; Abdullah, F.; Mustafa, IS; l-Mansoori, MH

2017-11-01

Smart grid allows two-way communication between power utility companies and their customers while having the ability to sense along the transmission lines. However, the downside is such, when the smart devices are transmitting data simultaneously, it results in network congestion. Fiber wireless (FiWi) network is one of the best congestion solutions for smart grid up to date. In this paper, a survey of current literature on FiWi for smart grid will be reviewed and a testbed to test the protocols and algorithms for FiWi in smart grid will be proposed. The results of number of packets received and delay vs packet transmitted obtained via the testbed are compared with the results obtained via simulation and they show that they are in line with each other, validating the accuracy of the testbed.

Matching of Energy Provisions in Multihop Wireless Infra-Structures

Directory of Open Access Journals (Sweden)

Rui Teng

2016-01-01

Full Text Available Recently there have been large advances in energy technologies for battery-operated systems, including green energy resources and high capacity batteries. The effective use of battery energy resources in wireless infrastructure networks to improve the versatility and reliability of wireless communications is an important issue. Emerging applications of smart cities, Internet of Things (IoT, and emergency responses highly rely on the basic communication network infrastructures that enable ubiquitous network connections. However, energy consumption by nodes in a wireless infrastructure network depends on the transmissions of other nodes in the network. Considering this inter-dependence is necessary to achieve efficient provision of energy in wireless networks. This paper studies the issue of energy provision for wireless relay nodes in Wireless Multihop Infrastructures (WMI assuming constraints on the total energy provision. We introduce a scheme of Energy Provision Matching (Matching-EP for WMI which optimizes energy provision based on matching of energy provision with estimates of differentiated position-dependent energy consumption by wireless nodes distributed in the network. The evaluation results show that Matching-EP with 4%–34% improvement in energy matching degree enables 10%–40% improvement of the network lifetime, and 5%–40% improvement of packet delivery compared with conventional WMI networks.

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

Science.gov (United States)

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-07-14

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

Advanced Signal Processing for Wireless Multimedia Communications

Directory of Open Access Journals (Sweden)

Xiaodong Wang

2000-01-01

Full Text Available There is at present a worldwide effort to develop next-generation wireless communication systems. It is envisioned that many of the future wireless systems will incorporate considerable signal-processing intelligence in order to provide advanced services such as multimedia transmission. In general, wireless channels can be very hostile media through which to communicate, due to substantial physical impediments, primarily radio-frequency interference and time-arying nature of the channel. The need of providing universal wireless access at high data-rate (which is the aim of many merging wireless applications presents a major technical challenge, and meeting this challenge necessitates the development of advanced signal processing techniques for multiple-access communications in non-stationary interference-rich environments. In this paper, we present some key advanced signal processing methodologies that have been developed in recent years for interference suppression in wireless networks. We will focus primarily on the problem of jointly suppressing multiple-access interference (MAI and intersymbol interference (ISI, which are the limiting sources of interference for the high data-rate wireless systems being proposed for many emerging application areas, such as wireless multimedia. We first present a signal subspace approach to blind joint suppression of MAI and ISI. We then discuss a powerful iterative technique for joint interference suppression and decoding, so-called Turbo multiuser detection, that is especially useful for wireless multimedia packet communications. We also discuss space-time processing methods that employ multiple antennas for interference rejection and signal enhancement. Finally, we touch briefly on the problems of suppressing narrowband interference and impulsive ambient noise, two other sources of radio-frequency interference present in wireless multimedia networks.

Statistical performance evaluation of ECG transmission using wireless networks.

Science.gov (United States)

Shakhatreh, Walid; Gharaibeh, Khaled; Al-Zaben, Awad

2013-07-01

This paper presents simulation of the transmission of biomedical signals (using ECG signal as an example) over wireless networks. Investigation of the effect of channel impairments including SNR, pathloss exponent, path delay and network impairments such as packet loss probability; on the diagnosability of the received ECG signal are presented. The ECG signal is transmitted through a wireless network system composed of two communication protocols; an 802.15.4- ZigBee protocol and an 802.11b protocol. The performance of the transmission is evaluated using higher order statistics parameters such as kurtosis and Negative Entropy in addition to the common techniques such as the PRD, RMS and Cross Correlation.

Revivals of Rydberg wave packets

International Nuclear Information System (INIS)

Bluhm, R.; Kostelecky, V.A.; Tudose, B.

1998-01-01

We examine the revival structure of Rydberg wave packets. These wave packets exhibit initial classical periodic motion followed by a sequence of collapse, fractional (or full) revivals, and fractional (or full) superrevivals. The effects of quantum defects on wave packets in alkali-metal atoms and a squeezed-state description of the initial wave packets are also considered. We then examine the revival structure of Rydberg wave packets in the presence of an external electric field - that is, the revival structure of Stark wave packets. These wave packets have energies that depend on two quantum numbers and exhibit new types of interference behavior

Preschoolers' group bias in punishing selfishness in the Ultimatum Game.

Science.gov (United States)

Wu, Zhen; Gao, Xiaohe

2018-02-01

Previous studies have shown that both adults and children tend to favor members of their own group and expect reciprocity of such in-group privilege. If a person is treated unfairly by an in-group member, a conflict arises between the tendency of in-group favoritism and the desire to punish violators of in-group norms. How do children solve the conflict at different points in development? We compared how preschoolers punished in-group and out-group members (marked by color preference) for selfishness in the Ultimatum Game. We found that (a) 3- to 6-year-old Chinese children rejected selfish allocations more often than fair ones, showing a robust preference for fairness; (b) 3- and 4-year-olds showed no group differences in their punishment behavior, suggesting that second-party punishment of selfishness is not biased during early childhood; (c) 5- and 6-year-old girls were more likely to punish selfishness of in-groups than of out-groups, illuminating an early sign of maintaining group-based fairness norms even at a personal cost; and (d) 5- and 6-year-old boys, however, punished in-groups and out-groups equally often and punished out-groups more often than did girls. These age and gender differences in children's punishment imply that socialization may play an important role in showing group bias when enforcing fairness norms. Copyright © 2017 Elsevier Inc. All rights reserved.

A NEURAL NETWORK BASED TRAFFIC-AWARE FORWARDING STRATEGY IN NAMED DATA NETWORKING

OpenAIRE

Parisa Bazmi; Manijeh Keshtgary

2016-01-01

Named Data Networking (NDN) is a new Internet architecture which has been proposed to eliminate TCP/IP Internet architecture restrictions. This architecture is abstracting away the notion of host and working based on naming datagrams. However, one of the major challenges of NDN is supporting QoS-aware forwarding strategy so as to forward Interest packets intelligently over multiple paths based on the current network condition. In this paper, Neural Network (NN) Based Traffic-aware Forwarding ...

revivals of Rydberg wave packets

International Nuclear Information System (INIS)

Bluhm, R.; Kostelecky, V.A.; Tudose, B.

1998-01-01

We examine the revival structure of Rydberg wave packets. The effects of quantum defects on wave packets in alkali-metal atoms and a squeezed-state description of the initial wave packets are also described. We then examine the revival structure of Rydberg wave packets in the presence of an external electric field, i.e., the revival structure of Stark wave packets. These wave packets have energies that depend on two quantum numbers and exhibit new types of interference behaviour

A programmable Si-photonic node for SDN-enabled Bloom filter forwarding in disaggregated data centers

Science.gov (United States)

Moralis-Pegios, M.; Terzenidis, N.; Vagionas, C.; Pitris, S.; Chatzianagnostou, E.; Brimont, A.; Zanzi, A.; Sanchis, P.; Marti, J.; Kraft, J.; Rochracher, K.; Dorrestein, S.; Bogdan, M.; Tekin, T.; Syrivelis, D.; Tassiulas, L.; Miliou, A.; Pleros, N.; Vyrsokinos, K.

2017-02-01

Programmable switching nodes supporting Software-Defined Networking (SDN) over optical interconnecting technologies arise as a key enabling technology for future disaggregated Data Center (DC) environments. The SDNenabling roadmap of intra-DC optical solutions is already a reality for rack-to-rack interconnects, with recent research reporting on interesting applications of programmable silicon photonic switching fabrics addressing board-to-board and even on-board applications. In this perspective, simplified information addressing schemes like Bloom filter (BF)-based labels emerge as a highly promising solution for ensuring rapid switch reconfiguration, following quickly the changes enforced in network size, network topology or even in content location. The benefits of BF-based forwarding have been so far successfully demonstrated in the Information-Centric Network (ICN) paradigm, while theoretical studies have also revealed the energy consumption and speed advantages when applied in DCs. In this paper we present for the first time a programmable 4x4 Silicon Photonic switch that supports SDN through the use of BF-labeled router ports. Our scheme significantly simplifies packet forwarding as it negates the need for large forwarding tables, allowing for its remote control through modifications in the assigned BF labels. We demonstrate 1x4 switch operation controlling the Si-Pho switch by a Stratix V FPGA module, which is responsible for processing the packet ID and correlating its destination with the appropriate BF-labeled outgoing port. DAC- and amplifier-less control of the carrier-injection Si-Pho switches is demonstrated, revealing successful switching of 10Gb/s data packets with BF-based forwarding information changes taking place at a time-scale that equals the duration of four consecutive packets.

IP communication optimization for 6LoWPAN-Based Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Li MA

2014-07-01

Full Text Available The emergence of 6LoWPAN makes it possible that Wireless Sensor Networks access to the Internet. However, the cost of IP communication between 6LoWPAN wireless sensor node and external internet node is still relatively high. This paper proposed a new addressing configuration and compression scheme in 6LoWPAN network called IPHC-NAT, which largely reduced the proportion of the IP header in 6LoWPAN packet, designed and constructed a bidirectional data transmission gateway to connect 6LoWPAN wireless sensor node with IPv6 client. The experimental results show the feasibility of the design of IPHC-NAT and the data transmission efficiency has significantly been improved compared to the original 6LoWPAN network.

Hybrid ARQ Scheme with Autonomous Retransmission for Multicasting in Wireless Sensor Networks.

Science.gov (United States)

Jung, Young-Ho; Choi, Jihoon

2017-02-25

A new hybrid automatic repeat request (HARQ) scheme for multicast service for wireless sensor networks is proposed in this study. In the proposed algorithm, the HARQ operation is combined with an autonomous retransmission method that ensure a data packet is transmitted irrespective of whether or not the packet is successfully decoded at the receivers. The optimal number of autonomous retransmissions is determined to ensure maximum spectral efficiency, and a practical method that adjusts the number of autonomous retransmissions for realistic conditions is developed. Simulation results show that the proposed method achieves higher spectral efficiency than existing HARQ techniques.

Hybrid ARQ Scheme with Autonomous Retransmission for Multicasting in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Young-Ho Jung

2017-02-01

Full Text Available A new hybrid automatic repeat request (HARQ scheme for multicast service for wireless sensor networks is proposed in this study. In the proposed algorithm, the HARQ operation is combined with an autonomous retransmission method that ensure a data packet is transmitted irrespective of whether or not the packet is successfully decoded at the receivers. The optimal number of autonomous retransmissions is determined to ensure maximum spectral efficiency, and a practical method that adjusts the number of autonomous retransmissions for realistic conditions is developed. Simulation results show that the proposed method achieves higher spectral efficiency than existing HARQ techniques.

RELIABLE DYNAMIC SOURCE ROUTING PROTOCOL (RDSRP FOR ENERGY HARVESTING WIRELESS SENSOR NETWORKS

Directory of Open Access Journals (Sweden)

B. Narasimhan

2015-03-01

Full Text Available Wireless sensor networks (WSNs carry noteworthy pros over traditional communication. Though, unkind and composite environments fake great challenges in the reliability of WSN communications. It is more vital to develop a reliable unipath dynamic source routing protocol (RDSRPl for WSN to provide better quality of service (QoS in energy harvesting wireless sensor networks (EH-WSN. This paper proposes a dynamic source routing approach for attaining the most reliable route in EH-WSNs. Performance evaluation is carried out using NS-2 and throughput and packet delivery ratio are chosen as the metrics.

Prediction of transmission distortion for wireless video communication: analysis.

Science.gov (United States)

Chen, Zhifeng; Wu, Dapeng

2012-03-01

Transmitting video over wireless is a challenging problem since video may be seriously distorted due to packet errors caused by wireless channels. The capability of predicting transmission distortion (i.e., video distortion caused by packet errors) can assist in designing video encoding and transmission schemes that achieve maximum video quality or minimum end-to-end video distortion. This paper is aimed at deriving formulas for predicting transmission distortion. The contribution of this paper is twofold. First, we identify the governing law that describes how the transmission distortion process evolves over time and analytically derive the transmission distortion formula as a closed-form function of video frame statistics, channel error statistics, and system parameters. Second, we identify, for the first time, two important properties of transmission distortion. The first property is that the clipping noise, which is produced by nonlinear clipping, causes decay of propagated error. The second property is that the correlation between motion-vector concealment error and propagated error is negative and has dominant impact on transmission distortion, compared with other correlations. Due to these two properties and elegant error/distortion decomposition, our formula provides not only more accurate prediction but also lower complexity than the existing methods.

Scalable DeNoise-and-Forward in Bidirectional Relay Networks

DEFF Research Database (Denmark)

Sørensen, Jesper Hemming; Krigslund, Rasmus; Popovski, Petar

2010-01-01

In this paper a scalable relaying scheme is proposed based on an existing concept called DeNoise-and-Forward, DNF. We call it Scalable DNF, S-DNF, and it targets the scenario with multiple communication flows through a single common relay. The idea of the scheme is to combine packets at the relay...... in order to save transmissions. To ensure decodability at the end-nodes, a priori information about the content of the combined packets must be available. This is gathered during the initial transmissions to the relay. The trade-off between decodability and number of necessary transmissions is analysed...

Analysis of the packet formation process in packet-switched networks

Science.gov (United States)

Meditch, J. S.

Two new queueing system models for the packet formation process in packet-switched telecommunication networks are developed, and their applications in process stability, performance analysis, and optimization studies are illustrated. The first, an M/M/1 queueing system characterization of the process, is a highly aggregated model which is useful for preliminary studies. The second, a marked extension of an earlier M/G/1 model, permits one to investigate stability, performance characteristics, and design of the packet formation process in terms of the details of processor architecture, and hardware and software implementations with processor structure and as many parameters as desired as variables. The two new models together with the earlier M/G/1 characterization span the spectrum of modeling complexity for the packet formation process from basic to advanced.

TCPL: A Defense against wormhole attacks in wireless sensor networks

International Nuclear Information System (INIS)

Kumar, K. E. Naresh; Waheed, Mohd. Abdul; Basappa, K. Kari

2010-01-01

Do In this paper presents recent advances in technology have made low-cost, low-power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain data. For which, we propose an architecture to provide a stateless solution in sensor networks for efficient routing in wireless sensor networks. This type of architecture is known as Tree Cast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter-twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has not compromised any hosts and even if all communication provides authenticity and confidentiality. In the wormhole attack, an attacker records packets (or bits) at one location in the network, tunnels them to another location, and retransmits them there into the network. The wormhole attack can form a serious threat in wireless networks, especially against many sensor network routing protocols and location-based wireless security systems. For example, most existing ad hoc network routing protocols, without some mechanism to defend against the wormhole attack, would be unable to find routes longer than one or two hops, severely disrupting communication. We present a new, general mechanism, called packet leashes, for detecting and thus defending against wormhole attacks, and we present a specific protocol, called TIK, that implements leashes.

Flexible Multi-Bit Feedback Design for HARQ Operation of Large-Size Data Packets in 5G

DEFF Research Database (Denmark)

Khosravirad, Saeed; Mudolo, Luke; Pedersen, Klaus I.

2017-01-01

large-size data packet thanks to which the transmitter node can reduce the retransmission size to only include the initially failed segments of the packet. We study the effect of feedback size on retransmission efficiency through extensive link-level simulations over realistic channel models. Numerical......A reliable feedback channel is vital to report decoding acknowledgments in retransmission mechanisms such as the hybrid automatic repeat request (HARQ). While the feedback bits are known to be costly for the wireless link, a feedback message more informative than the conventional single......-bit feedback can increase resource utilization efficiency. Considering the practical limitations for increasing feedback message size, this paper proposes a framework for the design of flexible-content multi-bit feedback. The proposed design is capable of efficiently indicating the faulty segments of a failed...

Dynamic Aggregation Protocol for Wireless Sensor Networks

OpenAIRE

Mounir Said , Adel; William Ibrahim , Ashraf; Soua , Ahmed; Afifi , Hossam

2013-01-01

International audience; Sensor networks suffer from limited capabilities such as bandwidth, low processing power, and memory size. There is therefore a need for protocols that deliver sensor data in an energy-efficient way to the sink. One of those techniques, it gathers sensors' data in a small size packet suitable for transmission. In this paper, we propose a new Effective Data Aggregation Protocol (DAP) to reduce the energy consumption in Wireless Sensor Networks (WSNs), which prolongs the...

Node-Dependence-Based Dynamic Incentive Algorithm in Opportunistic Networks

Directory of Open Access Journals (Sweden)

Ruiyun Yu

2014-01-01

Full Text Available Opportunistic networks lack end-to-end paths between source nodes and destination nodes, so the communications are mainly carried out by the “store-carry-forward” strategy. Selfish behaviors of rejecting packet relay requests will severely worsen the network performance. Incentive is an efficient way to reduce selfish behaviors and hence improves the reliability and robustness of the networks. In this paper, we propose the node-dependence-based dynamic gaming incentive (NDI algorithm, which exploits the dynamic repeated gaming to motivate nodes relaying packets for other nodes. The NDI algorithm presents a mechanism of tolerating selfish behaviors of nodes. Reward and punishment methods are also designed based on the node dependence degree. Simulation results show that the NDI algorithm is effective in increasing the delivery ratio and decreasing average latency when there are a lot of selfish nodes in the opportunistic networks.

On the Relevance of Using OpenWireless Sensor Networks in Environment Monitoring

Directory of Open Access Journals (Sweden)

Antoine B. Bagula

2009-06-01

Full Text Available This paper revisits the problem of the readiness for field deployments of wireless- sensor networks by assessing the relevance of using Open Hardware and Software motes for environment monitoring. We propose a new prototype wireless sensor network that finetunes SquidBee motes to improve the life-time and sensing performance of an environment monitoring system that measures temperature, humidity and luminosity. Building upon two outdoor sensing scenarios, we evaluate the performance of the newly proposed energy-aware prototype solution in terms of link quality when expressed by the Received Signal Strength, Packet Loss and the battery lifetime. The experimental results reveal the relevance of using the Open Hardware and Software motes when setting up outdoor wireless sensor networks.

Event localization in underwater wireless sensor networks using Monitoring Courses

KAUST Repository

Debont, Matthew John Robert

2012-08-01

We propose m-courses (Monitoring Courses), a novel solution to localize events in an underwater wireless sensor network. These networks consists of surface gateways and relay nodes. GPS can localize the position of surface gateways which can then distribute their locations through the network using acoustic modems. Relay nodes are deployed to remain static, but these untethered nodes may drift due to water currents, resulting in disruption of communication links. We develop a novel underwater alarm system using a cyclic graph model. In the event of link failure, a series of alarm packets are broadcast in the network. These alarms are then captured by the underwater m-courses, which can also be used to assure network connectivity and identify node failures. M-courses also allow the network to localize events and identify network issues locally before forwarding results upwards to a Surface Gateway node. This reduces communication overhead and allows for efficient management of nodes in a mobile network. Our results show that m-course routing reduces the number of sends required to report an event to a Surface Gateway by up to 80% when compared to a naïve routing implementation.

Wireless Local Area Network Performance Inside Aircraft Passenger Cabins

Science.gov (United States)

Whetten, Frank L.; Soroker, Andrew; Whetten, Dennis A.; Whetten, Frank L.; Beggs, John H.

2005-01-01

An examination of IEEE 802.11 wireless network performance within an aircraft fuselage is performed. This examination measured the propagated RF power along the length of the fuselage, and the associated network performance: the link speed, total throughput, and packet losses and errors. A total of four airplanes: one single-aisle and three twin-aisle airplanes were tested with 802.11a, 802.11b, and 802.11g networks.

Wireless, Ultra-Low-Power Implantable Sensor for Chronic Bladder Pressure Monitoring.

Science.gov (United States)

Majerus, Steve J A; Garverick, Steven L; Suster, Michael A; Fletter, Paul C; Damaser, Margot S

2012-06-01

The wireless implantable/intracavity micromanometer (WIMM) system was designed to fulfill the unmet need for a chronic bladder pressure sensing device in urological fields such as urodynamics for diagnosis and neuromodulation for bladder control. Neuromodulation in particular would benefit from a wireless bladder pressure sensor which could provide real-time pressure feedback to an implanted stimulator, resulting in greater bladder capacity while using less power. The WIMM uses custom integrated circuitry, a MEMS transducer, and a wireless antenna to transmit pressure telemetry at a rate of 10 Hz. Aggressive power management techniques yield an average current draw of 9 μ A from a 3.6-Volt micro-battery, which minimizes the implant size. Automatic pressure offset cancellation circuits maximize the sensing dynamic range to account for drifting pressure offset due to environmental factors, and a custom telemetry protocol allows transmission with minimum overhead. Wireless operation of the WIMM has demonstrated that the external receiver can receive the telemetry packets, and the low power consumption allows for at least 24 hours of operation with a 4-hour wireless recharge session.

Analysing efficiency of IPv6 packet transmission over 6LoWPAN network

Science.gov (United States)

Kozłowski, Adam; Sosnowski, Janusz

2017-08-01

Practical proliferation of Internet of Things (IoT) concept depends upon communication efficiency in the related network. In the paper we outline basic features of wireless communication protocols used in IoT and concentrate on analysing communication overheads. In particular, we discuss the impact of IPv6 packet length on 6LoWPAN network operation with physical and MAC layer defined by IEEE 802.15.4 standard. The presented analysis methodology is useful in estimation of the total goodput (throughput at the application level) and energy consumptions within the whole traffic model which are the crucial features of IoT networks.

Rotating quantum Gaussian packets

International Nuclear Information System (INIS)

Dodonov, V V

2015-01-01

We study two-dimensional quantum Gaussian packets with a fixed value of mean angular momentum. This value is the sum of two independent parts: the ‘external’ momentum related to the motion of the packet center and the ‘internal’ momentum due to quantum fluctuations. The packets minimizing the mean energy of an isotropic oscillator with the fixed mean angular momentum are found. They exist for ‘co-rotating’ external and internal motions, and they have nonzero correlation coefficients between coordinates and momenta, together with some (moderate) amount of quadrature squeezing. Variances of angular momentum and energy are calculated, too. Differences in the behavior of ‘co-rotating’ and ‘anti-rotating’ packets are shown. The time evolution of rotating Gaussian packets is analyzed, including the cases of a charge in a homogeneous magnetic field and a free particle. In the latter case, the effect of initial shrinking of packets with big enough coordinate-momentum correlation coefficients (followed by the well known expansion) is discovered. This happens due to a competition of ‘focusing’ and ‘de-focusing’ in the orthogonal directions. (paper)

Neo-Darwinism, the modern synthesis and selfish genes: are they of use in physiology?

Science.gov (United States)

Noble, Denis

2011-03-01

This article argues that the gene-centric interpretations of evolution, and more particularly the selfish gene expression of those interpretations, form barriers to the integration of physiological science with evolutionary theory. A gene-centred approach analyses the relationships between genotypes and phenotypes in terms of differences (change the genotype and observe changes in phenotype). We now know that, most frequently, this does not correctly reveal the relationships because of extensive buffering by robust networks of interactions. By contrast, understanding biological function through physiological analysis requires an integrative approach in which the activity of the proteins and RNAs formed from each DNA template is analysed in networks of interactions. These networks also include components that are not specified by nuclear DNA. Inheritance is not through DNA sequences alone. The selfish gene idea is not useful in the physiological sciences, since selfishness cannot be defined as an intrinsic property of nucleotide sequences independently of gene frequency, i.e. the 'success' in the gene pool that is supposed to be attributable to the 'selfish' property. It is not a physiologically testable hypothesis.

Towards Perpetual Energy Operation in Wireless Communication Systems

KAUST Repository

Benkhelifa, Fatma

2017-11-01

Wireless is everywhere. Smartphones, tablets, laptops, implantable medical devices, and many other wireless devices are massively taking part of our everyday activities. On average, an actively digital consumer has three devices. However, most of these wireless devices are small equipped with batteries that are often limited and need to be replaced or recharged. This fact limits the operating lifetime of wireless devices and presents a major challenge in wireless communication. To improve the perpetual energy operation of wireless communication systems, energy harvesting (EH) from the radio frequency (RF) signals is one promising solution to make the wireless communication systems self-sustaining. Since RF signals are known to transmit information, it is interesting to study when RF signals are simultaneously used to transmit information and scavenge energy, namely simultaneous wireless information and power transfer (SWIPT). In this thesis, we specifically aim to study the SWIPT in multiple-input multiple-output (MIMO) relay communication systems and in cognitive radio (CR) networks. First, we study the SWIPT in MIMO relay systems where the relay harvests the energy from the source and uses partially/fully the harvested energy to forward the signal to the destination. For both the amplify-and-forward (AF) and decode-and-forward (DF) relaying protocols, we consider the ideal scheme where both the energy and information transfer to the relay happen simultaneously, and the practical power splitting and time switching schemes. For each scheme, we aim to maximize the achievable end-to-end rate with a certain energy constraint at the relay. Furthermore, we consider the sum rate maximization problem for the multiuser MIMO DF relay broadcasting channels with multiple EH-enabled relays, and an enhanced low complex solution is proposed based on the block diagonalization method. Finally, we study the energy and data performance of the SWIPT in CR network where either the

Validation of a real-time wireless telemedicine system, using bluetooth protocol and a mobile phone, for remote monitoring patient in medical practice.

Science.gov (United States)

Yousef, Jasemian; Lars, A N

2005-06-22

This paper validates the integration of a generic real-time wireless telemedicine system utilising Global System for Mobile Communications (GSM), BLUETOOTH protocol and General Packet Radio Service (GPRS) for cellular network in clinical practice. In the first experiment, the system was tested on 24 pacemaker patients at Aalborg Hospital (Denmark), in order to see if the pacemaker implant would be affected by the system. I the second experiment, the system was tested on 15 non risky arrhythmia heart patients, in order to evaluate and validate the system application in clinical practice, for patient monitoring. Electrocardiograms were selected as the continuously monitored parameter in the present study. The results showed that the system had no negative effects on the pacemaker implants. The experiment results showed, that in a realistic environment for the patients, the system had 96.1 % up-time, 3.2 (kbps) throughput, 10(-3) (packet/s) Packet Error Rate and 10(-3) (packet/s) Packet Lost Rate. During 24 hours test the network did not respond for 57 minutes, from which 83.1 % was in the range of 0-3 minutes, 15.4 % was in the range of 3-5 minutes, and only 0.7 % of the down-time was > or = 5 and < or = 6 minutes. By a subjective evaluation, it was demonstrated that the system is applicable and the patients as well as the healthcare personals were highly confident with the system. Moreover, the patients had high degree of mobility and freedom, employing the system. In conclusion, this generic telemedicine system showed a high reliability, quality and performance, and the design can provide a basic principle for real-time wireless remote monitoring systems used in clinical practice.

Performance evaluation of spatial vector routing protocol for wireless sensor networks

International Nuclear Information System (INIS)

Baloch, J.; Jokhio, I.

2012-01-01

WSNs (Wireless Sensor Networks) is an emerging area of research. Researchers worldwide are working on the issues faced by sensor nodes. Communication has been a major issue in wireless networks and the problem is manifolds in WSN s because of the limited resources. The routing protocol in such networks plays a pivotal role, as an effective routing protocol could significantly reduce the energy consumed in transmitting and receiving data packets throughout a network. In this paper the performance of SVR (Spatial Vector Routing) an energy efficient, location aware routing protocol is compared with the existing location aware protocols. The results from the simulation trials show the performance of SVR. (author)

Performance Evaluation of Spatial Vector Routing Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Javed Ali Baloch

2012-10-01

Full Text Available WSNs (Wireless Sensor Networks is an emerging area of research. Researchers worldwide are working on the issues faced by sensor nodes. Communication has been a major issue in wireless networks and the problem is manifolds in WSNs because of the limited resources. The routing protocol in such networks plays a pivotal role, as an effective routing protocol could significantly reduce the energy consumed in transmitting and receiving data packets throughout a network. In this paper the performance of SVR (Spatial Vector Routing an energy efficient, location aware routing protocol is compared with the existing location aware protocols. The results from the simulation trials show the performance of SVR.

Congestion Control for a Fair Packet Delivery in WSN: From a Complex System Perspective

Directory of Open Access Journals (Sweden)

Daniela Aguirre-Guerrero

2014-01-01

Full Text Available In this work, we propose that packets travelling across a wireless sensor network (WSN can be seen as the active agents that make up a complex system, just like a bird flock or a fish school, for instance. From this perspective, the tools and models that have been developed to study this kind of systems have been applied. This is in order to create a distributed congestion control based on a set of simple rules programmed at the nodes of the WSN. Our results show that it is possible to adapt the carried traffic to the network capacity, even under stressing conditions. Also, the network performance shows a smooth degradation when the traffic goes beyond a threshold which is settled by the proposed self-organized control. In contrast, without any control, the network collapses before this threshold. The use of the proposed solution provides an effective strategy to address some of the common problems found in WSN deployment by providing a fair packet delivery. In addition, the network congestion is mitigated using adaptive traffic mechanisms based on a satisfaction parameter assessed by each packet which has impact on the global satisfaction of the traffic carried by the WSN.

A Multipath Routing Protocol Based on Bloom Filter for Multihop Wireless Networks

Directory of Open Access Journals (Sweden)

Junwei Jin

2016-01-01

Full Text Available On-demand multipath routing in a wireless ad hoc network is effective in achieving load balancing over the network and in improving the degree of resilience to mobility. In this paper, the salvage capable opportunistic node-disjoint multipath routing (SNMR protocol is proposed, which forms multiple routes for data transmission and supports packet salvaging with minimum overhead. The proposed mechanism constructs a primary path and a node-disjoint backup path together with alternative paths for the intermediate nodes in the primary path. It can be achieved by considering the reverse route back to the source stored in the route cache and the primary path information compressed by a Bloom filter. Our protocol presents higher capability in packet salvaging and lower overhead in forming multiple routes. Simulation results show that SNMR outperforms the compared protocols in terms of packet delivery ratio, normalized routing load, and throughput.

Adaptive Code Division Multiple Access Protocol for Wireless Network-on-Chip Architectures

Science.gov (United States)

Vijayakumaran, Vineeth

outperformed the wired counterparts and several other wireless architectures proposed in literature in terms of bandwidth and packet energy dissipation. Significant gains were observed in packet energy dissipation and bandwidth even with scaling the system to higher number of cores. Non-uniform traffic simulations showed that the proposed CDMA-WiNoC was consistent in bandwidth across all traffic patterns. It is also shown that the CDMA based MAC scheme does not introduce additional reliability concerns in data transfer over the on-chip wireless interconnects.

Insecurity of Wireless Networks

Energy Technology Data Exchange (ETDEWEB)

Sheldon, Frederick T [ORNL; Weber, John Mark [Dynetics, Inc.; Yoo, Seong-Moo [University of Alabama, Huntsville; Pan, W. David [University of Alabama, Huntsville

2012-01-01

Wireless is a powerful core technology enabling our global digital infrastructure. Wi-Fi networks are susceptible to attacks on Wired Equivalency Privacy, Wi-Fi Protected Access (WPA), and WPA2. These attack signatures can be profiled into a system that defends against such attacks on the basis of their inherent characteristics. Wi-Fi is the standard protocol for wireless networks used extensively in US critical infrastructures. Since the Wired Equivalency Privacy (WEP) security protocol was broken, the Wi-Fi Protected Access (WPA) protocol has been considered the secure alternative compatible with hardware developed for WEP. However, in November 2008, researchers developed an attack on WPA, allowing forgery of Address Resolution Protocol (ARP) packets. Subsequent enhancements have enabled ARP poisoning, cryptosystem denial of service, and man-in-the-middle attacks. Open source systems and methods (OSSM) have long been used to secure networks against such attacks. This article reviews OSSMs and the results of experimental attacks on WPA. These experiments re-created current attacks in a laboratory setting, recording both wired and wireless traffic. The article discusses methods of intrusion detection and prevention in the context of cyber physical protection of critical Internet infrastructure. The basis for this research is a specialized (and undoubtedly incomplete) taxonomy of Wi-Fi attacks and their adaptations to existing countermeasures and protocol revisions. Ultimately, this article aims to provide a clearer picture of how and why wireless protection protocols and encryption must achieve a more scientific basis for detecting and preventing such attacks.

Cellular evidence for selfish spermatogonial selection in aged human testes.

Science.gov (United States)

Maher, G J; Goriely, A; Wilkie, A O M

2014-05-01

Owing to a recent trend for delayed paternity, the genomic integrity of spermatozoa of older men has become a focus of increased interest. Older fathers are at higher risk for their children to be born with several monogenic conditions collectively termed paternal age effect (PAE) disorders, which include achondroplasia, Apert syndrome and Costello syndrome. These disorders are caused by specific mutations originating almost exclusively from the male germline, in genes encoding components of the tyrosine kinase receptor/RAS/MAPK signalling pathway. These particular mutations, occurring randomly during mitotic divisions of spermatogonial stem cells (SSCs), are predicted to confer a selective/growth advantage on the mutant SSC. This selective advantage leads to a clonal expansion of the mutant cells over time, which generates mutant spermatozoa at levels significantly above the background mutation rate. This phenomenon, termed selfish spermatogonial selection, is likely to occur in all men. In rare cases, probably because of additional mutational events, selfish spermatogonial selection may lead to spermatocytic seminoma. The studies that initially predicted the clonal nature of selfish spermatogonial selection were based on DNA analysis, rather than the visualization of mutant clones in intact testes. In a recent study that aimed to identify these clones directly, we stained serial sections of fixed testes for expression of melanoma antigen family A4 (MAGEA4), a marker of spermatogonia. A subset of seminiferous tubules with an appearance and distribution compatible with the predicted mutant clones were identified. In these tubules, termed 'immunopositive tubules', there is an increased density of spermatogonia positive for markers related to selfish selection (FGFR3) and SSC self-renewal (phosphorylated AKT). Here we detail the properties of the immunopositive tubules and how they relate to the predicted mutant clones, as well as discussing the utility of

Cancer : A reproductive strategy of "ultra-selfish" genes?

NARCIS (Netherlands)

Schuiling, GA

2004-01-01

A hypothesis is presented in which the process of "malignant transformation" which ultimately results in the rapidly dividing tumor(s)(cells) causing "cancer", is regarded as an evolved reproductive strategy of "ultra-selfish" (proto-)(onco-) genes, already present in the genome, or introduced by a

A synthetic maternal-effect selfish genetic element drives population replacement in Drosophila.

Science.gov (United States)

Chen, Chun-Hong; Huang, Haixia; Ward, Catherine M; Su, Jessica T; Schaeffer, Lorian V; Guo, Ming; Hay, Bruce A

2007-04-27

One proposed strategy for controlling the transmission of insect-borne pathogens uses a drive mechanism to ensure the rapid spread of transgenes conferring disease refractoriness throughout wild populations. Here, we report the creation of maternal-effect selfish genetic elements in Drosophila that drive population replacement and are resistant to recombination-mediated dissociation of drive and disease refractoriness functions. These selfish elements use microRNA-mediated silencing of a maternally expressed gene essential for embryogenesis, which is coupled with early zygotic expression of a rescuing transgene.

Optical packet switched networks

DEFF Research Database (Denmark)

Hansen, Peter Bukhave

1999-01-01

Optical packet switched networks are investigated with emphasis on the performance of the packet switch blocks. Initially, the network context of the optical packet switched network is described showing that a packet network will provide transparency, flexibility and bridge the granularity gap...... in interferometric wavelength converters is investigated showing that a 10 Gbit/s 19 4x4 swich blocks can be cascaded at a BER of 10-14. An analytical traffic model enables the calculation of the traffice performance of a WDM packet network. Hereby the importance of WDM and wavelegth conversion in the switch blocks...... is established as a flexible means to reduce the optical buffer, e.g., the number of fibre delay lines for a 16x16 switch block is reduced from 23 to 6 by going from 2 to 8 wavelength channels pr. inlet. Additionally, a component count analysis is carried out to illustrate the trade-offs in the switch block...

Polling-Based High-Bit-Rate Packet Transfer in a Microcellular Network to Allow Fast Terminals

Science.gov (United States)

Hoa, Phan Thanh; Lambertsen, Gaute; Yamada, Takahiko

A microcellular network will be a good candidate for the future broadband mobile network. It is expected to support high-bit-rate connection for many fast mobile users if the handover is processed fast enough to lessen its impact on QoS requirements. One of the promising techniques is believed to use for the wireless interface in such a microcellular network is the WLAN (Wireless LAN) technique due to its very high wireless channel rate. However, the less capability of mobility support of this technique must be improved to be able to expand its utilization for the microcellular environment. The reason of its less support mobility is large handover latency delay caused by contention-based handover to the new BS (base station) and delay of re-forwarding data from the old to new BS. This paper presents a proposal of multi-polling and dynamic LMC (Logical Macro Cell) to reduce mentioned above delays. Polling frame for an MT (Mobile Terminal) is sent from every BS belonging to the same LMC — a virtual single macro cell that is a multicast group of several adjacent micro-cells in which an MT is communicating. Instead of contending for the medium of a new BS during handover, the MT responds to the polling sent from that new BS to enable the transition. Because only one BS of the LMC receives the polling ACK (acknowledgement) directly from the MT, this ACK frame has to be multicast to all BSs of the same LMC through the terrestrial network to continue sending the next polling cycle at each BS. Moreover, when an MT hands over to a new cell, its current LMC is switched over to a newly corresponding LMC to prevent the future contending for a new LMC. By this way, an MT can do handover between micro-cells of an LMC smoothly because the redundant resource is reserved for it at neighboring cells, no need to contend with others. Our simulation results using the OMNeT++ simulator illustrate the performance achievements of the multi-polling and dynamic LMC scheme in eliminating

On the energy benefit of compute-and-forward on the hexagonal lattice

NARCIS (Netherlands)

Ren, Zhijie; Goseling, Jasper; Weber, Jos; Gastpar, Michael; Skoric, B.; Ignatenko, T.

2014-01-01

We study the energy benefit of applying compute-and-forward on a wireless hexagonal lattice network with multiple unicast sessions with a specific session placement. Two compute-and-forward based transmission schemes are proposed, which allow the relays to exploit both the broadcast and

Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks.

Science.gov (United States)

Saleem, Kashif; Derhab, Abdelouahid; Orgun, Mehmet A; Al-Muhtadi, Jalal; Rodrigues, Joel J P C; Khalil, Mohammed Sayim; Ali Ahmed, Adel

2016-03-31

The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP) involves an artificial immune system (AIS) that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP) that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2) and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks.

Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks

Science.gov (United States)

Saleem, Kashif; Derhab, Abdelouahid; Orgun, Mehmet A.; Al-Muhtadi, Jalal; Rodrigues, Joel J. P. C.; Khalil, Mohammed Sayim; Ali Ahmed, Adel

2016-01-01

The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP) involves an artificial immune system (AIS) that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP) that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2) and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks. PMID:27043572

Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Kashif Saleem

2016-03-01

Full Text Available The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP involves an artificial immune system (AIS that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2 and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks.

Cancer: a reproductive strategy of "ultra-selfish" genes?

Science.gov (United States)

Schuiling, G A

2004-01-01

A hypothesis is presented in which the process of "malignant transformation" which ultimately results in the rapidly dividing tumor(s)(cells) causing "cancer", is regarded as an evolved reproductive strategy of "ultra-selfish" (proto-)(onco-) genes, already present in the genome, or introduced by a virus.

Revivals of Quantum Wave Packets

OpenAIRE

Bluhm, Robert; Kostelecky, Alan; Porter, James; Tudose, Bogdan

1997-01-01

We present a generic treatment of wave-packet revivals for quantum-mechanical systems. This treatment permits a classification of certain ideal revival types. For example, wave packets for a particle in a one-dimensional box are shown to exhibit perfect revivals. We also examine the revival structure of wave packets for quantum systems with energies that depend on two quantum numbers. Wave packets in these systems exhibit quantum beats in the initial motion as well as new types of long-term r...

A Cross-Layer Duty Cycle MAC Protocol Supporting a Pipeline Feature for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Young-Chon Kim

2011-05-01

Full Text Available Although the conventional duty cycle MAC protocols for Wireless Sensor Networks (WSNs such as RMAC perform well in terms of saving energy and reducing end-to-end delivery latency, they were designed independently and require an extra routing protocol in the network layer to provide path information for the MAC layer. In this paper, we propose a new cross-layer duty cycle MAC protocol with data forwarding supporting a pipeline feature (P-MAC for WSNs. P-MAC first divides the whole network into many grades around the sink. Each node identifies its grade according to its logical hop distance to the sink and simultaneously establishes a sleep/wakeup schedule using the grade information. Those nodes in the same grade keep the same schedule, which is staggered with the schedule of the nodes in the adjacent grade. Then a variation of the RTS/CTS handshake mechanism is used to forward data continuously in a pipeline fashion from the higher grade to the lower grade nodes and finally to the sink. No extra routing overhead is needed, thus increasing the network scalability while maintaining the superiority of duty-cycling. The simulation results in OPNET show that P-MAC has better performance than S-MAC and RMAC in terms of packet delivery latency and energy efficiency.

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH.

Science.gov (United States)

Oh, Sukho; Hwang, DongYeop; Kim, Ki-Hyung; Kim, Kangseok

2018-04-16

Time Slotted Channel Hopping (TSCH) is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology.

Open-source telemedicine platform for wireless medical video communication.

Science.gov (United States)

Panayides, A; Eleftheriou, I; Pantziaris, M

2013-01-01

An m-health system for real-time wireless communication of medical video based on open-source software is presented. The objective is to deliver a low-cost telemedicine platform which will allow for reliable remote diagnosis m-health applications such as emergency incidents, mass population screening, and medical education purposes. The performance of the proposed system is demonstrated using five atherosclerotic plaque ultrasound videos. The videos are encoded at the clinically acquired resolution, in addition to lower, QCIF, and CIF resolutions, at different bitrates, and four different encoding structures. Commercially available wireless local area network (WLAN) and 3.5G high-speed packet access (HSPA) wireless channels are used to validate the developed platform. Objective video quality assessment is based on PSNR ratings, following calibration using the variable frame delay (VFD) algorithm that removes temporal mismatch between original and received videos. Clinical evaluation is based on atherosclerotic plaque ultrasound video assessment protocol. Experimental results show that adequate diagnostic quality wireless medical video communications are realized using the designed telemedicine platform. HSPA cellular networks provide for ultrasound video transmission at the acquired resolution, while VFD algorithm utilization bridges objective and subjective ratings.

Open-Source Telemedicine Platform for Wireless Medical Video Communication

Science.gov (United States)

Panayides, A.; Eleftheriou, I.; Pantziaris, M.

2013-01-01

An m-health system for real-time wireless communication of medical video based on open-source software is presented. The objective is to deliver a low-cost telemedicine platform which will allow for reliable remote diagnosis m-health applications such as emergency incidents, mass population screening, and medical education purposes. The performance of the proposed system is demonstrated using five atherosclerotic plaque ultrasound videos. The videos are encoded at the clinically acquired resolution, in addition to lower, QCIF, and CIF resolutions, at different bitrates, and four different encoding structures. Commercially available wireless local area network (WLAN) and 3.5G high-speed packet access (HSPA) wireless channels are used to validate the developed platform. Objective video quality assessment is based on PSNR ratings, following calibration using the variable frame delay (VFD) algorithm that removes temporal mismatch between original and received videos. Clinical evaluation is based on atherosclerotic plaque ultrasound video assessment protocol. Experimental results show that adequate diagnostic quality wireless medical video communications are realized using the designed telemedicine platform. HSPA cellular networks provide for ultrasound video transmission at the acquired resolution, while VFD algorithm utilization bridges objective and subjective ratings. PMID:23573082

Open-Source Telemedicine Platform for Wireless Medical Video Communication

Directory of Open Access Journals (Sweden)

A. Panayides

2013-01-01

Full Text Available An m-health system for real-time wireless communication of medical video based on open-source software is presented. The objective is to deliver a low-cost telemedicine platform which will allow for reliable remote diagnosis m-health applications such as emergency incidents, mass population screening, and medical education purposes. The performance of the proposed system is demonstrated using five atherosclerotic plaque ultrasound videos. The videos are encoded at the clinically acquired resolution, in addition to lower, QCIF, and CIF resolutions, at different bitrates, and four different encoding structures. Commercially available wireless local area network (WLAN and 3.5G high-speed packet access (HSPA wireless channels are used to validate the developed platform. Objective video quality assessment is based on PSNR ratings, following calibration using the variable frame delay (VFD algorithm that removes temporal mismatch between original and received videos. Clinical evaluation is based on atherosclerotic plaque ultrasound video assessment protocol. Experimental results show that adequate diagnostic quality wireless medical video communications are realized using the designed telemedicine platform. HSPA cellular networks provide for ultrasound video transmission at the acquired resolution, while VFD algorithm utilization bridges objective and subjective ratings.

Performance Evaluation of Beacon-Enabled Mode for IEEE 802.15.4 Wireless Sensor Network

Directory of Open Access Journals (Sweden)

M. Udin Harun Al Rasyid

2013-12-01

Full Text Available IEEE 802.15.5 standard support structure of star and peer-to-peer network formation. Strating from these, the cluster tree network can be built as a special case of peer-to-peer network to increse coverage area. In this paper, we provide an performance evaluation of beacon- enabled mode for IEEE 802.15.4 wireless sensor network on star and cluster topology in order to get the maximum result to apply the appropriate topology model as needed. We conduct analysis on each topology model by using the numbers of nodes from 10 nodes to 100 nodes to analyze throughput, delay, energy consumption, and probability success packet by using NS2 simulator. The simulation results show that the throughput and the probability of success packet of cluster topology are higher than that of star topology, and the energy consumption of cluster topology is lesser than that of star topology. However, cluster topology increases the delay more than star topology. Keywords: IEEE 802.15.4, wireless sensor network, beacon-enabled mode, topology, csma/ca

SOUNET: Self-Organized Underwater Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Hee-won Kim

2017-02-01

Full Text Available In this paper, we propose an underwater wireless sensor network (UWSN named SOUNET where sensor nodes form and maintain a tree-topological network for data gathering in a self-organized manner. After network topology discovery via packet flooding, the sensor nodes consistently update their parent node to ensure the best connectivity by referring to the timevarying neighbor tables. Such a persistent and self-adaptive method leads to high network connectivity without any centralized control, even when sensor nodes are added or unexpectedly lost. Furthermore, malfunctions that frequently happen in self-organized networks such as node isolation and closed loop are resolved in a simple way. Simulation results show that SOUNET outperforms other conventional schemes in terms of network connectivity, packet delivery ratio (PDR, and energy consumption throughout the network. In addition, we performed an experiment at the Gyeongcheon Lake in Korea using commercial underwater modems to verify that SOUNET works well in a real environment.

SOUNET: Self-Organized Underwater Wireless Sensor Network.

Science.gov (United States)

Kim, Hee-Won; Cho, Ho-Shin

2017-02-02

In this paper, we propose an underwater wireless sensor network (UWSN) named SOUNET where sensor nodes form and maintain a tree-topological network for data gathering in a self-organized manner. After network topology discovery via packet flooding, the sensor nodes consistently update their parent node to ensure the best connectivity by referring to the timevarying neighbor tables. Such a persistent and self-adaptive method leads to high network connectivity without any centralized control, even when sensor nodes are added or unexpectedly lost. Furthermore, malfunctions that frequently happen in self-organized networks such as node isolation and closed loop are resolved in a simple way. Simulation results show that SOUNET outperforms other conventional schemes in terms of network connectivity, packet delivery ratio (PDR), and energy consumption throughout the network. In addition, we performed an experiment at the Gyeongcheon Lake in Korea using commercial underwater modems to verify that SOUNET works well in a real environment.

MWAHCA: a multimedia wireless ad hoc cluster architecture.

Science.gov (United States)

Diaz, Juan R; Lloret, Jaime; Jimenez, Jose M; Sendra, Sandra

2014-01-01

Wireless Ad hoc networks provide a flexible and adaptable infrastructure to transport data over a great variety of environments. Recently, real-time audio and video data transmission has been increased due to the appearance of many multimedia applications. One of the major challenges is to ensure the quality of multimedia streams when they have passed through a wireless ad hoc network. It requires adapting the network architecture to the multimedia QoS requirements. In this paper we propose a new architecture to organize and manage cluster-based ad hoc networks in order to provide multimedia streams. Proposed architecture adapts the network wireless topology in order to improve the quality of audio and video transmissions. In order to achieve this goal, the architecture uses some information such as each node's capacity and the QoS parameters (bandwidth, delay, jitter, and packet loss). The architecture splits the network into clusters which are specialized in specific multimedia traffic. The real system performance study provided at the end of the paper will demonstrate the feasibility of the proposal.

MWAHCA: A Multimedia Wireless Ad Hoc Cluster Architecture

Directory of Open Access Journals (Sweden)

Juan R. Diaz

2014-01-01

Full Text Available Wireless Ad hoc networks provide a flexible and adaptable infrastructure to transport data over a great variety of environments. Recently, real-time audio and video data transmission has been increased due to the appearance of many multimedia applications. One of the major challenges is to ensure the quality of multimedia streams when they have passed through a wireless ad hoc network. It requires adapting the network architecture to the multimedia QoS requirements. In this paper we propose a new architecture to organize and manage cluster-based ad hoc networks in order to provide multimedia streams. Proposed architecture adapts the network wireless topology in order to improve the quality of audio and video transmissions. In order to achieve this goal, the architecture uses some information such as each node’s capacity and the QoS parameters (bandwidth, delay, jitter, and packet loss. The architecture splits the network into clusters which are specialized in specific multimedia traffic. The real system performance study provided at the end of the paper will demonstrate the feasibility of the proposal.

Effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks

Science.gov (United States)

Jiang, Zhong-Yuan; Ma, Jian-Feng

Existing routing strategies such as the global dynamic routing [X. Ling, M. B. Hu, R. Jiang and Q. S. Wu, Phys. Rev. E 81, 016113 (2010)] can achieve very high traffic capacity at the cost of extremely long packet traveling delay. In many real complex networks, especially for real-time applications such as the instant communication software, extremely long packet traveling time is unacceptable. In this work, we propose to assign a finite Time-to-Live (TTL) parameter for each packet. To guarantee every packet to arrive at its destination within its TTL, we assume that a packet is retransmitted by its source once its TTL expires. We employ source routing mechanisms in the traffic model to avoid the routing-flaps induced by the global dynamic routing. We compose extensive simulations to verify our proposed mechanisms. With small TTL, the effects of packet retransmission on network traffic capacity are obvious, and the phase transition from flow free state to congested state occurs. For the purpose of reducing the computation frequency of the routing table, we employ a computing cycle Tc within which the routing table is recomputed once. The simulation results show that the traffic capacity decreases with increasing Tc. Our work provides a good insight into the understanding of effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks.

An Underlay Communication Channel for 5G Cognitive Mesh Networks: Packet Design, Implementation, Analysis, and Experimental Results

Energy Technology Data Exchange (ETDEWEB)

Tarek Haddadin; Stephen Andrew Laraway; Arslan Majid; Taylor Sibbett; Daryl Leon Wasden; Brandon F Lo; Lloyd Landon; David Couch; Hussein Moradi; Behrouz Farhang-Boroujeny

2016-04-01

This paper proposes and presents the design and implementation of an underlay communication channel (UCC) for 5G cognitive mesh networks. The UCC builds its waveform based on filter bank multicarrier spread spectrum (FB-MCSS) signaling. The use of this novel spread spectrum signaling allows the device-to-device (D2D) user equipments (UEs) to communicate at a level well below noise temperature and hence, minimize taxation on macro-cell/small-cell base stations and their UEs in 5G wireless systems. Moreover, the use of filter banks allows us to avoid those portions of the spectrum that are in use by macro-cell and small-cell users. Hence, both D2D-to-cellular and cellular-to-D2D interference will be very close to none. We propose a specific packet for UCC and develop algorithms for packet detection, timing acquisition and tracking, as well as channel estimation and equalization. We also present the detail of an implementation of the proposed transceiver on a software radio platform and compare our experimental results with those from a theoretical analysis of our packet detection algorithm.

On securing wireless sensor network--novel authentication scheme against DOS attacks.

Science.gov (United States)

Raja, K Nirmal; Beno, M Marsaline

2014-10-01

Wireless sensor networks are generally deployed for collecting data from various environments. Several applications specific sensor network cryptography algorithms have been proposed in research. However WSN's has many constrictions, including low computation capability, less memory, limited energy resources, vulnerability to physical capture, which enforce unique security challenges needs to make a lot of improvements. This paper presents a novel security mechanism and algorithm for wireless sensor network security and also an application of this algorithm. The proposed scheme is given to strong authentication against Denial of Service Attacks (DOS). The scheme is simulated using network simulator2 (NS2). Then this scheme is analyzed based on the network packet delivery ratio and found that throughput has improved.

Packet Tracer network simulator

CERN Document Server

Jesin, A

2014-01-01

A practical, fast-paced guide that gives you all the information you need to successfully create networks and simulate them using Packet Tracer.Packet Tracer Network Simulator is aimed at students, instructors, and network administrators who wish to use this simulator to learn how to perform networking instead of investing in expensive, specialized hardware. This book assumes that you have a good amount of Cisco networking knowledge, and it will focus more on Packet Tracer rather than networking.

Link Investigation of IEEE 802.15.4 Wireless Sensor Networks in Forests.

Science.gov (United States)

Ding, Xingjian; Sun, Guodong; Yang, Gaoxiang; Shang, Xinna

2016-06-27

Wireless sensor networks are expected to automatically monitor the ecological evolution and wildlife habits in forests. Low-power links (transceivers) are often adopted in wireless sensor network applications, in order to save the precious sensor energy and then achieve long-term, unattended monitoring. Recent research has presented some performance characteristics of such low-power wireless links under laboratory or outdoor scenarios with less obstacles, and they have found that low-power wireless links are unreliable and prone to be affected by the target environment. However, there is still less understanding about how well the low-power wireless link performs in real-world forests and to what extent the complex in-forest surrounding environments affect the link performances. In this paper, we empirically evaluate the low-power links of wireless sensors in three typical different forest environments. Our experiment investigates the performance of the link layer compatible with the IEEE 802.15.4 standard and analyzes the variation patterns of the packet reception ratio (PRR), the received signal strength indicator (RSSI) and the link quality indicator (LQI) under diverse experimental settings. Some observations of this study are inconsistent with or even contradict prior results that are achieved in open fields or relatively clean environments and thus, provide new insights both into effectively evaluating the low-power wireless links and into efficiently deploying wireless sensor network systems in forest environments.

Wireless Sensor/Actuator Network Design for Mobile Control Applications

Directory of Open Access Journals (Sweden)

Youxian Sung

2007-10-01

Full Text Available Wireless sensor/actuator networks (WSANs are emerging as a new generationof sensor networks. Serving as the backbone of control applications, WSANs will enablean unprecedented degree of distributed and mobile control. However, the unreliability ofwireless communications and the real-time requirements of control applications raise greatchallenges for WSAN design. With emphasis on the reliability issue, this paper presents anapplication-level design methodology for WSANs in mobile control applications. Thesolution is generic in that it is independent of the underlying platforms, environment,control system models, and controller design. To capture the link quality characteristics interms of packet loss rate, experiments are conducted on a real WSAN system. From theexperimental observations, a simple yet efficient method is proposed to deal withunpredictable packet loss on actuator nodes. Trace-based simulations give promisingresults, which demonstrate the effectiveness of the proposed approach.

A new method for improving security in MANETs AODV Protocol

Directory of Open Access Journals (Sweden)

Zahra Alishahi

2012-10-01

Full Text Available In mobile ad hoc network (MANET, secure communication is more challenging task due to its fundamental characteristics like having less infrastructure, wireless link, distributed cooperation, dynamic topology, lack of association, resource constrained and physical vulnerability of node. In MANET, attacks can be broadly classified in two categories: routing attacks and data forwarding attacks. Any action not following rules of routing protocols belongs to routing attacks. The main objective of routing attacks is to disrupt normal functioning of network by advertising false routing updates. On the other hand, data forwarding attacks include actions such as modification or dropping data packet, which does not disrupt routing protocol. In this paper, we address the “Packet Drop Attack”, which is a serious threat to operational mobile ad hoc networks. The consequence of not forwarding other packets or dropping other packets prevents any kind of communication to be established in the network. Therefore, there is a need to address the packet dropping event takes higher priority for the mobile ad hoc networks to emerge and to operate, successfully. In this paper, we propose a method to secure ad hoc on-demand distance vector (AODV routing protocol. The proposed method provides security for routing packets where the malicious node acts as a black-hole and drops packets. In this method, the collaboration of a group of nodes is used to make accurate decisions. Validating received RREPs allows the source to select trusted path to its destination. The simulation results show that the proposed mechanism is able to detect any number of attackers.

Coordination of Regenerative Relays and Direct Users in Wireless Cellular Networks

DEFF Research Database (Denmark)

Thai, Chan; Popovski, Petar

2011-01-01

The area of wireless cooperation/relaying has recently been significantly enriched by the ideas of wireless network coding (NC), which bring substantial gains in spectral efficiency. These gains have mainly been demonstrated in scenarios with two-way relaying. Inspired by the ideas of wireless NC......, recently we have proposed techniques for coordinated direct/relay (CDR) transmissions. These techniques embrace the interference among the communication flows to/from direct and relayed users, leveraging on the fact that the interference can be subsequently canceled. Hence, by allowing simultaneous...... transmissions, spectral efficiency is increased. In our prior work, we have considered CDR with non-regenerative relay that uses Amplify-and-Forward (AF). In this paper we consider the case of regenerative Decode-and-Forward (DF) relay. This refers also to joint decoding of the interfering flows received over...

Nondispersive Wave Packets.

Science.gov (United States)

Shaarawi, Amr Mohamed

In this work, nondispersive wavepacket solutions to linear partial differential equations are investigated. These solutions are characterized by infinite energy content; otherwise they are continuous, nonsingular and propagate in free space without spreading out. Examples of such solutions are Berry and Balazs' Airy packet, MacKinnon's wave packet and Brittingham's Focus Wave Mode (FWM). It is demonstrated in this thesis that the infinite energy content is not a basic problem per se and that it can be dealt with in two distinct ways. First these wave packets can be used as bases to construct highly localized, slowly decaying, time-limited pulsed solutions. In the case of the FWMs, this path leads to the formulation of the bidirectional representation, a technique that provides the most natural basis for synthesizing Brittingham-like solutions. This representation is used to derive new exact solutions to the 3-D scalar wave equation. It is also applied to problems involving boundaries, in particular to the propagation of a localized pulse in a infinite acoustic waveguide and to the launchability of such a pulse from the opening of a semi-infinite waveguide. The second approach in dealing with the infinite energy content utilizes the bump-like structure of nondispersive solutions. With an appropriate choice of parameters, these bump fields have very large amplitudes around the centers, in comparison to their tails. In particular, the FWM solutions are used to model massless particles and are capable of providing an interesting interpretation to the results of Young's two slit experiment and to the wave-particle duality of light. The bidirectional representation provides, also, a systematic way of deriving packet solutions to the Klein-Gordon, the Schrodinger and the Dirac equations. Nondispersive solutions of the former two equations are compared to previously derived ones, e.g., the Airy packet and MacKinnon's wave packet.

Scattering of accelerated wave packets

Science.gov (United States)

Longhi, S.; Horsley, S. A. R.; Della Valle, G.

2018-03-01

Wave-packet scattering from a stationary potential is significantly modified when the wave packet is subject to an external time-dependent force during the interaction. In the semiclassical limit, wave-packet motion is simply described by Newtonian equations, and the external force can, for example, cancel the potential force, making a potential barrier transparent. Here we consider wave-packet scattering from reflectionless potentials, where in general the potential becomes reflective when probed by an accelerated wave packet. In the particular case of the recently introduced class of complex Kramers-Kronig potentials we show that a broad class of time-dependent forces can be applied without inducing any scattering, while there is a breakdown of the reflectionless property when there is a broadband distribution of initial particle momentum, involving both positive and negative components.

Directional MAC approach for wireless body area networks.

Science.gov (United States)

Hussain, Md Asdaque; Alam, Md Nasre; Kwak, Kyung Sup

2011-01-01

Wireless Body Area Networks (WBANs) designed for medical, sports, and entertainment applications, have drawn the attention of academia and industry alike. A WBAN is a special purpose network, designed to operate autonomously to connect various medical sensors and appliances, located inside and/or outside of a human body. This network enables physicians to remotely monitor vital signs of patients and provide real time feedback for medical diagnosis and consultations. The WBAN system can offer two significant advantages: patient mobility due to their use of portable monitoring devices and a location independent monitoring facility. With its appealing dimensions, it brings about a new set of challenges, which we do not normally consider in such small sensor networks. It requires a scalable network in terms of heterogeneous data traffic, low power consumption of sensor nodes, integration in and around the body networking and coexistence. This work presents a medium access control protocol for WBAN which tries to overcome the aforementioned challenges. We consider the use of multiple beam adaptive arrays (MBAA) at BAN Coordinator (BAN_C) node. When used as a BAN_C, an MBAA can successfully receive two or more overlapping packets at the same time. Each beam captures a different packet by automatically pointing its pattern toward one packet while annulling other contending packets. This paper describes how an MBAA can be integrated into a single hope star topology as a BAN_C. Simulation results show the performance of our proposed protocol.

Directional MAC Approach for Wireless Body Area Networks

Directory of Open Access Journals (Sweden)

Md. Asdaque Hussain

2011-01-01

Full Text Available Wireless Body Area Networks (WBANs designed for medical, sports, and entertainment applications, have drawn the attention of academia and industry alike. A WBAN is a special purpose network, designed to operate autonomously to connect various medical sensors and appliances, located inside and/or outside of a human body. This network enables physicians to remotely monitor vital signs of patients and provide real time feedback for medical diagnosis and consultations. The WBAN system can offer two significant advantages: patient mobility due to their use of portable monitoring devices and a location independent monitoring facility. With its appealing dimensions, it brings about a new set of challenges, which we do not normally consider in such small sensor networks. It requires a scalable network in terms of heterogeneous data traffic, low power consumption of sensor nodes, integration in and around the body networking and coexistence. This work presents a medium access control protocol for WBAN which tries to overcome the aforementioned challenges. We consider the use of multiple beam adaptive arrays (MBAA at BAN Coordinator (BAN_C node. When used as a BAN_C, an MBAA can successfully receive two or more overlapping packets at the same time. Each beam captures a different packet by automatically pointing its pattern toward one packet while annulling other contending packets. This paper describes how an MBAA can be integrated into a single hope star topology as a BAN_C. Simulation results show the performance of our proposed protocol.

Modified weighted fair queuing for packet scheduling in mobile WiMAX networks

Science.gov (United States)

Satrya, Gandeva B.; Brotoharsono, Tri

2013-03-01

The increase of user mobility and the need for data access anytime also increases the interest in broadband wireless access (BWA). The best available quality of experience for mobile data service users are assured for IEEE 802.16e based users. The main problem of assuring a high QOS value is how to allocate available resources among users in order to meet the QOS requirement for criteria such as delay, throughput, packet loss and fairness. There is no specific standard scheduling mechanism stated by IEEE standards, which leaves it for implementer differentiation. There are five QOS service classes defined by IEEE 802.16: Unsolicited Grant Scheme (UGS), Extended Real Time Polling Service (ertPS), Real Time Polling Service (rtPS), Non Real Time Polling Service (nrtPS) and Best Effort Service (BE). Each class has different QOS parameter requirements for throughput and delay/jitter constraints. This paper proposes Modified Weighted Fair Queuing (MWFQ) scheduling scenario which was based on Weighted Round Robin (WRR) and Weighted Fair Queuing (WFQ). The performance of MWFQ was assessed by using above five QoS criteria. The simulation shows that using the concept of total packet size calculation improves the network's performance.

To overhear or not to overhear: a dilemma between network coding gain and energy consumption in multi-hop wireless networks

OpenAIRE

Javan, Nastooh Taheri; Sabaei, Masoud; Dehghan, Mehdi

2018-01-01

Any properly designed network coding technique can result in increased throughput and reliability of multi-hop wireless networks by taking advantage of the broadcast nature of wireless medium. In many inter-flow network coding schemes nodes are encouraged to overhear neighbours traffic in order to improve coding opportunities at the transmitter nodes. A study of these schemes reveal that some of the overheard packets are not useful for coding operation and thus this forced overhearing increas...

Popular science - common ground. A literary critique of Richard Dawkins's The Selfish Gene

OpenAIRE

Nilsen, Helene

2012-01-01

This thesis aims to perform a literary reading of Richard Dawkins's The Selfish Gene from a perspective situated outside of the 'battle of the two cultures'. Chapter 1 takes Foucault's article What is an author?" as its point of departure. After discussing how Dawkins may be seen as a reader of Darwin, I will go on to discuss Foucault's concept of the author-function, before I move on to consider some different readings of and approaches to The Selfish Gene. With reference to a polemic bet...

DRDT: distributed and reliable data transmission with cooperative nodes for lossy wireless sensor networks.

Science.gov (United States)

Seo, Jaewan; Kim, Moonseong; Hur, In; Choi, Wook; Choo, Hyunseung

2010-01-01

Recent studies have shown that in realistic wireless sensor network environments links are extremely unreliable. To recover from corrupted packets, most routing schemes with an assumption of ideal radio environments use a retransmission mechanism, which may cause unnecessary retransmissions. Therefore, guaranteeing energy-efficient reliable data transmission is a fundamental routing issue in wireless sensor networks. However, it is not encouraged to propose a new reliable routing scheme in the sense that every existing routing scheme cannot be replaced with the new one. This paper proposes a Distributed and Reliable Data Transmission (DRDT) scheme with a goal to efficiently guarantee reliable data transmission. In particular, this is based on a pluggable modular approach so that it can be extended to existing routing schemes. DRDT offers reliable data transmission using neighbor nodes, i.e., helper nodes. A helper node is selected among the neighbor nodes of the receiver node which overhear the data packet in a distributed manner. DRDT effectively reduces the number of retransmissions by delegating the retransmission task from the sender node to the helper node that has higher link quality to the receiver node when the data packet reception fails due to the low link quality between the sender and the receiver nodes. Comprehensive simulation results show that DRDT improves end-to-end transmission cost by up to about 45% and reduces its delay by about 40% compared to existing schemes.

DRDT: Distributed and Reliable Data Transmission with Cooperative Nodes for LossyWireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jaewan Seo

2010-03-01

Full Text Available Recent studies have shown that in realistic wireless sensor network environments links are extremely unreliable. To recover from corrupted packets, most routing schemes with an assumption of ideal radio environments use a retransmission mechanism, which may cause unnecessary retransmissions. Therefore, guaranteeing energy-efficient reliable data transmission is a fundamental routing issue in wireless sensor networks. However, it is not encouraged to propose a new reliable routing scheme in the sense that every existing routing scheme cannot be replaced with the new one. This paper proposes a Distributed and Reliable Data Transmission (DRDT scheme with a goal to efficiently guarantee reliable data transmission. In particular, this is based on a pluggable modular approach so that it can be extended to existing routing schemes. DRDT offers reliable data transmission using neighbor nodes, i.e., helper nodes. A helper node is selected among the neighbor nodes of the receiver node which overhear the data packet in a distributed manner. DRDT effectively reduces the number of retransmissions by delegating the retransmission task from the sender node to the helper node that has higher link quality to the receiver node when the data packet reception fails due to the low link quality between the sender and the receiver nodes. Comprehensive simulation results show that DRDT improves end-to-end transmission cost by up to about 45% and reduces its delay by about 40% compared to existing schemes.

SD-EAR: Energy Aware Routing in Software Defined Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Anuradha Banerjee

2018-06-01

Full Text Available In today’s internet-of-things (IoT environment, wireless sensor networks (WSNs have many advantages, with broad applications in different areas including environmental monitoring, maintaining security, etc. However, high energy depletion may lead to node failures in WSNs. In most WSNs, nodes deplete energy mainly because of the flooding and broadcasting of route-request (RREQ packets, which is essential for route discovery in WSNs. The present article models wireless sensor networks as software-defined wireless sensor networks (SD-WSNs where the network is divided into multiple clusters or zones, and each zone is controlled by a software-defined network (SDN controller. The SDN controller is aware of the topology of each zone, and finds out the optimum energy efficient path from any source to any destination inside the zone. For destinations outside of the zone, the SDN controller of the source zone instructs the source to send a message to all of the peripheral nodes in that zone, so that they can forward the message to the peripheral nodes in other zones, and the process goes on until a destination is found. As far as energy-efficient path selection is concerned, the SDN controller of a zone is aware of the connectivity and residual energy of each node. Therefore, it is capable of discovering an optimum energy efficient path from any source to any destination inside as well as outside of the zone of the source. Accordingly, flow tables in different routers are updated dynamically. The task of route discovery is shifted from individual nodes to controllers, and as a result, the flooding of route-requests is completely eliminated. Software-defined energy aware routing (SD-EARalso proposes an innovative sleeping strategy where exhausted nodes are allowed to go to sleep through a sleep request—sleep grant mechanism. All of these result in huge energy savings in SD-WSN, as shown in the simulation results.

Key Management for Secure Multicast over IPv6 Wireless Networks

Directory of Open Access Journals (Sweden)

Siddiqi Mohammad Umar

2006-01-01

Full Text Available Multicasting is an efficient method for transmission and routing of packets to multiple destinations using fewer network resources. Along with widespread deployment of wireless networks, secure multicast over wireless networks is an important and challenging goal. In this paper, we extend the scope of a recent new key distribution scheme to a security framework that offers a novel solution for secure multicast over IPv6 wireless networks. Our key management framework includes two scenarios for securely distributing the group key and rekey messages for joining and leaving a mobile host in secure multicast group. In addition, we perform the security analysis and provide performance comparisons between our approach and two recently published scenarios. The benefits of our proposed techniques are that they minimize the number of transmissions required to rekey the multicast group and impose minimal storage requirements on the multicast group. In addition, our proposed schemes are also very desirable from the viewpoint of transmission bandwidth savings since an efficient rekeying mechanism is provided for membership changes and they significantly reduce the required bandwidth due to key updating in mobile networks. Moreover, they achieve the security and scalability requirements in wireless networks.

A Reliable Handoff Mechanism for Mobile Industrial Wireless Sensor Networks.

Science.gov (United States)

Ma, Jian; Yang, Dong; Zhang, Hongke; Gidlund, Mikael

2017-08-04

With the prevalence of low-power wireless devices in industrial applications, concerns about timeliness and reliability are bound to continue despite the best efforts of researchers to design Industrial Wireless Sensor Networks (IWSNs) to improve the performance of monitoring and control systems. As mobile devices have a major role to play in industrial production, IWSNs should support mobility. However, research on mobile IWSNs and practical tests have been limited due to the complicated resource scheduling and rescheduling compared with traditional wireless sensor networks. This paper proposes an effective mechanism to guarantee the performance of handoff, including a mobility-aware scheme, temporary connection and quick registration. The main contribution of this paper is that the proposed mechanism is implemented not only in our testbed but in a real industrial environment. The results indicate that our mechanism not only improves the accuracy of handoff triggering, but also solves the problem of ping-pong effect during handoff. Compared with the WirelessHART standard and the RSSI-based approach, our mechanism facilitates real-time communication while being more reliable, which can help end-to-end packet delivery remain an average of 98.5% in the scenario of mobile IWSNs.

New hybrid reverse differential pulse position width modulation scheme for wireless optical communication

Science.gov (United States)

Liao, Renbo; Liu, Hongzhan; Qiao, Yaojun

2014-05-01

In order to improve the power efficiency and reduce the packet error rate of reverse differential pulse position modulation (RDPPM) for wireless optical communication (WOC), a hybrid reverse differential pulse position width modulation (RDPPWM) scheme is proposed, based on RDPPM and reverse pulse width modulation. Subsequently, the symbol structure of RDPPWM is briefly analyzed, and its performance is compared with that of other modulation schemes in terms of average transmitted power, bandwidth requirement, and packet error rate over ideal additive white Gaussian noise (AWGN) channels. Based on the given model, the simulation results show that the proposed modulation scheme has the advantages of improving the power efficiency and reducing the bandwidth requirement. Moreover, in terms of error probability performance, RDPPWM can achieve a much lower packet error rate than that of RDPPM. For example, at the same received signal power of -28 dBm, the packet error rate of RDPPWM can decrease to 2.6×10-12, while that of RDPPM is 2.2×10. Furthermore, RDPPWM does not need symbol synchronization at the receiving end. These considerations make RDPPWM a favorable candidate to select as the modulation scheme in the WOC systems.

Duplication of Key Frames of Video Streams in Wireless Networks

OpenAIRE

Sagatov, Evgeny S.; Sukhov, Andrei M.

2011-01-01

In this paper technological solutions for improving the quality of video transfer along wireless networks are investigated. Tools have been developed to allow packets to be duplicated with key frames data. In the paper we tested video streams with duplication of all frames, with duplication of key frames, and without duplication. The experiments showed that the best results are obtained by duplication of packages which contain key frames. The paper also provides an overview of the coefficient...

Data Aggregation and Packet Bundling of Uplink Small Packets for Monitoring Applications in LTE

DEFF Research Database (Denmark)

Kim, Dong Min; Sørensen, René Brandborg; Mahmood, Kashif

2017-01-01

topic. In this article we analyze the deployment scenarios in which aggregators can perform cellular access on behalf of multiple MTC devices. We study the effect of packet bundling at the aggregator, which alleviates overhead and resource waste when sending small packets. The aggregators give rise...... of aggregators and packet bundle size. Our results show that, in general, data aggregation can benefit the uplink massive MTC in LTE by reducing the signaling overhead....

Technology Corner: Internet Packet Sniffers

Directory of Open Access Journals (Sweden)

Nick Flor

2011-03-01

Full Text Available A packet sniffer is a piece of software that allows a person to eavesdrop on computer communications over the internet.  A packet sniffer can be used as a diagnostic tool by network administrators or as a spying tool by hackers who can use it to steal passwords and other private information from computer users.  Whether you are a network administrator or information assurance specialist, it helps to have a detailed understanding of how packet sniffers work.  And one of the best ways to acquire such an understanding is to build and modify an actual packet sniffer.

Receiver-Assisted Congestion Control to Achieve High Throughput in Lossy Wireless Networks

Science.gov (United States)

Shi, Kai; Shu, Yantai; Yang, Oliver; Luo, Jiarong

2010-04-01

Many applications would require fast data transfer in high-speed wireless networks nowadays. However, due to its conservative congestion control algorithm, Transmission Control Protocol (TCP) cannot effectively utilize the network capacity in lossy wireless networks. In this paper, we propose a receiver-assisted congestion control mechanism (RACC) in which the sender performs loss-based control, while the receiver is performing delay-based control. The receiver measures the network bandwidth based on the packet interarrival interval and uses it to compute a congestion window size deemed appropriate for the sender. After receiving the advertised value feedback from the receiver, the sender then uses the additive increase and multiplicative decrease (AIMD) mechanism to compute the correct congestion window size to be used. By integrating the loss-based and the delay-based congestion controls, our mechanism can mitigate the effect of wireless losses, alleviate the timeout effect, and therefore make better use of network bandwidth. Simulation and experiment results in various scenarios show that our mechanism can outperform conventional TCP in high-speed and lossy wireless environments.

Decentralized control of transmission rates in energy-critical wireless networks

KAUST Repository

Xia, Li

2013-06-01

In this paper, we discuss the decentralized optimization of delay and energy consumption in a multi-hop wireless network. The goal is to minimize the energy consumption of energy-critical nodes and the overall packet transmission delay of the network. The transmission rates of energy-critical nodes are adjustable according to the local information of nodes, i.e., the length of packets queued. The multi-hop network is modeled as a queueing network.We prove that the system performance is monotone w.r.t. (with respect to) the transmission rate, thus the “bang-bang” control is an optimal control. We also prove that there exists a threshold type control policy which is optimal. We propose a decentralized algorithm to control transmission rates of these energy-critical nodes. Some simulation experiments are conducted to demonstrate the effectiveness of our approach.

Decentralized control of transmission rates in energy-critical wireless networks

KAUST Repository

Xia, Li; Shihada, Basem

2013-01-01

In this paper, we discuss the decentralized optimization of delay and energy consumption in a multi-hop wireless network. The goal is to minimize the energy consumption of energy-critical nodes and the overall packet transmission delay of the network. The transmission rates of energy-critical nodes are adjustable according to the local information of nodes, i.e., the length of packets queued. The multi-hop network is modeled as a queueing network.We prove that the system performance is monotone w.r.t. (with respect to) the transmission rate, thus the “bang-bang” control is an optimal control. We also prove that there exists a threshold type control policy which is optimal. We propose a decentralized algorithm to control transmission rates of these energy-critical nodes. Some simulation experiments are conducted to demonstrate the effectiveness of our approach.

IEEE 802.11 Wireless LANs: Performance Analysis and Protocol Refinement

Directory of Open Access Journals (Sweden)

Chatzimisios P.

2005-01-01

Full Text Available The IEEE 802.11 protocol is emerging as a widely used standard and has become the most mature technology for wireless local area networks (WLANs. In this paper, we focus on the tuning of the IEEE 802.11 protocol parameters taking into consideration, in addition to throughput efficiency, performance metrics such as the average packet delay, the probability of a packet being discarded when it reaches the maximum retransmission limit, the average time to drop a packet, and the packet interarrival time. We present an analysis, which has been validated by simulation that is based on a Markov chain model commonly used in the literature. We further study the improvement on these performance metrics by employing suitable protocol parameters according to the specific communication needs of the IEEE 802.11 protocol for both basic access and RTS/CTS access schemes. We show that the use of a higher initial contention window size does not considerably degrade performance in small networks and performs significantly better in any other scenario. Moreover, we conclude that the combination of a lower maximum contention window size and a higher retry limit considerably improves performance. Results indicate that the appropriate adjustment of the protocol parameters enhances performance and improves the services that the IEEE 802.11 protocol provides to various communication applications.

Quantum wave packet revivals

International Nuclear Information System (INIS)

Robinett, R.W.

2004-01-01

The numerical prediction, theoretical analysis, and experimental verification of the phenomenon of wave packet revivals in quantum systems has flourished over the last decade and a half. Quantum revivals are characterized by initially localized quantum states which have a short-term, quasi-classical time evolution, which then can spread significantly over several orbits, only to reform later in the form of a quantum revival in which the spreading reverses itself, the wave packet relocalizes, and the semi-classical periodicity is once again evident. Relocalization of the initial wave packet into a number of smaller copies of the initial packet ('minipackets' or 'clones') is also possible, giving rise to fractional revivals. Systems exhibiting such behavior are a fundamental realization of time-dependent interference phenomena for bound states with quantized energies in quantum mechanics and are therefore of wide interest in the physics and chemistry communities. We review the theoretical machinery of quantum wave packet construction leading to the existence of revivals and fractional revivals, in systems with one (or more) quantum number(s), as well as discussing how information on the classical period and revival time is encoded in the energy eigenvalue spectrum. We discuss a number of one-dimensional model systems which exhibit revival behavior, including the infinite well, the quantum bouncer, and others, as well as several two-dimensional integrable quantum billiard systems. Finally, we briefly review the experimental evidence for wave packet revivals in atomic, molecular, and other systems, and related revival phenomena in condensed matter and optical systems

Low latency adaptive streaming of HD H.264 video over 802.11 wireless networks with cross-layer feedback

Science.gov (United States)

Patti, Andrew; Tan, Wai-tian; Shen, Bo

2007-09-01

Streaming video in consumer homes over wireless IEEE 802.11 networks is becoming commonplace. Wireless 802.11 networks pose unique difficulties for streaming high definition (HD), low latency video due to their error-prone physical layer and media access procedures which were not designed for real-time traffic. HD video streaming, even with sophisticated H.264 encoding, is particularly challenging due to the large number of packet fragments per slice. Cross-layer design strategies have been proposed to address the issues of video streaming over 802.11. These designs increase streaming robustness by imposing some degree of monitoring and control over 802.11 parameters from application level, or by making the 802.11 layer media-aware. Important contributions are made, but none of the existing approaches directly take the 802.11 queuing into account. In this paper we take a different approach and propose a cross-layer design allowing direct, expedient control over the wireless packet queue, while obtaining timely feedback on transmission status for each packet in a media flow. This method can be fully implemented on a media sender with no explicit support or changes required to the media client. We assume that due to congestion or deteriorating signal-to-noise levels, the available throughput may drop substantially for extended periods of time, and thus propose video source adaptation methods that allow matching the bit-rate to available throughput. A particular H.264 slice encoding is presented to enable seamless stream switching between streams at multiple bit-rates, and we explore using new computationally efficient transcoding methods when only a high bit-rate stream is available.

Simultaneous Wireless Information and Power Transfer for MIMO Amplify-and-Forward Relay Systems

KAUST Repository

Benkhelifa, Fatma

2016-03-28

© 2015 IEEE. In this paper, we investigate two-hop Multiple- Input Multiple-Output (MIMO) Amplify-and-Forward (AF) relay communication systems with simultaneous wireless information and power transfer (SWIPT) at the multi-antenna energy harvesting relay. We derive the optimal source and relay covariance matrices to characterize the achievable region between the source-destination rate and the harvested energy at the relay, namely Rate-Energy (R-E) region. In this context, we consider the ideal scenario where the energy harvester (EH) receiver and the information decoder (ID) receiver at the relay can simultaneously decode the information and harvest the energy at the relay. This scheme provides an outer bound for the achievable R-E region since practical energy harvesting circuits are not yet able to harvest the energy and decode the information simultaneously. Then, we consider more practical schemes which are the power splitting (PS) and the time switching (TS) proposed in [1] and which separate the EH and ID transfer over the power domain and the time domain, respectively. In our study, we derive the boundary of the achievable R- E region and we show the effect of the source transmit power, the relay transmit power and the position of the relay between the source and the destination on the achievable R-E region for the ideal scenario and the two practical schemes.

Dense Clustered Multi-Channel Wireless Sensor Cloud

Directory of Open Access Journals (Sweden)

Sivaramakrishnan Sivakumar

2015-08-01

Full Text Available Dense Wireless Sensor Network Clouds have an inherent issue of latency and packet drops with regards to data collection. Though there is extensive literature that tries to address these issues through either scheduling, channel contention or a combination of the two, the problem still largely exists. In this paper, a Clustered Multi-Channel Scheduling Protocol (CMSP is designed that creates a Voronoi partition of a dense network. Each partition is assigned a channel, and a scheduling scheme is adopted to collect data within the Voronoi partitions. This scheme collects data from the partitions concurrently and then passes it to the base station. CMSP is compared using simulation with other multi-channel protocols like Tree-based Multi-Channel, Multi-Channel MAC and Multi-frequency Media Access Control for wireless sensor networks. Results indicate CMSP has higher throughput and data delivery ratio at a lower power consumption due to network partitioning and hierarchical scheduling that minimizes load on the network.

Enabling Cognitive Load-Aware AR with Rateless Coding on a Wearable Network

Directory of Open Access Journals (Sweden)

R. Razavi

2008-01-01

Full Text Available Augmented reality (AR on a head-mounted display is conveniently supported by a wearable wireless network. If, in addition, the AR display is moderated to take account of the cognitive load of the wearer, then additional biosensors form part of the network. In this paper, the impact of these additional traffic sources is assessed. Rateless coding is proposed to not only protect the fragile encoded video stream from wireless noise and interference but also to reduce coding overhead. The paper proposes a block-based form of rateless channel coding in which the unit of coding is a block within a packet. The contribution of this paper is that it minimizes energy consumption by reducing the overhead from forward error correction (FEC, while error correction properties are conserved. Compared to simple packet-based rateless coding, with this form of block-based coding, data loss is reduced and energy efficiency is improved. Cross-layer organization of piggy-backed response blocks must take place in response to feedback, as detailed in the paper. Compared also to variants of its default FEC scheme, results from a Bluetooth (IEEE 802.15.1 wireless network show a consistent improvement in energy consumption, packet arrival latency, and video quality at the AR display.

Network coding at different layers in wireless networks

CERN Document Server

2016-01-01

This book focuses on how to apply network coding at different layers in wireless networks – including MAC, routing, and TCP – with special focus on cognitive radio networks. It discusses how to select parameters in network coding (e.g., coding field, number of packets involved, and redundant information ration) in order to be suitable for the varying wireless environments. The book explores how to deploy network coding in MAC to improve network performance and examines joint network coding with opportunistic routing to improve the successful rate of routing. In regards to TCP and network coding, the text considers transport layer protocol working with network coding to overcome the transmission error rate, particularly with how to use the ACK feedback of TCP to enhance the efficiency of network coding. The book pertains to researchers and postgraduate students, especially whose interests are in opportunistic routing and TCP in cognitive radio networks.

A Power Balance Aware Wireless Charger Deployment Method for Complete Coverage in Wireless Rechargeable Sensor Networks

Directory of Open Access Journals (Sweden)

Tu-Liang Lin

2016-08-01

Full Text Available Traditional sensor nodes are usually battery powered, and the limited battery power constrains the overall lifespan of the sensors. Recently, wireless power transmission technology has been applied in wireless sensor networks (WSNs to transmit wireless power from the chargers to the sensor nodes and solve the limited battery power problem. The combination of wireless sensors and wireless chargers forms a new type of network called wireless rechargeable sensor networks (WRSNs. In this research, we focus on how to effectively deploy chargers to maximize the lifespan of a network. In WSNs, the sensor nodes near the sink consume more power than nodes far away from the sink because of frequent data forwarding. This important power unbalanced factor has not been considered, however, in previous charger deployment research. In this research, a power balance aware deployment (PBAD method is proposed to address the power unbalance in WRSNs and to design the charger deployment with maximum charging efficiency. The proposed deployment method is effectively aware of the existence of the sink node that would cause unbalanced power consumption in WRSNs. The simulation results show that the proposed PBAD algorithm performs better than other deployment methods, and fewer chargers are deployed as a result.

The Selfish Brain: Stress and Eating Behavior

Directory of Open Access Journals (Sweden)

Achim ePeters

2011-05-01

Full Text Available The brain occupies a special hierarchical position in human energy metabolism. If cerebral homeostasis is threatened, the brain behaves in a "selfish" manner by competing for energy resources with the body. Here we present a logistic approach, which is based on the principles of supply and demand known from economics. In this "cerebral supply chain" model, the brain constitutes the final consumer. In order to illustrate the operating mode of the cerebral supply chain, we take experimental data which allow to assess the supply, demand and need of the brain under conditions of psychosocial stress. The experimental results show that the brain under conditions of psychosocial stress actively demands energy from the body, in order to cover its increased energy needs. The data demonstrate that the stressed brain uses a mechanism referred to as "cerebral insulin suppression" to limit glucose fluxes into peripheral tissue (muscle, fat and to enhance cerebral glucose supply. Furthermore psychosocial stress elicits a marked increase in eating behavior in the post-stress phase. Subjects ingested more carbohydrates without any preference for sweet ingredients. These experimentally observed changes of cerebral demand, supply and need are integrated into a logistic framework describing the supply chain of the selfish brain.

Performance Evaluation of Wireless Sensor Networks for Event-Detection with Shadowing-Induced Radio Irregularities

Directory of Open Access Journals (Sweden)

Giuseppe De Marco

2007-01-01

Full Text Available In this paper, we study a particular application of wireless sensor networks for event-detection and tracking. In this kind of application, the transport of data is simplified, and guaranteeing a minimum number of packets at the monitoring node is the only constraint on the performance of the sensor network. This minimum number of packets is called event-reliability. Contrary to other studies on the subject, here we consider the behavior of such a network in presence of a realistic radio model, such as the shadowing of the radio signal. With this setting, we extend our previous analysis of the event-reliability approach for the transport of data. In particular, both regular and random networks are considered. The contribute of this work is to show via simulations that, in the presence of randomness or irregularities in the radio channel, the event-reliability can be jeopardized, that is the constraint on the minimum number of packets at the sink node could not be satisfied.

Selfish strategies and honest signalling: reproductive conflicts in ant queen associations

DEFF Research Database (Denmark)

Holman, Luke; Dreier, Stephanie; d'Ettorre, Patrizia

2010-01-01

Social insects offer unique opportunities to test predictions regarding the evolution of cooperation, life histories and communication. Colony founding by groups of unrelated queens, some of which are later killed, may select for selfish reproductive strategies, honest signalling and punishment....... Here, we use a brood transfer experiment to test whether cofounding queens of the ant Lasius niger 'selfishly' adjust their productivity when sharing the nest with future competitors. We simultaneously analysed queen cuticular hydrocarbon (CHC) profiles to investigate whether queens honestly signal...... correlated with reproductive maturation, and to a lesser extent with productivity; the same hydrocarbons were more abundant on queens that were not killed, suggesting that workers select productive queens using these chemical cues. Our results highlight the role of honest signalling in the evolution...

Wireless communication technologies in distribution automation

Energy Technology Data Exchange (ETDEWEB)

Takala, J. [VTT Energy, Espoo (Finland)

1996-12-31

The project examines four different wireless communication technologies: GSM short message service, NMT data calls, packet radio network, Autonet (Actionet) status message service. The targets for communication include: energy measurement, especially in the de-regulated electricity market, secondary sub-station control, fault indicators. The research concentrates on the usability of different communication technologies for different purposes. Data about response times, error rates, retry times, communication delays, costs etc. will be collected for each communication technology and comparative results will be obtained. Some field experiments and demonstrations will be made in energy measurement and distribution network remote control. The project is divided in four tasks. Each task is described briefly

Wireless communication technologies in distribution automation

Energy Technology Data Exchange (ETDEWEB)

Takala, J [VTT Energy, Espoo (Finland)

1997-12-31

The project examines four different wireless communication technologies: GSM short message service, NMT data calls, packet radio network, Autonet (Actionet) status message service. The targets for communication include: energy measurement, especially in the de-regulated electricity market, secondary sub-station control, fault indicators. The research concentrates on the usability of different communication technologies for different purposes. Data about response times, error rates, retry times, communication delays, costs etc. will be collected for each communication technology and comparative results will be obtained. Some field experiments and demonstrations will be made in energy measurement and distribution network remote control. The project is divided in four tasks. Each task is described briefly

Performance and energy efficiency in wireless self-organized networks

Energy Technology Data Exchange (ETDEWEB)

Gao, C.

2009-07-01

Self-organized packet radio networks (ad-hoc networks) and wireless sensor networks have got massive attention recently. One of critical problems in such networks is the energy efficiency, because wireless nodes are usually powered by battery. Energy efficiency design can dramatically increase the survivability and stability of wireless ad-hoc/sensor networks. In this thesis the energy efficiency has been considered at different protocol layers for wireless ad-hoc/sensor networks. The energy consumption of wireless nodes is inspected at the physical layer and MAC layer. At the network layer, some current routing protocols are compared and special attention has been paid to reactive routing protocols. A minimum hop analysis is given and according to the analysis result, a modification of AODV routing is proposed. A variation of transmit power can be also applied to clustering algorithm, which is believed to be able to control the scalability of network. Clustering a network can also improve the energy efficiency. We offer a clustering scheme based on the link state measurement and variation of transmit power of intra-cluster and inter-cluster transmission. Simulation shows that it can achieve both targets. In association with the clustering algorithm, a global synchronization scheme is proposed to increase the efficiency of clustering algorithm. The research attention has been also paid to self-organization for multi-hop cellular networks. A 2-hop 2-slot uplink proposal to infrastructure-based cellular networks. The proposed solution can significantly increase the throughput of uplink communication and reduce the energy consumption of wireless terminals. (orig.)

OPNET Modeler simulations of performance for multi nodes wireless systems

Directory of Open Access Journals (Sweden)

Krupanek Beata

2016-01-01

Full Text Available Paper presents a study under the Quality of Service in modern wireless sensor networks. Such a networks are characterized by small amount of data transmitted in fixed periods. Very often this data must by transmitted in real time so data transmission delays should be well known. This article shows multimode network simulated in packet OPNET Modeler. Also nowadays the quality of services is very important especially in multi-nodes systems such a home automation or measurement systems.

Social insects: from selfish genes to self organisation and beyond

DEFF Research Database (Denmark)

Boomsma, Jacobus Jan; Franks, Nigel R.

2006-01-01

Selfish gene and self-organisation approaches have revolutionised the study of social insects and have provided unparalleled insights into the highly sophisticated nature of insect social evolution. Here, we briefly review the core programs and interfaces with communication and recognition studies...

On the Coded Packet Relay Network in the Presence of Neighbors:Benefits of Speaking in a Crowded Room

OpenAIRE

Khamfroush, Hana; Pahlevani, Peyman; Roetter, Daniel Enrique Lucani; Hundebøll, Martin; Fitzek, Frank

2014-01-01

This paper studies the problem of optimal use of a relay for reducing the transmission time of data packets from a source to a destination using network coding. More importantly, we address an effect that is typically overlooked in previous studies: the presence of active transmitting nodes in the neighborhood of such devices, which is typical in wireless mesh networks. We show that in systems with a fair medium access control mechanism (MAC), the use of a relay in a crowded medium brings for...

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH

Directory of Open Access Journals (Sweden)

Sukho Oh

2018-04-01

Full Text Available Time Slotted Channel Hopping (TSCH is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology.

A Selfish Constraint Satisfaction Genetic Algorithms for Planning a Long-Distance Transportation Network

Science.gov (United States)

Onoyama, Takashi; Maekawa, Takuya; Kubota, Sen; Tsuruta, Setuso; Komoda, Norihisa

To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints are imposed on this type of problem. To solve these strict-constraint problems, a selfish constraint satisfaction genetic algorithm (GA) is proposed. In this GA, each gene of an individual satisfies only its constraint selfishly, disregarding the constraints of other genes in the same individuals. Moreover, a constraint pre-checking method is also applied to improve the GA convergence speed. The experimental result shows the proposed method can obtain an accurate solution in a practical response time.

The 'selfish brain' is regulated by aquaporins and autophagy under nutrient deprivation.

Science.gov (United States)

Ye, Qiao; Wu, Yonghong; Gao, Yan; Li, Zhihui; Li, Weiguang; Zhang, Chenggang

2016-05-01

The brain maintains its mass and physiological functional capacity compared with other organs under harsh conditions such as starvation, a mechanism termed the 'selfish brain' theory. To further investigate this phenomenon, mice were examined following water and/or food deprivation. Although the body weights of the mice, the weight of the organs except the brain and blood glucose levels were significantly reduced in the absence of water and/or food, the brain weight maintained its original state. Furthermore, no significant differences in the water content of the brain or its energy balance were observed when the mice were subjected to water and/or food deprivation. To further investigate the mechanism underlying the brain maintenance of water and substance homeostasis, the expression levels of aquaporins (AQPs) and autophagy‑specific protein long‑chain protein 3 (LC3) were examined. During the process of water and food deprivation, no significant differences in the transcriptional levels of AQPs were observed. However, autophagy activity levels were initially stimulated, then suppressed in a time‑dependent manner. LC3 and AQPs have important roles for the survival of the brain under conditions of food and water deprivation, which provided further understanding of the mechanism underlying the 'selfish brain' phenomenon. Although not involved in the energy regulation of the 'selfish brain', AQPs were observed to have important roles in water and food deprivation, specifically with regards to the control of water content. Additionally, the brain exhibits an 'unselfish strategy' using autophagy during water and/or food deprivation. The present study furthered current understanding of the 'selfish brain' theory, and identified additional regulating target genes of AQPs and autophagy, with the aim of providing a basis for the prevention of nutrient shortage in humans and animals.

Delay-aware adaptive sleep mechanism for green wireless-optical broadband access networks

Science.gov (United States)

Wang, Ruyan; Liang, Alei; Wu, Dapeng; Wu, Dalei

2017-07-01

Wireless-Optical Broadband Access Network (WOBAN) is capacity-high, reliable, flexible, and ubiquitous, as it takes full advantage of the merits from both optical communication and wireless communication technologies. Similar to other access networks, the high energy consumption poses a great challenge for building up WOBANs. To shot this problem, we can make some load-light Optical Network Units (ONUs) sleep to reduce the energy consumption. Such operation, however, causes the increased packet delay. Jointly considering the energy consumption and transmission delay, we propose a delay-aware adaptive sleep mechanism. Specifically, we develop a new analytical method to evaluate the transmission delay and queuing delay over the optical part, instead of adopting M/M/1 queuing model. Meanwhile, we also analyze the access delay and queuing delay of the wireless part. Based on such developed delay models, we mathematically derive ONU's optimal sleep time. In addition, we provide numerous simulation results to show the effectiveness of the proposed mechanism.

Study on distributed re-clustering algorithm for moblie wireless sensor networks

Directory of Open Access Journals (Sweden)

XU Chaojie

2016-04-01

Full Text Available In mobile wireless sensor networks,node mobility influences the topology of the hierarchically clustered network,thus affects packet delivery ratio and energy consumption of communications in clusters.To reduce the influence of node mobility,a distributed re-clustering algorithm is proposed in this paper.In this algorithm,basing on the clustered network,nodes estimate their current locations with particle algorithm and predict the most possible locations of next time basing on the mobility model.Each boundary node of a cluster periodically estimates the need for re-clustering and re-cluster itself to the optimal cluster through communicating with the cluster headers when needed.The simulation results indicate that,with small re-clustering periods,the proposed algorithm can be effective to keep appropriate communication distance and outperforms existing schemes on packet delivery ratio and energy consumption.

Three-dimensional electromagnetic strong turbulence. II. Wave packet collapse and structure of wave packets during strong turbulence

International Nuclear Information System (INIS)

Graham, D. B.; Robinson, P. A.; Cairns, Iver H.; Skjaeraasen, O.

2011-01-01

Large-scale simulations of wave packet collapse are performed by numerically solving the three-dimensional (3D) electromagnetic Zakharov equations, focusing on individual wave packet collapses and on wave packets that form in continuously driven strong turbulence. The collapse threshold is shown to decrease as the electron thermal speed ν e /c increases and as the temperature ratio T i /T e of ions to electrons decreases. Energy lost during wave packet collapse and dissipation is shown to depend on ν e /c. The dynamics of density perturbations after collapse are studied in 3D electromagnetic strong turbulence for a range of T i /T e . The structures of the Langmuir, transverse, and total electric field components of wave packets during strong turbulence are investigated over a range of ν e /c. For ν e /c e /c > or approx. 0.17, transverse modes become trapped in density wells and contribute significantly to the structure of the total electric field. At all ν e /c, the Langmuir energy density contours of wave packets are predominantly oblate (pancake shaped). The transverse energy density contours of wave packets are predominantly prolate (sausage shaped), with the major axis being perpendicular to the major axes of the Langmuir component. This results in the wave packet becoming more nearly spherical as ν e /c increases, and in turn generates more spherical density wells during collapse. The results obtained are compared with previous 3D electrostatic results and 2D electromagnetic results.

Feasibility of Optical Packet Switched WDM Networks without Packet Synchronisation Under Bursty Traffic Conditions

DEFF Research Database (Denmark)

Fjelde, Tina; Hansen, Peter Bukhave; Kloch, Allan

1999-01-01

We show that complex packet synchronisation may be avoided in optical packetswitched networks. Detailed traffic analysis demonstrates that packet lossratios of 1e-10 are feasible under bursty traffic conditions for a highcapacity network consisting of asynchronously operated add-drop switch...

Scalable and Media Aware Adaptive Video Streaming over Wireless Networks

Directory of Open Access Journals (Sweden)

Béatrice Pesquet-Popescu

2008-07-01

Full Text Available This paper proposes an advanced video streaming system based on scalable video coding in order to optimize resource utilization in wireless networks with retransmission mechanisms at radio protocol level. The key component of this system is a packet scheduling algorithm which operates on the different substreams of a main scalable video stream and which is implemented in a so-called media aware network element. The concerned type of transport channel is a dedicated channel subject to parameters (bitrate, loss rate variations on the long run. Moreover, we propose a combined scalability approach in which common temporal and SNR scalability features can be used jointly with a partitioning of the image into regions of interest. Simulation results show that our approach provides substantial quality gain compared to classical packet transmission methods and they demonstrate how ROI coding combined with SNR scalability allows to improve again the visual quality.

On the theory of wave packets

International Nuclear Information System (INIS)

Naumov, D.V.

2013-01-01

In this paper we discuss some aspects of the theory of wave packets. We consider a popular non-covariant Gaussian model used in various applications and show that it predicts too slow a longitudinal dispersion rate for relativistic particles. We revise this approach by considering a covariant model of Gaussian wave packets, and examine our results by inspecting a wave packet of an arbitrary form. A general formula for the time dependence of the dispersion of a wave packet of an arbitrary form is found. Finally, we give a transparent interpretation of the disappearance of the wave function over time due to the dispersion - a feature often considered undesirable, but which is unavoidable for wave packets. We find, starting with simple examples, proceeding with their generalizations and finally by considering the continuity equation, that the integral over time of both the flux and probability densities is asymptotically proportional to the factor 1/|x| 2 in the rest frame of the wave packet, just as in the case of an ensemble of classical particles

Reliable Communication in Wireless Meshed Networks using Network Coding

DEFF Research Database (Denmark)

Pahlevani, Peyman; Paramanathan, Achuthan; Hundebøll, Martin

2012-01-01

The advantages of network coding have been extensively studied in the field of wireless networks. Integrating network coding with existing IEEE 802.11 MAC layer is a challenging problem. The IEEE 802.11 MAC does not provide any reliability mechanisms for overheard packets. This paper addresses...... this problem and suggests different mechanisms to support reliability as part of the MAC protocol. Analytical expressions to this problem are given to qualify the performance of the modified network coding. These expressions are confirmed by numerical result. While the suggested reliability mechanisms...

OFDM Scheme Based on Wavelet Packet Transform-OrientedGraded Multi-Service

Institute of Scientific and Technical Information of China (English)

赵慧; 侯春萍

2003-01-01

In this paper, a concept of image grading transmission is put forward to enhance data rate and to improve the usage of subcarriers in orthogonal frequency division multiplexing (OFDM). The idea originates from the wavelet packets representative of an image in which information is graded in terms of different priorities. The graded image facilitates more efficient use of adaptive subcarriers and bits allocation. The results of simulation in typical mobile environment prove that the output signal noise ratio (SNR) of the graded image excels that of the ungraded image by 1-2 dB under the same channel condition.

Design of Packet-Based Block Codes with Shift Operators

Directory of Open Access Journals (Sweden)

Ilow Jacek

2010-01-01

Full Text Available This paper introduces packet-oriented block codes for the recovery of lost packets and the correction of an erroneous single packet. Specifically, a family of systematic codes is proposed, based on a Vandermonde matrix applied to a group of information packets to construct redundant packets, where the elements of the Vandermonde matrix are bit-level right arithmetic shift operators. The code design is applicable to packets of any size, provided that the packets within a block of information packets are of uniform length. In order to decrease the overhead associated with packet padding using shift operators, non-Vandermonde matrices are also proposed for designing packet-oriented block codes. An efficient matrix inversion procedure for the off-line design of the decoding algorithm is presented to recover lost packets. The error correction capability of the design is investigated as well. The decoding algorithm, based on syndrome decoding, to correct a single erroneous packet in a group of received packets is presented. The paper is equipped with examples of codes using different parameters. The code designs and their performance are tested using Monte Carlo simulations; the results obtained exhibit good agreement with the corresponding theoretical results.

A Design of Wireless Sensor Networks for a Power Quality Monitoring System

Directory of Open Access Journals (Sweden)

Sanggil Kang

2010-11-01

Full Text Available Power grids deal with the business of generation, transmission, and distribution of electric power. Recently, interest in power quality in electrical distribution systems has increased rapidly. In Korea, the communication network to deliver voltage, current, and temperature measurements gathered from pole transformers to remote monitoring centers employs cellular mobile technology. Due to high cost of the cellular mobile technology, power quality monitoring measurements are limited and data gathering intervals are large. This causes difficulties in providing the power quality monitoring service. To alleviate the problems, in this paper we present a communication infrastructure to provide low cost, reliable data delivery. The communication infrastructure consists of wired connections between substations and monitoring centers, and wireless connections between pole transformers and substations. For the wireless connection, we employ a wireless sensor network and design its corresponding data forwarding protocol to improve the quality of data delivery. For the design, we adopt a tree-based data forwarding protocol in order to customize the distribution pattern of the power quality information. We verify the performance of the proposed data forwarding protocol quantitatively using the NS-2 network simulator.

A design of wireless sensor networks for a power quality monitoring system.

Science.gov (United States)

Lim, Yujin; Kim, Hak-Man; Kang, Sanggil

2010-01-01

Power grids deal with the business of generation, transmission, and distribution of electric power. Recently, interest in power quality in electrical distribution systems has increased rapidly. In Korea, the communication network to deliver voltage, current, and temperature measurements gathered from pole transformers to remote monitoring centers employs cellular mobile technology. Due to high cost of the cellular mobile technology, power quality monitoring measurements are limited and data gathering intervals are large. This causes difficulties in providing the power quality monitoring service. To alleviate the problems, in this paper we present a communication infrastructure to provide low cost, reliable data delivery. The communication infrastructure consists of wired connections between substations and monitoring centers, and wireless connections between pole transformers and substations. For the wireless connection, we employ a wireless sensor network and design its corresponding data forwarding protocol to improve the quality of data delivery. For the design, we adopt a tree-based data forwarding protocol in order to customize the distribution pattern of the power quality information. We verify the performance of the proposed data forwarding protocol quantitatively using the NS-2 network simulator.

Selfish goals serve more fundamental social and biological goals.

Science.gov (United States)

Becker, D Vaughn; Kenrick, Douglas T

2014-04-01

Proximate selfish goals reflect the machinations of more fundamental goals such as self-protection and reproduction. Evolutionary life history theory allows us to make predictions about which goals are prioritized over others, which stimuli release which goals, and how the stages of cognitive processing are selectively influenced to better achieve the aims of those goals.

The games economists play: Why economics students behave more selfishly than other students.

Directory of Open Access Journals (Sweden)

Philipp Gerlach

Full Text Available Do economics students behave more selfishly than other students? Experiments involving monetary allocations suggest so. This article investigates the underlying motives for the economic students' more selfish behavior by separating three potential explanatory mechanisms: economics students are less concerned with fairness when making allocation decisions; have a different notion of what is fair in allocations; or are more skeptical about other people's allocations, which in turn makes them less willing to comply with a shared fairness norm. The three mechanisms were tested by inviting students from various disciplines to participate in a relatively novel experimental game and asking all participants to give reasons for their choices. Compared with students of other disciplines, economics students were about equally likely to mention fairness in their comments; had a similar notion of what was fair in the situation; however, they expected lower offers, made lower offers, and were less willing to enforce compliance with a fair allocation at a cost to themselves. The economics students' lower expectations mediated their allocation decisions, suggesting that economics students behaved more selfishly because they expected others not to comply with the shared fairness norm.

Design of Packet-Based Block Codes with Shift Operators

Directory of Open Access Journals (Sweden)

Jacek Ilow

2010-01-01

Full Text Available This paper introduces packet-oriented block codes for the recovery of lost packets and the correction of an erroneous single packet. Specifically, a family of systematic codes is proposed, based on a Vandermonde matrix applied to a group of k information packets to construct r redundant packets, where the elements of the Vandermonde matrix are bit-level right arithmetic shift operators. The code design is applicable to packets of any size, provided that the packets within a block of k information packets are of uniform length. In order to decrease the overhead associated with packet padding using shift operators, non-Vandermonde matrices are also proposed for designing packet-oriented block codes. An efficient matrix inversion procedure for the off-line design of the decoding algorithm is presented to recover lost packets. The error correction capability of the design is investigated as well. The decoding algorithm, based on syndrome decoding, to correct a single erroneous packet in a group of n=k+r received packets is presented. The paper is equipped with examples of codes using different parameters. The code designs and their performance are tested using Monte Carlo simulations; the results obtained exhibit good agreement with the corresponding theoretical results.

Path Calculation and Packet Translation for UAV Surveillance in Support of Wireless Sensor Networks

Science.gov (United States)

2006-09-01

Servomechanism,” 2006). The Unicorn and MMALV have different servo arrangements due to the dissimilarity of their steering mechanisms. (2...15. NUMBER OF PAGES 191 14. SUBJECT TERMS Wireless Sensor Network, Contact Interception, Mote, MMALV, Unicorn , Kestrel Autopilot System...26 1. Procerus Unicorn ..............................................................................26 a. Physical

Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit

DEFF Research Database (Denmark)

Nagahara, Masaaki; Quevedo, Daniel; Østergaard, Jan

2012-01-01

We study packetized predictive control, known to be robust against packet dropouts in networked systems. To obtain sparse packets for rate-limited networks, we design control packets via an ℓ0 optimization, which can be eectively solved by orthogonal matching pursuit. Our formulation ensures...

Confirmation of Maslow’s Hypothesis of Synergy: Developing an Acceptance of Selfishness at the Workplace Scale

Directory of Open Access Journals (Sweden)

Jiro Takaki

2016-04-01

Full Text Available This study aimed to develop a new Acceptance of Selfishness at the Workplace Scale (ASWS and to confirm Maslow’s hypothesis of synergy: if both a sense of contribution and acceptance of selfishness at the workplace are high, workers are psychologically healthy. In a cross-sectional study with employees of three Japanese companies, 656 workers answered a self-administered questionnaire on paper completely (response rate = 66.8%. Each questionnaire was submitted to us in a sealed envelope and analyzed. The ASWS indicated high internal consistency (Cronbach’s alpha = 0.86. Significant (p < 0.001 positive moderate correlations between ASWS scores and job control scores support the ASWS’s convergent and discriminant validity. Significant (p < 0.001 associations of ASWS scores with psychological distress and work engagement supported the ASWS’s criterion validity. In short, ASWS was a psychometrically satisfactory measure. Significant (p < 0.05 interactions between a sense of contribution and acceptance of selfishness at the workplace in linear regression models showed that when those two factors are low, psychological distress becomes high. However, when a sense of contribution and acceptance of selfishness are high, work engagement also becomes high. Thus, Maslow’s hypothesis of synergy was confirmed.

Suicide and the selfish gene.

Science.gov (United States)

Satora, Leszek

2005-01-01

The application of an evolutionary perspective to human behaviour generates philosophical, political and scientific controversy. Modern human symbolic consciousness is not the cumulation of the long trend that natural selection would predict. The new archaeological data suggested the anatomical and behavioural innovation has been episodic and rare separated by long periods of stagnate. New behavioural mode and the new skeletal structure of modem human arose as an incidental exaptation. Additionally the genetic basis dysfunction connected with suicide behaviour and growing statistic suicide among teenager is contradictory to the theory that our behaviour are programmed in any detail by selfish genes. In this cases genetically determined suicidal behaviour should be rapidly eliminated by natural selection.

Hop limited epidemic-like information spreading in mobile social networks with selfish nodes

Science.gov (United States)

Wu, Yahui; Deng, Su; Huang, Hongbin

2013-07-01

Similar to epidemics, information can be transmitted directly among users in mobile social networks. Different from epidemics, we can control the spreading process by adjusting the corresponding parameters (e.g., hop count) directly. This paper proposes a theoretical model to evaluate the performance of an epidemic-like spreading algorithm, in which the maximal hop count of the information is limited. In addition, our model can be used to evaluate the impact of users’ selfish behavior. Simulations show the accuracy of our theoretical model. Numerical results show that the information hop count can have an important impact. In addition, the impact of selfish behavior is related to the information hop count.

Hop limited epidemic-like information spreading in mobile social networks with selfish nodes

International Nuclear Information System (INIS)

Wu, Yahui; Deng, Su; Huang, Hongbin

2013-01-01

Similar to epidemics, information can be transmitted directly among users in mobile social networks. Different from epidemics, we can control the spreading process by adjusting the corresponding parameters (e.g., hop count) directly. This paper proposes a theoretical model to evaluate the performance of an epidemic-like spreading algorithm, in which the maximal hop count of the information is limited. In addition, our model can be used to evaluate the impact of users’ selfish behavior. Simulations show the accuracy of our theoretical model. Numerical results show that the information hop count can have an important impact. In addition, the impact of selfish behavior is related to the information hop count. (paper)

On the cost/delay tradeoff of wireless delay tolerant geographic routing

OpenAIRE

Tasiopoulos, Argyrios; Tsiaras, Christos; Toumpis, Stavros

2012-01-01

In Delay Tolerant Networks (DTNs), there is a fundamental tradeoff between the aggregate transport cost of a packet and the delay in its delivery. We study this tradeoff in the context of geographical routing in wireless DTNs.We ?rst specify the optimal cost/delay tradeoff, i.e., the tradeoff under optimal network operation, using a dynamic network construction termed the Cost/Delay Evolving Graph (C/DEG) and the Optimal Cost/Delay Curve (OC/DC), a function that gives the minimum possible agg...

Network Coded Cooperative Communication in a Real-Time Wireless Hospital Sensor Network.

Science.gov (United States)

Prakash, R; Balaji Ganesh, A; Sivabalan, Somu

2017-05-01

The paper presents a network coded cooperative communication (NC-CC) enabled wireless hospital sensor network architecture for monitoring health as well as postural activities of a patient. A wearable device, referred as a smartband is interfaced with pulse rate, body temperature sensors and an accelerometer along with wireless protocol services, such as Bluetooth and Radio-Frequency transceiver and Wi-Fi. The energy efficiency of wearable device is improved by embedding a linear acceleration based transmission duty cycling algorithm (NC-DRDC). The real-time demonstration is carried-out in a hospital environment to evaluate the performance characteristics, such as power spectral density, energy consumption, signal to noise ratio, packet delivery ratio and transmission offset. The resource sharing and energy efficiency features of network coding technique are improved by proposing an algorithm referred as network coding based dynamic retransmit/rebroadcast decision control (LA-TDC). From the experimental results, it is observed that the proposed LA-TDC algorithm reduces network traffic and end-to-end delay by an average of 27.8% and 21.6%, respectively than traditional network coded wireless transmission. The wireless architecture is deployed in a hospital environment and results are then successfully validated.

An Outline of Data Aggregation Security in Heterogeneous Wireless Sensor Networks.

Science.gov (United States)

Boubiche, Sabrina; Boubiche, Djallel Eddine; Bilami, Azzedine; Toral-Cruz, Homero

2016-04-12

Data aggregation processes aim to reduce the amount of exchanged data in wireless sensor networks and consequently minimize the packet overhead and optimize energy efficiency. Securing the data aggregation process is a real challenge since the aggregation nodes must access the relayed data to apply the aggregation functions. The data aggregation security problem has been widely addressed in classical homogeneous wireless sensor networks, however, most of the proposed security protocols cannot guarantee a high level of security since the sensor node resources are limited. Heterogeneous wireless sensor networks have recently emerged as a new wireless sensor network category which expands the sensor nodes' resources and capabilities. These new kinds of WSNs have opened new research opportunities where security represents a most attractive area. Indeed, robust and high security level algorithms can be used to secure the data aggregation at the heterogeneous aggregation nodes which is impossible in classical homogeneous WSNs. Contrary to the homogeneous sensor networks, the data aggregation security problem is still not sufficiently covered and the proposed data aggregation security protocols are numberless. To address this recent research area, this paper describes the data aggregation security problem in heterogeneous wireless sensor networks and surveys a few proposed security protocols. A classification and evaluation of the existing protocols is also introduced based on the adopted data aggregation security approach.

An Outline of Data Aggregation Security in Heterogeneous Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Sabrina Boubiche

2016-04-01

Full Text Available Data aggregation processes aim to reduce the amount of exchanged data in wireless sensor networks and consequently minimize the packet overhead and optimize energy efficiency. Securing the data aggregation process is a real challenge since the aggregation nodes must access the relayed data to apply the aggregation functions. The data aggregation security problem has been widely addressed in classical homogeneous wireless sensor networks, however, most of the proposed security protocols cannot guarantee a high level of security since the sensor node resources are limited. Heterogeneous wireless sensor networks have recently emerged as a new wireless sensor network category which expands the sensor nodes’ resources and capabilities. These new kinds of WSNs have opened new research opportunities where security represents a most attractive area. Indeed, robust and high security level algorithms can be used to secure the data aggregation at the heterogeneous aggregation nodes which is impossible in classical homogeneous WSNs. Contrary to the homogeneous sensor networks, the data aggregation security problem is still not sufficiently covered and the proposed data aggregation security protocols are numberless. To address this recent research area, this paper describes the data aggregation security problem in heterogeneous wireless sensor networks and surveys a few proposed security protocols. A classification and evaluation of the existing protocols is also introduced based on the adopted data aggregation security approach.

An Outline of Data Aggregation Security in Heterogeneous Wireless Sensor Networks

Science.gov (United States)

Boubiche, Sabrina; Boubiche, Djallel Eddine; Bilami, Azzedine; Toral-Cruz, Homero

2016-01-01

Data aggregation processes aim to reduce the amount of exchanged data in wireless sensor networks and consequently minimize the packet overhead and optimize energy efficiency. Securing the data aggregation process is a real challenge since the aggregation nodes must access the relayed data to apply the aggregation functions. The data aggregation security problem has been widely addressed in classical homogeneous wireless sensor networks, however, most of the proposed security protocols cannot guarantee a high level of security since the sensor node resources are limited. Heterogeneous wireless sensor networks have recently emerged as a new wireless sensor network category which expands the sensor nodes’ resources and capabilities. These new kinds of WSNs have opened new research opportunities where security represents a most attractive area. Indeed, robust and high security level algorithms can be used to secure the data aggregation at the heterogeneous aggregation nodes which is impossible in classical homogeneous WSNs. Contrary to the homogeneous sensor networks, the data aggregation security problem is still not sufficiently covered and the proposed data aggregation security protocols are numberless. To address this recent research area, this paper describes the data aggregation security problem in heterogeneous wireless sensor networks and surveys a few proposed security protocols. A classification and evaluation of the existing protocols is also introduced based on the adopted data aggregation security approach. PMID:27077866

A Wireless and Real-Time Monitoring System Design for Car Networking Applications

Directory of Open Access Journals (Sweden)

Li Wenjun

2013-01-01

Full Text Available We described a wireless and monitoring system to obtain several classes of vehicle data and send them to the server via General Packet Radio Service (GPRS in real-time. These data are consisted by on-board diagnostic (OBD which get from the vehicle’s OBD interface, Tire-Pressure Monitoring system (TPMS and Global Positioning System (GPS. The main content of this paper is the hardware design of the system, especially RF modules and antennas.

A global optimization algorithm inspired in the behavior of selfish herds.

Science.gov (United States)

Fausto, Fernando; Cuevas, Erik; Valdivia, Arturo; González, Adrián

2017-10-01

In this paper, a novel swarm optimization algorithm called the Selfish Herd Optimizer (SHO) is proposed for solving global optimization problems. SHO is based on the simulation of the widely observed selfish herd behavior manifested by individuals within a herd of animals subjected to some form of predation risk. In SHO, individuals emulate the predatory interactions between groups of prey and predators by two types of search agents: the members of a selfish herd (the prey) and a pack of hungry predators. Depending on their classification as either a prey or a predator, each individual is conducted by a set of unique evolutionary operators inspired by such prey-predator relationship. These unique traits allow SHO to improve the balance between exploration and exploitation without altering the population size. To illustrate the proficiency and robustness of the proposed method, it is compared to other well-known evolutionary optimization approaches such as Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Firefly Algorithm (FA), Differential Evolution (DE), Genetic Algorithms (GA), Crow Search Algorithm (CSA), Dragonfly Algorithm (DA), Moth-flame Optimization Algorithm (MOA) and Sine Cosine Algorithm (SCA). The comparison examines several standard benchmark functions, commonly considered within the literature of evolutionary algorithms. The experimental results show the remarkable performance of our proposed approach against those of the other compared methods, and as such SHO is proven to be an excellent alternative to solve global optimization problems. Copyright © 2017 Elsevier B.V. All rights reserved.

Ising model for packet routing control

International Nuclear Information System (INIS)

Horiguchi, Tsuyoshi; Takahashi, Hideyuki; Hayashi, Keisuke; Yamaguchi, Chiaki

2004-01-01

For packet routing control in computer networks, we propose an Ising model which is defined in order to express competition among a queue length and a distance from a node with a packet to its destination node. By introducing a dynamics for a mean-field value of an Ising spin, we show by computer simulations that effective control of packet routing through priority links is possible

Digital Video Imagery and Wireless Communications for Land-Based Reconnaissance Missions

National Research Council Canada - National Science Library

Munroe, James

1999-01-01

.... This thesis explores, analyzes, and performs a proof-of-concept implementation for a real-time digital video reconnaissance system from forward locations to the rear using wireless communication...

A New Privacy-Preserving Handover Authentication Scheme for Wireless Networks.

Science.gov (United States)

Wang, Changji; Yuan, Yuan; Wu, Jiayuan

2017-06-20

Handover authentication is a critical issue in wireless networks, which is being used to ensure mobile nodes wander over multiple access points securely and seamlessly. A variety of handover authentication schemes for wireless networks have been proposed in the literature. Unfortunately, existing handover authentication schemes are vulnerable to a few security attacks, or incur high communication and computation costs. Recently, He et al. proposed a handover authentication scheme PairHand and claimed it can resist various attacks without rigorous security proofs. In this paper, we show that PairHand does not meet forward secrecy and strong anonymity. More seriously, it is vulnerable to key compromise attack, where an adversary can recover the private key of any mobile node. Then, we propose a new efficient and provably secure handover authentication scheme for wireless networks based on elliptic curve cryptography. Compared with existing schemes, our proposed scheme can resist key compromise attack, and achieves forward secrecy and strong anonymity. Moreover, it is more efficient in terms of computation and communication.

Selfish little circles: transmission bias and evolution of large deletion-bearing mitochondrial DNA in Caenorhabditis briggsae nematodes.

Directory of Open Access Journals (Sweden)

Katie A Clark

Full Text Available Selfish DNA poses a significant challenge to genome stability and organismal fitness in diverse eukaryotic lineages. Although selfish mitochondrial DNA (mtDNA has known associations with cytoplasmic male sterility in numerous gynodioecious plant species and is manifested as petite mutants in experimental yeast lab populations, examples of selfish mtDNA in animals are less common. We analyzed the inheritance and evolution of mitochondrial DNA bearing large heteroplasmic deletions including nad5 gene sequences (nad5Δ mtDNA, in the nematode Caenorhabditis briggsae. The deletion is widespread in C. briggsae natural populations and is associated with deleterious organismal effects. We studied the inheritance patterns of nad5Δ mtDNA using eight sets of C. briggsae mutation-accumulation (MA lines, each initiated from a different natural strain progenitor and bottlenecked as single hermaphrodites across generations. We observed a consistent and strong drive toward higher levels of deletion-bearing molecules in the heteroplasmic pool of mtDNA after ten generations of bottlenecking. Our results demonstrate a uniform transmission bias whereby nad5Δ mtDNA accumulates to higher levels relative to intact mtDNA in multiple genetically diverse natural strains of C. briggsae. We calculated an average 1% per-generation transmission bias for deletion-bearing mtDNA relative to intact genomes. Our study, coupled with known deleterious phenotypes associated with high deletion levels, shows that nad5Δ mtDNA are selfish genetic elements that have evolved in natural populations of C. briggsae, offering a powerful new system to study selfish mtDNA dynamics in metazoans.

Selfish Little Circles: Transmission Bias and Evolution of Large Deletion-Bearing Mitochondrial DNA in Caenorhabditis briggsae Nematodes

Science.gov (United States)

Clark, Katie A.; Howe, Dana K.; Gafner, Kristin; Kusuma, Danika; Ping, Sita; Estes, Suzanne; Denver, Dee R.

2012-01-01

Selfish DNA poses a significant challenge to genome stability and organismal fitness in diverse eukaryotic lineages. Although selfish mitochondrial DNA (mtDNA) has known associations with cytoplasmic male sterility in numerous gynodioecious plant species and is manifested as petite mutants in experimental yeast lab populations, examples of selfish mtDNA in animals are less common. We analyzed the inheritance and evolution of mitochondrial DNA bearing large heteroplasmic deletions including nad5 gene sequences (nad5Δ mtDNA), in the nematode Caenorhabditis briggsae. The deletion is widespread in C. briggsae natural populations and is associated with deleterious organismal effects. We studied the inheritance patterns of nad5Δ mtDNA using eight sets of C. briggsae mutation-accumulation (MA) lines, each initiated from a different natural strain progenitor and bottlenecked as single hermaphrodites across generations. We observed a consistent and strong drive toward higher levels of deletion-bearing molecules in the heteroplasmic pool of mtDNA after ten generations of bottlenecking. Our results demonstrate a uniform transmission bias whereby nad5Δ mtDNA accumulates to higher levels relative to intact mtDNA in multiple genetically diverse natural strains of C. briggsae. We calculated an average 1% per-generation transmission bias for deletion-bearing mtDNA relative to intact genomes. Our study, coupled with known deleterious phenotypes associated with high deletion levels, shows that nad5Δ mtDNA are selfish genetic elements that have evolved in natural populations of C. briggsae, offering a powerful new system to study selfish mtDNA dynamics in metazoans. PMID:22859984

On Hybrid Energy Utilization in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Mohammad Tala’t

2017-11-01

Full Text Available In a wireless sensor network (WSN, many applications have limited energy resources for data transmission. In order to accomplish a better green communication for WSN, a hybrid energy scheme can supply a more reliable energy source. In this article, hybrid energy utilization—which consists of constant energy source and solar harvested energy—is considered for WSN. To minimize constant energy usage from the hybrid source, a Markov decision process (MDP is designed to find the optimal transmission policy. With a finite packet buffer and a finite battery size, an MDP model is presented to define the states, actions, state transition probabilities, and the cost function including the cost values for all actions. A weighted sum of constant energy source consumption and a packet dropping probability (PDP are adopted as the cost value, enabling us to find the optimal solution for balancing the minimization of the constant energy source utilization and the PDP using a value iteration algorithm. As shown in the simulation results, the performance of optimal solution using MDP achieves a significant improvement compared to solution without its use.

A Survey of Routing Issues and Associated Protocols in Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Muhammad Khalid

2017-01-01

Full Text Available Underwater wireless sensor networks are a newly emerging wireless technology in which small size sensors with limited energy and limited memory and bandwidth are deployed in deep sea water and various monitoring operations like tactical surveillance, environmental monitoring, and data collection are performed through these tiny sensors. Underwater wireless sensor networks are used for the exploration of underwater resources, oceanographic data collection, flood or disaster prevention, tactical surveillance systems, and unmanned underwater vehicles. Sensor nodes consist of a small memory, a central processing unit, and an antenna. Underwater networks are much different from terrestrial sensor networks as radio waves cannot be used in underwater wireless sensor networks. Acoustic channels are used for communication in deep sea water. Acoustic signals have many limitations, such as limited bandwidth, higher end-to-end delay, network path loss, higher propagation delay, and dynamic topology. Usually, these limitations result in higher energy consumption with a smaller number of packets delivered. The main aim nowadays is to operate sensor nodes having a smaller battery for a longer time in the network. This survey has discussed the state-of-the-art localization based and localization-free routing protocols. Routing associated issues in the area of underwater wireless sensor networks have also been discussed.

Comparison of Ring-Buffer-Based Packet Capture Solutions

Energy Technology Data Exchange (ETDEWEB)

Barker, Steven Andrew [Sandia National Lab. (SNL-CA), Livermore, CA (United States)

2015-10-01

Traditional packet-capture solutions using commodity hardware incur a large amount of overhead as packets are copied multiple times by the operating system. This overhead slows sensor systems to a point where they are unable to keep up with high bandwidth traffic, resulting in dropped packets. Incomplete packet capture files hinder network monitoring and incident response efforts. While costly commercial hardware exists to capture high bandwidth traffic, several software-based approaches exist to improve packet capture performance using commodity hardware.

Ultra-Reliable Communication in 5G Wireless Systems

DEFF Research Database (Denmark)

Popovski, Petar

2014-01-01

—Wireless 5G systems will not only be “4G, but faster”. One of the novel features discussed in relation to 5G is Ultra-Reliable Communication (URC), an operation mode not present in today’s wireless systems. URC refers to provision of certain level of communication service almost 100 % of the time....... Example URC applications include reliable cloud connectivity, critical connections for industrial automation and reliable wireless coordination among vehicles. This paper puts forward a systematic view on URC in 5G wireless systems. It starts by analyzing the fundamental mechanisms that constitute......-term URC (URC-S). The second dimension is represented by the type of reliability impairment that can affect the communication reliability in a given scenario. The main objective of this paper is to create the context for defining and solving the new engineering problems posed by URC in 5G....

Selfish prion of Rnq1 mutant in yeast.

Science.gov (United States)

Kurahashi, Hiroshi; Shibata, Shoichiro; Ishiwata, Masao; Nakamura, Yoshikazu

2009-05-01

[PIN(+)] is a prion form of Rnq1 in Saccharomyces cerevisiae and is necessary for the de novo induction of a second prion, [PSI(+)]. We previously isolated a truncated form of Rnq1, named Rnq1Delta100, as a [PSI(+)]-eliminating factor in S. cerevisiae. Rnq1Delta100 deletes the N-terminal non-prion domain of Rnq1, and eliminates [PSI(+)] in [PIN(+)] yeast. Here we found that [PIN(+)] is transmissible to Rnq1Delta100 in the absence of full-length Rnq1, forming a novel prion variant [RNQ1Delta100(+)]. [RNQ1Delta100(+)] has similar [PIN(+)] properties as it stimulates the de novo induction of [PSI(+)] and is eliminated by the null hsp104Delta mutation, but not by Hsp104 overproduction. In contrast, [RNQ1Delta100(+)] inherits the inhibitory activity and hampers the maintenance of [PSI(+)] though less efficiently than [PIN(+)] made of Rnq1-Rnq1Delta100 co-aggregates. Interestingly, [RNQ1Delta100(+)] prion was eliminated by de novo [PSI(+)] induction. Thus, the [RNQ1Delta100(+)] prion demonstrates selfish activity to eliminate a heterologous prion in S. cerevisiae, showing the first instance of a selfish prion variant in living organisms.

Immunizations on small worlds of tree-based wireless sensor networks

DEFF Research Database (Denmark)

Li, Qiao; Zhang, Bai-Hai; Cui, Ling-Guo

2012-01-01

, are conducted on small worlds of tree-based wireless sensor networks to combat the sensor viruses. With the former strategy, the infection extends exponentially, although the immunization effectively reduces the contagion speed. With the latter strategy, recurrent contagion oscillations occur in the small world......The sensor virus is a serious threat, as an attacker can simply send a single packet to compromise the entire sensor network. Epidemics become drastic with link additions among sensors when the small world phenomena occur. Two immunization strategies, uniform immunization and temporary immunization...

Development of synthetic selfish elements based on modular nucleases in Drosophila melanogaster.

Science.gov (United States)

Simoni, Alekos; Siniscalchi, Carla; Chan, Yuk-Sang; Huen, David S; Russell, Steven; Windbichler, Nikolai; Crisanti, Andrea

2014-06-01

Selfish genes are DNA elements that increase their rate of genetic transmission at the expense of other genes in the genome and can therefore quickly spread within a population. It has been suggested that selfish elements could be exploited to modify the genome of entire populations for medical and ecological applications. Here we report that transcription activator-like effector nuclease (TALEN) and zinc finger nuclease (ZFN) can be engineered into site-specific synthetic selfish elements (SSEs) and demonstrate their transmission of up to 70% in the Drosophila germline. We show here that SSEs can spread via DNA break-induced homologous recombination, a process known as 'homing' similar to that observed for homing endonuclease genes (HEGs), despite their fundamentally different modes of DNA binding and cleavage. We observed that TALEN and ZFN have a reduced capability of secondary homing compared to HEG as their repetitive structure had a negative effect on their genetic stability. The modular architecture of ZFNs and TALENs allows for the rapid design of novel SSEs against specific genomic sequences making them potentially suitable for the genetic engineering of wild-type populations of animals and plants, in applications such as gene replacement or population suppression of pest species. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.

Ultra Reliable Short Message Relaying with Wireless Power Transfer

OpenAIRE

López, Onel L. Alcaraz; Alves, Hirley; Souza, Richard Demo; Fernández, Evelio Martín García

2017-01-01

Abstract We consider a dual-hop wireless network where an energy constrained relay node first harvests energy through the received radio-frequency signal from the source, and then uses the harvested energy to forward the source’s information to the destination node. The throughput and delay metrics are investigated for a decode-and-forward relaying mechanism at finite blocklength regime and delay-limited transmission mode. We consider ultra-reliable communication scenarios under discussio...

Auction-Based Resource Allocation for Cooperative Video Transmission Protocols over Wireless Networks

Directory of Open Access Journals (Sweden)

Zhu Han

2009-01-01

Full Text Available Cooperative transmission has been proposed as a novel transmission strategy that takes advantage of broadcast nature of wireless networks, forms virtual MIMO system, and provides diversity gains. In this paper, wireless video transmission protocols are proposed, in which the spectrum resources are first allocated for the source side to broadcast video packets to the relay and destination, and then for the relay side to transmit side information generated from the received packets. The proposed protocols are optimized to minimize the end-to-end expected distortion via choosing bandwidth/power allocation, configuration of side information, subject to bandwidth and power constraints. For multiuser cases, most of current resource allocation approaches cannot be naturally extended and applied to the networks with relay nodes for video transmission. This paper extends the share auction approach into the cooperative video communication scenarios and provides a near-optimal solution for resource allocation. Experimental results have demonstrated that the proposed approach has significant advantage of up to 4 dB gain in single user case and 1.3 dB gain in multiuser case over the reference systems in terms of peak-to-signal-noise ratio. In addition, it reduces the formidable computational complexity of the optimal solution to linear complexity with performance degradation of less than 0.3 dB.

Trade Related Reading Packets for Disabled Readers.

Science.gov (United States)

Davis, Beverly; Woodruff, Nancy S.

Six trade-related reading packets for disabled readers are provided for these trades: assemblers, baking, building maintenance, data entry, interior landscaping, and warehousing. Each packet stresses from 9 to 14 skills. Those skills common to most packets include context clues, fact or opinion, details, following directions, main idea,…

Secure and Efficient Data Transmission over Body Sensor and Wireless Networks

Directory of Open Access Journals (Sweden)

Madhur Sikri

2008-09-01

Full Text Available This paper addresses the transmission of medical and context-aware data from mobile patients to healthcare centers over heterogeneous wireless networks. A handheld device, called personal wireless hub (PWH, of each mobile patient first gathers and aggregates the vital sign and context-aware data for various telemedicine applications. PWH transmits the aggregated data to the remote healthcare center over multiple wireless interfaces such as cellular, WLAN, and WiMAX. The aggregated data contain both periodic data and those nonperiodic unpredictable emergency messages that are sporadic and delayintolerant. This paper addresses the problem of providing QoS (e.g., minimum delay, sufficient data rate, acceptable blocking, and/or dropping rate by designing a packet scheduling and channel/network allocation algorithm over wireless networks. The proposed resource-efficient QoS mechanism is simple and collaborates with an adaptive security algorithm. The QoS and security are achieved mainly with the collaboration of differentiator, delay monitor, data classifier, and scheduler modules within the PWH. This paper also discusses secure data transmission over body sensor networks by introducing key establishment and management algorithms. Simulation results show that the proposed framework achieves low-blocking probability, meets delay requirements, and provides energy-efficient secure communication for the combination of vital signs and context-aware data.

A wireless telecommunications network for real-time monitoring of greenhouse microclimate

Directory of Open Access Journals (Sweden)

Giuliano Vox

2014-10-01

Full Text Available An innovative wireless monitoring system for measuring greenhouse climatic parameters was developed to overcome the problems related to wires cabling such as presence of a dense net of wires hampering the cultivation practices, wires subjected to high temperature and relative humidity, rodents that can damage wires. The system exploits battery-powered environmental sensors, such as air temperature and relative humidity sensors, wind speed and direction, and solar radiation sensors, integrated in the contest of an 802.15.4-based wireless sensors network. Besides, a fruit diameter measurement sensor was integrated into the system. This approach guarantees flexibility, ease of deployment and low power consumption. Data collected from the greenhouse are then sent to a remote server via a general packet radio service link. The proposed solution has been implemented in a real environment. The test of the communication system showed that 0.3% of the sent data packed were lost; the climatic parameters measured with the wireless system were compared with data collected by the wired system showing a mean value of the absolute difference equal to 0.6°C for the value of the greenhouse air temperature. The wireless climate monitoring system showed a good reliability, while the sensor node batteries showed a lifetime of 530 days.

Secure and Efficient Data Transmission over Body Sensor and Wireless Networks

Directory of Open Access Journals (Sweden)

Challa Narasimha

2008-01-01

Full Text Available Abstract This paper addresses the transmission of medical and context-aware data from mobile patients to healthcare centers over heterogeneous wireless networks. A handheld device, called personal wireless hub (PWH, of each mobile patient first gathers and aggregates the vital sign and context-aware data for various telemedicine applications. PWH transmits the aggregated data to the remote healthcare center over multiple wireless interfaces such as cellular, WLAN, and WiMAX. The aggregated data contain both periodic data and those nonperiodic unpredictable emergency messages that are sporadic and delayintolerant. This paper addresses the problem of providing QoS (e.g., minimum delay, sufficient data rate, acceptable blocking, and/or dropping rate by designing a packet scheduling and channel/network allocation algorithm over wireless networks. The proposed resource-efficient QoS mechanism is simple and collaborates with an adaptive security algorithm. The QoS and security are achieved mainly with the collaboration of differentiator, delay monitor, data classifier, and scheduler modules within the PWH. This paper also discusses secure data transmission over body sensor networks by introducing key establishment and management algorithms. Simulation results show that the proposed framework achieves low-blocking probability, meets delay requirements, and provides energy-efficient secure communication for the combination of vital signs and context-aware data.

Technical Survey on Applications of Wireless Sensor Networks in Nuclear Power Plants

International Nuclear Information System (INIS)

Jiang, Jin; Bari, Ataul; Chen, Dongyi; Hashemian, Hash M.

2014-01-01

Even though there is no general consensus on using wireless technologies in nuclear power plants, potential applications of wireless sensor networks within nuclear power plants (NPPs) has been investigated. The topics of interests include potential interaction of wireless sensor networks with the sensitive protection equipment, radiation damage of the electronics on board sensor nodes, optimal placement of relay nodes that collect and forward data in the network, and possible applications, such as radiation dose and level monitoring, and equipment condition monitoring. Several wireless sensor networks have been deployed on site of NPPs on a trial basis to perform these tasks. Different aspects of deployment of such wireless sensor networks in NPPs have also been examined. Industrial standards or guidelines for deployment of WSNs in NPPs are also been considered. This paper examines the state of the art of wireless sensor networks in NPPs

Technical Survey on Applications of Wireless Sensor Networks in Nuclear Power Plants

Energy Technology Data Exchange (ETDEWEB)

Jiang, Jin; Bari, Ataul [University of Western Ontario, Ontario (Canada); Chen, Dongyi [University of Electronic Science and Technology of China, Chengdu (China); Hashemian, Hash M. [AMS Technology Center, Knoxville (United States)

2014-08-15

Even though there is no general consensus on using wireless technologies in nuclear power plants, potential applications of wireless sensor networks within nuclear power plants (NPPs) has been investigated. The topics of interests include potential interaction of wireless sensor networks with the sensitive protection equipment, radiation damage of the electronics on board sensor nodes, optimal placement of relay nodes that collect and forward data in the network, and possible applications, such as radiation dose and level monitoring, and equipment condition monitoring. Several wireless sensor networks have been deployed on site of NPPs on a trial basis to perform these tasks. Different aspects of deployment of such wireless sensor networks in NPPs have also been examined. Industrial standards or guidelines for deployment of WSNs in NPPs are also been considered. This paper examines the state of the art of wireless sensor networks in NPPs.

Time evolution of wave packets on nanostructures

International Nuclear Information System (INIS)

Prunele, E de

2005-01-01

Time evolution of wave packets on nanostructures is studied on the basis of a three-dimensional solvable model with singular interactions (de Prunele 1997 J. Phys. A: Math. Gen. 30 7831). In particular, methods and tools are provided to determine time independent upper bounds for the overlap of the normalized time-dependent wave packet with the time independent normalized wave packet concentrated at an arbitrarily chosen vertex of the nanosystem. The set of upper bounds referring to all initial positions of the wave packet and all overlaps are summarized in a matrix. The analytical formulation allows a detailed study for arbitrary geometrical configurations. Time evolution on truncated quasicrystalline systems has been found to be site selective, depending on the position of the initial wave packet

TMAC: Timestamp-Ordered MAC Protocol for Wireless Mesh Networks

KAUST Repository

Nawab, Faisal

2011-05-01

Wireless Mesh Networks (WMNs) have emerged to meet a need for a self-organized and self-configured multi-hop wireless network infrastructure. Low cost infrastructure and ease of deployment have made WMNs an attractive technology for last mile access. However, 802.11 based WMNs are subject to serious fairness issues. With backlogged TCP traffic, nodes which are two or more hops away from the gateway are subject to starvation, while the one-hop away node saturates the channel with its own local traffic. We study the interactions of TCP and IEEE 802.11 MAC in WMNs to aid us in understanding and overcoming the unfairness problem. We propose a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput performance due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically derive the throughput. Based on the developed model, we propose a distributed MAC protocol called Timestamp-ordered MAC (TMAC), aiming to alleviate the unfairness problem in WMNs via a manipulative per-node scheduling mechanism which takes advantage of the age of each packet as a priority metric. Simulation is conducted to validate our model and to illustrate the fairness characteristics of TMAC. Our results show that TMAC achieves excellent resource allocation fairness while maintaining above 90% of maximum link capacity in parking lot and large grid topologies. Our work illuminates the factors affecting TCP fairness in WMNs. Our theoretical and empirical findings can be used in future research to develop more fairness-aware protocols for WMNs.

Selfish genetic elements favor the evolution of a distinction between soma and germline.

Science.gov (United States)

Johnson, Louise J

2008-08-01

Many multicellular organisms have evolved a dedicated germline. This can benefit the whole organism, but its advantages to genetic parasites have not been explored. Here I model the evolutionary success of a selfish element, such as a transposable element or endosymbiont, which is capable of creating or strengthening a germline-soma distinction in a primitively multicellular host, and find that it will always benefit the element to do so. Genes causing germline sequestration can therefore spread in a population even if germline sequestration is maladaptive for the host organism. Costly selfish elements are expected to survive only in sexual populations, so sexual species may experience an additional push toward germline-soma distinction, and hence toward cell differentiation and multicellularity.

Dynamics of quantum wave packets

International Nuclear Information System (INIS)

Gosnell, T.R.; Taylor, A.J.; Rodriguez, G.; Clement, T.S.

1998-01-01

This is the final report of a three-year, Laboratory Directed Research and Development (LDRD) project at the Los Alamos National Laboratory (LANL). The objective of this project was to develop ultrafast laser techniques for the creation and measurement of quantum vibrational wave packets in gas phase diatomic molecules. Moreover, the authors sought to manipulate the constitution of these wave packets in terms of harmonic-oscillator basis wavefunctions by manipulating the time-dependent amplitude and phase of the incident ultrashort laser pulse. They specifically investigated gaseous diatomic potassium (K 2 ), and discovered variations in the shape of the wave packets as a result of changing the linear chirp in the ultrashort preparation pulse. In particular, they found evidence for wave-packet compression for a specific degree of chirp. Important ancillary results include development of new techniques for denoising and deconvolution of femtosecond time traces and techniques for diagnosing the phase and amplitude of the electric field of femtosecond laser pulses

An Interference-Aware Admission Control Design for Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Manikantan Shila Devu

2010-01-01

Full Text Available In this paper, we present IAC, an interference aware admission control algorithm for use in wireless mesh networks. The core concept of IAC is to use a low overhead dual threshold based approach to share the bandwidth information with its neighbors in the interfering range. As a result, IAC guarantees that the shared wireless bandwidth is not overutilized and the quality of all existing flows are preserved. Moreover, IAC takes into account the intraflow interference effect to estimate the bandwidth consumption of the flow in a multihop path. We have further proposed two approaches of bandwidth allocation, FCFS and MCU, and demonstrated that proper tuning of thresholds can lead to high performance of both schemes. Simulation results illustrate that IAC effectively limits the overutilization of channel resources which in turn results in high throughput, low delay and low packet loss rate for all admitted flows.

Multihop Capability Analysis in Wireless Information and Power Transfer Multirelay Cooperative Networks

Directory of Open Access Journals (Sweden)

Qilin Wu

2018-01-01

Full Text Available We study simultaneous wireless information and power transfer (SWIPT in multihop wireless cooperative networks, where the multihop capability that denotes the largest number of transmission hops is investigated. By utilizing the broadcast nature of multihop wireless networks, we first propose a cooperative forwarding power (CFP scheme. In CFP scheme, the multiple relays and receiver have distinctly different tasks. Specifically, multiple relays close to the transmitter harvest power from the transmitter first and then cooperatively forward the power (not the information towards the receiver. The receiver receives the information (not the power from the transmitter first, and then it harvests the power from the relays and is taken as the transmitter of the next hop. Furthermore, for performance comparison, we suggest two schemes: cooperative forwarding information and power (CFIP and direct receiving information and power (DFIP. Also, we construct an analysis model to investigate the multihop capabilities of CFP, CFIP, and DFIP schemes under the given targeted throughput requirement. Finally, simulation results validate the analysis model and show that the multihop capability of CFP is better than CFIP and DFIP, and for improving the multihop capabilities, it is best effective to increase the average number of relay nodes in cooperative set.

Survey on Reputation and Trust in MANETS

OpenAIRE

A. S. Gowri

2014-01-01

Wireless Self organizing networks rely[1] on node cooperation to perform and support basic functions like packet forwarding, routing and network management . Lack of Infrastructure, resource constraints and organizational environment of self organizing nodes make them vulnerable to newer threats and challenges. By default, [2] non- cooperative misbehavior activities of the nodes will slowly lead to the performance deterioration of the network. Hence the responsibility of ensuring security and...

Sleep Control Game for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Sang Hoon Lee

2016-01-01

Full Text Available In wireless sensor networks (WSNs, each node controls its sleep to reduce energy consumption without sacrificing message latency. In this paper we apply the game theory, which is a powerful tool that explains how each individual acts for his or her own economic benefit, to analyze the optimal sleep schedule for sensor nodes. We redefine this sleep control game as a modified version of the Prisoner’s Dilemma. In the sleep control game, each node decides whether or not it wakes up for the cycle. Payoff functions of the sleep control game consider the expected traffic volume, network conditions, and the expected packet delay. According to the payoff function, each node selects the best wake-up strategy that may minimize the energy consumption and maintain the latency performance. To investigate the performance of our algorithm, we apply the sleep control game to X-MAC, which is one of the recent WSN MAC protocols. Our detailed packet level simulations confirm that the proposed algorithm can effectively reduce the energy consumption by removing unnecessary wake-up operations without loss of the latency performance.

Spreading of a relativistic wave packet

International Nuclear Information System (INIS)

Almeida, C.; Jabs, A.

1983-01-01

A simple general proof that the spreading velocity of a relativistic free wave packet of the Broglie waves is limited is presented. For a wide class of packets it is confirmed that the limit is the velocity of light, and it is shown how this limit is approached when the width Δp of the wave packet in momentum space tends to infinity and the minimum width σ(t=o) in ordinary space tends to zero. (Author) [pt

Dopaminergic stimulation increases selfish behavior in the absence of punishment threat.

Science.gov (United States)

Pedroni, Andreas; Eisenegger, Christoph; Hartmann, Matthias N; Fischbacher, Urs; Knoch, Daria

2014-01-01

People often face decisions that pit self-interested behavior aimed at maximizing personal reward against normative behavior such as acting cooperatively, which benefits others. The threat of social sanctions for defying the fairness norm prevents people from behaving overly selfish. Thus, normative behavior is influenced by both seeking rewards and avoiding punishment. However, the neurochemical processes mediating the impact of these influences remain unknown. Several lines of evidence link the dopaminergic system to reward and punishment processing, respectively, but this evidence stems from studies in non-social contexts. The present study investigates dopaminergic drug effects on individuals' reward seeking and punishment avoidance in social interaction. Two-hundred one healthy male participants were randomly assigned to receive 300 mg of L-3,4-dihydroxyphenylalanine (L-DOPA) or a placebo before playing an economic bargaining game. This game involved two conditions, one in which unfair behavior could be punished and one in which unfair behavior could not be punished. In the absence of punishment threats, L-DOPA administration led to more selfish behavior, likely mediated through an increase in reward seeking. In contrast, L-DOPA administration had no significant effect on behavior when faced with punishment threats. The results of this study broaden the role of the dopaminergic system in reward seeking to human social interactions. We could show that even a single dose of a dopaminergic drug may bring selfish behavior to the fore, which in turn may shed new light on potential causal relationships between the dopaminergic system and norm abiding behaviors in certain clinical subpopulations.

High Angular Momentum Rydberg Wave Packets

Science.gov (United States)

Wyker, Brendan

2011-12-01

High angular momentum Rydberg wave packets are studied. Application of carefully tailored electric fields to low angular momentum, high- n (n ˜ 300) Rydberg atoms creates coherent superpositions of Stark states with near extreme values of angular momentum, ℓ. Wave packet components orbit the parent nucleus at rates that depend on their energy, leading to periods of localization and delocalization as the components come into and go out of phase with each other. Monitoring survival probability signals in the presence of position dependent probing leads to observation of characteristic oscillations based on the composition of the wave packet. The discrete nature of electron energy levels is observed through the measurement of quantum revivals in the wave packet localization signal. Time-domain spectroscopy of these signals allows determination of both the population and phase of individual superposition components. Precise manipulation of wave packets is achieved through further application of pulsed electric fields. Decoherence effects due to background gas collisions and electrical noise are also detailed. Quantized classical trajectory Monte-Carlo simulations are introduced and agree remarkably well with experimental results.

TCP Packet Trace Analysis. M.S. Thesis

Science.gov (United States)

Shepard, Timothy J.

1991-01-01

Examination of a trace of packets collected from the network is often the only method available for diagnosing protocol performance problems in computer networks. This thesis explores the use of packet traces to diagnose performance problems of the transport protocol TCP. Unfortunately, manual examination of these traces can be so tedious that effective analysis is not possible. The primary contribution of this thesis is a graphical method of displaying the packet trace which greatly reduce, the tediousness of examining a packet trace. The graphical method is demonstrated by the examination of some packet traces of typical TCP connections. The performance of two different implementations of TCP sending data across a particular network path is compared. Traces many thousands of packets long are used to demonstrate how effectively the graphical method simplifies examination of long complicated traces. In the comparison of the two TCP implementations, the burstiness of the TCP transmitter appeared to be related to the achieved throughput. A method of quantifying this burstiness is presented and its possible relevance to understanding the performance of TCP is discussed.

Attacks on IEEE 802.11 wireless networks

Directory of Open Access Journals (Sweden)

Dejan Milan Tepšić

2013-06-01

Full Text Available Security of wireless computer networks was initially secured with the WEP security protocol, which relies on the RC4 encryption algorithm and the CRC algorithm to check the integrity. The basic problems of the WEP are a short initialization vector, unsafe data integrity checking, using a common key, the lack of mechanisms for management and exchange of keys, the lack of protection from the endless insertion of the same package into the network, the lack of authentication of access points and the like. The consequences of these failures are easy attacks against the WEP network, namely their complete insecurity. Therefore, the work began on the IEEE 802.11i protocol, which should radically improve the security of wireless networks. Since the development of a protocol lasted, the WPA standard was released to offset the security gap caused by the WEP. The WPA also relies on RC4 and CRC algorithms, but brings temporary keys and the MIC algorithm for data integrity. The 802.1X authentication was introduced and common keys are no longer needed, since it is possible to use an authentication server. The length of the initialization vector was increased and the vector is obtained based on the packet serial number, in order to prevent the insertion of the same packet into the network. The weakness of the WPA security mechanism is the use of a common key. WPA2 (802.11i later appeared. Unlike the WPA mechanism that worked on old devices with the replacement of software, WPA2 requires new network devices that can perform AES encryption. AES replaces the RC4 algorithm and delivers much greater security. Data integrity is protected by encryption. Despite progress, there are still weaknesses in wireless networks. Attacks for denial of service are possible as well as spoofing package headers attacks. For now, it is not advisable to use wireless networks in environments where unreliability and unavailability are not tolerated. Introduction In the entire history of

Amplify-and-forward relaying in wireless communications

CERN Document Server

Rodriguez, Leonardo Jimenez; Le-Ngoc, Tho

2015-01-01

This SpringerBrief explores the advantage of relaying techniques in addressing the increasing demand for high data rates and reliable services over the air. It demonstrates how to design cost-effective relay systems that provide high spectral efficiency and fully exploit the diversity of the relay channel. The brief covers advances in achievable rates, power allocation schemes, and error performance for half-duplex (HD) and full-duplex (FD) amplify-and-forward (AF) single-relay systems. The authors discuss the capacity and respective optimal power allocation for a wide range of HD protocols ov

Adaptive management of energy consumption, reliability and delay of wireless sensor node: Application to IEEE 802.15.4 wireless sensor node.

Science.gov (United States)

Kone, Cheick Tidjane; Mathias, Jean-Denis; De Sousa, Gil

2017-01-01

Designing a Wireless Sensor Network (WSN) to achieve a high Quality of Service (QoS) (network performance and durability) is a challenging problem. We address it by focusing on the performance of the 802.15.4 communication protocol because the IEEE 802.15.4 Standard is actually considered as one of the reference technologies in WSNs. In this paper, we propose to control the sustainable use of resources (i.e., energy consumption, reliability and timely packet transmission) of a wireless sensor node equipped with photovoltaic cells by an adaptive tuning not only of the MAC (Medium Access Control) parameters but also of the sampling frequency of the node. To do this, we use one of the existing control approaches, namely the viability theory, which aims to preserve the functions and the controls of a dynamic system in a set of desirable states. So, an analytical model, describing the evolution over time of nodal resources, is derived and used by a viability algorithm for the adaptive tuning of the IEEE 802.15.4 MAC protocol. The simulation analysis shows that our solution allows ensuring indefinitely, in the absence of hardware failure, the operations (lifetime duration, reliability and timely packet transmission) of an 802.15.4 WSN and one can temporarily increase the sampling frequency of the node beyond the regular sampling one. This latter brings advantages for agricultural and environmental applications such as precision agriculture, flood or fire prevention. Main results show that our current approach enable to send more information when critical events occur without the node runs out of energy. Finally, we argue that our approach is generic and can be applied to other types of WSN.

40-Gb/s PDM-QPSK signal transmission over 160-m wireless distance at W-band.

Science.gov (United States)

Xiao, Jiangnan; Yu, Jianjun; Li, Xinying; Xu, Yuming; Zhang, Ziran; Chen, Long

2015-03-15

We experimentally demonstrate a W-band optical-wireless transmission system over 160-m wireless distance with a bit rate up to 40 Gb/s. The optical-wireless transmission system adopts optical polarization-division-multiplexing (PDM), multiple-input multiple-output (MIMO) reception and antenna polarization diversity. Using this system, we experimentally demonstrate the 2×2 MIMO wireless delivery of 20- and 40-Gb/s PDM quadrature-phase-shift-keying (PDM-QPSK) signals over 640- and 160-m wireless links, respectively. The bit-error ratios (BERs) of these transmission systems are both less than the forward-error-correction (FEC) threshold of 3.8×10-3.

Energy-Efficient Deadline-Aware Data-Gathering Scheme Using Multiple Mobile Data Collectors.

Science.gov (United States)

Dasgupta, Rumpa; Yoon, Seokhoon

2017-04-01

In wireless sensor networks, the data collected by sensors are usually forwarded to the sink through multi-hop forwarding. However, multi-hop forwarding can be inefficient due to the energy hole problem and high communications overhead. Moreover, when the monitored area is large and the number of sensors is small, sensors cannot send the data via multi-hop forwarding due to the lack of network connectivity. In order to address those problems of multi-hop forwarding, in this paper, we consider a data collection scheme that uses mobile data collectors (MDCs), which visit sensors and collect data from them. Due to the recent breakthroughs in wireless power transfer technology, MDCs can also be used to recharge the sensors to keep them from draining their energy. In MDC-based data-gathering schemes, a big challenge is how to find the MDCs' traveling paths in a balanced way, such that their energy consumption is minimized and the packet-delay constraint is satisfied. Therefore, in this paper, we aim at finding the MDCs' paths, taking energy efficiency and delay constraints into account. We first define an optimization problem, named the delay-constrained energy minimization (DCEM) problem, to find the paths for MDCs. An integer linear programming problem is formulated to find the optimal solution. We also propose a two-phase path-selection algorithm to efficiently solve the DCEM problem. Simulations are performed to compare the performance of the proposed algorithms with two heuristics algorithms for the vehicle routing problem under various scenarios. The simulation results show that the proposed algorithms can outperform existing algorithms in terms of energy efficiency and packet delay.

Compressive sensing based wireless sensor for structural health monitoring

Science.gov (United States)

Bao, Yuequan; Zou, Zilong; Li, Hui

2014-03-01

Data loss is a common problem for monitoring systems based on wireless sensors. Reliable communication protocols, which enhance communication reliability by repetitively transmitting unreceived packets, is one approach to tackle the problem of data loss. An alternative approach allows data loss to some extent and seeks to recover the lost data from an algorithmic point of view. Compressive sensing (CS) provides such a data loss recovery technique. This technique can be embedded into smart wireless sensors and effectively increases wireless communication reliability without retransmitting the data. The basic idea of CS-based approach is that, instead of transmitting the raw signal acquired by the sensor, a transformed signal that is generated by projecting the raw signal onto a random matrix, is transmitted. Some data loss may occur during the transmission of this transformed signal. However, according to the theory of CS, the raw signal can be effectively reconstructed from the received incomplete transformed signal given that the raw signal is compressible in some basis and the data loss ratio is low. This CS-based technique is implemented into the Imote2 smart sensor platform using the foundation of Illinois Structural Health Monitoring Project (ISHMP) Service Tool-suite. To overcome the constraints of limited onboard resources of wireless sensor nodes, a method called random demodulator (RD) is employed to provide memory and power efficient construction of the random sampling matrix. Adaptation of RD sampling matrix is made to accommodate data loss in wireless transmission and meet the objectives of the data recovery. The embedded program is tested in a series of sensing and communication experiments. Examples and parametric study are presented to demonstrate the applicability of the embedded program as well as to show the efficacy of CS-based data loss recovery for real wireless SHM systems.

Bacterial toxin-antitoxin systems: more than selfish entities?

OpenAIRE

Laurence Van Melderen; Manuel Saavedra De Bast

2009-01-01

Bacterial toxin?antitoxin (TA) systems are diverse and widespread in the prokaryotic kingdom. They are composed of closely linked genes encoding a stable toxin that can harm the host cell and its cognate labile antitoxin, which protects the host from the toxin's deleterious effect. TA systems are thought to invade bacterial genomes through horizontal gene transfer. Some TA systems might behave as selfish elements and favour their own maintenance at the expense of their host. As a consequence,...

Certain problems concerning wavelets and wavelets packets

Energy Technology Data Exchange (ETDEWEB)

Siddiqi, A H

1995-09-01

Wavelets is the outcome of the synthesis of ideas that have emerged in different branches of science and technology, mainly in the last decade. The concept of wavelet packets, which are superpositions of wavelets, has been introduced a couple of years ago. They form bases which retain many properties of wavelets like orthogonality, smoothness and localization. The Walsh orthornomal system is a special case of wavelet packet. The wavelet packets provide at our disposal a library of orthonormal bases, each of which can be used to analyze a given signal of finite energy. The optimal choice is decided by the entropy criterion. In the present paper we discuss results concerning convergence, coefficients, and approximation of wavelet packets series in general and wavelets series in particular. Wavelet packet techniques for solutions of differential equations are also mentioned. (author). 117 refs.

Certain problems concerning wavelets and wavelets packets

International Nuclear Information System (INIS)

Siddiqi, A.H.

1995-09-01

Wavelets is the outcome of the synthesis of ideas that have emerged in different branches of science and technology, mainly in the last decade. The concept of wavelet packets, which are superpositions of wavelets, has been introduced a couple of years ago. They form bases which retain many properties of wavelets like orthogonality, smoothness and localization. The Walsh orthornomal system is a special case of wavelet packet. The wavelet packets provide at our disposal a library of orthonormal bases, each of which can be used to analyze a given signal of finite energy. The optimal choice is decided by the entropy criterion. In the present paper we discuss results concerning convergence, coefficients, and approximation of wavelet packets series in general and wavelets series in particular. Wavelet packet techniques for solutions of differential equations are also mentioned. (author). 117 refs

An FEC Adaptive Multicast MAC Protocol for Providing Reliability in WLANs

Science.gov (United States)

Basalamah, Anas; Sato, Takuro

For wireless multicast applications like multimedia conferencing, voice over IP and video/audio streaming, a reliable transmission of packets within short delivery delay is needed. Moreover, reliability is crucial to the performance of error intolerant applications like file transfer, distributed computing, chat and whiteboard sharing. Forward Error Correction (FEC) is frequently used in wireless multicast to enhance Packet Error Rate (PER) performance, but cannot assure full reliability unless coupled with Automatic Repeat Request forming what is knows as Hybrid-ARQ. While reliable FEC can be deployed at different levels of the protocol stack, it cannot be deployed on the MAC layer of the unreliable IEEE802.11 WLAN due to its inability to exchange ACKs with multiple recipients. In this paper, we propose a Multicast MAC protocol that enhances WLAN reliability by using Adaptive FEC and study it's performance through mathematical analysis and simulation. Our results show that our protocol can deliver high reliability and throughput performance.

Dynamic power control for wireless backbone mesh networks: a survey

CSIR Research Space (South Africa)

Olwal, TO

2010-01-01

Full Text Available points of failures, and robust against RF interference, obstacles or power outage. This is because WMRs forming wireless backbone mesh networks (WBMNs) are built on advanced physical technologies. Such nodes perform both accessing and forwarding...

Tropical Animal Tour Packet. Metro.

Science.gov (United States)

Metro Washington Park Zoo, Portland, OR. Educational Services Div.

This packet is designed to assist teachers in creating a tropical animals lesson plan that centers around a visit to the zoo. A teacher packet is divided into eight parts: (1) goals and objectives; (2) what to expect at the zoo; (3) student activities (preparatory activities, on-site activities, and follow-up activities); (4) background…

Wireless communication technologies in distribution automation

Energy Technology Data Exchange (ETDEWEB)

Takala, J [VTT Energy, Espoo (Finland)

1998-08-01

The project started in mid 1995 and will be finished in 1997. The project examines four different wireless communication technologies: GSM short message service, NMT data calls, packet radio network and Autonet (Actionet) status message service. The targets for communication include: Energy measurement, especially in the de-regulated electricity market, secondary sub-station control and fault indicators. The research has been focused on the usability of different communication technologies for different purposes. Data about response times, reliability, error rates, retry times, communication delays, costs etc. has been collected about each communication technology and comparative results were analysed. Some field experiments and demonstrations will be made in energy measurement and distribution network remote control. The project is divided into four tasks. Each task is described briefly

Confirmation of Maslow's Hypothesis of Synergy: Developing an Acceptance of Selfishness at the Workplace Scale.

Science.gov (United States)

Takaki, Jiro; Taniguchi, Toshiyo; Fujii, Yasuhito

2016-04-30

This study aimed to develop a new Acceptance of Selfishness at the Workplace Scale (ASWS) and to confirm Maslow's hypothesis of synergy: if both a sense of contribution and acceptance of selfishness at the workplace are high, workers are psychologically healthy. In a cross-sectional study with employees of three Japanese companies, 656 workers answered a self-administered questionnaire on paper completely (response rate = 66.8%). Each questionnaire was submitted to us in a sealed envelope and analyzed. The ASWS indicated high internal consistency (Cronbach's alpha = 0.86). Significant (p Maslow's hypothesis of synergy was confirmed.

Enhancing PMIPv6 for Better Handover Performance among Heterogeneous Wireless Networks in a Micromobility Domain

Directory of Open Access Journals (Sweden)

Magagula LinohA

2010-01-01

Full Text Available This paper analyzes the reduction of handover delay in a network-based localized mobility management framework assisted by IEEE 802.21 MIH services. It compares the handover signaling procedures with host-based localized MIPv6 (HMIPv6, with network-based localized MIPv6 (PMIPv6, and with PMIPv6 assisted by IEEE 802.21 to show how much handover delay reduction can be achieved. Furthermore, the paper proposes and gives an in-depth analysis of PMIPv6 optimized with a handover coordinator (HC, which is a network-based entity, to further improve handover performance in terms of handover delay and packet loss while maintaining minimal signaling overhead in the air interface among converged heterogeneous wireless networks. Simulation and analytical results show that indeed handover delay and packet loss are reduced.

Selfish evolution of cytonuclear hybrid incompatibility in Mimulus.

Science.gov (United States)

Case, Andrea L; Finseth, Findley R; Barr, Camille M; Fishman, Lila

2016-09-14

Intraspecific coevolution between selfish elements and suppressors may promote interspecific hybrid incompatibility, but evidence of this process is rare. Here, we use genomic data to test alternative models for the evolution of cytonuclear hybrid male sterility in Mimulus In hybrids between Iron Mountain (IM) Mimulus guttatus × Mimulus nasutus, two tightly linked M. guttatus alleles (Rf1/Rf2) each restore male fertility by suppressing a local mitochondrial male-sterility gene (IM-CMS). Unlike neutral models for the evolution of hybrid incompatibility loci, selfish evolution predicts that the Rf alleles experienced strong selection in the presence of IM-CMS. Using whole-genome sequences, we compared patterns of population-genetic variation in Rf at IM to a neighbouring population that lacks IM-CMS. Consistent with local selection in the presence of IM-CMS, the Rf region shows elevated FST, high local linkage disequilibrium and a distinct haplotype structure at IM, but not at Cone Peak (CP), suggesting a recent sweep in the presence of IM-CMS. In both populations, Rf2 exhibited lower polymorphism than other regions, but the low-diversity outliers were different between CP and IM. Our results confirm theoretical predictions of ubiquitous cytonuclear conflict in plants and provide a population-genetic mechanism for the evolution of a common form of hybrid incompatibility. © 2016 The Author(s).

Merging Network Coding with Feedback Management in Multicast Streaming

DEFF Research Database (Denmark)

Moreira, André; Almeida, Luis; Roetter, Daniel Enrique Lucani

2015-01-01

Reliable multicast over wireless poses interesting challenges arising from the unreliable nature of the wireless medium. Recovering lost packets is particularly challenging in multicast scenarios since different receivers lose different packets. For this reason, simply retransmitting packets does...

The effect of amount and tangibility of endowment and certainty of recipients on selfishness in a modified dictator game.

Science.gov (United States)

Chang, Shao-Chuan; Lin, Li-Yun; Horng, Ruey-Yun; Wang, Yau-De

2014-06-01

Taiwanese college students (N = 101) participated in the study to examine the effects of the amount of an endowment, the tangibility of an endowment, and the certainty of the recipient on selfishness in a modified dictator game. Results showed that dictators were more selfish when allocating tangible (money) than less tangible (honor credits) endowments. Selfishness was higher when large amounts of money were involved. The certainty of the recipient was manipulated by whether the recipient was chosen and announced before or after the decision. Unexpectedly, participants were more self-interested in the certain-recipient condition than in the uncertain-recipient condition. In the honor condition, the amount of an endowment and the certainty of the recipient did not affect participants' allocations.

Review Of Prevention Techniques For Denial Of Service DOS Attacks In Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Poonam Rolla

2015-08-01

Full Text Available Wireless Sensor Networks comprised of several tiny sensor nodes which are densely deployed over the region to monitor the environmental conditions. These sensor nodes have certain design issues out of which security is the main predominant factor as it effects the whole lifetime of network. DDoS Distributed denial of service attack floods unnecessary packets in the sensor network. A review on DDoS attacks and their prevention techniques have been done in this paper.

Distortion-Based Slice Level Prioritization for Real-Time Video over QoS-Enabled Wireless Networks

Directory of Open Access Journals (Sweden)

Ismail A. Ali

2012-01-01

Full Text Available This paper presents a prioritization scheme based on an analysis of the impact on objective video quality when dropping individual slices from coded video streams. It is shown that giving higher-priority classified packets preference in accessing the wireless media results in considerable quality gain (up to 3 dB in tests over the case when no prioritization is applied. The proposed scheme is demonstrated for an IEEE 802.11e quality-of-service- (QoS- enabled wireless LAN. Though more complex prioritization systems are possible, the proposed scheme is crafted for mobile interactive or user-to-user video services and is simply implemented within the Main or the Baseline profiles of an H.264 codec.

Wavelet Packet Transform Based Driver Distraction Level Classification Using EEG

Directory of Open Access Journals (Sweden)

Mousa Kadhim Wali

2013-01-01

Full Text Available We classify the driver distraction level (neutral, low, medium, and high based on different wavelets and classifiers using wireless electroencephalogram (EEG signals. 50 subjects were used for data collection using 14 electrodes. We considered for this research 4 distraction stimuli such as Global Position Systems (GPS, music player, short message service (SMS, and mental tasks. Deriving the amplitude spectrum of three different frequency bands theta, alpha, and beta of EEG signals was based on fusion of discrete wavelet packet transform (DWPT and FFT. Comparing the results of three different classifiers (subtractive fuzzy clustering probabilistic neural network, -nearest neighbor was based on spectral centroid, and power spectral features extracted by different wavelets (db4, db8, sym8, and coif5. The results of this study indicate that the best average accuracy achieved by subtractive fuzzy inference system classifier is 79.21% based on power spectral density feature extracted by sym8 wavelet which gave a good class discrimination under ANOVA test.

An Energy-Efficient Underground Localization System Based on Heterogeneous Wireless Networks

Science.gov (United States)

Yuan, Yazhou; Chen, Cailian; Guan, Xinping; Yang, Qiuling

2015-01-01

A precision positioning system with energy efficiency is of great necessity for guaranteeing personnel safety in underground mines. The location information of the miners' should be transmitted to the control center timely and reliably; therefore, a heterogeneous network with the backbone based on high speed Industrial Ethernet is deployed. Since the mobile wireless nodes are working in an irregular tunnel, a specific wireless propagation model cannot fit all situations. In this paper, an underground localization system is designed to enable the adaptation to kinds of harsh tunnel environments, but also to reduce the energy consumption and thus prolong the lifetime of the network. Three key techniques are developed and implemented to improve the system performance, including a step counting algorithm with accelerometers, a power control algorithm and an adaptive packets scheduling scheme. The simulation study and experimental results show the effectiveness of the proposed algorithms and the implementation. PMID:26016918

Evaluation of video transmission of MAC protocols in wireless sensor network

Science.gov (United States)

Maulidin, Mahmuddin, M.; Kamaruddin, L. M.; Elsaikh, Mohamed

2016-08-01

Wireless Sensor Network (WSN) is a wireless network which consists of sensor nodes scattered in a particular area which are used to monitor physical or environment condition. Each node in WSN is also scattered in sensor field, so an appropriate scheme of MAC protocol should have to develop communication link for data transferring. Video transmission is one of the important applications for the future that can be transmitted with low aspect in side of cost and also power consumption. In this paper, comparison of five different MAC WSN protocol for video transmission namely IEEE 802.11 standard, IEEE 802.15.4 standard, CSMA/CA, Berkeley-MAC, and Lightweight-MAC protocol are studied. Simulation experiment has been conducted in OMNeT++ with INET network simulator software to evaluate the performance. Obtained results indicate that IEEE 802.11 works better than other protocol in term of packet delivery, throughput, and latency.

Low Latency MAC Protocol in Wireless Sensor Networks Using Timing Offset

Science.gov (United States)

Choi, Seung Sik

This paper proposes a low latency MAC protocol that can be used in sensor networks. To extend the lifetime of sensor nodes, the conventional solution is to synchronize active/sleep periods of all sensor nodes. However, due to these synchronized sensor nodes, packets in the intermediate nodes must wait until the next node wakes up before it can forward a packet. This induces a large delay in sensor nodes. To solve this latency problem, a clustered sensor network which uses two types of sensor nodes and layered architecture is considered. Clustered heads in each cluster are synchronized with different timing offsets to reduce the sleep delay. Using this concept, the latency problem can be solved and more efficient power usage can be obtained.

Arms race between selfishness and policing: two-trait quantitative genetic model for caste fate conflict in eusocial Hymenoptera.

Science.gov (United States)

Dobata, Shigeto

2012-12-01

Policing against selfishness is now regarded as the main force maintaining cooperation, by reducing costly conflict in complex social systems. Although policing has been studied extensively in social insect colonies, its coevolution against selfishness has not been fully captured by previous theories. In this study, I developed a two-trait quantitative genetic model of the conflict between selfish immature females (usually larvae) and policing workers in eusocial Hymenoptera over the immatures' propensity to develop into new queens. This model allows for the analysis of coevolution between genomes expressed in immatures and workers that collectively determine the immatures' queen caste fate. The main prediction of the model is that a higher level of polyandry leads to a smaller fraction of queens produced among new females through caste fate policing. The other main prediction of the present model is that, as a result of arms race, caste fate policing by workers coevolves with exaggerated selfishness of the immatures achieving maximum potential to develop into queens. Moreover, the model can incorporate genetic correlation between traits, which has been largely unexplored in social evolution theory. This study highlights the importance of understanding social traits as influenced by the coevolution of conflicting genomes. © 2012 The Author. Evolution© 2012 The Society for the Study of Evolution.

Random access with adaptive packet aggregation in LTE/LTE-A.

Science.gov (United States)

Zhou, Kaijie; Nikaein, Navid

While random access presents a promising solution for efficient uplink channel access, the preamble collision rate can significantly increase when massive number of devices simultaneously access the channel. To address this issue and improve the reliability of the random access, an adaptive packet aggregation method is proposed. With the proposed method, a device does not trigger a random access for every single packet. Instead, it starts a random access when the number of aggregated packets reaches a given threshold. This method reduces the packet collision rate at the expense of an extra latency, which is used to accumulate multiple packets into a single transmission unit. Therefore, the tradeoff between packet loss rate and channel access latency has to be carefully selected. We use semi-Markov model to derive the packet loss rate and channel access latency as functions of packet aggregation number. Hence, the optimal amount of aggregated packets can be found, which keeps the loss rate below the desired value while minimizing the access latency. We also apply for the idea of packet aggregation for power saving, where a device aggregates as many packets as possible until the latency constraint is reached. Simulations are carried out to evaluate our methods. We find that the packet loss rate and/or power consumption are significantly reduced with the proposed method.

On the Coded Packet Relay Network in the Presence of Neighbors

DEFF Research Database (Denmark)

Khamfroush, Hana; Pahlevani, Peyman; Roetter, Daniel Enrique Lucani

2014-01-01

This paper studies the problem of optimal use of a relay for reducing the transmission time of data packets from a source to a destination using network coding. More importantly, we address an effect that is typically overlooked in previous studies: the presence of active transmitting nodes...... in the neighborhood of such devices, which is typical in wireless mesh networks. We show that in systems with a fair medium access control mechanism (MAC), the use of a relay in a crowded medium brings forth considerable and unforeseen improvements, including up to 3.5x gains in terms of throughput compared to using...... only the direct link in some of our examples, and a considerable extension of the operating region where using a relay is beneficial. The problem is formulated as a Markov Decision Process (MDP) and numerical results are provided comparing simple, close–to–optimal heuristics to the optimal scheme....

Cooperative and Adaptive Network Coding for Gradient Based Routing in Wireless Sensor Networks with Multiple Sinks

Directory of Open Access Journals (Sweden)

M. E. Migabo

2017-01-01

Full Text Available Despite its low computational cost, the Gradient Based Routing (GBR broadcast of interest messages in Wireless Sensor Networks (WSNs causes significant packets duplications and unnecessary packets transmissions. This results in energy wastage, traffic load imbalance, high network traffic, and low throughput. Thanks to the emergence of fast and powerful processors, the development of efficient network coding strategies is expected to enable efficient packets aggregations and reduce packets retransmissions. For multiple sinks WSNs, the challenge consists of efficiently selecting a suitable network coding scheme. This article proposes a Cooperative and Adaptive Network Coding for GBR (CoAdNC-GBR technique which considers the network density as dynamically defined by the average number of neighbouring nodes, to efficiently aggregate interest messages. The aggregation is performed by means of linear combinations of random coefficients of a finite Galois Field of variable size GF(2S at each node and the decoding is performed by means of Gaussian elimination. The obtained results reveal that, by exploiting the cooperation of the multiple sinks, the CoAdNC-GBR not only improves the transmission reliability of links and lowers the number of transmissions and the propagation latency, but also enhances the energy efficiency of the network when compared to the GBR-network coding (GBR-NC techniques.

A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAF

Directory of Open Access Journals (Sweden)

Vaibhav Soni

2015-01-01

Full Text Available In wireless sensor networks, geographic adaptive fidelity (GAF is one of the most popular energy-aware routing protocols. It conserves energy by identifying equivalence between sensors from a routing perspective and then turning off unnecessary sensors, while maintaining the connectivity of the network. Nevertheless, the traditional GAF still cannot reach the optimum energy usage since it needs more number of hops to transmit data packets to the sink. As a result, it also leads to higher packet delay. In this paper, we propose a modified version of GAF to minimize hop count for data routing, called two-level GAF (T-GAF. Furthermore, we use a generalized version of GAF called Diagonal-GAF (DGAF where two diagonal adjacent grids can also directly communicate. It has an advantage of less overhead of coordinator election based on the residual energy of sensors. Analysis and simulation results show significant improvements of the proposed work comparing to traditional GAF in the aspect of total hop count, energy consumption, total distance covered by the data packet before reaching the sink, and packet delay. As a result, compared to traditional GAF, it needs 40% to 47% less hop count and consumes 27% to 35% less energy to extend the network lifetime.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Nadeem Javaid

2017-03-01

Full Text Available In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast, second technique is the improved Hydrocast (improved-Hydrocast, and third one is the cooperative improved Hydrocast (Co-improved Hydrocast. In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR of the received signal is not within the predefined threshold then the maximal ratio combining (MRC is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks.

Science.gov (United States)

Javaid, Nadeem; Muhammad; Sher, Arshad; Abdul, Wadood; Niaz, Iftikhar Azim; Almogren, Ahmad; Alamri, Atif

2017-03-19

In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs) are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast), second technique is the improved Hydrocast (improved-Hydrocast), and third one is the cooperative improved Hydrocast (Co-improved Hydrocast). In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR) of the received signal is not within the predefined threshold then the maximal ratio combining (MRC) is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

Multiple Timescale Energy Scheduling for Wireless Communication with Energy Harvesting Devices

Directory of Open Access Journals (Sweden)

H. Xiao

2012-09-01

Full Text Available The primary challenge in wireless communication with energy harvesting devices is to efficiently utilize the harvesting energy such that the data packet transmission could be supported. This challenge stems from not only QoS requirement imposed by the wireless communication application, but also the energy harvesting dynamics and the limited battery capacity. Traditional solar predictable energy harvesting models are perturbed by prediction errors, which could deteriorate the energy management algorithms based on this models. To cope with these issues, we first propose in this paper a non-homogenous Markov chain model based on experimental data, which can accurately describe the solar energy harvesting process in contrast to traditional predictable energy models. Due to different timescale between the energy harvesting process and the wireless data transmission process, we propose a general framework of multiple timescale Markov decision process (MMDP model to formulate the joint energy scheduling and transmission control problem under different timescales. We then derive the optimal control policies via a joint dynamic programming and value iteration approach. Extensive simulations are carried out to study the performances of the proposed schemes.

DIRECTIONAL OPPORTUNISTIC MECHANISM IN CLUSTER MESSAGE CRITICALITY LEVEL BASED ZIGBEE ROUTING

OpenAIRE

B.Rajeshkanna *1, Dr.M.Anitha 2

2018-01-01

The cluster message criticality level based zigbee routing(CMCLZOR) has been proposed for routing the cluster messages in wireless smart energy home area networks. It employs zigbee opportunistic shortcut tree routing(ZOSTR) and AODV individually for routing normal messages and highly critical messages respectively. ZOSTR allows the receiving nodes to compete for forwarding a packet with the priority of left-over hops rather than stating single next hop node like unicast protocols. Since it h...

Control Strategy for Vehicle Inductive Wireless Charging Based on Load Adaptive and Frequency Adjustment

Directory of Open Access Journals (Sweden)

Shichun Yang

2018-05-01

Full Text Available Wireless charging system for electric vehicles is a hot research issue in the world today. Since the existing research on wireless charging is mostly forward-looking aimed at low-power appliances like household appliances, while electric vehicles need a high-power, high-efficiency, and strong coupling wireless charging system. In this paper, we have specifically designed a 6.6 KW wireless charging system for electric vehicles and have proposed a control strategy suitable for electric vehicles according to its power charging characteristics and existing common wired charging protocol. Firstly, the influence of the equivalent load and frequency bifurcation on a wireless charging system is analyzed in this paper. Secondly, an adaptive load control strategy matching the characteristics of the battery, and the charging pile is put forward to meet the constant current and constant voltage charging requirements to improve the system efficiency. In addition, the frequency adjustment control strategy is designed to realize the real-time dynamic optimization of the entire system. It utilizes the improved methods of rapid judgment, variable step length matching and frequency splitting recognition, which are not adopted in early related researches. Finally, the results of 6.6 kW test show that the control strategy works perfectly since system response time can be reduced to less than 1 s, and the overall efficiency of the wireless charging system and the grid power supply module can reach up to 91%.

A Low Collision and High Throughput Data Collection Mechanism for Large-Scale Super Dense Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Chunyang Lei

2016-07-01

Full Text Available Super dense wireless sensor networks (WSNs have become popular with the development of Internet of Things (IoT, Machine-to-Machine (M2M communications and Vehicular-to-Vehicular (V2V networks. While highly-dense wireless networks provide efficient and sustainable solutions to collect precise environmental information, a new channel access scheme is needed to solve the channel collision problem caused by the large number of competing nodes accessing the channel simultaneously. In this paper, we propose a space-time random access method based on a directional data transmission strategy, by which collisions in the wireless channel are significantly decreased and channel utility efficiency is greatly enhanced. Simulation results show that our proposed method can decrease the packet loss rate to less than 2 % in large scale WSNs and in comparison with other channel access schemes for WSNs, the average network throughput can be doubled.

A Low Collision and High Throughput Data Collection Mechanism for Large-Scale Super Dense Wireless Sensor Networks.