Search

Cyber attacks constitute a significant threat to organizations with implications ranging from economic, reputational, and legal consequences. As cybercriminals' techniques get sophisticated, information security professionals face a more significant challenge to protecting information systems. In today's interconnected realm of computer systems, each attack vector has a network dimension. The present study investigates network intrusion attempts with anomaly-based machine learning models to provide better protection than the conventional misuse-based models. Two models, namely an ensemble learning model and a convolutional neural network model, were built and implemented on a data set gathered from a real-life, institutional production environment. To demonstrate the models' reliability and validity, they were applied to the UNSW-NB15 benchmarking data set. The type of attack was limited to probing attacks to keep the scope of the study manageable. The findings revealed high accuracy rates, the CNN model being slightly more accurate., Comment: 15 pages, published in IEEE Access 2021, https://ieeexplore.ieee.org/document/9387304

Deep Neural Networks (DNNs) have shown great success in completing complex tasks. However, DNNs inevitably bring high computational cost and storage consumption due to the complexity of hierarchical structures, thereby hindering their wide deployment in Internet-of-Things (IoT) devices, which have limited computational capability and storage capacity. Therefore, it is a necessity to investigate the technologies to compact DNNs. Despite tremendous advances in compacting DNNs, few surveys summarize compacting-DNNs technologies, especially for IoT applications. Hence, this paper presents a comprehensive study on compacting-DNNs technologies. We categorize compacting-DNNs technologies into three major types: 1) network model compression, 2) Knowledge Distillation (KD), 3) modification of network structures. We also elaborate on the diversity of these approaches and make side-by-side comparisons. Moreover, we discuss the applications of compacted DNNs in various IoT applications and outline future directions., Comment: 25 pages, 11 figures

High performance packet classification is a key component to support scalable network applications like firewalls, intrusion detection, and differentiated services. With ever increasing in the line-rate in core networks, it becomes a great challenge to design a scalable and high performance packet classification solution using hand-tuned heuristics approaches. In this paper, we present a scalable learning-based packet classification engine and its performance evaluation. By exploiting the sparsity of ruleset, our algorithm uses a few effective bits (EBs) to extract a large number of candidate rules with just a few of memory access. These effective bits are learned with deep reinforcement learning and they are used to create a bitmap to filter out the majority of rules which do not need to be full-matched to improve the online system performance. Moreover, our EBs learning-based selection method is independent of the ruleset, which can be applied to varying rulesets. Our multibit tries classification engine outperforms lookup time both in worst and average case by 55% and reduce memory footprint, compared to traditional decision tree without EBs., Comment: 6 pages. arXiv admin note: text overlap with arXiv:2205.07973

Owing to small size, sensing capabilities and autonomous nature, the Unmanned Air Vehicles (UAVs) have enormous applications in various areas, e.g., remote sensing, navigation, archaeology, journalism, environmental science, and agriculture. However, the unmonitored deployment of UAVs called the amateur drones (AmDr) can lead to serious security threats and risk to human life and infrastructure. Therefore, timely detection of the AmDr is essential for the protection and security of sensitive organizations, human life and other vital infrastructure. AmDrs can be detected using different techniques based on sound, video, thermal, and radio frequencies. However, the performance of these techniques is limited in sever atmospheric conditions. In this paper, we propose an efficient unsupervise machine learning approach of independent component analysis (ICA) to detect various acoustic signals i.e., sounds of bird, airplanes, thunderstorm, rain, wind and the UAVs in practical scenario. After unmixing the signals, the features like Mel Frequency Cepstral Coefficients (MFCC), the power spectral density (PSD) and the Root Mean Square Value (RMS) of the PSD are extracted by using ICA. The PSD and the RMS of PSD signals are extracted by first passing the signals from octave band filter banks. Based on the above features the signals are classified using Support Vector Machines (SVM) and K Nearest Neighbor (KNN) to detect the presence or absence of AmDr. Unique feature of the proposed technique is the detection of a single or multiple AmDrs at a time in the presence of multiple acoustic interfering signals. The proposed technique is verified through extensive simulations and it is observed that the RMS values of PSD with KNN performs better than the MFCC with KNN and SVM., 25 pages, 10 figures, accepted for the publication in future issue of "Computer Communications (2020)"

This paper presents the overview of the current trends of Big data against the computing scenario from different aspects. Some of the important aspect includes the Exascale, the computing power and the kind of applications which offer the Big data. This starts with the current computing hardware constraint against the need of the rising Big data applications. We highlight the issues and challenges of energy requirement, software complexity, hardware failure, fault tolerant computing, and communication. As the complexity of computation is going to rise in the future. The paper also highlights the future direction of Big computing systems for Bioinformatics, social media, hardware and software requirements, data intensive computation and then towards GPU era., Comment: Published in EAI Endorsed Transactions on Scalable Information Systems

