Search

In order to apply wireless sensor networks to mechanical vibration monitoring, the author proposes a wireless network topology with multiple data collection points for mechanical vibration monitoring. This structure reduces the transmission load of the data collection point, increases the data transmission rate of the network, balances the energy dissipation in the network, and utilizes the general wireless sensor network hardware platform. The network transmission protocol and related auxiliary mechanisms are designed and implemented, and a wireless vibration monitoring test platform is constructed. The transmission performance of the network structure with multiple data collection points is evaluated through the actual test. The experimental results show that by using the wireless sensor network topology with multiple data collection points, it can meet the requirements of continuous transmission of vibration data obtained by 1 kHz sampling. Conclusion. The system performance of the wireless sensor network based on this network structure has been improved under the condition of general hardware, and the network structure of multiple data collection points shows good performance in the process of high-speed data transmission. [ABSTRACT FROM AUTHOR]

Link quality prediction is a fundamental component of the wireless network protocols and is essential for routing protocols in wireless sensor networks (WSNs). Effective link quality prediction can select high-quality links for communication and improve the reliability of data transmission. In order to improve the accuracy of the link quality prediction model and reduce the model complexity, the link quality prediction model based on the light gradient boosting machine (LightGBM-LQP) is proposed in this paper. Specifically, agglomerative hierarchical clustering and manual division are combined to grade the link quality and obtain the labels of samples. Then, light gradient boosting machine (LightGBM) classification algorithm and Focal Loss are used to estimate the link quality grades. In order to reduce the impact of data imbalance, Borderline-SMOTE is employed to oversample the minority link quality samples. Finally, LightGBM-LQP predicts link quality grade at the next moment with historical link quality information. The experimental results on data collected from a real-world WSNs show that the proposed model has better prediction accuracy and shorter predicting time compared to related models. [ABSTRACT FROM AUTHOR]

A large amount of data would be generated during the process of microseismic monitoring, and data transmission with the cable has some shortcomings such as poor anti-interference, time-consuming, laborious, high cost, and low construction efficiency. On the other hand, the influence of signal diffraction and the multipath effect will greatly cut down the energy of the signal during the wireless transmission in the complex mountainous area. The wireless transmission system based on Wi-Fi is designed in this paper, which includes the base station and data transceiver. The maximum distance and transmission rate at point-to-point communication of the base station are up to 1000 m and 150 Mbps, respectively, and it provides the communication backbone line for the network. The data transceiver adopts the network protocol based on Ad Hoc, and the transmission distance is up to 200 m at the condition of complex topography and lush mountains. We have applied the system to in-site microseismic monitoring with 28 geophones of the coalbed methane fracturing in South Chongqing. It achieved a good performance with a transmission rate of 1.2 Mbps, a time delay of 1.95 ms, and a signal strength of up to −52.3 dBm for real-time data transmission in the field. The results show that the system has the advantages of low BER, fast transmission speed, long communication distance, and stable and safety hardware and has a great value for more applications of microseismicity in complex topography. [ABSTRACT FROM AUTHOR]

Blockchain is a mainstream technology in which many untrustworthy nodes work together to maintain a distributed ledger with advantages such as decentralization, traceability, and tamper-proof. The network layer communication mechanism in its architecture is the core of the networking method, message propagation, and data verification among blockchain nodes, which is the basis to ensure blockchain's performance and key features. When blocks are propagated in peer-to-peer (P2P) networks with gossip protocol, the high propagation delay of the protocol itself reduces the propagation speed of the blocks, which is prone to the chain forking phenomenon and causes double payment attacks. To accelerate the propagation speed and reduce the fork probability, this paper proposes a blockchain network propagation mechanism based on proactive network provider participation for P2P (P4P) architecture. This mechanism first obtains the information of network topology and link status in a region based on the internet service provider (ISP), then it calculates the shortest path and link overhead of peer nodes using P4P technology, prioritizes the nodes with good local bandwidth conditions for transmission, realizes the optimization of node connections, improves the quality of service (QoS) and quality of experience (QoE) of blockchain networks, and enables blockchain nodes to exchange blocks and transactions through the secure propagation path. Simulation experiments show that the proposed propagation mechanism outperforms the original propagation mechanism of the blockchain network in terms of system overhead, rate of data success transmission, routing hops, and propagation delay. [ABSTRACT FROM AUTHOR]

Leach (low energy adaptive clustering hierarchy) algorithm is a self-clustering topology algorithm. Its execution process is cyclical. Each cycle is divided into two phases: cluster building phase and stable data communication phase. In the stage of cluster building, the adjacent nodes cluster dynamically and randomly generate cluster heads. In the data communication phase, the nodes in the cluster send the data to the cluster head, and the cluster head performs data fusion and sends the results to the aggregation node. Because the cluster head needs to complete data fusion, communication with the convergence node and other works, the energy consumption is large. Leach algorithm can ensure that each node acts as cluster head with equal probability, so that the nodes in the network consume energy relatively evenly. The basic idea of Leach algorithm is to randomly select cluster head nodes in a circular way. It evenly distributes the energy load of the whole network to each sensor node in the network. It can reduce network energy consumption and improve network life cycle. Leach repeatedly performs cluster refactoring during its operation. This paper studies the parameter detection of wireless sensor network based on Leach algorithm on the on-chip embedded debugging system. Because the classical low-power adaptive clustering layered protocol (Leach) has the problem of energy imbalance and short node life cycle, this paper uses embedded debugging technology based on Leach algorithm and the residual energy and position of nodes in wireless sensor networks were tested for research. This Leach algorithm uses the concept of wheel. Each round consists of two phases: initialization and stabilization. In the initialization stage, each node generates a random number between 0 and 1. If the random number generated by a node is less than the set threshold T (n), the node publishes a message that it is a cluster head. Through the research on the parameter detection, the simulation results show that the research in this paper has good feasibility and rationality. [ABSTRACT FROM AUTHOR]

