• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5928-5947
• /
• 2019

Multicast Mesh based Mobile Ad-hoc NETworks (MANETs) provide efficient data transmission in energy restraint areas without a fixed infrastructure. In this paper, the authors present an improved version of protocol SLIMMER developed by them earlier, and name it SLIMMER-SN. Most mesh-based protocols suffer from redundancy; however, the proposed protocol controls redundancy through the concept of forwarding nodes. The proposed protocol uses remaining energy of a node to decide its energy efficiency. For measuring stability, a new metric called Stability of Node (SN) has been introduced which depends on transmission range, node density and node velocity. For data transfer, a weighted cost function selects the most energy efficient nodes / most stable nodes or a weighted combination of both. This makes the node selection criteria more dynamic. The protocol works in two steps: (1) calculating SN and (2) using SN value in the weighted cost function for selection of nodes. The study compared the proposed protocol, with other mesh-based protocols PUMA and SLIMMER, based on packet delivery ratio (PDR), throughput, end-to-end delay and average energy consumption under different simulation conditions. Results clearly demonstrate that SLIMMER-SN outperformed both PUMA and SLIMMER.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1642-1661
• /
• 2015

Wireless mesh networks are a special type of broadcast networks which cover the qualifications of both ad-hoc as well as infrastructure mode networks. These networks offer connectivity to the last mile through hop to hop communication and by comparatively reducing the cost of infrastructure in terms of wire and hardware. Channel assignment has always been the focused area for such networks specifically when using non-overlapping channels and sharing radio frequency spectrum while using multiple radios. It has always been a challenge for mesh network on impartial utilization of the resources (channels), with the increase in users. The rational utilization of multiple channels and multiple radios, not only increases the overall throughput, capacity and scalability, but also creates significant complexities for channel assignment methods. For a better understanding of research challenges, this paper discusses heuristic methods, measurements and channel utilization applications and also examines various researches that yield to overcome this problem. Finally, we highlight prospective directions of research.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.1976-1997
• /
• 2016

This paper investigates the problem of co-tier interference mitigation for dynamic small- cell networks, in which the load of each small-cell varies with the number of active associated small-cell users (SUs). Due to the fact that most small-cell base stations (SBSs) are deployed in an ad-hoc manner, the problem of reducing co-tier interference caused by dynamic loads in a distributed fashion is quite challenging. First, we propose a new distributed channel allocation method for small-cells with dynamic loads and define a dynamic interference graph. Based on this approach, we formulate the problem as a dynamic interference graph game and prove that the game is a potential game and has at least one pure strategy Nash equilibrium (NE) point. Moreover, we show that the best pure strategy NE point minimizes the expectation of the aggregate dynamic co-tier interference in the small-cell network. A distributed dynamic learning algorithm is then designed to achieve NE of the game, in which each SBS is unaware of the probability distributions of its own and other SBSs' dynamic loads. Simulation results show that the proposed approach can mitigate dynamic co-tier interference effectively and significantly outperform random channel selection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1571-1589
• /
• 2016

Nodes in MANETs are battery powered which makes energy an invaluable resource. In OLSR, MPRs are special nodes that are selected by other nodes to relay their data/control traffic which may lead to high energy consumption of MPR nodes. Therefore, employing energy efficient MPR selection mechanism is imperative to ensure prolonged network lifetime. However, misbehaving MPR nodes tend to preserve their energy by dropping packets of other nodes instead of forwarding them. This leads to huge energy loss and performance degradation of existing energy efficient MPR selection schemes. This paper proposes an energy efficient secure MPR selection (ES-MPR) technique that takes into account both energy and security metrics for MPR selection. It introduces the concept of 'Composite Eligibility Index' (CEI) to examine the eligibility of a node for being selected as an MPR. CEI is used in conjunction with willingness to provide distinct selection parameters for Flooding and Routing MPRs. Simulation studies reveal the efficiency of ES-MPR in selection of energy efficient secure and stable MPRs, in turn, prolonging the network operational lifetime.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2081-2101
• /
• 2016

Successive interference cancellation (SIC) is considered to be a promising technique to mitigate multi-user interference and achieve concurrent uplink transmissions, but the optimal power allocation (PA) issue for SIC users is not well addressed. In this article, we focus on the optimization of the PA ratio of users on an SIC channel and analytically obtain the optimal PA ratio with regard to the signal-to-interference-plus-noise ratio (SINR) threshold for successful demodulation and the sustainable demodulation error rate. Then, we design an efficient resource allocation (RA) scheme using the obtained optimal PA ratio. Finally, we compare the proposal with the near-optimum RA obtained by a simulated annealing search and the RA scheme with random PA. Simulation results show that our proposal achieves a performance close to the near-optimum and much higher performance than the random scheme in terms of total utility and Jain's fairness index. To demonstrate the applicability of our proposal, we also simulate the proposal in various network paradigms, including wireless local area network, body area network, and vehicular ad hoc network.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.87-97
• /
• 2009