Heterogeneous manycore architectures are the key to efficiently execute compute- and data-intensive applications. Through silicon via (TSV)-based 3D manycore system is a promising solution in this direction as it enables integration of disparate computing cores on a single system. However, the achievable performance of conventional through-silicon-via (TSV)-based 3D systems is ultimately bottlenecked by the horizontal wires (wires in each planar die). Moreover, current TSV 3D architectures suffer from thermal limitations. Hence, TSV-based architectures do not realize the full potential of 3D integration. Monolithic 3D (M3D) integration, a breakthrough technology to achieve - More Moore and More Than Moore - and opens up the possibility of designing cores and associated network routers using multiple layers by utilizing monolithic inter-tier vias (MIVs) and hence, reducing the effective wire length. Compared to TSV-based 3D ICs, M3D offers the true benefits of vertical dimension for system integration: the size of a MIV used in M3D is over 100x smaller than a TSV. In this work, we demonstrate how M3D-enabled vertical core and uncore elements offer significant performance and thermal improvements in manycore heterogeneous architectures compared to its TSV-based counterpart. To overcome the difficult optimization challenges due to the large design space and complex interactions among the heterogeneous components (CPU, GPU, Last Level Cache, etc.) in an M3D-based manycore chip, we leverage novel design-space exploration algorithms to trade-off different objectives. The proposed M3D-enabled heterogeneous architecture, called HeM3D, outperforms its state-of-the-art TSV-equivalent counterpart by up to 18.3% in execution time while being up to 19 degrees Celcius cooler., Comment: This work has been accepted in ACM Transactions on Design Automation of Electronic Systems

In 2030, we are going to evidence the 6G mobile communication technology, which will enable the Internet of Everything. Yet 5G has to be experienced by people worldwide and B5G has to be developed; the researchers have already started planning, visioning, and gathering requirements of the 6G. Moreover, many countries have already initiated the research on 6G. 6G promises connecting every smart device to the Internet from smartphone to intelligent vehicles. 6G will provide sophisticated and high QoS such as holographic communication, augmented reality/virtual reality and many more. Also, it will focus on Quality of Experience (QoE) to provide rich experiences from 6G technology. Notably, it is very important to vision the issues and challenges of 6G technology, otherwise, promises may not be delivered on time. The requirements of 6G poses new challenges to the research community. To achieve desired parameters of 6G, researchers are exploring various alternatives. Hence, there are diverse research challenges to envision, from devices to softwarization. Therefore, in this article, we discuss the future issues and challenges to be faced by the 6G technology. We have discussed issues and challenges from every aspect from hardware to the enabling technologies which will be utilized by 6G., Comment: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible

In this paper we consider a set of heterogeneous terminals in a urban area that are interested in collecting the information originated from several sources. This set includes mobile nodes (pedestrian and vehicles) and fixed terminals. In particular, each terminal aims at retrieving the data items in a limited region of interest (ROI) centered around the node position. Since data items may change over time all nodes must strive for having access to the latest version. The goal of the paper is to evaluate the amount of information each node is able to gather (coverage) resorting to simple distributed data collection and sharing through local broadcast communications. We study the diffusion of information updates in the whole area, evaluate the impact of energy saving policies in the protocol version run by pedestrian devices, and the impact of contextual awareness about location and motion of nodes in the forwarding policies. The study we present in this paper has been carried out through simulation. To this end we develop a discrete event simulator working on top of mobility and radio propagation traces obtained from the UDelModels tools that allow to obtain realistic traces of mobility and radio propagation., 41 pages, 11 figures

Mobile devices have become an indispensable component of Internet of Things (IoT). However, these devices have resource constraints in processing capabilities, battery power, and storage space, thus hindering the execution of computation-intensive applications that often require broad bandwidth, stringent response time, long battery life, and heavy computing power. Mobile cloud computing and mobile edge computing (MEC) are emerging technologies that can meet the aforementioned requirements using offloading algorithms. In this paper, we analyze the effect of platform-dependent native applications on computational offloading in edge networks and propose a lightweight process migration-based computational offloading framework. The proposed framework does not require application binaries at edge servers and thus seamlessly migrates native applications. The proposed framework is evaluated using an experimental testbed. Numerical results reveal that the proposed framework saves almost 44% of the execution time and 84% of the energy consumption. Hence, the proposed framework shows profound potential for resource-intensive IoT application processing in MEC., IoT, Edge Computing, Computational Offloading Framework, 2 Algorithms one for resource constraint client and another for edge server, and a unique and easy to setup real IoT testbed idea using of the shelf smartphones, 12 pages, 12 figures

The paper suggests methods to the assessment of information risks, which makes the transition from a qualitative assessment of information risks (according to the factor analysis of information risks methodology) to a quantitative assessment. The development factor analysis of information risks methodology of the methodology was carried out using the mathematical apparatus of probability theory, namely Bayesian networks. A comparative analysis of the standard factor analysis of information risks methodology and the developed methodology using statistical data was carried out. During the analysis, the cause and effect relationships of the confidentiality violation have been formed, defined and given in the corresponding table and in the form of the Ishikawa diagram. As an example, it was calculated the amount of risk the company may be exposed to in case of violation of information confidentiality according to the standard factor analysis of information risks methodology and the developed methodology. It is shown that the use of proposed technique allows quantifying the risk assessment that can be obtained using the factor analysis of information risks methodology., 4 pages, 1 figure, 1 table