During the last two decades, the IEEE 8201.11 family has multiplied data rate transmissions in wireless local area networks (WLANs). This progress is based on the adoption of new technologies concerning physical layer (PHY), combined with the enhancements in the medium access control (MAC) layer. Radio over Fiber (RoF) is a technology which can further extend this progress, combining the benefits of optical fiber and wireless networks. The current IEEE 802.11 MAC protocol is contention based, which leads to low utilization of the RoF PHY data rate and on the other hand cannot handle the effects of long propagation delays in RoF networks. In this paper, we present a new Hybrid Link Time Division Multiple Access (HL-TDMA) MAC protocol which addresses the above shortcomings and enhances the performance of both conventional and RoF WLANs. Then, through simulation, we evaluate the performance of the proposed protocol, which is shown to be superior to relevant RoF WLAN protocols in the literature. [ABSTRACT FROM AUTHOR]

With the increasing number of vehicles, the management of parking spaces in cities is becoming increasingly important in improving the quality of life and combating air pollution. Indeed, finding a parking space at peak times and in congested areas of the population becomes a huge challenge for drivers. To remedy this problem, most modern cities have smart parking. The equipment of these smart parking is mainly based on the implementation of wireless sensor networks (WSN) to monitor, track, and collect real-time information on the occupancy status of each parking space. This information is then made available to drivers who are looking for an available parking space. However, sensor nodes have limitations in terms of energy and communication that affect the performance and quality of the wireless sensor network. Therefore, the design of a self-organization protocol for WSN that minimizes power consumption and maximizes the longevity of the WSN network must be taken into account when implementing and developing a sustainable and viable intelligent parking system. In this paper, we propose a protocol for self-organization of wireless sensor networks (WSN) for the management of parking spaces in outdoor and urban car parks. This protocol is based on building clusters using ZigBee transmission technology for multihop communication. Each sensor node will be installed in the ground of each parking space to monitor its availability by sending the empty or busy state of that space to the gateway using cluster head nodes (CHs). This approach has a robust and efficient self-organizing algorithm that minimizes energy dissipation and increases the lifetime of sensor nodes and the WSN network. The simulation results show that parking management systems in outdoor and urban car parks using the self-organization protocol presented are efficient and sustainable in terms of energy consumption, reliability of data transmission, and the longevity of the WSN network compared to other existing parking systems that use different self-organizing protocols for wireless sensor networks. [ABSTRACT FROM AUTHOR]

Abundant sensors in various types are widely used in modern cities to comprehend the current situations in real time. The raw data in open conditions is always in low quality and is hard to employ directly due to its imperfect or missing records. Traditional data preprocessing methods focus on the offline historical data and remain a dilemma between the efficiency and the overhead. In this paper, a data harmonization service DS-Harmonizer is proposed on spatiotemporal data stream in the edge computing environment. Through the online cleaning and complementing steps of the hierarchical service instances, the records’ validity and continuity can be guaranteed in an efficient way. On the simulated data in a practical project, the service shows high performance, low latency, and acceptable precision in extensive conditions. [ABSTRACT FROM AUTHOR]

In this paper, we consider the joint design of data compression and 802.15.4-based medium access control (MAC) protocol for smartgrids with renewable energy. We study the setting where a number of nodes, each of which comprises electricity load and/or renewable sources, report periodically their injected powers to a data concentrator. Our design exploits the correlation of the reported data in both time and space to efficiently design the data compression using the compressed sensing technique and the MAC protocol so that the reported data can be recovered reliably within minimum reporting time. Specifically, we perform the following design tasks: (i) we employ the two-dimensional (2D) compressed sensing technique to compress the reported data in the distributed manner; (ii) we propose to adapt the 802.15.4 MAC protocol frame structure to enable efficient data transmission and reliable data reconstruction; and (iii) we develop an analytical model based on which we can obtain efficient MAC parameter configuration to minimize the reporting delay. Finally, numerical results are presented to demonstrate the effectiveness of our proposed framework compared with existing solutions. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The paper presents StegBlocks, which defines a new concept for performing undetectable hidden communication. StegBlocks is a general approach for constructing methods of network steganography. In StegBlocks, one has to determine objects with defined properties, which will be used to transfer hidden messages. The objects are dependent on a specific network protocol (or application) used as a carrier for a given network steganography method. Moreover, the paper presents the approach to perfect undetectability of network steganography, which was developed based on the rules of undetectability for general steganography. The approach to undetectability of network steganography was used to show the possibility of developing perfectly undetectable network steganography methods using the StegBlocks concept. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Network steganography conceals the transfer of sensitive information within unobtrusive data in computer networks. So-called micro protocols are communication protocols placed within the payload of a network steganographic transfer. They enrich this transfer with features such as reliability, dynamic overlay routing, or performance optimization - just to mention a few. We present different design approaches for the embedding of hidden channels with micro protocols in digitized audio signals under consideration of different requirements. On the basis of experimental results, our design approaches are compared and introduced into a protocol engineering approach for micro protocols. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In the next-generation technology, Internet of Things (IoT), billions of smart objects will communicate with one another to make human lives more convenient. IoT is based on wireless sensor network (WSN), and Zigbee is one of the most popular WSN protocols. A mature IoT environment involves heavy WSN data transmission causing bottleneck problems. However, Zigbee’s AODV routing stack does not have load balance mechanism to handle bursty traffic. Therefore, we develop Multipath Load Balancing (MLB) Routing to substitute Zigbee’s AODV routing. Our proposed MLB consists of two main designs: LAYER_DESIGN and LOAD_BALANCE. LAYER_DESIGN assigns nodes into different layers based on node distance to IoT gateway. Nodes can have multiple next-hops delivering IoT data. All neighboring layer nodes exchange flow information containing current load, used by LOAD_BALANCE to estimate future load of next-hops. With MLB, nodes can choose the neighbors with the least load as the next-hops and thus can achieve load balance and avoid bottlenecks. Compared with Zigbee’s AODV and multipath version AODV (AOMDV), experiment results demonstrate that MLB achieves better load balance, lower packet loss rate, and better routing connectivity ratio in both grid and random uniform topologies. MLB provides a more convincing routing solution for IoT applications. [ABSTRACT FROM AUTHOR]

