Secrecy capacity against adaptive eavesdroppers in a random wireless network using friendly jammers and protected zone
- Authors: Giti, Jishan , Sakzad, Amin , Srinivasan, Bala , Kamruzzaman, Joarder , Gaire, Raj
- Date: 2020
- Type: Text , Journal article
- Relation: Journal of Network and Computer Applications Vol. 165, no. (2020), p.
- Full Text: false
- Reviewed:
- Description: In this paper, we consider deceptive friendly jammers in a half-duplex random wireless network against a group of adaptive eavesdroppers. The destinations, eavesdroppers and friendly jammers are distributed according to homogeneous Poisson point process (HPPP). To the best of our knowledge, we are the first to study such a system model. As we may combine hostile jamming and passive eavesdropping, the secrecy of legitimate communication might be compromised. To combat this and improve secrecy of transmission, a group of friendly jammers thus transmit a source-like signal to deceive the eavesdroppers and try to force them to be passive listeners as much as possible. We derive the secrecy capacity for this scenario. The secrecy performance is evaluated for different parameters and with a secrecy protected zone surrounding the source. Performance evaluation through illustrative numerical results demonstrates that the friendly jammers can enhance the secrecy of a random wireless network. The advantages of friendly jammers are particularly prominent if the secrecy protected zone is very small and/or the node intensity of the destinations is low. The results show that the friendly jammers can restore the secrecy in a hostile environment if sufficient friendly jammers (e.g., 0.01 km−2 for the provided system model) are hired. © 2020
- Description: Funding details: Australian Research Council, ARC Funding text 1: Joarder Kamruzzaman received the BSc and MSc degrees in Electrical and Electronic Engineering from Bangladesh University of Engineering and Technology, Dhaka, and the PhD degree in Information Systems Engineering from Muroran Institute of Technology, Hokkaido, Japan. He is currently a Professor in the School of Science, Engineering and Information Technology, Federation University Australia. Previously, he served as the Director of the Centre for Multimedia Computing, Communications and Artificial Intelligence Research hosted first by Monash University and later by Federation University. His research interests include distributed computing, Internet of Things, machine learning and cyber security. He has published 260+ peer-reviewed publications which include over 80 journal papers, 170 conferences, 11 book chapters and two edited reference books. He is the recipient of Best Paper award in four international conferences: ICICS′15, Singapore; APCC′14, Thailand; IEEE WCNC′10, Sydney, Australia and in the IEEE-ICNNSP′03, Nanjing, China. He has received nearly A$2.3m competitive research funding, including prestigious ARC (Australian Research Council) grant and large CRC (Collaborative Research Centre) grant. He was the founding Program co-Chair of the first International Symposium on Dependability in Sensor, Cloud, and Big Data Systems and Applications (DependSys), China in 2015. He has served 32 conferences in leadership capacities including Program co-Chair, Publicity Chair, Track Chair and Session Chairs, and since 2012 as an Editor of the Elsevier Journal of Network and Computer Applications, and had served as the lead Guest of Elsevier Journal Future Generation Computer Systems.
Rerouting in advance for preempted IR calls in QoS-enabled networks
- Authors: Ahmad, Iftekhar , Kamruzzaman, Joarder , Habibi, Daryoush
- Date: 2008
- Type: Text , Journal article
- Relation: Computer Communications Vol. 31, no. 17 (2008), p. 3922-3928
- Full Text: false
- Reviewed:
- Description: When network resources are shared between Instantaneous Request (IR) and Book-Ahead (BA) connections, activation of future BA connections may cause preemption of on-going IR connections due to resource scarcity. Rerouting of preempted calls via alternative feasible paths is often considered as the final option to restore and maintain service continuity. Existing rerouting techniques, however, do not ensure acceptably low service disruption time and suffer from high failure rate and low network utilization. In this work, a new rerouting strategy is proposed that estimates the future resource scarcity, identifies the probable candidate connections for preemption and initiates the rerouting process in advance for those connections. Simulations on a widely used network topology suggest that the proposed rerouting scheme achieves a higher successful rerouting rate with lower service disruption time, while not compromising other network performance metrics like utilization and call blocking rate.
A framework for collaborative multi class heterogeneous wireless sensor networks
- Authors: Azad, Arman , Kamruzzaman, Joarder
- Date: 2008
- Type: Text , Conference paper
- Relation: Proceedings of the 2008 IEEE International Conference on Communications p. 1-6
- Full Text: false
- Reviewed:
- Description: For many applications, simultaneous sensing of a number of parameters is crucial that leads to the deployment of multiple classes of sensors having different initial energy, data generation rate and deployment density within the vicinity of a cluster as opposed to identical sensors assumed in the existing heterogeneous sensor networks. For data transmission to cluster head, such networks use single hop, multi hop and their hybrid as intra-cluster transmission policy which suffer highly from non-uniform energy usage among sensors, thereby reducing the lifetime drastically leaving considerable amount of energy in many nodes. In this paper, we propose a framework for multi-class heterogeneous sensor networks where incoming traffic is relayed towards cluster head in collaboration among multiple classes of sensors considering their heterogeneity. We also propose two transmission policies for this framework considering generic polygonal cluster and limited transmission range for individual sensors. Performance analysis shows substantial improvement of overall lifetime by the collaborative framework of multi-class sensors. Our proposed transmission policies further improve the lifetime over existing multi hop and hybrid communications through better distribution of energy usage among sensors.kam
Energy-balanced transmission policies for wireless sensor networks
- Authors: Azad, Arman , Kamruzzaman, Joarder
- Date: 2011
- Type: Text , Journal article
- Relation: IEEE Transactions on Mobile Computing Vol. 10, no. 7 (2011), p. 927-940
- Full Text:
- Reviewed:
- Description: Transmission policy, in addition to topology control, routing, and MAC protocols, can play a vital role in extending network lifetime. Existing transmission policies, however, cause an extremely unbalanced energy usage that contributes to early demise of some sensors reducing overall network's lifetime drastically. Considering cocentric rings around the sink, we decompose the transmission distance of traditional multihop scheme into two parts: ring thickness and hop size, analyze the traffic and energy usage distribution among sensors and determine how energy usage varies and critical ring shifts with hop size. Based on above observations, we propose a transmission scheme and determine the optimal ring thickness and hop size by formulating network lifetime as an optimization problem. Numerical results show substantial improvements in terms of network lifetime and energy usage distribution over existing policies. Two other variations of this policy are also presented by redefining the optimization problem considering: 1) concomitant hop size variation by sensors over lifetime along with optimal duty cycles, and 2) a distinct set of hop sizes for sensors in each ring. Both variations bring increasingly uniform energy usage with lower critical energy and further improves lifetime. A heuristic for distributed implementation of each policy is also presented.
Energy efficient and hop constraint intra-cluster transmission for heterogeneous sensor networks
- Authors: Azad, Arman , Kamruzzaman, Joarder
- Date: 2008
- Type: Text , Conference proceedings
- Full Text: false
- Description: Although transmission policy is crucial in extending lifetime of sensor networks, most existing policies make simplified assumptions which include: i) circular cluster with cluster head (CH) at the center, ii) uniform periodic data generation model and iii) unrestricted transmission range for nodes. But, in practice, these assumptions are too restrictive for real-world deployment of heterogeneous sensor networks where clusters are usually polygonal. Moreover, in multi hop transmission energy consumption by sensors varies greatly with their distance from CH and even among sensors in the critical ring due to non-uniform relay traffic caused by asymmetric polygonal structure of cluster. In this paper, we propose a new transmission policy where sensors transmit at optimally determined hop sizes that varies over lifetime and a distributed hop selection algorithm that regulates each packet's arrival to CH within a given hop limit. Our formulation considers generic polygonal cluster, stochastic data generation model where data generation rate by sensors vary with events and limited transmission range for sensors. Performance analysis shows significant improvement in lifetime and better uniformity in energy usage among sensors in the proposed policy irrespective of cluster size, hop limit and maximum allowable transmission range of nodes
Asynchronous variable hop size transmission with stochastic data model for sensor networks
- Authors: Azad, Arman , Kamruzzaman, Joarder
- Date: 2008
- Type: Text , Conference proceedings
- Full Text: false
- Description: Most existing data models and transmission policies for sensor network assume uniform periodic data generation and unconstrained transmission range for sensor nodes, both assumptions being too restrictive to capture and analyze real- world operation for practical deployment. In this paper, we consider these two practical aspects and present a new transmission policy formulated after (i) stochastic data model where a set of events occur with certain probabilities and rate of data generation by a sensor varies based on sensed event and (ii) limited transmission range of sensors. Assuming co-centric rings around the base station, located at a generic location (internal or external to the network area), ring thickness and hope sizes over lifetime is determined by formatting an optimization problem where nodes in each ring may transmit data at different hop sizes at a given instant and also vary hop sizes over lifetime. Performance analysis shows significant improvement in network lifetime and better uniformity in energy usage distribution in the proposed policy irrespective of network size and maximum allowable transmission range of nodes.
VoIP call capacity over wireless mesh networks
- Authors: Siddique, Md , Kamruzzaman, Joarder
- Date: 2008
- Type: Text , Conference paper
- Relation: 2008 IEEE Global Telecommunications Conference p. 1-6
- Full Text: false
- Reviewed:
- Description: In recent years, research on VoIP over wireless mesh network (WMN) has gained particular attention because of its commercial prospect. This paper presents an analytical method to estimate VoIP call capacity in an WMN employing IEEE 802.11 devices. We used Markov chain analysis of IEEE 802.11 for network delay and loss to estimate the capacity while using rating factor, R score, defined by ITU-T, to ensure call quality. A detailed analysis of queueing delay and loss in terms of network parameters is also carried out along with their impacts on voice quality. The capacity model estimates call capacity in a single hop WLAN and is extendable to multi hop scenario and for video communications. The theoretical results are verified by simulation and compared to related previous works.
MPDF: Movement predicted data forwarding protocol for Underwater Acoustic Sensor Networks
- Authors: Nowsheen, Nusrat , Karmakar, Gour , Kamruzzaman, Joarder
- Type: Text , Conference paper
- Relation: 20th Asia-Pacific Conference on Communication, APCC 2014 p. 100-105
- Full Text: false
- Reviewed:
- Description: Due to the unique characteristics of acoustic communication channel, reliable data transfer in underwater is difficult in applications such as pollution monitoring, oceano-graphic data collection, surveillance, etc. To handle this issue, an Opportunistic Message Forwarding Protocol (OMFP) [1], which selects next hop forwarders based on link reliability and data transfer reachability, was proposed for Underwater Acoustic Sensor Networks (UASNs). The protocol shows improved performance over some existing popular and reputed underwater data forwarding approaches. However, OMFP has not considered node movement which is a natural phenomenon underwater. Besides high error probability and dynamicity of underwater acoustic channel, node movement also makes data forwarding process difficult. In addition to the link reliability and reachability, incorporation of neighbors' coverage probability in terms of their movement pattern in the next hop selection will further increase the reliability of forwarder selection process and decrease the chances of packet loss. To address this issue, this paper presents a new approach, namely, Movement Predicted Data Forwarding (MPDF) protocol. In MPDF, every node predicts its future movement pattern due to various contributory factors and estimates node's location, coverage probability without using any 'active' localization technique. The simulation results show that the proposed technique improves data delivery ratio, routing overhead with comparable energy consumption.
Exclusive use spectrum access trading models in cognitive radio networks : A survey
- Authors: Hassan, Md Rakib , Karmakar, Gour , Kamruzzaman, Joarder , Srinivasan, Bala
- Date: 2017
- Type: Text , Journal article , Review
- Relation: IEEE Communications Surveys and Tutorials Vol. 19, no. 4 (2017), p. 2192-2231
- Full Text: false
- Reviewed:
- Description: Spectrum frequency is a valuable resource for wireless communication but very limited in its availability. Due to the extensive use and ever increasing demand of spectrum bands by wireless devices and newer applications, unlicensed band is becoming congested, while licensed bands are found mostly underutilized. To solve this problem of spectrum scarcity, cognitive radio (CR) devices can share licensed bands opportunistically in several ways. We analyze the three main dynamic sharing models (commons, shared-use, and exclusive-use) proposed in literature with extensive analysis of the exclusive-use model, which is the most promising as it provides benefits to both licensed and unlicensed users. In this model, CR-enabled service providers, also known as secondary service providers, can buy or lease spectrum from licensed, known as primary service providers, for both short and long duration and gain exclusive rights to access the spectrum. In this survey paper, exclusive-use trading approaches, namely, game theory, market equilibrium, and classical, hybrid and other models are reviewed extensively and their characteristics and differences are highlighted and compared. We also propose possible future research directions on exclusive-use CR model. © 1998-2012 IEEE.
Reputation and user requirement based price modeling for dynamic spectrum access
- Authors: Hassan, Md Rakib , Karmakar, Gour , Kamruzzaman, Joarder
- Date: 2014
- Type: Text , Journal article
- Relation: IEEE Transactions on Mobile Computing Vol. 13, no. 9 (2014), p. 2128-2140
- Full Text: false
- Reviewed:
- Description: Secondary service providers can buy spectrum resources from primary service providers for a short or long period of time and exploit it to solve the problem of spectrum scarcity. This buying decision of spectrum buyers can depend on several factors including pricing of the spectrum, reputation of a seller, and duration of the contract and spectrum quality. However, existing pricing models for dynamic spectrum access consider mainly bandwidth which makes them unsuitable for real-world trading. In this paper, we consider these issues related to the pricing of spectrum sale in terms of microeconomic theories. First, we consider reputation of spectrum sellers and update it dynamically by considering a buyer's own trading experience with the sellers and collecting recommendations on sellers from other buyers. Second, trustworthiness of recommenders as well as incentive to encourage recommendations are modeled. Third, contract duration and spectrum quality are incorporated such that a buyer's utility is formulated as a function of buyer's resource requirement, reputation of seller and trustworthiness of recommenders. Fourth, the model is analyzed using dynamic pricing of the market and the solution is obtained using market equilibrium. Results demonstrate the superiority of our model over the existing microeconomic models for dynamic spectrum trading.
IoT Sensor Numerical Data Trust Model Using Temporal Correlation
- Authors: Karmakar, Gour , Das, Rajkumar , Kamruzzaman, Joarder
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Internet of Things Journal Vol. 7, no. 4 (2020), p. 2573-2581
- Full Text: false
- Reviewed:
- Description: Internet of Things (IoT) applications are increasingly being adopted for innovative and cost-effective services. However, the IoT devices and data are susceptible to various attacks, including cyberattacks, which emphasizes the need for pervasive security measure like trust evaluation on the fly. There exist several IoT numerical data trustworthiness measures which are based on the quality of information (QoI) and correlations. The QoI measurement techniques excessively exploit heuristics, while the correlation-based approaches predict temporal correlation using an average or moving average, which limits their efficacy. To improve accuracy and reliability, we propose a model for assessing trust of IoT sensor numerical data by representing the temporal correlation using temporal relationship. We represent the temporal relationship between data within a time window in two ways: first, using the discrete cosine transform (DCT) coefficients of daily data; and second, to obtain the impact of shuttle variation, we further divide the daily data into some time windows and calculate the average of each DCT coefficient over all time windows. These two feature sets are then used to develop two independent deep neural network models. The model outcomes are fused by the Dempster-Shepard theory to calculate trust scores. The strength of our model is evaluated using both trustworthy and untrustworthy data - the former are collected from sensors under controlled supervision in a smart city project in Melbourne, Australia and the latter are generated either by simulating breached sensors or perturbing real data. Our proposed approach outperforms a contemporary correlation-based approach in terms of trust score accuracy and consistency. © 2014 IEEE.
A dynamic content distribution scheme for decentralized sharing in tourist hotspots
- Authors: Kaisar, Shahriar , Kamruzzaman, Joarder , Karmakar, Gour
- Date: 2019
- Type: Text , Journal article
- Relation: Journal of Network and Computer Applications Vol. 129, no. (2019), p. 9-24
- Full Text:
- Reviewed:
- Description: Decentralized content sharing (DCS) is emerging as a suitable platform for smart mobile device users to generate and share contents seamlessly without the requirement of a centralized server. This feature is particularly important for places that lack Internet coverage such as tourist attractions where users can form an ad-hoc network and communicate opportunistically to share contents. Existing DCS approaches when applied for such type of places suffer from low delivery success rate and high latency. Although a handful of recent approaches have specifically targeted improvement of content delivery service in tourist spot like scenario, these and other DCS approaches do not focus on contents’ demand and supply which vary considerably due to visitor in-and-out flow and occurrence of influencing events. This is further compounded by the lack of any content distribution (replication) scheme. The content delivery service will be improved if contents can be proactively distributed in strategic positions based on dynamic demand and supply and medium access contention. In this paper, we propose a dynamic content distribution scheme (DCDS) considering these practical issues for sharing contents in tourist attractions. Simulation results show that the proposed approach significantly improves (7