1.
Ahmet Kurt, Nico Saputro, Kemal Akkaya, A Selcuk Uluagac
Distributed connectivity maintenance in swarm of drones during post-disaster transportation applications Proceedings Article
In: pp. 6061–6073, IEEE, 2021.
Abstract | Links | BibTeX | Tags: Wireless Networking
@inproceedings{nokey,
title = {Distributed connectivity maintenance in swarm of drones during post-disaster transportation applications},
author = {Ahmet Kurt and Nico Saputro and Kemal Akkaya and A Selcuk Uluagac},
url = {https://ieeexplore.ieee.org/abstract/document/9385994/},
year = {2021},
date = {2021-03-24},
journal = {IEEE Transactions on Intelligent Transportation Systems},
volume = {22},
number = {9},
issue = {9},
pages = {6061–6073},
publisher = {IEEE},
school = {Florida International University},
abstract = {Considering post-disaster scenarios for intelligent traffic management and damage assessment where communication infrastructure may not be available, we advocate a swarm-of-drones mesh communication architecture that can sustain in-network connectivity among drones. The connectivity sustenance requirement stems from the fact that drones may move to various locations in response to service requests but they still need to cooperate for data collection and transmissions. To address this need, we propose a fully distributed connectivity maintenance heuristic which enables the swarm to quickly adapt its formation in response to the service requests. To select the moving drone(s) that would bring minimal overhead in terms of time and moving distance, the connected dominating set (CDS) concept from graph theory is utilized. Specifically, a variation of CDS, namely E-CDS, is introduced to address the needs},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {inproceedings}
}
Considering post-disaster scenarios for intelligent traffic management and damage assessment where communication infrastructure may not be available, we advocate a swarm-of-drones mesh communication architecture that can sustain in-network connectivity among drones. The connectivity sustenance requirement stems from the fact that drones may move to various locations in response to service requests but they still need to cooperate for data collection and transmissions. To address this need, we propose a fully distributed connectivity maintenance heuristic which enables the swarm to quickly adapt its formation in response to the service requests. To select the moving drone(s) that would bring minimal overhead in terms of time and moving distance, the connected dominating set (CDS) concept from graph theory is utilized. Specifically, a variation of CDS, namely E-CDS, is introduced to address the needs
2.
Ahmet Kurt, Kemal Akkaya
Connectivity maintenance extensions to IEEE 802.11 s MAC layer in ns-3 Journal Article
In: pp. 17–24, 2020.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {Connectivity maintenance extensions to IEEE 802.11 s MAC layer in ns-3},
author = {Ahmet Kurt and Kemal Akkaya},
url = {https://dl.acm.org/doi/abs/10.1145/3389400.3389408},
year = {2020},
date = {2020-06-17},
pages = {17–24},
school = {Florida International University},
abstract = {With the proliferation of IoT devices and their communication standards, we have been witnessing an increase in their meshing capabilities to enable coordination and cooperation. Such coordination, however, requires constant connectivity among the nodes when they are mobile. To efficiently maintain this connectivity, there have been different solutions in the past. However, none of them were incorporated into existing mesh standards. In this paper, we implemented a connectivity maintenance protocol within the IEEE 802.11s mesh standard which is available under ns-3. The connectivity maintenance was based on connected dominating set (CDS) paradigm and implemented at the MAC layer for faster processing. Under the 802.11s HWMP module, we introduced a new packet and a class to be able to compute the CDS of a given network. The implementation results indicate that the CDS at the MAC layer could},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
With the proliferation of IoT devices and their communication standards, we have been witnessing an increase in their meshing capabilities to enable coordination and cooperation. Such coordination, however, requires constant connectivity among the nodes when they are mobile. To efficiently maintain this connectivity, there have been different solutions in the past. However, none of them were incorporated into existing mesh standards. In this paper, we implemented a connectivity maintenance protocol within the IEEE 802.11s mesh standard which is available under ns-3. The connectivity maintenance was based on connected dominating set (CDS) paradigm and implemented at the MAC layer for faster processing. Under the 802.11s HWMP module, we introduced a new packet and a class to be able to compute the CDS of a given network. The implementation results indicate that the CDS at the MAC layer could
3.
Luis Puche Rondon, Leonardo Babun, Kemal Akkaya, A Selcuk Uluagac
Attacking HDMI distribution networks: poster Journal Article
In: pp. 326–327, 2019.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {Attacking HDMI distribution networks: poster},
author = {Luis Puche Rondon and Leonardo Babun and Kemal Akkaya and A Selcuk Uluagac},
url = {https://dl.acm.org/doi/abs/10.1145/3317549.3326314},
year = {2019},
date = {2019-05-15},
pages = {326–327},
school = {Florida International University},
abstract = {The High Definition Multimedia Interface or HDMI is the core and primary standard for Audio/Video communication in various media devices. HDMI allows flexible interaction between devices within HDMI distribution networks. Existing security standards and mechanism only protect traditional networking components. A user may mistakenly believe that a device is secure and an adversary may prove them otherwise. In this ongoing work, we show that by leveraging CEC to an attackers advantage. It is feasible for an attacker to reach devices which were formerly unreachable, and gain arbitrary control of HDMI devices. Specifically, we demonstrate it is possible to execute malicious device analysis, eavesdrop, and perform targeted Denial-of-Service attacks.},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
The High Definition Multimedia Interface or HDMI is the core and primary standard for Audio/Video communication in various media devices. HDMI allows flexible interaction between devices within HDMI distribution networks. Existing security standards and mechanism only protect traditional networking components. A user may mistakenly believe that a device is secure and an adversary may prove them otherwise. In this ongoing work, we show that by leveraging CEC to an attackers advantage. It is feasible for an attacker to reach devices which were formerly unreachable, and gain arbitrary control of HDMI devices. Specifically, we demonstrate it is possible to execute malicious device analysis, eavesdrop, and perform targeted Denial-of-Service attacks.
4.
Bekir Sait Ciftler, Sener Dikmese, İsmail Güvenç, Kemal Akkaya, Abdullah Kadri
Occupancy counting with burst and intermittent signals in smart buildings Proceedings Article
In: pp. 724–735, IEEE, 2017.
Abstract | Links | BibTeX | Tags: Wireless Networking
@inproceedings{nokey,
title = {Occupancy counting with burst and intermittent signals in smart buildings},
author = {Bekir Sait Ciftler and Sener Dikmese and İsmail Güvenç and Kemal Akkaya and Abdullah Kadri},
url = {https://ieeexplore.ieee.org/abstract/document/8049459/},
year = {2017},
date = {2017-09-25},
journal = {IEEE Internet of Things Journal},
volume = {5},
number = {2},
issue = {2},
pages = {724–735},
publisher = {IEEE},
school = {Florida International University},
abstract = {Zone-level occupancy counting is a critical technology for smart buildings and can be used for applications, such as building energy management, surveillance, and public safety. Existing occupancy counting techniques typically require installation of large number of occupancy monitoring sensors inside a building and an established wireless network. In this paper, in order to achieve occupancy counting, we consider the use of Wi-Fi probe requests that are continuously transmitted from Wi-Fi enabled smart devices for discovering nearby access points. To this end, Wi-Fi Pineapple equipment are used for passively capturing ambient probe requests from Wi-Fi devices, such as smart phones and tablets, where no connectivity to a Wi-Fi network is required. This information is then used to localize users within coarsely defined occupancy zones, and subsequently to obtain occupancy count within each zone at different},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {inproceedings}
}
Zone-level occupancy counting is a critical technology for smart buildings and can be used for applications, such as building energy management, surveillance, and public safety. Existing occupancy counting techniques typically require installation of large number of occupancy monitoring sensors inside a building and an established wireless network. In this paper, in order to achieve occupancy counting, we consider the use of Wi-Fi probe requests that are continuously transmitted from Wi-Fi enabled smart devices for discovering nearby access points. To this end, Wi-Fi Pineapple equipment are used for passively capturing ambient probe requests from Wi-Fi devices, such as smart phones and tablets, where no connectivity to a Wi-Fi network is required. This information is then used to localize users within coarsely defined occupancy zones, and subsequently to obtain occupancy count within each zone at different
5.
Bekir Sait Ciftler, Sener Dikmese, Ismail Guvenc, Kemal Akkaya, Abdullah Kadri
Occupancy Counting with Burst and Intermittent Signals in Smart Buildings Journal Article
In: arXiv e-prints, pp. arXiv: 1702.06423, 2017.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {Occupancy Counting with Burst and Intermittent Signals in Smart Buildings},
author = {Bekir Sait Ciftler and Sener Dikmese and Ismail Guvenc and Kemal Akkaya and Abdullah Kadri},
url = {https://ui.adsabs.harvard.edu/abs/2017arXiv170206423S/abstract},
year = {2017},
date = {2017-02-00},
journal = {arXiv e-prints},
pages = {arXiv: 1702.06423},
school = {Florida International University},
abstract = {Zone-level occupancy counting is a critical technology for smart buildings and can be used for several applications such as building energy management, surveillance, and public safety. Existing occupancy counting techniques typically require installation of large number of occupancy monitoring sensors inside a building as well as an established network. In this study, in order to achieve occupancy counting, we consider the use of WiFi probe requests that are continuously transmitted from WiFi enabled smart devices. To this end, WiFi Pineapple equipment are used for passively capturing ambient probe requests from WiFi devices such as smart phones and tablets, where no connectivity to a WiFi network is required. This information is then used to localize users within coarsely defined occupancy zones, and subsequently to obtain occupancy count within each zone at different time scales. An interacting multi},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
Zone-level occupancy counting is a critical technology for smart buildings and can be used for several applications such as building energy management, surveillance, and public safety. Existing occupancy counting techniques typically require installation of large number of occupancy monitoring sensors inside a building as well as an established network. In this study, in order to achieve occupancy counting, we consider the use of WiFi probe requests that are continuously transmitted from WiFi enabled smart devices. To this end, WiFi Pineapple equipment are used for passively capturing ambient probe requests from WiFi devices such as smart phones and tablets, where no connectivity to a WiFi network is required. This information is then used to localize users within coarsely defined occupancy zones, and subsequently to obtain occupancy count within each zone at different time scales. An interacting multi
6.
Izzet F Senturk, Kemal Akkaya, Shadi Janansefat
Towards realistic connectivity restoration in partitioned mobile sensor networks Journal Article
In: International Journal of Communication Systems, vol. 29, iss. 2, no. 2, pp. 230–250, 2016.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {Towards realistic connectivity restoration in partitioned mobile sensor networks},
author = {Izzet F Senturk and Kemal Akkaya and Shadi Janansefat},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/dac.2819},
year = {2016},
date = {2016-01-25},
journal = {International Journal of Communication Systems},
volume = {29},
number = {2},
issue = {2},
pages = {230–250},
school = {Florida International University},
abstract = {The connectivity of a disjoint mobile sensor network can be restored by moving a set of nodes to certain destinations. However, all of the existing works have assumed that the selected destinations can be reached via direct path movement, which may not be the case in realworld applications because of obstacles or terrain elevation. In addition, even if direct path movement is successful, optimal energy efficiency cannot be attained by neglecting the elevation or friction of the terrain when determining the movement path of the nodes. Thus, in the recovery efforts, terrain type, elevation, obstacles, and possible localization errors should be considered in order to guarantee the connectivity restoration while minimizing the recovery cost in terms of energy. In this paper, we pick two sample distributed and centralized connectivity restoration approaches from the literature to show that these approaches fail to restore},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
The connectivity of a disjoint mobile sensor network can be restored by moving a set of nodes to certain destinations. However, all of the existing works have assumed that the selected destinations can be reached via direct path movement, which may not be the case in realworld applications because of obstacles or terrain elevation. In addition, even if direct path movement is successful, optimal energy efficiency cannot be attained by neglecting the elevation or friction of the terrain when determining the movement path of the nodes. Thus, in the recovery efforts, terrain type, elevation, obstacles, and possible localization errors should be considered in order to guarantee the connectivity restoration while minimizing the recovery cost in terms of energy. In this paper, we pick two sample distributed and centralized connectivity restoration approaches from the literature to show that these approaches fail to restore
7.
Nico Saputro, Kemal Akkaya
PARP-S: A secure piggybacking-based ARP for IEEE 802.11 s-based Smart Grid AMI networks Journal Article
In: Computer Communications, vol. 58, pp. 16–28, 2015.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {PARP-S: A secure piggybacking-based ARP for IEEE 802.11 s-based Smart Grid AMI networks},
author = {Nico Saputro and Kemal Akkaya},
url = {https://www.sciencedirect.com/science/article/pii/S0140366414002801},
year = {2015},
date = {2015-03-01},
journal = {Computer Communications},
volume = {58},
pages = {16–28},
publisher = {Elsevier},
school = {Florida International University},
abstract = {The Smart Grid is expected to utilize a wireless infrastructure for power data collection in its Advanced Metering Infrastructure (AMI) applications. One of the options to implement such a network infrastructure is to use a wireless mesh network based on IEEE 802.11s mesh standard. However, IEEE 802.11s standard relies on MAC-based routing and thus requires the availability of MAC addresses of destinations. Due to large size of AMI networks, this creates a broadcast storm problem when such information is to be obtained via Address Resolution Protocol (ARP) broadcast packets. In this paper, we propose a mechanism to significantly alleviate such broadcast storm problem in order to improve the scalability of 802.11s and thus make it better suited for Smart Grid AMI applications. Our contribution is adapting 802.11s standard for addressing ARP broadcast storm problem in a secure and efficient manner},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
The Smart Grid is expected to utilize a wireless infrastructure for power data collection in its Advanced Metering Infrastructure (AMI) applications. One of the options to implement such a network infrastructure is to use a wireless mesh network based on IEEE 802.11s mesh standard. However, IEEE 802.11s standard relies on MAC-based routing and thus requires the availability of MAC addresses of destinations. Due to large size of AMI networks, this creates a broadcast storm problem when such information is to be obtained via Address Resolution Protocol (ARP) broadcast packets. In this paper, we propose a mechanism to significantly alleviate such broadcast storm problem in order to improve the scalability of 802.11s and thus make it better suited for Smart Grid AMI applications. Our contribution is adapting 802.11s standard for addressing ARP broadcast storm problem in a secure and efficient manner
8.
Andrew Beussink, Kemal Akkaya, Izzet F Senturk, Mohamed MEA Mahmoud
Preserving consumer privacy on IEEE 802.11 s-based smart grid AMI networks using data obfuscation Proceedings Article
In: 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 658–663, IEEE, 2014.
Abstract | Links | BibTeX | Tags: Wireless Networking
@inproceedings{nokey,
title = {Preserving consumer privacy on IEEE 802.11 s-based smart grid AMI networks using data obfuscation},
author = {Andrew Beussink and Kemal Akkaya and Izzet F Senturk and Mohamed MEA Mahmoud},
url = {https://ieeexplore.ieee.org/abstract/document/6849309/},
year = {2014},
date = {2014-04-27},
booktitle = {2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)},
pages = {658–663},
publisher = {IEEE},
school = {Florida International University},
abstract = {While the newly envisioned Smart(er) Grid (SG) will result in a more efficient and reliable power grid, its use of fine-grained meter data has widely raised concerns of consumer privacy. In this paper, we propose to implement a data obfuscation approach to preserve consumer privacy and assess its feasibility on large-scale Advanced Metering Infrastructure (AMI) network built upon the new IEEE 802.11s wireless mesh standard. We first propose a secure obfuscation value distribution approach on this 802.11s-based wireless mesh network. Using obfuscation values provided via this approach, the meter readings are obfuscated to protect consumer privacy from eavesdroppers and the utility companies while preserving the utility companies' ability to use the data for state estimation. We assessed the impact of using this privacy approach on the data throughput and delay. Simulation results have shown that the impact},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {inproceedings}
}
While the newly envisioned Smart(er) Grid (SG) will result in a more efficient and reliable power grid, its use of fine-grained meter data has widely raised concerns of consumer privacy. In this paper, we propose to implement a data obfuscation approach to preserve consumer privacy and assess its feasibility on large-scale Advanced Metering Infrastructure (AMI) network built upon the new IEEE 802.11s wireless mesh standard. We first propose a secure obfuscation value distribution approach on this 802.11s-based wireless mesh network. Using obfuscation values provided via this approach, the meter readings are obfuscated to protect consumer privacy from eavesdroppers and the utility companies while preserving the utility companies' ability to use the data for state estimation. We assessed the impact of using this privacy approach on the data throughput and delay. Simulation results have shown that the impact
9.
Nico Saputro, Kemal Akkaya
An efficient and secure arp for large-scale ieee 802.11 s-based smart grid networks Journal Article
In: pp. 214–228, 2014.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {An efficient and secure arp for large-scale ieee 802.11 s-based smart grid networks},
author = {Nico Saputro and Kemal Akkaya},
url = {https://link.springer.com/chapter/10.1007/978-3-319-04105-6_14},
year = {2014},
date = {2014-00-00},
booktitle = {Ad Hoc Networks: 5th International ICST Conference, ADHOCNETS 2013, Barcelona, Spain, October 2013, Revised Selected Papers 5},
pages = {214–228},
publisher = {Springer International Publishing},
school = {Florida International University},
abstract = {While Wireless Mesh Networks (WMNs) can be attractive in terms of deployment cost, convenience and flexibility, their real-life performance in large-scale is still inadequate due to interference and multi-hop communication. In this paper, we target IEEE 802.11s-based WMNs and propose to revise the way they perform Address Resolution Protocol (ARP) in order to improve their scalability and thus make them better suited for SG Advanced Metering Infrastructure (AMI) applications. Specifically, we utilize the proactive Path Request (PREQ) message of layer-2 path discovery protocol of 802.11s, namely HWMP, for piggybacking ARP information. In this way, the MAC address resolution is handled during routing tree creation/maintenance and hence the broadcasting of ARP requests by the smart meters to learn the MAC address of the data collector (i.e., the gateway node) is completely eliminated},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
While Wireless Mesh Networks (WMNs) can be attractive in terms of deployment cost, convenience and flexibility, their real-life performance in large-scale is still inadequate due to interference and multi-hop communication. In this paper, we target IEEE 802.11s-based WMNs and propose to revise the way they perform Address Resolution Protocol (ARP) in order to improve their scalability and thus make them better suited for SG Advanced Metering Infrastructure (AMI) applications. Specifically, we utilize the proactive Path Request (PREQ) message of layer-2 path discovery protocol of 802.11s, namely HWMP, for piggybacking ARP information. In this way, the MAC address resolution is handled during routing tree creation/maintenance and hence the broadcasting of ARP requests by the smart meters to learn the MAC address of the data collector (i.e., the gateway node) is completely eliminated
10.
Nico Saputro, Kemal Akkaya
An efficient ARP for large-scale IEEE 802.11 s-based Smart Grid networks Proceedings Article
In: 38th Annual IEEE Conference on Local Computer Networks, pp. 723–726, IEEE, 2013.
Abstract | Links | BibTeX | Tags: Wireless Networking
@inproceedings{nokey,
title = {An efficient ARP for large-scale IEEE 802.11 s-based Smart Grid networks},
author = {Nico Saputro and Kemal Akkaya},
url = {https://ieeexplore.ieee.org/abstract/document/6761320/},
year = {2013},
date = {2013-10-21},
booktitle = {38th Annual IEEE Conference on Local Computer Networks},
pages = {723–726},
publisher = {IEEE},
school = {Florida International University},
abstract = {Recently, wireless mesh networks (WMNs) have been touted as one of the suitable communication infrastructure for Smart Grid (SG) Advanced Metering Infrastructure (AMI) applications due to their ease of deployment and reasonable costs. These WMNs are typically based on the upcoming IEEE standard, namely IEEE 802.11s. However, 802.11s has performance related issues regarding scalability. One of the inefficiencies is related to the Address Resolution Protocol (ARP) when creating and maintaining the ARP cache and issuing path discovery within large-scale networks. In this paper, we propose an efficient ARP scheme for large-scale AMI networks. Specifically, we utilize the proactive Path Request (PREQ) message of 802.11s standard to perform the MAC address resolution during routing tree creation and maintenance and hence eliminate the broadcasting of ARP requests. Simulation results with the},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {inproceedings}
}
Recently, wireless mesh networks (WMNs) have been touted as one of the suitable communication infrastructure for Smart Grid (SG) Advanced Metering Infrastructure (AMI) applications due to their ease of deployment and reasonable costs. These WMNs are typically based on the upcoming IEEE standard, namely IEEE 802.11s. However, 802.11s has performance related issues regarding scalability. One of the inefficiencies is related to the Address Resolution Protocol (ARP) when creating and maintaining the ARP cache and issuing path discovery within large-scale networks. In this paper, we propose an efficient ARP scheme for large-scale AMI networks. Specifically, we utilize the proactive Path Request (PREQ) message of 802.11s standard to perform the MAC address resolution during routing tree creation and maintenance and hence eliminate the broadcasting of ARP requests. Simulation results with the
11.
Mohamed Younis, Tamer Nadeem, Ali Bicak, Kemal Akkaya
Energy-Efficient Medium Access Control Protocols for Wireless Sensor Networks Journal Article
In: Wireless Sensor Networks: From Theory to Applications, pp. 305, 2013.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {Energy-Efficient Medium Access Control Protocols for Wireless Sensor Networks},
author = {Mohamed Younis and Tamer Nadeem and Ali Bicak and Kemal Akkaya},
url = {https://books.google.com/books?hl=en&lr=&id=KUTSBQAAQBAJ&oi=fnd&pg=PA305&dq=info:j3w9WuehPYMJ:scholar.google.com&ots=mshk4UxR1j&sig=RxyB6XV8ufVqh2JGc73qLLVTTCg},
year = {2013},
date = {2013-08-28},
journal = {Wireless Sensor Networks: From Theory to Applications},
pages = {305},
publisher = {CRC Press},
school = {Florida International University},
abstract = {In the last decade, there have been major advances in the development of low-power microsensors. The emergence of such sensors has led practitioners to envision the networking of a large set of sensors scattered over a wide area of interest. 15 A typical architecture of a sensor network consists of many sensing devices that are capable of probing the environment and reporting the collected data, using a radio, to a command center (sink). 6, 7 Wireless sensor networks (WSNs) serve many civil and military applications such as disaster management, combat field surveillance, and security. 1 In such applications, the sensors are usually powered using small batteries and deployed in an unattended setup. Therefore, replacing the sensors battery is not possible or practical. Such energy constraints limit the sensors lifetime and thus make efficient design and management of WSNs a real challenge.},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
In the last decade, there have been major advances in the development of low-power microsensors. The emergence of such sensors has led practitioners to envision the networking of a large set of sensors scattered over a wide area of interest. 15 A typical architecture of a sensor network consists of many sensing devices that are capable of probing the environment and reporting the collected data, using a radio, to a command center (sink). 6, 7 Wireless sensor networks (WSNs) serve many civil and military applications such as disaster management, combat field surveillance, and security. 1 In such applications, the sensors are usually powered using small batteries and deployed in an unattended setup. Therefore, replacing the sensors battery is not possible or practical. Such energy constraints limit the sensors lifetime and thus make efficient design and management of WSNs a real challenge.
12.
Kemal Akkaya, Izzet F Senturk, Shanthi Vemulapalli
Handling large-scale node failures in mobile sensor/robot networks Journal Article
In: Journal of Network and Computer Applications, vol. 36, iss. 1, no. 1, pp. 195–210, 2013.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {Handling large-scale node failures in mobile sensor/robot networks},
author = {Kemal Akkaya and Izzet F Senturk and Shanthi Vemulapalli},
url = {https://www.sciencedirect.com/science/article/pii/S1084804512002135},
year = {2013},
date = {2013-01-01},
journal = {Journal of Network and Computer Applications},
volume = {36},
number = {1},
issue = {1},
pages = {195–210},
publisher = {Academic Press},
school = {Florida International University},
abstract = {In Wireless Sensor Networks (WSNs), maintaining connectivity with the sink node is a crucial issue to collect data from sensors without any interruption. While sensors are typically deployed in abundance to tolerate possible node failures, a large number of simultaneous node failures within the same region may result in partitioning the network which may disrupt the network operation significantly. Given that WSNs are deployed in inhospitable environments, such node failures are very likely due to storms, fires, floods, etc. The self-recovery of the network from these large-scale node failures is challenging since the nodes will not have any information about the location and span of the damage. In this paper, we first present a distributed partition detection algorithm which quickly makes the sensors aware of the partitioning in the network. This process is led by the sensors whose upstream nodes fail due to damages},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
In Wireless Sensor Networks (WSNs), maintaining connectivity with the sink node is a crucial issue to collect data from sensors without any interruption. While sensors are typically deployed in abundance to tolerate possible node failures, a large number of simultaneous node failures within the same region may result in partitioning the network which may disrupt the network operation significantly. Given that WSNs are deployed in inhospitable environments, such node failures are very likely due to storms, fires, floods, etc. The self-recovery of the network from these large-scale node failures is challenging since the nodes will not have any information about the location and span of the damage. In this paper, we first present a distributed partition detection algorithm which quickly makes the sensors aware of the partitioning in the network. This process is led by the sensors whose upstream nodes fail due to damages
13.
Shadi Janansefat, Izzet Senturk, Kemal Akkaya, Michael Gloff
A mobile sensor network testbed using irobots Journal Article
In: 37th Annual IEEE Conference on Local Computer Networks (LCN), 2012.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {A mobile sensor network testbed using irobots},
author = {Shadi Janansefat and Izzet Senturk and Kemal Akkaya and Michael Gloff},
url = {http://www.ieeelcn.org/prior/LCN37/lcn37demos/LCNDemos12_Janansefat.pdf},
year = {2012},
date = {2012-10-00},
journal = {37th Annual IEEE Conference on Local Computer Networks (LCN)},
school = {Florida International University},
abstract = {Wireless sensor networks (WSNs) have been used in many applications by deploying tiny and stationary sensors. In recent years, a lot of studies proposed to introduce mobility capability to sensor nodes in order to exploit the advantages of mobility in WSN applications. In this proposal, we design and evaluate a mobile sensor network (MSN) testbed using iRobotbased mobile nodes. We integrate low-cost commercially available iRobot Create platform with IRIS sensor motes to design a new mobile sensor node called iRobotSense. Using these mobile nodes, we developed an MSN testbed at Southern Illinois University and implemented a connectivity restoration algorithm on this testbed that exploits node repositioning. Our demonstration will include the execution of this algorithm in a small testbed.},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
Wireless sensor networks (WSNs) have been used in many applications by deploying tiny and stationary sensors. In recent years, a lot of studies proposed to introduce mobility capability to sensor nodes in order to exploit the advantages of mobility in WSN applications. In this proposal, we design and evaluate a mobile sensor network (MSN) testbed using iRobotbased mobile nodes. We integrate low-cost commercially available iRobot Create platform with IRIS sensor motes to design a new mobile sensor node called iRobotSense. Using these mobile nodes, we developed an MSN testbed at Southern Illinois University and implemented a connectivity restoration algorithm on this testbed that exploits node repositioning. Our demonstration will include the execution of this algorithm in a small testbed.
14.
Suleyman Uludag, Tom Imboden, Kemal Akkaya
A taxonomy and evaluation for developing 802.11‐based wireless mesh network testbeds Journal Article
In: International Journal of Communication Systems, vol. 25, iss. 8, no. 8, pp. 963–990, 2012.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {A taxonomy and evaluation for developing 802.11‐based wireless mesh network testbeds},
author = {Suleyman Uludag and Tom Imboden and Kemal Akkaya},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/dac.1299},
year = {2012},
date = {2012-08-00},
journal = {International Journal of Communication Systems},
volume = {25},
number = {8},
issue = {8},
pages = {963–990},
publisher = {John Wiley & Sons, Ltd},
school = {Florida International University},
abstract = {The definition of wireless mesh networks (WMNs) has been used in the literature to connote and epitomize the ideal, ubiquitous, pervasive, and autonomic networking technology. An increasing interest has been emerging on the development of 802.11based WMN testbeds to test the new ideas and approaches more realistically as opposed to relying solely on simulations. Although the developed testbeds have provided several insights to researchers for furthering the technology, there are still several issues that need to be addressed, particularly, with the approval of new standards, such as IEEE 802.11s, IEEE 802.11n, and IEEE 802.16, and upcoming protocols, such as IEEE 802.11ac, 802.11ad, 802.11ah, and 802.11af TV White Space efforts. In this paper, our goal is to provide a taxonomy and insightful guidelines for the creation of 802.11based WMN testbeds as well as to identify several features that future},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
The definition of wireless mesh networks (WMNs) has been used in the literature to connote and epitomize the ideal, ubiquitous, pervasive, and autonomic networking technology. An increasing interest has been emerging on the development of 802.11based WMN testbeds to test the new ideas and approaches more realistically as opposed to relying solely on simulations. Although the developed testbeds have provided several insights to researchers for furthering the technology, there are still several issues that need to be addressed, particularly, with the approval of new standards, such as IEEE 802.11s, IEEE 802.11n, and IEEE 802.16, and upcoming protocols, such as IEEE 802.11ac, 802.11ad, 802.11ah, and 802.11af TV White Space efforts. In this paper, our goal is to provide a taxonomy and insightful guidelines for the creation of 802.11based WMN testbeds as well as to identify several features that future
15.
Tom Imboden, Kemal Akkaya, Zach Moore
Performance evaluation of wireless mesh networks using IEEE 802.11 s and IEEE 802.11 n Proceedings Article
In: 2012 IEEE International Conference on Communications (ICC), pp. 5675–5679, IEEE, 2012.
Abstract | Links | BibTeX | Tags: Wireless Networking
@inproceedings{nokey,
title = {Performance evaluation of wireless mesh networks using IEEE 802.11 s and IEEE 802.11 n},
author = {Tom Imboden and Kemal Akkaya and Zach Moore},
url = {https://ieeexplore.ieee.org/abstract/document/6364932/},
year = {2012},
date = {2012-06-10},
booktitle = {2012 IEEE International Conference on Communications (ICC)},
pages = {5675–5679},
publisher = {IEEE},
school = {Florida International University},
abstract = {With the recent approval of IEEE 802.11n standard and progress on IEEE 802.11s mesh standardization efforts, performance evaluation of such standards has gained acceleration. In particular, several wireless testbeds have been created to form wireless mesh networks (WMNs) in order to test various aspects of these new standards. However, none of these considered multi-hop performance of WMNs when 802.11n based nodes are employed. While IEEE 802.11s is geared for implementing multi-hopping capability among the nodes, current studies still assume IEEE 802.11a/g based nodes. This paper presents a performance evaluation of WMNs using both 802.11s (in conjunction with 802.11a/g) and 802.11n on a real academic testbed. While a draft version of 802.11s has been used for creating a linear WMN using 802.11a/g based routers, the same linear WMN using 802.11n has been created using},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {inproceedings}
}
With the recent approval of IEEE 802.11n standard and progress on IEEE 802.11s mesh standardization efforts, performance evaluation of such standards has gained acceleration. In particular, several wireless testbeds have been created to form wireless mesh networks (WMNs) in order to test various aspects of these new standards. However, none of these considered multi-hop performance of WMNs when 802.11n based nodes are employed. While IEEE 802.11s is geared for implementing multi-hopping capability among the nodes, current studies still assume IEEE 802.11a/g based nodes. This paper presents a performance evaluation of WMNs using both 802.11s (in conjunction with 802.11a/g) and 802.11n on a real academic testbed. While a draft version of 802.11s has been used for creating a linear WMN using 802.11a/g based routers, the same linear WMN using 802.11n has been created using
16.
Mustafa Y Sir, Izzet F Senturk, Esra Sisikoglu, Kemal Akkaya
An optimization-based approach for connecting partitioned mobile sensor/actuator networks Proceedings Article
In: 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 525–530, IEEE, 2011.
Abstract | Links | BibTeX | Tags: Wireless Networking
@inproceedings{nokey,
title = {An optimization-based approach for connecting partitioned mobile sensor/actuator networks},
author = {Mustafa Y Sir and Izzet F Senturk and Esra Sisikoglu and Kemal Akkaya},
url = {https://ieeexplore.ieee.org/abstract/document/5928869/},
year = {2011},
date = {2011-04-10},
booktitle = {2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)},
pages = {525–530},
publisher = {IEEE},
school = {Florida International University},
abstract = {Wireless Sensor and Actuator Networks (WSANs) employ mobile nodes in addition to stationary tiny sensors. Similarly, mobile sensors make it possible to have the flexibility of mobility in mobile sensor network (MSN) applications. Mobility can be exploited to connect partitioned WSANs and MSNs due to large scale damages or deployment problems. However, since mobility consume significant energy and it can be limited due to terrain constraints, the travel distance for the mobile nodes should be minimized in such a recovery effort. In this paper, we present a mathematical model which minimizes the total travel distance for connecting a given number of partitions. The idea is based on network flows and the problem is modeled as a mixed integer nonlinear program. The nonlinear terms in the model are linearized using a polygon approximation for computational efficiency. We evaluated the performance of the},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {inproceedings}
}
Wireless Sensor and Actuator Networks (WSANs) employ mobile nodes in addition to stationary tiny sensors. Similarly, mobile sensors make it possible to have the flexibility of mobility in mobile sensor network (MSN) applications. Mobility can be exploited to connect partitioned WSANs and MSNs due to large scale damages or deployment problems. However, since mobility consume significant energy and it can be limited due to terrain constraints, the travel distance for the mobile nodes should be minimized in such a recovery effort. In this paper, we present a mathematical model which minimizes the total travel distance for connecting a given number of partitions. The idea is based on network flows and the problem is modeled as a mixed integer nonlinear program. The nonlinear terms in the model are linearized using a polygon approximation for computational efficiency. We evaluated the performance of the
17.
Mohamed Younis, Kemal Akkaya, Moustafa Youssef
Handling QoS Traffic in Wireless Sensor Networks Journal Article
In: Encyclopedia on Ad Hoc and Ubiquitous Computing: Theory and Design of Wireless Ad Hoc, Sensor, and Mesh Networks, pp. 257, 2010.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {Handling QoS Traffic in Wireless Sensor Networks},
author = {Mohamed Younis and Kemal Akkaya and Moustafa Youssef},
url = {https://scholar.google.com/scholar?cluster=15781557274236030821&hl=en&oi=scholarr},
year = {2010},
date = {2010-00-00},
journal = {Encyclopedia on Ad Hoc and Ubiquitous Computing: Theory and Design of Wireless Ad Hoc, Sensor, and Mesh Networks},
pages = {257},
publisher = {World Scientific Publishing Company Incorporated},
school = {Florida International University},
abstract = {Many new routing and MAC layer protocols have been proposed for wireless sensor networks tackling the issues raised by the resource constrained unattended sensor nodes in large-scale deployments. The majority of these protocols considered energy eciency as the main objective and assumed data trac with unconstrained delivery requirements. However, the growing interests in applications that demand certain end-to-end performance guarantees and the introduction of imaging and video sensors have posed additional challenges. Transmission of data in such cases requires both energy and QoS aware network management in order to ensure ecient usage of the sensor resources and eective access to the gathered measurements. In this chapter, we highlight the architectural and operational challenges of handling of QoS trac in sensor networks. We report on progress make to-date and discuss sample of our work in more details. Finally, we outline open research problems.},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
Many new routing and MAC layer protocols have been proposed for wireless sensor networks tackling the issues raised by the resource constrained unattended sensor nodes in large-scale deployments. The majority of these protocols considered energy eciency as the main objective and assumed data trac with unconstrained delivery requirements. However, the growing interests in applications that demand certain end-to-end performance guarantees and the introduction of imaging and video sensors have posed additional challenges. Transmission of data in such cases requires both energy and QoS aware network management in order to ensure ecient usage of the sensor resources and eective access to the gathered measurements. In this chapter, we highlight the architectural and operational challenges of handling of QoS trac in sensor networks. We report on progress make to-date and discuss sample of our work in more details. Finally, we outline open research problems.
18.
Suleyman Uludag, Kemal Akkaya
Distributed channel assignment in Wireless Mesh Networks with guaranteed connectivity Proceedings Article
In: 2008 33rd IEEE Conference on Local Computer Networks (LCN), pp. 562–563, IEEE, 2008.
Abstract | Links | BibTeX | Tags: Wireless Networking
@inproceedings{nokey,
title = {Distributed channel assignment in Wireless Mesh Networks with guaranteed connectivity},
author = {Suleyman Uludag and Kemal Akkaya},
url = {https://ieeexplore.ieee.org/abstract/document/4664237/},
year = {2008},
date = {2008-10-14},
booktitle = {2008 33rd IEEE Conference on Local Computer Networks (LCN)},
pages = {562–563},
publisher = {IEEE},
school = {Florida International University},
abstract = {Using multiple radios/channels in wireless mesh networks (WMNs) can significantly boost the throughput of the network and brings broadband wireless access to more users with reduced cost. However, this requires careful assignment of channels to each radio so that interference due to parallel communications can be minimized and the network is not partitioned. We propose a distributed channel assignment protocol for WMNs to maximize the total number of non-interfering concurrent active links and guarantee the network connectivity. The motivation for maximizing the number of links is to give as much leeway to the routing subsystem as possible. The problem is modeled as a list coloring problem where each channel corresponds to a color. The main idea is to determine the minimum degree spanning tree (MDST) of the network for providing more parallel transmissions and guaranteeing connectivity. The links},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {inproceedings}
}
Using multiple radios/channels in wireless mesh networks (WMNs) can significantly boost the throughput of the network and brings broadband wireless access to more users with reduced cost. However, this requires careful assignment of channels to each radio so that interference due to parallel communications can be minimized and the network is not partitioned. We propose a distributed channel assignment protocol for WMNs to maximize the total number of non-interfering concurrent active links and guarantee the network connectivity. The motivation for maximizing the number of links is to give as much leeway to the routing subsystem as possible. The problem is modeled as a list coloring problem where each channel corresponds to a color. The main idea is to determine the minimum degree spanning tree (MDST) of the network for providing more parallel transmissions and guaranteeing connectivity. The links
19.
Aravind R Sama, Kemal Akkaya
Real-time routing for mobile sensor/actor networks Proceedings Article
In: 2008 33rd IEEE Conference on Local Computer Networks (LCN), pp. 821–828, IEEE, 2008.
Abstract | Links | BibTeX | Tags: Wireless Networking
@inproceedings{nokey,
title = {Real-time routing for mobile sensor/actor networks},
author = {Aravind R Sama and Kemal Akkaya},
url = {https://ieeexplore.ieee.org/abstract/document/4664287/},
year = {2008},
date = {2008-10-14},
booktitle = {2008 33rd IEEE Conference on Local Computer Networks (LCN)},
pages = {821–828},
publisher = {IEEE},
school = {Florida International University},
abstract = {With the increasing interest in the application of wireless ad hoc networks, the demand for providing QoS in such applications also grows. Particularly, in sensor and actor networks, providing certain delay bounds is crucial for the actors as they perform their actions based on the received data from sensors. The usefulness of the content from sensors is based on its timeliness. In this paper, we present Ad Hoc On Demand Delay Constrained Distance Vector Routing (AOD 2 V) which is an extension to the widely used routing protocol AODV for providing delay constrained data delivery in mobile sensor/actor networks. The admission control is based on Delay-EDD scheduling algorithm. The idea is to reserve the resources while routes are being determined in the route discovery phase of AODV. The reservation considers the service time at each node till the destination node. As long as the cumulative delay which is},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {inproceedings}
}
With the increasing interest in the application of wireless ad hoc networks, the demand for providing QoS in such applications also grows. Particularly, in sensor and actor networks, providing certain delay bounds is crucial for the actors as they perform their actions based on the received data from sensors. The usefulness of the content from sensors is based on its timeliness. In this paper, we present Ad Hoc On Demand Delay Constrained Distance Vector Routing (AOD 2 V) which is an extension to the widely used routing protocol AODV for providing delay constrained data delivery in mobile sensor/actor networks. The admission control is based on Delay-EDD scheduling algorithm. The idea is to reserve the resources while routes are being determined in the route discovery phase of AODV. The reservation considers the service time at each node till the destination node. As long as the cumulative delay which is
20.
Suleyman Uludag, Ljubomir Perković, Anna Kashkanova, Kemal Akkaya
Quality-of-service provisioning via stochastic path selection under Weibullian link delays Journal Article
In: pp. 1–7, 2007.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {Quality-of-service provisioning via stochastic path selection under Weibullian link delays},
author = {Suleyman Uludag and Ljubomir Perković and Anna Kashkanova and Kemal Akkaya},
url = {https://dl.acm.org/doi/abs/10.1145/1577222.1577238},
year = {2007},
date = {2007-08-14},
pages = {1–7},
school = {Florida International University},
abstract = {We study the problem of finding the most likely path satisfying a requested additive Quality-of-Service (QoS) value, such as delay. The link metrics are defined as random variables following Weibull probability distributions as empirically reported in [13] and analytically derived in [12]. The problem of finding the most likely path is NP-Hard [24]. Our approach involves reducing the complicated probability convolutions necessary to calculate the most probable path that satisfies a requested delay value. With the reduction of the objective function, an extended Bellman-Ford algorithm is devised to solve the problem. The resulting approach have the same complexity as the standard Bellman-Ford algorithm. Our reduced objective function only needs the location parameter of the Weibull distributions, hence avoiding the complexity of inferring the shape and scale parameters. We evaluate the performance of our approach},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
We study the problem of finding the most likely path satisfying a requested additive Quality-of-Service (QoS) value, such as delay. The link metrics are defined as random variables following Weibull probability distributions as empirically reported in [13] and analytically derived in [12]. The problem of finding the most likely path is NP-Hard [24]. Our approach involves reducing the complicated probability convolutions necessary to calculate the most probable path that satisfies a requested delay value. With the reduction of the objective function, an extended Bellman-Ford algorithm is devised to solve the problem. The resulting approach have the same complexity as the standard Bellman-Ford algorithm. Our reduced objective function only needs the location parameter of the Weibull distributions, hence avoiding the complexity of inferring the shape and scale parameters. We evaluate the performance of our approach
21.
Kemal Akkaya, Mohamed Younis
Energy and QoS aware routing in wireless sensor networks Journal Article
In: Cluster computing, vol. 8, pp. 179–188, 2005.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {Energy and QoS aware routing in wireless sensor networks},
author = {Kemal Akkaya and Mohamed Younis},
url = {https://link.springer.com/article/10.1007/s10586-005-6183-7},
year = {2005},
date = {2005-07-00},
journal = {Cluster computing},
volume = {8},
pages = {179–188},
publisher = {Kluwer Academic Publishers},
school = {Florida International University},
abstract = {Many new routing protocols have been proposed for wireless sensor networks in recent years. Almost all of the routing protocols considered energy efficiency as the ultimate objective since energy is a very scarce resource for sensor nodes. However, the introduction imaging sensors has posed additional challenges. Transmission of imaging data requires both energy and QoS aware routing in order to ensure efficient usage of the sensors and effective access to the gathered measurements. In this paper, we propose an energy-aware QoS routing protocol for sensor networks which can also run efficiently with best-effort traffic. The protocol finds a least-cost, delay-constrained path for real-time data in terms of link cost that captures nodes energy reserve, transmission energy, error rate and other communication parameters. Moreover, the throughput for non-real-time data is maximized by adjusting the},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
Many new routing protocols have been proposed for wireless sensor networks in recent years. Almost all of the routing protocols considered energy efficiency as the ultimate objective since energy is a very scarce resource for sensor nodes. However, the introduction imaging sensors has posed additional challenges. Transmission of imaging data requires both energy and QoS aware routing in order to ensure efficient usage of the sensors and effective access to the gathered measurements. In this paper, we propose an energy-aware QoS routing protocol for sensor networks which can also run efficiently with best-effort traffic. The protocol finds a least-cost, delay-constrained path for real-time data in terms of link cost that captures nodes energy reserve, transmission energy, error rate and other communication parameters. Moreover, the throughput for non-real-time data is maximized by adjusting the
22.
Kemal Akkaya, Mohamed Younis
A survey on routing protocols for wireless sensor networks Journal Article
In: vol. 3, iss. 3, no. 3, pp. 325–349, 2005.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {A survey on routing protocols for wireless sensor networks},
author = {Kemal Akkaya and Mohamed Younis},
url = {https://www.sciencedirect.com/science/article/pii/S1570870503000738},
year = {2005},
date = {2005-05-01},
volume = {3},
number = {3},
issue = {3},
pages = {325–349},
publisher = {Elsevier},
school = {Florida International University},
abstract = {Recent advances in wireless sensor networks have led to many new protocols specifically designed for sensor networks where energy awareness is an essential consideration. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. This paper surveys recent routing protocols for sensor networks and presents a classification for the various approaches pursued. The three main categories explored in this paper are data-centric, hierarchical and location-based. Each routing protocol is described and discussed under the appropriate category. Moreover, protocols using contemporary methodologies such as network flow and quality of service modeling are also discussed. The paper concludes with open research issues.},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
Recent advances in wireless sensor networks have led to many new protocols specifically designed for sensor networks where energy awareness is an essential consideration. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. This paper surveys recent routing protocols for sensor networks and presents a classification for the various approaches pursued. The three main categories explored in this paper are data-centric, hierarchical and location-based. Each routing protocol is described and discussed under the appropriate category. Moreover, protocols using contemporary methodologies such as network flow and quality of service modeling are also discussed. The paper concludes with open research issues.
23.
Kemal Akkaya, Mohamed F Younis, Moustafa Youssef
Efficient aggregation of delay-constrained data in wireless sensor networks. Journal Article
In: pp. 904–909, 2005.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {Efficient aggregation of delay-constrained data in wireless sensor networks.},
author = {Kemal Akkaya and Mohamed F Younis and Moustafa Youssef},
url = {https://www.cs.umbc.edu/~kemal1/mypapers/Akkaya_IC-QAWN.pdf},
year = {2005},
date = {2005-01-03},
booktitle = {aiccsa},
pages = {904–909},
school = {Florida International University},
abstract = {Recent years have witnessed a growing interest in the application of wireless sensor networks in unattended environments. Nodes in such applications are equipped with limited energy supply and need careful management in order to extend their lifetime. In order to conserve energy, many of the routing protocols proposed for wireless sensor networks reduce the number of transmitted packets by pursuing in-network data aggregation. Almost all of the aggregation schemes presented in the literature strive to save sensors energy while considering unconstrained data traffic. However, aggregation extends the queuing delay at the relay nodes and can thus complicate the handling of latency-constrained data. In this paper, we analyze the conditions for effective aggregation of data traffic that is subject to end-to-end delay constraints. We present an algorithm for achieving maximal possible energy saving through data aggregation while meeting the desired level of timeliness. A Weighted Fair Queuing based mechanism for packet scheduling is employed at each node in order to perform service differentiation and ensure bounded delay for constrained traffic. The performance of the proposed approach is qualified via simulation. The simulation results have demonstrated that the proposed approach provides a balance between energy consumption and timeliness level.},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
Recent years have witnessed a growing interest in the application of wireless sensor networks in unattended environments. Nodes in such applications are equipped with limited energy supply and need careful management in order to extend their lifetime. In order to conserve energy, many of the routing protocols proposed for wireless sensor networks reduce the number of transmitted packets by pursuing in-network data aggregation. Almost all of the aggregation schemes presented in the literature strive to save sensors energy while considering unconstrained data traffic. However, aggregation extends the queuing delay at the relay nodes and can thus complicate the handling of latency-constrained data. In this paper, we analyze the conditions for effective aggregation of data traffic that is subject to end-to-end delay constraints. We present an algorithm for achieving maximal possible energy saving through data aggregation while meeting the desired level of timeliness. A Weighted Fair Queuing based mechanism for packet scheduling is employed at each node in order to perform service differentiation and ensure bounded delay for constrained traffic. The performance of the proposed approach is qualified via simulation. The simulation results have demonstrated that the proposed approach provides a balance between energy consumption and timeliness level.
24.
Kemal Akkaya
Energy and QoS aware routing protocols for wireless sensor networks Journal Article
In: 2005.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {Energy and QoS aware routing protocols for wireless sensor networks},
author = {Kemal Akkaya},
url = {https://search.proquest.com/openview/99c8638e92ad690b2ac976a9adbf817e/1?pq-origsite=gscholar&cbl=18750&diss=y},
year = {2005},
date = {2005-00-00},
institution = {University of Maryland, Baltimore County},
school = {Florida International University},
abstract = {Recent years have witnessed a growing interest in the application of wireless sensor networks (WSN). Examples of such applications include environmental monitoring, disaster management, target tracking and border control. Typically sensors in such applications collect data about their surrounding and forward that data to a gateway (sink). Due to the limitation of the energy supply that these miniaturized sensors have, almost all of the proposed routing protocols aimed at energy efficiency as the ultimate objective and considered relaying data to a stationary gateway.},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
Recent years have witnessed a growing interest in the application of wireless sensor networks (WSN). Examples of such applications include environmental monitoring, disaster management, target tracking and border control. Typically sensors in such applications collect data about their surrounding and forward that data to a gateway (sink). Due to the limitation of the energy supply that these miniaturized sensors have, almost all of the proposed routing protocols aimed at energy efficiency as the ultimate objective and considered relaying data to a stationary gateway.
25.
Kemal Akkaya, Mohamed Younis
Energy-aware routing to a mobile gateway in wireless sensor networks Proceedings Article
In: IEEE Global Telecommunications Conference Workshops, 2004. GlobeCom Workshops 2004., pp. 16–21, IEEE, 2004.
Abstract | Links | BibTeX | Tags: Wireless Networking
@inproceedings{nokey,
title = {Energy-aware routing to a mobile gateway in wireless sensor networks},
author = {Kemal Akkaya and Mohamed Younis},
url = {https://ieeexplore.ieee.org/abstract/document/1417542/},
year = {2004},
date = {2004-11-29},
booktitle = {IEEE Global Telecommunications Conference Workshops, 2004. GlobeCom Workshops 2004.},
pages = {16–21},
publisher = {IEEE},
school = {Florida International University},
abstract = {Almost all of the energy-aware routing protocols that have been proposed for wireless sensor networks aim at optimizing network performance while relaying data to a static nan gateway (sink). However, mobility of the gateway can make routes established through such contemporary protocols, unstable and non-optimal. The use of mobile gateways introduces a non-traditional trade-off between the need for frequent re-routing to ensure optimal network operation and the desire for minimizing the overhead of topology management. In this paper, we propose an energy aware mechanism for efficient and continual data delivery to a moving gateway. Our approach tracks the distance of the gateway from the last hops to the gateway, and dynamically adjust the routes either via increasing the last hop nodes' radio ranges or introducing new forwarder nodes as part of the routes. Rerouting is triggered when the current},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {inproceedings}
}
Almost all of the energy-aware routing protocols that have been proposed for wireless sensor networks aim at optimizing network performance while relaying data to a static nan gateway (sink). However, mobility of the gateway can make routes established through such contemporary protocols, unstable and non-optimal. The use of mobile gateways introduces a non-traditional trade-off between the need for frequent re-routing to ensure optimal network operation and the desire for minimizing the overhead of topology management. In this paper, we propose an energy aware mechanism for efficient and continual data delivery to a moving gateway. Our approach tracks the distance of the gateway from the last hops to the gateway, and dynamically adjust the routes either via increasing the last hop nodes' radio ranges or introducing new forwarder nodes as part of the routes. Rerouting is triggered when the current
26.
Kemal Akkaya, Mohamed Younis
Energy‐aware delay‐constrained routing in wireless sensor networks Journal Article
In: International Journal of Communication Systems, vol. 17, iss. 6, no. 6, pp. 663–687, 2004.
Abstract | Links | BibTeX | Tags: Wireless Networking
@article{nokey,
title = {Energy‐aware delay‐constrained routing in wireless sensor networks},
author = {Kemal Akkaya and Mohamed Younis},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/dac.673},
year = {2004},
date = {2004-08-00},
journal = {International Journal of Communication Systems},
volume = {17},
number = {6},
issue = {6},
pages = {663–687},
publisher = {John Wiley & Sons, Ltd.},
school = {Florida International University},
abstract = {Recent years has witnessed a growing interest in the applications of unattended wireless sensor networks. Due to the limitation of the energy supply that sensors have, almost all of the proposed routing protocols have aimed at energy efficiency as the ultimate objective and considered relaying data to a stationary gateway (sink). However, many new issues have been posed by the increasing interest in applications that demand certain quality of service (QoS) guarantees. Such issues even get more challenging when the gateway is mobile. In this paper, we propose an energyaware approach for routing delayconstrained data. The approach pursues multihop packet relaying to minimize transmission energy and employs weighted fair queuing (WFQ) packet scheduling methodology along with leaky bucket constrained data sources in order to provide soft realtime guarantees for data delivery. Such employment},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {article}
}
Recent years has witnessed a growing interest in the applications of unattended wireless sensor networks. Due to the limitation of the energy supply that sensors have, almost all of the proposed routing protocols have aimed at energy efficiency as the ultimate objective and considered relaying data to a stationary gateway (sink). However, many new issues have been posed by the increasing interest in applications that demand certain quality of service (QoS) guarantees. Such issues even get more challenging when the gateway is mobile. In this paper, we propose an energyaware approach for routing delayconstrained data. The approach pursues multihop packet relaying to minimize transmission energy and employs weighted fair queuing (WFQ) packet scheduling methodology along with leaky bucket constrained data sources in order to provide soft realtime guarantees for data delivery. Such employment
27.
M. Younis, K. Akkaya, M. Eltoweissy, A. Wadaa
On handling QoS traffic in wireless sensor networks Proceedings Article
In: Proceedings of the 37th Annual Hawaii International Conference on System Sciences, 2004., 2004.
Abstract | Links | BibTeX | Tags: Wireless Networking
@inproceedings{nokey,
title = {On handling QoS traffic in wireless sensor networks},
author = {M. Younis and K. Akkaya and M. Eltoweissy and A. Wadaa},
url = {https://ieeexplore.ieee.org/abstract/document/1265688/},
year = {2004},
date = {2004-00-00},
booktitle = {Proceedings of the 37th Annual Hawaii International Conference on System Sciences, 2004.},
school = {Florida International University},
abstract = {Many new routing and MAC layer protocols have been proposed for wireless sensor networks tackling the issues raised by the resource constrained unattended sensor nodes in large-scale deployments. The majority of these protocols considered energy efficiency as the main objective and assumed data traffic with unconstrained delivery requirements. However, the growing interest in applications that demand certain end-to-end performance guarantees and the introduction of imaging and video sensors have posed additional challenges. Transmission of data in such cases requires both energy and QoS aware network management in order to ensure efficient usage of the sensor resources and effective access to the gathered measurements. In this paper, we highlight the architectural and operational challenges of handling of QoS traffic in sensor networks. We report on progress make to-date and outline open},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {inproceedings}
}
Many new routing and MAC layer protocols have been proposed for wireless sensor networks tackling the issues raised by the resource constrained unattended sensor nodes in large-scale deployments. The majority of these protocols considered energy efficiency as the main objective and assumed data traffic with unconstrained delivery requirements. However, the growing interest in applications that demand certain end-to-end performance guarantees and the introduction of imaging and video sensors have posed additional challenges. Transmission of data in such cases requires both energy and QoS aware network management in order to ensure efficient usage of the sensor resources and effective access to the gathered measurements. In this paper, we highlight the architectural and operational challenges of handling of QoS traffic in sensor networks. We report on progress make to-date and outline open
28.
Kemal Akkaya, Mohamed Younis
An energy-aware QoS routing protocol for wireless sensor networks Proceedings Article
In: 23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings., pp. 710–715, IEEE, 2003.
Abstract | Links | BibTeX | Tags: Wireless Networking
@inproceedings{nokey,
title = {An energy-aware QoS routing protocol for wireless sensor networks},
author = {Kemal Akkaya and Mohamed Younis},
url = {https://ieeexplore.ieee.org/abstract/document/1203636/},
year = {2003},
date = {2003-05-19},
booktitle = {23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings.},
pages = {710–715},
publisher = {IEEE},
school = {Florida International University},
abstract = {Recent advances in wireless sensor networks have led to many new routing protocols specifically designed for sensor networks. Almost all of these routing protocols considered energy efficiency as the ultimate objective in order to maximize the whole network lifetime. However, the introduction of video and imaging sensors has posed additional challenges. Transmission of video and imaging data requires both energy and QoS aware routing in order to ensure efficient usage of the sensors and effective access to the gathered measurements. In this paper, we propose an energy-aware QoS routing protocol, which can also run efficiently with best-effort traffic. The protocol finds a least-cost, delay-constrained path for real-time data in terms of link cost that captures nodes' energy reserve, transmission energy, error rate and other communication parameters. Moreover, throughput for non-real-time data is maximized by},
keywords = {Wireless Networking},
pubstate = {published},
tppubtype = {inproceedings}
}
Recent advances in wireless sensor networks have led to many new routing protocols specifically designed for sensor networks. Almost all of these routing protocols considered energy efficiency as the ultimate objective in order to maximize the whole network lifetime. However, the introduction of video and imaging sensors has posed additional challenges. Transmission of video and imaging data requires both energy and QoS aware routing in order to ensure efficient usage of the sensors and effective access to the gathered measurements. In this paper, we propose an energy-aware QoS routing protocol, which can also run efficiently with best-effort traffic. The protocol finds a least-cost, delay-constrained path for real-time data in terms of link cost that captures nodes' energy reserve, transmission energy, error rate and other communication parameters. Moreover, throughput for non-real-time data is maximized by
Citations: 18671
h-index: 54
i10-index: 162