Group-Based Medium Access Control for IEEE 802.11n Wireless LANs

Group-Based Medium Access Control for IEEE 802.11n Wireless LANs Abstract In this paper, we introduce a MAC scheme that reduces the probability of collision and also uses frame aggregation to improve the efficiency. The scheme we propose is called Group-based MAC (GMAC). Our scheme divides the contending stations into groups. Out of each group, only

Fast Transmission to Remote Cooperative Groups A New Key Management Paradigm

Fast Transmission to Remote Cooperative Groups A New Key Management Paradigm Abstract The problem of efficiently and securely broadcasting to a remote cooperative group occurs in many newly emerging networks. A major challenge in devising such systems is to overcome the obstacles of the potentially limited communication from the group to the sender, the unavailability

EMAP Expedite Message Authentication Protocol for Vehicular Ad Hoc Networks

EMAP Expedite Message Authentication Protocol for Vehicular Ad Hoc Networks Abstract Vehicular ad hoc networks (VANETs) adopt the Public Key Infrastructure (PKI) and Certificate Revocation Lists (CRLs) for their security. In any PKI system, the authentication of a received message is performed by checking if the certificate of the sender is included in the current

Efficient Algorithms for Neighbor Discovery in Wireless Networks

Efficient Algorithms for Neighbor Discovery in Wireless Networks Abstract Neighbor discovery is an important first step in the initialization of a wireless ad hoc network. In this paper, we design and analyze several algorithms for neighbor discovery in wireless networks. Starting with a single-hop wireless network of nodes, we propose a ALOHA-like neighbor discovery algorithm

Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases

Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases Abstract Mining high utility itemsets from a transactional database refers to the discovery of itemsets with high utility like profits.Although a number of relevant algorithms have been proposed in recent years, they incur the problem of producing a large number ofcandidate itemsets for high utility

EAACK – A Secure Intrusion-Detection System for MANETs

EAACK—A Secure Intrusion-Detection System for MANETs Abstract The migration to wireless network from wired network has been a global trend in the past few decades. The mobility and scalability brought by wireless network made it possible in many applications. Among all the contemporary wireless networks, Mobile Ad hoc NETwork (MANET) is one of the most

Dynamic Resource Allocation Using Virtual Machines For Cloud Computing Environment

Dynamic Resource Allocation Using Virtual Machines For Cloud Computing Environment Abstract Cloud computing allows business customers to scale up and down their resource usage based on needs. Many of the touted gains in the cloud model come from resource multiplexing through virtualization technology. In this paper, we present a system that uses virtualization technology to

Dynamic Coverage of Mobile Sensor Networks

Dynamic Coverage of Mobile Sensor Networks Abstract In this paper, we study the coverage of a mobile sensor network from a different perspective. Instead of trying to achieve an improved stationary network configuration as the end result of sensor movement, we are interested in the dynamic aspects of network coverage resulting from the continuous movement

Distributed Web Systems Performance Forecasting Using Turning Bands Method

Distributed Web Systems Performance Forecasting Using Turning Bands Method Abstract With the increasing development of distributed computer systems (DCSs) in networked industrial and manufacturing applications on the Worldwide Web (WWW) platform, including service-oriented architecture and Web of Things QoS-aware systems, it has become important to predict the Web performance. In this paper, we present Web

Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks

Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks Abstract We introduce the notion of sufficient set and necessary set for distributed processing of probabilistic top-k queries in cluster-based wireless sensor networks. These two concepts have very nice properties that can facilitate localized data pruning in clusters. We develop a suite of algorithms, namely,