{"title":"Very High Resolution Satellite Images Filtering","authors":"Assia Kourgli, Y. Oukil","doi":"10.1109/BWCCA.2013.81","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.81","url":null,"abstract":"This paper introduces a new non linear filter suitable for artifacts (trees, cars, etc.) removing in Very High Resolution Satellite (VHRS) Images. It is based on the application of three filters of different sizes and shapes that permits each time to remove the artifacts smaller than the filter. These filters are based on the research of noisy pixels surrounded by homogenous area according to the three filters. First, tests have been conducted on Berkeley database images corrupted with different kinds of noise comparing the filter performances to that of an isotropic diffusion and bilateral filters. In a second stage, we applied our filtering technique to HRS images obtaining promising results.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122525906","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}
{"title":"Hierarchical Key Negotiation Technique for Transitory Master Key Schemes in Wireless Sensor Networks","authors":"Cesare Celozzi, F. Gandino, M. Rebaudengo","doi":"10.1109/BWCCA.2013.33","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.33","url":null,"abstract":"Wireless sensor networks have been applied in various contexts where hardware and network data are exposed to security threats, such as tampering or eavesdropping. The majority of the security approaches adopted in this context are based on symmetric encryption, which requires keys shared among the nodes. Many key management schemes, like the transitory master key scheme LEAP+, have been proposed for the negotiation of keys. In this paper a new key negotiation technique suitable for LEAP+ protocol is described. The roposed protocol significantly reduces the time of exposition of sensitive information through a new organization of handshake operations and of key establishment. A comparison with the original version of LEAP+ was performed to evaluate the improvements achieved by the proposed approach.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121222832","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}
{"title":"Data Transfer in Delay-Tolerant Networks","authors":"Ronan Bocquillon, A. Jouglet","doi":"10.1109/BWCCA.2013.62","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.62","url":null,"abstract":"Delay-Tolerant Networking (DTN) is a promising approach to address main issues arising from unusual networks which are subject to frequent partitioning (due to node mobility and other factors), e.g. drones and satellites networks. In such situations, routing follows the well known store-carry-forward paradigm since an end-to-end path between two nodes is never guaranteed to exist. We assume reliable predictions can be made about node mobility, and therefore study a deterministic problem aiming at profiting from this knowledge to compute an efficient data dissemination strategy. In this paper, we describe our research works in the more general framework of systems of systems (SoS). We notably propose to tackle a first simple case for which we provide dominance-rule-based resolution techniques.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126806676","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}
Dilawaer Duolikun, A. Aikebaier, T. Enokido, M. Takizawa
{"title":"Group Communication Protocols Based on Hybrid Types of Logical and Physical Clocks","authors":"Dilawaer Duolikun, A. Aikebaier, T. Enokido, M. Takizawa","doi":"10.1109/BWCCA.2013.85","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.85","url":null,"abstract":"In distributed systems, multiple processes are cooperating with each other by exchanging messages in underlying networks. In order to realize distributed applications, a group of n processes are required to cooperate with each other. In a distributed group, each member process is peer and directly exchanges messages with other processes with no centralized coordination. That is, each process sends messages to other processes and receives messages from other processes in a group. Each process has to not only reliably and efficiently but also causally deliver messages. In addition, a group is required to be scalable. In this paper, we discuss a hybrid type of clock (HC) to causally deliver messages in a scalable group. The HC protocol takes advantage of linear clock (LC) and physical clock (PC). There might be no causally precedent relation between some pair of messages ordered in the LC protocol. This means, some pair of messages are unnecessarily ordered. A physical clock in a computer is now synchronized with a time server in NTP and PTP. Thus, a process can read more precise physical time on each computer. In the LC and PC protocols, each message carries just LC and PC variables, respectively. Hence, the message length is O(1) for number n of processes in a group. We show unnecessarily ordered messages can be reduced in the HC protocol compared with the LC protocol through the evaluation of the implemented HC protocol.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124082865","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}
{"title":"Real-Time Hand Pose Recognition Based on a Neural Network Using Microsoft Kinect","authors":"S. Sorce, V. Gentile, A. Gentile","doi":"10.1109/BWCCA.2013.60","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.60","url":null,"abstract":"The Microsoft Kinect sensor is largely used to detect and recognize body gestures and layout with enough reliability, accuracy and precision in a quite simple way. However, the pretty low resolution of the optical sensors does not allow the device to detect gestures of body parts, such as the fingers of a hand, with the same straightforwardness. Given the clear application of this technology to the field of the user interaction within immersive multimedia environments, there is the actual need to have a reliable and effective method to detect the pose of some body parts. In this paper we propose a method based on a neural network to detect in real time the hand pose, to recognize whether it is closed or not. The neural network is used to process information of color, depth and skeleton coming from the Kinect device. This information is preprocessed to extract some significant feature. The output of the neural network is then filtered with a time average, to reduce the noise due to the fluctuation of the input data. We analyze and discuss three possible implementations of the proposed method, obtaining an accuracy of 90% under good conditions of lighting and background, and even reaching the 95% in best cases, in real time.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124243794","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}
{"title":"A Trust-Based Cooperation Bit-Map Routing Protocol for Ad Hoc Networks","authors":"Hsing-Chung Chen, Jen-Yung Lin","doi":"10.1109/BWCCA.2013.93","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.93","url":null,"abstract":"In this paper, we assume that an ad hoc network may be self-organized by some varying quality nodes which consist of some good nodes, some selfish nodes or malicious nodes. The selfish nodes or malicious nodes may have lots of misbehaving and hurting the connectivity for an ad hoc network. It will be reported as malicious node in all reported trust based routing protocols. This situation would be greatly inhibit the activity data communications, and causes the length of time of data packet delivery activity. Due to such kind of situations, we propose a Trust-Based Cooperation Bit-Map Routing Protocol for Ad Hoc Networks. In this protocol, every node will deal with a trust-value assessment work and dynamically updating cooperative bit-map table. The trust-value assessment as well as the table will be dynamically updated on when any intended receiver node fails to receive the packet during the packet delivery phase. In this work, we show that our routing protocol can against packet dropping attack, and it will be more powerful to work in an abnormal environment.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127827779","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}
Y. Nomura, Yuya Murata, H. Taniguchi, Masakazu Urata, S. Muto
{"title":"Bring Your Own Calendar: A CalDAV-Based Virtual Calendar System","authors":"Y. Nomura, Yuya Murata, H. Taniguchi, Masakazu Urata, S. Muto","doi":"10.1109/BWCCA.2013.95","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.95","url":null,"abstract":"Today, the sharing of schedule information across individuals or organizations has been made simpler by the Internet and personal devices such as smartphones. However, it is not as easy in bring-your-own-device environments due to problems related to privacy and cultural gaps among organizations and individuals. Current calendar systems do not have any easy, fine-grained calendar sharing scheme to support such environments. In this paper, we propose a new calendar system that employs a fine-grained calendar sharing scheme called Virtual Calendar, which is based on our CalDAV proxy engine. Our calendar system satisfies such fine-grained demands as ``I want to share my calendar with my wife for only those articles that start after 5 pm or on weekends''.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130484518","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}
{"title":"Investigating Latency in GNU Software Radio with USRP Embedded Series SDR Platform","authors":"N. Truong, Chansu Yu","doi":"10.1109/BWCCA.2013.11","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.11","url":null,"abstract":"Software-Defined Radio (SDR) is a radio technology that most of conventional radio components are implemented in software. Besides the advantages like re-configurability and flexibility, a SDR system has to face a critical challenge on real-time processing due to high jitter and latency. Thus, understanding latency in SDR systems is very important. This paper focuses on investigating the latency of a popular SDR platform - GNU Software Radio with a new Universal Software Radio Peripherals (USRP) device -USRP Embedded Series E100. This research investigates and analyzes the reasons of the delays by considering all the buffering mechanisms in the platform. After that, we verify and quantify them by using three experimental methods. The first method is to calculate the whole delay of the SDR system by measuring the round-trip time (RTT). The second method measures subparts of the whole latency by using timestamp during a packet transmission process. The third approach is designated to measure the latency of the hardware part and bus communication part. We believe this study offers the better understanding of the latency in a new embedded USRP series - USRP E100 with GNU Software Radio platform.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133445011","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}
{"title":"Image Medical Diagnostic Using Dynamic Programming","authors":"M. Pham, A. Doncescu, Sébastien Régis","doi":"10.1109/BWCCA.2013.83","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.83","url":null,"abstract":"In recent years, the active contours model are used usually to determine objects in image. This model allows change coefficients in its formula to give interested results based on the energy optimization problems. There are many methods for solve them. In this paper, we try present the most fully using dynamic programming (DP) for the image medical diagnostic. This is among forceful and effective mathematical tools for solves the optimum problems. We present also technics set up automatically initial curve and constraints for decrease numbers of computation.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131645426","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}
{"title":"Rapid Ray Tracing Analysis of Scattered Field from an Aircraft Model in Super Wide Area","authors":"J. Honda, T. Otsuyama","doi":"10.1109/BWCCA.2013.37","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.37","url":null,"abstract":"The system based on the Passive Bistatic Radar (PBR) expected as the surveillance system of aircraft, uses scattered waves from an aircraft which are much smaller than the directed wave. In such system, it is important how to locate receivers in order to construct a high performance of surveillance system. Consequently, field estimation is required to optimally allocate receivers. However, since current numerical techniques such as Ray Tracing Method (RTM) consume much computation time in order to search rays from source to receiver, they are applied to only small area within a few square kilometers. Its analytical areas are enough to investigations for cellular phone or digital broadcasting, but it is too small to obtain the field distribution in the wide area for the Air Traffic Management (ATM) system. Therefore, in this paper, we propose a new numerical algorithm for analyzing scattered fields from an aircraft in super wide area in order to apply to the development of the ATM system. The essence of the proposed algorithm based on the RTM is to simplify the ray searching from source to receiver, resulting in reducing of the computation time. We discuss the principle of our method and the theory of electromagnetic field, and we show scattered powers and delay profiles from a simple aircraft model.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126486136","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}