We propose an underwater CSMA/CA protocol with multi-RTS and multi-DATA receptions using the long underwater propagation delay. We analyze the throughput and delay of the proposed underwater CSMA/CA protocol through a ring-based underwater network modeling. The proposed protocol does not need to maintain the information of internode propagation delay for each pair of underwater nodes. In the proposed protocol, when there are simultaneous transmissions of RTS frames from different underwater sensors to an underwater sink as their back-off counters reach zero, the sink can recover some RTS frames which are not overlapped at the sink in the time domain due to the long underwater propagation delay. Then, the sink transmits CTS frame containing the DATA transmission order and the IDs of the sensors which transmitted the recovered RTS frames. Sensors which correspond to the IDs contained by the CTS frame can transmit DATA frame to the sink according to the DATA transmission order. We evaluate the throughput and delay performance of the proposed protocol with varying the number of sensors and the contention window size compared to the conventional protocols. The analytical results agree with the simulation results well for the proposed protocol with various numbers of sensors and contention window sizes. The analytical and simulation results show that the proposed protocol outperforms the conventional protocols. [ABSTRACT FROM AUTHOR]

We focus on the design of transmission protocol for energy harvesting wireless sensors. The sensors can harvest the energy from the environment, but they cannot charge and discharge at the same time. We propose a protocol for energy harvesting and wireless transmission, which contains two steps. In the first step, the sensor harvests the energy from environment, and the energy harvesting rate is controlled by the harvested energy power of the energy saving device (ESD). In the second step, some data should be transmitted to the receiver in a certain time. Considering one slot time, the first part of the time is devoted exclusively to energy harvesting, and the remaining time of the slot is for transmitting the information data. Assume that Q bits are transmitted to the receiver within one time slot; we establish the relationship between the harvesting energy time and the transmit data time. In addition, we analyze the system outage probability performance over the Rayleigh fading channel. [ABSTRACT FROM AUTHOR]

Traditional wireless sensor networks (WSNs) work over the unlicensed spectrum, and as the spectrum becomes increasingly crowded, they suffer from uncontrolled interference. Recently, cognitive radio based sensor networks (CRSNs) have been envisioned as a promising type of implementation that provides quality-of-service (QoS) features for data transmissions. However, key challenges remain in designing energy-efficient medium access control techniques that can achieve QoS. In this paper, we have developed a multiconstrained QoS aware MAC protocol, MQ-MAC, for a cluster based CRSN. In MQ-MAC, a data channel and a backup channel are assigned to a secondary user by the respective cluster head by using dynamic channel priorities. The user device can switch to the backup channel when a primary user appears to be operating over the data channel. Member nodes of a cluster are also prioritized with respect to the urgency of their generated data packets. Performance evaluations, carried out in NS-3 simulator, show that the proposed MQ-MAC protocol offers better performance than existing MAC protocols for CRSN. [ABSTRACT FROM AUTHOR]

In SCTP’s Concurrent Multipath Transfer, if data is sent to the destined IP(s) without knowledge of the paths condition, packets may be lost or delayed. This is because of the bursty nature of IP traffic and physical damage to the network. To offset these problems, network path status is examined using our new mechanism Multipath State Aware Concurrent Multipath Transfer using redundant transmission (MSACMT-RTv2). Here the status of multiple paths is analyzed, initially and periodically thereafter transmitted. After examination, paths priority is assigned before transmission. One path is temporarily employed as redundant path for the failure-expected path (FEP); this redundant path is used for transmitting redundant data. At the end of predefined period, reliability of the FEP is confirmed. If FEP is ensured to be reliable, temporary path is transformed into normal CMT path. MSACMT-RTv2 algorithm is simulated using the Delaware University ns-2 SCTP/CMT module (ns-2; V2.29). We present and discuss MSACMT-RTv2 performance in asymmetric path delay and with finite receiver buffer (rbuf) size. We extended our experiment to test robustness of this algorithm and inferred exhaustive result. It is inferred that our algorithm outperforms better in terms of increasing the throughput and reducing the latency than existing system. [ABSTRACT FROM AUTHOR]

There have been increasing demands for research into multi-channel-based wireless sensor network protocols and applications to support requirements such as increased throughput and real-time or reliable transmission. Researchers or developers of these protocols and applications have to simultaneously analyze the exchanged packets for correctness of both their contents and message exchange timelines. However, if developers were to use multiple conventional single-channel packet sniffers for this purpose, debugging during development and the verification process becomes extremely tedious and difficult because of the need to check the correctness of the protocols over multiple channels individually. Therefore, we present a multi-channel packet-analysis system (MPAS) that helps in debugging and verification for multi-channel protocols or applications. Wireless packets are detected and timestamped by each sniffer module in the MPAS for each channel, and packets are preprocessed and transmitted to a GUI-based analyzer, which then parses the received packets and shows them in order. We present the design and implementation results of the MPAS and evaluate its performance by comparing it against a widely used packet sniffer. [ABSTRACT FROM AUTHOR]