The classification of the most used load balancing algorithms in distributed systems (including cloud technology, cluster systems, grid systems) is described. Comparative analysis of types of the load balancing algorithms is conducted in accordance with the classification, the advantages and drawbags of each type of the algorithms are shown. Performance indicators characterizing each algorithm are indicated., 4 pages

Coming cellular systems are envisioned to open up to new services with stringent reliability and energy efficiency requirements. In this paper we focus on the joint power control and rate allocation problem in Single-Input Multiple-Output (SIMO) wireless systems with Rayleigh fading and stringent reliability constraints. We propose an allocation scheme that maximizes the energy efficiency of the system while making use only of average statistics of the signal and interference, and the number of antennas $M$ that are available at the receiver side. We show the superiority of the Maximum Ratio Combining (MRC) scheme over Selection Combining (SC) in terms of energy efficiency, and prove that the gap between the optimum allocated resources converges to $(M!)^(1/(2M))$ as the reliability constraint becomes more stringent. Meanwhile, in most cases MRC was also shown to be more energy efficient than Switch and Stay Combining (SSC) scheme, although this does not hold only when operating with extremely large $M$, extremely high/small average signal/interference power and/or highly power consuming receiving circuitry. Numerical results show the feasibility of the ultra-reliable operation when $M$ increases, while greater the fixed power consumption and/or drain efficiency of the transmit amplifier is, the greater the optimum transmit power and rate., Comment: 15 pages, 12 figures, accepted for publication in IEEE TCOM

The article considers classification task of fractal time series by the meta algorithms based on decision trees. Binomial multiplicative stochastic cascades are used as input time series. Comparative analysis of the classification approaches based on different features is carried out. The results indicate the advantage of the machine learning methods over the traditional estimating the degree of self-similarity., 4 pages, 2 figures, 3 equations, 1 table

The paper presents an analysis of the main mechanisms of decryption of SSL/TLS traffic. Methods and technologies for detecting malicious activity in encrypted traffic that are used by leading companies are also considered. Also, the approach for intercepting and decrypting traffic transmitted over SSL/TLS is developed, tested and proposed. The developed approach has been automated and can be used for remote listening of the network, which will allow to decrypt transmitted data in a mode close to real time., 4 pages, 1 table, 1 figure

In the work, a comparative correlation and fractal analysis of time series of Bitcoin crypto currency rate and community activities in social networks associated with Bitcoin was conducted. A significant correlation between the Bitcoin rate and the community activities was detected. Time series fractal analysis indicated the presence of self-similar and multifractal properties. The results of researches showed that the series having a strong correlation dependence have a similar multifractal structure., Comment: 4

In this work the wireless networks security algorithms were analyzed. The fundamentals of the WPA and WPA2 safety algorithms, their weaknesses and ways of attacking WPA and WPA2 Enterprise Wireless Networks are described. Successful attack on the WPA2-PSK and WPA2-Enterprise was carried out during the performance of work. The progress of this attack and its results were described., 4 pages

This article considers a short survey of basic methods of social networks analysis, which are used for detecting cyber threats. The main types of social network threats are presented. Basic methods of graph theory and data mining, that deals with social networks analysis are described. Typical security tasks of social network analysis, such as community detection in network, detection of leaders in communities, detection experts in networks, clustering text information and others are considered.

Internet censors seek ways to identify and block internet access to information they deem objectionable. Increasingly, censors deploy advanced networking tools such as deep-packet inspection (DPI) to identify such connections. In response, activists and academic researchers have developed and deployed network traffic obfuscation mechanisms. These apply specialized cryptographic tools to attempt to hide from DPI the true nature and content of connections. In this survey, we give an overview of network traffic obfuscation and its role in circumventing Internet censorship. We provide historical and technical background that motivates the need for obfuscation tools, and give an overview of approaches to obfuscation used by state of the art tools. We discuss the latest research on how censors might detect these efforts. We also describe the current challenges to censorship circumvention research and identify concrete ways for the community to address these challenges., 9 pages

Big networks express various large-scale networks in many practical areas such as computer networks, internet of things, cloud computation, manufacturing systems, transportation networks, and healthcare systems. This paper analyzes such big networks, and applies the mean-field theory and the nonlinear Markov processes to set up a broad class of nonlinear continuous-time block-structured Markov processes, which can be applied to deal with many practical stochastic systems. Firstly, a nonlinear Markov process is derived from a large number of interacting big networks with symmetric interactions, each of which is described as a continuous-time block-structured Markov process. Secondly, some effective algorithms are given for computing the fixed points of the nonlinear Markov process by means of the UL-type RG-factorization. Finally, the Birkhoff center, the Lyapunov functions and the relative entropy are used to analyze stability or metastability of the big network, and several interesting open problems are proposed with detailed interpretation. We believe that the results given in this paper can be useful and effective in the study of big networks., Comment: 28 pages in Special Matrices; 2016

