Search

Introduction Hospital patients require physiological monitoring throughout their stay. Monitoring requirements depend on the hospital unit (e.g. Admission, OR, ICU, ward). Currently, monitoring devices are stationary and are connected by wires to sensors and patient. This is cumbersome for both patient and health care providers, and sensors must be disconnected when the patient is prepared for transfer between units. Further, sensors located in one unit are often incompatible with those in another.We propose a novel concept that simplifies patient monitoring throughout the hospital. Method Approach:We propose a two level wireless network (Fig. 1). A personal area network (PAN) is private to the patient and is responsible for the control of data communication. The PAN host device connects to all required sensors using a wide range of supported protocols (e.g. serial, USB,WiFi and Bluetooth), and is attached to the patient during the entire hospital stay. The PAN host then wirelessly transmits the standardized data to a local area network (LAN) that records patient health information in a database. This information can be retrieved in real time by either stationary monitoring devices or mobile devices of health care providers throughout the hospital network. Prototype: The prototype consists of two pulse oximeters (Nonin, USA) connected via Bluetooth and wired connection, respectively, to a computer with a Linux operating system that acts as the host for the PAN. The LAN consists of a server running a web-based sensor actuator network portal called Sense Tecnic [1]. AWiFi enabled mobile device is used as the monitoring display. Results \& Discussion Blood oxygen saturation and heart rate trend signals are recorded and displayed in real time at a 1 Hz update rate. The web-based data portal allows platform independent, real-time monitoring. The PAN allows for easy connection of sensors to the patient and facilitates monitoring during patient movement and transportation. This approach will facilitate the use of elementary sensors without interruption throughout the hospital. Unit specific sensors can be added to the PAN when required. Future work will include geolocation by indoor triangulation using theWiFi network, and size reduction of the PAN host.

Recently, broadband optical access networks were being deployed worldwide to deliver large bandwidth to end users. Currently, the operators have been mainly deploying time-division multiplexing (TDM) passive optical networks (PON) in their networks. As bandwidth demand continues to increase, the industry further selected several next generation optical access (NGA) options to upgrade from current TDM-PON architectures. Besides increasing bandwidth requirement, current TDM-PONs suffers from limited reach and split-ratio. To further reduce the capital and operational expenditure requirements of current TDM-PON, NGA architectures must consolidate the number of central office sites. Long-reach optical access (LROA) architectures are promising solutions that employ optical amplifiers to increase optical budget to support longer reach and higher split-ratio in the distribution network. As more end users are supported over shared physical medium in LROA, access network security is of greater importance. The first part of this article reviews important LROA architectures and their enabling technologies. Moreover, few works in current literature address security weaknesses in LROA. The second part of this article reviews these security weaknesses as well as monitoring and control techniques employed in current TDM-PONs. In addition, a novel class of quasi-passive and reconfigurable devices is presented that addresses aforementioned security weaknesses and is suitable for LROA.

Based on broadcast transmission, the future Fifth-Generation networks, 5G, suffer from a critical threat, which is the eavesdropping. This issue can be fixed with the cryptographic protocols. Nevertheless, this method is complex and challenging because of the active topology of wireless networks, which does not permit effective management of security keys. Recently, Physical Layer Security (PLS) method is applied as an alternative solution to mitigate the privacy problem, where the characteristic of the physical layer schemes, namely the modulation, Massive Multi-Input Multi-Output (m-MiMo) and channel coding are exploited to ensure privacy. The fountain code is one of these methods where the legitimate receiver must recover the message before eavesdropper did. However, this feature cannot be exploited in 5G networks in the presence of an intruder using the m-MiMo. Furthermore, the design of Artificial Noise (AN) needed in m-MiMo involves a computational complexity and excessive consumption of energy that complicate the secrecy management for fountain code. In this article, we propose a new method to avoid this problem by judiciously exploiting the features of both technologies. The new approach uses the Raptor code feature, as considerably as the m-MiMo parameters aided by AN signal while reducing the transmission power of the AN. The numerical results indicate that the new approach ensures the protection of legitimate users on the channel and minimizes energy expenditure, which potentially gets to this proposed method a greener and secure transmission.

Device placement is a fundamental factor in determining the coverage, connectivity, cost and lifetime of a wireless sensor network (WSN). In this paper, we explore the problem of relay node placement in heterogeneous WSN. We formulate a generalized node placement optimization problem aimed at minimizing the network cost with constraints on lifetime and connectivity. Depending on the constraints, two representative scenarios of this problem are described. We characterize the first problem, where relay nodes are not energy constrained, as a minimum set covering problem. We further consider a more challenging scenario, where all nodes are energy limited. As an optimal solution to this problem is difficult to obtain, a two-phase approach is proposed, in which locally optimal design decisions are taken. The placement of the first phase relay nodes (FPRN), which are directly connected to sensor nodes (SN), is modeled as a minimum set covering problem. To ensure the relaying of the traffic from the FPRN to the base station, three heuristic schemes are proposed to place the second phase relay nodes (SPRN). Furthermore, a lower bound on the minimum number of SPRN required for connectivity is provided. The efficiency of our proposals is investigated by numerical examples.