Network mobility (NEMO) enables a group of nodes to connect to the back-end infrastructure during the movement. Because a vehicle must provide passengers good enough transmission quality, various access techniques, for example, 3 G/3.5 G, Wi-Fi or dedicated short range communication, can be simultaneously equipped to aggregate bandwidth and tolerate link failure. This paper extends the Session Initiation Protocol (SIP)-based NEMO framework to support multihoming. First, IEEE 802.21 Media Independent Handover (MIH) is integrated to manage multiple egress interfaces in an on-board unit (OBU). Second, a dynamic synchronization mechanism using the SIP SUBSCRIBE and NOTIFY methods is proposed to manage multiple OBUs in a vehicle. Furthermore, the framework is applied to public transportation systems, for example, bus, train, or mass rapid transit. Passengers may need to transit several times during their journeys. The transit behavior must induce a flood of signaling messages for location update. In this paper, the SIP REFER method is exploited to reduce signaling messages while a group of passengers have scheduled their transit in advance. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In vehicular ad hoc networks (VANETs), themediumaccess control (MAC) protocol is of great importance to provide time-critical safety applications. Contemporary multihop broadcast protocols in VANETs usually choose the farthest node in broadcast range as the forwarder to reduce the number of forwarding hops. However, in this paper, we demonstrate that the farthest forwardermay experience large contention delay in case of high vehicle density. We propose an IEEE 802.11-based multihop broadcast protocol VDF to address the issue of emergency message dissemination. To achieve the tradeoff between contention delay and forwarding hops, VDF adaptably chooses the forwarder according to the vehicle density. Simulation results show that, due to its ability to decrease the transmission collisions, the proposed protocol can provide significantly lower broadcast delay. [ABSTRACT FROM AUTHOR]

ABSTRACT We propose a protocol to transfer a one-time pad (in a probabilistic manner) from Alice to Bob, over a public channel. The proposed protocol is unique because Bob merely acts as a receiver of the pad (secret key); that is, Bob does not need to send any message back to Alice unless he detects eavesdropping. Such a secure transfer of one-time pad, over public channel, is not possible in classical cryptography, and in quantum cryptography, all previous protocols require Bob to send almost as many messages back to Alice as she does to Bob to establish a key. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

ABSTRACT Three-party encrypted key exchange (3PEKE) enables two communicating parties to securely exchange confidential and authenticated information over an insecure network via a trusted server. This investigation presents a novel efficient and secure 3PEKE protocol using a super-poly-to-one trapdoor function. The proposed protocol employs the Diffie-Hellman key exchange and adopts the technique that the clients can publicly exchange the factors for generating the session key without the help of the server to reduce the numbers of transmissions. A round-efficient version of the proposed 3PEKE protocol is also described. Compared with related approaches, the proposed protocol not only retains security requirements and possesses lower computational cost but also has fewer transmissions and realizes the lower bounds of communications. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

ABSTRACT Internet Key Exchange (IKE) protocol is widely applied on the Internet to protect confidentiality of the Internet communication. However, there are many high-risk security vulnerabilities in various IKE implementations. Traditional fuzzing approaches with the aim of discovering vulnerabilities have some blind spots, such as time-consuming, low efficiency, and low degree of automation. This paper introduces a new vulnerability discovering approach based on fuzzing and applies the approach to the IKE protocol. Through summarizing the most comprehensive vulnerable points of IKE protocol and proposing a two-stage test cases library, an IKE protocol vulnerability discovering tool called IKEProFuzzer is designed and implemented. It is a network protocol fuzzing framework with extensibility and automated Monitor/Debugger designed by ourselves. In the experiments, IKEProFuzzer has discovered 14 vulnerabilities, including nine released vulnerabilities and five unreleased ones, which affect many kinds of routers and applications. The evaluation results prove the feasibility, efficiency, and extensibility of the approach compared with the existing approaches. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

ABSTRACT Data aggregation protocols are essential for wireless sensor networks to prolong network lifetime by reducing energy consumption of sensor nodes. For mission-critical wireless sensor networks, however, not only the energy consumption of sensor nodes but also the correctness of the data aggregation results is critical. As wireless sensor networks are usually deployed in harsh and hostile environments, malfunctioning and/or compromised sensor nodes negatively affect the correctness of the data aggregation results. This paper presents a fault-tolerant data aggregation scheme that eliminates the false data sent by malfunctioning and/or compromised sensor nodes. To conserve energy while eliminating false data, an in-network outlier detection technique that is based on locality sensitive hashing scheme is used. The simulation results show that the proposed scheme is able to reduce the number of false data transmissions, thereby increasing the data aggregation accuracy. Moreover, it is also observed that the proposed scheme reduces the overall data transmission in the network. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

This paper proposes a new virtual interaction based programmable logic controller (PLC) training system using virtual sensors and actuators. The proposed system is composed of four components including virtual sensors (for interacting between user and input devices), virtual actuators (for manipulating and controlling device or equipment), virtual PLC (for programming and generating command), and virtual networks (for interfacing the interactions and transferring the data between all the components). The proposed system is applied to a real training program of the university's training center to examine the applicability and feasibility, and the results are analyzed and discussed. [ABSTRACT FROM AUTHOR]

In underwater acoustic sensor networks (UASNs), the propagation delay of acoustic signals is much longer than Radio Frequency (RF). There is spatial unfairness problem caused by space-time uncertainty. Hence, the design of Medium Access Control (MAC) is a challenging issue. In underwater, it not only considers transmission time but also takes location into account. In this paper, we propose Response to the Earliest Transmitter of RTS MAC (RET-MAC) protocol to solve the problem. RET-MAC adopts adaptive RTS Contention Phase (RTS CP) to determine the earliest transmitter of RTS. And CTS Delay Phase (CTS DP) is added to postpone sending CTS in order to avoid collision. In addition, we propose CTS back-off mechanism to adjust the length of CTS DP as needed. Contention back-off mechanism is used to reduce network congestion and increase fairness further. The simulation results show that our scheme can achieve higher fairness and throughput; at the same time it also guarantees lower energy consumption and delay. [ABSTRACT FROM AUTHOR]

We suggest an enhanced approach for reliable bulk data transmission of image files, multimedia video files, and successive log files for monitoring systems over wireless sensor networks. Recently, some approaches have been proposed that use multiple blocks in a frame. These approaches simply drop the block that contains the error and the error-free blocks are transmitted to other nodes. This paper proposes an enhanced FEC scheme, called M-FEC, which reduces the overhead and the total number of transmissions. M-FEC fragments bulk data into many small blocks and these blocks are encoded using rateless codes. Only the erroneous blocks that are detected in a frame are dropped and a relay node waits for other incoming blocks in order to construct a full-sized frame. This simple approach can improve the performance of the FEC scheme over WSNs. Our experiments show that M-FEC reduces the number of received frames at the sink node by almost half compared to the previous approach. We compared our results for different degrees of Wi-Fi interference by choosing particular IEEE 802.15.4 channels and running our experiments for three different types of Wi-Fi interference. [ABSTRACT FROM AUTHOR]

Mobile sensor networks (MSNs) are widely used in various domains to monitor, record, compute, and interact the information within an environment. To prolong the life time of each node in MSNs, energy model and conservation should be considered carefully when designing the data communication mechanism in the network. The limited battery volume and high workload on channels worsen the life times of the busy nodes. In this paper, we propose a new energy evaluating methodology of packet transmissions in MSNs, which is based on redividing network layers and describing the synchronous data flow with matrix form. We first introduce the cache coherence layer to the protocol stack of MSNs. Then, we use a set of energy probability matrices to describe and calculate the energy consumption of each state in the protocol. After that, based on our energy model, we will give out an energy evaluating method of the MSNs design, which is suitable for measuring and comparing the energy consumption from different implements of hardware/software. Our experimental results show that our approach achieves a precision with less than 2% error and provides a credible quantitative criterion for energy optimization of data communication in MSNs. [ABSTRACT FROM AUTHOR]

In order to achieve the equal usage of limited resources in the wireless sensor networks (WSNs), we must aggregate the sensor data before passing it to the base station. In WSNs, the aggregator nodes perform a data aggregation process. Careful selection of the aggregator nodes in the data aggregation process results in reducing large amounts of communication traffic in the WSNs. However, network conditions change frequently due to sharing of resources, computation load, and congestion on network nodes and links, which makes the selection of the aggregator nodes difficult. In this paper, we study an aggregator node selection method in the WSNs. We formulate the selection process as a top-k query problem, where we efficiently solve the problem by using a modified Sort-Filter-Skyline (SFS) algorithm. The main idea of our approach is to immediately perform a skyline query on the sensor nodes in the WSNs, which enables to extract a set of sensor nodes that are potential candidates to become an aggregator node. The experiments show that our method is several times faster compared to the existing approaches. [ABSTRACT FROM AUTHOR]

This paper presents an energy efficient medium access control (MAC) protocol for delay-sensitive data transmission over wireless sensor network. In general, energy consumption and delay depend on channel monitoring interval (CMI) and data sensing period at each sensor node. Based on this fact, we propose a new preamble structure to effectively advertise CMI and avoid the overhearing problem. In order to pursue an effective tradeoff between energy consumption and delay, we also develop a CMI determining algorithm that searches for a sub-optimal solution with a low computational complexity in a distributive way. Finally, experimental results are provided to compare the proposed MAC protocol with existing sensor MAC protocols. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

For extremely sensitive applications, it may be advantageous for users to transmit certain types of data covertly over the network. This provides an additional layer of security to that provided by the different layers of the protocol stack. In this paper we present a covert side channel that uses the 802.11 MAC rate switching protocol. The covert channel provides a general method to hide communications within currently deployed 802.11 LANs. The technique uses a one-time password (OTP) algorithm to ensure high-entropy randomness of the covert messages. We investigate how the covert side channel affects network throughput under various rate-switching conditions with UDP-based and TCP-based application traffic. We also investigate the covertness of the covert side channel using standardized entropy. The theoretical analysis shows that the maximum covert channel bandwidth is 60 bps. The simulation results show that the impact on network throughput is minimal and increases slightly as the covert channel bandwidth increases. We further show that the channel has 100% accuracy with minimal impact on rate switching entropy for scenarios where rate switching normally occurs. Finally, we present two applications for the covert channel: covert authentication and covert WiFi botnets. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

ICWASNs are a kind of wireless networks where, due to mobility of nodes and lack of connectivity, there may be frequent disconnections among the nodes. Hence, the routing path from the source to destination will not be available always. It is proven that, in these networks, messages are replicated multiple times in order to withstand the maximum delay and to achieve high throughput. But these multiple replication-based protocols result in an increase in network overhead and high resource consumption because of uncontrolled replication. Previous works in ICWASNs assume that networks will always have multiple partitions, and each message will be routed using store and forward mechanism. If source and destination are connected, then it is not needed to replicate multiple copies and waste the resources. We introduce a new simple scheme which applies single-copy routing if destination is available; else it switches to store and forward routing. The proposed system tries to reduce the average number of message replications while increasing the throughput. [ABSTRACT FROM AUTHOR]

If the battery of a node is drained out, then it cannot be communicated with other nodes and the number of dead-nodes makes the network partition. In order to overcome this problem, we propose a new routing algorithm for mobile ad hoc networks. It uses the residual battery capacity, transmission power, and hop-count to route the data packet. Here the proposed model has simulated with the help of 100 mobile nodes using the network simulator and has tested under various conditions. It compares with the ad hoc on-demand distance vector protocol, minimum total transmission power, and min-max battery cost routing models. The proposed model has shown better results in terms of node lifetime and network lifetime. The mobile nodes start to die at 400, 420, 440, 470, and 508 s for AODV, MTPR, MMBCR, CMMBCR, and proposed models, respectively. If the system has 145 J, then the AODV model transmits 38 000 of data packets, whereas the MTPR, MMBCR, CMMBCR, and proposed models will transmit 37 600, 47 240, 41 580, 42 700, and 42 955 of data packets, respectively. Copyright © 2009 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

