SEAD is a scalable, energy-efficient asynchronous dissemination protocol for wireless sensor networks (WSNs) designed to minimize energy consumption in building and maintaining dissemination trees to mobile sinks. The protocol considers node distance and packet traffic rates to create near-optimal dissemination trees. Mobile sinks can move without reporting their locations to the tree while receiving data updates successfully. SEAD outperforms existing approaches like directed diffusion, TTDD, and mobile ad hoc multicast in energy efficiency for disseminating data to multiple mobile sinks. SEAD constructs and maintains a dynamic dissemination tree (d-tree) by selecting optimal replicas and access nodes. It uses geographic distance to estimate hop count and energy cost, and avoids flooding to reduce energy consumption. The protocol dynamically adjusts the tree based on sink mobility and node failures, ensuring efficient data dissemination. SEAD also handles sink mobility by adjusting access nodes when the distance between the sink and its access node exceeds a threshold. SEAD's algorithm includes four phases: subscription query, gate replica search, replica placement, and d-tree management. The gate replica search identifies the optimal replica to connect to the access node, minimizing energy cost. Replica placement adjusts the tree locally to optimize energy consumption. The d-tree management ensures connectivity between mobile sinks and their access nodes, adjusting the tree as needed. SEAD's performance is evaluated through simulations, showing it consumes less energy than other protocols for data dissemination and sink mobility management. It achieves a balance between energy savings and end-to-end delay, making it suitable for applications with less strict delay requirements. SEAD is particularly effective in dense networks and handles mobility efficiently without excessive tree restructuring. The protocol is designed to minimize energy consumption, making it suitable for extending the lifetime of sensor networks.SEAD is a scalable, energy-efficient asynchronous dissemination protocol for wireless sensor networks (WSNs) designed to minimize energy consumption in building and maintaining dissemination trees to mobile sinks. The protocol considers node distance and packet traffic rates to create near-optimal dissemination trees. Mobile sinks can move without reporting their locations to the tree while receiving data updates successfully. SEAD outperforms existing approaches like directed diffusion, TTDD, and mobile ad hoc multicast in energy efficiency for disseminating data to multiple mobile sinks. SEAD constructs and maintains a dynamic dissemination tree (d-tree) by selecting optimal replicas and access nodes. It uses geographic distance to estimate hop count and energy cost, and avoids flooding to reduce energy consumption. The protocol dynamically adjusts the tree based on sink mobility and node failures, ensuring efficient data dissemination. SEAD also handles sink mobility by adjusting access nodes when the distance between the sink and its access node exceeds a threshold. SEAD's algorithm includes four phases: subscription query, gate replica search, replica placement, and d-tree management. The gate replica search identifies the optimal replica to connect to the access node, minimizing energy cost. Replica placement adjusts the tree locally to optimize energy consumption. The d-tree management ensures connectivity between mobile sinks and their access nodes, adjusting the tree as needed. SEAD's performance is evaluated through simulations, showing it consumes less energy than other protocols for data dissemination and sink mobility management. It achieves a balance between energy savings and end-to-end delay, making it suitable for applications with less strict delay requirements. SEAD is particularly effective in dense networks and handles mobility efficiently without excessive tree restructuring. The protocol is designed to minimize energy consumption, making it suitable for extending the lifetime of sensor networks.