Device-to-Device (D2D) communication allows direct communication of a device to another device without traversing a base station. The overlay D2D operation lets D2D users and cellular users use orthogonal radio resources. There is no interference between D2D and cellular links, but the efficiency of frequency reuse is low. The underlay D2D operation, on the other hand, allows D2D and cellular users to occupy the same radio resources. It has better frequency reuse, but the price paid is complicated interference management which usually requires centralized coordination and a significant amount of channel and traffic information exchange. In this paper, a scheme that allows a user to simultaneously transmit cellular and D2D signals is proposed to improve the D2D transmission rate in an overlay system. The proposed scheme has the advantage of frequency reuse, similar to underlay D2D, but does not need centralized interference management. The system design aspects pertaining to the proposed scheme, such as rate maximization, power allocation and scheduling are investigated. System simulations show that the proposed scheme significantly improves the D2D rate with only a slight impact on the cellular rate.

Device to Device (D2D) communication technique has been projected as means of taking the benefit of increasing performance of cellular communication with direct link between users. In this paper, we propose a dynamic intra cluster data sharing method taking advantage of D2D multicast. One of the users serves as cluster head to take turns to multicast at a particular time, selected by base station on the basis of power level. Cluster head at that particular time is able to access to the users in the cluster. In our algorithm dynamic data demand is considered in order to send the packets in sequence based on users need. Base station identifies the user with more requests, and informs the Cluster head. Cluster head asks that particular user to serve as transmitting user. The transmitting user monitors the acknowledgements sent by the receiving users. If acknowledgement fails to come within the minimum time (t min ) the transmitting user informs the cluster head. Then cluster head checks the reason for failure of acknowledgement. Accordingly, it requests the next user with more requests to transmit the data to the users who failed to receive it. This process continues until all the users receive the data, this improves the transmission efficiency. By simulation we prove that throughput increases, blocking probability and latency get reduced. All these increase the Quality of Service (QoS) compared to Intra cluster D2D communication for a small world model based on poor link quality between the users [3].

LTE Release 8 is one of the primary broadband technologies based on OFDM, which is currently being commercialized. LTE Release 8, which is mainly deployed in a macro/microcell layout, provides improved system capacity and coverage, high peak data rates, low latency, reduced operating costs, multi-antenna support, flexible bandwidth operation and seamless integration with existing systems. LTE-Advanced (also known as LTE Release 10) significantly enhances the existing LTE Release 8 and supports much higher peak rates, higher throughput and coverage, and lower latencies, resulting in a better user experience. Additionally, LTE Release 10 will support heterogeneous deployments where low-power nodes comprising picocells, femtocells, relays, remote radio heads, and so on are placed in a macrocell layout. The LTE-Advanced features enable one to meet or exceed IMT-Advanced requirements. It may also be noted that LTE Release 9 provides some minor enhancement to LTE Release 8 with respect to the air interface, and includes features like dual-layer beamforming and time-difference- of-arrival-based location techniques. In this article an overview of the techniques being considered for LTE Release 10 (aka LTEAdvanced) is discussed. This includes bandwidth extension via carrier aggregation to support deployment bandwidths up to 100 MHz, downlink spatial multiplexing including single-cell multi-user multiple-input multiple-output transmission and coordinated multi point transmission, uplink spatial multiplexing including extension to four-layer MIMO, and heterogeneous networks with emphasis on Type 1 and Type 2 relays. Finally, the performance of LTEAdvanced using IMT-A scenarios is presented and compared against IMT-A targets for full buffer and bursty traffic model.

Network service chaining allows composing services out of multiple service functions. Traditional network service functions include, e.g., firewalls, TCP optimizers, web proxies, or higher layer applications. Network service chaining requires flexible service function deployment models. Related work facilitating service chaining include, e.g., the network service header proposal discussed at the IETF or the complementary work on network function virtualization (NFV) at ETSI. This position paper presents a high-level concept and architecture to enable service chaining using Software Defined Networking (SDN), specifically OpenFlow in a telecommunication environment. The paper discusses required functionalities, challenges, and testbed aspects to implement and test such an approach. Finally, the set of implemented service functions and management interfaces are highlighted to demonstrate the approach as a proof of concept for a selection of relevant use cases.

