Energy-balanced transmission policies for wireless sensor networks
- Azad, Arman, Kamruzzaman, Joarder
- 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.
- 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.
A cross-layer approach for QoS topology control in wireless ad hoc networks
- Rokonuzzaman, S. K., Pose, Ronald, Gondal, Iqbal
- Authors: Rokonuzzaman, S. K. , Pose, Ronald , Gondal, Iqbal
- Date: 2009
- Type: Text , Conference paper
- Relation: TENCON 2009 - 2009 IEEE Region 10 Conference
- Full Text:
- Reviewed:
- Description: Wireless ad hoc networks using omni-directional antennas do not scale well due to interference between nearby nodes. Maintaining the QoS of the communications in this type of network is a difficult task. Using multiple narrow beam directional antennas alleviates this problem at the expense of connectivity. Multi-beam smart antennas allow the network topology to be adjusted dynamically by adjusting the beamwidth and beam directions to minimize interference and to maximize the number of possible concurrent network communications. This in turn helps to maintain the QoS of the communications. QoS routing has long been used to meet the user requirements by finding appropriate paths to the destinations. We extend this concept to create an adaptive QoS topology control (AQTC) system using smart antennas. We use a cross-layer approach to control the topology dynamically where the topology control layer sits between the MAC and the routing protocol. The performance of our protocol has been evaluated using extensive simulations. Simulation results show that different topologies for a set of communications perform differently. AQTC always forms a topology to facilitate the current communications and improves the network throughput and end-to-end delay.
- Authors: Rokonuzzaman, S. K. , Pose, Ronald , Gondal, Iqbal
- Date: 2009
- Type: Text , Conference paper
- Relation: TENCON 2009 - 2009 IEEE Region 10 Conference
- Full Text:
- Reviewed:
- Description: Wireless ad hoc networks using omni-directional antennas do not scale well due to interference between nearby nodes. Maintaining the QoS of the communications in this type of network is a difficult task. Using multiple narrow beam directional antennas alleviates this problem at the expense of connectivity. Multi-beam smart antennas allow the network topology to be adjusted dynamically by adjusting the beamwidth and beam directions to minimize interference and to maximize the number of possible concurrent network communications. This in turn helps to maintain the QoS of the communications. QoS routing has long been used to meet the user requirements by finding appropriate paths to the destinations. We extend this concept to create an adaptive QoS topology control (AQTC) system using smart antennas. We use a cross-layer approach to control the topology dynamically where the topology control layer sits between the MAC and the routing protocol. The performance of our protocol has been evaluated using extensive simulations. Simulation results show that different topologies for a set of communications perform differently. AQTC always forms a topology to facilitate the current communications and improves the network throughput and end-to-end delay.
The photometric stereo approach and the visualization of 3D face reconstruction
- Khan, Muhammad, Ullah, Zabeeh, Butt, Maria, Arshad, Zohaib, Yousaf, Sobia
- Authors: Khan, Muhammad , Ullah, Zabeeh , Butt, Maria , Arshad, Zohaib , Yousaf, Sobia
- Date: 2019
- Type: Text , Journal article
- Relation: International Journal of Advanced Computer Science and Applications Vol. 10, no. 2 (2019), p. 217-221
- Full Text:
- Reviewed:
- Description: The 3D Morphable models of the human face have prepared myriad of applications in computer vision, human computer interaction and security surveillances. However, due to the variation in size, complexity of training data set, the landmark mapping, the representation in real time and rendering or synthesis of images in three dimensional is limited. In this paper, we extend the approach of the photometric stereo and provide the human face reconstruction in three dimensional. The proposed method consists of two steps. First it automatically detects the face and segment the iris along with statistical features of pupil location in it. Secondly it provides the selection of minimum six features and where iris process to generate the 3D face. In compare with existing methods our approach provides the automation which produces more better and efficient results in contrast to the manual methods.
- Authors: Khan, Muhammad , Ullah, Zabeeh , Butt, Maria , Arshad, Zohaib , Yousaf, Sobia
- Date: 2019
- Type: Text , Journal article
- Relation: International Journal of Advanced Computer Science and Applications Vol. 10, no. 2 (2019), p. 217-221
- Full Text:
- Reviewed:
- Description: The 3D Morphable models of the human face have prepared myriad of applications in computer vision, human computer interaction and security surveillances. However, due to the variation in size, complexity of training data set, the landmark mapping, the representation in real time and rendering or synthesis of images in three dimensional is limited. In this paper, we extend the approach of the photometric stereo and provide the human face reconstruction in three dimensional. The proposed method consists of two steps. First it automatically detects the face and segment the iris along with statistical features of pupil location in it. Secondly it provides the selection of minimum six features and where iris process to generate the 3D face. In compare with existing methods our approach provides the automation which produces more better and efficient results in contrast to the manual methods.
Video coding using arbitrarily shaped block partitions in globally optimal perspective
- Paul, Manoranjan, Murshed, Manzur
- Authors: Paul, Manoranjan , Murshed, Manzur
- Date: 2011
- Type: Text , Journal article
- Relation: EURASIP Journal on Advances in Signal Processing Vol. 16, no. (2011), p.
- Full Text:
- Reviewed:
- Description: Algorithms using content-based patterns to segment moving regions at the macroblock (MB) level have exhibited good potential for improved coding efficiency when embedded into the H.264 standard as an extra mode. The content-based pattern generation (CPG) algorithm provides local optimal result as only one pattern can be optimally generated from a given set of moving regions. But, it failed to provide optimal results for multiple patterns from entire sets. Obviously, a global optimal solution for clustering the set and then generation of multiple patterns enhances the performance farther. But a global optimal solution is not achievable due to the non-polynomial nature of the clustering problem. In this paper, we propose a near-optimal content-based pattern generation (OCPG) algorithm which outperforms the existing approach. Coupling OCPG, generating a set of patterns after clustering the MBs into several disjoint sets, with a direct pattern selection algorithm by allowing all the MBs in multiple pattern modes outperforms the existing pattern-based coding when embedded into the H.264.
- Authors: Paul, Manoranjan , Murshed, Manzur
- Date: 2011
- Type: Text , Journal article
- Relation: EURASIP Journal on Advances in Signal Processing Vol. 16, no. (2011), p.
- Full Text:
- Reviewed:
- Description: Algorithms using content-based patterns to segment moving regions at the macroblock (MB) level have exhibited good potential for improved coding efficiency when embedded into the H.264 standard as an extra mode. The content-based pattern generation (CPG) algorithm provides local optimal result as only one pattern can be optimally generated from a given set of moving regions. But, it failed to provide optimal results for multiple patterns from entire sets. Obviously, a global optimal solution for clustering the set and then generation of multiple patterns enhances the performance farther. But a global optimal solution is not achievable due to the non-polynomial nature of the clustering problem. In this paper, we propose a near-optimal content-based pattern generation (OCPG) algorithm which outperforms the existing approach. Coupling OCPG, generating a set of patterns after clustering the MBs into several disjoint sets, with a direct pattern selection algorithm by allowing all the MBs in multiple pattern modes outperforms the existing pattern-based coding when embedded into the H.264.
Development, feasibility and usability of an online psychological intervention for men with prostate cancer : My road ahead
- Wootten, Addie, Abbott, Jo-Anne, Chisholm, Katherine, Austin, David, Klein, Britt, McCabe, Marita, Murphy, Declan, Costello, Anthony
- Authors: Wootten, Addie , Abbott, Jo-Anne , Chisholm, Katherine , Austin, David , Klein, Britt , McCabe, Marita , Murphy, Declan , Costello, Anthony
- Date: 2014
- Type: Text , Journal article
- Relation: Internet Interventions Vol. 1, no. 4 (2014), p. 188-195
- Full Text:
- Reviewed:
- Description: Men with prostate cancer are not routinely offered psychosocial support despite strong evidence that being diagnosed with prostate cancer poses significant quality of life concerns and places the patient at elevated risk of developing a range of mental health disorders. The objective of this study was to develop an online psychological intervention for men with prostate cancer and to pilot test the feasibility and acceptability of the intervention. Development of the intervention involved a multidisciplinary collaboration, adapting face-to-face and group intervention strategies for an online format. The full online intervention and moderated forum were pilot tested with 64 participants who were recruited from urology practices in Melbourne, Victoria, Australia. After consenting to participate and creating a personal account in the online programme, participants completed baseline demographic questionnaires. Participants were provided access to the programme for 6-12. weeks. After completing the programme participants completed an online survey to assess intervention and forum utilisation and satisfaction, as well as suggest intervention refinements following their use of the intervention. Patient satisfaction was calculated using mean responses to the satisfaction questionnaire. The intervention was received positively with 47.82% of participants highly satisfied with the programme, and 78.26% said they would recommend it to a friend. Participants' qualitative feedback indicated good acceptability of the online intervention. A number of technical and participant engagement issues were identified and changes recommended as a result of the feasibility testing. © 2014 .
- Authors: Wootten, Addie , Abbott, Jo-Anne , Chisholm, Katherine , Austin, David , Klein, Britt , McCabe, Marita , Murphy, Declan , Costello, Anthony
- Date: 2014
- Type: Text , Journal article
- Relation: Internet Interventions Vol. 1, no. 4 (2014), p. 188-195
- Full Text:
- Reviewed:
- Description: Men with prostate cancer are not routinely offered psychosocial support despite strong evidence that being diagnosed with prostate cancer poses significant quality of life concerns and places the patient at elevated risk of developing a range of mental health disorders. The objective of this study was to develop an online psychological intervention for men with prostate cancer and to pilot test the feasibility and acceptability of the intervention. Development of the intervention involved a multidisciplinary collaboration, adapting face-to-face and group intervention strategies for an online format. The full online intervention and moderated forum were pilot tested with 64 participants who were recruited from urology practices in Melbourne, Victoria, Australia. After consenting to participate and creating a personal account in the online programme, participants completed baseline demographic questionnaires. Participants were provided access to the programme for 6-12. weeks. After completing the programme participants completed an online survey to assess intervention and forum utilisation and satisfaction, as well as suggest intervention refinements following their use of the intervention. Patient satisfaction was calculated using mean responses to the satisfaction questionnaire. The intervention was received positively with 47.82% of participants highly satisfied with the programme, and 78.26% said they would recommend it to a friend. Participants' qualitative feedback indicated good acceptability of the online intervention. A number of technical and participant engagement issues were identified and changes recommended as a result of the feasibility testing. © 2014 .
PFARS : Enhancing throughput and lifetime of heterogeneous WSNs through power-aware fusion, aggregation, and routing scheme
- Khan, Rahim, Zakarya, Muhammad, Tan, Zhiyuan, Usman, Muhammad, Jan, Mian, Khan, Mukhtaj
- Authors: Khan, Rahim , Zakarya, Muhammad , Tan, Zhiyuan , Usman, Muhammad , Jan, Mian , Khan, Mukhtaj
- Date: 2019
- Type: Text , Journal article
- Relation: International Journal of Communication Systems Vol. 32, no. 18 (Dec 2019), p. 21
- Full Text:
- Reviewed:
- Description: Heterogeneous wireless sensor networks (WSNs) consist of resource-starving nodes that face a challenging task of handling various issues such as data redundancy, data fusion, congestion control, and energy efficiency. In these networks, data fusion algorithms process the raw data generated by a sensor node in an energy-efficient manner to reduce redundancy, improve accuracy, and enhance the network lifetime. In literature, these issues are addressed individually, and most of the proposed solutions are either application-specific or too complex that make their implementation unrealistic, specifically, in a resource-constrained environment. In this paper, we propose a novel node-level data fusion algorithm for heterogeneous WSNs to detect noisy data and replace them with highly refined data. To minimize the amount of transmitted data, a hybrid data aggregation algorithm is proposed that performs in-network processing while preserving the reliability of gathered data. This combination of data fusion and data aggregation algorithms effectively handle the aforementioned issues by ensuring an efficient utilization of the available resources. Apart from fusion and aggregation, a biased traffic distribution algorithm is introduced that considerably increases the overall lifetime of heterogeneous WSNs. The proposed algorithm performs the tedious task of traffic distribution according to the network's statistics, ie, the residual energy of neighboring nodes and their importance from a network's connectivity perspective. All our proposed algorithms were tested on a real-time dataset obtained through our deployed heterogeneous WSN in an orange orchard and also on publicly available benchmark datasets. Experimental results verify that our proposed algorithms outperform the existing approaches in terms of various performance metrics such as throughput, lifetime, data accuracy, computational time, and delay.
- Authors: Khan, Rahim , Zakarya, Muhammad , Tan, Zhiyuan , Usman, Muhammad , Jan, Mian , Khan, Mukhtaj
- Date: 2019
- Type: Text , Journal article
- Relation: International Journal of Communication Systems Vol. 32, no. 18 (Dec 2019), p. 21
- Full Text:
- Reviewed:
- Description: Heterogeneous wireless sensor networks (WSNs) consist of resource-starving nodes that face a challenging task of handling various issues such as data redundancy, data fusion, congestion control, and energy efficiency. In these networks, data fusion algorithms process the raw data generated by a sensor node in an energy-efficient manner to reduce redundancy, improve accuracy, and enhance the network lifetime. In literature, these issues are addressed individually, and most of the proposed solutions are either application-specific or too complex that make their implementation unrealistic, specifically, in a resource-constrained environment. In this paper, we propose a novel node-level data fusion algorithm for heterogeneous WSNs to detect noisy data and replace them with highly refined data. To minimize the amount of transmitted data, a hybrid data aggregation algorithm is proposed that performs in-network processing while preserving the reliability of gathered data. This combination of data fusion and data aggregation algorithms effectively handle the aforementioned issues by ensuring an efficient utilization of the available resources. Apart from fusion and aggregation, a biased traffic distribution algorithm is introduced that considerably increases the overall lifetime of heterogeneous WSNs. The proposed algorithm performs the tedious task of traffic distribution according to the network's statistics, ie, the residual energy of neighboring nodes and their importance from a network's connectivity perspective. All our proposed algorithms were tested on a real-time dataset obtained through our deployed heterogeneous WSN in an orange orchard and also on publicly available benchmark datasets. Experimental results verify that our proposed algorithms outperform the existing approaches in terms of various performance metrics such as throughput, lifetime, data accuracy, computational time, and delay.
SmartEdge : An end-to-end encryption framework for an edge-enabled smart city application
- Jan, Mian, Zhang, Wenjing, Usman, Muhammad, Tan, Zhiyuan, Khan, Fazlullah, Luo, Entao
- Authors: Jan, Mian , Zhang, Wenjing , Usman, Muhammad , Tan, Zhiyuan , Khan, Fazlullah , Luo, Entao
- Date: 2019
- Type: Text , Journal article
- Relation: Journal of Network and Computer Applications Vol. 137, no. (2019), p. 1-10
- Full Text:
- Reviewed:
- Description: The Internet of Things (IoT) has the potential to transform communities around the globe into smart cities. The massive deployment of sensor-embedded devices in the smart cities generates voluminous amounts of data that need to be stored and processed in an efficient manner. Long-haul data transmission to the remote cloud data centers leads to higher delay and bandwidth consumption. In smart cities, the delay-sensitive applications have stringent requirements in term of response time. To reduce latency and bandwidth consumption, edge computing plays a pivotal role. The resource-constrained smart devices at the network core need to offload computationally complex tasks to the edge devices located in their vicinity and have relatively higher resources. In this paper, we propose an end-to-end encryption framework, SmartEdge, for a smart city application by executing computationally complex tasks at the network edge and cloud data centers. Using a lightweight symmetric encryption technique, we establish a secure connection among the smart core devices for multimedia streaming towards the registered and verified edge devices. Upon receiving the data, the edge devices encrypts the multimedia streams, encodes them, and broadcast to the cloud data centers. Prior to the broadcasting, each edge device establishes a secured connection with a data center that relies on the combination of symmetric and asymmetric encryption techniques. In SmartEdge, the execution of a lightweight encryption technique at the resource-constrained smart devices, and relatively complex encryption techniques at the network edge and cloud data centers reduce the resource utilization of the entire network. The proposed framework reduces the response time, security overhead, computational and communication costs, and has a lower end-to-end encryption delay for participating entities. Moreover, the proposed scheme is highly resilient against various adversarial attacks.
- Authors: Jan, Mian , Zhang, Wenjing , Usman, Muhammad , Tan, Zhiyuan , Khan, Fazlullah , Luo, Entao
- Date: 2019
- Type: Text , Journal article
- Relation: Journal of Network and Computer Applications Vol. 137, no. (2019), p. 1-10
- Full Text:
- Reviewed:
- Description: The Internet of Things (IoT) has the potential to transform communities around the globe into smart cities. The massive deployment of sensor-embedded devices in the smart cities generates voluminous amounts of data that need to be stored and processed in an efficient manner. Long-haul data transmission to the remote cloud data centers leads to higher delay and bandwidth consumption. In smart cities, the delay-sensitive applications have stringent requirements in term of response time. To reduce latency and bandwidth consumption, edge computing plays a pivotal role. The resource-constrained smart devices at the network core need to offload computationally complex tasks to the edge devices located in their vicinity and have relatively higher resources. In this paper, we propose an end-to-end encryption framework, SmartEdge, for a smart city application by executing computationally complex tasks at the network edge and cloud data centers. Using a lightweight symmetric encryption technique, we establish a secure connection among the smart core devices for multimedia streaming towards the registered and verified edge devices. Upon receiving the data, the edge devices encrypts the multimedia streams, encodes them, and broadcast to the cloud data centers. Prior to the broadcasting, each edge device establishes a secured connection with a data center that relies on the combination of symmetric and asymmetric encryption techniques. In SmartEdge, the execution of a lightweight encryption technique at the resource-constrained smart devices, and relatively complex encryption techniques at the network edge and cloud data centers reduce the resource utilization of the entire network. The proposed framework reduces the response time, security overhead, computational and communication costs, and has a lower end-to-end encryption delay for participating entities. Moreover, the proposed scheme is highly resilient against various adversarial attacks.
Blockchain leveraged decentralized IoT eHealth framework
- Uddin, Ashraf, Stranieri, Andrew, Gondal, Iqbal, Balasubramanian, Venki
- Authors: Uddin, Ashraf , Stranieri, Andrew , Gondal, Iqbal , Balasubramanian, Venki
- Date: 2020
- Type: Text , Journal article
- Relation: Internet of Things Vol. 9, no. March 2020 p. 100159
- Full Text:
- Reviewed:
- Description: Blockchain technologies recently emerging for eHealth, can facilitate a secure, decentral- ized and patient-driven, record management system. However, Blockchain technologies cannot accommodate the storage of data generated from IoT devices in remote patient management (RPM) settings as this application requires a fast consensus mechanism, care- ful management of keys and enhanced protocols for privacy. In this paper, we propose a Blockchain leveraged decentralized eHealth architecture which comprises three layers: (1) The Sensing layer –Body Area Sensor Networks include medical sensors typically on or in a patient body transmitting data to a smartphone. (2) The NEAR processing layer –Edge Networks consist of devices at one hop from data sensing IoT devices. (3) The FAR pro- cessing layer –Core Networks comprise Cloud or other high computing servers). A Patient Agent (PA) software replicated on the three layers processes medical data to ensure reli- able, secure and private communication. The PA executes a lightweight Blockchain consen- sus mechanism and utilizes a Blockchain leveraged task-offloading algorithm to ensure pa- tient’s privacy while outsourcing tasks. Performance analysis of the decentralized eHealth architecture has been conducted to demonstrate the feasibility of the system in the pro- cessing and storage of RPM data.
- Authors: Uddin, Ashraf , Stranieri, Andrew , Gondal, Iqbal , Balasubramanian, Venki
- Date: 2020
- Type: Text , Journal article
- Relation: Internet of Things Vol. 9, no. March 2020 p. 100159
- Full Text:
- Reviewed:
- Description: Blockchain technologies recently emerging for eHealth, can facilitate a secure, decentral- ized and patient-driven, record management system. However, Blockchain technologies cannot accommodate the storage of data generated from IoT devices in remote patient management (RPM) settings as this application requires a fast consensus mechanism, care- ful management of keys and enhanced protocols for privacy. In this paper, we propose a Blockchain leveraged decentralized eHealth architecture which comprises three layers: (1) The Sensing layer –Body Area Sensor Networks include medical sensors typically on or in a patient body transmitting data to a smartphone. (2) The NEAR processing layer –Edge Networks consist of devices at one hop from data sensing IoT devices. (3) The FAR pro- cessing layer –Core Networks comprise Cloud or other high computing servers). A Patient Agent (PA) software replicated on the three layers processes medical data to ensure reli- able, secure and private communication. The PA executes a lightweight Blockchain consen- sus mechanism and utilizes a Blockchain leveraged task-offloading algorithm to ensure pa- tient’s privacy while outsourcing tasks. Performance analysis of the decentralized eHealth architecture has been conducted to demonstrate the feasibility of the system in the pro- cessing and storage of RPM data.
Contention resolution in wi-fi 6-enabled internet of things based on deep learning
- Chen, Chen, Li, Junchao, Balasubramanian, Venki, Wu, Yongqiang, Zhang, Yongqiang, Wan, Shaohua
- Authors: Chen, Chen , Li, Junchao , Balasubramanian, Venki , Wu, Yongqiang , Zhang, Yongqiang , Wan, Shaohua
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Internet of Things Journal Vol. 8, no. 7 (2021), p. 5309-5320
- Full Text:
- Reviewed:
- Description: Internet of Things (IoT) is expected to vastly increase the number of connected devices. As a result, a multitude of IoT devices transmit various information through wireless communication technology, such as the Wi-Fi technology, cellular mobile communication technology, low-power wide-area network (LPWAN) technology. However, even the latest Wi-Fi technology is still ready to accommodate these large amounts of data. Accurately setting the contention window (CW) value significantly affects the efficiency of the Wi-Fi network. Unfortunately, the standard collision resolution used by IEEE 802.11ax networks is nonscalable; thus, it cannot maintain stable throughput for an increasing number of stations, even when Wi-Fi 6 has been designed to improve performance in dense scenarios. To this end, we propose a CW control strategy for Wi-Fi 6 systems. This strategy leverages deep learning to search for optimal configuration of CW under different network conditions. Our deep neural network is trained by data generated from a Wi-Fi 6 simulation system with some varying key parameters, e.g., the number of nodes, short interframe space (SIFS), distributed interframe space (DIFS), and data transmission rate. Numerical results demonstrated that our deep learning scheme could always find the optimal CW adjustment multiple by adaptively perceiving the channel competition status. The finalized performance of our model has been significantly improved in terms of system throughput, average transmission delay, and packet retransmission rate. This makes Wi-Fi 6 better adapted to the access of a large number of IoT devices. © 2014 IEEE.
- Authors: Chen, Chen , Li, Junchao , Balasubramanian, Venki , Wu, Yongqiang , Zhang, Yongqiang , Wan, Shaohua
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Internet of Things Journal Vol. 8, no. 7 (2021), p. 5309-5320
- Full Text:
- Reviewed:
- Description: Internet of Things (IoT) is expected to vastly increase the number of connected devices. As a result, a multitude of IoT devices transmit various information through wireless communication technology, such as the Wi-Fi technology, cellular mobile communication technology, low-power wide-area network (LPWAN) technology. However, even the latest Wi-Fi technology is still ready to accommodate these large amounts of data. Accurately setting the contention window (CW) value significantly affects the efficiency of the Wi-Fi network. Unfortunately, the standard collision resolution used by IEEE 802.11ax networks is nonscalable; thus, it cannot maintain stable throughput for an increasing number of stations, even when Wi-Fi 6 has been designed to improve performance in dense scenarios. To this end, we propose a CW control strategy for Wi-Fi 6 systems. This strategy leverages deep learning to search for optimal configuration of CW under different network conditions. Our deep neural network is trained by data generated from a Wi-Fi 6 simulation system with some varying key parameters, e.g., the number of nodes, short interframe space (SIFS), distributed interframe space (DIFS), and data transmission rate. Numerical results demonstrated that our deep learning scheme could always find the optimal CW adjustment multiple by adaptively perceiving the channel competition status. The finalized performance of our model has been significantly improved in terms of system throughput, average transmission delay, and packet retransmission rate. This makes Wi-Fi 6 better adapted to the access of a large number of IoT devices. © 2014 IEEE.
Emergency warning messages dissemination in vehicular social networks: A trust based scheme
- Ullah, Noor, Kong, Xiangjie, Ning, Zhaolong, Tolba, Amr, Alrashoud, Mubarak, Xia, Feng
- Authors: Ullah, Noor , Kong, Xiangjie , Ning, Zhaolong , Tolba, Amr , Alrashoud, Mubarak , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: Vehicular Communications Vol. 22 (2020)
- Full Text:
- Reviewed:
- Description: To ensure users' safety on the road, a plethora of dissemination schemes for Emergency Warning Messages (EWMs) have been proposed in vehicular networks. However, the issue of false alarms triggered by malicious users still poses serious challenges, such as disruption of vehicular traffic especially on highways leading to precarious effects. This paper proposes a novel Trust based Dissemination Scheme (TDS) for EWMs in Vehicular Social Networks (VSNs) to solve the aforementioned issue. To ensure the authenticity of EWMs, we exploit the user-post credibility network for identifying true and false alarms. Moreover, we develop a reputation mechanism by calculating a trust-score for each node based on its social-utility, behavior, and contribution in the network. We utilize the hybrid architecture of VSNs by employing social-groups based dissemination in Vehicle-to-Infrastructure (V2I) mode, whereas nodes' friendship-network in Vehicle-to-Vehicle (V2V) mode. We analyze the proposed scheme for accuracy by extensive simulations under varying malicious nodes ratio in the network. Furthermore, we compare the efficiency of TDS with state-of-the-art dissemination schemes in VSNs for delivery ratio, transmission delay, number of transmissions, and hop-count. The experimental results validate the significant efficacy of TDS in accuracy and aforementioned network parameters. © 2019 Elsevier Inc.
- Authors: Ullah, Noor , Kong, Xiangjie , Ning, Zhaolong , Tolba, Amr , Alrashoud, Mubarak , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: Vehicular Communications Vol. 22 (2020)
- Full Text:
- Reviewed:
- Description: To ensure users' safety on the road, a plethora of dissemination schemes for Emergency Warning Messages (EWMs) have been proposed in vehicular networks. However, the issue of false alarms triggered by malicious users still poses serious challenges, such as disruption of vehicular traffic especially on highways leading to precarious effects. This paper proposes a novel Trust based Dissemination Scheme (TDS) for EWMs in Vehicular Social Networks (VSNs) to solve the aforementioned issue. To ensure the authenticity of EWMs, we exploit the user-post credibility network for identifying true and false alarms. Moreover, we develop a reputation mechanism by calculating a trust-score for each node based on its social-utility, behavior, and contribution in the network. We utilize the hybrid architecture of VSNs by employing social-groups based dissemination in Vehicle-to-Infrastructure (V2I) mode, whereas nodes' friendship-network in Vehicle-to-Vehicle (V2V) mode. We analyze the proposed scheme for accuracy by extensive simulations under varying malicious nodes ratio in the network. Furthermore, we compare the efficiency of TDS with state-of-the-art dissemination schemes in VSNs for delivery ratio, transmission delay, number of transmissions, and hop-count. The experimental results validate the significant efficacy of TDS in accuracy and aforementioned network parameters. © 2019 Elsevier Inc.
PAAL : a framework based on authentication, aggregation, and local differential privacy for internet of multimedia things
- Usman, Muhammad, Jan, Mian, Puthal, Deepak
- Authors: Usman, Muhammad , Jan, Mian , Puthal, Deepak
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Internet of Things Journal Vol. 7, no. 4 (2020), p. 2501-2508
- Full Text:
- Reviewed:
- Description: Internet of Multimedia Things (IoMT) applications generate huge volumes of multimedia data that are uploaded to cloud servers for storage and processing. During the uploading process, the IoMT applications face three major challenges, i.e., node management, privacy-preserving, and network protection. In this article, we propose a multilayer framework (PAAL) based on a multilevel edge computing architecture to manage end and edge devices, preserve the privacy of end-devices and data, and protect the underlying network from external attacks. The proposed framework has three layers. In the first layer, the underlying network is partitioned into multiple clusters to manage end-devices and level-one edge devices (LOEDs). In the second layer, the LOEDs apply an efficient aggregation technique to reduce the volumes of generated data and preserve the privacy of end-devices. The privacy of sensitive information in aggregated data is protected through a local differential privacy-based technique. In the last layer, the mobile sinks are registered with a level-two edge device via a handshaking mechanism to protect the underlying network from external threats. Experimental results show that the proposed framework performs better as compared to existing frameworks in terms of managing the nodes, preserving the privacy of end-devices and sensitive information, and protecting the underlying network. © 2014 IEEE.
- Authors: Usman, Muhammad , Jan, Mian , Puthal, Deepak
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Internet of Things Journal Vol. 7, no. 4 (2020), p. 2501-2508
- Full Text:
- Reviewed:
- Description: Internet of Multimedia Things (IoMT) applications generate huge volumes of multimedia data that are uploaded to cloud servers for storage and processing. During the uploading process, the IoMT applications face three major challenges, i.e., node management, privacy-preserving, and network protection. In this article, we propose a multilayer framework (PAAL) based on a multilevel edge computing architecture to manage end and edge devices, preserve the privacy of end-devices and data, and protect the underlying network from external attacks. The proposed framework has three layers. In the first layer, the underlying network is partitioned into multiple clusters to manage end-devices and level-one edge devices (LOEDs). In the second layer, the LOEDs apply an efficient aggregation technique to reduce the volumes of generated data and preserve the privacy of end-devices. The privacy of sensitive information in aggregated data is protected through a local differential privacy-based technique. In the last layer, the mobile sinks are registered with a level-two edge device via a handshaking mechanism to protect the underlying network from external threats. Experimental results show that the proposed framework performs better as compared to existing frameworks in terms of managing the nodes, preserving the privacy of end-devices and sensitive information, and protecting the underlying network. © 2014 IEEE.
A dynamic content distribution scheme for decentralized sharing in tourist hotspots
- Kaisar, Shahriar, Kamruzzaman, Joarder, Karmakar, Gour
- 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
- 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
- «
- ‹
- 1
- ›
- »