While video content is often stored in rather large files or broadcasted in continuous streams, users are often interested in retrieving only a particular passage on a topic of interest to them. It is, therefore, necessary to split video documents or streams into shorter segments corresponding to appropriate retrieval units. We propose here a method for the automatic segmentation of TV news videos into stories. A-multiple-descriptor based segmentation approach is proposed. The selected multimodal features are complementary and give good insights about story boundaries. Once extracted, these features are expanded with a local temporal context and combined by an early fusion process. The story boundaries are then predicted using machine learning techniques. We investigate the system by experiments conducted using TRECVID 2003 data and protocol of the story boundary detection task, and we show that the proposed approach outperforms the state-of-the-art methods while requiring a very small amount of manual annotation. [ABSTRACT FROM AUTHOR]

Broadcasting Protocols can efficiently transmit videos that simultaneously shared by clients with partitioning the videos into segments. Many studies focus on decreasing clients' waiting time, such as the fixed-delay pagoda broadcasting (FDPB) and the harmonic broadcasting schemes. However, limited-capability client devices such as PDAs and set-top boxes (STBs) suffer from storing a significant fraction of each video while it is being watched. How to reduce clients' buffer demands is thus an important issue. Related works include the staircase broadcasting (SB), the reverse fast broadcasting (RFB), and the hybrid broadcasting (HyB) schemes. This work improves FDPB to save client buffering space as well as waiting time. In comparison with SB, RFB, and HyB, the improved FDPB scheme can yield the smallest waiting time under the same buffer requirements. [ABSTRACT FROM AUTHOR]

Next Generation Network (NGN) faces the challenge of the rapidly increasing amount of signaling. The growing amount of signaling is a consequence of several reasons arising from the fact that signaling is the main source of network intelligence, analysis, and user behavior monitoring. With the increase in signaling load and complexity, the network management becomes a challenging issue that can impact overall Quality of Service (QoS). To confront this issue, there is a need for reliable and forehand signaling transmission in NGN. As there is much confusion about the interpretation of this concept, this paper aims to provide an overview of the evolution of signaling transmission. Migration towards NGN is analyzed from the signaling perspective. The NGN signaling protocols and related transmission requirements are identified. Through the discussion of standard approaches, the paper considers our previously published approach to signaling transmission along with the current issues and emerging opportunities. [ABSTRACT FROM AUTHOR]

ABSTRACT In this paper, we propose a newly distributed protocol called Advanced Diffusion of Classified Data (ADCD) to manage information harvesting and distribution in vehicular sensor networks. ADCD aims at reducing the generated overhead, avoiding network congestions as well as long latency to deliver the harvested information. The concept of ADCD is based on the characterization of sensed information (i.e., based on its importance, location, and time of collection) and the diffusion of this information accordingly. Furthermore, ADCD uses an adaptive broadcasting strategy to avoid overwhelming users with messages in which they have no interest. Also, we propose in this paper a new probabilistic model for ADCD based on Markov chain. This one aims to optimally tune the parameters of ADCD, such as the optimal number of broadcaster nodes. The analytical and simulation results based on different metrics, such as the overhead, the delivery ratio, the probability of a complete transmission, and the minimal number of hops, are presented. These results illustrate that ADCD allows mitigating the information redundancy and its delivery with an adequate latency while making the reception of interesting data for the drivers (related to their location) more adapted. Moreover, the ADCD protocol reduces the overhead by 90% compared with the classical broadcast and an adapted version of MobEyes. The ADCD overhead is kept stable whatever the vehicular density. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Anycast is a one-to-any bidirectional transmission scheme that can be used to provide various service-oriented applications. However, traditional anycast cannot support some distributed applications that need to locate multiple servers such as network time protocols and threshold cryptography. Although there are some extended anycast schemes that can support the discovery of k services, they may cause high control overhead, low satisfaction ratio, or high searching latency when there are more service requesters and providers. The main reasons for these shortcomings are unknown service information and limited hierarchical structure. This work proposes an efficient anycast scheme, called AnyKast, for discovering k services in cluster-based mobile ad hoc networks. In the AnyKast scheme, an anycast tree based on the clustering and virtual backbone is established to reduce unnecessary message transmission. In the anycast tree, anycast clusterheads disseminate their information to certain specific nodes that take the service information and perform the service selection task instead of blindly searching. Furthermore, to decrease the cost of service information collection and maintenance, scope flooding is used to limit the information transmission, and information piggybacking and periodical inquiry mechanism are used to increase the service information accuracy. The experimental results demonstrate that our scheme can effectively discover services, reduce request and reply message control overhead, and lower the searching latency. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

