The rogue access point identification: a model and classification review

Most people around the world make use of public Wi-Fi hotspots, as their daily routine companion in communication. The access points (APs) of public Wi-Fi are easily deployed by anyone and everywhere, to provide hassle-free Internet connectivity. The availability of Wi-Fi increases the danger of adversaries, taking advantages of sniffing the sensitive data. One of the most serious security issues encountered by Wi-Fi users, is the presence of rogue access points (RAP). Several studies have been published regarding how to identify the RAP. Using systematic literature review, this research aims to explore the various methods on how to distinguish the AP, as a rogue or legitimate, based on the hardware and software approach model. In conclusion, all the classifications were summarized, and produced an alternative solution using beacon frame manipulation technique. Therefore, further research is needed to identify the RAP.

Programmable MAC in Body Area Networks, One Command at a Time

The discussion concerning programmable MAC in Body Area Networks (BANs) is due to the demand for simple and low-power sensor nodes. Additionally, the diverse applications in BANs require low-level modifications to support adaptive services or custom functions. In this work, we propose a novel scheme for programmable MAC, which requires a minor modification to the beacon frame of IEEE 802.15.6-2012. Specifically, our main contribution is the attachment of a command to the beacon, which is broadcasted at the beginning of each superframe by the hub. The hub requests an action, typically a modification of a MAC capability field, by the nodes with a metric which satisfies a constraint. Thus, one command at a time, the proposed scheme is applied with a negligible overhead. Two adaptive use cases, based on signal strength, are implemented to demonstrate this scheme. Firstly, the hub requests the nodes with high signal strength to enable relay support and secondly, the hub requests the nodes with low signal strength to set a sleeping pattern. In the first case packet delivery increases significantly, while in the second case each node saves an amount of energy.

Programmable MAC in Body Area Networks, One Command at a Time

The discussion concerning programmable MAC in Body Area Networks (BANs) is due to the demand for simple and low-power sensor nodes. Additionally, the diverse applications in BANs require low-level modifications to support adaptive services or custom functions. In this work, we propose a novel scheme for programmable MAC, which requires a minor modification to the beacon frame of IEEE 802.15.6-2012. Specifically, our main contribution is the attachment of a command to the beacon, which is broadcasted at the beginning of each superframe by the hub. The hub requests an action, typically a modification of a MAC capability field, by the nodes with a metric which satisfies a constraint. Thus, one command at a time, the proposed scheme is applied with a negligible overhead. Two adaptive use cases, based on signal strength, are implemented to demonstrate this scheme. Firstly, the hub requests the nodes with high signal strength to enable relay support and secondly, the hub requests the nodes with low signal strength to set a sleeping pattern. In the first case packet delivery increases significantly, while in the second case each node saves an amount of energy.

Energy Efficient Beacon Scheduling in WSN

In wireless sensor network the main source of energy consumption is Idle listening. Keeping energy consumption in mind the wireless sensor network should quickly sensing data. The communication between the nodes is only possible when both nodes are in active state. In this paper, we have implemented a modified beacon scheduling in the recipient MAC protocol. the data will be transmitted to the node in the active state thus effectively saving the energy consumption in the idle state. For transmission of data, synchronization of all nodes is important. Each node has its defined time slot to avoid collision of data. The receiver node sends a beacon frame request to the slave node in active state in response to it the slave node sends data frame if any to the node. The communication takes place only in the active state thus saving the energy in passive state (sleep state). The system is simulated in visual basic software and the graphs are plotted accordingly. It also shows the active and sleepy state of the network.

Hybrid MAC Protocol for UAV-Assisted Wireless Sensor Networks

This paper proposes a hybrid medium access control (MAC) protocol for wireless sensor network (WSN) data gathering, employing unmanned aerial vehicles (UAV). The UAV sends a beacon frame periodically to inform sensor nodes regarding its presence. Afterward, each sensor node which receives beacon frame contends to send registration frame to the UAV. The UAV will transmit the second beacon frame to the registered nodes to notify their transmission schedule. The time-slot scheme is used for the transmission schedule. The transmission schedule of each sensor is determined based on their priority. Specifically, the priority of each sensor is determined during the registration process. Furthermore, the architecture of UAV-WSN data gathering system is introduced in this paper. Simulations are performed, showing that the proposed MAC protocol achieves fairness while enhancing network performance.

Research and Solution on Bottleneck Problem in Zigbee

When the root is collecting data at a tree-based network, more upper nodes is usually with more packets usually. We called this bottleneck problem. The goal of this paper is to solve the bottleneck problem in ZigBee tree network. We use The Beacon-Only Period Approach which has been proposed by IEEE802.15.4b to avoid the collision caused by beacon frame. Moreover, we propose a centralized algorithm (TDMLF) that enables the nodes to fully use the GTS transmission. TDMLF not only avoides the hidden node problem which occurs in IEEE802.15.4, but also enables the entire network to achieve a more effective parallel transmission. Simulation results show that the TDMLF algorithm effectively reduces the bottleneck problem, and thus achieves a high delivery ratio. Moreover, because of no collision, the TDMLF also reduces the waste of time and energy by retransmission.