• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.924-927
• /
• 2016

In this paper, we consider a cumulative distribution function (CDF)-based opportunistic scheduling for downlink transmission in a cellular network consisting of a base station and multiple mobile stations. We present a closed-form formula for the average starvation period of each mobile station (i.e., the length of the time interval between two successive scheduling points of a mobile station) over Markov time-varying channels. Based on our formula, we investigate the starvation period of the CDF-based scheduling for various system parameters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4662-4677
• /
• 2018

The dynamic opportunistic device-to-device (DO-D2D) network will frequently emerge in the fifth generation (5G) wireless communication due to high-density and fast-moving mobile devices. In order to improve the Quality of Experience (QoE) of users with different computing capacity devices in the DO-D2D network, in this paper, we focus on the study of how to reduce the packets retransmission delay and satisfy heterogeneous devices. To select as many devices as possible to transmit simultaneously without interference, the concurrent transmitters-selecting algorithm is firstly put forward. It jointly considers the number of packets successfully received by each device and the device's connectivity. Then, to satisfy different devices' demands while primarily ensuring the base-layer packets successfully received by all the devices, the layer-cooperation instantly decodable network coding is presented, which is used to select transmission packets combination for each transmitter. Simulation results illustrate that there is an appreciable retransmission delay gain especially in the poor channel quality network compared to the traditional base-station (BS) retransmission algorithm. In addition, our proposed algorithms perform well to satisfy the different demands of users with heterogeneous devices.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.4
• /
• pp.295-304
• /
• 2014

Communication infrastructure supports wide variety of mobile services such as photo and file sharing, location tracking, social network services and instant messaging. However, instances like power-loss and natural disasters disrupt these communication infrastructures unable to render support to these mobile services. Delay-tolerant networks (DTNs) offer a solution to these problems at hand. By utilizing mobility and opportunistic contacts among mobile devices, a plausible communication network can be establish and enable support to mobile applications. This paper presents an energy-efficient, reliable message delivery routing scheme with message prioritization rules for DTN. It uses the context information of nodes (mobile devices) such as the contact history (location and time of contact), speed/velocity, moving direction to determine the best forwarders among nodes in the network. The remaining energy of the nodes is also used to determine the message types a node can deliver successfully. The simulation results show that proposed approach outperforms Epidemic and Prophet routing schemes in terms of delivery ratio, overhead ratio, delivered messages per types and remaining energy.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.45-50
• /
• 2014

In this paper, we proposed a method using the user mobile device to overcome the interference constraint without building a cooperative communication system. In addition, in order to mitigate interference, we apply the user mobile device selection method, and then exploit power allocation scheme in the user mobile device. The proposed protocol is analyzed in the Rayleigh fading environment, and the performance system is evaluated in terms of the bit error rate and the outage probability. The simulation results showed that when the proposed transmission algorithm is applied, the interference can be mitigated. Further, network overload problems can be solved in the weak channel interference. Therefore, we can increase the network capacity without additional relay.

• International journal of advanced smart convergence
• /
• v.2 no.1
• /
• pp.6-11
• /
• 2013

Network Coding (NC) is a new paradigm for network communication. In network coding, intermediate nodes create new packets by algebraically combining ingress packets and send it to its neighbor node by broadcast manner. NC has rapidly emerged as a major research area in information theory due to its wide applicability to communication through real networks. Network coding is expected to improve throughput and channel efficiency in the wireless multi-hop network. Many researches have been carried out to employ network coding to wireless ad-hoc network. In this paper, we proposed a dynamic queue management to improve coding opportunistic to enhance efficiency of NC. In our design, intermediate nodes are buffering incoming packets to encode queue. We expect that the proposed algorithm shall improve encoding rate of network coded packet and also reduce end to end latency. From the simulation, the proposed algorithm achieved better performance in terms of coding gain and packet delivery rate than static queue management scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.90-92
• /
• 2017