This paper presents a distributed and localized interference-aware channel assignment framework for multi-radio wireless mesh networks in a cognitive network environment. The availability of multiple interfaces and channels in wireless devices is expected to enhance network throughput in wireless mesh networks. A notable design issue in such networks is how to dynamically assign available channels to multiple radio interfaces for maximizing effective network throughput by minimizing interference. The proposed framework uses a novel interference estimation method by utilizing distributed conflict graphs on a per-interface basis. Presented results obtained via simulation studies in 802.11 based multi-radio mesh networks indicate that for both homogeneous and heterogeneous primary networks, the proposed protocol can facilitate a large increase in network throughput in comparison with a Common Channel Assignment mechanism that is used as a benchmark in the literature. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Medium access control (MAC) protocols making use of multipacket reception (MPR) capability achieve better throughput than conventional MAC protocols. When a wireless network operates with MPR capable nodes and non-MPR nodes, the MAC protocols must not only utilise the MPR capability to maximise throughput, but must also enable the co-existence with these two types of nodes. We propose a new MPR MAC protocol to achieve the co-existence requirement by adopting a request-to-send (RTS)/clear-to-send (CTS) mechanism in IEEE 802.11 MAC standards. This MPR MAC protocol also improves throughput by allowing additional data transmissions to use the MPR capability fully. We analyse the system throughput of the co-existence of different link characteristics of nodes, and optimise its throughput by adjusting contention window sizes with respect to certain throughput requirements of the nodes. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Wireless Mesh Networks (WMNs) have emerged recently as a technology for providing high-speed last mile connectivity in next-generation wireless networks. Several MAC protocols that exploit multiple channels and directional antennas have been proposed in the literature to increase the performance of WMNs. However, while these techniques can improve the wireless medium utilization by reducing radio interference and the impact of the exposed nodes problem, they can also exacerbate the hidden nodes problem. Therefore, efficient MAC protocols need to be carefully designed to fully exploit the features offered by multiple channels and directional antennas. In this paper we propose a novel Multi-Channel Power-Controlled Directional MAC protocol (MPCD-MAC) for nodes equipped with multiple network interfaces and directional antennas. MPCD-MAC uses the standard RTS-CTS-DATA-ACK exchange procedure. The novel difference is the transmission of the RTS and CTS packets in all directions on a separate control channel, while the DATA and ACK packets are transmitted only directionally on an available data channel at the minimum required power, taking into account the interference generated on already active connections. This solution spreads the information on wireless medium reservation (RTS/CTS) to the largest set of neighbors, while data transfers take place directionally on separate channels to increase spatial reuse. Furthermore, power control is used to limit the interference produced over active nodes. We measure the performance of MPCD-MAC by simulation of several realistic network scenarios, and we compare it with other approaches proposed in the literature. The results show that our scheme increases considerably both the total traffic accepted by the network and the fairness among competing connections. Copyright © 2010 John Wiley & Sons, Ltd. This paper proposes a novel Multi-Channel Power-Controlled Directional MAC protocol (MPCD-MAC) for nodes equipped with multiple network interfaces and directional antennas. This solution spreads the information on wireless medium reservation (RTS/CTS) to the largest set of neighbors, while data transfers take place directionally on separate channels to increase spatial reuse. Furthermore, power control is used to limit the interference produced over active nodes. Numerical results show that MPCD-MAC increases considerably both the total traffic accepted by the network and the fairness among competing connections. [ABSTRACT FROM AUTHOR]

The 3GPP working group proposes the Long-Term Evolution (LTE) system as the 4G mobile communications technology. To reduce the transmission latency in the radio access network, Evolved Universal Terrestrial Radio Access Network (E-UTRAN), of LTE, the base station and radio network controller are merged into a single network node, namely eNB. In E-UTRAN, the Stop-And-Wait Hybrid ARQ (SAW-HARQ) protocol in the Media Access Control (MAC) layer deals with transmission errors without the need to engage the ARQ protocol in the Radio Link Control (RLC) layer. The HARQ and ARQ protocols interact only in case of dealing HARQ residual errors. In this paper, we propose an analytical model to model the behavior of the HARQ-ARQ Interaction. Our analytical model is validated against the simulation experiments that provide more performance metrics (which cannot be obtained through our analytical model). Finally, we investigate the impacts of the HARQ-ARQ Interaction on the Protocol Data Unit (PDU) transmission delay based on our simulation experiments. Copyright © 2009 John Wiley & Sons, Ltd. The 3GPP working group proposes the Long-Term Evolution (LTE) system as the 4G mobile communications technology. In this paper, we propose an analytical model to model the behavior of the HARQ-ARQ Interaction for the LTE system. [ABSTRACT FROM AUTHOR]

This paper proposes a novel protocol based on cooperative relaying between users. The protocol takes advantage of the fact that data traffic is bursty and silent periods exist between data bursts. Rather than wasting these idle time slots, users can take advantage of them to perform cooperative relaying, obviating the need for dedicated system resources for relaying, hence using the spectrum more efficiently. The benefit of this user cooperation for the higher network layers is analyzed. The system was modeled in terms of the maximum stability region and the maximum stable throughput. Our results show that our proposed protocol provides significant performance gains compared to conventional time-division multiple-access (TDMA) systems, as well as cooperative relaying protocols, namely selection relaying and incremental relaying. Copyright © 2009 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The shared wireless medium used by sensor networks makes it easy for adversaries to launch jamming attacks that can partially or completely block communication leading to a denial-of-service (DoS) condition. This paper presents MULEPRO (MULti-channel Exfiltration PROtocol), a fully distributed network based protocol designed to rapidly exfiltrate data from a jammed area using multiple communication channels simultaneously. The basic idea is to assign scheduling symbols to the different nodes based on their vertex color to produce conflict-free transmission schedules between sensor nodes, up to two-hop distance in order to address the terminal hidden problem. MULEPRO targets sensor network applications that require an immediate and robust response to such jamming-based DoS attacks and is designed to operate with any number of channels. When an attack is launched nodes can effectively coordinate exfiltration transmissions without needing to exchange network protocol information. We have extensively evaluated MULEPRO under a variety of attack configurations. Results show that MULEPRO can maintain pre-attack data transmission rates in the case of standard jamming attack models, and can exfiltrate data even for the case of multiple jammers. Copyright © 2009 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Energy savings have always been the primary concern in wireless sensor network protocols, however there are applications where latency and throughput are prioritized over energy efficiency and are so significant that the application would not be able to satisfy its requirements without them. The communication unit and the antenna operation consume most of the battery-powered energy of the node. Thus, the access to the medium must be controlled in a very strict manner in order to avoid collisions which result in lost transmissions and have a dramatic impact on the lifetime of the network. Although existing duty cycle MAC protocols are power efficient, they introduce significant end-to-end delivery latency and provide poor throughput. In this paper, we propose SN-MAC, a CDMA-based power controlled medium access protocol that uses both transmitter-based and receiver-based CDMA inside a formed cluster, and uses a TDMA schedule to make the cluster heads communicate with the base station. Our algorithm targets latency and throughput needs in addition to its ability to increase the overall network lifetime. We provide a head-to-head comparison with other protocols through extensive simulations focusing on the performance in terms of latency, throughput, and energy consumption. [ABSTRACT FROM AUTHOR]