Many of today's enterprise-scale wireless networks are protected by the WPA2-Enterprise Protected Extensible Authentication Protocol (PEAP). In this paper it is demonstrated how an attacker can steal a user's credentials and gain unauthorized access to such networks, by utilizing a class of vulnerable devices as MSCHAPv2 challenge response oracles. More specifically this paper explains how on these devices, Lightweight EAP (LEAP) MSCHAPv1 credentials can be captured and converted to PEAP MSCHAPv2 credentials by using a rogue Access Point. This man-in-the-middle vulnerability was found to be present in all current versions of Apple's iOS and OS X operating systems, and may impact other devices as well. A proof-of-concept implementation is available that shows how Authentication Server certificate validation and certificate pinning mechanisms may be bypassed. Mitigation strategies for the attack and protective actions which can be undertaken by end-users are also described in this paper.

Network graphs satisfying redundancy and coexistence can be planarized by means of local algorithms without making assumptions on the nodes’ communication ranges. We generalize these properties to k -weak and k-strong coexistence and redundancy. Subsequently, we give empirical evidence that these properties are present in simulated wireless sensor networks as well as in actual testbed deployments, especially if looking at the graph’s c-hop clustered overlay representations, for \(c\le 2\).

Wireless Sensor Networks (WSNs) have emerged as perhaps the most important networking paradigm of recent times, both in terms of their commercial potential and also from a scientific point of view. WSNs are important commercially because of their many applications, spanning from civil to military applications such as structural monitoring of bridges, monitoring of wildlife, tracking of contaminants in the soil and atmosphere. Some of these applications have already proved to be commercially viable and indeed financially very attractive. WSNs are also very important from a scientific point of view, because of their unique features with respect to other types of wireless networks: nodes are typically immobile, and are required to carry a specific type of traffic (which is advantageous), have extreme restrictions on the energy they consume, the processing power they have, and the antennas they can use (which is disadvantageous); in addition, the data created at different sensors may be strongly correlated, which can be beneficial but requires only good algorithms that take advantage of it. Therefore, in the last few years we have experienced an important shift in research activities, moving from general purpose wireless networks to more focused topics specifically on WSNs, taking into account their specific advantages and peculiarities. An important recurring theme in research in this field is the need for energy efficiency, which is the thread of this special issue. The papers which appear in this issue have been carefully selected from the best IEEE PIMRC 2008 conference papers addressing the issue of energy efficiency in WSNs. The respective authors have been asked to provide a significantly extended version of the conference paper, which has subsequently undergone a rigorous review process according to the IJWIN publication standards prior to acceptance. The final set of papers addresses issues at physical, medium access control and networking layers, and to some extent at the application layer. All of these papers take into account the unique peculiarities, advantages, and shortcomings of wireless sensor networks, and propose algorithms and analyses that significantly advance research in the field. We sincerely hope you will enjoy reading them as much as we did. The author of the first paper ‘‘Power Management and Data Rate Maximization in Wireless Energy Harvesting Sensors’’ by Chandra R. Murthy, deals with the problem of power management and throughput maximization for energy neutral operation when using increasingly important but so far rarely analyzed Energy Harvesting Sensors (EHS) to send data over wireless links. The EHS is assumed to be able to harvest energy at a constant rate, and use a fixed part of the energy harvested in a slot for measuring the channel state. The rest of the harvested energy is available for transmission, but it can also be stored in an Wireless Sensor Networks (WSNs) have emerged as perhaps the most important networking paradigm of recent times, both in terms of their commercial potential and also from a scientific point of view. The papers that appear in this issue have been carefully selected from the best IEEE PIMRC 2008 conference papers which addressed the issue of energy efficiency in WSNs. The final set of papers addresses issues at physical, medium access control, networking and to some extend application layers. All of these papers take into account the unique peculiarities, advantages, and shortcomings of wireless sensor networks, and propose algorithms and analyses that significantly advance research in the field. Note that this activity has been partly supported by the NoE-216715 NEWCOM++.

Free-space optical networks have serious block erasures due to atmospheric turbulence and require an entirely new network architecture from Layer 1 to Layer 4 for big data flows.

In recent years, large field sensing has been widely studied whereby an application for representative agricultural and disaster reduction utilizes a wireless sensor network (WSN). However, outdoor field sensing involves problems related to communication quality and distance. Particularly, the communication reliability in portable wireless sensor networks is greatly influenced by the surrounding environmental factors which affects the communication nodes' movement. Unlike fixed wireless sensor networks, radio wave conditions are dynamic, which yields many differences such as the effects of plants. Both the performance and communication quality are addressed by proposing a full-mesh network capable of high speed re-connecting at the time of the failure. We evaluated the problems by deploying outdoor sensor nodes based on our proposed system.

