2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications最新文献_第5页

Local Search and Genetic Algorithms for Satellite Scheduling Problems 卫星调度问题的局部搜索与遗传算法

2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2013-10-28 DOI: 10.1109/BWCCA.2013.58

Vladi Koliçi, X. Herrero, F. Xhafa, L. Barolli

{"title":"Local Search and Genetic Algorithms for Satellite Scheduling Problems","authors":"Vladi Koliçi, X. Herrero, F. Xhafa, L. Barolli","doi":"10.1109/BWCCA.2013.58","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.58","url":null,"abstract":"Satellite scheduling is a family of problems that arise in satellite mission planning of communications of spacecrafts with ground stations. The problems of this family can be classified under time window scheduling given that the communication between the ground stations and spacecrafts can only be done during some specified time window. This later feature, together with the fact that different users may request communications with spacecrafts in the same time window, make the problems highly constrained and hard to solve to optimality. Therefore, these problems are solved in practice through heuristic and meta-heuristic approaches, which are in general efficient not only for small to moderate size but also for large size instances of the problem. While such methods do not provide any guarantee about optimality of solutions, in most cases they do provide high quality solutions that meet expected requirements of users. In this paper we consider the use of heuristic and meta-heuristic methods for solving satellite scheduling problems. We consider some local search methods (Hill Climbing, Simulated Annealing and Tabu Search) and population based methods (Genetic Algorithms and their variants). We show the instantiation of these methods for solving the case of Ground Station Scheduling, which is one of the most used variants of the satellite scheduling. Some computation results are presented for Tabu Search method.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"211 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":"124732084","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

Empirical Evidence for Non-equilibrium Behaviors within Peer-to-Peer Structured Botnets 点对点结构化僵尸网络中非均衡行为的经验证据

2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2013-10-28 DOI: 10.1109/BWCCA.2013.50

D. Arora, Teghan Godkin, Adam Verigin, S. Neville

{"title":"Empirical Evidence for Non-equilibrium Behaviors within Peer-to-Peer Structured Botnets","authors":"D. Arora, Teghan Godkin, Adam Verigin, S. Neville","doi":"10.1109/BWCCA.2013.50","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.50","url":null,"abstract":"Although we have become adept at taking-down individual botnets, the global botnet threat has remained largely unabated, particularly if one considers the more recent generation of peer-to-peer (P2P) structured botnets. A potential formal explanation for this dichotomy is that P2P botnets simply fail to behave as statistically equilibrium systems, (i.e., as systems possessing singular statistical steady-states). Equilibrium assumptions have been commonly applied in the construction of botnet defenses, but these assumption have gone untested. This work shows empirically via standard Monte Carlo packet-level simulations that well studied Kademlia P2P botnet protocol can easily produce both statistically non-stationary and non-ergodic behaviors once the Internet routing processes are modeled. Moreover, it is shown that by re-tuning a botnet's run-time parameters a botmaster can make the botnet behave as a non-stationary process from the defender's perspective. More formally, this work provides empirical evidence that network level botnet detection features need not be measure invariant as has generally been presupposed.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"493 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":"122750467","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

SPTrust: Reputation Aggregation Method Based on Similarity to Reputation Scores of Power Nodes in Unstructured P2P Networks SPTrust:基于非结构化P2P网络中功率节点声誉分数相似度的声誉聚合方法

2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2013-10-28 DOI: 10.1109/BWCCA.2013.49

Sonoko Takeda, Hiroki Ushikubo, H. Shigeno

{"title":"SPTrust: Reputation Aggregation Method Based on Similarity to Reputation Scores of Power Nodes in Unstructured P2P Networks","authors":"Sonoko Takeda, Hiroki Ushikubo, H. Shigeno","doi":"10.1109/BWCCA.2013.49","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.49","url":null,"abstract":"Reputation aggregation methods are used in unstructured peer-to-peer (P2P) networks to evaluate the trustworthiness of participating peers and to combat malicious peer's behaviors. In reputation aggregation methods, each peer collects local scores by each transaction and calculates global scores by aggregating local scores. In each transaction, global scores enable peers to interact with reliable peers. Gossip Trust is proposed as a reputation aggregation method for the unstructured P2P networks. This method refers to reputation scores of power nodes, and power nodes are the peers of the high-ranking global scores. Although, there are dishonest peers that forge reputation scores of their own against other peers but get high global scores by providing authentic files in the networks. Gossip Trust does not consider the influence of forged reputation score when dishonest peers exist and are selected as power nodes. In this paper, we propose a reputation aggregation method called SPTrust. SPTrust is based on the similarity to reputation scores of power nodes. In SPTrust, each peer calculates the similarity value to reputation scores of power nodes. And it can detect that dishonest peers are selected as power nodes. By using SPTrust, we can effectively decrease the influence of forged reputation score from malicious peers and solve the problem in Gossip Trust. In computer simulations, SPTrust has been shown to decrease the number of inauthentic files downloads compared with Gossip Trust.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"43 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":"126648186","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

Autonomous Control Method Using AI Planning for Energy-Efficient Network Systems 基于AI规划的节能网络系统自主控制方法

2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2013-10-28 DOI: 10.1109/BWCCA.2013.111

Kouta Awahara, S. Izumi, Toru Abe, T. Suganuma

引用次数: 4

Braided Disjoint Branch Routing Protocol for WSNs 无线传感器网络的编织不连接分支路由协议

2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2013-10-28 DOI: 10.1109/BWCCA.2013.26

Azeddine Attir, Y. Challal, Abdelkrim Hadjidj, A. Bouabdallah

引用次数: 3

A Secure Wireless Communication System Integrating PRNG and Diffie-Hellman PKDS by Using a Data Connection Core 利用数据连接核心集成PRNG和Diffie-Hellman PKDS的安全无线通信系统

2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2013-10-28 DOI: 10.1109/BWCCA.2013.63

Yi-Li Huang, Fang-Yie Leu, Jung-Chun Liu, Lih-Jiun Lo, W. Chu

{"title":"A Secure Wireless Communication System Integrating PRNG and Diffie-Hellman PKDS by Using a Data Connection Core","authors":"Yi-Li Huang, Fang-Yie Leu, Jung-Chun Liu, Lih-Jiun Lo, W. Chu","doi":"10.1109/BWCCA.2013.63","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.63","url":null,"abstract":"In this paper, we propose a secure authentication scheme, called the Security system with Pseudo random number generator, Diffie-Hellman algorithms and Data Connection Core (SPDiD for short) for a wireless environment. The SPDiD employs a data connection core (DCC for short), as its pre-connected logic link before communication starts, to exchange the keys and messages for a connection authentication, not only reducing the number of steps for the process of authenticating a network entity when comparing it with LTE-A or WiMAX authentication processes, but also generating more symmetry keys by using pseudo random number sequences (PRNSs for short) for key and message encryption without lowering the security level of a wireless session. Moreover, the SPDiD protects the first authentication message delivered between the two network entities at the two ends of a connection by using the DCC of the user, which is only known to the user and authenticator. The purpose is to securely accomplish the mutual authentication between the two network entities, and prevent hackers from capturing the input parameters (i.e., the seeds) of a Pseudo random number generator (PRNG for short). Furthermore, we compare the SPDiD with popular wireless communication schemes, like the LTE-A and WiMAX. The results indicate that the SPDiD has better performance and higher security than the compared systems have.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"1 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":"129339341","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}

引用次数: 8

OLDA: An Efficient On-Line Data Aggregation Method for Wireless Sensor Networks 无线传感器网络中一种有效的在线数据聚合方法

2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2013-10-28 DOI: 10.1109/BWCCA.2013.17

M. Kamarei, M. Hajimohammadi, A. Patooghy, M. Fazeli

{"title":"OLDA: An Efficient On-Line Data Aggregation Method for Wireless Sensor Networks","authors":"M. Kamarei, M. Hajimohammadi, A. Patooghy, M. Fazeli","doi":"10.1109/BWCCA.2013.17","DOIUrl":"https://doi.org/10.1109/BWCCA.2013.17","url":null,"abstract":"Sending and receiving redundant packets in Wireless Sensor Networks (WSN), increase the congestion ratio as well as energy consumption in WSNs. In this regard, several data aggregation methods for WSNs have been presented to identify and to aggregate redundant packets. In this paper, we present an efficient on-line data aggregation method, OLDA, for real-time WSNs. OLDA method assigns different priorities to different events to help Cluster Head (CH) nodes in making an appropriate decision about the packet i.e., forwarding or aggregation. Indeed, CH nodes send newly received packet with probability 1-p and remove it with probability p. Since the parameter p is proportional to time and location of the occurred event, OLDA method, tends to forward packets of newly occurred events i.e., p is close to 0 here. When more time is passed parameter p is gradually increased, hence OLDA method tends to drop packets. Experimental results by the use of NS2 simulator show that OLDA method effectively reduces the miss rate compared with DASDR and RDAG aggregation methods. Also, OLDA method aggregates more than 70% of redundant packets and reduces the network end-to-end delay compared with RAG and SPEED methods.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"41 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":"116325551","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}

引用次数: 8

CMMI Security Model for Cloud Manufacturing System's Network 云制造系统网络的CMMI安全模型

2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2013-10-28 DOI: 10.1109/BWCCA.2013.78

An-Na Kang, J. Park, L. Barolli, Hwa-Young Jeong

引用次数: 4

Default Logic for Diagnostic of Discrete Time System 离散时间系统诊断的默认逻辑

2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2013-10-28 DOI: 10.1109/BWCCA.2013.72

T. Le, A. Doncescu, P. Siegel

引用次数: 4

Improve Two Remote User Authentication Scheme Using Smart Card 改进基于智能卡的两种远程用户认证方案

2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications Pub Date : 2013-10-28 DOI: 10.1109/BWCCA.2013.71

Chin-Ling Chen, Wei-Chen Tsai, Fang-Yie Leu

引用次数: 1