One of the most effective approaches to enhance the throughput capacity of wireless mesh networks (WMN) is to use systems with multiple channels and multiple radios per node. Multi-channel multi-radio (MCMR) networks require efficient channel assignment (CA) algorithms to determine which channel a link should use for data transmission in order to maximize network throughput. The problem of CA has been studied extensively for unicast communications, but addressed only recently for multicast. We propose a CA algorithm named Minimum interference Multi-channel Multi-radio Multicast (M4) that minimizes interference among nodes in a multicast routing tree and uses both orthogonal and overlapping channels such as those in IEEE 802.11b/g systems. Simulation results show that M4 outperforms the Multi Channel Multicast algorithm proposed. in various scenarios with respect to average packet delivery ratio, throughput and end-to-end delay. Copyright © 2008 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

A novel adaptive source-channel coding with feedback for progressive transmission of medical images is proposed here. In the source coding part, the transmission starts from the region of interest (RoI). The parity length in the channel code varies with respect to both the proximity of the image subblock to the RoI and the channel noise, which is iteratively estimated in the receiver. The overall transmitted data can be controlled by the user (clinician). In the case ofmedical data transmission, it is vital to keep the distortion level under control as inmost of the cases certain clinically important regions have to be transmitted without any visible error. The proposed system significantly reduces the transmission time and error. Moreover, the system is very user friendly since the selection of the RoI, its size, overall code rate, and a number of test features such as noise level can be set by the users in both ends. A MATLAB-based TCP/IP connection has been established to demonstrate the proposed interactive and adaptive progressive transmission system. The proposed system is simulated for both binary symmetric channel (BSC) and Rayleigh channel. The experimental results verify the effectiveness of the design. [ABSTRACT FROM AUTHOR]

A wireless sensor-actuator network (WSAN) is composed of sensor modes and actuator modes which are interconnected in wireless networks. A sensor node collects information on the physical world and sends a sensed value in a wireless network. Another sensor node forwards the sensed value to deliver to an actuator node. A sensor node can deliver messages with sensed values to only nearby nodes due to weak radio. Messages are forwarded by sensor nodes to an actuator node by a type of flooding protocol. A sensor mode senses an event and sends a message with the sensed value. In addition, on receipt of a message with a sensed value from another sensor mode, a sensor node forwards the sensed value. Messages transmitted by sensor nodes might be lost due to noise and collisions. In this paper, we discuss a redundant data transmission (RT) protocol to reliably and efficiently deliver sensed values sensed by sensor nodes to an actuator node. Here, a sensor node sends a message with not only its sensed value but also sensed values received from other sensor nodes. The more number of sensed values are included in a message, the more frequently the message is lost. Each message carries so many number of sensed values that the message loss ratio is not increased. Even if a message with a sensed value v is lost in the wireless network, an actuator node can receive the sensed value v from a message sent by another sensor node. Thus, each sensed value is redundantly carried in multiple messages. The redundancy of a sensed value is in nature increased since the sensed value is broadcast. In order to reduce the redundancy of sensed value, we take a strategy that the farther sensor nodes from an actuator node forward the fewer number of sensed values. We evaluate the RT protocol in terms of loss ratio, redundancy, and delay time of a sensed value. We show that about 80% of sensed values can be delivered to an actuator node even if 95% of messages are lost due to noise and collision. [ABSTRACT FROM AUTHOR]

Distributed coordination function (DCF) is the basis protocol for IEEE 802.11 standard wireless local area networks. It is based on carrier sense multiple access with collision avoidance (CSMA/CA) mechanism. DCF uses backoff process to avoid collisions on the wireless channel. The main drawback with this process is that packets have to spend time in the backoff process which is an additional overhead in their transmission time. The channel is rendered idle when all the stations defer their transmissions due to their backoff process. Therefore, the channel utilization and the total throughput on the channel can be improved by reducing the average time spent by the packets in the backoff process. In this paper, we propose a new media access coordination function called proposed media access protocol (PMAP) that will improve the channel utilization for successful packet transmission and therefore, the total achievable throughput. In addition, we propose an analytical model for PMAP under saturated conditions. We use this model to analyze the performance of PMAP under saturated conditions. To substantiate the effectiveness of our model, we have verified the model by simulating PMAP in NS-2. Simulation and analytical results show that under saturated conditions, PMAP shows profound improvement in the throughput performance compared to DCF. In addition, the throughput performance of PMAP under unsaturated conditions is presented. We have also presented the delay performance of PMAP and DCF through simulation in both saturated and unsaturated conditions. Simulation results show that the average delay experienced by the packets is less in PMAP compared to DCF. Further, the variance in the packet delay is same for both PMAP and DCF protocols under unsaturated conditions. From the performance results obtained for PMAP under both saturated and unsaturated conditions, it can be concluded that PMAP is superior in performance compared to DCF. Copyright © 2006 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

We propose a high-throughput random access protocol for 2 × 2 multiuser multiple-input multiple-output (MIMO) systems. The cross-layer mechanism utilizes the packets combining technique to exploit the advantages of both spatial multiplexing and multipacket reception. Analytical result indicates that the proposed scheme achieves 0.669 per spatial degree of freedom in stable throughput, which is much higher than those in the existed studies. [ABSTRACT FROM AUTHOR]

Multimedia content adaptation has been proved to be an effective mechanism to mitigate the problem of devices and networks heterogeneity and constraints in pervasive computing environments. Moreover, it enables to deliver data taking into consideration the user's preferences and the context of his/her environment. In this paper, we present an algorithm for service composition and protocols for executing service composition plan. Both the algorithm and the protocols are implemented in our distributed content adaptation framework (DCAF) which provides a service-based content adaptation architecture. Finally, a performance evaluation of the algorithm and the protocols is presented. [ABSTRACT FROM AUTHOR]