A Mobile Ad hoc Network (MANET) is characterized by multi-hop wireless connectivity, frequently changing network topology with mobile nodes and the efficiency of the dynamic routing protocol plays an important role in the performance of the network. In this paper, the performance of five routing protocols for MANET is compared by using OPNET modeler: AODV, DSR, GRP, OLSR and TORA. The various performance metrics are examined, such as packet delivery ratio, end-to-end delay and routing overhead with varying data traffic, number of nodes and mobility. In our simulation results, OLSR shows the best performance in terms of data delivery ratio in static networks, while AODV has the best performance in mobile networks with moderate data traffic. When comparing proactive protocols (OLSR, GRP) and reactive protocols (AODV, DSR) with varying data traffic in the static networks, proactive protocols consistently presents almost constant overhead while the reactive protocols show a sharp increase to some extent. When comparing each of proactive protocols in static and mobile networks, OLSR is better than GRP in the delivery ratio while overhead is more. As for reactive protocols, DSR outperforms AODV under the moderate data traffic in static networks because it exploits caching aggressively and maintains multiple routes per destination. However, this advantage turns into disadvantage in high mobility networks since the chance of the cached routes becoming stale increases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.270-286
• /
• 2012

In this paper, we propose a novel routing protocol called the Cartography Enhanced OLSR (CE-OLSR) for multi hop mobile ad hoc networks (multi hop MANETs). CE-OLSR is based on an efficient cartography gathering scheme and a stability routing approach. The cartography gathering scheme is non intrusive and uses the exact OLSR reduced signaling traffic, but in a more elegant and efficient way to improve responsiveness to the network dynamics. This cartography is a much richer and accurate view than the mere network topology gathered and used by OLSR. The stability routing approach uses a reduced view of the collected cartography that only includes links not exceeding a certain distance threshold and do not cross obstacles. In urban environments, IEEE 802.11 radio signals undergo severe radio shadowing and fading effects and may be completely obstructed by obstacles such as buildings. Extensive simulations are conducted to study the performances of CE-OLSR and compare them with those of OLSR. We show that CE-OLSR greatly outperforms OLSR in delivering a high percentage of route validity, a much higher throughput and a much lower average delay. In particular the extremely low average delay exacerbated by CE-OLSR makes it a viable candidate for the transport of real time data traffic in multi hop MANETs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.1992-2008
• /
• 2018

Mobile opportunistic network is a kind of ad hoc networks, which implements the multi-hop routing communication with the help of contact opportunity brought about by the mobility of the nodes. It always uses opportunistic data transmission mode based on store-carry-forward to solve intermittent connect problem of link. Although many routing schemes have been proposed, most of them adopt the greedy transmission mode to pursue a higher delivery efficient, which result in unfairness extremely among nodes. While, this issue has not been paid enough attention up to now. In this paper, we analyzed the main factors that reflect fairness among nodes, modeled routing selection as a multiple attribute decision making problem, and proposed our Fairness-aware Routing Strategy, named FARS. To evaluate the performance of our FARS, extensive simulations and analysis have been done based on a real-life dataset and a synthetic dataset, respectively. The results show that, compared with other existing protocols, our FARS can greatly improve the fairness of the nodes when ensuring the overall delivery performance of the network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.3104-3123
• /
• 2022

The development of Vehicular Ad hoc Network (VANET) has greatly improved the efficiency and safety of social transportation, and the routing strategy for VANET has also received high attention from both academia and industry. However, studies on dynamic matching of routing policies with the message types of VANET are in short supply, which affects the operational efficiency and security of VANET to a certain extent. This paper studies the message types in VANET and fully considers the urgency and reliability requirements of message forwarding under various types. Based on the diversified types of messages to be transmitted, and taking the diversified message forwarding strategies suitable for VANET scenarios as behavioral candidates, an adaptive routing method for the VANET message types based on reinforcement learning (RL) is proposed. The key parameters of the method, such as state, action and reward, are reasonably designed. Simulation and analysis show that the proposed method could converge quickly, and the comprehensive performance of the proposed method is obviously better than the comparison methods in terms of timeliness and reliability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.2
• /
• pp.511-527
• /
• 2024

This paper proposes a block-based self-organizing time-division multiple access (BSO-TDMA) protocol for very high frequency (VHF) data exchange system (VDES) in shipborne ad-hoc networks (SANETs). The BSO-TDMA reduces the collisions caused by the simultaneous transmission of automatic identification system (AIS) messages by uniformly allocating channel resources using a block-wise frame. For this purpose, the BSO-TDMA includes two functional operations: (1) frame configuration and (2) slot allocation. The first operation consists of block division and block selection. A frame is divided into multiple blocks, each consisting of fixed-size subblocks, by using the reporting interval (RI) of the ship. Then, the ship selects one of the subblocks within a block by considering the number of occupied slots for each subblock. The second operation allocates the slots within the selected subblock for transmitting AIS messages. First, one of the unoccupied slots within the selected subblock is allocated for the periodic transmission of position reports. Next, to transmit various types of AIS messages, an unoccupied slot is randomly selected from candidate slots located around the previously allocated slot. Experimental simulations are conducted to evaluate the performance of BSO-TDMA. The results show that BSO-TDMA has better performance than that of the existing SOTDMA.