Many localization algorithms and systems have been developed by means of wireless sensor networks for both indoor and outdoor environments. To achieve higher localization accuracy, extra hardware equipments are utilized by most of the existing localization solutions, which increase the cost and considerably limit the location-based applications. The Internet of Things (IOT) integrates many technologies, such as Internet, Zigbee, Bluetooth, infrared, WiFi, GPRS, 3G, etc, which can enable different ways to obtain the location information of various objects. Location-based service is a primary service of the IOT, while localization accuracy is a key issue. In this paper, a higher accuracy localization scheme is proposed which can effectively satisfy diverse requirements for many indoor and outdoor location services. The proposed scheme composes of two phases: 1) partition phase, in which the target region is split into small grids; 2) localization refinement phase, in which a higher accuracy of localization can be obtained by applying an algorithm designed in the paper. A trial system is set up to verify correctness of the proposed scheme and furthermore to illustrate its feasibility and availability. The experimental results show that the proposed scheme can improve the localization accuracy., To appear in Journal of Supercomputing. arXiv admin note: substantial text overlap with arXiv:1011.3097

Online video streaming through mobile devices has become extremely popular nowadays. YouTube, for example, reported that the percentage of its traffic streaming to mobile devices has soared from 6% to more than 40% over the past two years. Moreover, people are constantly seeking to stream high quality video for better experience while often suffering from limited bandwidth. Thanks to the rapid deployment of content delivery networks (CDNs), popular videos are now replicated at different sites, and users can stream videos from close-by locations with low latencies. As mobile devices nowadays are equipped with multiple wireless interfaces (e.g., WiFi and 3G/4G), aggregating bandwidth for high definition video streaming has become possible. We propose a client-based video streaming solution, MSPlayer, that takes advantage of multiple video sources as well as multiple network paths through different interfaces. MSPlayer reduces start-up latency and provides high quality video streaming and robust data transport in mobile scenarios. We experimentally demonstrate our solution on a testbed and through the YouTube video service., accepted to ACM CoNEXT'14

The Internet heavily relies on Content Distribution Networks and transparent caches to cope with the ever-increasing traffic demand of users. Content, however, is essentially versatile: once published at a given time, its popularity vanishes over time. All requests for a given document are then concentrated between the publishing time and an effective perishing time. In this paper, we propose a new model for the arrival of content requests, which takes into account the dynamical nature of the content catalog. Based on two large traffic traces collected on the Orange network, we use the semi-experimental method and determine invariants of the content request process. This allows us to define a simple mathematical model for content requests; by extending the so-called "Che approximation", we then compute the performance of a LRU cache fed with such a request process, expressed by its hit ratio. We numerically validate the good accuracy of our model by comparison to trace-based simulation., Comment: 13 Pages, 9 figures. Full version of the article submitted to the ITC 2014 conference. Small corrections in the appendix from the previous version

In recent years, smartphones have become prevalent. Much attention is being paid to developing and making use of mobile applications that require position information. The Global Positioning System (GPS) is a very popular localization technique used by these applications because of its high accuracy. However, GPS incurs an unacceptable energy consumption, which severely limits the use of smartphones and reduces the battery lifetime. Then an urgent requirement for these applications is a localization strategy that not only provides enough accurate position information to meet users' need but also consumes less energy. In this paper, we present an energy-efficient localization strategy for smartphone applications. On one hand, it can dynamically estimate the next localization time point to avoid unnecessary localization operations. On the other hand, it can also automatically select the energy-optimal localization method. We evaluate the strategy through a series of simulations. Experimental results show that it can significantly reduce the localization energy consumption of smartphones while ensuring a good satisfaction degree.

The widespread proliferation of handheld devices enables mobile carriers to be connected at anytime and anywhere. Meanwhile, the mobility patterns of mobile devices strongly depend on the users' movements, which are closely related to their social relationships and behaviors. Consequently, today's mobile networks are becoming increasingly human centric. This leads to the emergence of a new field which we call socially-aware networking (SAN). One of the major features of SAN is that social awareness becomes indispensable information for the design of networking solutions. This emerging paradigm is applicable to various types of networks (e.g. opportunistic networks, mobile social networks, delay tolerant networks, ad hoc networks, etc) where the users have social relationships and interactions. By exploiting social properties of nodes, SAN can provide better networking support to innovative applications and services. In addition, it facilitates the convergence of human society and cyber physical systems. In this paper, for the first time, to the best of our knowledge, we present a survey of this emerging field. Basic concepts of SAN are introduced. We intend to generalize the widely-used social properties in this regard. The state-of-the-art research on SAN is reviewed with focus on three aspects: routing and forwarding, incentive mechanisms and data dissemination. Some important open issues with respect to mobile social sensing and learning, privacy, node selfishness and scalability are discussed., accepted. IEEE Systems Journal, 2013

Smartphones have been shipped with multiple wireless network interfaces in order to meet their diverse communication and networking demands. However, as smartphones increasingly rely on wireless network connections to realize more functions, the demand of energy has been significantly increased, which has become the limit for people to explore smartphones' real power. In this paper, we first review typical smartphone computing systems, energy consumption of smartphone, and state-of-the-art techniques of energy saving for smartphones. Then we propose a location-assisted Wi-Fi discovery scheme, which discovers the nearest Wi-Fi network access points (APs) by using the user's location information. This allows the user to switch to the Wi-Fi interface in an intelligent manner when he/she arrives at the nearest Wi-Fi network AP. Thus we can meet the user's bandwidth needs and provide the best connectivity. Additionally, it avoids the long periods in idle state and greatly reduces the number of unnecessary Wi-Fi scans on the mobile device. Our experiments and simulations demonstrate that our scheme effectively saves energy for smartphones integrated with Wi-Fi and cellular interfaces., accepted; Multimedia Systems, 2013. arXiv admin note: text overlap with arXiv:1201.0219

To supervise and guarantee a network security, the administrator uses different security components, such as firewalls, IDS and IPS. For a perfect interoperability between these components, they must be configured properly to avoid misconfiguration between them. Nevertheless, the existence of a set of anomalies between filtering rules and alerting rules, particularly in distributed multi-component architectures is very likely to degrade the network security. The main objective of this paper is to check if a set of security components are interoperable. A case study using a firewall and an IDS as examples will illustrate the usefulness of our approach., Security component, relevancy, misconfigurations detection, interoperability cheking, formal correction,formal verification, projection, IDS, Firewall

An OFDM system is combined with multiple-input multiple-output (MIMO) in order to increase the diversity gain and system capacity over the time variant frequency-selective channels. However, a major drawback of MIMO-OFDM system is that the transmitted signals on different antennas might exhibit high peak-to-average power ratio (PAPR).In this paper, we present a PAPR analysis reduction of space-timeblock-coded (STBC) MIMO-OFDM system for 4G wirelessnetworks. Several techniques have been used to reduce the PAPR of the (STBC) MIMOOFDM system: clipping and filtering, partial transmit sequence (PTS) and selected mapping (SLM). Simulation results show that clipping and filtering provides a better PAPR reduction than the others methods and only SLM technique conserve the PAPR reduction in reception part of signal., Comment: arXiv admin note: text overlap with arXiv:1205.2269 by other authors

This paper deals with the query problem in the Internet of Things (IoT). Flooding is an important query strategy. However, original flooding is prone to cause heavy network loads. To address this problem, we propose a variant of flooding, called Level-Based Flooding (LBF). With LBF, the whole network is divided into several levels according to the distances (i.e., hops) between the sensor nodes and the sink node. The sink node knows the level information of each node. Query packets are broadcast in the network according to the levels of nodes. Upon receiving a query packet, sensor nodes decide how to process it according to the percentage of neighbors that have processed it. When the target node receives the query packet, it sends its data back to the sink node via random walk. We show by extensive simulations that the performance of LBF in terms of cost and latency is much better than that of original flooding, and LBF can be used in IoT of different scales.

Coverage is one of the fundamental issues in wireless sensor networks (WSNs). It reflects the ability of WSNs to detect the fields of interest. In a real sensor networks application, the detection area is always non-ideal and the terrain of the detection area is often more complex in applications of three-dimensional sensor networks. Consequently, many of the existing coverage strategies cannot be directly applied to three-dimensional spaces. This paper presents a new coverage strategy for the three-dimensional sensor networks. Sensor nodes are uniformly distributed. The cost factor is utilized to construct the perceived probability and the classical watershed algorithm after the transformation of points from the three-dimensional space to the two-dimensional plane using the dimensionality reduction method, which can maintain the topology characteristic of the non-linear terrain. The detection probability in the optimal breath path is used as the measure to evaluate the coverage. Simulation results indicate that the proposed strategy can determine the coverage with fewer nodes, while achieving the coverage requirements of the networks., Comment: accepted. Int. J. Ad Hoc and Ubiquitous Computing, 2013

In this paper, we propose a simple randomized protocol for identifying trusted nodes based on personalized trust in large scale distributed networks. The problem of identifying trusted nodes, based on personalized trust, in a large network setting stems from the huge computation and message overhead involved in exhaustively calculating and propagating the trust estimates by the remote nodes. However, in any practical scenario, nodes generally communicate with a small subset of nodes and thus exhaustively estimating the trust of all the nodes can lead to huge resource consumption. In contrast, our mechanism can be tuned to locate a desired subset of trusted nodes, based on the allowable overhead, with respect to a particular user. The mechanism is based on a simple exchange of random walk messages and nodes counting the number of times they are being hit by random walkers of nodes in their neighborhood. Simulation results to analyze the effectiveness of the algorithm show that using the proposed algorithm, nodes identify the top trusted nodes in the network with a very high probability by exploring only around 45% of the total nodes, and in turn generates nearly 90% less overhead as compared to an exhaustive trust estimation mechanism, named TrustWebRank. Finally, we provide a measure of the global trustworthiness of a node; simulation results indicate that the measures generated using our mechanism differ by only around 0.6% as compared to TrustWebRank., 18 pages, 4 figures, accepted for IEEE TrustCom 2012