Due to the popularity of social networks and the development of technology in mobile networking, the mobile social networks (MSNs) provide opportunities for the spread of information between mobile devices. As a result, understanding the information diffusion in the emerging MSNs is a critical issue. Many research studies have addressed diffusion minimization, which is a problem of how to find the proper initial k users who can effectively propagate as widely as possible in the minimum amount of time, similar to influence maximization. We address a study on association analysis among nodes in information diffusion and mobility pattern for mobile social networks. Experiments in our study were conducted in the Opportunistic Network Environment (ONE) simulator using GPS trace of mobile node, to show that the study results in MSNs. We also demonstrate that our experiments outperform other existing algorithms with various communication range and ratio of k influential nodes.

• Journal of Information Processing Systems
• /
• v.14 no.2
• /
• pp.286-308
• /
• 2018

The availability of powerful and sensor-enabled mobile and Internet-connected devices have enabled the advent of the ubiquitous sensor network (USN) paradigm. USN provides various types of solutions to the general public in multiple sectors, including environmental monitoring, entertainment, transportation, security, and healthcare. Here, we explore and compare the features of wireless sensor networks and USN. Based on our extensive study, we classify the security- and privacy-related challenges of USNs. We identify and discuss solutions available to address these challenges. Finally, we briefly discuss open challenges for designing more secure and privacy-preserving approaches in next-generation USNs.

• International Journal of Computer Science & Network Security
• /
• v.23 no.1
• /
• pp.153-163
• /
• 2023

This study is situated in the context of intelligent transport systems, where in-vehicle devices assist drivers to avoid accidents and therefore improve road safety. The vehicles present in a given area form an ad' hoc network of vehicles called vehicular ad' hoc network. In this type of network, the nodes are mobile vehicles and the messages exchanged are messages to warn about obstacles that may hinder the correct driving. Node mobilities make it impossible for inter-node communication to be end-to-end. Recognizing this characteristic has led to delay-tolerant vehicular networks. Embedded devices have small buffers (memory) to hold messages that a node needs to transmit when no other node is within its visibility range for transmission. The performance of a vehicular delay-tolerant network is closely tied to the successful management of the nodes' transit buffer. In this paper, we propose a message transit buffer management model for nodes in vehicular delay tolerant networks. This model consists in setting up, on the one hand, a policy of dropping messages from the buffer when the buffer is full and must receive a new message. This drop policy is based on the concept of intermediate node to destination, queues and priority class of service. It is also based on the properties of the message (size, weight, number of hops, number of replications, remaining time-to-live, etc.). On the other hand, the model defines the policy for selecting the message to be transmitted. The proposed model was evaluated with the ONE opportunistic network simulator based on a 4000m x 4000m area of downtown Bouaké in Côte d'Ivoire. The map data were imported using the Open Street Map tool. The results obtained show that our model improves the delivery ratio of security alert messages, reduces their delivery delay and network overload compared to the existing model. This improvement in communication within a network of vehicles can contribute to the improvement of road safety.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.1-8
• /
• 2010

Wireless multimedia service through the access to mobile telephone network or data network is a vital part of contemporary life, and the demand for frequency spectrum for new services is expected to explode as the ubiquitous computing proliferate. Cognitive radio is a technology, which automatically recognizes and searches for temporally and spatially unused frequency spectrum, then actively determines the communication method, bandwidth, etc. according to the environment, thus utilizing the limited spectrum resources efficiently. In this paper, we investigate the effects of imperfect sensing, misdetection and false alarm, on the primary and secondary users' spectrum usage through the analysis of continuous time Markov Chain. We analyzed the effects of the parameters such as sensing error, offered load on the system performance.

• Journal of Intelligence and Information Systems
• /
• v.23 no.2
• /
• pp.89-105
• /
• 2017

As the advances of technology in mobile networking and the popularity of online social networks (OSNs), the mobile social networks (MSNs) provide opportunities for marketing strategy. Therefore, understanding the information diffusion in the emerging MSNs is a critical issue. The information diffusion address a problem of how to find the proper initial nodes who can effectively propagate as widely as possible in the minimum amount of time. We propose a new diffusion scheme, called Hotspot DBC, which is to find k influential nodes considering each node's mobility behavior in the hotspot zones. Our experiments were conducted in the Opportunistic Network Environment (ONE) using real GPS trace, to show that the proposed scheme results. In addition, we demonstrate that our proposed scheme outperforms other existing algorithms.