1.
Fatih Senel, Kemal Akkaya, Melike Erol-Kantarci, Turgay Yilmaz
Self-deployment of mobile underwater acoustic sensor networks for maximized coverage and guaranteed connectivity Journal Article
In: Ad Hoc Networks, vol. 34, pp. 170–183, 2015.
Abstract | Links | BibTeX | Tags: Node Placement
@article{nokey,
title = {Self-deployment of mobile underwater acoustic sensor networks for maximized coverage and guaranteed connectivity},
author = {Fatih Senel and Kemal Akkaya and Melike Erol-Kantarci and Turgay Yilmaz},
url = {https://www.sciencedirect.com/science/article/pii/S1570870514002029},
year = {2015},
date = {2015-11-01},
journal = {Ad Hoc Networks},
volume = {34},
pages = {170–183},
publisher = {Elsevier},
school = {Florida International University},
abstract = {Self-deployment of sensors with maximized coverage in Underwater Acoustic Sensor Networks (UWASNs) is challenging due to difficulty of access to 3-D underwater environments. The problem is further compounded if the connectivity of the final network is desired. One possible approach to this problem is to drop the sensors on the water surface and then move them to certain depths in the water to maximize the 3-D coverage while maintaining the initial connectivity. In this paper, we propose a fully distributed node deployment scheme for UWASNs which only requires random dropping of sensors on the water surface. The idea is based on determining the connected dominating set (CDS) of the initial network on the surface and then adjust the depths of all neighbors of a particular dominator node (i.e., the backbone of the network) for minimizing the coverage overlaps among them while still keeping the},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {article}
}
Self-deployment of sensors with maximized coverage in Underwater Acoustic Sensor Networks (UWASNs) is challenging due to difficulty of access to 3-D underwater environments. The problem is further compounded if the connectivity of the final network is desired. One possible approach to this problem is to drop the sensors on the water surface and then move them to certain depths in the water to maximize the 3-D coverage while maintaining the initial connectivity. In this paper, we propose a fully distributed node deployment scheme for UWASNs which only requires random dropping of sensors on the water surface. The idea is based on determining the connected dominating set (CDS) of the initial network on the surface and then adjust the depths of all neighbors of a particular dominator node (i.e., the backbone of the network) for minimizing the coverage overlaps among them while still keeping the
2.
Giirkan Solmaz, Kemal Akkaya, Danila Turgut
Communication-constrained p-center problem for event coverage in theme parks Proceedings Article
In: 2014 IEEE Global Communications Conference, pp. 486–491, IEEE, 2014.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {Communication-constrained p-center problem for event coverage in theme parks},
author = {Giirkan Solmaz and Kemal Akkaya and Danila Turgut},
url = {https://ieeexplore.ieee.org/abstract/document/7036855/},
year = {2014},
date = {2014-12-08},
booktitle = {2014 IEEE Global Communications Conference},
pages = {486–491},
publisher = {IEEE},
school = {Florida International University},
abstract = {Wireless sensor networks with mobile sinks can be deployed for efficient handling of the events that may occur in a theme park. In such a case, the success of event handling depends on the positions of the mobile sinks and the selection of the most suitable sink to cover an event. While this problem can be solved by using the classical vertex p-center problem, such a solution does not guarantee connectivity among the mobile sinks. The connectivity among mobile sinks is crucial since they need to communicate to share information and perform collaborative event handling. In this paper, we introduce a new variant of vertex p-center problem which we name communication-constrained p-center problem. We propose an exact algorithm as a solution based on identifying connected subnets among the vertices. The performance of the proposed solution is validated through simulations with respect to other approaches},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
Wireless sensor networks with mobile sinks can be deployed for efficient handling of the events that may occur in a theme park. In such a case, the success of event handling depends on the positions of the mobile sinks and the selection of the most suitable sink to cover an event. While this problem can be solved by using the classical vertex p-center problem, such a solution does not guarantee connectivity among the mobile sinks. The connectivity among mobile sinks is crucial since they need to communicate to share information and perform collaborative event handling. In this paper, we introduce a new variant of vertex p-center problem which we name communication-constrained p-center problem. We propose an exact algorithm as a solution based on identifying connected subnets among the vertices. The performance of the proposed solution is validated through simulations with respect to other approaches
3.
Izzet F Senturk, Kemal Akkaya
Connectivity restoration in disjoint Wireless Sensor Networks using centrality measures Proceedings Article
In: 39th Annual IEEE Conference on Local Computer Networks Workshops, pp. 616–622, IEEE, 2014.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {Connectivity restoration in disjoint Wireless Sensor Networks using centrality measures},
author = {Izzet F Senturk and Kemal Akkaya},
url = {https://ieeexplore.ieee.org/abstract/document/6927711/},
year = {2014},
date = {2014-09-08},
booktitle = {39th Annual IEEE Conference on Local Computer Networks Workshops},
pages = {616–622},
publisher = {IEEE},
school = {Florida International University},
abstract = {In Mobile Sensor Networks (MSNs), connectivity of the sensor nodes with the sink node must be maintained at all times in order to sustain network operations. However, due to the depletion of limited on-board batteries and the exposure of the nodes to harsh environmental conditions, network can be subject to random node failures. While some of the failures can be compensated with redundancy, failure of the cut-vertex nodes renders the network partitioned. In order to restore connectivity with the sink, network structure can be updated through mobility of the nodes. However, mobility incurs excessive energy consumption and therefore, movement cost must be limited so that the network lifetime can be extended. In this paper, we present two approaches based on centrality metrics, which are commonly used in social network analysis. By applying these algorithms, we assess the relative importance of the nodes in a},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
In Mobile Sensor Networks (MSNs), connectivity of the sensor nodes with the sink node must be maintained at all times in order to sustain network operations. However, due to the depletion of limited on-board batteries and the exposure of the nodes to harsh environmental conditions, network can be subject to random node failures. While some of the failures can be compensated with redundancy, failure of the cut-vertex nodes renders the network partitioned. In order to restore connectivity with the sink, network structure can be updated through mobility of the nodes. However, mobility incurs excessive energy consumption and therefore, movement cost must be limited so that the network lifetime can be extended. In this paper, we present two approaches based on centrality metrics, which are commonly used in social network analysis. By applying these algorithms, we assess the relative importance of the nodes in a
4.
Izzet F Senturk, Kemal Akkaya, Sabri Yilmaz
Relay placement for restoring connectivity in partitioned wireless sensor networks under limited information Journal Article
In: Ad Hoc Networks, vol. 13, pp. 487–503, 2014.
Abstract | Links | BibTeX | Tags: Node Placement
@article{nokey,
title = {Relay placement for restoring connectivity in partitioned wireless sensor networks under limited information},
author = {Izzet F Senturk and Kemal Akkaya and Sabri Yilmaz},
url = {https://www.sciencedirect.com/science/article/pii/S1570870513002084},
year = {2014},
date = {2014-02-01},
journal = {Ad Hoc Networks},
volume = {13},
pages = {487–503},
publisher = {Elsevier},
school = {Florida International University},
abstract = {Several factors such as initial deployment, battery depletion or hardware failures can cause partition wireless sensor networks (WSNs). This results in most of the sensors losing connectivity with the sink node and thus creating disruption of the delivery of the data. To restore connectivity, one possible solution is populating relay nodes to connect the partitions. However, this solution requires information regarding the availability of the damaged area, number of partitions in the network and the location of the remaining nodes which may not be obtained for all applications. Thus, a distributed self-deployment strategy may better fit the application requirements. In this paper, we propose two distributed relay node positioning approaches to guarantee network recovery for partitioned WSNs by minimizing the movement cost of the relay nodes. The first approach is based on virtual force-based movements of relays while the},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {article}
}
Several factors such as initial deployment, battery depletion or hardware failures can cause partition wireless sensor networks (WSNs). This results in most of the sensors losing connectivity with the sink node and thus creating disruption of the delivery of the data. To restore connectivity, one possible solution is populating relay nodes to connect the partitions. However, this solution requires information regarding the availability of the damaged area, number of partitions in the network and the location of the remaining nodes which may not be obtained for all applications. Thus, a distributed self-deployment strategy may better fit the application requirements. In this paper, we propose two distributed relay node positioning approaches to guarantee network recovery for partitioned WSNs by minimizing the movement cost of the relay nodes. The first approach is based on virtual force-based movements of relays while the
5.
Mohamed Younis, Izzet F Senturk, Kemal Akkaya, Sookyoung Lee, Fatih Senel
Topology management techniques for tolerating node failures in wireless sensor networks: A survey Journal Article
In: Computer networks, vol. 58, pp. 254–283, 2014.
Abstract | Links | BibTeX | Tags: Node Placement
@article{nokey,
title = {Topology management techniques for tolerating node failures in wireless sensor networks: A survey},
author = {Mohamed Younis and Izzet F Senturk and Kemal Akkaya and Sookyoung Lee and Fatih Senel},
url = {https://www.sciencedirect.com/science/article/pii/S1389128613002879},
year = {2014},
date = {2014-01-15},
journal = {Computer networks},
volume = {58},
pages = {254–283},
publisher = {Elsevier},
school = {Florida International University},
abstract = {In wireless sensor networks (WSNs) nodes often operate unattended in a collaborative manner to perform some tasks. In many applications, the network is deployed in harsh environments such as battlefield where the nodes are susceptible to damage. In addition, nodes may fail due to energy depletion and breakdown in the onboard electronics. The failure of nodes may leave some areas uncovered and degrade the fidelity of the collected data. However, the most serious consequence is when the network gets partitioned into disjoint segments. Losing network connectivity has a very negative effect on the applications since it prevents data exchange and hinders coordination among some nodes. Therefore, restoring the overall network connectivity is very crucial. Given the resource-constrained setup, the recovery should impose the least overhead and performance impact. This paper focuses on network topology},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {article}
}
In wireless sensor networks (WSNs) nodes often operate unattended in a collaborative manner to perform some tasks. In many applications, the network is deployed in harsh environments such as battlefield where the nodes are susceptible to damage. In addition, nodes may fail due to energy depletion and breakdown in the onboard electronics. The failure of nodes may leave some areas uncovered and degrade the fidelity of the collected data. However, the most serious consequence is when the network gets partitioned into disjoint segments. Losing network connectivity has a very negative effect on the applications since it prevents data exchange and hinders coordination among some nodes. Therefore, restoring the overall network connectivity is very crucial. Given the resource-constrained setup, the recovery should impose the least overhead and performance impact. This paper focuses on network topology
6.
Izzet F Senturk, Kemal Akkaya
Energy and coverage trade-offs in deploying a mix of mobile and stationary relays for disjoint Wireless Sensor Networks Proceedings Article
In: 2013 IEEE Global Communications Conference (GLOBECOM), pp. 249–254, IEEE, 2013.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {Energy and coverage trade-offs in deploying a mix of mobile and stationary relays for disjoint Wireless Sensor Networks},
author = {Izzet F Senturk and Kemal Akkaya},
url = {https://ieeexplore.ieee.org/abstract/document/6831079/},
year = {2013},
date = {2013-12-09},
booktitle = {2013 IEEE Global Communications Conference (GLOBECOM)},
pages = {249–254},
publisher = {IEEE},
school = {Florida International University},
abstract = {Additional relay nodes (RNs) can be deployed within a partitioned Wireless Sensor Network (WSN) to restore connectivity among the partitions. In the case of lack of sufficient RNs to link all the partitions, some of the RNs can act as mobile data collectors (MDCs) to visit partitions for providing intermittent connection for the nodes. Determining the number of MDCs and stationary RNs is a challenge that deals with the trade-off between minimizing the maximum tour length and maximizing the coverage provided by both sensors and the stationary RNs. This paper proposes an RN placement algorithm to guarantee network connectivity while striving to balance the number of MDCs and stationary RNs so that the maximum tour length of MDCs is minimized and an imposed coverage constraint is satisfied. The proposed approach first determines Steiner points to connect partitions by using a Steiner Minimum Tree (SMT},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
Additional relay nodes (RNs) can be deployed within a partitioned Wireless Sensor Network (WSN) to restore connectivity among the partitions. In the case of lack of sufficient RNs to link all the partitions, some of the RNs can act as mobile data collectors (MDCs) to visit partitions for providing intermittent connection for the nodes. Determining the number of MDCs and stationary RNs is a challenge that deals with the trade-off between minimizing the maximum tour length and maximizing the coverage provided by both sensors and the stationary RNs. This paper proposes an RN placement algorithm to guarantee network connectivity while striving to balance the number of MDCs and stationary RNs so that the maximum tour length of MDCs is minimized and an imposed coverage constraint is satisfied. The proposed approach first determines Steiner points to connect partitions by using a Steiner Minimum Tree (SMT
7.
Fatih Senel, Kemal Akkaya, Turgay Yilmaz
Autonomous deployment of sensors for maximized coverage and guaranteed connectivity in underwater acoustic sensor networks Proceedings Article
In: 38th Annual IEEE Conference on Local Computer Networks, pp. 211–218, IEEE, 2013.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {Autonomous deployment of sensors for maximized coverage and guaranteed connectivity in underwater acoustic sensor networks},
author = {Fatih Senel and Kemal Akkaya and Turgay Yilmaz},
url = {https://ieeexplore.ieee.org/abstract/document/6761236/},
year = {2013},
date = {2013-10-21},
booktitle = {38th Annual IEEE Conference on Local Computer Networks},
pages = {211–218},
publisher = {IEEE},
school = {Florida International University},
abstract = {Self-deployment of sensors with maximized coverage in Underwater Acoustic Sensor Networks (UWASNs) is challenging due to difficulty of access to 3-D underwater environments. The problem is further compounded if the connectivity of the final network is required. One possible approach is to drop the sensors on the surface and then move them to certain depths in the water to maximize the 3-D coverage while maintaining the connectivity. In this paper, we propose a purely distributed node deployment scheme for UWASNs which only requires random dropping of sensors on the water surface. The goal is to expand the initial network to 3-D with maximized coverage and guaranteed connectivity with a surface station. The idea is based on determining the connected dominating set of the initial network and then adjust the depths of all dominatee and dominator neighbors of a particular dominator node for},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
Self-deployment of sensors with maximized coverage in Underwater Acoustic Sensor Networks (UWASNs) is challenging due to difficulty of access to 3-D underwater environments. The problem is further compounded if the connectivity of the final network is required. One possible approach is to drop the sensors on the surface and then move them to certain depths in the water to maximize the 3-D coverage while maintaining the connectivity. In this paper, we propose a purely distributed node deployment scheme for UWASNs which only requires random dropping of sensors on the water surface. The goal is to expand the initial network to 3-D with maximized coverage and guaranteed connectivity with a surface station. The idea is based on determining the connected dominating set of the initial network and then adjust the depths of all dominatee and dominator neighbors of a particular dominator node for
8.
Izzet F Senturk, Kemal Akkaya, Fatih Senel, Mohamed Younis
Connectivity restoration in disjoint wireless sensor networks using limited number of mobile relays Proceedings Article
In: 2013 IEEE International Conference on Communications (ICC), pp. 1630–1634, IEEE, 2013.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {Connectivity restoration in disjoint wireless sensor networks using limited number of mobile relays},
author = {Izzet F Senturk and Kemal Akkaya and Fatih Senel and Mohamed Younis},
url = {https://ieeexplore.ieee.org/abstract/document/6654749/},
year = {2013},
date = {2013-06-09},
booktitle = {2013 IEEE International Conference on Communications (ICC)},
pages = {1630–1634},
publisher = {IEEE},
school = {Florida International University},
abstract = {Disjoint Wireless Sensor Networks (WSNs) can be reconnected by placing additional relay nodes in the damaged areas. However, in some cases there may not be enough relays to reconnect all the partitions with the sink node. In such a case, some of the relays can exploit their motion capabilities and temporarily act as a mobile data collector (MDC) between partitions providing intermittent connectivity for the nodes sitting in those partitions. Nonetheless, due to increased data latency intermittent connectivity creates, the number of such MDCs need to be minimized. On the other hand, given that the energy resources for an MDC is limited, an upper bound on the travel distance overhead for an MDC needs to be imposed. This paper proposes a relay placement algorithm which guarantees connectivity by maximizing the number of stable connections while meeting the maximum tour constraint on the MDCs. The},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
Disjoint Wireless Sensor Networks (WSNs) can be reconnected by placing additional relay nodes in the damaged areas. However, in some cases there may not be enough relays to reconnect all the partitions with the sink node. In such a case, some of the relays can exploit their motion capabilities and temporarily act as a mobile data collector (MDC) between partitions providing intermittent connectivity for the nodes sitting in those partitions. Nonetheless, due to increased data latency intermittent connectivity creates, the number of such MDCs need to be minimized. On the other hand, given that the energy resources for an MDC is limited, an upper bound on the travel distance overhead for an MDC needs to be imposed. This paper proposes a relay placement algorithm which guarantees connectivity by maximizing the number of stable connections while meeting the maximum tour constraint on the MDCs. The
9.
Enes Yildiz, Kemal Akkaya, Esra Sisikoglu, Mustafa Y Sir
Optimal camera placement for providing angular coverage in wireless video sensor networks Proceedings Article
In: pp. 1812–1825, IEEE, 2013.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {Optimal camera placement for providing angular coverage in wireless video sensor networks},
author = {Enes Yildiz and Kemal Akkaya and Esra Sisikoglu and Mustafa Y Sir},
url = {https://ieeexplore.ieee.org/abstract/document/6471967/},
year = {2013},
date = {2013-03-07},
journal = {IEEE transactions on computers},
volume = {63},
number = {7},
issue = {7},
pages = {1812–1825},
publisher = {IEEE},
school = {Florida International University},
abstract = {Wireless Video Sensor Networks (WVSNs) provide opportunities to use large number of low-cost low-resolution wireless camera sensors for large-scale outdoor remote surveillance missions. Camera sensor deployment is crucial in achieving good coverage, accuracy and fault tolerance. In particular, with the decreased costs of wireless cameras, redundant camera deployment is attractive in order to get multiple disparate views of events for improved event identification. If the capturing of an event spans , this is referred to as angular coverage. In this paper, we consider the problem of determining optimal camera placement to achieve angular coverage continuously over a given region. We develop a bi-level algorithm to find the minimum-cost camera placement. In the first level, we run a master problem that identifies the camera placement points to achieve angular coverage of a discrete set of points selected},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
Wireless Video Sensor Networks (WVSNs) provide opportunities to use large number of low-cost low-resolution wireless camera sensors for large-scale outdoor remote surveillance missions. Camera sensor deployment is crucial in achieving good coverage, accuracy and fault tolerance. In particular, with the decreased costs of wireless cameras, redundant camera deployment is attractive in order to get multiple disparate views of events for improved event identification. If the capturing of an event spans , this is referred to as angular coverage. In this paper, we consider the problem of determining optimal camera placement to achieve angular coverage continuously over a given region. We develop a bi-level algorithm to find the minimum-cost camera placement. In the first level, we run a master problem that identifies the camera placement points to achieve angular coverage of a discrete set of points selected
10.
Izzet F Senturk, Kemal Akkaya, Sabri Yilmaz
Distributed relay node positioning for connectivity restoration in partitioned wireless sensor networks Proceedings Article
In: 2012 IEEE symposium on computers and communications (ISCC), pp. 000301–000306, IEEE, 2012.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {Distributed relay node positioning for connectivity restoration in partitioned wireless sensor networks},
author = {Izzet F Senturk and Kemal Akkaya and Sabri Yilmaz},
url = {https://ieeexplore.ieee.org/abstract/document/6249312/},
year = {2012},
date = {2012-07-01},
booktitle = {2012 IEEE symposium on computers and communications (ISCC)},
pages = {000301–000306},
publisher = {IEEE},
school = {Florida International University},
abstract = {Due to limited battery life of sensors and harsh deployment environments where they are deployed, Wireless Sensor Networks (WSNs) can be subjected to node failures. This can split the network into partitions containing healthy but unreachable nodes by the rest of the network including the sink node. One possible solution to this problem is deploying relay nodes assuming that the damaged area, the number of partitions and the location of the partitions are known to a centralized party. However, depending on the application, some of this information may not always be available, requiring a distributed self-deployment placement strategy. Such a strategy should not only guarantee the network connectivity but also strive to minimize the movement overhead on the relay nodes assuming that they are also battery-operated. In this paper, we present a distributed relay node positioning approach to address the problem},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
Due to limited battery life of sensors and harsh deployment environments where they are deployed, Wireless Sensor Networks (WSNs) can be subjected to node failures. This can split the network into partitions containing healthy but unreachable nodes by the rest of the network including the sink node. One possible solution to this problem is deploying relay nodes assuming that the damaged area, the number of partitions and the location of the partitions are known to a centralized party. However, depending on the application, some of this information may not always be available, requiring a distributed self-deployment placement strategy. Such a strategy should not only guarantee the network connectivity but also strive to minimize the movement overhead on the relay nodes assuming that they are also battery-operated. In this paper, we present a distributed relay node positioning approach to address the problem
11.
Enes Yildiz, Kemal Akkaya, Esra Sisikoglu, Mustafa Sir, Ismail Guneydas
Camera deployment for video panorama generation in wireless visual sensor networks Proceedings Article
In: 2011 IEEE International Symposium on Multimedia, pp. 595–600, IEEE, 2011.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {Camera deployment for video panorama generation in wireless visual sensor networks},
author = {Enes Yildiz and Kemal Akkaya and Esra Sisikoglu and Mustafa Sir and Ismail Guneydas},
url = {https://ieeexplore.ieee.org/abstract/document/6123413/},
year = {2011},
date = {2011-12-05},
booktitle = {2011 IEEE International Symposium on Multimedia},
pages = {595–600},
publisher = {IEEE},
school = {Florida International University},
abstract = {In this paper, we tackle the problem of providing coverage for video panorama generation in Wireless Heterogeneous Visual Sensor Networks (VSNs) where cameras may have different price, resolution, Field-of-View (FoV) and Depth-of-Field (DoF). We utilize multi-perspective coverage (MPC) which refers to the coverage of a point from given disparate perspectives simultaneously. For a given minimum average resolution, area boundaries, and variety of camera sensors, we propose a deployment algorithm which minimizes the total cost while guaranteeing full MPC of the area (i.e., the coverage needed for video panorama generation) and the minimum required resolution. Specifically, the approach is based on a bi-level mixed integer program (MIP), which runs two models, namely master problem and sub-problem, iteratively. Master-problem provides coverage for initial set of identified points while meeting the},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we tackle the problem of providing coverage for video panorama generation in Wireless Heterogeneous Visual Sensor Networks (VSNs) where cameras may have different price, resolution, Field-of-View (FoV) and Depth-of-Field (DoF). We utilize multi-perspective coverage (MPC) which refers to the coverage of a point from given disparate perspectives simultaneously. For a given minimum average resolution, area boundaries, and variety of camera sensors, we propose a deployment algorithm which minimizes the total cost while guaranteeing full MPC of the area (i.e., the coverage needed for video panorama generation) and the minimum required resolution. Specifically, the approach is based on a bi-level mixed integer program (MIP), which runs two models, namely master problem and sub-problem, iteratively. Master-problem provides coverage for initial set of identified points while meeting the
12.
Enes Yildiz, Kemal Akkaya, Esra Sisikoglu, Mustafa Sir
An exact algorithm for providing multi-perspective event coverage in wireless multimedia sensor networks Proceedings Article
In: 2011 7th International Wireless Communications and Mobile Computing Conference, pp. 382–387, IEEE, 2011.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {An exact algorithm for providing multi-perspective event coverage in wireless multimedia sensor networks},
author = {Enes Yildiz and Kemal Akkaya and Esra Sisikoglu and Mustafa Sir},
url = {https://ieeexplore.ieee.org/abstract/document/5982564/},
year = {2011},
date = {2011-07-04},
booktitle = {2011 7th International Wireless Communications and Mobile Computing Conference},
pages = {382–387},
publisher = {IEEE},
school = {Florida International University},
abstract = {Deployment of cameras in Wireless Multimedia Sensor Networks (WMSNs) is crucial in achieving good coverage, accuracy and fault tolerance. With the decreased costs of wireless cameras, WMSNs provide opportunities for redundant camera deployment in order to get multiple disparate views of events. Referred to as multi-perspective coverage (MPC), this paper proposes an optimal solution for camera deployment that can achieve full MPC for a given region. The solution is based on a Bi-Level mixed integer program (MIP) which works by solving two sub-problems named master and sub-problems. The master problem identifies a solution based on an initial set of points and then calls the sub-problem to cover the uncovered points iteratively. Experiments show that our solution can provide full MPC with less number of cameras compared to traditional solutions.},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
Deployment of cameras in Wireless Multimedia Sensor Networks (WMSNs) is crucial in achieving good coverage, accuracy and fault tolerance. With the decreased costs of wireless cameras, WMSNs provide opportunities for redundant camera deployment in order to get multiple disparate views of events. Referred to as multi-perspective coverage (MPC), this paper proposes an optimal solution for camera deployment that can achieve full MPC for a given region. The solution is based on a Bi-Level mixed integer program (MIP) which works by solving two sub-problems named master and sub-problems. The master problem identifies a solution based on an initial set of points and then calls the sub-problem to cover the uncovered points iteratively. Experiments show that our solution can provide full MPC with less number of cameras compared to traditional solutions.
13.
Fatih Senel, Mohamed F Younis, Kemal Akkaya
Bio-inspired relay node placement heuristics for repairing damaged wireless sensor networks Proceedings Article
In: pp. 1835–1848, IEEE, 2011.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {Bio-inspired relay node placement heuristics for repairing damaged wireless sensor networks},
author = {Fatih Senel and Mohamed F Younis and Kemal Akkaya},
url = {https://ieeexplore.ieee.org/abstract/document/5740998/},
year = {2011},
date = {2011-04-05},
journal = {IEEE Transactions on Vehicular Technology},
volume = {60},
number = {4},
issue = {4},
pages = {1835–1848},
publisher = {IEEE},
school = {Florida International University},
abstract = {Due to the harsh surroundings and violent nature of wireless sensor network (WSN) applications, the network sometimes suffers a large-scale damage that involves several nodes and would thus create multiple disjoint partitions. This paper investigates a strategy for recovering from such damage through the placement of relay nodes (RNs) and promotes a novel approach. The proposed approach opts to reestablish connectivity (i.e., 1-vertex connectivity) using the least number of relays while ensuring a certain quality in the formed topology. Unlike contemporary schemes that often form a minimum spanning tree among the isolated segments, the proposed approach establishes a topology that resembles a spider web, for which the segments are situated at the perimeter. Such a topology not only exhibits stronger connectivity than a minimum spanning tree but achieves better sensor coverage and enables balanced},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
Due to the harsh surroundings and violent nature of wireless sensor network (WSN) applications, the network sometimes suffers a large-scale damage that involves several nodes and would thus create multiple disjoint partitions. This paper investigates a strategy for recovering from such damage through the placement of relay nodes (RNs) and promotes a novel approach. The proposed approach opts to reestablish connectivity (i.e., 1-vertex connectivity) using the least number of relays while ensuring a certain quality in the formed topology. Unlike contemporary schemes that often form a minimum spanning tree among the isolated segments, the proposed approach establishes a topology that resembles a spider web, for which the segments are situated at the perimeter. Such a topology not only exhibits stronger connectivity than a minimum spanning tree but achieves better sensor coverage and enables balanced
14.
Kemal Akkaya, Ismail Guneydas, Ali Bicak
Autonomous actor positioning in wireless sensor and actor networks using stable-matching Journal Article
In: International Journal of Parallel, Emergent and Distributed Systems, vol. 25, iss. 6, no. 6, pp. 439–464, 2010.
Abstract | Links | BibTeX | Tags: Node Placement
@article{nokey,
title = {Autonomous actor positioning in wireless sensor and actor networks using stable-matching},
author = {Kemal Akkaya and Ismail Guneydas and Ali Bicak},
url = {https://www.tandfonline.com/doi/abs/10.1080/17445760903548283},
year = {2010},
date = {2010-12-01},
journal = {International Journal of Parallel, Emergent and Distributed Systems},
volume = {25},
number = {6},
issue = {6},
pages = {439–464},
publisher = {Taylor & Francis Group},
school = {Florida International University},
abstract = {In most of the wireless sensor and actor network applications, it is desirable to have an autonomous process for positioning the actors in order to eliminate human intervention as much as possible. For this purpose, sensors and actors deployed in an area of interest can collaborate in a distributed manner. Typically, sensors can instruct actors for their positioning in the area by considering the application level interests. This instruction is based on selecting representative sensor locations. One of the most common ways of selecting such representative locations is to cluster the network and determine cluster heads (CHs) as representatives. The actors can then move to such CH locations by talking to nearby sensors/actors. Such movement, however, should be done wisely in order to minimise the movement distance of actors so that their lifetimes can be extended. Nevertheless, this may not be possible since not all the},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {article}
}
In most of the wireless sensor and actor network applications, it is desirable to have an autonomous process for positioning the actors in order to eliminate human intervention as much as possible. For this purpose, sensors and actors deployed in an area of interest can collaborate in a distributed manner. Typically, sensors can instruct actors for their positioning in the area by considering the application level interests. This instruction is based on selecting representative sensor locations. One of the most common ways of selecting such representative locations is to cluster the network and determine cluster heads (CHs) as representatives. The actors can then move to such CH locations by talking to nearby sensors/actors. Such movement, however, should be done wisely in order to minimise the movement distance of actors so that their lifetimes can be extended. Nevertheless, this may not be possible since not all the
15.
Andrew Newell, Kemal Akkaya, Enes Yildiz
Providing multi-perspective event coverage in wireless multimedia sensor networks Proceedings Article
In: IEEE Local Computer Network Conference, pp. 464–471, IEEE, 2010.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {Providing multi-perspective event coverage in wireless multimedia sensor networks},
author = {Andrew Newell and Kemal Akkaya and Enes Yildiz},
url = {https://ieeexplore.ieee.org/abstract/document/5735760/},
year = {2010},
date = {2010-10-10},
booktitle = {IEEE Local Computer Network Conference},
pages = {464–471},
publisher = {IEEE},
school = {Florida International University},
abstract = {The increasing availability of low-cost battery-operated wireless cameras has motivated the deployment of large-scale Wireless Multimedia Sensor Networks (WMSNs) which can be leveraged for gathering disparate views of events from multiple perspectives. Such multi-perspective coverage not only provides better visual knowledge about the events but also helps reduce occlusions in many critical applications. Different than traditional k-coverage in Wireless Sensor Networks (WSNs), multi-perspective coverage computation considers the orientation of cameras in addition to their locations. In this paper, we first introduce a new metric which can measure multi-perspective coverage for a particular region from a given number of perspectives. Using this metric, we then propose camera placement techniques based on binary integer programming and heuristics to achieve full multi-perspective coverage with the least},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
The increasing availability of low-cost battery-operated wireless cameras has motivated the deployment of large-scale Wireless Multimedia Sensor Networks (WMSNs) which can be leveraged for gathering disparate views of events from multiple perspectives. Such multi-perspective coverage not only provides better visual knowledge about the events but also helps reduce occlusions in many critical applications. Different than traditional k-coverage in Wireless Sensor Networks (WSNs), multi-perspective coverage computation considers the orientation of cameras in addition to their locations. In this paper, we first introduce a new metric which can measure multi-perspective coverage for a particular region from a given number of perspectives. Using this metric, we then propose camera placement techniques based on binary integer programming and heuristics to achieve full multi-perspective coverage with the least
16.
Fatih Senel, Mohamed Younis, Kemal Akkaya
A robust relay node placement heuristic for structurally damaged wireless sensor networks Proceedings Article
In: 2009 IEEE 34th Conference on Local Computer Networks, pp. 633–640, IEEE, 2009.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {A robust relay node placement heuristic for structurally damaged wireless sensor networks},
author = {Fatih Senel and Mohamed Younis and Kemal Akkaya},
url = {https://ieeexplore.ieee.org/abstract/document/5355121/},
year = {2009},
date = {2009-10-20},
booktitle = {2009 IEEE 34th Conference on Local Computer Networks},
pages = {633–640},
publisher = {IEEE},
school = {Florida International University},
abstract = {Wireless sensor networks (WSN) can increase the efficiency of many real-life applications through the collaboration of thousands of miniaturized sensors which can be deployed unattended in inhospitable environments. Due to the harsh surroundings and violent nature of the applications, the network sometimes suffers a large scale damage that involves many nodes and would thus create multiple disjoint partitions. This paper investigates a strategy for recovering from such damage through the placement of relay nodes and promotes a novel approach. The proposed approach opts to re-establish connectivity using the least number of relays while ensuring certain quality in the formed topology. Unlike contemporary schemes that form a minimum spanning tree among the isolated segments, the proposed approach establishes a topology that resembles a spider web, for which the segments are situated at the},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
Wireless sensor networks (WSN) can increase the efficiency of many real-life applications through the collaboration of thousands of miniaturized sensors which can be deployed unattended in inhospitable environments. Due to the harsh surroundings and violent nature of the applications, the network sometimes suffers a large scale damage that involves many nodes and would thus create multiple disjoint partitions. This paper investigates a strategy for recovering from such damage through the placement of relay nodes and promotes a novel approach. The proposed approach opts to re-establish connectivity using the least number of relays while ensuring certain quality in the formed topology. Unlike contemporary schemes that form a minimum spanning tree among the isolated segments, the proposed approach establishes a topology that resembles a spider web, for which the segments are situated at the
17.
Ismail Guneydas, Kemal Akkaya, Ali Bicak
Actor positioning in wireless sensor and actor networks using matching theory Proceedings Article
In: 2009 29th IEEE International Conference on Distributed Computing Systems Workshops, pp. 88–95, IEEE, 2009.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {Actor positioning in wireless sensor and actor networks using matching theory},
author = {Ismail Guneydas and Kemal Akkaya and Ali Bicak},
url = {https://ieeexplore.ieee.org/abstract/document/5158838/},
year = {2009},
date = {2009-06-22},
booktitle = {2009 29th IEEE International Conference on Distributed Computing Systems Workshops},
pages = {88–95},
publisher = {IEEE},
school = {Florida International University},
abstract = {In most of the wireless sensor and actor network (WSAN) applications, the locations for the actors are determined autonomously by the collaboration of actors and/or sensors in order to eliminate human intervention as much as possible. Particularly, sensors can collaborate in a distributed manner and elect cluster-heads (CHs) among them based on certain criteria. The actors can then move to such CH locations by talking to nearby sensors/actors. Such movement, however, should be done wisely in order to minimize the movement distance of actors so that their lifetimes can be improved. Nevertheless, this may not be possible since not all the actor and CH locations will be known by each actor. In addition, the actors may not be reachable to each other and thus conflicts in assignments can easily occur. In this paper, we propose an actor-CH location matching algorithm which will assign the actors to appropriate CH},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
In most of the wireless sensor and actor network (WSAN) applications, the locations for the actors are determined autonomously by the collaboration of actors and/or sensors in order to eliminate human intervention as much as possible. Particularly, sensors can collaborate in a distributed manner and elect cluster-heads (CHs) among them based on certain criteria. The actors can then move to such CH locations by talking to nearby sensors/actors. Such movement, however, should be done wisely in order to minimize the movement distance of actors so that their lifetimes can be improved. Nevertheless, this may not be possible since not all the actor and CH locations will be known by each actor. In addition, the actors may not be reachable to each other and thus conflicts in assignments can easily occur. In this paper, we propose an actor-CH location matching algorithm which will assign the actors to appropriate CH
18.
Kemal Akkaya, Fatih Senel, Brian McLaughlan
Clustering of wireless sensor and actor networks based on sensor distribution and connectivity Journal Article
In: Journal of Parallel and Distributed Computing, vol. 69, iss. 6, no. 6, pp. 573–587, 2009.
Abstract | Links | BibTeX | Tags: Node Placement
@article{nokey,
title = {Clustering of wireless sensor and actor networks based on sensor distribution and connectivity},
author = {Kemal Akkaya and Fatih Senel and Brian McLaughlan},
url = {https://www.sciencedirect.com/science/article/pii/S074373150900029X},
year = {2009},
date = {2009-06-01},
journal = {Journal of Parallel and Distributed Computing},
volume = {69},
number = {6},
issue = {6},
pages = {573–587},
publisher = {Academic Press},
school = {Florida International University},
abstract = {Wireless Sensor and Actor Networks (WSANs) employ significantly more capable actor nodes that can collect data from sensors and perform application specific actions. To take these actions collaboratively at any spot in the monitored regions, maximal actor coverage along with inter-actor connectivity is desirable. In this paper, we propose a distributed actor positioning and clustering algorithm which employs actors as cluster-heads and places them in such a way that the coverage of actors is maximized and the data gathering and acting times are minimized. Such placement of actors is done by determining the k-hop Independent Dominating Set (IDS) of the underlying sensor network. Basically, before the actors are placed, the sensors pick the cluster-heads based on IDS. The actors are then placed at the locations of such cluster-heads. We further derive conditions to guarantee inter-actor connectivity after the},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {article}
}
Wireless Sensor and Actor Networks (WSANs) employ significantly more capable actor nodes that can collect data from sensors and perform application specific actions. To take these actions collaboratively at any spot in the monitored regions, maximal actor coverage along with inter-actor connectivity is desirable. In this paper, we propose a distributed actor positioning and clustering algorithm which employs actors as cluster-heads and places them in such a way that the coverage of actors is maximized and the data gathering and acting times are minimized. Such placement of actors is done by determining the k-hop Independent Dominating Set (IDS) of the underlying sensor network. Basically, before the actors are placed, the sensors pick the cluster-heads based on IDS. The actors are then placed at the locations of such cluster-heads. We further derive conditions to guarantee inter-actor connectivity after the
19.
Kemal Akkaya, Andrew Newell
Self-deployment of sensors for maximized coverage in underwater acoustic sensor networks Journal Article
In: Computer Communications, vol. 32, iss. 7-10, no. 7-10, pp. 1233–1244, 2009.
Abstract | Links | BibTeX | Tags: Node Placement
@article{nokey,
title = {Self-deployment of sensors for maximized coverage in underwater acoustic sensor networks},
author = {Kemal Akkaya and Andrew Newell},
url = {https://www.sciencedirect.com/science/article/pii/S0140366409001029},
year = {2009},
date = {2009-05-28},
journal = {Computer Communications},
volume = {32},
number = {7-10},
issue = {7-10},
pages = {1233–1244},
publisher = {Elsevier},
school = {Florida International University},
abstract = {While self-deployment/reconfiguration of terrestrial wireless sensor networks (WSNs) has been studied extensively, such self-organization has just started to receive attention for underwater acoustic sensor networks (UWSNs). Particularly, self-deployment of sensor nodes in UWSNs is challenging due to certain characteristics of UWSNs such as three dimensional (3-D) environment, restrictions on node movement and longer delays in communication. Given these characteristics, self-deployment of sensor nodes should not only ensure the necessary coverage but also guarantee the connectivity for data transmission as in the case of terrestrial WSNs. In this paper, we propose a distributed node deployment scheme which can increase the initial network coverage in an iterative basis. Assuming that the nodes are initially deployed at the bottom of the water and can only move in vertical direction in 3-D space, the idea},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {article}
}
While self-deployment/reconfiguration of terrestrial wireless sensor networks (WSNs) has been studied extensively, such self-organization has just started to receive attention for underwater acoustic sensor networks (UWSNs). Particularly, self-deployment of sensor nodes in UWSNs is challenging due to certain characteristics of UWSNs such as three dimensional (3-D) environment, restrictions on node movement and longer delays in communication. Given these characteristics, self-deployment of sensor nodes should not only ensure the necessary coverage but also guarantee the connectivity for data transmission as in the case of terrestrial WSNs. In this paper, we propose a distributed node deployment scheme which can increase the initial network coverage in an iterative basis. Assuming that the nodes are initially deployed at the bottom of the water and can only move in vertical direction in 3-D space, the idea
20.
KEMAL AKKAYA
Node Positioning for Increased Dependability of Wireless Sensor Journal Article
In: Algorithms and Protocols for Wireless Sensor Networks, vol. 62, pp. 225, 2009.
Abstract | Links | BibTeX | Tags: Node Placement
@article{nokey,
title = {Node Positioning for Increased Dependability of Wireless Sensor},
author = {KEMAL AKKAYA},
url = {https://scholar.google.com/scholar?cluster=16633159006514047057&hl=en&oi=scholarr},
year = {2009},
date = {2009-00-00},
journal = {Algorithms and Protocols for Wireless Sensor Networks},
volume = {62},
pages = {225},
publisher = {Wiley-IEEE Press},
school = {Florida International University},
abstract = {Advances in microelectronics have enabled the development of very tiny sensor nodes that have the ability of measuring ambient conditions such as temperature, pressure, humidity, light intensity, vibration, and so on. The sensed data can then be transmitted through an onboard radio transmitter to a single or multiple base stations where it can be further processed. The cost and size advantage of such emerging sensor nodes has encouraged practitioners to explore using them collaboratively in a network formed in ad hoc manner. Such networked sensor systems are a not only cost effective but can also provide fast and accurate information gathering in remote and risky areas. Figure 9.1 depicts a typical sensor network architecture. The base station acts as a gateway for linking the sensors to multiple command nodes.The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in applications such as disaster management, combat field reconnaissance, border protection, and security surveillance [1, 2]. Sensors in these applications are expected to be remotely deployed and to operate autonomously in unattended environments. While the initial view of the community was that WSNs will play a complementary role that enhances the quality of these applications, recent research results have encouraged practitioners to envision an increased reliance},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {article}
}
Advances in microelectronics have enabled the development of very tiny sensor nodes that have the ability of measuring ambient conditions such as temperature, pressure, humidity, light intensity, vibration, and so on. The sensed data can then be transmitted through an onboard radio transmitter to a single or multiple base stations where it can be further processed. The cost and size advantage of such emerging sensor nodes has encouraged practitioners to explore using them collaboratively in a network formed in ad hoc manner. Such networked sensor systems are a not only cost effective but can also provide fast and accurate information gathering in remote and risky areas. Figure 9.1 depicts a typical sensor network architecture. The base station acts as a gateway for linking the sensors to multiple command nodes.The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in applications such as disaster management, combat field reconnaissance, border protection, and security surveillance [1, 2]. Sensors in these applications are expected to be remotely deployed and to operate autonomously in unattended environments. While the initial view of the community was that WSNs will play a complementary role that enhances the quality of these applications, recent research results have encouraged practitioners to envision an increased reliance
21.
Mohamed Younis, Kemal Akkaya
Node positioning for increased dependability of wireless sensor networks Journal Article
In: Algorithms and protocols for wireless sensor networks, pp. 225–266, 2008.
Abstract | Links | BibTeX | Tags: Node Placement
@article{nokey,
title = {Node positioning for increased dependability of wireless sensor networks},
author = {Mohamed Younis and Kemal Akkaya},
url = {https://onlinelibrary.wiley.com/doi/pdf/10.1002/9780470396360#page=235},
year = {2008},
date = {2008-10-09},
journal = {Algorithms and protocols for wireless sensor networks},
pages = {225–266},
publisher = {John Wiley & Sons, Inc.},
school = {Florida International University},
abstract = {Advances in microelectronics have enabled the development of very tiny sensor nodes that have the ability of measuring ambient conditions such as temperature, pressure, humidity, light intensity, vibration, and so on. The sensed data can then be transmitted through an onboard radio transmitter to a single or multiple base stations where it can be further processed. The cost and size advantage of such emerging sensor nodes has encouraged practitioners to explore using them collaboratively in a network formed in ad hoc manner. Such networked sensor systems are not only cost effective but can also provide fast and accurate information gathering in remote and risky areas. Figure 9.1 depicts a typical sensor network architecture. The base station acts as a gateway for linking the sensors to multiple command nodes.The past few years have witnessed increased interest in the potential use of wireless sensor},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {article}
}
Advances in microelectronics have enabled the development of very tiny sensor nodes that have the ability of measuring ambient conditions such as temperature, pressure, humidity, light intensity, vibration, and so on. The sensed data can then be transmitted through an onboard radio transmitter to a single or multiple base stations where it can be further processed. The cost and size advantage of such emerging sensor nodes has encouraged practitioners to explore using them collaboratively in a network formed in ad hoc manner. Such networked sensor systems are not only cost effective but can also provide fast and accurate information gathering in remote and risky areas. Figure 9.1 depicts a typical sensor network architecture. The base station acts as a gateway for linking the sensors to multiple command nodes.The past few years have witnessed increased interest in the potential use of wireless sensor
22.
Kemal Akkaya, Srinivas Janapala
Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks Journal Article
In: Computer Networks, vol. 52, iss. 14, no. 14, pp. 2779–2796, 2008.
Abstract | Links | BibTeX | Tags: Node Placement
@article{nokey,
title = {Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks},
author = {Kemal Akkaya and Srinivas Janapala},
url = {https://www.sciencedirect.com/science/article/pii/S1389128608002053},
year = {2008},
date = {2008-10-09},
journal = {Computer Networks},
volume = {52},
number = {14},
issue = {14},
pages = {2779–2796},
publisher = {Elsevier},
school = {Florida International University},
abstract = {Wireless sensor and actor networks (WSANs) have recently emerged with the idea of combining wireless sensor networks (WSNs) and mobile ad hoc networks (MANETs). In addition to resource constrained sensors, resource rich and mobile actor nodes are employed in WSANs. These actors can collect data from the sensors and perform appropriate actions as a result of processing such data. To perform the actions at all parts of the region in a timely manner, the actors should be deployed in such a way that they might be able to communicate with each other and cover the whole monitored area. This requires that the actors should be placed carefully prior to network operation in order to maximize the coverage and maintain the inter-actor connectivity. In this paper, we propose a distributed actor deployment algorithm that strives to maximize the coverage of actors without violating the connectivity requirement. The},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {article}
}
Wireless sensor and actor networks (WSANs) have recently emerged with the idea of combining wireless sensor networks (WSNs) and mobile ad hoc networks (MANETs). In addition to resource constrained sensors, resource rich and mobile actor nodes are employed in WSANs. These actors can collect data from the sensors and perform appropriate actions as a result of processing such data. To perform the actions at all parts of the region in a timely manner, the actors should be deployed in such a way that they might be able to communicate with each other and cover the whole monitored area. This requires that the actors should be placed carefully prior to network operation in order to maximize the coverage and maintain the inter-actor connectivity. In this paper, we propose a distributed actor deployment algorithm that strives to maximize the coverage of actors without violating the connectivity requirement. The
23.
Mohamed Younis, Kemal Akkaya
Strategies and techniques for node placement in wireless sensor networks: A survey Journal Article
In: Ad Hoc Networks, vol. 6, iss. 4, no. 4, pp. 621–655, 2008.
Abstract | Links | BibTeX | Tags: Node Placement
@article{nokey,
title = {Strategies and techniques for node placement in wireless sensor networks: A survey},
author = {Mohamed Younis and Kemal Akkaya},
url = {https://www.sciencedirect.com/science/article/pii/S1570870507000984},
year = {2008},
date = {2008-06-01},
journal = {Ad Hoc Networks},
volume = {6},
number = {4},
issue = {4},
pages = {621–655},
publisher = {Elsevier},
school = {Florida International University},
abstract = {The major challenge in designing wireless sensor networks (WSNs) is the support of the functional, such as data latency, and the non-functional, such as data integrity, requirements while coping with the computation, energy and communication constraints. Careful node placement can be a very effective optimization means for achieving the desired design goals. In this paper, we report on the current state of the research on optimized node placement in WSNs. We highlight the issues, identify the various objectives and enumerate the different models and formulations. We categorize the placement strategies into static and dynamic depending on whether the optimization is performed at the time of deployment or while the network is operational, respectively. We further classify the published techniques based on the role that the node plays in the network and the primary performance objective considered. The paper},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {article}
}
The major challenge in designing wireless sensor networks (WSNs) is the support of the functional, such as data latency, and the non-functional, such as data integrity, requirements while coping with the computation, energy and communication constraints. Careful node placement can be a very effective optimization means for achieving the desired design goals. In this paper, we report on the current state of the research on optimized node placement in WSNs. We highlight the issues, identify the various objectives and enumerate the different models and formulations. We categorize the placement strategies into static and dynamic depending on whether the optimization is performed at the time of deployment or while the network is operational, respectively. We further classify the published techniques based on the role that the node plays in the network and the primary performance objective considered. The paper
24.
Kemal Akkaya, Mohamed Younis
Coverage and latency aware actor placement mechanisms in WSANs Journal Article
In: International Journal of Sensor Networks, vol. 3, iss. 3, no. 3, pp. 152–164, 2008.
Abstract | Links | BibTeX | Tags: Node Placement
@article{nokey,
title = {Coverage and latency aware actor placement mechanisms in WSANs},
author = {Kemal Akkaya and Mohamed Younis},
url = {https://www.inderscienceonline.com/doi/abs/10.1504/IJSNet.2008.018476},
year = {2008},
date = {2008-01-01},
journal = {International Journal of Sensor Networks},
volume = {3},
number = {3},
issue = {3},
pages = {152–164},
publisher = {Inderscience Publishers},
school = {Florida International University},
abstract = {In Wireless Sensor and Actor Networks (WSANs), responsiveness to serious events is of utmost importance and thus, minimal latency should be experienced. In addition, since these actions can be taken at any spot within the monitored area, the actors should provide maximal coverage of the area. In this paper, we propose two actor placement mechanisms for WSANs, namely COLA and COCOLA that consider both the delay requirements of data collection and the coverage of the area. COLA evenly distributes the actors in the region for maximised coverage first. Actors then collaboratively form clusters. Each individual actor repositions itself at a new location that enables minimal latency in collecting data in its cluster. COCOLA is an extension to COLA which additionally enforces connectivity among the actors by assigning appropriate locations to each actor for improved coverage and reduced latency. The},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {article}
}
In Wireless Sensor and Actor Networks (WSANs), responsiveness to serious events is of utmost importance and thus, minimal latency should be experienced. In addition, since these actions can be taken at any spot within the monitored area, the actors should provide maximal coverage of the area. In this paper, we propose two actor placement mechanisms for WSANs, namely COLA and COCOLA that consider both the delay requirements of data collection and the coverage of the area. COLA evenly distributes the actors in the region for maximised coverage first. Actors then collaboratively form clusters. Each individual actor repositions itself at a new location that enables minimal latency in collecting data in its cluster. COCOLA is an extension to COLA which additionally enforces connectivity among the actors by assigning appropriate locations to each actor for improved coverage and reduced latency. The
25.
Kemal Akkaya, Mohamed Younis, Waleed Youssef
Positioning of base stations in wireless sensor networks Proceedings Article
In: pp. 96–102, IEEE, 2007.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {Positioning of base stations in wireless sensor networks},
author = {Kemal Akkaya and Mohamed Younis and Waleed Youssef},
url = {https://ieeexplore.ieee.org/abstract/document/4149665/},
year = {2007},
date = {2007-04-16},
journal = {IEEE Communications Magazine},
volume = {45},
number = {4},
issue = {4},
pages = {96–102},
publisher = {IEEE},
school = {Florida International University},
abstract = {Wireless sensor networks (WSN) have attracted much attention in recent years due to their potential use in many applications such as border protection and combat field surveillance. Given the criticality of such applications, maintaining a dependable operation of the network is a fundamental objective. However, the resource-constrained nature of sensor nodes and the ad hoc formation of the network, often coupled with an unattended deployment, pose non-conventional challenges and motivate the need for special techniques for dependable design and management of WSN. In this article, we highlight the potential of careful positioning of the base station (BS), which acts as a sink node for the collected data, as a viable means for increasing the dependability of WSN. We categorize published work on optimal positioning of BS in WSN. Referring to such work as static positioning, we further introduce dynamic},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
Wireless sensor networks (WSN) have attracted much attention in recent years due to their potential use in many applications such as border protection and combat field surveillance. Given the criticality of such applications, maintaining a dependable operation of the network is a fundamental objective. However, the resource-constrained nature of sensor nodes and the ad hoc formation of the network, often coupled with an unattended deployment, pose non-conventional challenges and motivate the need for special techniques for dependable design and management of WSN. In this article, we highlight the potential of careful positioning of the base station (BS), which acts as a sink node for the collected data, as a viable means for increasing the dependability of WSN. We categorize published work on optimal positioning of BS in WSN. Referring to such work as static positioning, we further introduce dynamic
26.
Kemal Akkaya, Mohamed Younis
C2AP: Coverage-aware and connectivity-constrained actor positioning in wireless sensor and actor networks Proceedings Article
In: 2007 IEEE International Performance, Computing, and Communications Conference, pp. 281–288, IEEE, 2007.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {C2AP: Coverage-aware and connectivity-constrained actor positioning in wireless sensor and actor networks},
author = {Kemal Akkaya and Mohamed Younis},
url = {https://ieeexplore.ieee.org/abstract/document/4197941/},
year = {2007},
date = {2007-04-11},
booktitle = {2007 IEEE International Performance, Computing, and Communications Conference},
pages = {281–288},
publisher = {IEEE},
school = {Florida International University},
abstract = {In addition to the miniaturized sensor nodes, wireless sensor and actor networks (WSANs) employ significantly more capable actor nodes that can perform application specific actions to deal with events detected and reported by the sensors. Since these actions can be taken at any spot within the monitored area, the actors should be carefully placed in order to provide maximal coverage. Moreover, the actors often coordinate among themselves in order to arbitrate tasks and thus inter-actor connectivity is usually a requirement. In this paper, we propose a distributed actor positioning algorithm that maximizes the coverage of actors without violating the connectivity requirement. The approach applies repelling forces between neighboring actors, similar to molecular particles in Physics, in order to spread them in the region. However, the movement of each actor is restricted in order to maintain the connectivity of the inter},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
In addition to the miniaturized sensor nodes, wireless sensor and actor networks (WSANs) employ significantly more capable actor nodes that can perform application specific actions to deal with events detected and reported by the sensors. Since these actions can be taken at any spot within the monitored area, the actors should be carefully placed in order to provide maximal coverage. Moreover, the actors often coordinate among themselves in order to arbitrate tasks and thus inter-actor connectivity is usually a requirement. In this paper, we propose a distributed actor positioning algorithm that maximizes the coverage of actors without violating the connectivity requirement. The approach applies repelling forces between neighboring actors, similar to molecular particles in Physics, in order to spread them in the region. However, the movement of each actor is restricted in order to maintain the connectivity of the inter
27.
Kemal Akkaya, Mohamed Younis
COLA: A coverage and latency aware actor placement for wireless sensor and actor networks Proceedings Article
In: IEEE Vehicular Technology Conference, pp. 1–5, IEEE, 2006.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {COLA: A coverage and latency aware actor placement for wireless sensor and actor networks},
author = {Kemal Akkaya and Mohamed Younis},
url = {https://ieeexplore.ieee.org/abstract/document/4109809/},
year = {2006},
date = {2006-09-25},
booktitle = {IEEE Vehicular Technology Conference},
pages = {1–5},
publisher = {IEEE},
school = {Florida International University},
abstract = {In addition to the sensors, wireless sensor and actor networks (WSANs) employ significantly more capable actor nodes that can perform application specific actions. In these setups responsiveness to serious events is of utmost importance and thus requires minimal latency in both data gathering and action completion. In addition, since these actions are often taken at or close to where events are detected, which can be any spot within the monitored area, the actors should strive to provide maximal coverage of the area. In this paper, we propose COLA, an actor placement mechanism that considers both the delay requirements of data collection and the coverage. COLA first evenly distributes the actors in the region for maximized coverage. Actors then collaboratively partition the sensors, forming clusters. Each individual actor then repositions itself at a location that enables minimal latency in collecting data. The},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
In addition to the sensors, wireless sensor and actor networks (WSANs) employ significantly more capable actor nodes that can perform application specific actions. In these setups responsiveness to serious events is of utmost importance and thus requires minimal latency in both data gathering and action completion. In addition, since these actions are often taken at or close to where events are detected, which can be any spot within the monitored area, the actors should strive to provide maximal coverage of the area. In this paper, we propose COLA, an actor placement mechanism that considers both the delay requirements of data collection and the coverage. COLA first evenly distributes the actors in the region for maximized coverage. Actors then collaboratively partition the sensors, forming clusters. Each individual actor then repositions itself at a location that enables minimal latency in collecting data. The
28.
Kemal Akkaya, Mohamed Younis, Meenakshi Bangad
Sink repositioning for enhanced performance in wireless sensor networks Journal Article
In: Computer Networks, vol. 49, iss. 4, no. 4, pp. 512–534, 2005.
Abstract | Links | BibTeX | Tags: Node Placement
@article{nokey,
title = {Sink repositioning for enhanced performance in wireless sensor networks},
author = {Kemal Akkaya and Mohamed Younis and Meenakshi Bangad},
url = {https://www.sciencedirect.com/science/article/pii/S1389128605000459},
year = {2005},
date = {2005-11-15},
journal = {Computer Networks},
volume = {49},
number = {4},
issue = {4},
pages = {512–534},
publisher = {Elsevier},
school = {Florida International University},
abstract = {Most of the energy aware routing approaches for unattended wireless sensor networks pursue multi-hop paths in order to minimize the total transmission power. Since almost in all sensor networks data are routed towards a single sink (gateway), hops close to that sink become heavily involved in packet forwarding and thus their batteries get depleted rather quickly. In addition, the interest in optimizing the transmission energy tends to increase the levels of packet relaying and thus makes queuing delay an issue, especially for real-time traffic. In this paper we investigate the potential of gateway repositioning for enhanced network performance in terms of energy, delay and throughput. We address issues related to when should the gateway be relocated, where it would be moved to and how to handle its motion without negative effect on data traffic. We present two approaches that factor in the traffic pattern for},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {article}
}
Most of the energy aware routing approaches for unattended wireless sensor networks pursue multi-hop paths in order to minimize the total transmission power. Since almost in all sensor networks data are routed towards a single sink (gateway), hops close to that sink become heavily involved in packet forwarding and thus their batteries get depleted rather quickly. In addition, the interest in optimizing the transmission energy tends to increase the levels of packet relaying and thus makes queuing delay an issue, especially for real-time traffic. In this paper we investigate the potential of gateway repositioning for enhanced network performance in terms of energy, delay and throughput. We address issues related to when should the gateway be relocated, where it would be moved to and how to handle its motion without negative effect on data traffic. We present two approaches that factor in the traffic pattern for
29.
Mohamed Younis, Meenakshi Bangad, Kemal Akkaya
Base-station repositioning for optimized performance of sensor networks Proceedings Article
In: 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No. 03CH37484), pp. 2956–2960, IEEE, 2003.
Abstract | Links | BibTeX | Tags: Node Placement
@inproceedings{nokey,
title = {Base-station repositioning for optimized performance of sensor networks},
author = {Mohamed Younis and Meenakshi Bangad and Kemal Akkaya},
url = {https://ieeexplore.ieee.org/abstract/document/1286165/},
year = {2003},
date = {2003-10-06},
booktitle = {2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No. 03CH37484)},
volume = {5},
pages = {2956–2960},
publisher = {IEEE},
school = {Florida International University},
abstract = {Most of the energy aware routing approaches for unattended wireless sensor networks pursue multi-hop paths in order to minimize the total transmission power. Since almost in all sensor networks data are routed towards a single sink (base-station), hops close to that sink become heavily involved in packet forwarding and thus their batteries get depleted rather quickly. In this paper we investigate the potential of base-station repositioning for enhanced network performance. We address issues related to when should the base-station be relocated, where it would be moved to and how to handle its motion without any effect on data traffic. Our approach tracks the distance from the closest hops to the base-station and the traffic density through these hops. When a hop that forward high traffic is further than a threshold the base-station qualifies the impact of the relocation on the network performance and moves if the},
keywords = {Node Placement},
pubstate = {published},
tppubtype = {inproceedings}
}
Most of the energy aware routing approaches for unattended wireless sensor networks pursue multi-hop paths in order to minimize the total transmission power. Since almost in all sensor networks data are routed towards a single sink (base-station), hops close to that sink become heavily involved in packet forwarding and thus their batteries get depleted rather quickly. In this paper we investigate the potential of base-station repositioning for enhanced network performance. We address issues related to when should the base-station be relocated, where it would be moved to and how to handle its motion without any effect on data traffic. Our approach tracks the distance from the closest hops to the base-station and the traffic density through these hops. When a hop that forward high traffic is further than a threshold the base-station qualifies the impact of the relocation on the network performance and moves if the
Citations: 18671
h-index: 54
i10-index: 162