![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Hanan Shpungin
Person information
- affiliation: University of Calgary, Canada
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j13]Liron Levin, Michael Segal
, Hanan Shpungin:
Interference-free energy efficient scheduling in wireless ad hoc networks. Ad Hoc Networks 11(1): 201-212 (2013) - [j12]Shlomi Dolev
, Michael Segal
, Hanan Shpungin:
Bounded-Hop Energy-Efficient Liveness of Flocking Swarms. IEEE Trans. Mob. Comput. 12(3): 516-528 (2013) - [j11]Hanan Shpungin, Michael Segal
:
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics. ACM Trans. Sens. Networks 9(4): 37:1-37:25 (2013) - [j10]Liron Levin, Michael Segal
, Hanan Shpungin:
Cooperative data collection in ad hoc networks. Wirel. Networks 19(2): 145-159 (2013) - [c16]Vitaly Milyeykovski, Michael Segal, Hanan Shpungin:
Location, location, location: Using central nodes for efficient data collection in WSNs. WiOpt 2013: 333-340 - 2012
- [j9]Hanan Shpungin, Zongpeng Li:
Throughput and Energy Efficiency in Wireless Ad Hoc Networks With Gaussian Channels. IEEE/ACM Trans. Netw. 20(1): 15-28 (2012) - 2011
- [j8]Ashikur Rahman
, Hanan Shpungin, Carey Williamson:
Poster: on capacity maximization in wireless relay networks. SIGMETRICS Perform. Evaluation Rev. 39(2): 76 (2011) - [j7]Michael Elkin, Yuval Lando, Zeev Nutov, Michael Segal, Hanan Shpungin:
Novel algorithms for the network lifetime problem in wireless settings. Wirel. Networks 17(2): 397-410 (2011) - [c15]Liron Levin, Michael Segal
, Hanan Shpungin:
Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks. FOMC 2011: 62-69 - [c14]Hanan Shpungin, Zongpeng Li:
Feasible Capacity of Distributed Beamforming in Multi-Hop Wireless Sensor Networks. MASS 2011: 19-24 - [c13]Hanan Shpungin:
Energy efficient online routing in wireless ad hoc networks. SECON 2011: 64-72 - [c12]Hanan Shpungin, Ajay Gopinathan, Zongpeng Li:
Capacity bounds for energy efficient data streaming in homogeneous wireless ad hoc networks. SECON 2011: 269-277 - [c11]Liron Levin, Michael Segal
, Hanan Shpungin:
Interference-free energy efficient scheduling in wireless ad hoc networks. WiOpt 2011: 41-48 - 2010
- [j6]Daniel Berend, Michael Segal, Hanan Shpungin:
Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks. Ad Hoc Sens. Wirel. Networks 10(1): 61-87 (2010) - [j5]Hanan Shpungin, Michael Segal
:
Near-Optimal Multicriteria Spanner Constructions in Wireless Ad Hoc Networks. IEEE/ACM Trans. Netw. 18(6): 1963-1976 (2010) - [j4]Hanan Shpungin, Michael Segal
:
On minimizing the total power of k-strongly connected wireless networks. Wirel. Networks 16(4): 1075-1089 (2010) - [c10]Michael Segal
, Hanan Shpungin:
Improved Multi-criteria Spanners for Ad-Hoc Networks Under Energy and Distance Metrics. INFOCOM 2010: 6-10 - [c9]Hanan Shpungin, Zongpeng Li:
Throughput and Energy Efficiency in Wireless Ad Hoc Networks with Gaussian Channels. SECON 2010: 154-162 - [c8]Liron Levin, Michael Segal, Hanan Shpungin:
Optimizing performance of ad-hoc networks under energy and scheduling constraints. WiOpt 2010: 11-20 - [c7]Shlomi Dolev, Michael Segal, Hanan Shpungin:
Bounded-hop strong connectivity for flocking swarms. WiOpt 2010: 177-185
2000 – 2009
- 2009
- [j3]Michael Segal
, Hanan Shpungin:
On construction of minimum energy k-fault resistant topologies. Ad Hoc Networks 7(2): 363-373 (2009) - [j2]Hanan Shpungin, Michael Segal:
Low-energy fault-tolerant bounded-hop broadcast in wireless networks. IEEE/ACM Trans. Netw. 17(2): 582-590 (2009) - [c6]Hanan Shpungin, Michael Segal
:
Near Optimal Multicriteria Spanner Constructions in Wireless Ad-Hoc Networks. INFOCOM 2009: 163-171 - 2008
- [c5]Michael Elkin, Yuval Lando, Zeev Nutov, Michael Segal, Hanan Shpungin:
Novel Algorithms for the Network Lifetime Problem in Wireless Settings. ADHOC-NOW 2008: 425-438 - [c4]Daniel Berend
, Michael Segal
, Hanan Shpungin:
Power efficient resilience and lifetime in wireless ad-hoc networks. FOWANC 2008: 17-24 - 2007
- [j1]Paz Carmi, Matthew J. Katz, Michael Segal, Hanan Shpungin:
Fault-Tolerant Power Assignment and Backbone in Wireless Networks. Ad Hoc Sens. Wirel. Networks 4(4): 355-366 (2007) - [c3]Hanan Shpungin, Michael Segal:
Low Energy Construction of Fault Tolerant Topologies in Wireless Networks. DIALM-POMC 2007 - 2006
- [c2]Paz Carmi, Michael Segal
, Matthew J. Katz, Hanan Shpungin:
Fault-Tolerant Power Assignment and Backbone in Wireless Networks. PerCom Workshops 2006: 80-84 - 2005
- [c1]Hanan Shpungin, Michael Segal
:
k-fault resistance in wireless ad-hoc networks. DIALM-POMC 2005: 89-96
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint