Visible to the public International Conferences: NSysS 2015, Bangladesh

SoS Newsletter- Advanced Book Block


SoS Logo

International Conferences:

NSysS 2015, Bangladesh

The 2015 International Conference on Networking Systems and Security (NSysS) was held in Dhaka, Bangladesh on 5-7 January 2015. Research papers on computer networks, networking systems, and security were presented. The cited works are the ones most related to Science of Security.

Ahmed, Shamir; Rizvi, A.S.M.; Mansur, Rifat Sabbir; Amin, Md. Rafatul; Islam, A.B.M. Alim Al, “User Identification Through Usage Analysis of Electronic Devices,” in Networking Systems and Security (NSysS), 2015 International Conference on, vol., no., pp.1-6, 5-7 Jan. 2015. doi:10.1109/NSysS.2015.7043518
Abstract: Different aspects of usage of electronic devices significantly vary person to person, and therefore, rigorous usage analysis exhibits its prospect in identifying a user in road to secure the devices. Different state-of-the-art approaches have investigated different aspects of the usage, such as typing speed and dwelling time, in isolation for identifying a user. However, investigation of multiple aspects of the usage in combination is yet to be focused in the literature. Therefore, this paper, we investigate multiple aspects of usage in combination to identify a user. We perform the investigation over real users through letting them interact with an Android application, which we develop specifically for the investigation. Our investigation reveals a key finding considering multiple aspects of usage in combination provides improved performance in identifying a user. We get this improved performance up to a certain number of aspects of usage being considered in the identification task.
Keywords: Android (operating system); authorisation; graphical user interfaces; Android application; device security; dwelling time; electronic device usage analysis; performance improvement; typing speed; user identification task; Clustering algorithms; Measurement; Mobile handsets; Presses; Pressing; Security; Standards (ID#: 15-6501)


Akter, M.; Rahman, M.O.; Islam, M.N.; Habib, M.A., “Incremental Clustering-Based Object Tracking in Wireless Sensor Networks,” in Networking Systems and Security (NSysS), 2015 International Conference on, vol., no., pp.1-6, 5-7 Jan. 2015. doi:10.1109/NSysS.2015.7043534
Abstract: Emerging significance of moving object tracking has been actively pursued in the Wireless Sensor Network (WSN) community for the past decade. As a consequence, a number of methods from different angle of assessment have been developed while relatively satisfying performance. Amongst those, clustering based object tracking has shown significant results, which in term provides the network to be scalable and energy efficient for large-scale WSNs. As of now, static cluster based object tracking is the most common approach for large-scale WSN. However, as static clusters are restricted to share information globally, tracking can be lost at the boundary region of static clusters. In this paper, an Incremental Clustering Algorithm is proposed in conjunction with Static Clustering Technique to track an object consistently throughout the network solving boundary problem. The proposed research follows a Gaussian Adaptive Resonance Theory (GART) based Incremental Clustering that creates and updates clusters incrementally to incorporate incessant motion pattern without defiling the previously learned clusters. The objective of this research is to continue tracking at the boundary region in an energy-efficient way as well as to ensure robust and consistent object tracking throughout the network. The network lifetime performance metric has shown significant improvements for Incremental Static Clustering at the boundary regions than that of existing clustering techniques.
Keywords: object tracking; wireless sensor networks; GART based incremental clustering; Gaussian adaptive resonance theory; WSN; clustering based object tracking; incremental clustering algorithm; incremental clustering-based object tracking; static clustering technique; wireless sensor networks; Algorithm design and analysis; Clustering algorithms; Energy efficiency; Heuristic algorithms; Object tracking; Wireless sensor networks; Adaptive Resonance Theory; Energy-efficiency; Incremental Clustering; Object Tracking; Wireless Sensor Networks (WSN) (ID#: 15-6502)


Al Islam, A.B.M.A.; Hyder, C.S.; Zubaer, K.H., “Digging the Innate Reliability of Wireless Networked Systems,” in Networking Systems and Security (NSysS), 2015 International Conference on, vol., no., pp. 1-10, 5-7 Jan. 2015. doi:10.1109/NSysS.2015.7042946
Abstract: Network reliability of wireless networks exhibits a prominent impact in successful advancement of the networking paradigm. A complete understanding of the network reliability demands its in-depth analysis, which is yet to be attempted in the literature. Therefore, we present a comprehensive study on the network reliability in this paper. Our step-by-step stochastic study, from node-level to network-level reliability, reveals a novel finding: the network reliability of a wireless network follows the Gaussian distribution in general. We validate the finding through exhaustive numerical simulation and ns-2 simulation.
Keywords: Gaussian distribution; numerical analysis; radio networks; stochastic processes; telecommunication network reliability; Gaussian distribution; network reliability; ns-2 simulation; numerical simulation; stochastic study; wireless networked systems; wireless networks; Ad hoc networks; Batteries; Numerical simulation; Reliability; Shape; Weibull distribution; Wireless networks (ID#: 15-6503)


Khan, F.H.; Ali, M.E.; Dev, H., “A Hierarchical Approach for Identifying User Activity Patterns from Mobile Phone Call Detail Records,” in Networking Systems and Security (NSysS), 2015 International Conference on, vol., no., pp. 1-6, 5-7 Jan. 2015. doi:10.1109/NSysS.2015.7043535
Abstract: With the increasing use of mobile devices, now it is possible to collect different data about the day-to-day activities of personal life of the user. Call Detail Record (CDR) is the available dataset at large-scale, as they are already constantly collected by the mobile operator mostly for billing purpose. By examining this data it is possible to analyze the activities of the people in urban areas and discover the human behavioral patterns of their daily life. These datasets can be used for many applications that vary from urban and transportation planning to predictive analytics of human behavior. In our research work, we have proposed a hierarchical analytical model where this CDR Dataset is used to find facts on the daily life activities of urban users in multiple layers. In our model, only the raw CDR data are used as the input in the initial layer and the outputs from each consecutive layer is used as new input combined with the original CDR data in the next layers to find more detailed facts, e.g., traffic density in different areas in working days and holidays. So, the output in each layer is dependent on the results of the previous layers. This model utilized the CDR Dataset of one month collected from the Dhaka city, which is one of the most densely populated cities of the world. So, our main focus of this research work is to explore the usability of these types of dataset for innovative applications, such as urban planning, traffic monitoring and prediction, in a fashion more appropriate for densely populated areas of developing countries.
Keywords: mobile handsets; telecommunication network planning; Dhaka city; mobile devices; mobile operator; mobile phone call detail records; traffic monitoring; transportation planning; urban planning; Analytical models; Cities and towns; Data models; Employment; Mobile handsets; Poles and towers; Transportation (ID#: 15-6504)


Ferdous, S.M.; Rahman, M.S., “A Metaheuristic Approach for Application Partitioning in Mobile System,” in Networking Systems and Security (NSysS), 2015 International Conference on, vol., no., pp. 1-6, 5-7 Jan. 2015. doi:10.1109/NSysS.2015.7043520
Abstract: Mobile devices such as smartphones are extremely popular now. In spite of their huge popularity, the computational ability of mobile devices is still low. Computational offloading is a way to transfer some of the heavy computational tasks to server(cloud) so that the efficiency and usability of the system increases. In this paper, we have developed a metaheuristic approach for application partitioning to maximize throughput and performance. Preliminary experiment suggest that our approach is better than the traditional all cloud and all mobile approach.
Keywords: cloud computing; mobile computing; optimisation; smart phones; application partitioning; computational offloading; computational tasks transfer; metaheuristic approach; mobile devices; mobile system; performance maximization; smartphones; throughput maximization; Computers; Mobile communication; Mobile computing; Mobile handsets; Partitioning algorithms; Servers; Throughput (ID#: 15-6505)


Zohra, F.T.; Rahman, A., “Mathematical Analysis of Self-Pruning and a New Dynamic Probabilistic Broadcast for MANETs,” in Networking Systems and Security (NSysS), 2015 International Conference on, vol., no., pp.1-9, 5-7 Jan. 2015. doi:10.1109/NSysS.2015.7042947
Abstract: Self-pruning broadcasting algorithm exploits neighbor knowledge to reduce redundant retransmissions in mobile ad hoc wireless networks (MANETs). Although in self-pruning, only a subset of nodes forward the message based on certain forwarding rule, it belongs to one of the reliable broadcasting algorithm category where a broadcast message is guaranteed (at least algorithmically) to reach all the nodes in the network. In this paper, we develop an analytical model to determine expected number of forwarding nodes required to complete a broadcast in self-pruning algorithm. The derived expression is a function of various network parameters (such as, network density and distance between nodes) and radio transceiver parameters (such as transmission range). Moreover, the developed mathematical expression provides us a better understanding of the highly complex packet forwarding pattern of self-pruning algorithm and valuable insight to design a new broadcasting heuristic. The proposed new heuristic is a dynamic probabilistic broadcast where rebroadcast probability of each node is dynamically determined from a developed mathematical expression. Extensive simulation experiments have been conducted to validate the accuracy of the analytical model, as well as, to evaluate the efficiency of the proposed heuristic. Performance analysis shows that the proposed heuristic outperforms the static probabilistic broadcasting algorithm and an existing solution proposed by Bahadili.
Keywords: electronic messaging; mobile ad hoc networks; probability; radio transceivers; redundancy; telecommunication network reliability; MANET; complex packet forwarding pattern; dynamic probabilistic broadcasting algorithm; mathematical expression analysis; message forwarding; mobile ad hoc wireless network; radio transceiver parameter; rebroadcast probability; self-pruning broadcasting algorithm reliability; static probabilistic broadcasting algorithm; Ad hoc networks; Broadcasting; Equations; Heuristic algorithms; Mathematical model; Probabilistic logic; Protocols (ID#: 15-6506)


Ahmad, S.; Alam, K.M.R.; Rahman, H.; Tamura, S., “A Comparison Between Symmetric and Asymmetric Key Encryption Algorithm Based Decryption Mixnets,” in Networking Systems and Security (NSysS), 2015 International Conference on, vol., no., pp. 1-5, 5-7 Jan. 2015. doi:10.1109/NSysS.2015.7043532
Abstract: This paper presents a comparison between symmetric and asymmetric key encryption algorithm based decryption mixnets through simulation. Mix-servers involved in a decryption mixnet receive independently and repeatedly encrypted messages as their input, then successively decrypt and shuffle them to generate a new altered output from which finally the messages are regained. Thus mixnets confirm unlinkability and anonymity between senders and the receiver of messages. Both symmetric (e.g. onetime pad, AES) and asymmetric (e.g. RSA and ElGamal cryptosystems) key encryption algorithms can be exploited to accomplish decryption mixnets. This paper evaluates both symmetric (e.g. ESEBM: enhanced symmetric key encryption based mixnet) and asymmetric (e.g. RSA and ElGamal based) key encryption algorithm based decryption mixnets. Here they are evaluated based on several criteria such as: the number of messages traversing through the mixnet, the number of mix-servers involved in the mixnet and the key length of the underlying cryptosystem. Finally mixnets are compared on the basis of the computation time requirement for the above mentioned criteria while sending messages anonymously.
Keywords: electronic messaging; message authentication; public key cryptography; AES; ElGamal based decryption mixnet; RSA based decryption mixnet; asymmetric key encryption algorithm based decryption mixnet; message encryption; message sending; onetime pad; symmetric key encryption algorithm based decryption mixnet; Algorithm design and analysis; Encryption; Generators; Public key; Receivers; Servers; Anonymity; ElGamal; Mixnet; Privacy; Protocol; RSA; Symmetric key encryption algorithm (ID#: 15-6507)


Sayeed, S.D.; Hasan, M.S.; Rahman, M.S., “Measuring Topological Robustness of Scale-Free Networks Using Biconnected Components,” in Networking Systems and Security (NSysS), 2015 International Conference on, vol., no., pp. 1-6, 5-7 Jan. 2015. doi:10.1109/NSysS.2015.7042945
Abstract: Models of complex networks are dependent on various properties of networks like connectivity, accessibility, efficiency, robustness, degree distribution etc. Network robustness is a parameter that reflects attack tolerance of a network in terms of connectivity. In this paper we have tried to measure the robustness of a network in such a way that gives a better idea of both stability and reliability of a network. In some previous works, the existence of a giant connected component is considered as an indicator of structural robustness of the entire system. In this paper we show that the size of a largest biconnected component can be a better parameter for measurement of robustness of a complex network. Our experimental study exhibits that scale-free networks are more vulnerable to sustained targeted attacks and more resilient to random failures.
Keywords: complex networks; network theory (graphs); random processes; reliability; stability; biconnected component; complex networks; giant connected component; network robustness measure; random failures; reliability; scale-free networks; stability; structural robustness; topological robustness measure; Artificial neural networks; Bridges; Complex networks; Graph theory; Robustness; Size measurement (ID#: 15-6508)


Nur, F.N.; Sharmin, S.; Razzaque, M.A.; Islam, M.S., “A Duty Cycle Directional MAC Protocol for Wireless Sensor Networks,” in Networking Systems and Security (NSysS), 2015 International Conference on, vol., no., pp. 1-9, 5-7 Jan. 2015. doi:10.1109/NSysS.2015.7042950
Abstract: The directional transmission and reception of data packets in sensor networks minimize the interference and thereby increase the network throughput, and thus the Directional Sensor Networks (DSN) are getting popularity. However, the use of directional antenna has introduced new problems in designing the medium access control (MAC) protocol in DSNs including the synchonizaiton of antenna direction of a pair of sender-receiver. In this paper, we have developed a duty cycle MAC protocol for DSNs, namely DCD-MAC, that synchronizes each pair of parent-child nodes and schedules their transmissions in such a way that transmission from child nodes minimizes the collision and the nodes are awake only when they have transmission-reception activities. The proposed DCD-MAC is fully distributed and it exploits only localized information to ensure weighted share of the transmission slots among the child nodes. We perform extensive simulations to study the performances of DCD-MAC and the results show that our protocol outperforms a state-of-the-art directional MAC protocol in terms of throughput and network lifetime.
Keywords: access protocols; directive antennas; radiofrequency interference; wireless sensor networks; MAC protocol; directional antenna; directional sensor networks; directional transmission; interference; medium access control protocol; Data transfer; Directional antennas; Media Access Protocol; Resource management; Synchronization; Wireless sensor networks (ID#: 15-6509)


Sadat, N.; Mohiuddin, M.T.; Uddin, Y.S., “On Bounded Message Replication in Delay Tolerant Networks,” in Networking Systems and Security (NSysS), 2015 International Conference on, vol., no., pp. 1-10, 5-7 Jan. 2015. doi:10.1109/NSysS.2015.7042952
Abstract: Delay tolerant networks (DTN), are wireless networks in which at any given time instance, the probability that there is an end-to-end path from a source to a destination is low. So, the conventional solutions do not generally work in DTNs because they assume that the network is stable most of the time and failures of links between nodes are infrequent. Therefore, store-carry-and-forward paradigm is used in routing of messages in DTNs. To deal with DTNs, researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention, which can significantly degrade their performance. For this reason, a family of multi-copy protocols called Spray routing, was proposed which can achieve both good delays and low transmissions. Spray routing algorithms generate only a small, carefully chosen number of copies to ensure that the total number of transmissions is small and controlled. Spray and Wait sprays a number of copies into the network, and then waits till one of these nodes meets the destination. In this paper, we propose a set of spraying heuristics that dictates how replicas are shared among nodes. These heuristics are based on delivery probabilities derived from contact histories.
Keywords: delay tolerant networks; electronic messaging; probability; radio links; radio networks; routing protocols; telecommunication network reliability; DTN spraying heuristics; bounded message replication; delay tolerant network link failure; flooding-based routing scheme; multicopy protocol; spray routing protocol; store carry and forward paradigm; wireless network probability; Binary trees; Delays; History; Probabilistic logic; Routing; Routing protocols; Spraying; Delay tolerant network; Spray and Wait; routing protocol (ID#: 15-6510)


Zaman, M.; Siddiqui, T.; Amin, M.R.; Hossain, M.S., “Malware Detection in Android by Network Traffic Analysis,” in Networking Systems and Security (NSysS), 2015 International Conference on, vol., no., pp. 1-5, 5-7 Jan. 2015. doi:10.1109/NSysS.2015.7043530
Abstract: A common behavior of mobile malware is transferring sensitive information of the cell phone user to malicious remote servers. In this paper, we describe and demonstrate in full detail, a method for detecting malware based on this behavior. For this, we first create an App-URL table that logs all attempts made by all applications to communicate with remote servers. Each entry in this log preserves the application id and the URI that the application contacted. From this log, with the help of a reliable and comprehensive domain blacklist, we can detect rogue applications that communicate with malicious domains. We further propose a behavioral analysis method using syscall tracing. Our work can be integrated with be behavioral analysis to build an intelligent malware detection model.
Keywords: Android (operating system); invasive software; mobile computing; program diagnostics; telecommunication traffic; App-URL table; URI; behavioral analysis method; cell phone user; domain blacklist; intelligent malware detection model; malicious remote servers; mobile malware detection; sensitive information transfer; syscall tracing; Androids; Humanoid robots; Malware; Mobile communication; Ports (Computers); Servers; Uniform resource locators; ADB; Android; Busybox; malware detection; netstat; pcap (ID#: 15-6511)


Tanjeem, F.; Uddin, M.Y.S.; Rahman, A.K.M.A., “Wireless Media Access Depending on Packet Size Distribution over Error-Prone Channels,” in Networking Systems and Security (NSysS), 2015 International Conference on, vol., no., pp. 1-7, 5-7 Jan. 2015. doi:10.1109/NSysS.2015.7043519
Abstract: Ad Hoc Network is a decentralized type of network where wireless devices are allowed to discover each other and communicate in peer to peer fashion without involving central access points. In most ad hoc networks, nodes compete for access to shared wireless medium, often resulting in collision (interference). IEEE 802.11, a well-known standard, uses medium access control (MAC) protocol to support delivery of radio data packets for both ad hoc networks and infrastructure based network. But designing a Medium Access Control (MAC) protocol for ad hoc wireless networks is challenging, particularly when the protocol needs to achieve optimal performance both in terms of throughput and efficiency to deliver a packet. Error-prone channel has a significant impact on unsuccessful transmission probability which is often ignored by previous researches. Standard DCF (Distributed Coordination Function) operation of IEEE 802.11 enacted by binary exponential back-off (BEB) algorithm cannot differentiate collision from corruption and therefore sets forth a (time) separation between multiple nodes accessing the channel by (appropriately) adjusting contention window (CW) upon a failure. This leads to increased delay in error-prone network when nodes are not contending at all. Since packet corruption depends on bit error rate (BER) and length of packets, packet size can have significant impact on the throughput in error-prone environment. In this paper, we analyze effect of packet size in determining optimal CW to improve throughput and efficiency for error-prone networks. We propose a dynamic learning based scheme to adaptively select CW sub-range instead of whole selection range for different packet distribution. To validate our scheme extensive simulations have been done and simulation results show significant improvement in E2E delay performance.
Keywords: access protocols; ad hoc networks; error statistics; peer-to-peer computing; telecommunication congestion control; wireless LAN; wireless channels; BEB algorithm; BER; CW; DCF operation; E2E delay performance; IEEE 802.11 standard; MAC protocol; ad hoc network collision; binary exponential back-off algorithm; bit error rate; contention window; distributed coordination function; dynamic learning; error-prone channel; medium access control protocol; packet size distribution; peer to peer communication; radio data packet delivery; unsuccessful transmission probability; wireless device; wireless media access; Ad hoc networks; Delays; IEEE 802.11 Standards; Network topology; Protocols; Throughput; Wireless communication (ID#: 15-6512)


Yanhaona, M.N.; Prodhan, A.T.; Grimshaw, A.S., “An Agent-Based Distributed Monitoring Framework” in Networking Systems and Security (NSysS), 2015 International Conference on, vol., no., pp. 1-10, 5-7 Jan. 2015. doi:10.1109/NSysS.2015.7043515
Abstract: In compute clusters, monitoring of infrastructure and application components is essential for performance assessment, failure detection, problem forecasting, better resource allocation, and several other reasons. Present day trends towards larger and more heterogeneous clusters, rise of virtual data-centers, and greater variability of usage suggest that we have to rethink how we do monitoring. We need solutions that will remain scalable in the face of unforeseen expansions, can work in a wide-range of environments, and be adaptable to changes of requirements. We have developed an agent-based framework for constructing such monitoring solutions. Our framework deals with all scalability and flexibility issues associated with monitoring and leaves only the use-case specific task of data generation to the specific solution. This separation of concerns provides a versatile design that enables a single monitoring solution to work in a range of environments; and, at the same time, enables a range of monitoring solutions exhibiting different behaviors to be constructed by varying the tunable parameters of the framework. This paper presents the design, implementation, and evaluation of our novel framework.
Keywords: computer centres; distributed processing; multi-agent systems; pattern clustering; system monitoring; agent-based distributed monitoring framework; application components; data generation; failure detection; heterogeneous clusters; infrastructure monitoring; performance assessment; problem forecasting; resource allocation; virtual data-centers; Fault tolerance; Heart beat; Monitoring; Quality of service; Receivers; Routing; Scalability; autonomous systems; cluster monitoring; distributed systems; flexibility; scalability (ID#: 15-6513)


Kabir, K.S.; Ahmad, I.; Al Amin, A.; Zaber, M.; Choudhury, T.; Talukder, B.M.S.B.; Al Islam, A.B.M.A., “Q-Nerve: Propagating Signal of a Damaged Nerve Using Quantum Networking,” in Networking Systems and Security (NSysS), 2015 International Conference on, vol., no., pp. 1-10, 5-7 Jan. 2015. doi:10.1109/NSysS.2015.7042944
Abstract: Aiding paralyzed people through using technology to transmit signals from brain to paralized part of a body has been a matter of great interest in recent times. Classical approaches in this regard still experience several limitations and sometimes become hazardous to living bodies. Besides, existing literature points out that there are many nerve signals that are not amenable to the classical approaches, however, can be amenable to quantum approaches. By addressing these two points, we propose a new system to propagate signal of a damaged nerve using quantum networking. We name our proposed system Q-Nerve. Q-Nerve exploits quantum network based artificial connection between brain and other organs to bypass a damaged nerve. Subsequently, we propose a more sophisticated version of Q-Nerve that aims to exploiting a synergy between the ability of quantum computing to accumulate neural signal and the ability of quantum networking to pass the signal instantaneously. Further, we extend the proposed system for other brain and nerve related problems that require numerous logical computations.
Keywords: medical signal detection; medical signal processing; neurophysiology; quantum computing; artificial brain-organ connection; brain-related problems; damaged nerve signal propagation; instant signal transmission; nerve signals; nerve-related problems; neural signal accumulation; paralyzed people; quantum approaches; quantum computing ability; quantum network exploitation; quantum networking; sophisticated Q-Nerve version; Measurement by laser beam; Photonics; Quantum computing; Quantum entanglement; Receivers; Surface emitting lasers (ID#: 15-6514)


Articles listed on these pages have been found on publicly available internet pages and are cited with links to those pages. Some of the information included herein has been reprinted with permission from the authors or data repositories. Direct any requests via Email to for removal of the links or modifications to specific citations. Please include the ID# of the specific citation in your correspondence.