Analytics of network telemetry data helps address many important operational problems. Traditional Big Data approaches run into limitations even as they push scale boundaries for processing data further. One reason for this is the fact that in many cases, the bottleneck for analytics is not analytics processing itself but the generation and export of the data on which analytics depends. The amount of data that can be reasonably collected from the network runs into inherent limitations due to bandwidth and processing constraints in the network itself. In addition, management tasks related to determining and configuring which data to generate lead to significant deployment challenges. In order to address these issues, we propose a novel distributed solution to network analytics that we have implemented as a proof of concept, called DNA (Distributed Network Analytics). In DNA, analytics processing is performed at the source of the data by specialized agents embedded within network devices, which also dynamically set up and reconfigure telemetry data sources as required by an analytics task. An SDN controller application orchestrates network analytics tasks across the network to allow users to interact with the network as a whole instead of individual devices one at a time. Our demonstration of DNA includes a GUI front end used to specify and monitor analytics tasks as well as visualize analytics results.

The capacity benefits of flexi-grid optical networks are limited by the finite amount of bandwidth of standard fibers, and will not be able to scale indefinitely. Space Division Multiplexing (SDM) has emerged as a promising technology to overcome this limitation. In this preliminary work we give an overview of current SDM technologies, covering coupled and non-coupled SDM networks, and of the possibilities and limitations they bring to the problem of Routing, Space and Spectrum Allocation (RSSA). We focus on the trade-offs between spectral efficiency and amount of transmission devices enabled by SDM technologies, presenting a number of preliminary heuristic policies to solve RSSA, and evaluating them in the context of dynamic traffic by means of simulations. We show that different heuristics can optimize different aspects of RSSA, and that one strikes a reasonable balance.

Nowadays, the Internet of Things is able to provide more advanced services to people, which connects a variety of devices, systems and applications. However, it covers a variety of devices, protocols and applications, which makes it much more complex. In the main application areas, wireless sensor networks with a frequent but short communication character, it requires an efficient and flexible protocol to protect the information. To protect the traffic of the Internet of Things is the focal point of this research work. Although many protocols for the Internet have been put forward, it is still not enough to meet the increasingly complex requirements from applications. Many of them are not efficient enough to adapt the device diversity and timely communication environment. This paper is trying to address this problem, by proposing a peer-to-peer security protocol to satisfy this varied environment. Secure communication is implemented on an open sourced platform for the Internet of Things. Its less handshake in future sessions and dynamic security level adjustment feature satisfies the realistic demand on this platform. Finally, with a comparison test, the result shows that the proposed protocol is efficient to meet the specific goals and applicable for the Internet of Things applications.

In recent development, the use of Wireless Sensor Network (WSN) to handle more complex functions is increasing drastically which in turns requires their powered battery sensors to efficiently utilise their energy in order to prolong the network lifetime for the heterogeneous nodes. Clustering is one of the techniques used to optimise this energy consumption and increasing the network lifetime as well. In recent years, many clustering protocols have been proposed based on heterogeneity like SEP,LEACH,E-LEACH etc .In these protocols, a Cluster Head (CH) is selected having maximum energy among all the nodes. This paper will survey some of these clustering protocols for heterogeneous wireless sensor network.

Distributed Denial of Service (DDoS) attack has been identified as the biggest security threat to service availability in Cloud Computing. It prevents legitimate Cloud Users from accessing pool of resources provided by Cloud Providers by flooding and consuming network bandwidth to exhaust servers and computing resources. A major attribute of a DDoS attack is spoofing of IP address that hides the identity of the attacker. This paper discusses different methods for detecting spoofed IP packet in Cloud Computing and proposes Host-Based Operating System (OS) fingerprinting that uses both passive and active method to match the Operating System of incoming packet from its database. Additionally, how the proposed technique can be implemented was demonstrated in Cloud Computing environment.