Congestions in wireless sensor networks (WSNs) could potentially cause packet loss, throughput impairment and energy waste. To address this issue, a hop-by-hop cross-layer congestion control scheme (HCCC) built on contention-based MAC protocol is proposed in this paper. According to MAC-layer channel information including buffer occupancy ratio and congestion degree of local node, HCCC dynamically adjusts channel access priority in MAC layer and data transmission rate of the node to tackle the problem of congestion. Simulations have been conducted to compare HCCC against closely-related existing schemes. The results show that HCCC exhibits considerable superiority in terms of packets loss ratio, throughput and energy efficiency.

Broadcast routing has become an important research field for vehicular ad-hoc networks (VANETs) recently. However, the packet delivery rate is generally low in existing VANET broadcast routing protocols. Therefore, the design of an appropriate broadcast protocol based on the features of VANET has become a crucial part of the development of VANET. This paper analyzes the disadvantage of existing broadcast routing protocols in VANETs, and proposes an improved algorithm (namely ODAM-C) based on the ODAM (Optimized Dissemination of Alarm Messages) protocol. The ODAM-C algorithm improves the packet delivery rate by two mechanisms based on the forwarding features of ODAM. The first distance-based mechanism reduces the possibility of packet loss by considering the angles between source nodes, forwarding nodes and receiving nodes. The second mechanism increases the redundancy of forwarding nodes to guarantee the packet success delivery ratio. We show by analysis and simulations that the proposed algorithm can improve packet delivery rate for vehicular networks compared against two widely-used existing protocols.

Mobile devices have been shipped with multiple wireless network interfaces in order to meet their diverse communication and networking demands. In this paper, we propose an A-GPS assisted scheme that discovers the nearest Wi-Fi network access points (APs) by using user's location information. This allows the user to switch to the Wi-Fi interface in an intelligent manner when she/he arrives at the nearest Wi-Fi network AP. Therefore, it avoids the long periods in idle state and greatly reduces the number of unnecessary Wi-Fi scans on the mobile device. The experimental results demonstrate that our scheme effectively saves energy for mobile devices integrated with Wi-Fi and cellular interfaces., IEEE Global Information Infrastructure Symposium (GIIS 2011), August 2011, Da Nang, Vietnam

This paper focuses on the stationary portion of file download in an unstructured peer-to-peer network, which typically follows for many hours after a flash crowd initiation. The model includes the case that peers can have some pieces at the time of arrival. The contribution of the paper is to identify how much help is needed from the seeds, either fixed seeds or peer seeds (which are peers remaining in the system after obtaining a complete collection) to stabilize the system. The dominant cause for instability is the missing piece syndrome, whereby one piece becomes very rare in the network. It is shown that stability can be achieved with only a small amount of help from peer seeds--even with very little help from a fixed seed, peers need dwell as peer seeds on average only long enough to upload one additional piece. The region of stability is insensitive to the piece selection policy. Network coding can substantially increase the region of stability in case a portion of the new peers arrive with randomly coded pieces., Comment: 33 pages, 6 figures

With rapid advancements in sensing, networking, and computing technologies, recent years have witnessed the emergence of cyber-physical systems (CPS) in a broad range of application domains. CPS is a new class of engineered systems that features the integration of computation, communications, and control. In contrast to general-purpose computing systems, many cyber-physical applications are safety critical. These applications impose considerable requirements on quality of service (QoS) of the employed networking infrastruture. Since IEEE 802.15.4 has been widely considered as a suitable protocol for CPS over wireless sensor and actuator networks, it is of vital importance to evaluate its performance extensively. Serving for this purpose, this paper will analyze the performance of IEEE 802.15.4 standard operating in different modes respectively. Extensive simulations have been conducted to examine how network QoS will be impacted by some critical parameters. The results are presented and analyzed, which provide some useful insights for network parameter configuration and optimization for CPS design. © 2011 Feng Xia et al.

A high degree of reliability for critical data transmission is required in body sensor networks (BSNs). However, BSNs are usually vulnerable to channel impairments due to body fading effect and RF interference, which may potentially cause data transmission to be unreliable. In this paper, an adaptive and flexible fault-tolerant communication scheme for BSNs, namely AFTCS, is proposed. AFTCS adopts a channel bandwidth reservation strategy to provide reliable data transmission when channel impairments occur. In order to fulfill the reliability requirements of critical sensors, fault-tolerant priority and queue are employed to adaptively adjust the channel bandwidth allocation. Simulation results show that AFTCS can alleviate the effect of channel impairments, while yielding lower packet loss rate and latency for critical sensors at runtime., 10 figures, 19 pages

Wireless sensor networks (WSNs) have become indispensable to the realization of smart homes. The objective of this paper is to develop such a WSN that can be used to construct smart home systems. The focus is on the design and implementation of the wireless sensor node and the coordinator based on ZigBee technology. A monitoring system is built by taking advantage of the GPRS network. To support multi-hop communications, an improved routing algorithm based on the Dijkstra algorithm is presented. Preliminary simulations have been conducted to evaluate the performance of the algorithm., International Workshop on Mobile Cyber-Physical Systems (MobiCPS 2010), in conjunction with UIC2010, IEEE, Xi'an, China, 26 - 29 October, 2010

Even though channel assignment has been studied for years, the performance of most IEEE 802.11-based multi-hop wireless networks such as wireless sensor network (WSN), wireless mesh network (WMN), mobile ad hoc network (MANET) is limited by channel interference. Properly assigning orthogonal channels to wireless links can improve the throughput of multi-hop networks. To solve the dynamic channel assignment problem, a routing-based channel assignment algorithm called R-CA is proposed. R-CA can allocate channels for wireless nodes when needed and free channels after data transmission. Thus more channel resource can be explored by wireless nodes. Simulation results show that R-CA can effectively enhance the network throughput and packet delivery rate., Comment: International Workshop on Mobile Cyber-Physical Systems (MobiCPS 2010), in conjunction with UIC2010, IEEE, Xi'an, China, 26 - 29 October, 2010

The GSM network with the greatest worldwide number of users, succumbs to several security vulnerabilities. The short message service (SMS) is one of its superior and well-tried services with a global availability in the GSM networks. The main contribution of this paper is to introduce a new secure application layer protocol, called SSMS, to efficiently embed the desired security attributes in the SMS messages to be used as a secure bearer in the m-payment systems. SSMS efficiently embeds the confidentiality, integrity, authentication, and non-repudiation in the SMS messages. It provides an elliptic curve-based public key solution that uses public keys for the secret key establishment of a symmetric encryption. It also provides the attributes of public verification and forward secrecy. It efficiently makes the SMS messaging suitable for the m-payment applications where the security is the great concern., Comment: 6 Pages, 5 Figures

Internet of Things (IoT) and B3G/4G communication are promoting the pervasive mobile services with its advanced features. However, security problems are also baffled the development. This paper proposes a trust model to protect the user's security. The billing or trust operator works as an agent to provide a trust authentication for all the service providers. The services are classified by sensitive value calculation. With the value, the user's trustiness for corresponding service can be obtained. For decision, three trust regions are divided, which is referred to three ranks: high, medium and low. The trust region tells the customer, with his calculated trust value, which rank he has got and which authentication methods should be used for access. Authentication history and penalty are also involved with reasons., Comment: IEEE/ACM Internet of Things Symposium (IOTS), in conjunction with GreenCom 2010, IEEE, Hangzhou, China, December 18-20, 2010

File type identification and file type clustering may be difficult tasks that have an increasingly importance in the field of computer and network security. Classical methods of file type detection including considering file extensions and magic bytes can be easily spoofed. Content-based file type detection is a newer way that is taken into account recently. In this paper, a new content-based method for the purpose of file type detection and file type clustering is proposed that is based on the PCA and neural networks. The proposed method has a good accuracy and is fast enough., Comment: 6 Pages, 5 Figure, 2 Tables

The non-repudiation as an essential requirement of many applications can be provided by the asymmetric key model. With the evolution of new applications such as mobile commerce, it is essential to provide secure and efficient solutions for the mobile environments. The traditional public key cryptography involves huge computational costs and is not so suitable for the resource-constrained platforms. The elliptic curve-based approaches as the newer solutions require certain considerations that are not taken into account in the traditional public key infrastructures. The main contribution of this paper is to introduce a Lightweight Public Key Infrastructure (LPKI) for the constrained platforms such as mobile phones. It takes advantages of elliptic curve cryptography and signcryption to decrease the computational costs and communication overheads, and adapting to the constraints. All the computational costs of required validations can be eliminated from end-entities by introduction of a validation authority to the introduced infrastructure and delegating validations to such a component. LPKI is so suitable for mobile environments and for applications such as mobile commerce where the security is the great concern., Comment: 6 Pages, 6 Figures

The electronic mail plays an unavoidable role in the humankind communications. With the great interest for the connection via mobile platforms, and the growing number of vulnerabilities and attacks, it is essential to provide suitable security solutions regarding the limitations of resource restricted platforms. Although some solutions such as PGP and S/MIME are currently available for the secure e-mail over the Internet, they are based on traditional public key cryptography that involves huge computational costs. In this paper, a new secure application-layer protocol, called SMEmail, is introduced that provides several security attributes such as confidentiality, integrity, authentication, non-repudiation, and forward secrecy of message confidentiality for the electronic mails. SMEmail offers an elliptic curve-based public key solution that uses public keys for the secure key establishment of a symmetric encryption, and is so suitable for the resource restricted platforms such as mobile phones., Comment: 6 Pages, 5 Figures

Wireless sensor/actuator networks (WSANs) are emerging as a new generation of sensor networks. Serving as the backbone of control applications, WSANs will enable an unprecedented degree of distributed and mobile control. However, the unreliability of wireless communications and the real-time requirements of control applications raise great challenges for WSAN design. With emphasis on the reliability issue, this paper presents an application-level design methodology for WSANs in mobile control applications. The solution is generic in that it is independent of the underlying platforms, environment, control system models, and controller design. To capture the link quality characteristics in terms of packet loss rate, experiments are conducted on a real WSAN system. From the experimental observations, a simple yet efficient method is proposed to deal with unpredictable packet loss on actuator nodes. Trace-based simulations give promising results, which demonstrate the effectiveness of the proposed approach., Comment: 17 pages, 8 figures; Open Access at http://www.mdpi.org/sensors/papers/s7102157.pdf

