The Experts below are selected from a list of 9852 Experts worldwide ranked by ideXlab platform
Khaled Elleithy - One of the best experts on this subject based on the ideXlab platform.
-
an optimized Hidden Node detection paradigm for improving the coverage and network efficiency in wireless multimedia sensor networks
Sensors, 2016Co-Authors: Adwan Alanazi, Khaled ElleithyAbstract:Successful transmission of online multimedia streams in wireless multimedia sensor networks (WMSNs) is a big challenge due to their limited bandwidth and power resources. The existing WSN protocols are not completely appropriate for multimedia communication. The effectiveness of WMSNs varies, and it depends on the correct location of its sensor Nodes in the field. Thus, maximizing the multimedia coverage is the most important issue in the delivery of multimedia contents. The Nodes in WMSNs are either static or mobile. Thus, the Node connections change continuously due to the mobility in wireless multimedia communication that causes an additional energy consumption, and synchronization loss between neighboring Nodes. In this paper, we introduce an Optimized Hidden Node Detection (OHND) paradigm. The OHND consists of three phases: Hidden Node detection, message exchange, and location detection. These three phases aim to maximize the multimedia Node coverage, and improve energy efficiency, Hidden Node detection capacity, and packet delivery ratio. OHND helps multimedia sensor Nodes to compute the directional coverage. Furthermore, an OHND is used to maintain a continuous Node– continuous neighbor discovery process in order to handle the mobility of the Nodes. We implement our proposed algorithms by using a network simulator (NS2). The simulation results demonstrate that Nodes are capable of maintaining direct coverage and detecting Hidden Nodes in order to maximize coverage and multimedia Node mobility. To evaluate the performance of our proposed algorithms, we compared our results with other known approaches.
-
energy efficient Hidden Node detection for improving quality of service in wireless multimedia sensor networks
Long Island Systems Applications and Technology Conference, 2016Co-Authors: Adwan Alanazi, Khaled ElleithyAbstract:In many wireless multimedia sensor networks (WMSNs) the Nodes are static. However, Node connection is subjected to change due to disruptions in wireless communication, power changes in transmission, or loss of synchronization between neighboring Nodes. A sensor should constantly be aware of its immediate neighbors, through a process called continuous neighbor discovery. In this paper we introduce an energy efficient Hidden Node detection (EEHND) algorithm for continuous neighbor discovery process in the wireless multimedia sensor networks (WMSNs). We focus on the continuous neighbor discovery process and regard it as a combined task of all the Nodes in every connected segment. Each sensor is entered as a coordinate in an effort in order to reduce the time to detect Hidden sensors. Based on the simulation results, we demonstrated that the protocol detected the Hidden Nodes in the network.
Adwan Alanazi - One of the best experts on this subject based on the ideXlab platform.
-
an optimized Hidden Node detection paradigm for improving the coverage and network efficiency in wireless multimedia sensor networks
Sensors, 2016Co-Authors: Adwan Alanazi, Khaled ElleithyAbstract:Successful transmission of online multimedia streams in wireless multimedia sensor networks (WMSNs) is a big challenge due to their limited bandwidth and power resources. The existing WSN protocols are not completely appropriate for multimedia communication. The effectiveness of WMSNs varies, and it depends on the correct location of its sensor Nodes in the field. Thus, maximizing the multimedia coverage is the most important issue in the delivery of multimedia contents. The Nodes in WMSNs are either static or mobile. Thus, the Node connections change continuously due to the mobility in wireless multimedia communication that causes an additional energy consumption, and synchronization loss between neighboring Nodes. In this paper, we introduce an Optimized Hidden Node Detection (OHND) paradigm. The OHND consists of three phases: Hidden Node detection, message exchange, and location detection. These three phases aim to maximize the multimedia Node coverage, and improve energy efficiency, Hidden Node detection capacity, and packet delivery ratio. OHND helps multimedia sensor Nodes to compute the directional coverage. Furthermore, an OHND is used to maintain a continuous Node– continuous neighbor discovery process in order to handle the mobility of the Nodes. We implement our proposed algorithms by using a network simulator (NS2). The simulation results demonstrate that Nodes are capable of maintaining direct coverage and detecting Hidden Nodes in order to maximize coverage and multimedia Node mobility. To evaluate the performance of our proposed algorithms, we compared our results with other known approaches.
-
energy efficient Hidden Node detection for improving quality of service in wireless multimedia sensor networks
Long Island Systems Applications and Technology Conference, 2016Co-Authors: Adwan Alanazi, Khaled ElleithyAbstract:In many wireless multimedia sensor networks (WMSNs) the Nodes are static. However, Node connection is subjected to change due to disruptions in wireless communication, power changes in transmission, or loss of synchronization between neighboring Nodes. A sensor should constantly be aware of its immediate neighbors, through a process called continuous neighbor discovery. In this paper we introduce an energy efficient Hidden Node detection (EEHND) algorithm for continuous neighbor discovery process in the wireless multimedia sensor networks (WMSNs). We focus on the continuous neighbor discovery process and regard it as a combined task of all the Nodes in every connected segment. Each sensor is entered as a coordinate in an effort in order to reduce the time to detect Hidden sensors. Based on the simulation results, we demonstrated that the protocol detected the Hidden Nodes in the network.
Eduardo Tovar - One of the best experts on this subject based on the ideXlab platform.
-
improving quality of service in wireless sensor networks by mitigating Hidden Node collisions
IEEE Transactions on Industrial Informatics, 2009Co-Authors: Anis Koubâa, Ricardo Severino, Mário Alves, Eduardo TovarAbstract:Wireless sensor networks (WSNs) emerge as underlying infrastructures for new classes of large-scale networked embedded systems. However, WSNs system designers must fulfill the quality-of-service (QoS) requirements imposed by the applications (and users). Very harsh and dynamic physical environments and extremely limited energy/computing/memory/communication Node resources are major obstacles for satisfying QoS metrics such as reliability, timeliness, and system lifetime. The limited communication range of WSN Nodes, link asymmetry, and the characteristics of the physical environment lead to a major source of QoS degradation in WSNs-the ldquoHidden Node problem.rdquo In wireless contention-based medium access control (MAC) protocols, when two Nodes that are not visible to each other transmit to a third Node that is visible to the former, there will be a collision-called Hidden-Node or blind collision. This problem greatly impacts network throughput, energy-efficiency and message transfer delays, and the problem dramatically increases with the number of Nodes. This paper proposes H-NAMe, a very simple yet extremely efficient Hidden-Node avoidance mechanism for WSNs. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-Hidden Nodes that scales to multiple clusters via a cluster grouping strategy that guarantees no interference between overlapping clusters. Importantly, H-NAMe is instantiated in IEEE 802.15.4/ZigBee, which currently are the most widespread communication technologies for WSNs, with only minor add-ons and ensuring backward compatibility with their protocols standards. H-NAMe was implemented and exhaustively tested using an experimental test-bed based on ldquooff-the-shelfrdquo technology, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. H-NAMe effectiveness was also demonstrated in a target tracking application with mobile robots over a WSN deployment.
-
H-NAMe: a Hidden-Node avoidance mechanism for wireless sensor networks
IFAC Proceedings Volumes, 2009Co-Authors: Anis Koubâa, Ricardo Severino, Mário Alves, Eduardo TovarAbstract:Abstract The Hidden-Node problem has been shown to be a major source of Quality-of-Service (QoS) degradation in Wireless Sensor Networks (WSNs) due to factors such as the limited communication range of sensor Nodes, link asymmetry and the characteristics of the physical environment. In wireless contention-based Medium Access Control protocols, if two Nodes that are not visible to each other transmit to a third Node that is visible to the formers, there will be a collision – usually called Hidden-Node or blind collision. This problem greatly affects network throughput, energy-efficiency and message transfer delays, which might be particularly dramatic in large-scale WSNs. This paper tackles the Hidden-Node problem in WSNs and proposes H-NAMe, a simple yet efficient distributed mechanism to overcome it. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-Hidden Nodes and then scales to multiple clusters via a cluster grouping strategy that guarantees no transmission interference between overlapping clusters. We also show that the H-NAMe mechanism can be easily applied to the IEEE 802.15.4/ZigBee protocols with only minor add-ons and ensuring backward compatibility with the standard specifications. We demonstrate the feasibility of H-NAMe via an experimental test-bed, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. We believe that the results in this paper will be quite useful in efficiently enabling IEEE 802.15.4/ZigBee as a WSN protocol.
-
h name specifying implementing and testing a Hidden Node avoidance mechanism for wireless sensor networks
2008Co-Authors: Anis Koubâa, Ricardo Severino, Mário Alves, Eduardo TovarAbstract:The Hidden-Node problem has been shown to be a major source of Quality-of-Service (QoS) degradation in Wireless Sensor Networks (WSNs) due to factors such as the limited communication range of sensor Nodes, link asymmetry and the characteristics of the physical environment. In wireless contention-based Medium Access Control protocols, if two Nodes that are not visible to each other transmit to a third Node that is visible to the formers, there will be a collision – usually called Hidden-Node or blind collision. This problem greatly affects network throughput, energy-efficiency and message transfer delays, which might be particularly dramatic in largescale WSNs. This technical report tackles the Hidden-Node problem in WSNs and proposes H-NAMe, a simple yet efficient distributed mechanism to overcome it. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-Hidden Nodes and then scales to multiple clusters via a cluster grouping strategy that guarantees no transmission interference between overlapping clusters. We also show that the HNAMe mechanism can be easily applied to the IEEE 802.15.4/ZigBee protocols with only minor add-ons and ensuring backward compatibility with the standard specifications. We demonstrate the feasibility of H-NAMe via an experimental test-bed, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. We believe that the results in this technical report will be quite useful in efficiently enabling IEEE 802.15.4/ZigBee as a WSN protocol. H-NAMe: Specifying, Implementing and Testing a Hidden-Node Avoidance Mechanism for Wireless Sensor Networks Anis Koubâa, Ricardo Severino, Mario Alves, Eduardo Tovar 1 IPP-HURRAY! Research Group, Polytechnic Institute of Porto, School of Engineering (ISEP-IPP) Rua Antonio Bernardino de Almeida, 431, 4200-072 Porto, Portugal 2 Al-Imam Muhammad Ibn Saud University, Computer Science Dept., 11681 Riyadh, Saudi Arabia {aska, rars, mjf, emt}@isep.ipp.pt
Chikara Ohta - One of the best experts on this subject based on the ideXlab platform.
-
asymmetric Hidden Node problem aware routing metric for wireless mesh networks
Consumer Communications and Networking Conference, 2019Co-Authors: Keisuke Maesako, Yumi Takaki, Tomio Kamada, Chikara OhtaAbstract:In recent years, wireless mesh networks (WMNs) have become popular because of their wide coverage areas and high fault tolerance. Although unlicensed-band off-the-shelf wireless devices based on IEEE 802.11 are widely deployed, WMNs based on IEEE 802.11 suffer from degradation of throughput owing to the Hidden Node problem. To mitigate this problem, in this study, we developed a new routing metric called the “Asymmetric Hidden Node problem Aware routing Metric (AHAM).” AHAM enables a new flow to establish a source-destination path that largely avoids not only interference with Hidden Nodes of existing flows but also making Hidden Nodes on that path interfere with existing flows. This is because the Hidden Node problem can asymmetrically impact throughput between flows when new flows are established. As a response, AHAM aims to estimate the influence of Hidden Nodes accurately and compensate for how both the new and existing flows influence each other. Simulation results showed that AHAM realizes high throughput while maintaining network fairness compared with other metrics.
-
CCNC - Asymmetric Hidden Node Problem Aware Routing Metric for Wireless Mesh Networks
2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC), 2019Co-Authors: Keisuke Maesako, Yumi Takaki, Tomio Kamada, Chikara OhtaAbstract:In recent years, wireless mesh networks (WMNs) have become popular because of their wide coverage areas and high fault tolerance. Although unlicensed-band off-the-shelf wireless devices based on IEEE 802.11 are widely deployed, WMNs based on IEEE 802.11 suffer from degradation of throughput owing to the Hidden Node problem. To mitigate this problem, in this study, we developed a new routing metric called the “Asymmetric Hidden Node problem Aware routing Metric (AHAM).” AHAM enables a new flow to establish a source-destination path that largely avoids not only interference with Hidden Nodes of existing flows but also making Hidden Nodes on that path interfere with existing flows. This is because the Hidden Node problem can asymmetrically impact throughput between flows when new flows are established. As a response, AHAM aims to estimate the influence of Hidden Nodes accurately and compensate for how both the new and existing flows influence each other. Simulation results showed that AHAM realizes high throughput while maintaining network fairness compared with other metrics.
Liang Qian - One of the best experts on this subject based on the ideXlab platform.
-
signal strength assistant grouping for lower Hidden Node collision probability in 802 11ah
International Conference on Wireless Communications and Signal Processing, 2017Co-Authors: Laipeng Zhang, Zhe Guo, Lianghui Ding, Feng Yang, Liang QianAbstract:Recently, 802.11ah with restricted access window for collision attenuation has been proposed for Internet of Things (IoT) applications. Random grouping of Nodes in different access window is utilized to reduce the Hidden Node collision probability. However, when the coverage area of the sink Node is large, the occurrence probability of Hidden Node problem is still high and severely impacts the system energy efficiency. Hence, in this paper, we propose a Signal Strength Assistant (SSA) grouping scheme to further alleviate this problem. In the proposed SSA grouping, several Reference Nodes (RN) with known locations are installed in the application scenario evenly. RNs sequentially transmit beacon signals, while the normal Nodes monitor the signal strength from different RNs and join the group identified by the RN with the strongest average signal strength. We formulate the analytical model of the Hidden Node collision probability in SSA and analyze the optimal number of RN Nodes to satisfy specific Hidden Node collision probability requirement. Furthermore, the performance of SSA is evaluated through extensive simulation. It is shown that mathematical and simulation results of SSA match well and the proposed SSA grouping can significantly reduce the Hidden Node collision probability in 802.11ah.
-
WCSP - Signal strength assistant grouping for lower Hidden Node collision probability in 802.11ah
2017 9th International Conference on Wireless Communications and Signal Processing (WCSP), 2017Co-Authors: Laipeng Zhang, Zhe Guo, Lianghui Ding, Feng Yang, Liang QianAbstract:Recently, 802.11ah with restricted access window for collision attenuation has been proposed for Internet of Things (IoT) applications. Random grouping of Nodes in different access window is utilized to reduce the Hidden Node collision probability. However, when the coverage area of the sink Node is large, the occurrence probability of Hidden Node problem is still high and severely impacts the system energy efficiency. Hence, in this paper, we propose a Signal Strength Assistant (SSA) grouping scheme to further alleviate this problem. In the proposed SSA grouping, several Reference Nodes (RN) with known locations are installed in the application scenario evenly. RNs sequentially transmit beacon signals, while the normal Nodes monitor the signal strength from different RNs and join the group identified by the RN with the strongest average signal strength. We formulate the analytical model of the Hidden Node collision probability in SSA and analyze the optimal number of RN Nodes to satisfy specific Hidden Node collision probability requirement. Furthermore, the performance of SSA is evaluated through extensive simulation. It is shown that mathematical and simulation results of SSA match well and the proposed SSA grouping can significantly reduce the Hidden Node collision probability in 802.11ah.