Network censorship and surveillance generally in- volves ISPs working under the orders of repressive regimes, monitoring (and sometimes filtering) users' traffic, often using powerful networking devices, e.g. routers capable of performing Deep Packet Inspection (DPI). Such routers enables their opera- tors to observe contents of network flows (traversing their routers) having specific byte sequences. Tor, a low-latency anonymity network has also been widely used to circumvent censorship and surveillance. However, recent efforts have shown that all anti-censorship measures employable using Tor, e.g. Bridges (unadvertised relays) or camouflaging Tor traffic as unfiltered protocol messages (e.g. SkypeMorph), are detectable. To bypass this arms race, several recent efforts propose network based anti- censorship systems, collectively and colloquially referred to as Decoy Routers. Decoy Routing systems, relying on "friendly" network routers, aid users behind censorious ISPs to covertly access filtered networks. These Decoy Routers, otherwise operating as "normal" network routers, can on-demand double as Decoy Routers, for- warding network traffic of censored users to covert destinations. Such architectures however assume complex functionalities and programmable capabilities in commodity network routers, that currently seem infeasible. However Software Defined Networking (SDN), the emergent network design and management paradigm, involving centralized control over a network of switches, seems well suited for such requirements. In this position paper, we present the overview of a network based anti-censorship system consisting of several centrally co-ordinated switches, operating as Decoy Routers. Deploying centrally controlled switches, that dou- ble as Decoy Routers, could potentially have several advantages over existing proposal, that have until now only been prototyped through commodity desktops - efficiency to switch traffic at line speeds, detecting misbehaving switches, cascading multiple Decoy Routers to assume a hybrid posture for both anonymity and censorship resistance, load-balancing, and automatic failover.

1. Interworking Architectures for IP Multimedia Subsystems Arslan Munir and Vincent W.S. Wong 2. Optimal Admission Control Policies for Heterogeneous Wireless Networks Amin Farbod and Ben Liang 3. Comparison of Multimedia Delivery Scenarios Using Parallel Wireless Links and Path Diversity Ki-Dong Lee, Byung K. Yi, and Victor C.M. Leung 4. Towards an FBM Model Based Network Calculus Framework with Service Differentiation Yu Cheng, Weihua Zhuang and Xinhua Ling. This paper was selected for QShine’2007 Best Paper Award. 5. On Throughput Efficiency of Geographic Opportunistic Routing in Wireless Ad Hoc Networks Kai Zeng, Wenjing Lou, Jie Yang, and Donald R. Brown III. This paper was selected for QShine’2007 Best Paper Award Runner-Up.

Wireless sensor network is an emerging field in wireless networking. Wireless Sensor Node (WSN) is the key component of wireless sensor networks for data communication inn large networks. WSN is powered with battery as its source of energy. It is usually deployed in hostile. Alkaline batteries are dominantly used in WSN. We need to maximize utilization of battery used in WSN. In this paper we have reviewed various models of the alkaline battery for maximizing its utilization and its lifetime. A brief experiment on relaxation model has been carried out which is most suitable battery model for predicting lifetime of battery in WSN.

Clustering is expected to be one of the most efficient and promising solutions for data transmission in Vehicular Ad hoc NETworks (VANET). The particular characteristics of VANET, including highly dynamic network topology, unstable transmission channel, and various service requirements, pose challenges and difficulties on clustering algorithm design. In this paper, a clustering algorithm based on utility function is proposed for VANET. The utility function of vehicles is formulated which jointly considers current state of vehicles characterized by the vehicle degree, relative velocity and position between adjacent vehicles, and long-term transmission performance of vehicles, defined as credit history function, which is characterized by the average available bandwidth, queue length and the duration for being a cluster head (CH) in a past period. The process of cluster forming is presented, and the vehicles with large utility function are selected as CHs successively. Numerical simulations demonstrate that comparing to previously proposed algorithms, the proposed algorithm offers better performance in terms of packet delivery rate, average transmission delay and total throughput.

This paper proposed a green transmission power control scheme for cellular networks in the smart grid environment where several electricity retailers offer different prices to the BSs. The power allocation of each BS is formulated as a non-cooperative game. In a dynamic environment, the competition behaviors of BSs are modeled as a stochastic learning process and a conjecture based multi-agent reinforcement learning algorithm is proposed. Numerical results show that our proposed scheme can significantly improve the network's energy efficiency and reduce operational expenditure.

In this paper, we study how to deploy different kinds of base stations (BSs) in green cellular networks. Unlike previous studies which deploy BSs only based on the peak traffic load, we propose an optimal deployment scheme to minimize the total power consumption over time and spatial domain based on the traffic variation characteristics. Our method can be decomposed of two steps: how to achieve limit suboptimal deployment scheme according to peak rate and how to operate BSs on/off in low load for the given deployment. A greedy heuristic deployment algorithm is proposed to additionally deploy micro BSs and separately replace macro BS. Simulations based on the regular BS topologies and real traffic profiles show that the proposed algorithms can significantly reduce the energy consumption.

