default search action
Mohammad Masud Hasan
Person information
- affiliation: Elizabeth City State University, NC, USA
- affiliation (PhD 2010): University of Texas at Dallas, Richardson, TX, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j7]Mohammad Masud Hasan, Farid Farahmand
, Jason P. Jue:
k-Connected Network Partitioning Under Shared Risk Link Groups. JOCN 7(8): 695-706 (2015) - 2013
- [j6]Chengyi Gao, Mohammad Masud Hasan, Jason P. Jue:
Domain-Disjoint Routing Based on Topology Aggregation for Survivable Multidomain Optical Networks. JOCN 5(12): 1382-1390 (2013) - [j5]Mohammad Masud Hasan, Farid Farahmand
A Study of Energy-Aware Traffic Grooming in Optical Networks: Static and Dynamic Cases. IEEE Syst. J. 7(1): 161-173 (2013) - [j4]Mohammad Masud Hasan, Xiaodong Huang, Jason P. Jue:
Coordinated dual-homing in designing hierarchical wireless access network with a genetic algorithm based approach. Telecommun. Syst. 54(4): 417-431 (2013) - 2011
- [j3]Mohammad Masud Hasan, Ravi Prakash
Parallel and Gaussian frequency hopping for dynamic coexistence in the unlicensed band. Int. J. Commun. Syst. 24(9): 1163-1182 (2011) - [j2]Mohammad Masud Hasan, Jason P. Jue:
Survivable Self-Organization for Prolonged Lifetime in Wireless Sensor Networks. Int. J. Distributed Sens. Networks 7(1) (2011) - [c10]Chengyi Gao, Mohammad Masud Hasan, Jason P. Jue:
Domain-Disjoint Routing Based on Topology Aggregation for Survivable Multi-Domain Optical Networks. GLOBECOM 2011: 1-5 - [c9]Farid Farahmand
Power Reduction in WDM Mesh Networks Using Grooming Strategies. GreeNets 2011: 99-113 - [c8]Farid Farahmand
Power-Efficient Lightpath-Based Grooming Strategies in WDM Mesh Networks. ICCCN 2011: 1-6 - 2010
- [c7]Farid Farahmand
Differentiated Energy Savings in Optical Networks with Grooming Capabilities. GLOBECOM 2010: 1-5 - [c6]Mohammad Masud Hasan, Jason P. Jue:
2-SRLG-connected partitioning in optical networks. HPSR 2010: 183-188 - [c5]Mohammad Masud Hasan, Farid Farahmand
Traffic Grooming in Green Optical Networks. ICC 2010: 1-5
2000 – 2009
- 2009
- [j1]Mohammad Masud Hasan, Jason P. Jue:
Online Partitioning for Scalable and Survivable Optical Networks. JOCN 1(2): A133-A142 (2009) - [c4]Mohammad Masud Hasan, Ravi Prakash
Dynamic Coexistence of Frequency Hopping Networks Using Parallel and Gaussian Allocations. ICC 2009: 1-5 - 2008
- [c3]Mohammad Masud Hasan, Jason P. Jue:
Clustering Large Optical Networks for Distributed and Dynamic Multicast. ICC 2008: 5263-5267 - 2007
- [c2]Mohammad Masud Hasan, Jason P. Jue:
Resource Efficient Survivable Clustering for Wireless Sensor Networks. GLOBECOM 2007: 1154-1158 - 2006
- [c1]Mohammad Masud Hasan, Xiaodong Huang, Jason P. Jue:
Survivable Wireless Access Network Design with Dual-homing Capabilities. GLOBECOM 2006
Coauthor Index
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-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: