Christos A. Papageorgiou, Konstantinos Birkos, T. Dagiuklas, S. Kotsopoulos
{"title":"Extending P2PSIP VoIP communication for ad hoc networks","authors":"Christos A. Papageorgiou, Konstantinos Birkos, T. Dagiuklas, S. Kotsopoulos","doi":"10.1145/1868630.1868649","DOIUrl":"https://doi.org/10.1145/1868630.1868649","url":null,"abstract":"In this paper, we modify and extend the P2PSIP's leading draft (RELOAD) in order to both adjust its operation better with respect to the properties of wireless ad hoc networks and improve the provided security level. In terms of security, a public/private key infrastructure scheme is used along with a symmetric cryptographic mechanism. Public key cryptography is used to encrypt the communication between the peers, while symmetric cryptography is used primarily for authentication purposes. The public/private key pair of each peer is periodically refreshed to further improve the security level of the system. Two schemes are proposed: the Hierarchical RELOAD (HR), where the Bootstrap peers are central to all the operations implemented within the protocol, and the Semi-Hierarchical RELOAD (SHR) that follows the same logic with HR but also permits, for a limited time window, a more distributed operation for the protocol. We evaluate the proposed protocols in comparison to RELOAD, and the results show that HR produces considerably lower communication overhead within the peer-to-peer network than both RELOAD and SHR, with the latter's however more flexible network operation justifying the additional cost.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116502299","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 probabilistic analysis of energy efficiency of wireless sensor network duty-cycled MAC protocols: application to S-MAC and Eco-MAC","authors":"R. Abo, Kamel Barkaoui, Hafedh Zayani","doi":"10.1145/1868630.1868638","DOIUrl":"https://doi.org/10.1145/1868630.1868638","url":null,"abstract":"In this paper, we are conducting a probabilistic analysis of the energy consumption of nodes of a wireless sensor network caused by the use of MAC layer protocols, to know which one is best suited to save energy. Representative examples of duty-cycled protocols have been chosen: S-MAC as a pure contention-based protocol, and Eco-MAC as a hybrid protocol, i.e. a protocol which uses contention and multiplexing mechanisms. We have chosen simple network topologies to highlight the role of collisions in energy expenditure, and the way the previous protocols treat them. We have carried out our analysis by using the stochastic process algebra PEPA. Its formal language has been used to model networks which implement these protocols. The PEPA Eclipse plug-in permitted us to simulate the models and to show that Eco-MAC saves energy of nodes in a better way than S-MAC, for the network topologies we modeled.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126477406","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}
Alexandros Zaharis, Adamantini Martini, L. Perlepes, G. Stamoulis, Panayotis Kikiras
{"title":"Live forensics framework for wireless sensor nodes using sandboxing","authors":"Alexandros Zaharis, Adamantini Martini, L. Perlepes, G. Stamoulis, Panayotis Kikiras","doi":"10.1145/1868630.1868643","DOIUrl":"https://doi.org/10.1145/1868630.1868643","url":null,"abstract":"Typical sensor nodes are resource constrained devices containing user level applications, operating system components, and device drivers in a single address space, with no form of memory protection. A malicious user could easily capture a node and tamper the applications running, in order to perform different types of attacks. In this paper, we propose a remote live forensics protection architecture that prevents the execution of tampered software while alarming the owners of the sensors network. Using sandboxing to restrict application memory accesses within the address space and forensic techniques to validate the authenticity of the running applications we prevent malicious code from being executed while specifying the intrusion.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116372953","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":"Slow but certain wins the race: authenticated bundle communication in delay tolerant networks","authors":"W. Itani, Ayman Tajeddine, A. Kayssi, A. Chehab","doi":"10.1145/1868630.1868647","DOIUrl":"https://doi.org/10.1145/1868630.1868647","url":null,"abstract":"We present SEGURA, a Bundle layer security extension for ensuring the authenticity and integrity of message bundles in Delay Tolerant Networks (DTNs). SEGURA employs probabilistic set membership constructs to amortize the cryptographic functionality of traditional authentication mechanisms such as Message Authentication Codes, Hash trees, authentication graphs, and digital signatures in relatively small sized data structures. Using probabilistic set membership constructs in the integrity verification process eliminates any form of dependency among individual network packets which gives the security protocol the capability of handling out of order packets and enduring high packet loss rates. This makes SEGURA a very suitable choice for operation in performance-challenged DTNs with highly disruptive natures featuring excessive disconnection rates, massive delays, and intermittent communication. Moreover, the SEGURA integrity enforcement mechanism gives intermediate DTN routers and gateways the ability to verify the integrity of bundles without employing expensive public-key operations. The goal here is to isolate the effects of any malicious attack as close as possible to the source of the attack. This results in the reduction of bogus network traffic and hence contributes to a major decrease in the messaging delay caused by distant packet retransmission.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123466198","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":"Putting together QoS and security in autonomic pervasive systems","authors":"M. Alia, M. Lacoste, Ruan He, F. Eliassen","doi":"10.1145/1868630.1868634","DOIUrl":"https://doi.org/10.1145/1868630.1868634","url":null,"abstract":"Current pervasive systems tend to consider security and QoS separately, ignoring the influence of each aspect on the other. This paper presents an adaptation model based on selection of component compositions enabling to capture dynamic and fine-grained trade-offs between both QoS and security in those systems. The model is multi-constraints and utility-based, and takes into account computing resources, the perceived risk level, and user preferences. We illustrate through a case study of a typical Beyond 3G adaptive multimedia streaming service how the model may be applied to find the right balance between different QoS and security dimensions.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126325855","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":"Applying symmetric and asymmetric key algorithms for the security in wireless networks: proof of correctness","authors":"A. Boukerche, Yonglin Ren, L. Mokdad","doi":"10.1145/1868630.1868637","DOIUrl":"https://doi.org/10.1145/1868630.1868637","url":null,"abstract":"In a wireless network, open and wireless communication channels set the restriction of wired connections free, because wireless signal acts as the platform of data transmission. On the other hand, the open and shared nature of wireless networks also causes a number of security concerns. In particular, data confidentiality is one of the most important issues. As usual, cryptosystems are adopted to protect the data confidentiality and integrity, including symmetric and asymmetric encryption algorithms. However, due to the limitations of these algorithms, how to apply them to wireless and mobile networks is always a debatable topic. In this paper, we explore the issue of applying both symmetric and asymmetric key algorithms for data encryption and authentication. Then we propose an advisable solution for the application of these cryptographic algorithms, which not only takes advantage of symmetric key to provide the effective protection of data transmission, but also employs asymmetric key to authenticate a node reliably. We formalize the security analysis and show that our system owns effective and provable secure attributes based on rational combination of classic encryption algorithms. Thus, we avoid the weakness of these two cryptosystems and make use of their advantages to establish a secure environment, by the combination of symmetric and asymmetric key algorithms.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121036989","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":"Optimized HCCA schedulers for an IEEE 802.11e/AFDX hybrid network","authors":"Bafing Sambou, F. Peyrard, C. Fraboul","doi":"10.1145/1868630.1868635","DOIUrl":"https://doi.org/10.1145/1868630.1868635","url":null,"abstract":"This paper proposes a new HCCA scheduling scheme for AFDX (Avionics Full DupleX switched Ethernet) traffics on IEEE 802.11e Wireless LAN (WLAN). The AFDX requirements are related to the temporal constraints (end-to-end latency and jitter). Our scheduling algorithm AWS (AFDX Wireless Scheduler) improves the HCCA reference scheduler (RS); in order to convey AFDX traffic on IEEE 802.11e wireless network. Notice that, the HCCA reference scheduler is more suitable for CBR (Constant Bit Rate) traffics. AWS is based on the priority class, on the frame retransmission management, on the EDF (Earliest Deadline First) algorithm and on the maximal jitter. We also present, in this paper, an optimized version of AWS (OAWS) which uses the un-used bandwidth of TXOPs to transmit frames in critical or retransmission state. The simulation results show that we have a very large reduction of dropped packets (reached deadline) with AWS compared to RS, and the OAWS performances are better than AWS performances.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132487117","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":"Elliptic curve cryptography based authentication protocol for small computational capacity RFID systems","authors":"G. Gódor, Péter Szendi, S. Imre","doi":"10.1145/1868630.1868648","DOIUrl":"https://doi.org/10.1145/1868630.1868648","url":null,"abstract":"In the last few years RFID technology widespread. This technology can be found in each field of our daily life, e.g. supply-chain management, libraries, access management etc. For the sake of small computational capacity of RFID Tags, at first, only mathematical and logical operations and lightweight authentication methods can be used. However, thanks to the evolution of RFID technology, nowadays PKI infrastructure is also usable in this environment. In this paper we present our elliptic curve cryptography based authentication protocol which protects against the well-known attacks. We give a brief comparison with other EC based protocols in the security point of view.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124774999","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. Harada, M. Komatsu, Tamaki Nakamura, S. Shioda, S. Sakata, T. Murase
{"title":"Cross-layer approach for supporting QoS in IEEE802.11 DCF wireless LANs","authors":"Y. Harada, M. Komatsu, Tamaki Nakamura, S. Shioda, S. Sakata, T. Murase","doi":"10.1145/1868630.1868632","DOIUrl":"https://doi.org/10.1145/1868630.1868632","url":null,"abstract":"We propose a cross-layer approach for supporting the quality of service (QoS) of bidirectional real-time applications in IEEE802.11 DCF WLANs. In the proposal, the class-based queueing with the priority queue (PQ) scheduler is exploited in network layer at the access point (AP), and real-time applications are given the highest priority. In order to regulate the best effort traffic sent from wireless stations, we apply the MAC-frame Receive Opportunity Control (ROC), in which the AP intentionally does not return the ACK frame with a given probability when receiving a data frame of best effort traffic from a wireless station. By the intentional failure in acknowledging the receipt of frames, the ROC can control the packet sending rate on a per-station basis. The class-based queueing in network layer and the ROC in MAC layer are jointly utilized with the TCP window control in transport layer to provide the QoS guarantee for bidirectional real-time applications. The proposed cross-layer approach requires only the upgrade of the hardware (or software) of the AP, which is an important advantage over existing proposals on the QoS support in WLANs. The extensive simulation experiments reveal that, when best-effort TCP flows compete with voice conversations (VCs) in a WLAN, the proposed cross-layer approach provides better QoS to VCs than IEEE802.11e and, when best-effort UDP flows compete with VCs, the proposed approach and IEEE802.11e provides the same level of QoS to VCs.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125564110","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 distributed key establishment scheme for wireless mesh networks using identity-based cryptography","authors":"Duygu Karaoglan, A. Levi, E. Savaş","doi":"10.1145/1868630.1868633","DOIUrl":"https://doi.org/10.1145/1868630.1868633","url":null,"abstract":"In this paper, we propose a secure and efficient key establishment scheme designed with respect to the unique requirements of Wireless Mesh Networks. Our security model is based on Identity-based key establishment scheme without the utilization of a trusted authority for private key operations. Rather, this task is performed by a collaboration of users; a threshold number of users come together in a coalition so that they generate the private key. We performed simulative performance evaluation in order to show the effect of both the network size and the threshold value. Results show a tradeoff between resiliency and efficiency: increasing the threshold value or the number of mesh nodes also increases the resiliency but negatively effects the efficiency. For threshold values smaller than 8 and for number of mesh nodes in between 40 and 100, at least 90% of the mesh nodes can compute their private keys within at most 70 seconds. On the other hand, at threshold value 8, an increase in the number of mesh nodes from 40 to 100 results in 25% increase in the rate of successful private key generations.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131594222","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}