Power companies are deploying a multitude of sensors to monitor the energy grid. Measurements at different locations should be aligned in time to obtain the global state of the grid, and the industry therefore uses GPS as a common clock source. However, these sensors are exposed to GPS time spoofing attacks that cause misaligned aggregated measurements, leading to inaccurate monitoring that affects power stability and line fault contingencies. In this paper, we analyze the resilience of phasor measurement sensors, which record voltages and currents, to GPS spoofing performed by an adversary external to the system. We propose a solution that leverages the characteristics of multiple sensors in the power grid to limit the feasibility of such attacks. In order to increase the robustness of wide-area power grid monitoring, we evaluate mechanisms that allow collaboration among GPS receivers to detect spoofing attacks. We apply multilateration techniques to allow a set of GPS receivers to locate a false GPS signal source. Using simulations, we show that receivers sharing a local clock can locate nearby spoofing adversaries with sufficient confidence.

Wireless devices are often used in application scenarios with strict security requirements. Examples are physical intrusion detection systems commonly used to protect factories, airports or government buildings. In such scenarios, additional security features such as tamper detection are highly desirable to complement traditional cryptographic mechanisms. In this paper we use channel state information (CSI), extracted from off-the-shelf 802.11n Wi-Fi cards, to calculate a tamper-evidence value for transmitters. This value enables detection of tampering due to device movement or replacement. We describe algorithms for tamper-evidence value computation, discuss the interpretation of this value and evaluate its effectiveness.

This paper investigates the security offered by PHY schemes that are well oriented towards jointly providing security and protection form channel errors. In particular, we focus on constructions that were recently proposed in the literature, whose security relies on the secrecy of parameters defining the encoding/decoding process of convolutional codes. Such schemes were shown to be quite promising in terms of error correcting capabilities, but no security analysis was provided to justify their use for wireless communications. To this end, we evaluate the strength of the PHY security scheme against chosen plaintext attacks, as well as known plaintext attacks that are built upon an extension of the known algorithm of Blum, Kalai, and Wasserman. The security analysis derives the parameters to be used for achieving a high security level against such type of attacks with low encoding and decoding complexity.

In mobile data access, cellular operators usually charge users purely based on the delivered data volume. However, the actual used radio resources in transmitting the same amount of data might be significantly different in various traffic patterns. In this paper, we conduct a in-depth study to unveil the radio resource consumption for mobile data transfer. We disclose that radio resources are consumed not only for data transfer but also for control signals and the overhead of channel allocation. We further develop an approach to quantify the total radio resource costs, particularly the hidden costs of signaling messages and dedicated channels. We have conducted measurement of various mobile apps in two operational cellular networks. The results reveal huge hidden costs in some always-online apps and demonstrate that apps diversity yields unproportional radio resource usage with a gap as large as 116 times.

Delay tolerant networks generally use the epidemic routing protocol, because stable routing paths can hardly be maintained. However, the epidemic scheme leads to much network overheads because the messages are delivered to all the devices. In this paper, we propose an efficient protocol based on the human mobility patterns. In the proposed protocol, a message is delivered to several devices that are expected to deliver well the message to the destination. The proposed protocol relies on the human mobility patterns that contain the regularity. The simulation demonstrates that the proposed protocol reduces the network overheads, while maintaining reasonable delay time.

Conventional network management was based on wired network, which is unsuitable for resource constrained devices. WSNs consist Internet of Things (IoT) can be large scale networks, and it is impossible to manage each node individually. In this paper, we propose a network management protocol for WSNs to reduce management traffic.

This paper presents a comprehensive survey on delay-tolerant networks, an architecture originally designed for the Interplanetary Internet, this delay-tolerant networks is a communication system used to provide Internet-like services in interplanetary distances to support of deep space exploration. This paper describes the basic of Delay-Tolerant Networks (DTN) and its different areas. It also explores the routing techniques used in Delay-Tolerant Networks (DTN). It also comprises the comparison of different routing protocols in Delay-Tolerant Networks (DTN). At last, based on shortcoming of existing protocol, this paper presents the problem definition for new work.

An ad hoc wireless system is an accumulation of self-ruling nodes or terminals that interacts with each other by framing a multi-hop radio system and keeps connectivity in a decentralised way. This implies that it can maintain the system promptly without the need of framework organisation. In spite, there has been a developing enthusiasm for mobile ad hoc networks as the method for giving sudden links to a group of nodes. The energy requirement of a portable node is typically a battery and the battery depletion is one of the real constraints behind the node failure. Entire mobile nodes may not be inside the transmission range of each other thus they need to interact with multi-hop approach. The loss of a unique node can incredibly influence the entire execution of the system. Thus, to utilise the constrained energy source viably and to maximise the life time of the system numerous energy effective routing protocols have been proposed for MANETs that in turn utilise diverse applications to preserve energy. Here it aims to improve the accuracy of performance evaluation therefore it is required to consider the evaluation of protocols at different layers which leads to better energy solutions. The present research will focus on evaluating performance of energy efficient protocols at different layers.

We introduce a virtual Peer-to-Peer (P2P) client with the property of separating the data and control planes of a traditional P2P client. In this model, an end user will access and control the virtual P2P client application using a web browser. All P2P application-related control messages will be originated from and terminated to the virtual P2P client deployed inside the remote server. The web browser running on the user device will only manage the download and upload of the P2P data packets. Since BitTorrent is the most widely deployed P2P client, we study a BitTorrent-specific virtual P2P client. We also discuss the implementation challenges of our proposed architecture.

We show that distributed data processing for M2M applications improves the performance of M2M systems. The important roles of the M2M systems are to associate an application with required data and to execute the application on suitable processing entities for coming ubiquitous environment. First, we show simple rules on deployment of data process to reduce load in underlying M2M network. Next, we clarify cases such that an application should be divided into subroutines for distributed executions. And so, we model centralized and distributed execution as multi-stage queuing system to show the improvement by the distributed execution.

The above referenced paper was retracted by the publisher due to quality concerns in June 2021.

The above referenced paper was retracted by the publisher due to quality concerns in June 2021.

SDN provides an abstract view of the network in which the switches expose a homogeneous set of capabilities. Unfortunately, the abstraction process may hide important information about the devices that finally impacts on the network operations. Although SDN implementations, like OpenFlow, already account for some device specific properties, we believe that other important ones have been so far overlooked. To this regard, we focus on the switches' performance at handling control messages and on how this may affect the control plane design. To support our discussion, we provide theoretical examples and simulation-based experiments. We conclude that accounting for switches performance at handling control messages is a crucial step in the design of advanced SDN control plane features.

Producing IEEE 802.15.4 PHY-frames reliably accepted by some digital radio receivers, but rejected by others---depending on the receiver chip's make and model---has strong implications for wireless security. Attackers could target specific receivers by crafting "shaped charges," attack frames that appear valid to the intended target and are ignored by all other recipients. By transmitting in the unique, slightly non-compliant "dialect" of the intended receivers, attackers would be able to create entire communication streams invisible to others, including wireless intrusion detection and prevention systems (WIDS/WIPS).These scenarios are no longer theoretic. We present methods of producing such IEEE 802.15.4 frames with commodity digital radio chips widely used in building inexpensive 802.15.4-conformant devices. Typically, PHY-layer fingerprinting requires software-defined radios that cost orders of magnitude more than the chips they fingerprint; however, our methods do not require a software-defined radio and use the same inexpensive chips.Knowledge of such differences, and the ability to fingerprint them is crucial for defenders. We investigate new methods of fingerprinting IEEE 802.15.4 devices by exploring techniques to differentiate between multiple 802.15.4-conformant radio-hardware manufacturers and firmware distributions. Further, we point out the implications of these results for WIDS, both with respect to WIDS evasion techniques and countering such evasion.

Big Data is conceived as the powerful tool to exploit all the potential of the Internet of Things and the Smart Cities. A new dimension of understanding about the human behaviours is expected to be reached through all the gathered data in the emerging smart environment. This work analyses the data from the European Project SmartSantander. This work has correlated the traffic behaviour with respect to the temperature in the Santander City. This has been presented as the evolution of both flows present a similar behaviour. Specifically, they present a fine grain correlation of over the 57%. Finally, it has been also presented as the traffic distribution, aggregated by temperature bins, follows up a Poisson distribution model. Thereby, allowing interpolate and predict complex behaviours based on simple measures such as the temperature.

In this paper, we give a list of ATM related papers. This is not a complete list. Rather, it represents the bulk of the references in this ever-growing area. For easier use of this reference list, we have classified the papers into the following six categories: general, source characterization, switching, congestion control, routing, and transport.

Delay tolerant networks (DTNs) are a special type of wireless mobile networks which may lack continuous network connectivity. Multicast supports the distribution of data to a group of users, a service needed for many potential DTNs applications. While multicasting in the Internet and mobile ad hoc networks has been studied extensively, due to the unique characteristic of frequent partitioning in DTNs, multicasting in DTNs is a considerably different and challenging problem. It not only requires new destinations of multicast semantics, but also brings new issues to the design of routing algorithms. In this paper, we propose new forwarding models for DTNs multicast and develop several multicast forwarding algorithms. We use delegation forwarding (DF) in DTNs multicast and compare it with single and multiple copy multicast models, which are also proposed in this paper. From the analytical results, we have the following conclusions: (1) Although the single copy model has the smallest number of forwardings, its latency is much longer than the other two models. (2) Among these three models, the delegation forwarding model has the least delay. The effectiveness of our approach is verified through extensive simulation both in synthetic and real traces.

With the rapid development of wireless network, online reading has become available in mobile reading devices. E-reader users can read and buy books through wireless network. Users can not only access to real-time comprehensive resource, but also access to book reviews, book recommendations etc. 3G communicating technology significantly improved data transfer speed which can meet network transmission speed requirements for a variety of network applications. Mobile bookstore provides powerful service functions to mobile devices users. A bookstore application solution in E-paper reading device is presented in this paper. The wireless network of the scheme is designed by C/S structure. The system achieves "seamless connection" of user terminals. The workflow between client and server is suggested too, which can provides the technical basis of 3G mobile business applications.

IPv6 is being deployed but many Internet Service Providers have not implemented its support yet. Most of the end users have IPv6 ready computers but their network doesn’t support native IPv6 connection so they are forced to use transition mechanisms to transport IPv6 packets through IPv4 network. We do not know, what kind of traffic is inside of these tunnels, which services are used and if the traffic does not bypass security policy. This paper proposes an approach, how to monitor IPv6 tunnels even on high-speed networks. The proposed approach allows to monitor traffic on 10, Gbps links, because it supports hardware-accelerated packet distribution on multi-core processors. A system based on the proposed approach is deployed at the CESNET2 network, which is the largest academic network in the Czech Republic. This paper also presents several statistics about tunneled traffic on the CESNET2 backbone links.

Dedicated short range communication (DSRC) has been allocated (3 EU, 7 US) dedicated channels at 5.9GHz for vehicular communications. Although resource allocations on the Control Channel (CCH) reserved for safety-related applications have been well investigated, efficient usage of the other Service Channels (SCH) has attracted less attention. In this paper, we propose the design of an asynchronous multichannel mechanism for service management at 5.9GHz. Whereas the service phase defined in the IEEE WAVE standard requires vehicles to remain tuned on a given service channel, the proposed mechanism relies on cognitive principles to let service providers and users dynamically switch between channels and converge to a rendezvous channel where they can negotiate service support and conditions. The mechanism has been implemented on the ETSI compliant ITS simulation platform iTETRIS. We investigate the delay required to converge to such rendezvous channel and illustrate that an optimal cognitive parameter set manages to keep it within an acceptable range, and yet provides more flexibility to the channel usage.

LTE-Direct is an upcoming LTE rel. 12 extension to allow UEs to communicate directly without going through an eNB. LTE-Direct is expected to be used in future LTE-A networks for unicast Proximity Services, and has not been envisioned so far for broadcast transmissions. In this paper, we propose an eMBMS-inspired mechanism to allocate LTE-Direct resources for dedicated broadcast/multicast vehicular safety communications. The mechanism does not require any connection procedure for LTE-Direct broadcast transmissions, and proposes to reserve identical LTE downlink resources over multiple eNB for dedicated communications between UEs. We apply this concept to the periodic broadcast of BSM/CAM and illustrate that the mechanism's flexibility and extensibility makes LTE-Direct a good complementary technology to DSRC for periodic vehicular safety communications.

Remote diagnostics protocols have generally only considered correct authentication to be enough to grant access to vehicles. However, as diagnostics equipment or their keys can be stolen or copied, these devices can not be trusted. Thus, authentication alone is not enough to prevent unauthorized access to vehicles. In previous work, we proposed an authorization protocol to prevent unauthorized access to vehicles. In this paper, we formally prove that the proposed authorization protocol provides mutual authentication between the diagnostics equipment and the vehicle, and that it guarantees both secrecy of the distributed session key and freshness of the distributed authorization information. Our formal analysis is conducted using both the Burrows-Abadi-Needham (BAN) Logic and the PROVERIF automated verification tool.

Many applications of inter-vehicle communication networks (IVC) rely on multi-hop dissemination of information using vehicle-to-vehicle communication. An example are traffic information systems, which aim to provide up-to-date information about traffic jams to drivers. Due to the large amount of information and wide dissemination ranges, naive protocols fail to scale to multi-hop dissemination. Therefore, a wide range of efficient protocols has been investigated. While clustering protocols are successfully used for similar applications in other domains, such as wireless sensor networks, they have been neglected by IVC research, because they often fail due to high vehicle mobility. In this paper, we present a data-similarity-based approach for clustering in inter-vehicle networks, which is built to work in high mobility settings. In contrast to existing clustering proposals, we explicitly draw from knowledge gained during the development of other multi-hop dissemination mechanisms in general and in- network aggregation in particular. We demonstrate our approach with a clustering protocol proposal and show first evaluation results using theoretical analyses.