This paper presents small world in motion (SWIM), a new mobility model for ad-hoc networking. SWIM is relatively simple, is easily tuned by setting just a few parameters, and generates traces that look real--synthetic traces have the same statistical properties of real traces. SWIM shows experimentally and theoretically the presence of the power law and exponential decay dichotomy of inter-contact time, and, most importantly, our experiments show that it can predict very accurately the performance of forwarding protocols., Comment: Accepted for publication in IEEE INFOCOM 09, Rio de Janeiro, Brazil, April 2009

Wireless sensor/actuator networks (WSANs) are emerging rapidly as a new generation of sensor networks. Despite intensive research in wireless sensor networks (WSNs), limited work has been found in the open literature in the field of WSANs. In particular, quality-of-service (QoS) management in WSANs remains an important issue yet to be investigated. As an attempt in this direction, this paper develops a fuzzy logic control based QoS management (FLC-QM) scheme for WSANs with constrained resources and in dynamic and unpredictable environments. Taking advantage of the feedback control technology, this scheme deals with the impact of unpredictable changes in traffic load on the QoS of WSANs. It utilizes a fuzzy logic controller inside each source sensor node to adapt sampling period to the deadline miss ratio associated with data transmission from the sensor to the actuator. The deadline miss ratio is maintained at a pre-determined desired level so that the required QoS can be achieved. The FLC-QM has the advantages of generality, scalability, and simplicity. Simulation results show that the FLC-QM can provide WSANs with QoS support., Comment: 13 pages, 8 figures; Open Access at http://www.mdpi.org/sensors

In this paper, we present PCNM, a new mobile platform for cellular networks measurements. PCNM is based on a set of techniques that tailors theoretical calculations and simulations to the real cellular network environment. It includes: (a) modules that measure different parameters of a base station (BS) such as localization, cells identification, time advance information, reception level and quality, (b) a new protocol that optimizes the task of network measurement by monitoring a set of mobile nodes and finally (c) the ability to extend an existing cellular network by adding new base stations. We evaluate our genetic algorithm used to reduce the nodes mobility and optimize the measurement extraction of N base stations using k mobile sensors (k >= 1). We show how connecting real measurements (using mobile sensors in a collaborative way) to theoretical and prediction methods is of high benefits for cellular networks maintenance, extension and performances evaluation., IEEE International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2007)

Emerging ad hoc networks are infrastructure-less networks consisting of wireless devices with various power constraints, capabilities and mobility characteristics. An essential capability in future ad hoc networks is the ability to provide scalable multicast services. This paper presents a novel adaptive architecture to support multicast services in large-scale wide-area ad hoc networks. Existing works on multicast in ad hoc networks address only small size networks. Our main design goals are scalability, robustness and efficiency. We propose a self-configuring hierarchy extending zone-based routing with the notion of contacts based on the small world graphs phenomenon and new metrics of stability and mobility. We introduce a new geographic-based multicast address allocation scheme coupled with adaptive anycast based on group popularity. Our scheme is the first of its kind and promises efficient and robust operation in the common case. Also, based on the new concept of rendezvous regions, we provide a bootstrap mechanism for the multicast service; a challenge generally ignored in previous work., 10 pages, 4 figures

We describe a proposal for an extensible, component-based software architecture for natural language engineering applications. Our model leverages existing linguistic resource description and discovery mechanisms based on extended Dublin Core metadata. In addition, the application design is flexible, allowing disparate components to be combined to suit the overall application functionality. An application specification language provides abstraction from the programming environment and allows ease of interface with computational grids via a broker.

IP mobility addresses the problem of changing the network point-of-attachment transparently during movement. Mobile IP is the proposed standard by IETF. Several studies, however, have shown that Mobile IP has several drawbacks, such as triangle routing and poor handoff performance. Multicast-based mobility has been proposed as a promising solution to the above problems, incurring less end-to-end delays and fast smooth handoff. Nonetheless, such architecture suffers from multicast state scalability problems with the growth in number of mobile nodes. This architecture also requires ubiquitous multicast deployment and more complex security measures. To alleviate these problems, we propose an intra-domain multicast-based mobility solution. A mobility proxy allocates a multicast address for each mobile that moves to its domain. The mobile uses this multicast address within a domain for micro mobility. Also, aggregation is considered to reduce the multicast state. We conduct multicast state analysis to study the efficiency of several aggregation techniques. We use extensive simulation to evaluate our protocol's performance over a variety of real and generated topologies. We take aggregation gain as metric for our evaluation. Our simulation results show that in general leaky aggregation obtains better gains than perfect aggregation. Also, we notice that aggregation gain increases with the increase in number of visiting mobile nodes and with the decrease in number of mobility proxies within a domain., Comment: 15 pages, 17 figures, Keywords Micro Mobility, Multicast State, Efficient Handoff, Network Simulation, State Aggregation