2015 International Conference on Networking Systems and Security (NSysS)最新文献_第2页

ZDG: Energy efficient zone based data gathering in a wireless sensor network 基于节能区域的无线传感器网络数据采集

2015 International Conference on Networking Systems and Security (NSysS) Pub Date : 2015-02-19 DOI: 10.1109/NSysS.2015.7043514

Mahmuda Naznin, A. Chowdhury

引用次数: 7

Incremental clustering-based object tracking in wireless sensor networks 基于增量聚类的无线传感器网络目标跟踪

2015 International Conference on Networking Systems and Security (NSysS) Pub Date : 2015-02-19 DOI: 10.1109/NSysS.2015.7043534

M. Akter, Md. Obaidur Rahman, Md. Nazrul Islam, Md. Ahsan Habib

{"title":"Incremental clustering-based object tracking in wireless sensor networks","authors":"M. Akter, Md. Obaidur Rahman, Md. Nazrul Islam, Md. Ahsan Habib","doi":"10.1109/NSysS.2015.7043534","DOIUrl":"https://doi.org/10.1109/NSysS.2015.7043534","url":null,"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.","PeriodicalId":408601,"journal":{"name":"2015 International Conference on Networking Systems and Security (NSysS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130279568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 12

Q-Nerve: Propagating signal of a damaged nerve using quantum networking Q-Nerve:利用量子网络传播受损神经的信号

2015 International Conference on Networking Systems and Security (NSysS) Pub Date : 2015-02-19 DOI: 10.1109/NSysS.2015.7042944

Kazi Sinthia Kabir, Iftakhar Ahmad, Akhter Al Amin, Maruf Zaber, Tanzila Choudhury, B. M. S. B. Talukder, A. Islam

{"title":"Q-Nerve: Propagating signal of a damaged nerve using quantum networking","authors":"Kazi Sinthia Kabir, Iftakhar Ahmad, Akhter Al Amin, Maruf Zaber, Tanzila Choudhury, B. M. S. B. Talukder, A. Islam","doi":"10.1109/NSysS.2015.7042944","DOIUrl":"https://doi.org/10.1109/NSysS.2015.7042944","url":null,"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.","PeriodicalId":408601,"journal":{"name":"2015 International Conference on Networking Systems and Security (NSysS)","volume":"300 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131659869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Mathematical analysis of self-pruning and a new dynamic probabilistic broadcast for MANETs 自剪枝的数学分析及一种新的动态概率广播

2015 International Conference on Networking Systems and Security (NSysS) Pub Date : 2015-02-19 DOI: 10.1109/NSysS.2015.7042947

F. Zohra, Ashikur Rahman

{"title":"Mathematical analysis of self-pruning and a new dynamic probabilistic broadcast for MANETs","authors":"F. Zohra, Ashikur Rahman","doi":"10.1109/NSysS.2015.7042947","DOIUrl":"https://doi.org/10.1109/NSysS.2015.7042947","url":null,"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.","PeriodicalId":408601,"journal":{"name":"2015 International Conference on Networking Systems and Security (NSysS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121974127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

On bounded message replication in delay tolerant networks 延迟容忍网络中的有界消息复制

2015 International Conference on Networking Systems and Security (NSysS) Pub Date : 2015-02-19 DOI: 10.1109/NSysS.2015.7042952

Md. Nazmus Sadat, M. Mohiuddin, Md Yusuf Sarwar Uddin

{"title":"On bounded message replication in delay tolerant networks","authors":"Md. Nazmus Sadat, M. Mohiuddin, Md Yusuf Sarwar Uddin","doi":"10.1109/NSysS.2015.7042952","DOIUrl":"https://doi.org/10.1109/NSysS.2015.7042952","url":null,"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.","PeriodicalId":408601,"journal":{"name":"2015 International Conference on Networking Systems and Security (NSysS)","volume":"110 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131448237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An agent-based distributed monitoring framework (Extended abstract) 基于代理的分布式监控框架(扩展摘要)

2015 International Conference on Networking Systems and Security (NSysS) Pub Date : 2015-02-19 DOI: 10.1109/NSysS.2015.7043515

Muhammad N. Yanhaona, Md Anindya Prodhan, A. Grimshaw

{"title":"An agent-based distributed monitoring framework (Extended abstract)","authors":"Muhammad N. Yanhaona, Md Anindya Prodhan, A. Grimshaw","doi":"10.1109/NSysS.2015.7043515","DOIUrl":"https://doi.org/10.1109/NSysS.2015.7043515","url":null,"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.","PeriodicalId":408601,"journal":{"name":"2015 International Conference on Networking Systems and Security (NSysS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133675064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Pro-AODV (Proactive AODV): Simple modifications to AODV for proactively minimizing congestion in VANETs Pro-AODV(主动AODV):对AODV进行简单修改，以主动减少vanet中的拥塞

2015 International Conference on Networking Systems and Security (NSysS) Pub Date : 2015-02-19 DOI: 10.1109/NSysS.2015.7043521

Tanjida Kabir, Novia Nurain, M. Kabir

{"title":"Pro-AODV (Proactive AODV): Simple modifications to AODV for proactively minimizing congestion in VANETs","authors":"Tanjida Kabir, Novia Nurain, M. Kabir","doi":"10.1109/NSysS.2015.7043521","DOIUrl":"https://doi.org/10.1109/NSysS.2015.7043521","url":null,"abstract":"Vehicular Ad Hoc Networks (VANET) are key to realizing Intelligent Transportation Systems (ITS). Although VANETs belong to the class of Mobile Ad Hoc Networks (MANET), and there are numerous routing protocols for MANETs, none of these protocols are applicable for VANETs. In particular, VANETs are highly dynamic due to high speed mobility of vehicles and traditional routing algorithms for MANETs cannot deal with such dynamicity of network nodes. Several comparative studies have suggested AODV (Ad hoc On-Demand Distance Vector), a well known MANET protocol that is adaptive to dynamic changes in network and makes efficient utilization of network resources, to be the best candidate for dealing with VANETs. However, verbatim adoption of AODV is not an efficient routing solution for VANETs. Recent works therefore proposed various modifications and/or additions to AODV to make it suitable for VANETs. It is particularly important to control congestion in VANETs by efficiently dealing with the AODV \"Route Request\" (RREQ) packets. In this paper, we propose Pro-AODV (Proactive AODV), a protocol that uses information from the AODV routing table to minimize congestion in VANETs, yet sustains other performance metrics at acceptable levels. The novelty and elegance in Pro-AODV comes from the fact that it does not require the execution of any additional logic, it is sufficient to know only the size of the routing table at each node.","PeriodicalId":408601,"journal":{"name":"2015 International Conference on Networking Systems and Security (NSysS)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134179006","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 41

A metaheuristic approach for application partitioning in mobile system 移动系统中应用程序分区的元启发式方法

2015 International Conference on Networking Systems and Security (NSysS) Pub Date : 2015-02-19 DOI: 10.1109/NSysS.2015.7043520

S. Ferdous, Mohammad Sohel Rahman

引用次数: 4

A hierarchical approach for identifying user activity patterns from mobile phone call detail records 从移动电话详细记录中识别用户活动模式的分层方法

2015 International Conference on Networking Systems and Security (NSysS) Pub Date : 2015-02-19 DOI: 10.1109/NSysS.2015.7043535

Fahim Hasan Khan, Mohammed Eunus Ali, Himel Dev

{"title":"A hierarchical approach for identifying user activity patterns from mobile phone call detail records","authors":"Fahim Hasan Khan, Mohammed Eunus Ali, Himel Dev","doi":"10.1109/NSysS.2015.7043535","DOIUrl":"https://doi.org/10.1109/NSysS.2015.7043535","url":null,"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.","PeriodicalId":408601,"journal":{"name":"2015 International Conference on Networking Systems and Security (NSysS)","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127522478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 17

A duty cycle directional MAC protocol for wireless sensor networks 无线传感器网络的占空比定向MAC协议

2015 International Conference on Networking Systems and Security (NSysS) Pub Date : 2015-02-19 DOI: 10.1109/NSysS.2015.7042950

Fernaz Narin Nur, Selina Sharmin, M. Razzaque, Md. Shariful Islam

{"title":"A duty cycle directional MAC protocol for wireless sensor networks","authors":"Fernaz Narin Nur, Selina Sharmin, M. Razzaque, Md. Shariful Islam","doi":"10.1109/NSysS.2015.7042950","DOIUrl":"https://doi.org/10.1109/NSysS.2015.7042950","url":null,"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.","PeriodicalId":408601,"journal":{"name":"2015 International Conference on Networking Systems and Security (NSysS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114266642","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14