{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/a-novel-energy-aware-node-clustering","title":"A Novel Energy Aware Node Clustering Algorithm for Wireless Sensor Networks Using a Modified Artificial Fish Swarm Algorithm","arxiv_id":"1506.00099","date":"2015-05-30","proceeding":null,"authors":["Reza Azizi","Hasan Sedghi","Hamid Shoja","Alireza Sepas-Moghaddam"],"abstract":"Clustering problems are considered amongst the prominent challenges in\nstatistics and computational science. Clustering of nodes in wireless sensor\nnetworks which is used to prolong the life-time of networks is one of the\ndifficult tasks of clustering procedure. In order to perform nodes clustering,\na number of nodes are determined as cluster heads and other ones are joined to\none of these heads, based on different criteria e.g. Euclidean distance. So\nfar, different approaches have been proposed for this process, where swarm and\nevolutionary algorithms contribute in this regard. In this study, a novel\nalgorithm is proposed based on Artificial Fish Swarm Algorithm (AFSA) for\nclustering procedure. In the proposed method, the performance of the standard\nAFSA is improved by increasing balance between local and global searches.\nFurthermore, a new mechanism has been added to the base algorithm for improving\nconvergence speed in clustering problems. Performance of the proposed technique\nis compared to a number of state-of-the-art techniques in this field and the\noutcomes indicate the supremacy of the proposed technique.","url_abs":"http://arxiv.org/abs/1506.00099v1","url_pdf":"http://arxiv.org/pdf/1506.00099v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-novel-energy-aware-node-clustering","repo_url":"https://github.com/nafiuny/AFSA-algorithm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"evolutionary-algorithms","task_name":"Evolutionary Algorithms"},{"task_slug":"node-clustering","task_name":"Node Clustering"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"nafiuny/AFSA-algorithm","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"69966b076c2afb8e3507682055938fdbd891001e4a12cf4994bb4a1562da45f6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}