• Journal of Communications and Networks
• /
• v.17 no.4
• /
• pp.440-448
• /
• 2015

In this paper, we study the problem of selfish behavior of secondary users (SUs) based on cognitive radio (CR) with the presence of primary users (PUs). SUs are assumed to contend on a channel using the carrier sense multiple access with collision avoidance (CSMA/CA) and PUs do not consider transmission of SUs, where CSMA/CA protocols rely on the random deference of packets. SUs are vulnerable to selfish attacks by which selfish users could pick short random deference to obtain a larger share of the available bandwidth at the expense of other SUs. In this paper, game theory is used to study the systematic cheating of SUs in the presence of PUs in multichannel CR networks. We study two cases: A single cheater and multiple cheaters acting without any restraint. We identify the Pareto-optimal point of operation of a network with multiple cheaters and also derive the Nash equilibrium of the network. We use cooperative game theory to drive the Pareto optimality of selfish SUs without interfering with the activity of PUs. We show the influence of the activity of PUs in the equilibrium of the whole network.

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1108-1119
• /
• 2015

Multicast communication of mobile ad hoc networks is vulnerable to internal attacks due to its routing structure and high scalability of its participants. Though existing intrusion detection systems (IDSs) act smartly to defend against attack strategies, adversaries also accordingly update their attacking plans intelligently so as to intervene in successful defending schemes. In our work, we present a novel indirect internal stealthy attack on a tree-based multicast routing protocol. Such an indirect stealthy attack intelligently makes neighbor nodes drop their routing-layer unicast control packets instead of processing or forwarding them. The adversary targets the collision avoidance mechanism of the Medium Access Control (MAC) protocol to indirectly affect the routing layer process. Simulation results show the success of this attacking strategy over the existing "stealthy attack in wireless ad hoc networks: detection and countermeasure (SADEC)" detection system. We design a cross-layer automata-based stealthy attack on multicast routing protocols (SAMRP) attacker detection system to identify and isolate the proposed attacker. NS-2 simulation and analytical results show the efficient performance, against an indirect internal stealthy attack, of SAMRP over the existing SADEC and BLM attacker detection systems.

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.43-49
• /
• 2011

In this paper, a new medium access control (MAC) protocol entitled three-phase multiple access with continual contention resolution (TPMA-CCR) is proposed for wireless multi-hop ad hoc networks. This work is motivated by the previously known three-phase multiple access (TPMA) scheme of Hou and Tsai [2] which is the suitable MAC protocol for clustering multi-hop ad hoc networks owing to its beneficial attributes such as easy collision detectible, anonymous acknowledgment (ACK), and simple signaling format for the broadcast-natured networks. The new TPMA-CCR is designed to let all contending nodes participate in contentions for a medium access more aggressively than the original TPMA and with continual resolving procedures as well. Through the systematical performance analysis of the suggested protocol, it is also shown that the maximum throughput of the new protocol is not only superior to the original TPMA, but also improves on the conventional slotted carrier sense multiple access (CSMA) under certain circumstances. Thus, in terms of performance, TPMA-CCR can provide an attractive alternative to other contention-based MAC protocols for multi-hop ad hoc networks.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.6
• /
• pp.499-505
• /
• 2009

Main design issues for MAC (Medium Access Control) protocol in underwater sensor networks are long propagation delay caused by the low speed of sound, difficult synchronization, and energy-limited node's life. We aimed to mitigate the problems of strict synchronization and channel inefficiency of TDMA and also the throughput degradation induced by unavoidable collisions in contention based MAC protocols. This proposed protocol improved not only the energy efficiency by adopting a sleep-mode, but also the throughput by reducing collisions and increasing channel efficiency.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.118-127
• /
• 2006

The wireless transmission medium inherently broadcasts a signal to all neighbor nodes in the transmission range. Existing asynchronous MAC protocols do not provide a concrete solution for reliable broadcast in link layer. This mainly comes from that an omnidirectional broadcasting causes to reduce the network performance due to the explosive collisions and contentions. This paper proposes a directional broadcast protocol by using neighborhood information in the link layer based o,1 directional antennas, named MNDB (MAC protocol with Neighborhood for reliable Directional Broadcast). This protocol makes use of neighborhood information and DMACA (Directional Multiple Access and Collision Avoidance) scheme through 4-way handshake to support a reliable directional broadcast. To analyze its performance, MNDB protocol si compared with $RMDB^{[1]}$, the protocol 2 of reference [3], and IEEE 802.11 $protocol^{[9]}$, in terms of the number of collisions, the number of dropped packets, the number of redundant packets, and broadcast delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.96-103
• /
• 2000

The voice traffic is one of the most important real-time objects in WATM(Wireless Asynchronous Transfer Mode) networks. In this paper, we propose a new MAC(Medium Access'Control) protocol for the efficienttransmission of voice traffic over WATM networks in the multimedia environment and compare the performanceto existing similar protocols. The new protocol separates the reservation slot period for voice and that for data toguarantee some level of QoS(Quality of Service) in voice traffic. This is denoted by a slot assignment functiondepending on the frame size. According to the characteristics of voice traffic which is repeatedly in silent states,the protocol allocates voice reservation request slots dynamically with respect to the number of silent(off state)voice sources and also sends the first block of talkspurt restarted after silent period with a reservation requestslot to reduce the access delay.The simulation results show that the proposed protocol has better performance than Slotted Aloha in bandwidthefficiency, and can serve a certain level of QoS by the given slot assignment function even when the number ofvoice terminals varies dynamically. This means we can observe that the new MAC protocol is much better thanthe NC-PRMA(None Collision-Packet Reservation Multiple Access) protocol.

• The Journal of the Korea Contents Association
• /
• v.7 no.4
• /
• pp.10-19
• /
• 2007

In this paper, Class-1 Air-interface protocols of EPCglobal applied to RFID system in UHF band are analyzed, and the standard anticollision algorithms are realized. Also, the improved anticollision algorithms of the Class-1 Generation-1 and Generation-2 protocol are proposed and the performances of anticollision algorithms are compared. As the results, reduction ratio of total tag recognition time of the improved Generation-1 algorithm is 54.5% for 100 tags and 63.4% for 1000 tags with respect to standard algorithm, respectively. And the reduction ratio of the improved Generation-2 algorithm is 7.9% for 100 tags and 11.7% for 1000 tags. Total recognition times of the improved algorithms are shorter than those of standard algorithms according to increasing the number of tag. Therefore, the improved anticollision algorithm proposed in this paper is the advanced method improving the performance of tag recognition in the RFID system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1363-1372
• /
• 2011

Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.2
• /
• pp.99-113
• /
• 1992

In general, TDMA and FDMA have been used for multiple access communication methods. Recently. However, ALOHA and CSMA protocols came to exist as new schemes for VSAT data networks and LANs, respectively. These schemes are proven to be effective for packet switched communication systems that has bursty traffic but packet collisions. In this paper we analyze capture statistics arising from fading channels in packet radio communication systems in the context of ALOHA protocol. We derive general results of the exact form of capture probabilities and present numerical data for wide range of fading parameters. Since the capture probabilities are found to approach zero when the number of transmitted signals become larger, we are able to determine the achievable channel throughput by a least squares fitting of an exponential-type function to the probabilities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.144-153
• /
• 2010

Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.